From ea34fbb84319baef8d4b5976651c1e560a33858c 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: Tue, 12 Jul 2022 21:08:31 +0800 Subject: [PATCH] update --- README.md | 2 +- leetcode-cn/origin-data.json | 15142 ++++++++-------- ...nd-minimum-time-to-finish-all-jobs-ii.json | 68 + ...[no content]product-sales-analysis-iv.json | 67 + .../[no content]product-sales-analysis-v.json | 59 + .../[no content]valid-palindrome-iv.json | 49 + leetcode-cn/originData/array-partition.json | 191 + .../count-the-number-of-ideal-arrays.json | 165 + .../originData/decode-the-message.json | 178 + .../evaluate-boolean-binary-tree.json | 164 + .../minimum-amount-of-time-to-fill-cups.json | 164 + .../minimum-sum-of-squared-difference.json | 165 + .../move-pieces-to-obtain-a-string.json | 164 + .../number-of-increasing-paths-in-a-grid.json | 213 + .../number-of-people-aware-of-a-secret.json | 184 + .../smallest-number-in-infinite-set.json | 164 + leetcode-cn/originData/spiral-matrix-iv.json | 190 + ...ements-greater-than-varying-threshold.json | 165 + .../the-latest-time-to-catch-a-bus.json | 164 + ...rray-with-elements-greater-than-varying-threshold].html | 35 + ...最晚时间 [the-latest-time-to-catch-a-bus].html | 43 + .../数组拆分 [array-partition].html | 34 + ...最小数字 [smallest-number-in-infinite-set].html | 40 + ...方和 [minimum-sum-of-squared-difference].html | 41 + ...人数 [number-of-people-aware-of-a-secret].html | 40 + ...到字符串 [move-pieces-to-obtain-a-string].html | 45 + ...的数目 [count-the-number-of-ideal-arrays].html | 48 + ...的数目 [number-of-increasing-paths-in-a-grid].html | 42 + .../螺旋矩阵 IV [spiral-matrix-iv].html | 35 + ...总时长 [minimum-amount-of-time-to-fill-cups].html | 47 + .../解密消息 [decode-the-message].html | 50 + ...二叉树的值 [evaluate-boolean-binary-tree].html | 51 + ...rray-with-elements-greater-than-varying-threshold].html | 35 + ...间(English) [the-latest-time-to-catch-a-bus].html | 43 + .../数组拆分(English) [array-partition].html | 30 + ...字(English) [smallest-number-in-infinite-set].html | 40 + ...English) [minimum-sum-of-squared-difference].html | 41 + ...nglish) [number-of-people-aware-of-a-secret].html | 40 + ...串(English) [move-pieces-to-obtain-a-string].html | 46 + ...(English) [count-the-number-of-ideal-arrays].html | 48 + ...(English) [number-of-increasing-paths-in-a-grid].html | 40 + ...旋矩阵 IV(English) [spiral-matrix-iv].html | 35 + ...(English) [minimum-amount-of-time-to-fill-cups].html | 48 + ...密消息(English) [decode-the-message].html | 44 + ...的值(English) [evaluate-boolean-binary-tree].html | 49 + leetcode/origin-data.json | 9676 +++++----- ...nd-minimum-time-to-finish-all-jobs-ii.json | 65 + ...[no content]product-sales-analysis-iv.json | 64 + .../[no content]product-sales-analysis-v.json | 56 + .../[no content]valid-palindrome-iv.json | 46 + leetcode/originData/array-partition.json | 189 + .../count-the-number-of-ideal-arrays.json | 156 + leetcode/originData/decode-the-message.json | 169 + .../evaluate-boolean-binary-tree.json | 155 + .../minimum-amount-of-time-to-fill-cups.json | 155 + .../minimum-sum-of-squared-difference.json | 156 + .../move-pieces-to-obtain-a-string.json | 155 + .../number-of-increasing-paths-in-a-grid.json | 204 + .../number-of-people-aware-of-a-secret.json | 175 + .../smallest-number-in-infinite-set.json | 155 + leetcode/originData/spiral-matrix-iv.json | 181 + ...ements-greater-than-varying-threshold.json | 156 + .../the-latest-time-to-catch-a-bus.json | 155 + leetcode/problem/array-partition.html | 30 + .../count-the-number-of-ideal-arrays.html | 48 + leetcode/problem/decode-the-message.html | 44 + .../problem/evaluate-boolean-binary-tree.html | 49 + .../minimum-amount-of-time-to-fill-cups.html | 48 + .../minimum-sum-of-squared-difference.html | 41 + .../move-pieces-to-obtain-a-string.html | 46 + .../number-of-increasing-paths-in-a-grid.html | 40 + .../number-of-people-aware-of-a-secret.html | 40 + .../smallest-number-in-infinite-set.html | 40 + leetcode/problem/spiral-matrix-iv.html | 35 + ...ements-greater-than-varying-threshold.html | 35 + .../the-latest-time-to-catch-a-bus.html | 43 + 76 files changed, 19297 insertions(+), 12058 deletions(-) create mode 100644 leetcode-cn/originData/[no content]find-minimum-time-to-finish-all-jobs-ii.json create mode 100644 leetcode-cn/originData/[no content]product-sales-analysis-iv.json create mode 100644 leetcode-cn/originData/[no content]product-sales-analysis-v.json create mode 100644 leetcode-cn/originData/[no content]valid-palindrome-iv.json create mode 100644 leetcode-cn/originData/array-partition.json create mode 100644 leetcode-cn/originData/count-the-number-of-ideal-arrays.json create mode 100644 leetcode-cn/originData/decode-the-message.json create mode 100644 leetcode-cn/originData/evaluate-boolean-binary-tree.json create mode 100644 leetcode-cn/originData/minimum-amount-of-time-to-fill-cups.json create mode 100644 leetcode-cn/originData/minimum-sum-of-squared-difference.json create mode 100644 leetcode-cn/originData/move-pieces-to-obtain-a-string.json create mode 100644 leetcode-cn/originData/number-of-increasing-paths-in-a-grid.json create mode 100644 leetcode-cn/originData/number-of-people-aware-of-a-secret.json create mode 100644 leetcode-cn/originData/smallest-number-in-infinite-set.json create mode 100644 leetcode-cn/originData/spiral-matrix-iv.json create mode 100644 leetcode-cn/originData/subarray-with-elements-greater-than-varying-threshold.json create mode 100644 leetcode-cn/originData/the-latest-time-to-catch-a-bus.json create mode 100644 leetcode-cn/problem (Chinese)/元素值大于变化阈值的子数组 [subarray-with-elements-greater-than-varying-threshold].html create mode 100644 leetcode-cn/problem (Chinese)/坐上公交的最晚时间 [the-latest-time-to-catch-a-bus].html create mode 100644 leetcode-cn/problem (Chinese)/数组拆分 [array-partition].html create mode 100644 leetcode-cn/problem (Chinese)/无限集中的最小数字 [smallest-number-in-infinite-set].html create mode 100644 leetcode-cn/problem (Chinese)/最小差值平方和 [minimum-sum-of-squared-difference].html create mode 100644 leetcode-cn/problem (Chinese)/知道秘密的人数 [number-of-people-aware-of-a-secret].html create mode 100644 leetcode-cn/problem (Chinese)/移动片段得到字符串 [move-pieces-to-obtain-a-string].html create mode 100644 leetcode-cn/problem (Chinese)/统计理想数组的数目 [count-the-number-of-ideal-arrays].html create mode 100644 leetcode-cn/problem (Chinese)/网格图中递增路径的数目 [number-of-increasing-paths-in-a-grid].html create mode 100644 leetcode-cn/problem (Chinese)/螺旋矩阵 IV [spiral-matrix-iv].html create mode 100644 leetcode-cn/problem (Chinese)/装满杯子需要的最短总时长 [minimum-amount-of-time-to-fill-cups].html create mode 100644 leetcode-cn/problem (Chinese)/解密消息 [decode-the-message].html create mode 100644 leetcode-cn/problem (Chinese)/计算布尔二叉树的值 [evaluate-boolean-binary-tree].html create mode 100644 leetcode-cn/problem (English)/元素值大于变化阈值的子数组(English) [subarray-with-elements-greater-than-varying-threshold].html create mode 100644 leetcode-cn/problem (English)/坐上公交的最晚时间(English) [the-latest-time-to-catch-a-bus].html create mode 100644 leetcode-cn/problem (English)/数组拆分(English) [array-partition].html create mode 100644 leetcode-cn/problem (English)/无限集中的最小数字(English) [smallest-number-in-infinite-set].html create mode 100644 leetcode-cn/problem (English)/最小差值平方和(English) [minimum-sum-of-squared-difference].html create mode 100644 leetcode-cn/problem (English)/知道秘密的人数(English) [number-of-people-aware-of-a-secret].html create mode 100644 leetcode-cn/problem (English)/移动片段得到字符串(English) [move-pieces-to-obtain-a-string].html create mode 100644 leetcode-cn/problem (English)/统计理想数组的数目(English) [count-the-number-of-ideal-arrays].html create mode 100644 leetcode-cn/problem (English)/网格图中递增路径的数目(English) [number-of-increasing-paths-in-a-grid].html create mode 100644 leetcode-cn/problem (English)/螺旋矩阵 IV(English) [spiral-matrix-iv].html create mode 100644 leetcode-cn/problem (English)/装满杯子需要的最短总时长(English) [minimum-amount-of-time-to-fill-cups].html create mode 100644 leetcode-cn/problem (English)/解密消息(English) [decode-the-message].html create mode 100644 leetcode-cn/problem (English)/计算布尔二叉树的值(English) [evaluate-boolean-binary-tree].html create mode 100644 leetcode/originData/[no content]find-minimum-time-to-finish-all-jobs-ii.json create mode 100644 leetcode/originData/[no content]product-sales-analysis-iv.json create mode 100644 leetcode/originData/[no content]product-sales-analysis-v.json create mode 100644 leetcode/originData/[no content]valid-palindrome-iv.json create mode 100644 leetcode/originData/array-partition.json create mode 100644 leetcode/originData/count-the-number-of-ideal-arrays.json create mode 100644 leetcode/originData/decode-the-message.json create mode 100644 leetcode/originData/evaluate-boolean-binary-tree.json create mode 100644 leetcode/originData/minimum-amount-of-time-to-fill-cups.json create mode 100644 leetcode/originData/minimum-sum-of-squared-difference.json create mode 100644 leetcode/originData/move-pieces-to-obtain-a-string.json create mode 100644 leetcode/originData/number-of-increasing-paths-in-a-grid.json create mode 100644 leetcode/originData/number-of-people-aware-of-a-secret.json create mode 100644 leetcode/originData/smallest-number-in-infinite-set.json create mode 100644 leetcode/originData/spiral-matrix-iv.json create mode 100644 leetcode/originData/subarray-with-elements-greater-than-varying-threshold.json create mode 100644 leetcode/originData/the-latest-time-to-catch-a-bus.json create mode 100644 leetcode/problem/array-partition.html create mode 100644 leetcode/problem/count-the-number-of-ideal-arrays.html create mode 100644 leetcode/problem/decode-the-message.html create mode 100644 leetcode/problem/evaluate-boolean-binary-tree.html create mode 100644 leetcode/problem/minimum-amount-of-time-to-fill-cups.html create mode 100644 leetcode/problem/minimum-sum-of-squared-difference.html create mode 100644 leetcode/problem/move-pieces-to-obtain-a-string.html create mode 100644 leetcode/problem/number-of-increasing-paths-in-a-grid.html create mode 100644 leetcode/problem/number-of-people-aware-of-a-secret.html create mode 100644 leetcode/problem/smallest-number-in-infinite-set.html create mode 100644 leetcode/problem/spiral-matrix-iv.html create mode 100644 leetcode/problem/subarray-with-elements-greater-than-varying-threshold.html create mode 100644 leetcode/problem/the-latest-time-to-catch-a-bus.html diff --git a/README.md b/README.md index dd060fa2..8a5f5f6e 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # 力扣题库(完整版) -> 最后更新日期: **2022.06.29** +> 最后更新日期: **2022.06.12** > > 使用脚本前请务必仔细完整阅读本 `README.md` 文件 diff --git a/leetcode-cn/origin-data.json b/leetcode-cn/origin-data.json index ccd7e415..12e5e0f3 100644 --- a/leetcode-cn/origin-data.json +++ b/leetcode-cn/origin-data.json @@ -1,7 +1,7 @@ { "user_name": "", "num_solved": 0, - "num_total": 2688, + "num_total": 2704, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, @@ -12,8 +12,8 @@ "question__title": "积木拼接", "question__title_slug": "De4qBB", "question__hide": false, - "total_acs": 242, - "total_submitted": 884, + "total_acs": 245, + "total_submitted": 890, "total_column_articles": 12, "frontend_question_id": "LCP 58", "is_new_question": false @@ -33,8 +33,8 @@ "question__title": "力扣泡泡龙", "question__title_slug": "WInSav", "question__hide": false, - "total_acs": 374, - "total_submitted": 2166, + "total_acs": 383, + "total_submitted": 2230, "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": 105, - "total_submitted": 409, + "total_acs": 110, + "total_submitted": 426, "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": 1336, - "total_submitted": 5490, - "total_column_articles": 32, + "total_acs": 1372, + "total_submitted": 5611, + "total_column_articles": 33, "frontend_question_id": "LCP 57", "is_new_question": false }, @@ -96,8 +96,8 @@ "question__title": "信物传送", "question__title_slug": "6UEx57", "question__hide": false, - "total_acs": 1660, - "total_submitted": 4493, + "total_acs": 1700, + "total_submitted": 4568, "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": 2935, - "total_submitted": 3987, - "total_column_articles": 39, + "total_acs": 3038, + "total_submitted": 4140, + "total_column_articles": 40, "frontend_question_id": "LCP 55", "is_new_question": false }, @@ -138,8 +138,8 @@ "question__title": "夺回据点", "question__title_slug": "s5kipK", "question__hide": false, - "total_acs": 286, - "total_submitted": 862, + "total_acs": 291, + "total_submitted": 882, "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": 723, - "total_submitted": 1808, + "total_acs": 730, + "total_submitted": 1817, "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": 2751, - "total_submitted": 11271, - "total_column_articles": 74, + "total_acs": 2790, + "total_submitted": 11352, + "total_column_articles": 75, "frontend_question_id": "LCP 52", "is_new_question": false }, @@ -201,9 +201,9 @@ "question__title": "烹饪料理", "question__title_slug": "UEcfPD", "question__hide": false, - "total_acs": 3831, - "total_submitted": 8365, - "total_column_articles": 67, + "total_acs": 3900, + "total_submitted": 8481, + "total_column_articles": 71, "frontend_question_id": "LCP 51", "is_new_question": false }, @@ -222,9 +222,9 @@ "question__title": "宝石补给", "question__title_slug": "WHnhjV", "question__hide": false, - "total_acs": 5410, - "total_submitted": 8098, - "total_column_articles": 54, + "total_acs": 5517, + "total_submitted": 8243, + "total_column_articles": 56, "frontend_question_id": "LCP 50", "is_new_question": false }, @@ -243,9 +243,9 @@ "question__title": "自行车炫技赛场", "question__title_slug": "kplEvH", "question__hide": false, - "total_acs": 1761, - "total_submitted": 7167, - "total_column_articles": 38, + "total_acs": 1792, + "total_submitted": 7234, + "total_column_articles": 40, "frontend_question_id": "LCP 45", "is_new_question": false }, @@ -264,9 +264,9 @@ "question__title": "无限棋局", "question__title_slug": "fsa7oZ", "question__hide": false, - "total_acs": 607, - "total_submitted": 2638, - "total_column_articles": 14, + "total_acs": 609, + "total_submitted": 2707, + "total_column_articles": 15, "frontend_question_id": "LCP 48", "is_new_question": false }, @@ -285,8 +285,8 @@ "question__title": "志愿者调配", "question__title_slug": "05ZEDJ", "question__hide": false, - "total_acs": 1338, - "total_submitted": 3041, + "total_acs": 1362, + "total_submitted": 3087, "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": 1675, - "total_submitted": 6746, + "total_acs": 1686, + "total_submitted": 6802, "total_column_articles": 36, "frontend_question_id": "LCP 42", "is_new_question": false @@ -327,8 +327,8 @@ "question__title": "黑白翻转棋", "question__title_slug": "fHi6rV", "question__hide": false, - "total_acs": 1875, - "total_submitted": 4015, + "total_acs": 1897, + "total_submitted": 4047, "total_column_articles": 40, "frontend_question_id": "LCP 41", "is_new_question": false @@ -348,8 +348,8 @@ "question__title": "无人机方阵", "question__title_slug": "0jQkd0", "question__hide": false, - "total_acs": 5793, - "total_submitted": 10971, + "total_acs": 5887, + "total_submitted": 11142, "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": 5383, - "total_submitted": 19050, - "total_column_articles": 106, + "total_acs": 5559, + "total_submitted": 19484, + "total_column_articles": 109, "frontend_question_id": "LCP 40", "is_new_question": false }, @@ -390,9 +390,9 @@ "question__title": "十字路口的交通", "question__title_slug": "Y1VbOX", "question__hide": false, - "total_acs": 661, - "total_submitted": 1387, - "total_column_articles": 22, + "total_acs": 664, + "total_submitted": 1395, + "total_column_articles": 23, "frontend_question_id": "LCP 43", "is_new_question": false }, @@ -411,9 +411,9 @@ "question__title": "开幕式焰火", "question__title_slug": "sZ59z6", "question__hide": false, - "total_acs": 8907, - "total_submitted": 11159, - "total_column_articles": 125, + "total_acs": 9150, + "total_submitted": 11477, + "total_column_articles": 129, "frontend_question_id": "LCP 44", "is_new_question": false }, @@ -432,9 +432,9 @@ "question__title": "入场安检", "question__title_slug": "oPs9Bm", "question__hide": false, - "total_acs": 1231, - "total_submitted": 3006, - "total_column_articles": 22, + "total_acs": 1235, + "total_submitted": 3017, + "total_column_articles": 23, "frontend_question_id": "LCP 47", "is_new_question": false }, @@ -453,9 +453,9 @@ "question__title": "环形闯关游戏", "question__title_slug": "K8GULz", "question__hide": false, - "total_acs": 608, - "total_submitted": 2038, - "total_column_articles": 17, + "total_acs": 627, + "total_submitted": 2076, + "total_column_articles": 18, "frontend_question_id": "LCP 49", "is_new_question": false }, @@ -474,9 +474,9 @@ "question__title": "省份数量", "question__title_slug": "bLyHh0", "question__hide": false, - "total_acs": 12424, - "total_submitted": 18435, - "total_column_articles": 151, + "total_acs": 12978, + "total_submitted": 19241, + "total_column_articles": 152, "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": 10809, - "total_submitted": 13966, - "total_column_articles": 140, + "total_acs": 11341, + "total_submitted": 14606, + "total_column_articles": 141, "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": 14626, - "total_submitted": 17521, - "total_column_articles": 130, + "total_acs": 15358, + "total_submitted": 18398, + "total_column_articles": 137, "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": 16254, - "total_submitted": 18966, - "total_column_articles": 204, + "total_acs": 17130, + "total_submitted": 19945, + "total_column_articles": 214, "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": 15432, - "total_submitted": 24203, - "total_column_articles": 176, + "total_acs": 16132, + "total_submitted": 25295, + "total_column_articles": 183, "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": 20614, - "total_submitted": 33291, - "total_column_articles": 230, + "total_acs": 21591, + "total_submitted": 34798, + "total_column_articles": 237, "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": 23871, - "total_submitted": 35117, - "total_column_articles": 183, + "total_acs": 24956, + "total_submitted": 36640, + "total_column_articles": 193, "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": 14534, - "total_submitted": 20445, - "total_column_articles": 196, + "total_acs": 15175, + "total_submitted": 21347, + "total_column_articles": 205, "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": 13964, - "total_submitted": 24237, - "total_column_articles": 144, + "total_acs": 14639, + "total_submitted": 25446, + "total_column_articles": 150, "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": 12060, - "total_submitted": 22927, - "total_column_articles": 134, + "total_acs": 12708, + "total_submitted": 24233, + "total_column_articles": 139, "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": 18740, - "total_submitted": 44590, - "total_column_articles": 162, + "total_acs": 19531, + "total_submitted": 46579, + "total_column_articles": 165, "frontend_question_id": "剑指 Offer II 072", "is_new_question": false }, @@ -705,9 +705,9 @@ "question__title": "按权重生成随机数", "question__title_slug": "cuyjEf", "question__hide": false, - "total_acs": 8717, - "total_submitted": 17457, - "total_column_articles": 77, + "total_acs": 9153, + "total_submitted": 18361, + "total_column_articles": 78, "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": 16229, - "total_submitted": 25416, - "total_column_articles": 162, + "total_acs": 16939, + "total_submitted": 26646, + "total_column_articles": 166, "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": 50720, - "total_submitted": 71448, - "total_column_articles": 494, + "total_acs": 51538, + "total_submitted": 72654, + "total_column_articles": 498, "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": 16526, - "total_submitted": 32836, - "total_column_articles": 174, + "total_acs": 17273, + "total_submitted": 34362, + "total_column_articles": 179, "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": 7446, - "total_submitted": 11293, - "total_column_articles": 94, + "total_acs": 7793, + "total_submitted": 11837, + "total_column_articles": 96, "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": 8566, - "total_submitted": 13133, - "total_column_articles": 151, + "total_acs": 9007, + "total_submitted": 13811, + "total_column_articles": 155, "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": 8479, - "total_submitted": 13213, - "total_column_articles": 114, + "total_acs": 8900, + "total_submitted": 13876, + "total_column_articles": 117, "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": 8743, - "total_submitted": 14226, - "total_column_articles": 117, + "total_acs": 9216, + "total_submitted": 15000, + "total_column_articles": 126, "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": 10543, - "total_submitted": 14962, - "total_column_articles": 173, + "total_acs": 11190, + "total_submitted": 15843, + "total_column_articles": 180, "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": 11269, - "total_submitted": 20642, - "total_column_articles": 120, + "total_acs": 11786, + "total_submitted": 21640, + "total_column_articles": 124, "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": 12091, - "total_submitted": 15715, - "total_column_articles": 129, + "total_acs": 12730, + "total_submitted": 16616, + "total_column_articles": 136, "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": 14325, - "total_submitted": 20577, - "total_column_articles": 176, + "total_acs": 14944, + "total_submitted": 21455, + "total_column_articles": 183, "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": 13055, - "total_submitted": 20595, - "total_column_articles": 132, + "total_acs": 13650, + "total_submitted": 21493, + "total_column_articles": 139, "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": 9794, - "total_submitted": 15971, - "total_column_articles": 108, + "total_acs": 10420, + "total_submitted": 16877, + "total_column_articles": 117, "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": 10651, - "total_submitted": 30484, - "total_column_articles": 90, + "total_acs": 11206, + "total_submitted": 32056, + "total_column_articles": 94, "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": 13787, - "total_submitted": 27888, - "total_column_articles": 133, + "total_acs": 14509, + "total_submitted": 29257, + "total_column_articles": 141, "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": 17009, - "total_submitted": 23124, - "total_column_articles": 195, + "total_acs": 17757, + "total_submitted": 24116, + "total_column_articles": 200, "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": 5987, - "total_submitted": 8580, - "total_column_articles": 88, + "total_acs": 6311, + "total_submitted": 9040, + "total_column_articles": 89, "frontend_question_id": "剑指 Offer II 118", "is_new_question": false }, @@ -1083,8 +1083,8 @@ "question__title": "相似的字符串", "question__title_slug": "H6lPxb", "question__hide": false, - "total_acs": 5027, - "total_submitted": 8024, + "total_acs": 5251, + "total_submitted": 8444, "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": 12301, - "total_submitted": 14236, - "total_column_articles": 131, + "total_acs": 12794, + "total_submitted": 14801, + "total_column_articles": 139, "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": 14179, - "total_submitted": 16545, - "total_column_articles": 182, + "total_acs": 14871, + "total_submitted": 17338, + "total_column_articles": 190, "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": 5073, - "total_submitted": 16522, - "total_column_articles": 77, + "total_acs": 5364, + "total_submitted": 17127, + "total_column_articles": 79, "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": 18195, - "total_submitted": 28552, - "total_column_articles": 186, + "total_acs": 19045, + "total_submitted": 29892, + "total_column_articles": 191, "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": 16839, - "total_submitted": 30978, + "total_acs": 17072, + "total_submitted": 31544, "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": 17590, - "total_submitted": 23559, - "total_column_articles": 178, + "total_acs": 18340, + "total_submitted": 24576, + "total_column_articles": 184, "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": 7139, - "total_submitted": 12555, - "total_column_articles": 87, + "total_acs": 7572, + "total_submitted": 13396, + "total_column_articles": 90, "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": 11040, - "total_submitted": 23295, - "total_column_articles": 114, + "total_acs": 11541, + "total_submitted": 24289, + "total_column_articles": 120, "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": 7172, - "total_submitted": 12432, - "total_column_articles": 83, + "total_acs": 7555, + "total_submitted": 13049, + "total_column_articles": 84, "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": 14831, - "total_submitted": 24424, - "total_column_articles": 140, + "total_acs": 15562, + "total_submitted": 25697, + "total_column_articles": 143, "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": 16671, - "total_submitted": 22379, - "total_column_articles": 200, + "total_acs": 17427, + "total_submitted": 23402, + "total_column_articles": 205, "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": 4770, - "total_submitted": 7371, - "total_column_articles": 75, + "total_acs": 4997, + "total_submitted": 7721, + "total_column_articles": 76, "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": 12224, - "total_submitted": 18168, - "total_column_articles": 114, + "total_acs": 12776, + "total_submitted": 19051, + "total_column_articles": 118, "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": 9272, - "total_submitted": 11496, - "total_column_articles": 132, + "total_acs": 9775, + "total_submitted": 12130, + "total_column_articles": 133, "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": 7071, - "total_submitted": 12208, - "total_column_articles": 79, + "total_acs": 7508, + "total_submitted": 13003, + "total_column_articles": 83, "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": 16677, - "total_submitted": 24254, - "total_column_articles": 228, + "total_acs": 17452, + "total_submitted": 25411, + "total_column_articles": 236, "frontend_question_id": "剑指 Offer II 047", "is_new_question": false }, @@ -1440,8 +1440,8 @@ "question__title": "单词演变", "question__title_slug": "om3reC", "question__hide": false, - "total_acs": 5549, - "total_submitted": 9166, + "total_acs": 5805, + "total_submitted": 9567, "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": 15510, - "total_submitted": 21626, - "total_column_articles": 210, + "total_acs": 16260, + "total_submitted": 22695, + "total_column_articles": 214, "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": 17331, - "total_submitted": 21759, - "total_column_articles": 234, + "total_acs": 18117, + "total_submitted": 22717, + "total_column_articles": 237, "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": 17181, - "total_submitted": 27121, - "total_column_articles": 203, + "total_acs": 17958, + "total_submitted": 28298, + "total_column_articles": 207, "frontend_question_id": "剑指 Offer II 044", "is_new_question": false }, @@ -1524,9 +1524,9 @@ "question__title": "矩阵中的距离", "question__title_slug": "2bCMpM", "question__hide": false, - "total_acs": 7713, - "total_submitted": 14747, - "total_column_articles": 70, + "total_acs": 8140, + "total_submitted": 15599, + "total_column_articles": 72, "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": 12601, - "total_submitted": 20291, - "total_column_articles": 180, + "total_acs": 13223, + "total_submitted": 21305, + "total_column_articles": 188, "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": 7954, - "total_submitted": 14522, + "total_acs": 8477, + "total_submitted": 15478, "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": 15322, - "total_submitted": 18470, - "total_column_articles": 147, + "total_acs": 16022, + "total_submitted": 19358, + "total_column_articles": 151, "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": 18278, - "total_submitted": 23730, - "total_column_articles": 183, + "total_acs": 19153, + "total_submitted": 24896, + "total_column_articles": 192, "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": 15325, - "total_submitted": 21855, - "total_column_articles": 170, + "total_acs": 16132, + "total_submitted": 22977, + "total_column_articles": 173, "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": 7701, - "total_submitted": 13148, - "total_column_articles": 71, + "total_acs": 8102, + "total_submitted": 13860, + "total_column_articles": 72, "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": 14541, - "total_submitted": 28725, - "total_column_articles": 110, + "total_acs": 15301, + "total_submitted": 30218, + "total_column_articles": 115, "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": 10521, - "total_submitted": 18394, - "total_column_articles": 85, + "total_acs": 11104, + "total_submitted": 19357, + "total_column_articles": 88, "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": 13066, - "total_submitted": 26154, - "total_column_articles": 101, + "total_acs": 13793, + "total_submitted": 27520, + "total_column_articles": 105, "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": 11173, - "total_submitted": 14757, - "total_column_articles": 131, + "total_acs": 11729, + "total_submitted": 15454, + "total_column_articles": 134, "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": 12845, - "total_submitted": 17544, - "total_column_articles": 136, + "total_acs": 13440, + "total_submitted": 18299, + "total_column_articles": 138, "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": 9595, - "total_submitted": 16401, - "total_column_articles": 128, + "total_acs": 10025, + "total_submitted": 17146, + "total_column_articles": 132, "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": 14509, - "total_submitted": 28470, - "total_column_articles": 128, + "total_acs": 15171, + "total_submitted": 29780, + "total_column_articles": 131, "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": 20613, - "total_submitted": 26674, - "total_column_articles": 212, + "total_acs": 21523, + "total_submitted": 27845, + "total_column_articles": 217, "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": 16717, - "total_submitted": 38036, - "total_column_articles": 226, + "total_acs": 17607, + "total_submitted": 40230, + "total_column_articles": 232, "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": 7156, - "total_submitted": 12990, - "total_column_articles": 76, + "total_acs": 7519, + "total_submitted": 13598, + "total_column_articles": 80, "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": 15950, - "total_submitted": 28308, - "total_column_articles": 190, + "total_acs": 16632, + "total_submitted": 29535, + "total_column_articles": 193, "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": 16192, - "total_submitted": 24165, - "total_column_articles": 141, + "total_acs": 16920, + "total_submitted": 25362, + "total_column_articles": 143, "frontend_question_id": "剑指 Offer II 035", "is_new_question": false }, @@ -1923,9 +1923,9 @@ "question__title": "字符串交织", "question__title_slug": "IY6buf", "question__hide": false, - "total_acs": 8417, - "total_submitted": 17605, - "total_column_articles": 80, + "total_acs": 8866, + "total_submitted": 18455, + "total_column_articles": 83, "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": 14151, - "total_submitted": 25352, - "total_column_articles": 196, + "total_acs": 14807, + "total_submitted": 26567, + "total_column_articles": 201, "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": 16628, - "total_submitted": 22075, - "total_column_articles": 159, + "total_acs": 17356, + "total_submitted": 23067, + "total_column_articles": 165, "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": 23574, - "total_submitted": 35583, - "total_column_articles": 160, + "total_acs": 24533, + "total_submitted": 37034, + "total_column_articles": 171, "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": 19515, - "total_submitted": 32489, - "total_column_articles": 175, + "total_acs": 20356, + "total_submitted": 33942, + "total_column_articles": 178, "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": 7408, - "total_submitted": 12747, - "total_column_articles": 67, + "total_acs": 7754, + "total_submitted": 13282, + "total_column_articles": 69, "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": 10270, - "total_submitted": 17433, - "total_column_articles": 80, + "total_acs": 10883, + "total_submitted": 18433, + "total_column_articles": 84, "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": 14586, - "total_submitted": 26747, - "total_column_articles": 148, + "total_acs": 15311, + "total_submitted": 27971, + "total_column_articles": 152, "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": 11223, - "total_submitted": 16622, - "total_column_articles": 160, + "total_acs": 11745, + "total_submitted": 17346, + "total_column_articles": 163, "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": 33607, - "total_submitted": 43280, - "total_column_articles": 451, + "total_acs": 34435, + "total_submitted": 44362, + "total_column_articles": 457, "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": 13513, - "total_submitted": 24940, - "total_column_articles": 102, + "total_acs": 14146, + "total_submitted": 26083, + "total_column_articles": 106, "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": 9593, - "total_submitted": 19623, - "total_column_articles": 101, + "total_acs": 10080, + "total_submitted": 20572, + "total_column_articles": 105, "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": 33324, - "total_submitted": 97550, - "total_column_articles": 502, + "total_acs": 34101, + "total_submitted": 99873, + "total_column_articles": 513, "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": 14464, - "total_submitted": 23878, - "total_column_articles": 221, + "total_acs": 15131, + "total_submitted": 25006, + "total_column_articles": 232, "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": 34472, - "total_submitted": 55978, - "total_column_articles": 323, + "total_acs": 36053, + "total_submitted": 58534, + "total_column_articles": 340, "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": 22805, - "total_submitted": 34148, - "total_column_articles": 239, + "total_acs": 23830, + "total_submitted": 35622, + "total_column_articles": 248, "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": 22195, - "total_submitted": 37320, - "total_column_articles": 264, + "total_acs": 23137, + "total_submitted": 38898, + "total_column_articles": 274, "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": 54124, - "total_submitted": 71584, - "total_column_articles": 355, + "total_acs": 56309, + "total_submitted": 74419, + "total_column_articles": 366, "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": 24753, - "total_submitted": 35317, - "total_column_articles": 189, + "total_acs": 25859, + "total_submitted": 36897, + "total_column_articles": 200, "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": 31381, - "total_submitted": 56589, - "total_column_articles": 231, + "total_acs": 32699, + "total_submitted": 58844, + "total_column_articles": 237, "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": 28086, - "total_submitted": 52865, - "total_column_articles": 304, + "total_acs": 29295, + "total_submitted": 55064, + "total_column_articles": 312, "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": 21130, - "total_submitted": 29408, - "total_column_articles": 202, + "total_acs": 22090, + "total_submitted": 30696, + "total_column_articles": 206, "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": 21445, - "total_submitted": 46720, - "total_column_articles": 212, + "total_acs": 22345, + "total_submitted": 48554, + "total_column_articles": 216, "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": 24247, - "total_submitted": 46918, - "total_column_articles": 221, + "total_acs": 25242, + "total_submitted": 48765, + "total_column_articles": 225, "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": 16791, - "total_submitted": 33129, - "total_column_articles": 192, + "total_acs": 17618, + "total_submitted": 34775, + "total_column_articles": 198, "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": 25988, - "total_submitted": 54619, - "total_column_articles": 272, + "total_acs": 27238, + "total_submitted": 57210, + "total_column_articles": 276, "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": 19105, - "total_submitted": 30772, - "total_column_articles": 194, + "total_acs": 20002, + "total_submitted": 32209, + "total_column_articles": 198, "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": 24083, - "total_submitted": 46940, - "total_column_articles": 220, + "total_acs": 25199, + "total_submitted": 49028, + "total_column_articles": 223, "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": 18931, - "total_submitted": 28348, - "total_column_articles": 183, + "total_acs": 19811, + "total_submitted": 29570, + "total_column_articles": 185, "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": 26432, - "total_submitted": 39371, - "total_column_articles": 267, + "total_acs": 27506, + "total_submitted": 40963, + "total_column_articles": 270, "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": 22893, - "total_submitted": 41365, - "total_column_articles": 226, + "total_acs": 23865, + "total_submitted": 42976, + "total_column_articles": 231, "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": 29246, - "total_submitted": 67789, - "total_column_articles": 234, + "total_acs": 30505, + "total_submitted": 70629, + "total_column_articles": 238, "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": 14155, - "total_submitted": 23283, - "total_column_articles": 129, + "total_acs": 14798, + "total_submitted": 24299, + "total_column_articles": 133, "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": 27620, - "total_submitted": 51122, - "total_column_articles": 258, + "total_acs": 28704, + "total_submitted": 53114, + "total_column_articles": 260, "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": 19608, - "total_submitted": 26659, - "total_column_articles": 177, + "total_acs": 20424, + "total_submitted": 27795, + "total_column_articles": 186, "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": 33151, - "total_submitted": 67467, - "total_column_articles": 300, + "total_acs": 34540, + "total_submitted": 70179, + "total_column_articles": 304, "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": 11712, - "total_submitted": 18751, - "total_column_articles": 140, + "total_acs": 12284, + "total_submitted": 19669, + "total_column_articles": 144, "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": 11495, - "total_submitted": 15312, - "total_column_articles": 115, + "total_acs": 11984, + "total_submitted": 15941, + "total_column_articles": 118, "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": 32100, - "total_submitted": 72750, - "total_column_articles": 229, + "total_acs": 33370, + "total_submitted": 75518, + "total_column_articles": 232, "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": 15669, - "total_submitted": 18348, - "total_column_articles": 195, + "total_acs": 16398, + "total_submitted": 19190, + "total_column_articles": 199, "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": 35513, - "total_submitted": 54358, - "total_column_articles": 285, + "total_acs": 36962, + "total_submitted": 56336, + "total_column_articles": 294, "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": 30684, - "total_submitted": 43186, - "total_column_articles": 268, + "total_acs": 31878, + "total_submitted": 44803, + "total_column_articles": 273, "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": 13113, - "total_submitted": 18986, - "total_column_articles": 123, + "total_acs": 13709, + "total_submitted": 19860, + "total_column_articles": 127, "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": 14996, - "total_submitted": 17518, - "total_column_articles": 172, + "total_acs": 15680, + "total_submitted": 18309, + "total_column_articles": 176, "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": 38188, - "total_submitted": 53548, - "total_column_articles": 317, + "total_acs": 39519, + "total_submitted": 55480, + "total_column_articles": 319, "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": 13517, - "total_submitted": 20625, - "total_column_articles": 133, + "total_acs": 14156, + "total_submitted": 21568, + "total_column_articles": 137, "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": 35088, - "total_submitted": 63848, - "total_column_articles": 349, + "total_acs": 36274, + "total_submitted": 66027, + "total_column_articles": 360, "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": 44776, - "total_submitted": 56941, - "total_column_articles": 404, + "total_acs": 46244, + "total_submitted": 58829, + "total_column_articles": 415, "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": 16272, - "total_submitted": 20184, - "total_column_articles": 169, + "total_acs": 16951, + "total_submitted": 21041, + "total_column_articles": 173, "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": 39504, - "total_submitted": 185831, - "total_column_articles": 335, + "total_acs": 40727, + "total_submitted": 191020, + "total_column_articles": 341, "frontend_question_id": "剑指 Offer II 001", "is_new_question": false }, @@ -2973,8 +2973,8 @@ "question__title": "主题空间", "question__title_slug": "YesdPw", "question__hide": false, - "total_acs": 2709, - "total_submitted": 6527, + "total_acs": 2743, + "total_submitted": 6622, "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": 6295, - "total_submitted": 9594, - "total_column_articles": 125, + "total_acs": 6437, + "total_submitted": 9826, + "total_column_articles": 129, "frontend_question_id": "LCS 02", "is_new_question": false }, @@ -3015,9 +3015,9 @@ "question__title": "下载插件", "question__title_slug": "Ju9Xwi", "question__hide": false, - "total_acs": 8844, - "total_submitted": 16190, - "total_column_articles": 196, + "total_acs": 9042, + "total_submitted": 16582, + "total_column_articles": 197, "frontend_question_id": "LCS 01", "is_new_question": false }, @@ -3036,9 +3036,9 @@ "question__title": "魔塔游戏", "question__title_slug": "p0NxJO", "question__hide": false, - "total_acs": 7859, - "total_submitted": 21099, - "total_column_articles": 132, + "total_acs": 8084, + "total_submitted": 21585, + "total_column_articles": 134, "frontend_question_id": "LCP 30", "is_new_question": false }, @@ -3057,9 +3057,9 @@ "question__title": "守卫城堡", "question__title_slug": "7rLGCR", "question__hide": false, - "total_acs": 794, - "total_submitted": 1255, - "total_column_articles": 16, + "total_acs": 855, + "total_submitted": 1376, + "total_column_articles": 17, "frontend_question_id": "LCP 38", "is_new_question": false }, @@ -3078,8 +3078,8 @@ "question__title": "最多牌组数", "question__title_slug": "Up5XYM", "question__hide": false, - "total_acs": 1320, - "total_submitted": 3972, + "total_acs": 1326, + "total_submitted": 3988, "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": 7130, - "total_submitted": 28291, - "total_column_articles": 122, + "total_acs": 7246, + "total_submitted": 28587, + "total_column_articles": 124, "frontend_question_id": "LCP 33", "is_new_question": false }, @@ -3120,8 +3120,8 @@ "question__title": "电动车游城市", "question__title_slug": "DFPeFJ", "question__hide": false, - "total_acs": 1884, - "total_submitted": 4007, + "total_acs": 1891, + "total_submitted": 4022, "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": 1577, - "total_submitted": 3534, + "total_acs": 1583, + "total_submitted": 3548, "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": 2437, - "total_submitted": 8518, + "total_acs": 2448, + "total_submitted": 8548, "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": 7311, - "total_submitted": 35024, + "total_acs": 7364, + "total_submitted": 35274, "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": 15478, - "total_submitted": 50251, - "total_column_articles": 255, + "total_acs": 15671, + "total_submitted": 50808, + "total_column_articles": 256, "frontend_question_id": "LCP 28", "is_new_question": false }, @@ -3225,8 +3225,8 @@ "question__title": "黑盒光线反射", "question__title_slug": "IQvJ9i", "question__hide": false, - "total_acs": 1453, - "total_submitted": 4319, + "total_acs": 1456, + "total_submitted": 4323, "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": 21459, - "total_submitted": 72305, - "total_column_articles": 294, + "total_acs": 21656, + "total_submitted": 72806, + "total_column_articles": 296, "frontend_question_id": "LCP 18", "is_new_question": false }, @@ -3267,9 +3267,9 @@ "question__title": "黑白方格画", "question__title_slug": "ccw6C7", "question__hide": false, - "total_acs": 10083, - "total_submitted": 29438, - "total_column_articles": 205, + "total_acs": 10156, + "total_submitted": 29581, + "total_column_articles": 206, "frontend_question_id": "LCP 22", "is_new_question": false }, @@ -3288,9 +3288,9 @@ "question__title": "速算机器人", "question__title_slug": "nGK0Fy", "question__hide": false, - "total_acs": 27864, - "total_submitted": 34829, - "total_column_articles": 309, + "total_acs": 28051, + "total_submitted": 35040, + "total_column_articles": 310, "frontend_question_id": "LCP 17", "is_new_question": false }, @@ -3309,8 +3309,8 @@ "question__title": "古董键盘", "question__title_slug": "Uh984O", "question__hide": false, - "total_acs": 1517, - "total_submitted": 4235, + "total_acs": 1535, + "total_submitted": 4271, "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": 1254, - "total_submitted": 3411, + "total_acs": 1258, + "total_submitted": 3416, "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": 2191, - "total_submitted": 6459, + "total_acs": 2196, + "total_submitted": 6472, "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": 781, - "total_submitted": 2139, + "total_acs": 783, + "total_submitted": 2146, "total_column_articles": 23, "frontend_question_id": "LCP 26", "is_new_question": false @@ -3393,8 +3393,8 @@ "question__title": "数字游戏", "question__title_slug": "5TxKeK", "question__hide": false, - "total_acs": 1152, - "total_submitted": 3814, + "total_acs": 1156, + "total_submitted": 3821, "total_column_articles": 30, "frontend_question_id": "LCP 24", "is_new_question": false @@ -3414,9 +3414,9 @@ "question__title": "秋叶收藏集", "question__title_slug": "UlBDOe", "question__hide": false, - "total_acs": 20885, - "total_submitted": 40296, - "total_column_articles": 219, + "total_acs": 20946, + "total_submitted": 40404, + "total_column_articles": 220, "frontend_question_id": "LCP 19", "is_new_question": false }, @@ -3435,8 +3435,8 @@ "question__title": "寻宝", "question__title_slug": "xun-bao", "question__hide": false, - "total_acs": 9821, - "total_submitted": 16169, + "total_acs": 9830, + "total_submitted": 16180, "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": 1263, - "total_submitted": 5241, + "total_acs": 1276, + "total_submitted": 5278, "total_column_articles": 26, "frontend_question_id": "LCP 37", "is_new_question": false @@ -3477,8 +3477,8 @@ "question__title": "最小跳跃次数", "question__title_slug": "zui-xiao-tiao-yue-ci-shu", "question__hide": false, - "total_acs": 8768, - "total_submitted": 28829, + "total_acs": 8875, + "total_submitted": 29137, "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": 3893, - "total_submitted": 7213, + "total_acs": 3951, + "total_submitted": 7321, "total_column_articles": 79, "frontend_question_id": "LCP 34", "is_new_question": false @@ -3540,9 +3540,9 @@ "question__title": "小张刷题计划", "question__title_slug": "xiao-zhang-shua-ti-ji-hua", "question__hide": false, - "total_acs": 8682, - "total_submitted": 20285, - "total_column_articles": 130, + "total_acs": 8884, + "total_submitted": 20677, + "total_column_articles": 131, "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": 8433, - "total_submitted": 11923, - "total_column_articles": 88, + "total_acs": 8504, + "total_submitted": 12008, + "total_column_articles": 89, "frontend_question_id": "LCP 11", "is_new_question": false }, @@ -3582,9 +3582,9 @@ "question__title": "游乐园的游览计划", "question__title_slug": "you-le-yuan-de-you-lan-ji-hua", "question__hide": false, - "total_acs": 815, - "total_submitted": 2443, - "total_column_articles": 18, + "total_acs": 821, + "total_submitted": 2454, + "total_column_articles": 19, "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": 46393, - "total_submitted": 60762, - "total_column_articles": 549, + "total_acs": 46991, + "total_submitted": 61524, + "total_column_articles": 555, "frontend_question_id": "LCP 07", "is_new_question": false }, @@ -3624,8 +3624,8 @@ "question__title": "二叉树任务调度", "question__title_slug": "er-cha-shu-ren-wu-diao-du", "question__hide": false, - "total_acs": 2413, - "total_submitted": 4004, + "total_acs": 2437, + "total_submitted": 4040, "total_column_articles": 44, "frontend_question_id": "LCP 10", "is_new_question": false @@ -3645,9 +3645,9 @@ "question__title": "切分数组", "question__title_slug": "qie-fen-shu-zu", "question__hide": false, - "total_acs": 3309, - "total_submitted": 14587, - "total_column_articles": 51, + "total_acs": 3328, + "total_submitted": 14641, + "total_column_articles": 52, "frontend_question_id": "LCP 14", "is_new_question": false }, @@ -3666,8 +3666,8 @@ "question__title": "魔术排列", "question__title_slug": "er94lq", "question__hide": false, - "total_acs": 3185, - "total_submitted": 9057, + "total_acs": 3206, + "total_submitted": 9095, "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": 6218, - "total_submitted": 20020, + "total_acs": 6262, + "total_submitted": 20149, "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": 50801, - "total_submitted": 60518, - "total_column_articles": 760, + "total_acs": 51066, + "total_submitted": 60828, + "total_column_articles": 775, "frontend_question_id": "LCP 06", "is_new_question": false }, @@ -3729,8 +3729,8 @@ "question__title": "Sparse Similarity LCCI", "question__title_slug": "sparse-similarity-lcci", "question__hide": false, - "total_acs": 4622, - "total_submitted": 13249, + "total_acs": 4677, + "total_submitted": 13391, "total_column_articles": 76, "frontend_question_id": "面试题 17.26", "is_new_question": false @@ -3750,9 +3750,9 @@ "question__title": "Langtons Ant LCCI", "question__title_slug": "langtons-ant-lcci", "question__hide": false, - "total_acs": 3666, - "total_submitted": 6300, - "total_column_articles": 70, + "total_acs": 3752, + "total_submitted": 6440, + "total_column_articles": 72, "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": 2242, - "total_submitted": 4381, + "total_acs": 2268, + "total_submitted": 4463, "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": 12744, - "total_submitted": 26984, - "total_column_articles": 224, + "total_acs": 12904, + "total_submitted": 27292, + "total_column_articles": 226, "frontend_question_id": "面试题 16.21", "is_new_question": false }, @@ -3813,8 +3813,8 @@ "question__title": "T9 LCCI", "question__title_slug": "t9-lcci", "question__hide": false, - "total_acs": 11899, - "total_submitted": 16627, + "total_acs": 12049, + "total_submitted": 16823, "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": 17332, - "total_submitted": 32454, - "total_column_articles": 168, + "total_acs": 17597, + "total_submitted": 32975, + "total_column_articles": 169, "frontend_question_id": "面试题 17.24", "is_new_question": false }, @@ -3855,9 +3855,9 @@ "question__title": "Max Black Square LCCI", "question__title_slug": "max-black-square-lcci", "question__hide": false, - "total_acs": 6291, - "total_submitted": 16762, - "total_column_articles": 133, + "total_acs": 6383, + "total_submitted": 17001, + "total_column_articles": 134, "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": 11107, - "total_submitted": 19162, - "total_column_articles": 224, + "total_acs": 11227, + "total_submitted": 19360, + "total_column_articles": 226, "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": 10365, - "total_submitted": 23348, - "total_column_articles": 152, + "total_acs": 10536, + "total_submitted": 23707, + "total_column_articles": 153, "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": 14152, - "total_submitted": 29548, - "total_column_articles": 209, + "total_acs": 14435, + "total_submitted": 30158, + "total_column_articles": 211, "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": 7310, - "total_submitted": 11804, - "total_column_articles": 127, + "total_acs": 7456, + "total_submitted": 12053, + "total_column_articles": 129, "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": 38594, - "total_submitted": 52022, - "total_column_articles": 456, + "total_acs": 38766, + "total_submitted": 52239, + "total_column_articles": 458, "frontend_question_id": "面试题 10.02", "is_new_question": false }, @@ -3981,9 +3981,9 @@ "question__title": "Find Closest LCCI", "question__title_slug": "find-closest-lcci", "question__hide": false, - "total_acs": 46792, - "total_submitted": 63949, - "total_column_articles": 640, + "total_acs": 47009, + "total_submitted": 64258, + "total_column_articles": 650, "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": 72462, - "total_submitted": 127921, - "total_column_articles": 995, + "total_acs": 72709, + "total_submitted": 128379, + "total_column_articles": 1007, "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": 17806, - "total_submitted": 32309, - "total_column_articles": 184, + "total_acs": 17988, + "total_submitted": 32626, + "total_column_articles": 186, "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": 10467, - "total_submitted": 37618, - "total_column_articles": 143, + "total_acs": 10618, + "total_submitted": 38139, + "total_column_articles": 144, "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": 10720, - "total_submitted": 25994, - "total_column_articles": 247, + "total_acs": 10839, + "total_submitted": 26245, + "total_column_articles": 251, "frontend_question_id": "面试题 17.07", "is_new_question": false }, @@ -4086,8 +4086,8 @@ "question__title": "Number Of 2s In Range LCCI", "question__title_slug": "number-of-2s-in-range-lcci", "question__hide": false, - "total_acs": 6224, - "total_submitted": 13466, + "total_acs": 6298, + "total_submitted": 13631, "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": 7746, - "total_submitted": 19407, - "total_column_articles": 119, + "total_acs": 7909, + "total_submitted": 19783, + "total_column_articles": 120, "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": 38219, - "total_submitted": 61201, - "total_column_articles": 580, + "total_acs": 38676, + "total_submitted": 62084, + "total_column_articles": 595, "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": 6102, - "total_submitted": 11482, + "total_acs": 6198, + "total_submitted": 11679, "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": 11767, - "total_submitted": 30139, - "total_column_articles": 183, + "total_acs": 11926, + "total_submitted": 30463, + "total_column_articles": 184, "frontend_question_id": "面试题 17.22", "is_new_question": false }, @@ -4191,9 +4191,9 @@ "question__title": "Volume of Histogram LCCI", "question__title_slug": "volume-of-histogram-lcci", "question__hide": false, - "total_acs": 47818, - "total_submitted": 75107, - "total_column_articles": 566, + "total_acs": 47999, + "total_submitted": 75376, + "total_column_articles": 569, "frontend_question_id": "面试题 17.21", "is_new_question": false }, @@ -4212,9 +4212,9 @@ "question__title": "Continuous Median LCCI", "question__title_slug": "continuous-median-lcci", "question__hide": false, - "total_acs": 5501, - "total_submitted": 9558, - "total_column_articles": 93, + "total_acs": 5565, + "total_submitted": 9660, + "total_column_articles": 94, "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": 19507, - "total_submitted": 49459, - "total_column_articles": 264, + "total_acs": 19703, + "total_submitted": 49949, + "total_column_articles": 265, "frontend_question_id": "面试题 16.26", "is_new_question": false }, @@ -4254,9 +4254,9 @@ "question__title": "LRU Cache LCCI", "question__title_slug": "lru-cache-lcci", "question__hide": false, - "total_acs": 40584, - "total_submitted": 73883, - "total_column_articles": 322, + "total_acs": 40852, + "total_submitted": 74353, + "total_column_articles": 324, "frontend_question_id": "面试题 16.25", "is_new_question": false }, @@ -4275,8 +4275,8 @@ "question__title": "Add Without Plus LCCI", "question__title_slug": "add-without-plus-lcci", "question__hide": false, - "total_acs": 17359, - "total_submitted": 28645, + "total_acs": 17516, + "total_submitted": 28917, "total_column_articles": 210, "frontend_question_id": "面试题 17.01", "is_new_question": false @@ -4296,9 +4296,9 @@ "question__title": "Multi Search LCCI", "question__title_slug": "multi-search-lcci", "question__hide": false, - "total_acs": 10786, - "total_submitted": 23927, - "total_column_articles": 222, + "total_acs": 10932, + "total_submitted": 24232, + "total_column_articles": 223, "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": 69402, - "total_submitted": 135071, - "total_column_articles": 1234, + "total_acs": 69748, + "total_submitted": 135787, + "total_column_articles": 1245, "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": 8828, - "total_submitted": 21701, - "total_column_articles": 159, + "total_acs": 9002, + "total_submitted": 22125, + "total_column_articles": 161, "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": 91882, - "total_submitted": 154796, - "total_column_articles": 843, + "total_acs": 92455, + "total_submitted": 155816, + "total_column_articles": 858, "frontend_question_id": "面试题 17.14", "is_new_question": false }, @@ -4380,8 +4380,8 @@ "question__title": "Re-Space LCCI", "question__title_slug": "re-space-lcci", "question__hide": false, - "total_acs": 26831, - "total_submitted": 48491, + "total_acs": 26923, + "total_submitted": 48646, "total_column_articles": 293, "frontend_question_id": "面试题 17.13", "is_new_question": false @@ -4401,8 +4401,8 @@ "question__title": "BiNode LCCI", "question__title_slug": "binode-lcci", "question__hide": false, - "total_acs": 26533, - "total_submitted": 41661, + "total_acs": 26776, + "total_submitted": 42029, "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": 3131, - "total_submitted": 8174, + "total_acs": 3172, + "total_submitted": 8245, "total_column_articles": 71, "frontend_question_id": "面试题 16.08", "is_new_question": false @@ -4443,9 +4443,9 @@ "question__title": "Factorial Zeros LCCI", "question__title_slug": "factorial-zeros-lcci", "question__hide": false, - "total_acs": 14195, - "total_submitted": 31140, - "total_column_articles": 150, + "total_acs": 14346, + "total_submitted": 31456, + "total_column_articles": 152, "frontend_question_id": "面试题 16.05", "is_new_question": false }, @@ -4464,9 +4464,9 @@ "question__title": "Sorted Matrix Search LCCI", "question__title_slug": "sorted-matrix-search-lcci", "question__hide": false, - "total_acs": 16836, - "total_submitted": 37164, - "total_column_articles": 204, + "total_acs": 17009, + "total_submitted": 37588, + "total_column_articles": 206, "frontend_question_id": "面试题 10.09", "is_new_question": false }, @@ -4485,9 +4485,9 @@ "question__title": "Hanota LCCI", "question__title_slug": "hanota-lcci", "question__hide": false, - "total_acs": 33714, - "total_submitted": 51705, - "total_column_articles": 344, + "total_acs": 34236, + "total_submitted": 52464, + "total_column_articles": 349, "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": 11084, - "total_submitted": 16819, - "total_column_articles": 143, + "total_acs": 11250, + "total_submitted": 17077, + "total_column_articles": 144, "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": 67856, - "total_submitted": 121115, - "total_column_articles": 2482, + "total_acs": 68326, + "total_submitted": 121917, + "total_column_articles": 2484, "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": 17368, - "total_submitted": 48005, - "total_column_articles": 262, + "total_acs": 17642, + "total_submitted": 48716, + "total_column_articles": 265, "frontend_question_id": "面试题 08.02", "is_new_question": false }, @@ -4569,9 +4569,9 @@ "question__title": "BST Sequences LCCI", "question__title_slug": "bst-sequences-lcci", "question__hide": false, - "total_acs": 9091, - "total_submitted": 18797, - "total_column_articles": 136, + "total_acs": 9182, + "total_submitted": 18952, + "total_column_articles": 137, "frontend_question_id": "面试题 04.09", "is_new_question": false }, @@ -4590,9 +4590,9 @@ "question__title": "Paths with Sum LCCI", "question__title_slug": "paths-with-sum-lcci", "question__hide": false, - "total_acs": 23962, - "total_submitted": 49152, - "total_column_articles": 312, + "total_acs": 24201, + "total_submitted": 49688, + "total_column_articles": 316, "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": 35059, - "total_submitted": 55211, - "total_column_articles": 480, + "total_acs": 35432, + "total_submitted": 55817, + "total_column_articles": 482, "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": 79034, - "total_submitted": 101138, - "total_column_articles": 1093, + "total_acs": 79519, + "total_submitted": 101730, + "total_column_articles": 1105, "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": 76822, - "total_submitted": 215369, - "total_column_articles": 1225, + "total_acs": 77374, + "total_submitted": 217024, + "total_column_articles": 1237, "frontend_question_id": "面试题 01.05", "is_new_question": false }, @@ -4674,9 +4674,9 @@ "question__title": "Pond Sizes LCCI", "question__title_slug": "pond-sizes-lcci", "question__hide": false, - "total_acs": 24160, - "total_submitted": 38825, - "total_column_articles": 434, + "total_acs": 24342, + "total_submitted": 39082, + "total_column_articles": 436, "frontend_question_id": "面试题 16.19", "is_new_question": false }, @@ -4695,9 +4695,9 @@ "question__title": "Pattern Matching LCCI", "question__title_slug": "pattern-matching-lcci", "question__hide": false, - "total_acs": 16515, - "total_submitted": 48456, - "total_column_articles": 332, + "total_acs": 16605, + "total_submitted": 48741, + "total_column_articles": 333, "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": 41817, - "total_submitted": 70336, - "total_column_articles": 443, + "total_acs": 42117, + "total_submitted": 70844, + "total_column_articles": 446, "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": 20460, - "total_submitted": 44218, - "total_column_articles": 284, + "total_acs": 20778, + "total_submitted": 45000, + "total_column_articles": 287, "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": 12597, - "total_submitted": 25906, - "total_column_articles": 295, + "total_acs": 12773, + "total_submitted": 26264, + "total_column_articles": 302, "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": 4833, - "total_submitted": 8579, + "total_acs": 4905, + "total_submitted": 8712, "total_column_articles": 75, "frontend_question_id": "面试题 16.14", "is_new_question": false @@ -4800,9 +4800,9 @@ "question__title": "Bisect Squares LCCI", "question__title_slug": "bisect-squares-lcci", "question__hide": false, - "total_acs": 2761, - "total_submitted": 6297, - "total_column_articles": 69, + "total_acs": 2809, + "total_submitted": 6457, + "total_column_articles": 70, "frontend_question_id": "面试题 16.13", "is_new_question": false }, @@ -4821,9 +4821,9 @@ "question__title": "Diving Board LCCI", "question__title_slug": "diving-board-lcci", "question__hide": false, - "total_acs": 55437, - "total_submitted": 125894, - "total_column_articles": 629, + "total_acs": 55738, + "total_submitted": 126542, + "total_column_articles": 632, "frontend_question_id": "面试题 16.11", "is_new_question": false }, @@ -4842,9 +4842,9 @@ "question__title": "Living People LCCI", "question__title_slug": "living-people-lcci", "question__hide": false, - "total_acs": 13603, - "total_submitted": 19967, - "total_column_articles": 235, + "total_acs": 13764, + "total_submitted": 20200, + "total_column_articles": 239, "frontend_question_id": "面试题 16.10", "is_new_question": false }, @@ -4863,8 +4863,8 @@ "question__title": "Operations LCCI", "question__title_slug": "operations-lcci", "question__hide": false, - "total_acs": 3015, - "total_submitted": 5454, + "total_acs": 3049, + "total_submitted": 5506, "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": 25739, - "total_submitted": 35076, - "total_column_articles": 346, + "total_acs": 25952, + "total_submitted": 35379, + "total_column_articles": 347, "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": 22456, - "total_submitted": 31617, - "total_column_articles": 305, + "total_acs": 22815, + "total_submitted": 32187, + "total_column_articles": 306, "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": 171328, - "total_submitted": 243304, - "total_column_articles": 937, + "total_acs": 173785, + "total_submitted": 246794, + "total_column_articles": 951, "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": 176787, - "total_submitted": 254437, - "total_column_articles": 934, + "total_acs": 179377, + "total_submitted": 258041, + "total_column_articles": 953, "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": 193463, - "total_submitted": 225128, - "total_column_articles": 1590, + "total_acs": 195920, + "total_submitted": 227927, + "total_column_articles": 1596, "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": 209621, - "total_submitted": 329998, - "total_column_articles": 1350, + "total_acs": 212769, + "total_submitted": 335001, + "total_column_articles": 1371, "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": 155130, - "total_submitted": 235309, - "total_column_articles": 938, + "total_acs": 157255, + "total_submitted": 238456, + "total_column_articles": 957, "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": 201096, - "total_submitted": 337448, - "total_column_articles": 1249, + "total_acs": 203974, + "total_submitted": 342041, + "total_column_articles": 1267, "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": 165330, - "total_submitted": 358806, - "total_column_articles": 1386, + "total_acs": 168096, + "total_submitted": 364901, + "total_column_articles": 1409, "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": 103582, - "total_submitted": 355667, - "total_column_articles": 797, + "total_acs": 105289, + "total_submitted": 361548, + "total_column_articles": 817, "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": 97018, - "total_submitted": 169047, - "total_column_articles": 804, + "total_acs": 98661, + "total_submitted": 171887, + "total_column_articles": 824, "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": 113725, - "total_submitted": 190439, - "total_column_articles": 785, + "total_acs": 115613, + "total_submitted": 193671, + "total_column_articles": 799, "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": 133646, - "total_submitted": 279109, - "total_column_articles": 1255, + "total_acs": 135635, + "total_submitted": 283331, + "total_column_articles": 1281, "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": 182030, - "total_submitted": 407058, - "total_column_articles": 1515, + "total_acs": 184494, + "total_submitted": 412535, + "total_column_articles": 1530, "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": 111560, - "total_submitted": 187923, - "total_column_articles": 691, + "total_acs": 113386, + "total_submitted": 190980, + "total_column_articles": 711, "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": 129159, - "total_submitted": 197703, - "total_column_articles": 709, + "total_acs": 131315, + "total_submitted": 201070, + "total_column_articles": 726, "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": 242328, - "total_submitted": 317180, - "total_column_articles": 1577, + "total_acs": 245762, + "total_submitted": 321611, + "total_column_articles": 1593, "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": 236021, - "total_submitted": 508838, - "total_column_articles": 1493, + "total_acs": 239710, + "total_submitted": 516605, + "total_column_articles": 1524, "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": 269933, - "total_submitted": 603335, - "total_column_articles": 2138, + "total_acs": 273675, + "total_submitted": 611334, + "total_column_articles": 2152, "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": 342721, - "total_submitted": 397844, - "total_column_articles": 2551, + "total_acs": 348416, + "total_submitted": 404334, + "total_column_articles": 2576, "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": 299295, - "total_submitted": 563501, - "total_column_articles": 2219, + "total_acs": 303101, + "total_submitted": 570537, + "total_column_articles": 2235, "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": 199082, - "total_submitted": 446787, - "total_column_articles": 1346, + "total_acs": 201930, + "total_submitted": 453230, + "total_column_articles": 1377, "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": 190426, - "total_submitted": 275453, - "total_column_articles": 1418, + "total_acs": 193384, + "total_submitted": 279654, + "total_column_articles": 1442, "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": 249620, - "total_submitted": 380467, - "total_column_articles": 1334, + "total_acs": 252957, + "total_submitted": 385355, + "total_column_articles": 1362, "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": 192561, - "total_submitted": 368635, - "total_column_articles": 1968, + "total_acs": 195667, + "total_submitted": 374662, + "total_column_articles": 1981, "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": 194733, - "total_submitted": 273659, - "total_column_articles": 2216, + "total_acs": 197394, + "total_submitted": 277448, + "total_column_articles": 2235, "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": 174638, - "total_submitted": 313827, - "total_column_articles": 1197, + "total_acs": 177529, + "total_submitted": 319155, + "total_column_articles": 1221, "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": 206864, - "total_submitted": 304791, - "total_column_articles": 1179, + "total_acs": 209948, + "total_submitted": 309303, + "total_column_articles": 1208, "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": 133735, - "total_submitted": 165874, - "total_column_articles": 914, + "total_acs": 135828, + "total_submitted": 168435, + "total_column_articles": 933, "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": 163153, - "total_submitted": 235465, - "total_column_articles": 1321, + "total_acs": 165449, + "total_submitted": 238778, + "total_column_articles": 1347, "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": 248464, - "total_submitted": 313566, - "total_column_articles": 1591, + "total_acs": 251798, + "total_submitted": 317696, + "total_column_articles": 1606, "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": 152659, - "total_submitted": 309307, - "total_column_articles": 1202, + "total_acs": 155241, + "total_submitted": 314196, + "total_column_articles": 1226, "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": 204974, - "total_submitted": 348983, - "total_column_articles": 1232, + "total_acs": 208167, + "total_submitted": 354276, + "total_column_articles": 1258, "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": 248796, - "total_submitted": 399922, - "total_column_articles": 1546, + "total_acs": 252253, + "total_submitted": 405462, + "total_column_articles": 1567, "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": 172321, - "total_submitted": 306318, - "total_column_articles": 1359, + "total_acs": 175177, + "total_submitted": 311123, + "total_column_articles": 1384, "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": 196965, - "total_submitted": 335812, - "total_column_articles": 1735, + "total_acs": 199989, + "total_submitted": 341043, + "total_column_articles": 1752, "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": 82833, - "total_submitted": 194042, - "total_column_articles": 649, + "total_acs": 84208, + "total_submitted": 197105, + "total_column_articles": 657, "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": 215469, - "total_submitted": 312491, - "total_column_articles": 1586, + "total_acs": 218493, + "total_submitted": 316932, + "total_column_articles": 1601, "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": 216631, - "total_submitted": 339622, - "total_column_articles": 1420, + "total_acs": 219830, + "total_submitted": 344773, + "total_column_articles": 1446, "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": 241390, - "total_submitted": 344575, - "total_column_articles": 1314, + "total_acs": 244751, + "total_submitted": 349268, + "total_column_articles": 1337, "frontend_question_id": "剑指 Offer 39", "is_new_question": false }, @@ -5724,9 +5724,9 @@ "question__title": "1~n整数中1出现的次数 LCOF", "question__title_slug": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 70521, - "total_submitted": 140659, - "total_column_articles": 654, + "total_acs": 71590, + "total_submitted": 142561, + "total_column_articles": 669, "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": 219528, - "total_submitted": 379075, - "total_column_articles": 1402, + "total_acs": 222701, + "total_submitted": 384605, + "total_column_articles": 1426, "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": 109117, - "total_submitted": 190902, - "total_column_articles": 720, + "total_acs": 110623, + "total_submitted": 193402, + "total_column_articles": 737, "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": 167640, - "total_submitted": 275984, - "total_column_articles": 1303, + "total_acs": 170397, + "total_submitted": 280456, + "total_column_articles": 1331, "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": 164791, - "total_submitted": 252353, - "total_column_articles": 1335, + "total_acs": 167489, + "total_submitted": 256524, + "total_column_articles": 1355, "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": 319367, - "total_submitted": 525608, - "total_column_articles": 1954, + "total_acs": 323730, + "total_submitted": 532927, + "total_column_articles": 1968, "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": 102996, - "total_submitted": 176109, - "total_column_articles": 706, + "total_acs": 104916, + "total_submitted": 179519, + "total_column_articles": 724, "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": 261510, - "total_submitted": 472404, - "total_column_articles": 1636, + "total_acs": 265578, + "total_submitted": 479650, + "total_column_articles": 1657, "frontend_question_id": "剑指 Offer 30", "is_new_question": false }, @@ -5892,9 +5892,9 @@ "question__title": "最小的k个数 LCOF", "question__title_slug": "zui-xiao-de-kge-shu-lcof", "question__hide": false, - "total_acs": 354947, - "total_submitted": 618520, - "total_column_articles": 2257, + "total_acs": 359054, + "total_submitted": 625299, + "total_column_articles": 2268, "frontend_question_id": "面试题40", "is_new_question": false }, @@ -5913,9 +5913,9 @@ "question__title": "复杂链表的复制 LCOF", "question__title_slug": "fu-za-lian-biao-de-fu-zhi-lcof", "question__hide": false, - "total_acs": 213276, - "total_submitted": 297788, - "total_column_articles": 1401, + "total_acs": 216749, + "total_submitted": 302665, + "total_column_articles": 1431, "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": 277417, - "total_submitted": 461019, - "total_column_articles": 1930, + "total_acs": 281618, + "total_submitted": 467655, + "total_column_articles": 1953, "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": 441341, - "total_submitted": 593501, - "total_column_articles": 2459, + "total_acs": 447199, + "total_submitted": 601314, + "total_column_articles": 2479, "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": 94192, - "total_submitted": 242668, - "total_column_articles": 578, + "total_acs": 95826, + "total_submitted": 246937, + "total_column_articles": 585, "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": 207025, - "total_submitted": 265823, - "total_column_articles": 1360, + "total_acs": 210053, + "total_submitted": 269755, + "total_column_articles": 1384, "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": 182858, - "total_submitted": 528127, - "total_column_articles": 1047, + "total_acs": 185983, + "total_submitted": 536756, + "total_column_articles": 1067, "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": 367317, - "total_submitted": 457812, - "total_column_articles": 3080, + "total_acs": 372235, + "total_submitted": 463934, + "total_column_articles": 3105, "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": 204164, - "total_submitted": 467511, - "total_column_articles": 1859, + "total_acs": 207253, + "total_submitted": 474946, + "total_column_articles": 1879, "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": 269782, - "total_submitted": 358678, - "total_column_articles": 1558, + "total_acs": 273428, + "total_submitted": 363446, + "total_column_articles": 1571, "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": 291277, - "total_submitted": 449417, - "total_column_articles": 2195, + "total_acs": 295690, + "total_submitted": 456189, + "total_column_articles": 2223, "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": 110334, - "total_submitted": 437148, - "total_column_articles": 1203, + "total_acs": 112121, + "total_submitted": 443289, + "total_column_articles": 1228, "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": 230066, - "total_submitted": 398937, - "total_column_articles": 1560, + "total_acs": 233404, + "total_submitted": 404747, + "total_column_articles": 1579, "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": 285329, - "total_submitted": 358840, - "total_column_articles": 1899, + "total_acs": 289270, + "total_submitted": 363753, + "total_column_articles": 1922, "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": 235104, - "total_submitted": 503013, - "total_column_articles": 1749, + "total_acs": 238968, + "total_submitted": 511361, + "total_column_articles": 1778, "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": 276248, - "total_submitted": 380056, - "total_column_articles": 1604, + "total_acs": 280306, + "total_submitted": 385709, + "total_column_articles": 1626, "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": 118501, - "total_submitted": 373192, - "total_column_articles": 650, + "total_acs": 120460, + "total_submitted": 379407, + "total_column_articles": 664, "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": 225428, - "total_submitted": 392812, - "total_column_articles": 1741, + "total_acs": 228900, + "total_submitted": 398894, + "total_column_articles": 1755, "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": 266581, - "total_submitted": 378891, - "total_column_articles": 1840, + "total_acs": 270526, + "total_submitted": 384273, + "total_column_articles": 1860, "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": 473921, - "total_submitted": 632457, - "total_column_articles": 2965, + "total_acs": 481477, + "total_submitted": 642752, + "total_column_articles": 2995, "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": 263276, - "total_submitted": 492825, - "total_column_articles": 2242, + "total_acs": 267417, + "total_submitted": 500547, + "total_column_articles": 2259, "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": 474825, - "total_submitted": 626200, - "total_column_articles": 2791, + "total_acs": 484076, + "total_submitted": 638485, + "total_column_articles": 2825, "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": 258522, - "total_submitted": 571908, - "total_column_articles": 1567, + "total_acs": 262848, + "total_submitted": 581747, + "total_column_articles": 1588, "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": 388158, - "total_submitted": 788672, - "total_column_articles": 2220, + "total_acs": 393600, + "total_submitted": 799677, + "total_column_articles": 2242, "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": 294417, - "total_submitted": 646006, - "total_column_articles": 1756, + "total_acs": 298926, + "total_submitted": 655580, + "total_column_articles": 1775, "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": 394159, - "total_submitted": 983634, - "total_column_articles": 2902, + "total_acs": 400534, + "total_submitted": 999761, + "total_column_articles": 2939, "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": 586481, - "total_submitted": 863281, - "total_column_articles": 3661, + "total_acs": 595391, + "total_submitted": 876615, + "total_column_articles": 3688, "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": 386721, - "total_submitted": 1069012, - "total_column_articles": 2398, + "total_acs": 392314, + "total_submitted": 1084463, + "total_column_articles": 2418, "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": 435781, - "total_submitted": 615648, - "total_column_articles": 2465, + "total_acs": 442185, + "total_submitted": 624920, + "total_column_articles": 2495, "frontend_question_id": "剑指 Offer 09", "is_new_question": false }, @@ -6501,9 +6501,9 @@ "question__title": "Smallest Difference LCCI", "question__title_slug": "smallest-difference-lcci", "question__hide": false, - "total_acs": 17638, - "total_submitted": 41104, - "total_column_articles": 243, + "total_acs": 17879, + "total_submitted": 41700, + "total_column_articles": 248, "frontend_question_id": "面试题 16.06", "is_new_question": false }, @@ -6522,8 +6522,8 @@ "question__title": "Tic-Tac-Toe LCCI", "question__title_slug": "tic-tac-toe-lcci", "question__hide": false, - "total_acs": 9685, - "total_submitted": 20852, + "total_acs": 9770, + "total_submitted": 21018, "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": 10385, - "total_submitted": 23644, + "total_acs": 10421, + "total_submitted": 23717, "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": 19697, - "total_submitted": 25687, - "total_column_articles": 247, + "total_acs": 20003, + "total_submitted": 26119, + "total_column_articles": 249, "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": 31561, - "total_submitted": 38217, - "total_column_articles": 483, + "total_acs": 31925, + "total_submitted": 38694, + "total_column_articles": 487, "frontend_question_id": "面试题 16.01", "is_new_question": false }, @@ -6606,9 +6606,9 @@ "question__title": "Sparse Array Search LCCI", "question__title_slug": "sparse-array-search-lcci", "question__hide": false, - "total_acs": 25246, - "total_submitted": 44725, - "total_column_articles": 309, + "total_acs": 25500, + "total_submitted": 45146, + "total_column_articles": 310, "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": 27248, - "total_submitted": 33476, - "total_column_articles": 397, + "total_acs": 27503, + "total_submitted": 33810, + "total_column_articles": 399, "frontend_question_id": "面试题 08.07", "is_new_question": false }, @@ -6648,9 +6648,9 @@ "question__title": "Magic Index LCCI", "question__title_slug": "magic-index-lcci", "question__hide": false, - "total_acs": 57445, - "total_submitted": 85170, - "total_column_articles": 460, + "total_acs": 57669, + "total_submitted": 85491, + "total_column_articles": 461, "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": 23741, - "total_submitted": 30885, - "total_column_articles": 367, + "total_acs": 24060, + "total_submitted": 31267, + "total_column_articles": 370, "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": 19937, - "total_submitted": 51063, - "total_column_articles": 261, + "total_acs": 20237, + "total_submitted": 51930, + "total_column_articles": 262, "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": 38810, - "total_submitted": 78243, - "total_column_articles": 356, + "total_acs": 39011, + "total_submitted": 78617, + "total_column_articles": 357, "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": 16412, - "total_submitted": 42812, - "total_column_articles": 297, + "total_acs": 16598, + "total_submitted": 43351, + "total_column_articles": 298, "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": 22266, - "total_submitted": 31054, - "total_column_articles": 334, + "total_acs": 22510, + "total_submitted": 31406, + "total_column_articles": 337, "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": 15273, - "total_submitted": 26044, - "total_column_articles": 226, + "total_acs": 15461, + "total_submitted": 26381, + "total_column_articles": 227, "frontend_question_id": "面试题 03.06", "is_new_question": false }, @@ -6795,8 +6795,8 @@ "question__title": "Binary Number to String LCCI", "question__title_slug": "bianry-number-to-string-lcci", "question__hide": false, - "total_acs": 10709, - "total_submitted": 15080, + "total_acs": 10831, + "total_submitted": 15232, "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": 9505, - "total_submitted": 18700, + "total_acs": 9626, + "total_submitted": 18921, "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": 18509, - "total_submitted": 33114, - "total_column_articles": 287, + "total_acs": 18703, + "total_submitted": 33471, + "total_column_articles": 288, "frontend_question_id": "面试题 08.10", "is_new_question": false }, @@ -6858,9 +6858,9 @@ "question__title": "Bracket LCCI", "question__title_slug": "bracket-lcci", "question__hide": false, - "total_acs": 27829, - "total_submitted": 34105, - "total_column_articles": 442, + "total_acs": 28124, + "total_submitted": 34452, + "total_column_articles": 444, "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": 32482, - "total_submitted": 48358, - "total_column_articles": 628, + "total_acs": 32830, + "total_submitted": 48871, + "total_column_articles": 633, "frontend_question_id": "面试题 08.05", "is_new_question": false }, @@ -6900,9 +6900,9 @@ "question__title": "Power Set LCCI", "question__title_slug": "power-set-lcci", "question__hide": false, - "total_acs": 26369, - "total_submitted": 32114, - "total_column_articles": 396, + "total_acs": 26601, + "total_submitted": 32392, + "total_column_articles": 400, "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": 53222, - "total_submitted": 145246, - "total_column_articles": 572, + "total_acs": 53668, + "total_submitted": 146366, + "total_column_articles": 573, "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": 5164, - "total_submitted": 9433, - "total_column_articles": 100, + "total_acs": 5261, + "total_submitted": 9669, + "total_column_articles": 102, "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": 12526, - "total_submitted": 32344, + "total_acs": 12651, + "total_submitted": 32724, "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": 51233, - "total_submitted": 109194, - "total_column_articles": 665, + "total_acs": 51869, + "total_submitted": 110390, + "total_column_articles": 678, "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": 83346, - "total_submitted": 97023, - "total_column_articles": 774, + "total_acs": 83808, + "total_submitted": 97569, + "total_column_articles": 787, "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": 64462, - "total_submitted": 103811, - "total_column_articles": 620, + "total_acs": 65528, + "total_submitted": 105711, + "total_column_articles": 626, "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": 87626, - "total_submitted": 118241, - "total_column_articles": 1104, + "total_acs": 88705, + "total_submitted": 119684, + "total_column_articles": 1115, "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": 55460, - "total_submitted": 102003, - "total_column_articles": 963, + "total_acs": 56026, + "total_submitted": 102965, + "total_column_articles": 982, "frontend_question_id": "面试题 01.04", "is_new_question": false }, @@ -7089,8 +7089,8 @@ "question__title": "Closed Number LCCI", "question__title_slug": "closed-number-lcci", "question__hide": false, - "total_acs": 7204, - "total_submitted": 19709, + "total_acs": 7281, + "total_submitted": 19910, "total_column_articles": 172, "frontend_question_id": "面试题 05.04", "is_new_question": false @@ -7110,8 +7110,8 @@ "question__title": "Exchange LCCI", "question__title_slug": "exchange-lcci", "question__hide": false, - "total_acs": 15112, - "total_submitted": 21262, + "total_acs": 15249, + "total_submitted": 21447, "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": 16121, - "total_submitted": 30722, - "total_column_articles": 286, + "total_acs": 16286, + "total_submitted": 31014, + "total_column_articles": 287, "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": 13422, - "total_submitted": 26224, - "total_column_articles": 258, + "total_acs": 13570, + "total_submitted": 26485, + "total_column_articles": 259, "frontend_question_id": "面试题 05.01", "is_new_question": false }, @@ -7173,8 +7173,8 @@ "question__title": "First Common Ancestor LCCI", "question__title_slug": "first-common-ancestor-lcci", "question__hide": false, - "total_acs": 22934, - "total_submitted": 32016, + "total_acs": 23148, + "total_submitted": 32293, "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": 58757, - "total_submitted": 93789, - "total_column_articles": 619, + "total_acs": 59088, + "total_submitted": 94341, + "total_column_articles": 625, "frontend_question_id": "面试题 04.06", "is_new_question": false }, @@ -7215,8 +7215,8 @@ "question__title": "Legal Binary Search Tree LCCI", "question__title_slug": "legal-binary-search-tree-lcci", "question__hide": false, - "total_acs": 33194, - "total_submitted": 93737, + "total_acs": 33452, + "total_submitted": 94396, "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": 40125, - "total_submitted": 67734, - "total_column_articles": 436, + "total_acs": 40391, + "total_submitted": 68134, + "total_column_articles": 438, "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": 30186, - "total_submitted": 37531, - "total_column_articles": 638, + "total_acs": 30422, + "total_submitted": 37805, + "total_column_articles": 641, "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": 42347, - "total_submitted": 53701, - "total_column_articles": 506, + "total_acs": 42617, + "total_submitted": 54044, + "total_column_articles": 507, "frontend_question_id": "面试题 04.02", "is_new_question": false }, @@ -7299,9 +7299,9 @@ "question__title": "Sort of Stacks LCCI", "question__title_slug": "sort-of-stacks-lcci", "question__hide": false, - "total_acs": 21525, - "total_submitted": 39915, - "total_column_articles": 278, + "total_acs": 21789, + "total_submitted": 40389, + "total_column_articles": 280, "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": 16364, - "total_submitted": 30731, - "total_column_articles": 247, + "total_acs": 16542, + "total_submitted": 31048, + "total_column_articles": 249, "frontend_question_id": "面试题 03.01", "is_new_question": false }, @@ -7341,9 +7341,9 @@ "question__title": "Route Between Nodes LCCI ", "question__title_slug": "route-between-nodes-lcci", "question__hide": false, - "total_acs": 24664, - "total_submitted": 46009, - "total_column_articles": 334, + "total_acs": 25035, + "total_submitted": 46671, + "total_column_articles": 336, "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": 29440, - "total_submitted": 41105, - "total_column_articles": 396, + "total_acs": 29676, + "total_submitted": 41410, + "total_column_articles": 397, "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": 32966, - "total_submitted": 53460, - "total_column_articles": 359, + "total_acs": 33247, + "total_submitted": 53893, + "total_column_articles": 360, "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": 36021, - "total_submitted": 66288, - "total_column_articles": 354, + "total_acs": 36304, + "total_submitted": 66800, + "total_column_articles": 356, "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": 102268, - "total_submitted": 152346, - "total_column_articles": 747, + "total_acs": 105513, + "total_submitted": 157226, + "total_column_articles": 769, "frontend_question_id": "面试题 02.07", "is_new_question": false }, @@ -7446,8 +7446,8 @@ "question__title": "Palindrome Linked List LCCI", "question__title_slug": "palindrome-linked-list-lcci", "question__hide": false, - "total_acs": 51749, - "total_submitted": 106395, + "total_acs": 52216, + "total_submitted": 107295, "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": 78626, - "total_submitted": 116753, - "total_column_articles": 796, + "total_acs": 79211, + "total_submitted": 117652, + "total_column_articles": 812, "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": 45082, - "total_submitted": 82583, - "total_column_articles": 525, + "total_acs": 45467, + "total_submitted": 83284, + "total_column_articles": 528, "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": 91956, - "total_submitted": 196603, - "total_column_articles": 1327, + "total_acs": 92613, + "total_submitted": 197992, + "total_column_articles": 1342, "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": 61733, - "total_submitted": 107035, - "total_column_articles": 618, + "total_acs": 62279, + "total_submitted": 107992, + "total_column_articles": 620, "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": 79161, - "total_submitted": 124136, - "total_column_articles": 1364, + "total_acs": 79827, + "total_submitted": 125197, + "total_column_articles": 1382, "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": 126011, - "total_submitted": 176674, - "total_column_articles": 1931, + "total_acs": 127166, + "total_submitted": 178306, + "total_column_articles": 1944, "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": 89894, - "total_submitted": 106352, - "total_column_articles": 711, + "total_acs": 90266, + "total_submitted": 106801, + "total_column_articles": 723, "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": 13349, - "total_submitted": 58831, - "total_column_articles": 206, + "total_acs": 13443, + "total_submitted": 59202, + "total_column_articles": 207, "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": 2532, - "total_submitted": 11820, + "total_acs": 2538, + "total_submitted": 11844, "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": 3421, - "total_submitted": 8504, + "total_acs": 3436, + "total_submitted": 8530, "total_column_articles": 78, "frontend_question_id": "LCP 04", "is_new_question": false @@ -7677,8 +7677,8 @@ "question__title": "Deep Dark Fraction", "question__title_slug": "deep-dark-fraction", "question__hide": false, - "total_acs": 16605, - "total_submitted": 23838, + "total_acs": 16716, + "total_submitted": 23998, "total_column_articles": 291, "frontend_question_id": "LCP 02", "is_new_question": false @@ -7692,15 +7692,99 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2468, + "question__title": "Valid Palindrome IV", + "question__title_slug": "valid-palindrome-iv", + "question__hide": false, + "total_acs": 31, + "total_submitted": 38, + "total_column_articles": 5, + "frontend_question_id": "2330", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2458, + "question__title": "Find Minimum Time to Finish All Jobs II", + "question__title_slug": "find-minimum-time-to-finish-all-jobs-ii", + "question__hide": false, + "total_acs": 58, + "total_submitted": 61, + "total_column_articles": 7, + "frontend_question_id": "2323", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2452, + "question__title": "Product Sales Analysis V", + "question__title_slug": "product-sales-analysis-v", + "question__hide": false, + "total_acs": 64, + "total_submitted": 79, + "total_column_articles": 4, + "frontend_question_id": "2329", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2451, + "question__title": "Product Sales Analysis IV", + "question__title_slug": "product-sales-analysis-iv", + "question__hide": false, + "total_acs": 65, + "total_submitted": 78, + "total_column_articles": 3, + "frontend_question_id": "2324", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "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, + "total_acs": 117, + "total_submitted": 164, + "total_column_articles": 4, "frontend_question_id": "2314", "is_new_question": false }, @@ -7719,8 +7803,8 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 97, - "total_submitted": 115, + "total_acs": 137, + "total_submitted": 166, "total_column_articles": 3, "frontend_question_id": "2308", "is_new_question": false @@ -7740,8 +7824,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 95, - "total_submitted": 105, + "total_acs": 141, + "total_submitted": 159, "total_column_articles": 3, "frontend_question_id": "2298", "is_new_question": false @@ -7761,8 +7845,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": 140, - "total_submitted": 280, + "total_acs": 174, + "total_submitted": 361, "total_column_articles": 5, "frontend_question_id": "2292", "is_new_question": false @@ -7782,8 +7866,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 90, - "total_submitted": 126, + "total_acs": 95, + "total_submitted": 131, "total_column_articles": 5, "frontend_question_id": "2291", "is_new_question": false @@ -7803,8 +7887,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": 52, - "total_submitted": 97, + "total_acs": 55, + "total_submitted": 106, "total_column_articles": 5, "frontend_question_id": "2282", "is_new_question": false @@ -7824,8 +7908,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 73, - "total_submitted": 100, + "total_acs": 78, + "total_submitted": 108, "total_column_articles": 8, "frontend_question_id": "2277", "is_new_question": false @@ -7839,15 +7923,267 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2419, + "question__title": "Subarray With Elements Greater Than Varying Threshold", + "question__title_slug": "subarray-with-elements-greater-than-varying-threshold", + "question__hide": false, + "total_acs": 1535, + "total_submitted": 3564, + "total_column_articles": 34, + "frontend_question_id": "2334", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2418, + "question__title": "Minimum Sum of Squared Difference", + "question__title_slug": "minimum-sum-of-squared-difference", + "question__hide": false, + "total_acs": 2506, + "total_submitted": 10723, + "total_column_articles": 49, + "frontend_question_id": "2333", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2417, + "question__title": "The Latest Time to Catch a Bus", + "question__title_slug": "the-latest-time-to-catch-a-bus", + "question__hide": false, + "total_acs": 2886, + "total_submitted": 13424, + "total_column_articles": 62, + "frontend_question_id": "2332", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2416, + "question__title": "Evaluate Boolean Binary Tree", + "question__title_slug": "evaluate-boolean-binary-tree", + "question__hide": false, + "total_acs": 4137, + "total_submitted": 5027, + "total_column_articles": 40, + "frontend_question_id": "2331", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2415, + "question__title": "Count the Number of Ideal Arrays", + "question__title_slug": "count-the-number-of-ideal-arrays", + "question__hide": false, + "total_acs": 1574, + "total_submitted": 6191, + "total_column_articles": 27, + "frontend_question_id": "2338", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2414, + "question__title": "Move Pieces to Obtain a String", + "question__title_slug": "move-pieces-to-obtain-a-string", + "question__hide": false, + "total_acs": 5819, + "total_submitted": 14020, + "total_column_articles": 87, + "frontend_question_id": "2337", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2413, + "question__title": "Smallest Number in Infinite Set", + "question__title_slug": "smallest-number-in-infinite-set", + "question__hide": false, + "total_acs": 6758, + "total_submitted": 9743, + "total_column_articles": 80, + "frontend_question_id": "2336", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2412, + "question__title": "Minimum Amount of Time to Fill Cups", + "question__title_slug": "minimum-amount-of-time-to-fill-cups", + "question__hide": false, + "total_acs": 7877, + "total_submitted": 14029, + "total_column_articles": 85, + "frontend_question_id": "2335", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2411, + "question__title": "Spiral Matrix IV", + "question__title_slug": "spiral-matrix-iv", + "question__hide": false, + "total_acs": 7454, + "total_submitted": 11129, + "total_column_articles": 95, + "frontend_question_id": "2326", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2409, + "question__title": "Number of Increasing Paths in a Grid", + "question__title_slug": "number-of-increasing-paths-in-a-grid", + "question__hide": false, + "total_acs": 4513, + "total_submitted": 9174, + "total_column_articles": 97, + "frontend_question_id": "2328", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2408, + "question__title": "Number of People Aware of a Secret", + "question__title_slug": "number-of-people-aware-of-a-secret", + "question__hide": false, + "total_acs": 6772, + "total_submitted": 15161, + "total_column_articles": 163, + "frontend_question_id": "2327", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2406, + "question__title": "Decode the Message", + "question__title_slug": "decode-the-message", + "question__hide": false, + "total_acs": 8575, + "total_submitted": 10413, + "total_column_articles": 81, + "frontend_question_id": "2325", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2405, "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 96, - "total_submitted": 122, - "total_column_articles": 7, + "total_acs": 110, + "total_submitted": 136, + "total_column_articles": 8, "frontend_question_id": "2268", "is_new_question": false }, @@ -7866,9 +8202,9 @@ "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, + "total_acs": 2499, + "total_submitted": 4444, + "total_column_articles": 56, "frontend_question_id": "2318", "is_new_question": false }, @@ -7887,9 +8223,9 @@ "question__title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "question__title_slug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "question__hide": false, - "total_acs": 3558, - "total_submitted": 10049, - "total_column_articles": 74, + "total_acs": 4197, + "total_submitted": 11508, + "total_column_articles": 83, "frontend_question_id": "2316", "is_new_question": false }, @@ -7908,9 +8244,9 @@ "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, + "total_acs": 3288, + "total_submitted": 3945, + "total_column_articles": 46, "frontend_question_id": "2317", "is_new_question": false }, @@ -7929,9 +8265,9 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 4289, - "total_submitted": 5069, - "total_column_articles": 58, + "total_acs": 5242, + "total_submitted": 6214, + "total_column_articles": 79, "frontend_question_id": "2315", "is_new_question": false }, @@ -7950,8 +8286,8 @@ "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_acs": 2505, + "total_submitted": 4481, "total_column_articles": 45, "frontend_question_id": "2322", "is_new_question": false @@ -7971,11 +8307,11 @@ "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, + "total_acs": 39, + "total_submitted": 58, + "total_column_articles": 7, "frontend_question_id": "2313", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -7992,9 +8328,9 @@ "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, + "total_acs": 8151, + "total_submitted": 11100, + "total_column_articles": 64, "frontend_question_id": "2319", "is_new_question": false }, @@ -8013,9 +8349,9 @@ "question__title": "Count Number of Ways to Place Houses", "question__title_slug": "count-number-of-ways-to-place-houses", "question__hide": false, - "total_acs": 5929, - "total_submitted": 15684, - "total_column_articles": 72, + "total_acs": 6781, + "total_submitted": 17527, + "total_column_articles": 79, "frontend_question_id": "2320", "is_new_question": false }, @@ -8034,9 +8370,9 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 52, - "total_submitted": 78, - "total_column_articles": 4, + "total_acs": 55, + "total_submitted": 81, + "total_column_articles": 5, "frontend_question_id": "2254", "is_new_question": false }, @@ -8055,9 +8391,9 @@ "question__title": "Longest Binary Subsequence Less Than or Equal to K", "question__title_slug": "longest-binary-subsequence-less-than-or-equal-to-k", "question__hide": false, - "total_acs": 5513, - "total_submitted": 15708, - "total_column_articles": 101, + "total_acs": 5717, + "total_submitted": 16198, + "total_column_articles": 104, "frontend_question_id": "2311", "is_new_question": false }, @@ -8076,9 +8412,9 @@ "question__title": "Count Subarrays With Score Less Than K", "question__title_slug": "count-subarrays-with-score-less-than-k", "question__hide": false, - "total_acs": 3620, - "total_submitted": 7322, - "total_column_articles": 66, + "total_acs": 3839, + "total_submitted": 7735, + "total_column_articles": 69, "frontend_question_id": "2302", "is_new_question": false }, @@ -8097,9 +8433,9 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 3311, - "total_submitted": 7471, - "total_column_articles": 59, + "total_acs": 3406, + "total_submitted": 7635, + "total_column_articles": 61, "frontend_question_id": "2301", "is_new_question": false }, @@ -8118,9 +8454,9 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 4637, - "total_submitted": 12459, - "total_column_articles": 73, + "total_acs": 4898, + "total_submitted": 13091, + "total_column_articles": 75, "frontend_question_id": "2300", "is_new_question": false }, @@ -8139,9 +8475,9 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 4740, - "total_submitted": 7553, - "total_column_articles": 55, + "total_acs": 4967, + "total_submitted": 7938, + "total_column_articles": 59, "frontend_question_id": "2299", "is_new_question": false }, @@ -8160,9 +8496,9 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 3473, - "total_submitted": 8247, - "total_column_articles": 60, + "total_acs": 3583, + "total_submitted": 8446, + "total_column_articles": 62, "frontend_question_id": "2306", "is_new_question": false }, @@ -8181,8 +8517,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 5195, - "total_submitted": 12414, + "total_acs": 5302, + "total_submitted": 12658, "total_column_articles": 106, "frontend_question_id": "2296", "is_new_question": false @@ -8202,9 +8538,9 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 6827, - "total_submitted": 12014, - "total_column_articles": 101, + "total_acs": 6993, + "total_submitted": 12321, + "total_column_articles": 103, "frontend_question_id": "2295", "is_new_question": false }, @@ -8223,9 +8559,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": 6694, - "total_submitted": 9867, - "total_column_articles": 94, + "total_acs": 6826, + "total_submitted": 10046, + "total_column_articles": 95, "frontend_question_id": "2294", "is_new_question": false }, @@ -8244,9 +8580,9 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 7471, - "total_submitted": 10814, - "total_column_articles": 88, + "total_acs": 7666, + "total_submitted": 11091, + "total_column_articles": 89, "frontend_question_id": "2293", "is_new_question": false }, @@ -8265,8 +8601,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": 151, - "total_submitted": 197, + "total_acs": 153, + "total_submitted": 199, "total_column_articles": 10, "frontend_question_id": "2237", "is_new_question": false @@ -8286,9 +8622,9 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 3687, - "total_submitted": 4228, - "total_column_articles": 33, + "total_acs": 4074, + "total_submitted": 4661, + "total_column_articles": 40, "frontend_question_id": "2236", "is_new_question": false }, @@ -8307,9 +8643,9 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 8568, - "total_submitted": 9751, - "total_column_articles": 54, + "total_acs": 9801, + "total_submitted": 11220, + "total_column_articles": 60, "frontend_question_id": "2235", "is_new_question": false }, @@ -8328,8 +8664,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 81, - "total_submitted": 127, + "total_acs": 89, + "total_submitted": 138, "total_column_articles": 2, "frontend_question_id": "2253", "is_new_question": false @@ -8349,8 +8685,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 73, - "total_submitted": 125, + "total_acs": 80, + "total_submitted": 140, "total_column_articles": 1, "frontend_question_id": "2252", "is_new_question": false @@ -8370,9 +8706,9 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 2113, - "total_submitted": 10399, - "total_column_articles": 37, + "total_acs": 2149, + "total_submitted": 10583, + "total_column_articles": 39, "frontend_question_id": "2286", "is_new_question": false }, @@ -8391,9 +8727,9 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 4486, - "total_submitted": 7890, - "total_column_articles": 63, + "total_acs": 4622, + "total_submitted": 8129, + "total_column_articles": 65, "frontend_question_id": "2285", "is_new_question": false }, @@ -8412,9 +8748,9 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 4694, - "total_submitted": 8237, - "total_column_articles": 63, + "total_acs": 4812, + "total_submitted": 8459, + "total_column_articles": 66, "frontend_question_id": "2284", "is_new_question": false }, @@ -8433,9 +8769,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": 5561, - "total_submitted": 7024, - "total_column_articles": 72, + "total_acs": 5775, + "total_submitted": 7297, + "total_column_articles": 78, "frontend_question_id": "2283", "is_new_question": false }, @@ -8454,9 +8790,9 @@ "question__title": "Number of Times a Driver Was a Passenger", "question__title_slug": "number-of-times-a-driver-was-a-passenger", "question__hide": false, - "total_acs": 295, - "total_submitted": 414, - "total_column_articles": 7, + "total_acs": 324, + "total_submitted": 454, + "total_column_articles": 8, "frontend_question_id": "2238", "is_new_question": false }, @@ -8475,9 +8811,9 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 4367, - "total_submitted": 8163, - "total_column_articles": 78, + "total_acs": 4501, + "total_submitted": 8392, + "total_column_articles": 79, "frontend_question_id": "2290", "is_new_question": false }, @@ -8496,9 +8832,9 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 3692, - "total_submitted": 18796, - "total_column_articles": 77, + "total_acs": 3779, + "total_submitted": 19255, + "total_column_articles": 80, "frontend_question_id": "2289", "is_new_question": false }, @@ -8517,9 +8853,9 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 6902, - "total_submitted": 22557, - "total_column_articles": 94, + "total_acs": 6981, + "total_submitted": 22822, + "total_column_articles": 95, "frontend_question_id": "2288", "is_new_question": false }, @@ -8538,9 +8874,9 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 8020, - "total_submitted": 13238, - "total_column_articles": 100, + "total_acs": 8214, + "total_submitted": 13548, + "total_column_articles": 102, "frontend_question_id": "2287", "is_new_question": false }, @@ -8559,8 +8895,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": 320, - "total_submitted": 624, + "total_acs": 364, + "total_submitted": 701, "total_column_articles": 6, "frontend_question_id": "2230", "is_new_question": false @@ -8580,9 +8916,9 @@ "question__title": "Users With Two Purchases Within Seven Days", "question__title_slug": "users-with-two-purchases-within-seven-days", "question__hide": false, - "total_acs": 358, - "total_submitted": 708, - "total_column_articles": 8, + "total_acs": 401, + "total_submitted": 794, + "total_column_articles": 9, "frontend_question_id": "2228", "is_new_question": false }, @@ -8601,8 +8937,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 128, - "total_submitted": 179, + "total_acs": 131, + "total_submitted": 183, "total_column_articles": 9, "frontend_question_id": "2219", "is_new_question": false @@ -8622,8 +8958,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 2697, - "total_submitted": 11406, + "total_acs": 2737, + "total_submitted": 11559, "total_column_articles": 52, "frontend_question_id": "2281", "is_new_question": false @@ -8643,9 +8979,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": 7956, - "total_submitted": 38015, - "total_column_articles": 143, + "total_acs": 8072, + "total_submitted": 38317, + "total_column_articles": 144, "frontend_question_id": "2280", "is_new_question": false }, @@ -8664,9 +9000,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": 8653, - "total_submitted": 12993, - "total_column_articles": 84, + "total_acs": 8902, + "total_submitted": 13381, + "total_column_articles": 86, "frontend_question_id": "2279", "is_new_question": false }, @@ -8685,9 +9021,9 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 9598, - "total_submitted": 11828, - "total_column_articles": 84, + "total_acs": 10012, + "total_submitted": 12349, + "total_column_articles": 86, "frontend_question_id": "2278", "is_new_question": false }, @@ -8706,9 +9042,9 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 3554, - "total_submitted": 8210, - "total_column_articles": 53, + "total_acs": 3610, + "total_submitted": 8311, + "total_column_articles": 54, "frontend_question_id": "2246", "is_new_question": false }, @@ -8727,8 +9063,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": 3998, - "total_submitted": 11666, + "total_acs": 4022, + "total_submitted": 11720, "total_column_articles": 91, "frontend_question_id": "2245", "is_new_question": false @@ -8748,9 +9084,9 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 8765, - "total_submitted": 15835, - "total_column_articles": 135, + "total_acs": 8857, + "total_submitted": 15979, + "total_column_articles": 136, "frontend_question_id": "2244", "is_new_question": false }, @@ -8769,8 +9105,8 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 9358, - "total_submitted": 14765, + "total_acs": 9463, + "total_submitted": 14934, "total_column_articles": 110, "frontend_question_id": "2243", "is_new_question": false @@ -8790,9 +9126,9 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 2471, - "total_submitted": 6914, - "total_column_articles": 35, + "total_acs": 2577, + "total_submitted": 7101, + "total_column_articles": 37, "frontend_question_id": "2272", "is_new_question": false }, @@ -8811,9 +9147,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": 4486, - "total_submitted": 14621, - "total_column_articles": 84, + "total_acs": 4605, + "total_submitted": 14898, + "total_column_articles": 85, "frontend_question_id": "2271", "is_new_question": false }, @@ -8832,9 +9168,9 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 5300, - "total_submitted": 11450, - "total_column_articles": 64, + "total_acs": 5382, + "total_submitted": 11623, + "total_column_articles": 65, "frontend_question_id": "2270", "is_new_question": false }, @@ -8853,8 +9189,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 4942, - "total_submitted": 14479, + "total_acs": 5004, + "total_submitted": 14624, "total_column_articles": 92, "frontend_question_id": "2276", "is_new_question": false @@ -8874,8 +9210,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": 6819, - "total_submitted": 11833, + "total_acs": 6899, + "total_submitted": 11943, "total_column_articles": 91, "frontend_question_id": "2275", "is_new_question": false @@ -8895,9 +9231,9 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 8323, - "total_submitted": 15679, - "total_column_articles": 99, + "total_acs": 8405, + "total_submitted": 15830, + "total_column_articles": 101, "frontend_question_id": "2274", "is_new_question": false }, @@ -8916,8 +9252,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 133, - "total_submitted": 244, + "total_acs": 143, + "total_submitted": 264, "total_column_articles": 6, "frontend_question_id": "2214", "is_new_question": false @@ -8937,9 +9273,9 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 2368, - "total_submitted": 7739, - "total_column_articles": 37, + "total_acs": 2414, + "total_submitted": 7830, + "total_column_articles": 38, "frontend_question_id": "2242", "is_new_question": false }, @@ -8958,8 +9294,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 4798, - "total_submitted": 13732, + "total_acs": 5146, + "total_submitted": 14591, "total_column_articles": 62, "frontend_question_id": "2241", "is_new_question": false @@ -8979,9 +9315,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": 5205, - "total_submitted": 9066, - "total_column_articles": 60, + "total_acs": 5308, + "total_submitted": 9250, + "total_column_articles": 61, "frontend_question_id": "2240", "is_new_question": false }, @@ -9000,9 +9336,9 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 6830, - "total_submitted": 12321, - "total_column_articles": 73, + "total_acs": 6996, + "total_submitted": 12663, + "total_column_articles": 78, "frontend_question_id": "2239", "is_new_question": false }, @@ -9021,9 +9357,9 @@ "question__title": " Check if There Is a Valid Parentheses String Path", "question__title_slug": "check-if-there-is-a-valid-parentheses-string-path", "question__hide": false, - "total_acs": 6721, - "total_submitted": 18340, - "total_column_articles": 117, + "total_acs": 6806, + "total_submitted": 18538, + "total_column_articles": 118, "frontend_question_id": "2267", "is_new_question": false }, @@ -9042,9 +9378,9 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 6564, - "total_submitted": 15334, - "total_column_articles": 125, + "total_acs": 6623, + "total_submitted": 15473, + "total_column_articles": 126, "frontend_question_id": "2266", "is_new_question": false }, @@ -9063,9 +9399,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": 8478, - "total_submitted": 10165, - "total_column_articles": 146, + "total_acs": 8586, + "total_submitted": 10289, + "total_column_articles": 149, "frontend_question_id": "2265", "is_new_question": false }, @@ -9084,9 +9420,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": 9926, - "total_submitted": 15920, - "total_column_articles": 122, + "total_acs": 10067, + "total_submitted": 16172, + "total_column_articles": 124, "frontend_question_id": "2264", "is_new_question": false }, @@ -9105,9 +9441,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": 9601, - "total_submitted": 13858, - "total_column_articles": 119, + "total_acs": 9694, + "total_submitted": 13993, + "total_column_articles": 121, "frontend_question_id": "2224", "is_new_question": false }, @@ -9126,9 +9462,9 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 2287, - "total_submitted": 6576, - "total_column_articles": 74, + "total_acs": 2325, + "total_submitted": 6677, + "total_column_articles": 75, "frontend_question_id": "2258", "is_new_question": false }, @@ -9147,9 +9483,9 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 4031, - "total_submitted": 7840, - "total_column_articles": 96, + "total_acs": 4085, + "total_submitted": 7949, + "total_column_articles": 97, "frontend_question_id": "2257", "is_new_question": false }, @@ -9168,9 +9504,9 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 4808, - "total_submitted": 13534, - "total_column_articles": 66, + "total_acs": 4957, + "total_submitted": 13944, + "total_column_articles": 67, "frontend_question_id": "2256", "is_new_question": false }, @@ -9189,9 +9525,9 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 6101, - "total_submitted": 7569, - "total_column_articles": 81, + "total_acs": 6319, + "total_submitted": 7837, + "total_column_articles": 85, "frontend_question_id": "2255", "is_new_question": false }, @@ -9210,9 +9546,9 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 5285, - "total_submitted": 9584, - "total_column_articles": 103, + "total_acs": 5341, + "total_submitted": 9678, + "total_column_articles": 104, "frontend_question_id": "2262", "is_new_question": false }, @@ -9231,9 +9567,9 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 7148, - "total_submitted": 13710, - "total_column_articles": 118, + "total_acs": 7195, + "total_submitted": 13797, + "total_column_articles": 119, "frontend_question_id": "2261", "is_new_question": false }, @@ -9252,9 +9588,9 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 8493, - "total_submitted": 16925, - "total_column_articles": 135, + "total_acs": 8598, + "total_submitted": 17129, + "total_column_articles": 137, "frontend_question_id": "2260", "is_new_question": false }, @@ -9273,8 +9609,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": 9085, - "total_submitted": 18438, + "total_acs": 9206, + "total_submitted": 18660, "total_column_articles": 119, "frontend_question_id": "2259", "is_new_question": false @@ -9294,8 +9630,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": 422, - "total_submitted": 897, + "total_acs": 468, + "total_submitted": 996, "total_column_articles": 10, "frontend_question_id": "2205", "is_new_question": false @@ -9315,8 +9651,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 220, - "total_submitted": 413, + "total_acs": 248, + "total_submitted": 465, "total_column_articles": 8, "frontend_question_id": "2199", "is_new_question": false @@ -9336,9 +9672,9 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 4750, - "total_submitted": 9827, - "total_column_articles": 102, + "total_acs": 4837, + "total_submitted": 10015, + "total_column_articles": 103, "frontend_question_id": "2251", "is_new_question": false }, @@ -9357,9 +9693,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": 5331, - "total_submitted": 16063, - "total_column_articles": 107, + "total_acs": 5415, + "total_submitted": 16286, + "total_column_articles": 109, "frontend_question_id": "2250", "is_new_question": false }, @@ -9378,9 +9714,9 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 7871, - "total_submitted": 15180, - "total_column_articles": 105, + "total_acs": 7959, + "total_submitted": 15333, + "total_column_articles": 107, "frontend_question_id": "2249", "is_new_question": false }, @@ -9399,9 +9735,9 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 10713, - "total_submitted": 15935, - "total_column_articles": 140, + "total_acs": 10957, + "total_submitted": 16319, + "total_column_articles": 143, "frontend_question_id": "2248", "is_new_question": false }, @@ -9420,8 +9756,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 2637, - "total_submitted": 9529, + "total_acs": 2647, + "total_submitted": 9568, "total_column_articles": 65, "frontend_question_id": "2234", "is_new_question": false @@ -9441,9 +9777,9 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 7138, - "total_submitted": 19873, - "total_column_articles": 152, + "total_acs": 7253, + "total_submitted": 20130, + "total_column_articles": 153, "frontend_question_id": "2233", "is_new_question": false }, @@ -9462,8 +9798,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": 6394, - "total_submitted": 10487, + "total_acs": 6437, + "total_submitted": 10562, "total_column_articles": 119, "frontend_question_id": "2232", "is_new_question": false @@ -9483,9 +9819,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": 8922, - "total_submitted": 14064, - "total_column_articles": 149, + "total_acs": 9047, + "total_submitted": 14224, + "total_column_articles": 151, "frontend_question_id": "2231", "is_new_question": false }, @@ -9504,9 +9840,9 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 2678, - "total_submitted": 7841, - "total_column_articles": 48, + "total_acs": 2729, + "total_submitted": 7966, + "total_column_articles": 49, "frontend_question_id": "2223", "is_new_question": false }, @@ -9525,9 +9861,9 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 4940, - "total_submitted": 10351, - "total_column_articles": 115, + "total_acs": 5025, + "total_submitted": 10511, + "total_column_articles": 116, "frontend_question_id": "2222", "is_new_question": false }, @@ -9546,9 +9882,9 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 6215, - "total_submitted": 7724, - "total_column_articles": 78, + "total_acs": 6339, + "total_submitted": 7872, + "total_column_articles": 81, "frontend_question_id": "2221", "is_new_question": false }, @@ -9567,9 +9903,9 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 6424, - "total_submitted": 7783, - "total_column_articles": 96, + "total_acs": 6589, + "total_submitted": 7976, + "total_column_articles": 97, "frontend_question_id": "2220", "is_new_question": false }, @@ -9588,8 +9924,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": 138, - "total_submitted": 270, + "total_acs": 140, + "total_submitted": 274, "total_column_articles": 10, "frontend_question_id": "2184", "is_new_question": false @@ -9609,8 +9945,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": 3476, - "total_submitted": 9481, + "total_acs": 3536, + "total_submitted": 9606, "total_column_articles": 64, "frontend_question_id": "2203", "is_new_question": false @@ -9630,8 +9966,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": 10212, - "total_submitted": 19612, + "total_acs": 10277, + "total_submitted": 19709, "total_column_articles": 125, "frontend_question_id": "2200", "is_new_question": false @@ -9651,9 +9987,9 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 2241, - "total_submitted": 6004, - "total_column_articles": 71, + "total_acs": 2279, + "total_submitted": 6098, + "total_column_articles": 72, "frontend_question_id": "2213", "is_new_question": false }, @@ -9672,9 +10008,9 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 6235, - "total_submitted": 13254, - "total_column_articles": 152, + "total_acs": 6269, + "total_submitted": 13328, + "total_column_articles": 153, "frontend_question_id": "2212", "is_new_question": false }, @@ -9693,9 +10029,9 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 8184, - "total_submitted": 20953, - "total_column_articles": 129, + "total_acs": 8296, + "total_submitted": 21140, + "total_column_articles": 130, "frontend_question_id": "2211", "is_new_question": false }, @@ -9714,9 +10050,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": 9903, - "total_submitted": 17072, - "total_column_articles": 109, + "total_acs": 9976, + "total_submitted": 17184, + "total_column_articles": 110, "frontend_question_id": "2210", "is_new_question": false }, @@ -9735,8 +10071,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 402, - "total_submitted": 739, + "total_acs": 433, + "total_submitted": 798, "total_column_articles": 9, "frontend_question_id": "2175", "is_new_question": false @@ -9756,8 +10092,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": 117, - "total_submitted": 179, + "total_acs": 129, + "total_submitted": 198, "total_column_articles": 9, "frontend_question_id": "2174", "is_new_question": false @@ -9777,8 +10113,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 441, - "total_submitted": 819, + "total_acs": 497, + "total_submitted": 914, "total_column_articles": 19, "frontend_question_id": "2173", "is_new_question": false @@ -9798,9 +10134,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": 6750, - "total_submitted": 11546, - "total_column_articles": 77, + "total_acs": 6853, + "total_submitted": 11712, + "total_column_articles": 78, "frontend_question_id": "2190", "is_new_question": false }, @@ -9819,8 +10155,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": 3562, - "total_submitted": 9722, + "total_acs": 3606, + "total_submitted": 9833, "total_column_articles": 43, "frontend_question_id": "2209", "is_new_question": false @@ -9840,9 +10176,9 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 5237, - "total_submitted": 13337, - "total_column_articles": 84, + "total_acs": 5298, + "total_submitted": 13458, + "total_column_articles": 85, "frontend_question_id": "2208", "is_new_question": false }, @@ -9861,8 +10197,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": 5616, - "total_submitted": 18773, + "total_acs": 5686, + "total_submitted": 18945, "total_column_articles": 92, "frontend_question_id": "2207", "is_new_question": false @@ -9882,9 +10218,9 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 8279, - "total_submitted": 10932, - "total_column_articles": 96, + "total_acs": 8588, + "total_submitted": 11392, + "total_column_articles": 97, "frontend_question_id": "2206", "is_new_question": false }, @@ -9903,8 +10239,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 4866, - "total_submitted": 14619, + "total_acs": 4898, + "total_submitted": 14721, "total_column_articles": 85, "frontend_question_id": "2197", "is_new_question": false @@ -9924,9 +10260,9 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 7438, - "total_submitted": 10154, - "total_column_articles": 127, + "total_acs": 7543, + "total_submitted": 10311, + "total_column_articles": 128, "frontend_question_id": "2196", "is_new_question": false }, @@ -9945,8 +10281,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 9688, - "total_submitted": 42031, + "total_acs": 9760, + "total_submitted": 42288, "total_column_articles": 201, "frontend_question_id": "2195", "is_new_question": false @@ -9966,9 +10302,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": 10803, - "total_submitted": 12705, - "total_column_articles": 107, + "total_acs": 10976, + "total_submitted": 12920, + "total_column_articles": 109, "frontend_question_id": "2194", "is_new_question": false }, @@ -9987,9 +10323,9 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 220, - "total_submitted": 370, - "total_column_articles": 9, + "total_acs": 233, + "total_submitted": 397, + "total_column_articles": 10, "frontend_question_id": "2168", "is_new_question": false }, @@ -10008,8 +10344,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 478, - "total_submitted": 739, + "total_acs": 513, + "total_submitted": 791, "total_column_articles": 8, "frontend_question_id": "2159", "is_new_question": false @@ -10029,8 +10365,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 4032, - "total_submitted": 14900, + "total_acs": 4073, + "total_submitted": 15009, "total_column_articles": 54, "frontend_question_id": "2183", "is_new_question": false @@ -10050,9 +10386,9 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 6073, - "total_submitted": 12621, - "total_column_articles": 130, + "total_acs": 6109, + "total_submitted": 12764, + "total_column_articles": 131, "frontend_question_id": "2182", "is_new_question": false }, @@ -10071,9 +10407,9 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 10193, - "total_submitted": 11838, - "total_column_articles": 138, + "total_acs": 10457, + "total_submitted": 12152, + "total_column_articles": 141, "frontend_question_id": "2181", "is_new_question": false }, @@ -10092,9 +10428,9 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 9152, - "total_submitted": 14134, - "total_column_articles": 108, + "total_acs": 9289, + "total_submitted": 14354, + "total_column_articles": 110, "frontend_question_id": "2180", "is_new_question": false }, @@ -10113,9 +10449,9 @@ "question__title": "Amount of New Area Painted Each Day", "question__title_slug": "amount-of-new-area-painted-each-day", "question__hide": false, - "total_acs": 237, - "total_submitted": 420, - "total_column_articles": 10, + "total_acs": 261, + "total_submitted": 461, + "total_column_articles": 12, "frontend_question_id": "2158", "is_new_question": false }, @@ -10134,8 +10470,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": 242, - "total_submitted": 553, + "total_acs": 260, + "total_submitted": 609, "total_column_articles": 6, "frontend_question_id": "2153", "is_new_question": false @@ -10155,8 +10491,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 3671, - "total_submitted": 8606, + "total_acs": 3730, + "total_submitted": 8720, "total_column_articles": 62, "frontend_question_id": "2188", "is_new_question": false @@ -10176,9 +10512,9 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 9889, - "total_submitted": 37265, - "total_column_articles": 135, + "total_acs": 10054, + "total_submitted": 37713, + "total_column_articles": 136, "frontend_question_id": "2187", "is_new_question": false }, @@ -10197,9 +10533,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": 9145, - "total_submitted": 12734, - "total_column_articles": 101, + "total_acs": 9205, + "total_submitted": 12806, + "total_column_articles": 103, "frontend_question_id": "2186", "is_new_question": false }, @@ -10218,9 +10554,9 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 11323, - "total_submitted": 14214, - "total_column_articles": 115, + "total_acs": 11548, + "total_submitted": 14509, + "total_column_articles": 116, "frontend_question_id": "2185", "is_new_question": false }, @@ -10239,9 +10575,9 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 3419, - "total_submitted": 7102, - "total_column_articles": 63, + "total_acs": 3456, + "total_submitted": 7179, + "total_column_articles": 65, "frontend_question_id": "2172", "is_new_question": false }, @@ -10260,9 +10596,9 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 7549, - "total_submitted": 19196, - "total_column_articles": 164, + "total_acs": 7650, + "total_submitted": 19411, + "total_column_articles": 168, "frontend_question_id": "2171", "is_new_question": false }, @@ -10281,8 +10617,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": 6917, - "total_submitted": 23430, + "total_acs": 6987, + "total_submitted": 23618, "total_column_articles": 138, "frontend_question_id": "2170", "is_new_question": false @@ -10302,9 +10638,9 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 11849, - "total_submitted": 15589, - "total_column_articles": 96, + "total_acs": 12064, + "total_submitted": 15876, + "total_column_articles": 99, "frontend_question_id": "2169", "is_new_question": false }, @@ -10323,8 +10659,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": 184, - "total_submitted": 359, + "total_acs": 199, + "total_submitted": 392, "total_column_articles": 12, "frontend_question_id": "2152", "is_new_question": false @@ -10344,8 +10680,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": 3767, - "total_submitted": 7839, + "total_acs": 3822, + "total_submitted": 7927, "total_column_articles": 71, "frontend_question_id": "2167", "is_new_question": false @@ -10365,9 +10701,9 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 5151, - "total_submitted": 17421, - "total_column_articles": 143, + "total_acs": 5207, + "total_submitted": 17616, + "total_column_articles": 145, "frontend_question_id": "2166", "is_new_question": false }, @@ -10386,9 +10722,9 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 6732, - "total_submitted": 12239, - "total_column_articles": 119, + "total_acs": 6802, + "total_submitted": 12362, + "total_column_articles": 120, "frontend_question_id": "2165", "is_new_question": false }, @@ -10407,8 +10743,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 8234, - "total_submitted": 11842, + "total_acs": 8334, + "total_submitted": 12045, "total_column_articles": 103, "frontend_question_id": "2164", "is_new_question": false @@ -10428,8 +10764,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": 92, - "total_submitted": 176, + "total_acs": 96, + "total_submitted": 181, "total_column_articles": 8, "frontend_question_id": "2143", "is_new_question": false @@ -10449,8 +10785,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": 593, - "total_submitted": 1151, + "total_acs": 634, + "total_submitted": 1242, "total_column_articles": 13, "frontend_question_id": "2142", "is_new_question": false @@ -10470,9 +10806,9 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 2558, - "total_submitted": 7591, - "total_column_articles": 64, + "total_acs": 2617, + "total_submitted": 7694, + "total_column_articles": 66, "frontend_question_id": "2179", "is_new_question": false }, @@ -10491,9 +10827,9 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 5793, - "total_submitted": 10418, - "total_column_articles": 96, + "total_acs": 5882, + "total_submitted": 10550, + "total_column_articles": 97, "frontend_question_id": "2178", "is_new_question": false }, @@ -10512,9 +10848,9 @@ "question__title": "Find Three Consecutive Integers That Sum to a Given Number", "question__title_slug": "find-three-consecutive-integers-that-sum-to-a-given-number", "question__hide": false, - "total_acs": 6316, - "total_submitted": 9129, - "total_column_articles": 61, + "total_acs": 6412, + "total_submitted": 9267, + "total_column_articles": 63, "frontend_question_id": "2177", "is_new_question": false }, @@ -10533,9 +10869,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": 7267, - "total_submitted": 9080, - "total_column_articles": 82, + "total_acs": 7584, + "total_submitted": 9511, + "total_column_articles": 85, "frontend_question_id": "2176", "is_new_question": false }, @@ -10554,9 +10890,9 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 2946, - "total_submitted": 9742, - "total_column_articles": 67, + "total_acs": 2980, + "total_submitted": 9838, + "total_column_articles": 69, "frontend_question_id": "2157", "is_new_question": false }, @@ -10575,8 +10911,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 4862, - "total_submitted": 20164, + "total_acs": 4910, + "total_submitted": 20483, "total_column_articles": 82, "frontend_question_id": "2156", "is_new_question": false @@ -10596,9 +10932,9 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 10984, - "total_submitted": 14781, - "total_column_articles": 142, + "total_acs": 11193, + "total_submitted": 15090, + "total_column_articles": 144, "frontend_question_id": "2154", "is_new_question": false }, @@ -10617,8 +10953,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": 191, - "total_submitted": 325, + "total_acs": 213, + "total_submitted": 378, "total_column_articles": 10, "frontend_question_id": "2137", "is_new_question": false @@ -10638,8 +10974,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 4621, - "total_submitted": 9471, + "total_acs": 4647, + "total_submitted": 9504, "total_column_articles": 88, "frontend_question_id": "2151", "is_new_question": false @@ -10659,9 +10995,9 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 8865, - "total_submitted": 11004, - "total_column_articles": 96, + "total_acs": 9045, + "total_submitted": 11211, + "total_column_articles": 98, "frontend_question_id": "2149", "is_new_question": false }, @@ -10680,9 +11016,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": 7708, - "total_submitted": 12742, - "total_column_articles": 91, + "total_acs": 7795, + "total_submitted": 12917, + "total_column_articles": 93, "frontend_question_id": "2150", "is_new_question": false }, @@ -10701,9 +11037,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": 9323, - "total_submitted": 16094, - "total_column_articles": 123, + "total_acs": 9423, + "total_submitted": 16286, + "total_column_articles": 125, "frontend_question_id": "2148", "is_new_question": false }, @@ -10722,8 +11058,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": 312, - "total_submitted": 410, + "total_acs": 334, + "total_submitted": 450, "total_column_articles": 10, "frontend_question_id": "2128", "is_new_question": false @@ -10743,9 +11079,9 @@ "question__title": "Minimum Difference in Sums After Removal of Elements", "question__title_slug": "minimum-difference-in-sums-after-removal-of-elements", "question__hide": false, - "total_acs": 2479, - "total_submitted": 5151, - "total_column_articles": 51, + "total_acs": 2514, + "total_submitted": 5233, + "total_column_articles": 52, "frontend_question_id": "2163", "is_new_question": false }, @@ -10764,9 +11100,9 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 2846, - "total_submitted": 8745, - "total_column_articles": 75, + "total_acs": 2888, + "total_submitted": 8840, + "total_column_articles": 76, "frontend_question_id": "2162", "is_new_question": false }, @@ -10785,9 +11121,9 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 6121, - "total_submitted": 7304, - "total_column_articles": 95, + "total_acs": 6241, + "total_submitted": 7448, + "total_column_articles": 96, "frontend_question_id": "2161", "is_new_question": false }, @@ -10806,9 +11142,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": 8561, - "total_submitted": 10013, - "total_column_articles": 129, + "total_acs": 8777, + "total_submitted": 10280, + "total_column_articles": 133, "frontend_question_id": "2160", "is_new_question": false }, @@ -10827,9 +11163,9 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 4385, - "total_submitted": 11062, - "total_column_articles": 67, + "total_acs": 4514, + "total_submitted": 11383, + "total_column_articles": 68, "frontend_question_id": "2141", "is_new_question": false }, @@ -10848,9 +11184,9 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 6937, - "total_submitted": 16567, - "total_column_articles": 146, + "total_acs": 7072, + "total_submitted": 16830, + "total_column_articles": 147, "frontend_question_id": "2140", "is_new_question": false }, @@ -10869,9 +11205,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": 6809, - "total_submitted": 10617, - "total_column_articles": 102, + "total_acs": 6892, + "total_submitted": 10761, + "total_column_articles": 104, "frontend_question_id": "2155", "is_new_question": false }, @@ -10890,9 +11226,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": 8316, - "total_submitted": 12373, - "total_column_articles": 114, + "total_acs": 8395, + "total_submitted": 12485, + "total_column_articles": 116, "frontend_question_id": "2138", "is_new_question": false }, @@ -10911,8 +11247,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": 155, - "total_submitted": 305, + "total_acs": 158, + "total_submitted": 311, "total_column_articles": 5, "frontend_question_id": "2123", "is_new_question": false @@ -10932,8 +11268,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": 173, - "total_submitted": 309, + "total_acs": 182, + "total_submitted": 320, "total_column_articles": 9, "frontend_question_id": "2113", "is_new_question": false @@ -10953,8 +11289,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 3278, - "total_submitted": 5116, + "total_acs": 3338, + "total_submitted": 5226, "total_column_articles": 60, "frontend_question_id": "2136", "is_new_question": false @@ -10974,8 +11310,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": 4584, - "total_submitted": 13150, + "total_acs": 4632, + "total_submitted": 13267, "total_column_articles": 91, "frontend_question_id": "2135", "is_new_question": false @@ -10995,8 +11331,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": 6015, - "total_submitted": 12738, + "total_acs": 6080, + "total_submitted": 12872, "total_column_articles": 156, "frontend_question_id": "2134", "is_new_question": false @@ -11016,9 +11352,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": 8176, - "total_submitted": 14525, - "total_column_articles": 123, + "total_acs": 8242, + "total_submitted": 14642, + "total_column_articles": 124, "frontend_question_id": "2133", "is_new_question": false }, @@ -11037,9 +11373,9 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 317, - "total_submitted": 563, - "total_column_articles": 11, + "total_acs": 339, + "total_submitted": 601, + "total_column_articles": 12, "frontend_question_id": "2118", "is_new_question": false }, @@ -11058,8 +11394,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 654, - "total_submitted": 924, + "total_acs": 691, + "total_submitted": 983, "total_column_articles": 14, "frontend_question_id": "2112", "is_new_question": false @@ -11079,8 +11415,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": 2894, - "total_submitted": 7214, + "total_acs": 2946, + "total_submitted": 7336, "total_column_articles": 74, "frontend_question_id": "2147", "is_new_question": false @@ -11100,8 +11436,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": 3336, - "total_submitted": 8537, + "total_acs": 3358, + "total_submitted": 8589, "total_column_articles": 84, "frontend_question_id": "2146", "is_new_question": false @@ -11121,8 +11457,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 4510, - "total_submitted": 13104, + "total_acs": 4549, + "total_submitted": 13201, "total_column_articles": 103, "frontend_question_id": "2145", "is_new_question": false @@ -11142,9 +11478,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": 6864, - "total_submitted": 10098, - "total_column_articles": 118, + "total_acs": 6959, + "total_submitted": 10237, + "total_column_articles": 119, "frontend_question_id": "2144", "is_new_question": false }, @@ -11163,8 +11499,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": 236, - "total_submitted": 634, + "total_acs": 263, + "total_submitted": 700, "total_column_articles": 12, "frontend_question_id": "2107", "is_new_question": false @@ -11184,8 +11520,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": 2500, - "total_submitted": 8260, + "total_acs": 2525, + "total_submitted": 8332, "total_column_articles": 58, "frontend_question_id": "2127", "is_new_question": false @@ -11205,9 +11541,9 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 7084, - "total_submitted": 14562, - "total_column_articles": 91, + "total_acs": 7151, + "total_submitted": 14700, + "total_column_articles": 93, "frontend_question_id": "2126", "is_new_question": false }, @@ -11226,9 +11562,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": 7690, - "total_submitted": 9161, - "total_column_articles": 103, + "total_acs": 7810, + "total_submitted": 9304, + "total_column_articles": 104, "frontend_question_id": "2125", "is_new_question": false }, @@ -11247,9 +11583,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": 9093, - "total_submitted": 12933, - "total_column_articles": 148, + "total_acs": 9352, + "total_submitted": 13351, + "total_column_articles": 151, "frontend_question_id": "2124", "is_new_question": false }, @@ -11268,8 +11604,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": 176, - "total_submitted": 424, + "total_acs": 191, + "total_submitted": 467, "total_column_articles": 9, "frontend_question_id": "2098", "is_new_question": false @@ -11289,8 +11625,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 3370, - "total_submitted": 8221, + "total_acs": 3408, + "total_submitted": 8286, "total_column_articles": 60, "frontend_question_id": "2122", "is_new_question": false @@ -11310,8 +11646,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 5490, - "total_submitted": 14841, + "total_acs": 5548, + "total_submitted": 14957, "total_column_articles": 137, "frontend_question_id": "2121", "is_new_question": false @@ -11331,9 +11667,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": 6469, - "total_submitted": 7869, - "total_column_articles": 93, + "total_acs": 6563, + "total_submitted": 7976, + "total_column_articles": 95, "frontend_question_id": "2120", "is_new_question": false }, @@ -11352,9 +11688,9 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 10554, - "total_submitted": 13904, - "total_column_articles": 131, + "total_acs": 10831, + "total_submitted": 14279, + "total_column_articles": 133, "frontend_question_id": "2119", "is_new_question": false }, @@ -11373,9 +11709,9 @@ "question__title": "Longest Palindrome by Concatenating Two Letter Words", "question__title_slug": "longest-palindrome-by-concatenating-two-letter-words", "question__hide": false, - "total_acs": 4451, - "total_submitted": 11510, - "total_column_articles": 95, + "total_acs": 4901, + "total_submitted": 12495, + "total_column_articles": 103, "frontend_question_id": "2131", "is_new_question": false }, @@ -11394,9 +11730,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": 6470, - "total_submitted": 7852, - "total_column_articles": 96, + "total_acs": 6678, + "total_submitted": 8115, + "total_column_articles": 100, "frontend_question_id": "2130", "is_new_question": false }, @@ -11415,9 +11751,9 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 6182, - "total_submitted": 10076, - "total_column_articles": 108, + "total_acs": 6270, + "total_submitted": 10234, + "total_column_articles": 110, "frontend_question_id": "2129", "is_new_question": false }, @@ -11436,9 +11772,9 @@ "question__title": "Minimum Operations to Make the Array K-Increasing", "question__title_slug": "minimum-operations-to-make-the-array-k-increasing", "question__hide": false, - "total_acs": 3983, - "total_submitted": 11868, - "total_column_articles": 87, + "total_acs": 4013, + "total_submitted": 11939, + "total_column_articles": 88, "frontend_question_id": "2111", "is_new_question": false }, @@ -11457,9 +11793,9 @@ "question__title": "Number of Smooth Descent Periods of a Stock", "question__title_slug": "number-of-smooth-descent-periods-of-a-stock", "question__hide": false, - "total_acs": 7718, - "total_submitted": 14880, - "total_column_articles": 136, + "total_acs": 7810, + "total_submitted": 15049, + "total_column_articles": 137, "frontend_question_id": "2110", "is_new_question": false }, @@ -11478,9 +11814,9 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 7907, - "total_submitted": 12954, - "total_column_articles": 99, + "total_acs": 8026, + "total_submitted": 13141, + "total_column_articles": 101, "frontend_question_id": "2109", "is_new_question": false }, @@ -11499,9 +11835,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": 9968, - "total_submitted": 12632, - "total_column_articles": 145, + "total_acs": 10159, + "total_submitted": 12888, + "total_column_articles": 146, "frontend_question_id": "2108", "is_new_question": false }, @@ -11520,9 +11856,9 @@ "question__title": "Minimum Cost to Reach City With Discounts", "question__title_slug": "minimum-cost-to-reach-city-with-discounts", "question__hide": false, - "total_acs": 229, - "total_submitted": 347, - "total_column_articles": 9, + "total_acs": 234, + "total_submitted": 354, + "total_column_articles": 10, "frontend_question_id": "2093", "is_new_question": false }, @@ -11541,9 +11877,9 @@ "question__title": "Maximum Fruits Harvested After at Most K Steps", "question__title_slug": "maximum-fruits-harvested-after-at-most-k-steps", "question__hide": false, - "total_acs": 4041, - "total_submitted": 12103, - "total_column_articles": 83, + "total_acs": 4073, + "total_submitted": 12202, + "total_column_articles": 84, "frontend_question_id": "2106", "is_new_question": false }, @@ -11562,8 +11898,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 5636, - "total_submitted": 10328, + "total_acs": 5707, + "total_submitted": 10499, "total_column_articles": 93, "frontend_question_id": "2105", "is_new_question": false @@ -11583,9 +11919,9 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 36998, - "total_submitted": 58909, - "total_column_articles": 347, + "total_acs": 37240, + "total_submitted": 59297, + "total_column_articles": 351, "frontend_question_id": "2104", "is_new_question": false }, @@ -11604,9 +11940,9 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 8343, - "total_submitted": 10401, - "total_column_articles": 152, + "total_acs": 8483, + "total_submitted": 10599, + "total_column_articles": 155, "frontend_question_id": "2103", "is_new_question": false }, @@ -11625,8 +11961,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": 320, - "total_submitted": 500, + "total_acs": 327, + "total_submitted": 520, "total_column_articles": 14, "frontend_question_id": "2083", "is_new_question": false @@ -11646,8 +11982,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": 1101, - "total_submitted": 1338, + "total_acs": 1186, + "total_submitted": 1435, "total_column_articles": 29, "frontend_question_id": "2084", "is_new_question": false @@ -11667,8 +12003,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 1538, - "total_submitted": 2069, + "total_acs": 1625, + "total_submitted": 2179, "total_column_articles": 26, "frontend_question_id": "2082", "is_new_question": false @@ -11688,8 +12024,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 1232, - "total_submitted": 3739, + "total_acs": 1250, + "total_submitted": 3785, "total_column_articles": 18, "frontend_question_id": "2117", "is_new_question": false @@ -11709,8 +12045,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": 2966, - "total_submitted": 9662, + "total_acs": 3007, + "total_submitted": 9756, "total_column_articles": 54, "frontend_question_id": "2116", "is_new_question": false @@ -11730,8 +12066,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": 4446, - "total_submitted": 11311, + "total_acs": 4568, + "total_submitted": 11519, "total_column_articles": 98, "frontend_question_id": "2115", "is_new_question": false @@ -11751,9 +12087,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": 12001, - "total_submitted": 13969, - "total_column_articles": 162, + "total_acs": 12337, + "total_submitted": 14341, + "total_column_articles": 165, "frontend_question_id": "2114", "is_new_question": false }, @@ -11772,9 +12108,9 @@ "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": 136, - "total_submitted": 228, - "total_column_articles": 6, + "total_acs": 148, + "total_submitted": 242, + "total_column_articles": 7, "frontend_question_id": "2077", "is_new_question": false }, @@ -11793,9 +12129,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": 5758, - "total_submitted": 13481, - "total_column_articles": 175, + "total_acs": 5859, + "total_submitted": 13684, + "total_column_articles": 176, "frontend_question_id": "2096", "is_new_question": false }, @@ -11814,9 +12150,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": 9784, - "total_submitted": 16755, - "total_column_articles": 132, + "total_acs": 10042, + "total_submitted": 17218, + "total_column_articles": 138, "frontend_question_id": "2095", "is_new_question": false }, @@ -11835,9 +12171,9 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 8574, - "total_submitted": 15442, - "total_column_articles": 139, + "total_acs": 8681, + "total_submitted": 15630, + "total_column_articles": 140, "frontend_question_id": "2094", "is_new_question": false }, @@ -11856,8 +12192,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 1406, - "total_submitted": 2033, + "total_acs": 1505, + "total_submitted": 2214, "total_column_articles": 26, "frontend_question_id": "2072", "is_new_question": false @@ -11877,9 +12213,9 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 4809, - "total_submitted": 17218, - "total_column_articles": 118, + "total_acs": 4853, + "total_submitted": 17331, + "total_column_articles": 120, "frontend_question_id": "2092", "is_new_question": false }, @@ -11898,9 +12234,9 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 6727, - "total_submitted": 11867, - "total_column_articles": 129, + "total_acs": 6793, + "total_submitted": 11972, + "total_column_articles": 130, "frontend_question_id": "2091", "is_new_question": false }, @@ -11919,9 +12255,9 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 6640, - "total_submitted": 18381, - "total_column_articles": 105, + "total_acs": 6689, + "total_submitted": 18512, + "total_column_articles": 106, "frontend_question_id": "2090", "is_new_question": false }, @@ -11940,9 +12276,9 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 12385, - "total_submitted": 15379, - "total_column_articles": 162, + "total_acs": 12669, + "total_submitted": 15770, + "total_column_articles": 164, "frontend_question_id": "2089", "is_new_question": false }, @@ -11961,8 +12297,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 123, - "total_submitted": 242, + "total_acs": 126, + "total_submitted": 245, "total_column_articles": 9, "frontend_question_id": "2067", "is_new_question": false @@ -11982,8 +12318,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 1068, - "total_submitted": 1336, + "total_acs": 1140, + "total_submitted": 1428, "total_column_articles": 25, "frontend_question_id": "2066", "is_new_question": false @@ -12003,9 +12339,9 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 2428, - "total_submitted": 4530, - "total_column_articles": 72, + "total_acs": 2463, + "total_submitted": 4599, + "total_column_articles": 73, "frontend_question_id": "2102", "is_new_question": false }, @@ -12024,8 +12360,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 3969, - "total_submitted": 10101, + "total_acs": 4087, + "total_submitted": 10419, "total_column_articles": 85, "frontend_question_id": "2101", "is_new_question": false @@ -12045,8 +12381,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": 32609, - "total_submitted": 67020, + "total_acs": 32742, + "total_submitted": 67250, "total_column_articles": 404, "frontend_question_id": "2100", "is_new_question": false @@ -12066,9 +12402,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": 6309, - "total_submitted": 12933, - "total_column_articles": 136, + "total_acs": 6414, + "total_submitted": 13178, + "total_column_articles": 140, "frontend_question_id": "2099", "is_new_question": false }, @@ -12087,9 +12423,9 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 348, - "total_submitted": 727, - "total_column_articles": 17, + "total_acs": 390, + "total_submitted": 825, + "total_column_articles": 18, "frontend_question_id": "2061", "is_new_question": false }, @@ -12108,9 +12444,9 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 2770, - "total_submitted": 6561, - "total_column_articles": 73, + "total_acs": 2784, + "total_submitted": 6614, + "total_column_articles": 75, "frontend_question_id": "2081", "is_new_question": false }, @@ -12129,8 +12465,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 2263, - "total_submitted": 6182, + "total_acs": 2295, + "total_submitted": 6242, "total_column_articles": 49, "frontend_question_id": "2097", "is_new_question": false @@ -12150,8 +12486,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 1954, - "total_submitted": 7468, + "total_acs": 1978, + "total_submitted": 7515, "total_column_articles": 47, "frontend_question_id": "2132", "is_new_question": false @@ -12171,9 +12507,9 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 9147, - "total_submitted": 12498, - "total_column_articles": 145, + "total_acs": 9431, + "total_submitted": 12885, + "total_column_articles": 150, "frontend_question_id": "2078", "is_new_question": false }, @@ -12192,9 +12528,9 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 3031, - "total_submitted": 6037, - "total_column_articles": 73, + "total_acs": 3052, + "total_submitted": 6075, + "total_column_articles": 75, "frontend_question_id": "2076", "is_new_question": false }, @@ -12213,8 +12549,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 3916, - "total_submitted": 8460, + "total_acs": 3950, + "total_submitted": 8532, "total_column_articles": 72, "frontend_question_id": "2075", "is_new_question": false @@ -12234,9 +12570,9 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 5093, - "total_submitted": 11725, - "total_column_articles": 134, + "total_acs": 5140, + "total_submitted": 11819, + "total_column_articles": 135, "frontend_question_id": "2074", "is_new_question": false }, @@ -12255,9 +12591,9 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 9234, - "total_submitted": 14801, - "total_column_articles": 152, + "total_acs": 9477, + "total_submitted": 15239, + "total_column_articles": 154, "frontend_question_id": "2073", "is_new_question": false }, @@ -12276,8 +12612,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": 785, - "total_submitted": 1183, + "total_acs": 825, + "total_submitted": 1239, "total_column_articles": 17, "frontend_question_id": "2051", "is_new_question": false @@ -12297,8 +12633,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 1935, - "total_submitted": 3082, + "total_acs": 1955, + "total_submitted": 3117, "total_column_articles": 47, "frontend_question_id": "2088", "is_new_question": false @@ -12318,8 +12654,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": 3010, - "total_submitted": 6228, + "total_acs": 3049, + "total_submitted": 6295, "total_column_articles": 66, "frontend_question_id": "2087", "is_new_question": false @@ -12339,9 +12675,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": 4037, - "total_submitted": 8865, - "total_column_articles": 82, + "total_acs": 4098, + "total_submitted": 8985, + "total_column_articles": 83, "frontend_question_id": "2086", "is_new_question": false }, @@ -12360,9 +12696,9 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 5939, - "total_submitted": 8217, - "total_column_articles": 103, + "total_acs": 6040, + "total_submitted": 8358, + "total_column_articles": 104, "frontend_question_id": "2085", "is_new_question": false }, @@ -12381,8 +12717,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 2438, - "total_submitted": 4549, + "total_acs": 2457, + "total_submitted": 4586, "total_column_articles": 63, "frontend_question_id": "2065", "is_new_question": false @@ -12402,8 +12738,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": 4618, - "total_submitted": 10619, + "total_acs": 4680, + "total_submitted": 10765, "total_column_articles": 87, "frontend_question_id": "2064", "is_new_question": false @@ -12423,9 +12759,9 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 5293, - "total_submitted": 10481, - "total_column_articles": 116, + "total_acs": 5388, + "total_submitted": 10632, + "total_column_articles": 118, "frontend_question_id": "2063", "is_new_question": false }, @@ -12444,8 +12780,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 6755, - "total_submitted": 10982, + "total_acs": 6823, + "total_submitted": 11100, "total_column_articles": 119, "frontend_question_id": "2062", "is_new_question": false @@ -12465,8 +12801,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 1151, - "total_submitted": 1522, + "total_acs": 1220, + "total_submitted": 1606, "total_column_articles": 24, "frontend_question_id": "2041", "is_new_question": false @@ -12486,8 +12822,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": 1249, - "total_submitted": 3303, + "total_acs": 1254, + "total_submitted": 3331, "total_column_articles": 23, "frontend_question_id": "2060", "is_new_question": false @@ -12507,9 +12843,9 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 5180, - "total_submitted": 11476, - "total_column_articles": 106, + "total_acs": 5559, + "total_submitted": 12077, + "total_column_articles": 107, "frontend_question_id": "2059", "is_new_question": false }, @@ -12528,8 +12864,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": 6286, - "total_submitted": 11151, + "total_acs": 6354, + "total_submitted": 11274, "total_column_articles": 87, "frontend_question_id": "2058", "is_new_question": false @@ -12549,9 +12885,9 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 8894, - "total_submitted": 11634, - "total_column_articles": 84, + "total_acs": 9106, + "total_submitted": 11922, + "total_column_articles": 85, "frontend_question_id": "2057", "is_new_question": false }, @@ -12570,8 +12906,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": 1631, - "total_submitted": 4563, + "total_acs": 1665, + "total_submitted": 4717, "total_column_articles": 37, "frontend_question_id": "2071", "is_new_question": false @@ -12591,9 +12927,9 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 3236, - "total_submitted": 7343, - "total_column_articles": 97, + "total_acs": 3304, + "total_submitted": 7478, + "total_column_articles": 98, "frontend_question_id": "2070", "is_new_question": false }, @@ -12612,9 +12948,9 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 3572, - "total_submitted": 17141, - "total_column_articles": 99, + "total_acs": 3658, + "total_submitted": 17443, + "total_column_articles": 100, "frontend_question_id": "2069", "is_new_question": false }, @@ -12633,9 +12969,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": 6043, - "total_submitted": 8466, - "total_column_articles": 109, + "total_acs": 6258, + "total_submitted": 8809, + "total_column_articles": 111, "frontend_question_id": "2068", "is_new_question": false }, @@ -12654,8 +12990,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 2877, - "total_submitted": 4979, + "total_acs": 2931, + "total_submitted": 5071, "total_column_articles": 90, "frontend_question_id": "2050", "is_new_question": false @@ -12675,8 +13011,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 25492, - "total_submitted": 49352, + "total_acs": 25548, + "total_submitted": 49473, "total_column_articles": 299, "frontend_question_id": "2049", "is_new_question": false @@ -12696,9 +13032,9 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 5011, - "total_submitted": 11532, - "total_column_articles": 104, + "total_acs": 5070, + "total_submitted": 11649, + "total_column_articles": 105, "frontend_question_id": "2048", "is_new_question": false }, @@ -12717,8 +13053,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": 26406, - "total_submitted": 67510, + "total_acs": 26490, + "total_submitted": 67751, "total_column_articles": 393, "frontend_question_id": "2047", "is_new_question": false @@ -12738,8 +13074,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 2505, - "total_submitted": 3132, + "total_acs": 2589, + "total_submitted": 3240, "total_column_articles": 30, "frontend_question_id": "2026", "is_new_question": false @@ -12759,8 +13095,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 15883, - "total_submitted": 29632, + "total_acs": 15913, + "total_submitted": 29696, "total_column_articles": 161, "frontend_question_id": "2045", "is_new_question": false @@ -12780,9 +13116,9 @@ "question__title": "Count Number of Maximum Bitwise-OR Subsets", "question__title_slug": "count-number-of-maximum-bitwise-or-subsets", "question__hide": false, - "total_acs": 34067, - "total_submitted": 41625, - "total_column_articles": 371, + "total_acs": 34251, + "total_submitted": 41865, + "total_column_articles": 377, "frontend_question_id": "2044", "is_new_question": false }, @@ -12801,9 +13137,9 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 33176, - "total_submitted": 49431, - "total_column_articles": 285, + "total_acs": 33425, + "total_submitted": 49926, + "total_column_articles": 286, "frontend_question_id": "2043", "is_new_question": false }, @@ -12822,9 +13158,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": 9727, - "total_submitted": 14721, - "total_column_articles": 165, + "total_acs": 9834, + "total_submitted": 14902, + "total_column_articles": 167, "frontend_question_id": "2042", "is_new_question": false }, @@ -12843,9 +13179,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": 1015, - "total_submitted": 1426, - "total_column_articles": 25, + "total_acs": 1087, + "total_submitted": 1533, + "total_column_articles": 26, "frontend_question_id": "2020", "is_new_question": false }, @@ -12864,8 +13200,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": 840, - "total_submitted": 1379, + "total_acs": 848, + "total_submitted": 1399, "total_column_articles": 18, "frontend_question_id": "2056", "is_new_question": false @@ -12885,8 +13221,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 32597, - "total_submitted": 75054, + "total_acs": 32727, + "total_submitted": 75332, "total_column_articles": 419, "frontend_question_id": "2055", "is_new_question": false @@ -12906,9 +13242,9 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 3492, - "total_submitted": 9666, - "total_column_articles": 73, + "total_acs": 3531, + "total_submitted": 9754, + "total_column_articles": 74, "frontend_question_id": "2054", "is_new_question": false }, @@ -12927,9 +13263,9 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 6717, - "total_submitted": 9277, - "total_column_articles": 112, + "total_acs": 6823, + "total_submitted": 9436, + "total_column_articles": 113, "frontend_question_id": "2053", "is_new_question": false }, @@ -12948,9 +13284,9 @@ "question__title": "Partition Array Into Two Arrays to Minimize Sum Difference", "question__title_slug": "partition-array-into-two-arrays-to-minimize-sum-difference", "question__hide": false, - "total_acs": 2647, - "total_submitted": 8092, - "total_column_articles": 55, + "total_acs": 2710, + "total_submitted": 8282, + "total_column_articles": 57, "frontend_question_id": "2035", "is_new_question": false }, @@ -12969,8 +13305,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 21504, - "total_submitted": 46465, + "total_acs": 21614, + "total_submitted": 46777, "total_column_articles": 224, "frontend_question_id": "2034", "is_new_question": false @@ -12990,9 +13326,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": 5316, - "total_submitted": 12899, - "total_column_articles": 103, + "total_acs": 5365, + "total_submitted": 12980, + "total_column_articles": 104, "frontend_question_id": "2033", "is_new_question": false }, @@ -13011,9 +13347,9 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 8742, - "total_submitted": 13272, - "total_column_articles": 168, + "total_acs": 8860, + "total_submitted": 13443, + "total_column_articles": 171, "frontend_question_id": "2032", "is_new_question": false }, @@ -13032,9 +13368,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": 728, - "total_submitted": 1123, - "total_column_articles": 25, + "total_acs": 824, + "total_submitted": 1280, + "total_column_articles": 27, "frontend_question_id": "2010", "is_new_question": false }, @@ -13053,8 +13389,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": 1675, - "total_submitted": 4808, + "total_acs": 1686, + "total_submitted": 4856, "total_column_articles": 48, "frontend_question_id": "2030", "is_new_question": false @@ -13074,8 +13410,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 19522, - "total_submitted": 41475, + "total_acs": 19540, + "total_submitted": 41509, "total_column_articles": 196, "frontend_question_id": "2029", "is_new_question": false @@ -13095,8 +13431,8 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 33136, - "total_submitted": 65373, + "total_acs": 33250, + "total_submitted": 65607, "total_column_articles": 381, "frontend_question_id": "2028", "is_new_question": false @@ -13116,8 +13452,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 7399, - "total_submitted": 12846, + "total_acs": 7484, + "total_submitted": 12982, "total_column_articles": 100, "frontend_question_id": "2027", "is_new_question": false @@ -13137,8 +13473,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 79, - "total_submitted": 152, + "total_acs": 82, + "total_submitted": 157, "total_column_articles": 8, "frontend_question_id": "2005", "is_new_question": false @@ -13158,8 +13494,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": 702, - "total_submitted": 1673, + "total_acs": 746, + "total_submitted": 1783, "total_column_articles": 26, "frontend_question_id": "2004", "is_new_question": false @@ -13179,8 +13515,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": 19563, - "total_submitted": 35083, + "total_acs": 19580, + "total_submitted": 35113, "total_column_articles": 177, "frontend_question_id": "2039", "is_new_question": false @@ -13200,8 +13536,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": 1507, - "total_submitted": 4534, + "total_acs": 1528, + "total_submitted": 4582, "total_column_articles": 27, "frontend_question_id": "2040", "is_new_question": false @@ -13221,8 +13557,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": 33648, - "total_submitted": 52866, + "total_acs": 33698, + "total_submitted": 52942, "total_column_articles": 442, "frontend_question_id": "2038", "is_new_question": false @@ -13242,8 +13578,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": 6353, - "total_submitted": 7733, + "total_acs": 6463, + "total_submitted": 7872, "total_column_articles": 99, "frontend_question_id": "2037", "is_new_question": false @@ -13263,9 +13599,9 @@ "question__title": "The Score of Students Solving Math Expression", "question__title_slug": "the-score-of-students-solving-math-expression", "question__hide": false, - "total_acs": 1494, - "total_submitted": 4110, - "total_column_articles": 40, + "total_acs": 1514, + "total_submitted": 4163, + "total_column_articles": 41, "frontend_question_id": "2019", "is_new_question": false }, @@ -13284,8 +13620,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": 2599, - "total_submitted": 6243, + "total_acs": 2625, + "total_submitted": 6325, "total_column_articles": 57, "frontend_question_id": "2018", "is_new_question": false @@ -13305,9 +13641,9 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 4839, - "total_submitted": 12988, - "total_column_articles": 114, + "total_acs": 4887, + "total_submitted": 13105, + "total_column_articles": 115, "frontend_question_id": "2017", "is_new_question": false }, @@ -13326,8 +13662,8 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 41024, - "total_submitted": 68264, + "total_acs": 41303, + "total_submitted": 68896, "total_column_articles": 469, "frontend_question_id": "2016", "is_new_question": false @@ -13347,8 +13683,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 1493, - "total_submitted": 3196, + "total_acs": 1569, + "total_submitted": 3366, "total_column_articles": 23, "frontend_question_id": "1990", "is_new_question": false @@ -13368,8 +13704,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": 219, - "total_submitted": 390, + "total_acs": 232, + "total_submitted": 412, "total_column_articles": 12, "frontend_question_id": "2015", "is_new_question": false @@ -13389,9 +13725,9 @@ "question__title": "Smallest Greater Multiple Made of Two Digits", "question__title_slug": "smallest-greater-multiple-made-of-two-digits", "question__hide": false, - "total_acs": 164, - "total_submitted": 377, - "total_column_articles": 11, + "total_acs": 172, + "total_submitted": 391, + "total_column_articles": 12, "frontend_question_id": "1999", "is_new_question": false }, @@ -13410,8 +13746,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 1897, - "total_submitted": 3472, + "total_acs": 1917, + "total_submitted": 3521, "total_column_articles": 28, "frontend_question_id": "2014", "is_new_question": false @@ -13431,9 +13767,9 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 20024, - "total_submitted": 35445, - "total_column_articles": 231, + "total_acs": 20111, + "total_submitted": 35656, + "total_column_articles": 232, "frontend_question_id": "2013", "is_new_question": false }, @@ -13452,8 +13788,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 5142, - "total_submitted": 13578, + "total_acs": 5177, + "total_submitted": 13640, "total_column_articles": 90, "frontend_question_id": "2012", "is_new_question": false @@ -13473,9 +13809,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": 15578, - "total_submitted": 17997, - "total_column_articles": 175, + "total_acs": 15915, + "total_submitted": 18379, + "total_column_articles": 178, "frontend_question_id": "2011", "is_new_question": false }, @@ -13494,9 +13830,9 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 2159, - "total_submitted": 3248, - "total_column_articles": 36, + "total_acs": 2332, + "total_submitted": 3527, + "total_column_articles": 39, "frontend_question_id": "1988", "is_new_question": false }, @@ -13515,9 +13851,9 @@ "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": 1793, - "total_submitted": 6329, - "total_column_articles": 50, + "total_acs": 1817, + "total_submitted": 6422, + "total_column_articles": 52, "frontend_question_id": "2025", "is_new_question": false }, @@ -13536,8 +13872,8 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 34973, - "total_submitted": 61210, + "total_acs": 35215, + "total_submitted": 61640, "total_column_articles": 403, "frontend_question_id": "2024", "is_new_question": false @@ -13557,8 +13893,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": 4673, - "total_submitted": 6335, + "total_acs": 4748, + "total_submitted": 6433, "total_column_articles": 81, "frontend_question_id": "2023", "is_new_question": false @@ -13578,8 +13914,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 36514, - "total_submitted": 54913, + "total_acs": 36640, + "total_submitted": 55119, "total_column_articles": 430, "frontend_question_id": "2022", "is_new_question": false @@ -13599,8 +13935,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": 2372, - "total_submitted": 5810, + "total_acs": 2384, + "total_submitted": 5834, "total_column_articles": 51, "frontend_question_id": "2003", "is_new_question": false @@ -13620,9 +13956,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": 4836, - "total_submitted": 8118, - "total_column_articles": 106, + "total_acs": 4878, + "total_submitted": 8180, + "total_column_articles": 107, "frontend_question_id": "2002", "is_new_question": false }, @@ -13641,8 +13977,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 7160, - "total_submitted": 19113, + "total_acs": 7206, + "total_submitted": 19223, "total_column_articles": 146, "frontend_question_id": "2001", "is_new_question": false @@ -13662,9 +13998,9 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 32646, - "total_submitted": 41289, - "total_column_articles": 401, + "total_acs": 32954, + "total_submitted": 41744, + "total_column_articles": 402, "frontend_question_id": "2000", "is_new_question": false }, @@ -13683,9 +14019,9 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 1739, - "total_submitted": 3344, - "total_column_articles": 23, + "total_acs": 1837, + "total_submitted": 3540, + "total_column_articles": 24, "frontend_question_id": "1978", "is_new_question": false }, @@ -13704,8 +14040,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": 281, - "total_submitted": 453, + "total_acs": 288, + "total_submitted": 463, "total_column_articles": 16, "frontend_question_id": "1973", "is_new_question": false @@ -13725,8 +14061,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 2138, - "total_submitted": 4910, + "total_acs": 2163, + "total_submitted": 4964, "total_column_articles": 39, "frontend_question_id": "1998", "is_new_question": false @@ -13746,9 +14082,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": 2848, - "total_submitted": 8314, - "total_column_articles": 47, + "total_acs": 2883, + "total_submitted": 8390, + "total_column_articles": 49, "frontend_question_id": "1997", "is_new_question": false }, @@ -13767,9 +14103,9 @@ "question__title": "The Number of Weak Characters in the Game", "question__title_slug": "the-number-of-weak-characters-in-the-game", "question__hide": false, - "total_acs": 27310, - "total_submitted": 65824, - "total_column_articles": 282, + "total_acs": 27438, + "total_submitted": 66112, + "total_column_articles": 283, "frontend_question_id": "1996", "is_new_question": false }, @@ -13788,9 +14124,9 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 34520, - "total_submitted": 52099, - "total_column_articles": 255, + "total_acs": 34815, + "total_submitted": 52492, + "total_column_articles": 258, "frontend_question_id": "1995", "is_new_question": false }, @@ -13809,9 +14145,9 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 4687, - "total_submitted": 10553, - "total_column_articles": 90, + "total_acs": 4874, + "total_submitted": 10965, + "total_column_articles": 94, "frontend_question_id": "1971", "is_new_question": false }, @@ -13830,8 +14166,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": 1165, - "total_submitted": 2563, + "total_acs": 1263, + "total_submitted": 2813, "total_column_articles": 28, "frontend_question_id": "1972", "is_new_question": false @@ -13851,8 +14187,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": 2074, - "total_submitted": 4970, + "total_acs": 2100, + "total_submitted": 5028, "total_column_articles": 54, "frontend_question_id": "2009", "is_new_question": false @@ -13872,9 +14208,9 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 4126, - "total_submitted": 9362, - "total_column_articles": 67, + "total_acs": 4197, + "total_submitted": 9512, + "total_column_articles": 68, "frontend_question_id": "2008", "is_new_question": false }, @@ -13893,9 +14229,9 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 5047, - "total_submitted": 15266, - "total_column_articles": 97, + "total_acs": 5110, + "total_submitted": 15428, + "total_column_articles": 98, "frontend_question_id": "2007", "is_new_question": false }, @@ -13914,8 +14250,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": 45538, - "total_submitted": 53489, + "total_acs": 46034, + "total_submitted": 54172, "total_column_articles": 463, "frontend_question_id": "2006", "is_new_question": false @@ -13935,8 +14271,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 1886, - "total_submitted": 3876, + "total_acs": 1905, + "total_submitted": 3909, "total_column_articles": 33, "frontend_question_id": "1987", "is_new_question": false @@ -13956,9 +14292,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": 5066, - "total_submitted": 16602, - "total_column_articles": 91, + "total_acs": 5122, + "total_submitted": 16746, + "total_column_articles": 93, "frontend_question_id": "1986", "is_new_question": false }, @@ -13977,9 +14313,9 @@ "question__title": "Find the Kth Largest Integer in the Array", "question__title_slug": "find-the-kth-largest-integer-in-the-array", "question__hide": false, - "total_acs": 8507, - "total_submitted": 20373, - "total_column_articles": 123, + "total_acs": 8655, + "total_submitted": 20706, + "total_column_articles": 125, "frontend_question_id": "1985", "is_new_question": false }, @@ -13998,9 +14334,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": 40467, - "total_submitted": 64544, - "total_column_articles": 494, + "total_acs": 40809, + "total_submitted": 65183, + "total_column_articles": 495, "frontend_question_id": "1984", "is_new_question": false }, @@ -14019,8 +14355,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": 144, - "total_submitted": 226, + "total_acs": 152, + "total_submitted": 237, "total_column_articles": 10, "frontend_question_id": "1966", "is_new_question": false @@ -14040,9 +14376,9 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 13585, - "total_submitted": 18616, - "total_column_articles": 116, + "total_acs": 15407, + "total_submitted": 21177, + "total_column_articles": 127, "frontend_question_id": "1965", "is_new_question": false }, @@ -14061,8 +14397,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 1133, - "total_submitted": 2457, + "total_acs": 1144, + "total_submitted": 2483, "total_column_articles": 23, "frontend_question_id": "1982", "is_new_question": false @@ -14082,8 +14418,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": 5671, - "total_submitted": 17821, + "total_acs": 5725, + "total_submitted": 17997, "total_column_articles": 96, "frontend_question_id": "1981", "is_new_question": false @@ -14103,9 +14439,9 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 7299, - "total_submitted": 12314, - "total_column_articles": 128, + "total_acs": 7362, + "total_submitted": 12424, + "total_column_articles": 129, "frontend_question_id": "1980", "is_new_question": false }, @@ -14124,9 +14460,9 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 13794, - "total_submitted": 17680, - "total_column_articles": 193, + "total_acs": 14008, + "total_submitted": 17947, + "total_column_articles": 195, "frontend_question_id": "1979", "is_new_question": false }, @@ -14145,8 +14481,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 15511, - "total_submitted": 27241, + "total_acs": 15530, + "total_submitted": 27300, "total_column_articles": 175, "frontend_question_id": "1994", "is_new_question": false @@ -14166,9 +14502,9 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 2650, - "total_submitted": 6772, - "total_column_articles": 57, + "total_acs": 2690, + "total_submitted": 6862, + "total_column_articles": 58, "frontend_question_id": "1993", "is_new_question": false }, @@ -14187,8 +14523,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 4433, - "total_submitted": 7437, + "total_acs": 4476, + "total_submitted": 7514, "total_column_articles": 96, "frontend_question_id": "1992", "is_new_question": false @@ -14208,9 +14544,9 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 12068, - "total_submitted": 18470, - "total_column_articles": 168, + "total_acs": 12433, + "total_submitted": 19088, + "total_column_articles": 173, "frontend_question_id": "1991", "is_new_question": false }, @@ -14229,8 +14565,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": 2813, - "total_submitted": 5721, + "total_acs": 2849, + "total_submitted": 5775, "total_column_articles": 56, "frontend_question_id": "1970", "is_new_question": false @@ -14250,8 +14586,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": 3381, - "total_submitted": 11604, + "total_acs": 3397, + "total_submitted": 11636, "total_column_articles": 50, "frontend_question_id": "1969", "is_new_question": false @@ -14271,8 +14607,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": 8916, - "total_submitted": 11277, + "total_acs": 9037, + "total_submitted": 11437, "total_column_articles": 121, "frontend_question_id": "1967", "is_new_question": false @@ -14292,9 +14628,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": 1805, - "total_submitted": 2637, - "total_column_articles": 35, + "total_acs": 1942, + "total_submitted": 2853, + "total_column_articles": 36, "frontend_question_id": "1951", "is_new_question": false }, @@ -14313,9 +14649,9 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 1503, - "total_submitted": 2747, - "total_column_articles": 31, + "total_acs": 1649, + "total_submitted": 3036, + "total_column_articles": 32, "frontend_question_id": "1949", "is_new_question": false }, @@ -14334,8 +14670,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": 3826, - "total_submitted": 9458, + "total_acs": 3852, + "total_submitted": 9505, "total_column_articles": 55, "frontend_question_id": "1964", "is_new_question": false @@ -14355,9 +14691,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": 5674, - "total_submitted": 8982, - "total_column_articles": 71, + "total_acs": 5729, + "total_submitted": 9068, + "total_column_articles": 73, "frontend_question_id": "1963", "is_new_question": false }, @@ -14376,9 +14712,9 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 6997, - "total_submitted": 15410, - "total_column_articles": 95, + "total_acs": 7064, + "total_submitted": 15526, + "total_column_articles": 96, "frontend_question_id": "1962", "is_new_question": false }, @@ -14397,9 +14733,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": 9580, - "total_submitted": 17969, - "total_column_articles": 106, + "total_acs": 9826, + "total_submitted": 18406, + "total_column_articles": 110, "frontend_question_id": "1961", "is_new_question": false }, @@ -14418,8 +14754,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 1736, - "total_submitted": 2906, + "total_acs": 1830, + "total_submitted": 3077, "total_column_articles": 21, "frontend_question_id": "1939", "is_new_question": false @@ -14439,8 +14775,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 1106, - "total_submitted": 4023, + "total_acs": 1115, + "total_submitted": 4036, "total_column_articles": 22, "frontend_question_id": "1977", "is_new_question": false @@ -14460,9 +14796,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": 3613, - "total_submitted": 11203, - "total_column_articles": 71, + "total_acs": 4178, + "total_submitted": 11938, + "total_column_articles": 73, "frontend_question_id": "1976", "is_new_question": false }, @@ -14481,9 +14817,9 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 3955, - "total_submitted": 9847, - "total_column_articles": 55, + "total_acs": 4094, + "total_submitted": 10188, + "total_column_articles": 61, "frontend_question_id": "1975", "is_new_question": false }, @@ -14502,9 +14838,9 @@ "question__title": "Minimum Time to Type Word Using Special Typewriter", "question__title_slug": "minimum-time-to-type-word-using-special-typewriter", "question__hide": false, - "total_acs": 6579, - "total_submitted": 9106, - "total_column_articles": 101, + "total_acs": 6697, + "total_submitted": 9272, + "total_column_articles": 102, "frontend_question_id": "1974", "is_new_question": false }, @@ -14523,8 +14859,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 1178, - "total_submitted": 1594, + "total_acs": 1236, + "total_submitted": 1680, "total_column_articles": 27, "frontend_question_id": "1934", "is_new_question": false @@ -14544,9 +14880,9 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 3166, - "total_submitted": 6158, - "total_column_articles": 48, + "total_acs": 3200, + "total_submitted": 6214, + "total_column_articles": 49, "frontend_question_id": "1955", "is_new_question": false }, @@ -14565,9 +14901,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": 5560, - "total_submitted": 14738, - "total_column_articles": 81, + "total_acs": 5593, + "total_submitted": 14800, + "total_column_articles": 82, "frontend_question_id": "1968", "is_new_question": false }, @@ -14586,9 +14922,9 @@ "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": 5245, - "total_submitted": 15061, - "total_column_articles": 93, + "total_acs": 5316, + "total_submitted": 15197, + "total_column_articles": 95, "frontend_question_id": "1953", "is_new_question": false }, @@ -14607,9 +14943,9 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 9931, - "total_submitted": 18198, - "total_column_articles": 124, + "total_acs": 10135, + "total_submitted": 18543, + "total_column_articles": 125, "frontend_question_id": "1952", "is_new_question": false }, @@ -14628,8 +14964,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": 187, - "total_submitted": 406, + "total_acs": 192, + "total_submitted": 416, "total_column_articles": 14, "frontend_question_id": "2052", "is_new_question": false @@ -14649,8 +14985,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": 1949, - "total_submitted": 4446, + "total_acs": 1970, + "total_submitted": 4475, "total_column_articles": 41, "frontend_question_id": "1959", "is_new_question": false @@ -14670,8 +15006,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 3000, - "total_submitted": 6942, + "total_acs": 3025, + "total_submitted": 6984, "total_column_articles": 54, "frontend_question_id": "1958", "is_new_question": false @@ -14691,8 +15027,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 1272, - "total_submitted": 2460, + "total_acs": 1282, + "total_submitted": 2486, "total_column_articles": 23, "frontend_question_id": "1948", "is_new_question": false @@ -14712,9 +15048,9 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 5204, - "total_submitted": 9252, - "total_column_articles": 103, + "total_acs": 5259, + "total_submitted": 9323, + "total_column_articles": 104, "frontend_question_id": "1947", "is_new_question": false }, @@ -14733,8 +15069,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 6258, - "total_submitted": 20007, + "total_acs": 6316, + "total_submitted": 20167, "total_column_articles": 90, "frontend_question_id": "1946", "is_new_question": false @@ -14754,9 +15090,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": 8873, - "total_submitted": 13577, - "total_column_articles": 120, + "total_acs": 8988, + "total_submitted": 13761, + "total_column_articles": 123, "frontend_question_id": "1945", "is_new_question": false }, @@ -14775,8 +15111,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 377, - "total_submitted": 626, + "total_acs": 404, + "total_submitted": 669, "total_column_articles": 17, "frontend_question_id": "2021", "is_new_question": false @@ -14796,9 +15132,9 @@ "question__title": "Erect the Fence II", "question__title_slug": "erect-the-fence-ii", "question__hide": false, - "total_acs": 118, - "total_submitted": 314, - "total_column_articles": 8, + "total_acs": 123, + "total_submitted": 331, + "total_column_articles": 9, "frontend_question_id": "1924", "is_new_question": false }, @@ -14817,8 +15153,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": 237, - "total_submitted": 651, + "total_acs": 239, + "total_submitted": 659, "total_column_articles": 14, "frontend_question_id": "1956", "is_new_question": false @@ -14838,8 +15174,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": 285, - "total_submitted": 549, + "total_acs": 299, + "total_submitted": 586, "total_column_articles": 9, "frontend_question_id": "1950", "is_new_question": false @@ -14859,8 +15195,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 668, - "total_submitted": 886, + "total_acs": 685, + "total_submitted": 924, "total_column_articles": 34, "frontend_question_id": "1940", "is_new_question": false @@ -14880,8 +15216,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": 791, - "total_submitted": 1602, + "total_acs": 800, + "total_submitted": 1622, "total_column_articles": 33, "frontend_question_id": "1933", "is_new_question": false @@ -14901,8 +15237,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 512, - "total_submitted": 1051, + "total_acs": 528, + "total_submitted": 1087, "total_column_articles": 9, "frontend_question_id": "1918", "is_new_question": false @@ -14922,9 +15258,9 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 1397, - "total_submitted": 3784, - "total_column_articles": 45, + "total_acs": 1404, + "total_submitted": 3815, + "total_column_articles": 46, "frontend_question_id": "1938", "is_new_question": false }, @@ -14943,9 +15279,9 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 4126, - "total_submitted": 15385, - "total_column_articles": 74, + "total_acs": 4155, + "total_submitted": 15458, + "total_column_articles": 75, "frontend_question_id": "1937", "is_new_question": false }, @@ -14964,9 +15300,9 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 6951, - "total_submitted": 15215, - "total_column_articles": 87, + "total_acs": 6995, + "total_submitted": 15295, + "total_column_articles": 89, "frontend_question_id": "1936", "is_new_question": false }, @@ -14985,9 +15321,9 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 42, - "total_submitted": 146, - "total_column_articles": 1, + "total_acs": 71, + "total_submitted": 198, + "total_column_articles": 4, "frontend_question_id": "2307", "is_new_question": false }, @@ -15006,8 +15342,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 1194, - "total_submitted": 2789, + "total_acs": 1244, + "total_submitted": 2895, "total_column_articles": 32, "frontend_question_id": "1919", "is_new_question": false @@ -15027,8 +15363,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 1270, - "total_submitted": 3839, + "total_acs": 1319, + "total_submitted": 4029, "total_column_articles": 20, "frontend_question_id": "1917", "is_new_question": false @@ -15048,8 +15384,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 380, - "total_submitted": 608, + "total_acs": 389, + "total_submitted": 626, "total_column_articles": 14, "frontend_question_id": "1908", "is_new_question": false @@ -15069,8 +15405,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": 2553, - "total_submitted": 4408, + "total_acs": 2586, + "total_submitted": 4451, "total_column_articles": 72, "frontend_question_id": "1931", "is_new_question": false @@ -15090,9 +15426,9 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 1614, - "total_submitted": 4773, - "total_column_articles": 45, + "total_acs": 1625, + "total_submitted": 4844, + "total_column_articles": 46, "frontend_question_id": "1932", "is_new_question": false }, @@ -15111,9 +15447,9 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 6656, - "total_submitted": 13481, - "total_column_articles": 113, + "total_acs": 6717, + "total_submitted": 13606, + "total_column_articles": 115, "frontend_question_id": "1930", "is_new_question": false }, @@ -15132,9 +15468,9 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 27166, - "total_submitted": 31135, - "total_column_articles": 246, + "total_acs": 27718, + "total_submitted": 31780, + "total_column_articles": 249, "frontend_question_id": "1929", "is_new_question": false }, @@ -15153,8 +15489,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 1630, - "total_submitted": 2688, + "total_acs": 1696, + "total_submitted": 2775, "total_column_articles": 36, "frontend_question_id": "1907", "is_new_question": false @@ -15174,8 +15510,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 66, - "total_submitted": 98, + "total_acs": 72, + "total_submitted": 106, "total_column_articles": 5, "frontend_question_id": "2297", "is_new_question": false @@ -15195,8 +15531,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 2543, - "total_submitted": 5935, + "total_acs": 2553, + "total_submitted": 5969, "total_column_articles": 67, "frontend_question_id": "1943", "is_new_question": false @@ -15216,9 +15552,9 @@ "question__title": "The Number of the Smallest Unoccupied Chair", "question__title_slug": "the-number-of-the-smallest-unoccupied-chair", "question__hide": false, - "total_acs": 3919, - "total_submitted": 9623, - "total_column_articles": 86, + "total_acs": 3993, + "total_submitted": 9739, + "total_column_articles": 87, "frontend_question_id": "1942", "is_new_question": false }, @@ -15237,9 +15573,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": 8709, - "total_submitted": 11739, - "total_column_articles": 137, + "total_acs": 8955, + "total_submitted": 12098, + "total_column_articles": 139, "frontend_question_id": "1941", "is_new_question": false }, @@ -15258,9 +15594,9 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 277, - "total_submitted": 549, - "total_column_articles": 7, + "total_acs": 282, + "total_submitted": 554, + "total_column_articles": 8, "frontend_question_id": "1902", "is_new_question": false }, @@ -15279,8 +15615,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 2037, - "total_submitted": 8044, + "total_acs": 2049, + "total_submitted": 8090, "total_column_articles": 38, "frontend_question_id": "1923", "is_new_question": false @@ -15300,9 +15636,9 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 5698, - "total_submitted": 15689, - "total_column_articles": 88, + "total_acs": 5759, + "total_submitted": 15851, + "total_column_articles": 89, "frontend_question_id": "1922", "is_new_question": false }, @@ -15321,9 +15657,9 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 6875, - "total_submitted": 19214, - "total_column_articles": 111, + "total_acs": 6936, + "total_submitted": 19389, + "total_column_articles": 112, "frontend_question_id": "1921", "is_new_question": false }, @@ -15342,9 +15678,9 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 24062, - "total_submitted": 27519, - "total_column_articles": 220, + "total_acs": 24662, + "total_submitted": 28202, + "total_column_articles": 224, "frontend_question_id": "1920", "is_new_question": false }, @@ -15363,9 +15699,9 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 4302, - "total_submitted": 7263, - "total_column_articles": 89, + "total_acs": 4460, + "total_submitted": 7577, + "total_column_articles": 90, "frontend_question_id": "1901", "is_new_question": false }, @@ -15384,8 +15720,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 1391, - "total_submitted": 3860, + "total_acs": 1438, + "total_submitted": 3973, "total_column_articles": 26, "frontend_question_id": "1892", "is_new_question": false @@ -15405,9 +15741,9 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 3465, - "total_submitted": 8470, - "total_column_articles": 41, + "total_acs": 3541, + "total_submitted": 8659, + "total_column_articles": 42, "frontend_question_id": "1891", "is_new_question": false }, @@ -15426,9 +15762,9 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 3526, - "total_submitted": 8610, - "total_column_articles": 64, + "total_acs": 3565, + "total_submitted": 8666, + "total_column_articles": 65, "frontend_question_id": "1915", "is_new_question": false }, @@ -15447,9 +15783,9 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 3708, - "total_submitted": 8211, - "total_column_articles": 79, + "total_acs": 3741, + "total_submitted": 8277, + "total_column_articles": 80, "frontend_question_id": "1914", "is_new_question": false }, @@ -15468,9 +15804,9 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 14107, - "total_submitted": 17081, - "total_column_articles": 175, + "total_acs": 14483, + "total_submitted": 17680, + "total_column_articles": 177, "frontend_question_id": "1913", "is_new_question": false }, @@ -15489,9 +15825,9 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 9133, - "total_submitted": 12519, - "total_column_articles": 69, + "total_acs": 10197, + "total_submitted": 13982, + "total_column_articles": 75, "frontend_question_id": "1890", "is_new_question": false }, @@ -15510,9 +15846,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": 3597, - "total_submitted": 8501, - "total_column_articles": 61, + "total_acs": 4022, + "total_submitted": 9013, + "total_column_articles": 63, "frontend_question_id": "1928", "is_new_question": false }, @@ -15531,8 +15867,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 2403, - "total_submitted": 5644, + "total_acs": 2420, + "total_submitted": 5670, "total_column_articles": 50, "frontend_question_id": "1927", "is_new_question": false @@ -15552,8 +15888,8 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 6877, - "total_submitted": 17848, + "total_acs": 7032, + "total_submitted": 18183, "total_column_articles": 119, "frontend_question_id": "1926", "is_new_question": false @@ -15573,9 +15909,9 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 8375, - "total_submitted": 12022, - "total_column_articles": 98, + "total_acs": 8506, + "total_submitted": 12200, + "total_column_articles": 101, "frontend_question_id": "1925", "is_new_question": false }, @@ -15594,8 +15930,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 804, - "total_submitted": 1422, + "total_acs": 827, + "total_submitted": 1453, "total_column_articles": 25, "frontend_question_id": "1885", "is_new_question": false @@ -15615,9 +15951,9 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 15114, - "total_submitted": 22908, - "total_column_articles": 271, + "total_acs": 15630, + "total_submitted": 23664, + "total_column_articles": 279, "frontend_question_id": "1905", "is_new_question": false }, @@ -15636,8 +15972,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 3099, - "total_submitted": 7239, + "total_acs": 3135, + "total_submitted": 7309, "total_column_articles": 62, "frontend_question_id": "1906", "is_new_question": false @@ -15657,9 +15993,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": 4677, - "total_submitted": 15507, - "total_column_articles": 91, + "total_acs": 4723, + "total_submitted": 15633, + "total_column_articles": 92, "frontend_question_id": "1904", "is_new_question": false }, @@ -15678,9 +16014,9 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 11645, - "total_submitted": 18716, - "total_column_articles": 149, + "total_acs": 11964, + "total_submitted": 19232, + "total_column_articles": 154, "frontend_question_id": "1903", "is_new_question": false }, @@ -15699,9 +16035,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": 5160, - "total_submitted": 7429, - "total_column_articles": 82, + "total_acs": 5318, + "total_submitted": 7635, + "total_column_articles": 84, "frontend_question_id": "1884", "is_new_question": false }, @@ -15720,8 +16056,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 1394, - "total_submitted": 2135, + "total_acs": 1470, + "total_submitted": 2258, "total_column_articles": 36, "frontend_question_id": "1875", "is_new_question": false @@ -15741,8 +16077,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 738, - "total_submitted": 860, + "total_acs": 752, + "total_submitted": 875, "total_column_articles": 28, "frontend_question_id": "1874", "is_new_question": false @@ -15762,8 +16098,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": 1526, - "total_submitted": 3370, + "total_acs": 1537, + "total_submitted": 3388, "total_column_articles": 42, "frontend_question_id": "1900", "is_new_question": false @@ -15783,9 +16119,9 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 6009, - "total_submitted": 17350, - "total_column_articles": 89, + "total_acs": 6172, + "total_submitted": 17851, + "total_column_articles": 91, "frontend_question_id": "1898", "is_new_question": false }, @@ -15804,8 +16140,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 4475, - "total_submitted": 6999, + "total_acs": 4520, + "total_submitted": 7067, "total_column_articles": 56, "frontend_question_id": "1899", "is_new_question": false @@ -15825,9 +16161,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": 8500, - "total_submitted": 15430, - "total_column_articles": 108, + "total_acs": 8583, + "total_submitted": 15562, + "total_column_articles": 110, "frontend_question_id": "1897", "is_new_question": false }, @@ -15846,9 +16182,9 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 25463, - "total_submitted": 36251, - "total_column_articles": 162, + "total_acs": 28697, + "total_submitted": 42016, + "total_column_articles": 173, "frontend_question_id": "1873", "is_new_question": false }, @@ -15867,9 +16203,9 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 3239, - "total_submitted": 13946, - "total_column_articles": 64, + "total_acs": 3306, + "total_submitted": 14264, + "total_column_articles": 66, "frontend_question_id": "1912", "is_new_question": false }, @@ -15888,9 +16224,9 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 4956, - "total_submitted": 8645, - "total_column_articles": 91, + "total_acs": 5006, + "total_submitted": 8728, + "total_column_articles": 95, "frontend_question_id": "1911", "is_new_question": false }, @@ -15909,9 +16245,9 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 5088, - "total_submitted": 7624, - "total_column_articles": 96, + "total_acs": 5134, + "total_submitted": 7687, + "total_column_articles": 99, "frontend_question_id": "1910", "is_new_question": false }, @@ -15930,9 +16266,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": 7248, - "total_submitted": 23289, - "total_column_articles": 119, + "total_acs": 7353, + "total_submitted": 23670, + "total_column_articles": 120, "frontend_question_id": "1909", "is_new_question": false }, @@ -15951,9 +16287,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": 1484, - "total_submitted": 3094, - "total_column_articles": 37, + "total_acs": 1679, + "total_submitted": 3581, + "total_column_articles": 42, "frontend_question_id": "1868", "is_new_question": false }, @@ -15972,8 +16308,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 2825, - "total_submitted": 10113, + "total_acs": 2875, + "total_submitted": 10286, "total_column_articles": 53, "frontend_question_id": "1889", "is_new_question": false @@ -15993,8 +16329,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": 3374, - "total_submitted": 9965, + "total_acs": 3403, + "total_submitted": 10028, "total_column_articles": 77, "frontend_question_id": "1888", "is_new_question": false @@ -16014,9 +16350,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": 6333, - "total_submitted": 9754, - "total_column_articles": 91, + "total_acs": 6603, + "total_submitted": 10153, + "total_column_articles": 93, "frontend_question_id": "1887", "is_new_question": false }, @@ -16035,9 +16371,9 @@ "question__title": "Determine Whether Matrix Can Be Obtained By Rotation", "question__title_slug": "determine-whether-matrix-can-be-obtained-by-rotation", "question__hide": false, - "total_acs": 8117, - "total_submitted": 13846, - "total_column_articles": 130, + "total_acs": 8227, + "total_submitted": 14039, + "total_column_articles": 133, "frontend_question_id": "1886", "is_new_question": false }, @@ -16056,9 +16392,9 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 2352, - "total_submitted": 3297, - "total_column_articles": 33, + "total_acs": 2499, + "total_submitted": 3519, + "total_column_articles": 36, "frontend_question_id": "1867", "is_new_question": false }, @@ -16077,9 +16413,9 @@ "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": 2055, - "total_submitted": 5253, - "total_column_articles": 33, + "total_acs": 2077, + "total_submitted": 5287, + "total_column_articles": 34, "frontend_question_id": "1883", "is_new_question": false }, @@ -16098,9 +16434,9 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 4515, - "total_submitted": 15643, - "total_column_articles": 130, + "total_acs": 4566, + "total_submitted": 15747, + "total_column_articles": 133, "frontend_question_id": "1882", "is_new_question": false }, @@ -16119,9 +16455,9 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 7543, - "total_submitted": 20512, - "total_column_articles": 80, + "total_acs": 7599, + "total_submitted": 20648, + "total_column_articles": 81, "frontend_question_id": "1881", "is_new_question": false }, @@ -16140,9 +16476,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": 9871, - "total_submitted": 12859, - "total_column_articles": 153, + "total_acs": 9960, + "total_submitted": 12971, + "total_column_articles": 155, "frontend_question_id": "1880", "is_new_question": false }, @@ -16161,9 +16497,9 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 769, - "total_submitted": 1162, - "total_column_articles": 31, + "total_acs": 788, + "total_submitted": 1197, + "total_column_articles": 32, "frontend_question_id": "1858", "is_new_question": false }, @@ -16182,8 +16518,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": 1078, - "total_submitted": 2067, + "total_acs": 1086, + "total_submitted": 2077, "total_column_articles": 35, "frontend_question_id": "1896", "is_new_question": false @@ -16203,8 +16539,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": 99, - "total_submitted": 168, + "total_acs": 102, + "total_submitted": 171, "total_column_articles": 9, "frontend_question_id": "2247", "is_new_question": false @@ -16224,9 +16560,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": 42914, - "total_submitted": 93517, - "total_column_articles": 562, + "total_acs": 43306, + "total_submitted": 94419, + "total_column_articles": 566, "frontend_question_id": "1894", "is_new_question": false }, @@ -16245,9 +16581,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": 35602, - "total_submitted": 60180, - "total_column_articles": 467, + "total_acs": 35741, + "total_submitted": 60400, + "total_column_articles": 469, "frontend_question_id": "1893", "is_new_question": false }, @@ -16266,8 +16602,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 2372, - "total_submitted": 3805, + "total_acs": 2453, + "total_submitted": 3941, "total_column_articles": 29, "frontend_question_id": "1853", "is_new_question": false @@ -16287,8 +16623,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 604, - "total_submitted": 1064, + "total_acs": 625, + "total_submitted": 1101, "total_column_articles": 18, "frontend_question_id": "1852", "is_new_question": false @@ -16308,8 +16644,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 2688, - "total_submitted": 4326, + "total_acs": 2700, + "total_submitted": 4344, "total_column_articles": 35, "frontend_question_id": "1872", "is_new_question": false @@ -16329,9 +16665,9 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 7644, - "total_submitted": 27029, - "total_column_articles": 148, + "total_acs": 7729, + "total_submitted": 27357, + "total_column_articles": 149, "frontend_question_id": "1871", "is_new_question": false }, @@ -16350,9 +16686,9 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 9948, - "total_submitted": 22932, - "total_column_articles": 105, + "total_acs": 10110, + "total_submitted": 23347, + "total_column_articles": 106, "frontend_question_id": "1870", "is_new_question": false }, @@ -16371,9 +16707,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": 15122, - "total_submitted": 20220, - "total_column_articles": 193, + "total_acs": 15219, + "total_submitted": 20390, + "total_column_articles": 194, "frontend_question_id": "1869", "is_new_question": false }, @@ -16392,8 +16728,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 1730, - "total_submitted": 3675, + "total_acs": 1820, + "total_submitted": 3903, "total_column_articles": 37, "frontend_question_id": "1843", "is_new_question": false @@ -16413,8 +16749,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 227, - "total_submitted": 387, + "total_acs": 228, + "total_submitted": 390, "total_column_articles": 18, "frontend_question_id": "1842", "is_new_question": false @@ -16434,8 +16770,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": 2937, - "total_submitted": 4768, + "total_acs": 2974, + "total_submitted": 4815, "total_column_articles": 61, "frontend_question_id": "1866", "is_new_question": false @@ -16455,9 +16791,9 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 6247, - "total_submitted": 12298, - "total_column_articles": 73, + "total_acs": 6302, + "total_submitted": 12411, + "total_column_articles": 74, "frontend_question_id": "1865", "is_new_question": false }, @@ -16476,8 +16812,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": 5539, - "total_submitted": 13934, + "total_acs": 5579, + "total_submitted": 14012, "total_column_articles": 124, "frontend_question_id": "1864", "is_new_question": false @@ -16497,9 +16833,9 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 17888, - "total_submitted": 20847, - "total_column_articles": 225, + "total_acs": 18042, + "total_submitted": 21058, + "total_column_articles": 226, "frontend_question_id": "1863", "is_new_question": false }, @@ -16518,9 +16854,9 @@ "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": 495, - "total_submitted": 780, - "total_column_articles": 27, + "total_acs": 530, + "total_submitted": 830, + "total_column_articles": 28, "frontend_question_id": "2046", "is_new_question": false }, @@ -16539,9 +16875,9 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 1947, - "total_submitted": 3660, - "total_column_articles": 54, + "total_acs": 2018, + "total_submitted": 3797, + "total_column_articles": 55, "frontend_question_id": "1841", "is_new_question": false }, @@ -16560,8 +16896,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": 2593, - "total_submitted": 5828, + "total_acs": 2611, + "total_submitted": 5866, "total_column_articles": 65, "frontend_question_id": "1878", "is_new_question": false @@ -16581,9 +16917,9 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 2857, - "total_submitted": 6211, - "total_column_articles": 50, + "total_acs": 2893, + "total_submitted": 6258, + "total_column_articles": 51, "frontend_question_id": "1879", "is_new_question": false }, @@ -16602,9 +16938,9 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 34830, - "total_submitted": 42781, - "total_column_articles": 439, + "total_acs": 34964, + "total_submitted": 42947, + "total_column_articles": 442, "frontend_question_id": "1877", "is_new_question": false }, @@ -16623,9 +16959,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": 11053, - "total_submitted": 15473, - "total_column_articles": 177, + "total_acs": 11246, + "total_submitted": 15753, + "total_column_articles": 178, "frontend_question_id": "1876", "is_new_question": false }, @@ -16644,8 +16980,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": 2961, - "total_submitted": 6330, + "total_acs": 3021, + "total_submitted": 6418, "total_column_articles": 46, "frontend_question_id": "1857", "is_new_question": false @@ -16665,8 +17001,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 6526, - "total_submitted": 17958, + "total_acs": 6638, + "total_submitted": 18232, "total_column_articles": 111, "frontend_question_id": "1856", "is_new_question": false @@ -16686,9 +17022,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": 15794, - "total_submitted": 25261, - "total_column_articles": 186, + "total_acs": 16095, + "total_submitted": 25795, + "total_column_articles": 189, "frontend_question_id": "1855", "is_new_question": false }, @@ -16707,9 +17043,9 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 14577, - "total_submitted": 19450, - "total_column_articles": 174, + "total_acs": 14699, + "total_submitted": 19634, + "total_column_articles": 176, "frontend_question_id": "1854", "is_new_question": false }, @@ -16728,9 +17064,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": 1121, - "total_submitted": 1513, - "total_column_articles": 51, + "total_acs": 1170, + "total_submitted": 1579, + "total_column_articles": 53, "frontend_question_id": "1836", "is_new_question": false }, @@ -16749,9 +17085,9 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 2379, - "total_submitted": 3055, - "total_column_articles": 43, + "total_acs": 2518, + "total_submitted": 3243, + "total_column_articles": 46, "frontend_question_id": "1831", "is_new_question": false }, @@ -16770,8 +17106,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 554, - "total_submitted": 1335, + "total_acs": 561, + "total_submitted": 1362, "total_column_articles": 32, "frontend_question_id": "1826", "is_new_question": false @@ -16791,9 +17127,9 @@ "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": 151, - "total_submitted": 280, - "total_column_articles": 8, + "total_acs": 158, + "total_submitted": 290, + "total_column_articles": 9, "frontend_question_id": "1989", "is_new_question": false }, @@ -16812,9 +17148,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": 2898, - "total_submitted": 4708, - "total_column_articles": 56, + "total_acs": 2927, + "total_submitted": 4760, + "total_column_articles": 57, "frontend_question_id": "1850", "is_new_question": false }, @@ -16833,9 +17169,9 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 2601, - "total_submitted": 6181, - "total_column_articles": 59, + "total_acs": 2639, + "total_submitted": 6279, + "total_column_articles": 60, "frontend_question_id": "1851", "is_new_question": false }, @@ -16854,8 +17190,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": 6535, - "total_submitted": 19877, + "total_acs": 6607, + "total_submitted": 20143, "total_column_articles": 128, "frontend_question_id": "1849", "is_new_question": false @@ -16875,9 +17211,9 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 10533, - "total_submitted": 15587, - "total_column_articles": 135, + "total_acs": 10641, + "total_submitted": 15730, + "total_column_articles": 136, "frontend_question_id": "1848", "is_new_question": false }, @@ -16896,8 +17232,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": 4363, - "total_submitted": 4852, + "total_acs": 4477, + "total_submitted": 4974, "total_column_articles": 33, "frontend_question_id": "1821", "is_new_question": false @@ -16917,9 +17253,9 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 4688, - "total_submitted": 7443, - "total_column_articles": 93, + "total_acs": 4732, + "total_submitted": 7551, + "total_column_articles": 94, "frontend_question_id": "1861", "is_new_question": false }, @@ -16938,8 +17274,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 5268, - "total_submitted": 6876, + "total_acs": 5325, + "total_submitted": 6960, "total_column_articles": 103, "frontend_question_id": "1860", "is_new_question": false @@ -16959,9 +17295,9 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 10742, - "total_submitted": 14296, - "total_column_articles": 222, + "total_acs": 10898, + "total_submitted": 14484, + "total_column_articles": 224, "frontend_question_id": "1859", "is_new_question": false }, @@ -16980,9 +17316,9 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 246, - "total_submitted": 528, - "total_column_articles": 15, + "total_acs": 256, + "total_submitted": 559, + "total_column_articles": 16, "frontend_question_id": "1820", "is_new_question": false }, @@ -17001,8 +17337,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 2364, - "total_submitted": 5990, + "total_acs": 2392, + "total_submitted": 6080, "total_column_articles": 56, "frontend_question_id": "1840", "is_new_question": false @@ -17022,8 +17358,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": 8808, - "total_submitted": 16477, + "total_acs": 8925, + "total_submitted": 16814, "total_column_articles": 167, "frontend_question_id": "1839", "is_new_question": false @@ -17043,9 +17379,9 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 33214, - "total_submitted": 77505, - "total_column_articles": 345, + "total_acs": 33438, + "total_submitted": 78032, + "total_column_articles": 350, "frontend_question_id": "1838", "is_new_question": false }, @@ -17064,8 +17400,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 10679, - "total_submitted": 13458, + "total_acs": 10793, + "total_submitted": 13605, "total_column_articles": 137, "frontend_question_id": "1837", "is_new_question": false @@ -17085,9 +17421,9 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 2171, - "total_submitted": 3381, - "total_column_articles": 46, + "total_acs": 2262, + "total_submitted": 3511, + "total_column_articles": 47, "frontend_question_id": "1811", "is_new_question": false }, @@ -17106,9 +17442,9 @@ "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": 4171, - "total_submitted": 7908, - "total_column_articles": 66, + "total_acs": 4203, + "total_submitted": 7948, + "total_column_articles": 67, "frontend_question_id": "1835", "is_new_question": false }, @@ -17127,9 +17463,9 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 8099, - "total_submitted": 22105, - "total_column_articles": 150, + "total_acs": 8182, + "total_submitted": 22288, + "total_column_articles": 151, "frontend_question_id": "1834", "is_new_question": false }, @@ -17148,9 +17484,9 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 46254, - "total_submitted": 67864, - "total_column_articles": 421, + "total_acs": 46419, + "total_submitted": 68155, + "total_column_articles": 422, "frontend_question_id": "1833", "is_new_question": false }, @@ -17169,9 +17505,9 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 18638, - "total_submitted": 22696, - "total_column_articles": 297, + "total_acs": 18915, + "total_submitted": 23054, + "total_column_articles": 301, "frontend_question_id": "1832", "is_new_question": false }, @@ -17190,8 +17526,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": 300, - "total_submitted": 482, + "total_acs": 307, + "total_submitted": 490, "total_column_articles": 8, "frontend_question_id": "1810", "is_new_question": false @@ -17211,8 +17547,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 3280, - "total_submitted": 5329, + "total_acs": 3381, + "total_submitted": 5482, "total_column_articles": 47, "frontend_question_id": "1809", "is_new_question": false @@ -17232,9 +17568,9 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 3102, - "total_submitted": 8167, - "total_column_articles": 54, + "total_acs": 3153, + "total_submitted": 8263, + "total_column_articles": 55, "frontend_question_id": "1847", "is_new_question": false }, @@ -17253,9 +17589,9 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 29208, - "total_submitted": 46232, - "total_column_articles": 391, + "total_acs": 29289, + "total_submitted": 46352, + "total_column_articles": 392, "frontend_question_id": "1846", "is_new_question": false }, @@ -17274,9 +17610,9 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 11373, - "total_submitted": 23610, - "total_column_articles": 117, + "total_acs": 11652, + "total_submitted": 24348, + "total_column_articles": 118, "frontend_question_id": "1845", "is_new_question": false }, @@ -17295,9 +17631,9 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 9840, - "total_submitted": 12411, - "total_column_articles": 167, + "total_acs": 10117, + "total_submitted": 12801, + "total_column_articles": 171, "frontend_question_id": "1844", "is_new_question": false }, @@ -17316,8 +17652,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 3048, - "total_submitted": 10444, + "total_acs": 3066, + "total_submitted": 10495, "total_column_articles": 67, "frontend_question_id": "1825", "is_new_question": false @@ -17337,9 +17673,9 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 8900, - "total_submitted": 13861, - "total_column_articles": 174, + "total_acs": 8957, + "total_submitted": 13941, + "total_column_articles": 175, "frontend_question_id": "1824", "is_new_question": false }, @@ -17358,9 +17694,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": 45790, - "total_submitted": 58022, - "total_column_articles": 503, + "total_acs": 46191, + "total_submitted": 58565, + "total_column_articles": 505, "frontend_question_id": "1823", "is_new_question": false }, @@ -17379,9 +17715,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": 31029, - "total_submitted": 41589, - "total_column_articles": 350, + "total_acs": 31590, + "total_submitted": 42618, + "total_column_articles": 357, "frontend_question_id": "1822", "is_new_question": false }, @@ -17400,9 +17736,9 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 1382, - "total_submitted": 2428, - "total_column_articles": 51, + "total_acs": 1458, + "total_submitted": 2563, + "total_column_articles": 52, "frontend_question_id": "1804", "is_new_question": false }, @@ -17421,9 +17757,9 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 12907, - "total_submitted": 16303, - "total_column_articles": 82, + "total_acs": 14454, + "total_submitted": 18246, + "total_column_articles": 87, "frontend_question_id": "1795", "is_new_question": false }, @@ -17442,8 +17778,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 3063, - "total_submitted": 7590, + "total_acs": 3099, + "total_submitted": 7655, "total_column_articles": 37, "frontend_question_id": "1819", "is_new_question": false @@ -17463,9 +17799,9 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 28504, - "total_submitted": 76259, - "total_column_articles": 367, + "total_acs": 28648, + "total_submitted": 76636, + "total_column_articles": 368, "frontend_question_id": "1818", "is_new_question": false }, @@ -17484,9 +17820,9 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 7214, - "total_submitted": 10297, - "total_column_articles": 119, + "total_acs": 7301, + "total_submitted": 10431, + "total_column_articles": 121, "frontend_question_id": "1817", "is_new_question": false }, @@ -17505,9 +17841,9 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 50521, - "total_submitted": 69228, - "total_column_articles": 673, + "total_acs": 50762, + "total_submitted": 69631, + "total_column_articles": 685, "frontend_question_id": "1816", "is_new_question": false }, @@ -17526,8 +17862,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": 284, - "total_submitted": 540, + "total_acs": 287, + "total_submitted": 544, "total_column_articles": 11, "frontend_question_id": "1794", "is_new_question": false @@ -17547,8 +17883,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 3138, - "total_submitted": 4401, + "total_acs": 3245, + "total_submitted": 4545, "total_column_articles": 41, "frontend_question_id": "1789", "is_new_question": false @@ -17568,8 +17904,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": 1093, - "total_submitted": 2149, + "total_acs": 1098, + "total_submitted": 2154, "total_column_articles": 23, "frontend_question_id": "1830", "is_new_question": false @@ -17589,8 +17925,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 5107, - "total_submitted": 7263, + "total_acs": 5154, + "total_submitted": 7323, "total_column_articles": 94, "frontend_question_id": "1829", "is_new_question": false @@ -17610,8 +17946,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": 11116, - "total_submitted": 12837, + "total_acs": 11276, + "total_submitted": 13045, "total_column_articles": 154, "frontend_question_id": "1828", "is_new_question": false @@ -17631,9 +17967,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": 14800, - "total_submitted": 19007, - "total_column_articles": 208, + "total_acs": 14969, + "total_submitted": 19212, + "total_column_articles": 211, "frontend_question_id": "1827", "is_new_question": false }, @@ -17652,8 +17988,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 415, - "total_submitted": 652, + "total_acs": 421, + "total_submitted": 661, "total_column_articles": 26, "frontend_question_id": "1788", "is_new_question": false @@ -17673,8 +18009,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 2800, - "total_submitted": 10168, + "total_acs": 2815, + "total_submitted": 10231, "total_column_articles": 50, "frontend_question_id": "1808", "is_new_question": false @@ -17694,9 +18030,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": 5812, - "total_submitted": 8732, - "total_column_articles": 90, + "total_acs": 5845, + "total_submitted": 8791, + "total_column_articles": 91, "frontend_question_id": "1806", "is_new_question": false }, @@ -17715,9 +18051,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": 7015, - "total_submitted": 11828, - "total_column_articles": 107, + "total_acs": 7088, + "total_submitted": 11998, + "total_column_articles": 109, "frontend_question_id": "1807", "is_new_question": false }, @@ -17736,9 +18072,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": 13894, - "total_submitted": 30341, - "total_column_articles": 205, + "total_acs": 14021, + "total_submitted": 30649, + "total_column_articles": 208, "frontend_question_id": "1805", "is_new_question": false }, @@ -17757,9 +18093,9 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 3059, - "total_submitted": 3748, - "total_column_articles": 54, + "total_acs": 3252, + "total_submitted": 3974, + "total_column_articles": 58, "frontend_question_id": "1783", "is_new_question": false }, @@ -17778,9 +18114,9 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 352, - "total_submitted": 693, - "total_column_articles": 16, + "total_acs": 365, + "total_submitted": 762, + "total_column_articles": 17, "frontend_question_id": "1778", "is_new_question": false }, @@ -17799,8 +18135,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": 4017, - "total_submitted": 7401, + "total_acs": 4057, + "total_submitted": 7481, "total_column_articles": 60, "frontend_question_id": "1798", "is_new_question": false @@ -17820,9 +18156,9 @@ "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": 5400, - "total_submitted": 19421, - "total_column_articles": 137, + "total_acs": 5528, + "total_submitted": 19744, + "total_column_articles": 138, "frontend_question_id": "1802", "is_new_question": false }, @@ -17841,9 +18177,9 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 5131, - "total_submitted": 13038, - "total_column_articles": 128, + "total_acs": 5256, + "total_submitted": 13324, + "total_column_articles": 129, "frontend_question_id": "1801", "is_new_question": false }, @@ -17862,9 +18198,9 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 12745, - "total_submitted": 18945, - "total_column_articles": 211, + "total_acs": 12893, + "total_submitted": 19159, + "total_column_articles": 213, "frontend_question_id": "1800", "is_new_question": false }, @@ -17883,9 +18219,9 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 7296, - "total_submitted": 9291, - "total_column_articles": 75, + "total_acs": 7406, + "total_submitted": 9421, + "total_column_articles": 76, "frontend_question_id": "1777", "is_new_question": false }, @@ -17904,8 +18240,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 4462, - "total_submitted": 12446, + "total_acs": 4498, + "total_submitted": 12523, "total_column_articles": 98, "frontend_question_id": "1814", "is_new_question": false @@ -17925,8 +18261,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": 2174, - "total_submitted": 7039, + "total_acs": 2198, + "total_submitted": 7085, "total_column_articles": 49, "frontend_question_id": "1815", "is_new_question": false @@ -17946,8 +18282,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 6311, - "total_submitted": 13148, + "total_acs": 6334, + "total_submitted": 13217, "total_column_articles": 97, "frontend_question_id": "1813", "is_new_question": false @@ -17967,9 +18303,9 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 11374, - "total_submitted": 14498, - "total_column_articles": 285, + "total_acs": 11634, + "total_submitted": 14840, + "total_column_articles": 288, "frontend_question_id": "1812", "is_new_question": false }, @@ -17988,8 +18324,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 632, - "total_submitted": 1330, + "total_acs": 648, + "total_submitted": 1397, "total_column_articles": 18, "frontend_question_id": "1772", "is_new_question": false @@ -18009,9 +18345,9 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 4758, - "total_submitted": 10956, - "total_column_articles": 110, + "total_acs": 4804, + "total_submitted": 11061, + "total_column_articles": 111, "frontend_question_id": "1793", "is_new_question": false }, @@ -18030,8 +18366,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 7627, - "total_submitted": 14935, + "total_acs": 7684, + "total_submitted": 15034, "total_column_articles": 121, "frontend_question_id": "1792", "is_new_question": false @@ -18051,9 +18387,9 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 49613, - "total_submitted": 59311, - "total_column_articles": 468, + "total_acs": 49873, + "total_submitted": 59638, + "total_column_articles": 469, "frontend_question_id": "1791", "is_new_question": false }, @@ -18072,9 +18408,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": 21361, - "total_submitted": 38019, - "total_column_articles": 329, + "total_acs": 21904, + "total_submitted": 39302, + "total_column_articles": 336, "frontend_question_id": "1790", "is_new_question": false }, @@ -18093,9 +18429,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": 1859, - "total_submitted": 2315, - "total_column_articles": 39, + "total_acs": 1956, + "total_submitted": 2426, + "total_column_articles": 42, "frontend_question_id": "1767", "is_new_question": false }, @@ -18114,8 +18450,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": 12273, - "total_submitted": 18828, + "total_acs": 12286, + "total_submitted": 18864, "total_column_articles": 63, "frontend_question_id": "1787", "is_new_question": false @@ -18135,8 +18471,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": 4516, - "total_submitted": 12909, + "total_acs": 4563, + "total_submitted": 13076, "total_column_articles": 110, "frontend_question_id": "1786", "is_new_question": false @@ -18156,9 +18492,9 @@ "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": 7345, - "total_submitted": 20384, - "total_column_articles": 74, + "total_acs": 7399, + "total_submitted": 20492, + "total_column_articles": 77, "frontend_question_id": "1785", "is_new_question": false }, @@ -18177,9 +18513,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": 10987, - "total_submitted": 25802, - "total_column_articles": 135, + "total_acs": 11138, + "total_submitted": 26159, + "total_column_articles": 137, "frontend_question_id": "1784", "is_new_question": false }, @@ -18198,8 +18534,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 2181, - "total_submitted": 3073, + "total_acs": 2233, + "total_submitted": 3140, "total_column_articles": 42, "frontend_question_id": "1762", "is_new_question": false @@ -18219,9 +18555,9 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 35917, - "total_submitted": 40833, - "total_column_articles": 123, + "total_acs": 40522, + "total_submitted": 46087, + "total_column_articles": 134, "frontend_question_id": "1757", "is_new_question": false }, @@ -18240,8 +18576,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": 2554, - "total_submitted": 6025, + "total_acs": 2571, + "total_submitted": 6061, "total_column_articles": 58, "frontend_question_id": "1803", "is_new_question": false @@ -18261,9 +18597,9 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 3073, - "total_submitted": 5754, - "total_column_articles": 43, + "total_acs": 3108, + "total_submitted": 5815, + "total_column_articles": 44, "frontend_question_id": "1799", "is_new_question": false }, @@ -18282,9 +18618,9 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 8619, - "total_submitted": 15006, - "total_column_articles": 121, + "total_acs": 8879, + "total_submitted": 15456, + "total_column_articles": 124, "frontend_question_id": "1797", "is_new_question": false }, @@ -18303,9 +18639,9 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 9964, - "total_submitted": 20401, - "total_column_articles": 185, + "total_acs": 10210, + "total_submitted": 20919, + "total_column_articles": 189, "frontend_question_id": "1796", "is_new_question": false }, @@ -18324,9 +18660,9 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 996, - "total_submitted": 1215, - "total_column_articles": 24, + "total_acs": 1027, + "total_submitted": 1253, + "total_column_articles": 25, "frontend_question_id": "1756", "is_new_question": false }, @@ -18345,9 +18681,9 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 2345, - "total_submitted": 4984, - "total_column_articles": 51, + "total_acs": 2377, + "total_submitted": 5041, + "total_column_articles": 52, "frontend_question_id": "1776", "is_new_question": false }, @@ -18366,9 +18702,9 @@ "question__title": "Equal Sum Arrays With Minimum Number of Operations", "question__title_slug": "equal-sum-arrays-with-minimum-number-of-operations", "question__hide": false, - "total_acs": 5211, - "total_submitted": 10749, - "total_column_articles": 111, + "total_acs": 5259, + "total_submitted": 10843, + "total_column_articles": 112, "frontend_question_id": "1775", "is_new_question": false }, @@ -18387,9 +18723,9 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 7265, - "total_submitted": 13683, - "total_column_articles": 108, + "total_acs": 7349, + "total_submitted": 13885, + "total_column_articles": 110, "frontend_question_id": "1774", "is_new_question": false }, @@ -18408,9 +18744,9 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 19861, - "total_submitted": 23546, - "total_column_articles": 245, + "total_acs": 20010, + "total_submitted": 23720, + "total_column_articles": 247, "frontend_question_id": "1773", "is_new_question": false }, @@ -18429,9 +18765,9 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 3066, - "total_submitted": 4542, - "total_column_articles": 58, + "total_acs": 3239, + "total_submitted": 4802, + "total_column_articles": 61, "frontend_question_id": "1747", "is_new_question": false }, @@ -18450,8 +18786,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 2740, - "total_submitted": 7333, + "total_acs": 2766, + "total_submitted": 7393, "total_column_articles": 49, "frontend_question_id": "1771", "is_new_question": false @@ -18471,9 +18807,9 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 4986, - "total_submitted": 13095, - "total_column_articles": 115, + "total_acs": 5020, + "total_submitted": 13170, + "total_column_articles": 116, "frontend_question_id": "1770", "is_new_question": false }, @@ -18492,8 +18828,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": 12328, - "total_submitted": 14443, + "total_acs": 12434, + "total_submitted": 14582, "total_column_articles": 216, "frontend_question_id": "1769", "is_new_question": false @@ -18513,9 +18849,9 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 18601, - "total_submitted": 24552, - "total_column_articles": 356, + "total_acs": 19004, + "total_submitted": 25199, + "total_column_articles": 362, "frontend_question_id": "1768", "is_new_question": false }, @@ -18534,8 +18870,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 2083, - "total_submitted": 3464, + "total_acs": 2114, + "total_submitted": 3520, "total_column_articles": 64, "frontend_question_id": "1746", "is_new_question": false @@ -18555,9 +18891,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": 10094, - "total_submitted": 11837, - "total_column_articles": 71, + "total_acs": 11125, + "total_submitted": 13052, + "total_column_articles": 78, "frontend_question_id": "1741", "is_new_question": false }, @@ -18576,8 +18912,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 1547, - "total_submitted": 4732, + "total_acs": 1565, + "total_submitted": 4763, "total_column_articles": 41, "frontend_question_id": "1782", "is_new_question": false @@ -18597,8 +18933,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 5010, - "total_submitted": 9265, + "total_acs": 5049, + "total_submitted": 9350, "total_column_articles": 73, "frontend_question_id": "1781", "is_new_question": false @@ -18618,8 +18954,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": 7154, - "total_submitted": 10650, + "total_acs": 7230, + "total_submitted": 10772, "total_column_articles": 141, "frontend_question_id": "1780", "is_new_question": false @@ -18639,9 +18975,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": 13770, - "total_submitted": 21318, - "total_column_articles": 220, + "total_acs": 14142, + "total_submitted": 21954, + "total_column_articles": 224, "frontend_question_id": "1779", "is_new_question": false }, @@ -18660,8 +18996,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": 3105, - "total_submitted": 6950, + "total_acs": 3130, + "total_submitted": 6992, "total_column_articles": 46, "frontend_question_id": "1761", "is_new_question": false @@ -18681,8 +19017,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": 7434, - "total_submitted": 13001, + "total_acs": 7592, + "total_submitted": 13283, "total_column_articles": 127, "frontend_question_id": "1760", "is_new_question": false @@ -18702,9 +19038,9 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 5672, - "total_submitted": 12776, - "total_column_articles": 113, + "total_acs": 5731, + "total_submitted": 12897, + "total_column_articles": 114, "frontend_question_id": "1759", "is_new_question": false }, @@ -18723,9 +19059,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": 9345, - "total_submitted": 14677, - "total_column_articles": 147, + "total_acs": 9430, + "total_submitted": 14809, + "total_column_articles": 148, "frontend_question_id": "1758", "is_new_question": false }, @@ -18744,9 +19080,9 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 1150, - "total_submitted": 1735, - "total_column_articles": 39, + "total_acs": 1177, + "total_submitted": 1768, + "total_column_articles": 40, "frontend_question_id": "1740", "is_new_question": false }, @@ -18765,9 +19101,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": 4088, - "total_submitted": 8746, - "total_column_articles": 51, + "total_acs": 4285, + "total_submitted": 9177, + "total_column_articles": 52, "frontend_question_id": "1731", "is_new_question": false }, @@ -18786,9 +19122,9 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 4339, - "total_submitted": 10049, - "total_column_articles": 68, + "total_acs": 4389, + "total_submitted": 10166, + "total_column_articles": 70, "frontend_question_id": "1755", "is_new_question": false }, @@ -18807,9 +19143,9 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 5087, - "total_submitted": 11794, - "total_column_articles": 97, + "total_acs": 5118, + "total_submitted": 11854, + "total_column_articles": 98, "frontend_question_id": "1754", "is_new_question": false }, @@ -18828,9 +19164,9 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 7822, - "total_submitted": 12382, - "total_column_articles": 158, + "total_acs": 7943, + "total_submitted": 12546, + "total_column_articles": 161, "frontend_question_id": "1753", "is_new_question": false }, @@ -18849,8 +19185,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": 11456, - "total_submitted": 17946, + "total_acs": 11549, + "total_submitted": 18128, "total_column_articles": 156, "frontend_question_id": "1752", "is_new_question": false @@ -18870,9 +19206,9 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 10499, - "total_submitted": 16751, - "total_column_articles": 59, + "total_acs": 11603, + "total_submitted": 18518, + "total_column_articles": 65, "frontend_question_id": "1729", "is_new_question": false }, @@ -18891,9 +19227,9 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 22046, - "total_submitted": 33231, - "total_column_articles": 314, + "total_acs": 22396, + "total_submitted": 33698, + "total_column_articles": 316, "frontend_question_id": "1765", "is_new_question": false }, @@ -18912,8 +19248,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 1801, - "total_submitted": 4628, + "total_acs": 1833, + "total_submitted": 4680, "total_column_articles": 35, "frontend_question_id": "1766", "is_new_question": false @@ -18933,9 +19269,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": 3289, - "total_submitted": 6818, - "total_column_articles": 78, + "total_acs": 3344, + "total_submitted": 6945, + "total_column_articles": 81, "frontend_question_id": "1764", "is_new_question": false }, @@ -18954,9 +19290,9 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 25349, - "total_submitted": 36930, - "total_column_articles": 269, + "total_acs": 25457, + "total_submitted": 37084, + "total_column_articles": 270, "frontend_question_id": "1763", "is_new_question": false }, @@ -18975,9 +19311,9 @@ "question__title": "Can You Eat Your Favorite Candy on Your Favorite Day?", "question__title_slug": "can-you-eat-your-favorite-candy-on-your-favorite-day", "question__hide": false, - "total_acs": 29455, - "total_submitted": 81161, - "total_column_articles": 373, + "total_acs": 29492, + "total_submitted": 81295, + "total_column_articles": 374, "frontend_question_id": "1744", "is_new_question": false }, @@ -18996,9 +19332,9 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 4221, - "total_submitted": 8595, - "total_column_articles": 83, + "total_acs": 4257, + "total_submitted": 8664, + "total_column_articles": 84, "frontend_question_id": "1745", "is_new_question": false }, @@ -19017,9 +19353,9 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 23473, - "total_submitted": 33706, - "total_column_articles": 342, + "total_acs": 23509, + "total_submitted": 33766, + "total_column_articles": 346, "frontend_question_id": "1743", "is_new_question": false }, @@ -19038,9 +19374,9 @@ "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": 501, - "total_submitted": 872, - "total_column_articles": 18, + "total_acs": 512, + "total_submitted": 891, + "total_column_articles": 19, "frontend_question_id": "1724", "is_new_question": false }, @@ -19059,9 +19395,9 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 2913, - "total_submitted": 4034, - "total_column_articles": 46, + "total_acs": 3014, + "total_submitted": 4211, + "total_column_articles": 47, "frontend_question_id": "1715", "is_new_question": false }, @@ -19080,8 +19416,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 3290, - "total_submitted": 6772, + "total_acs": 3347, + "total_submitted": 6863, "total_column_articles": 73, "frontend_question_id": "1739", "is_new_question": false @@ -19101,9 +19437,9 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 30091, - "total_submitted": 46201, - "total_column_articles": 407, + "total_acs": 30152, + "total_submitted": 46297, + "total_column_articles": 409, "frontend_question_id": "1738", "is_new_question": false }, @@ -19122,8 +19458,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": 4737, - "total_submitted": 13894, + "total_acs": 4820, + "total_submitted": 14071, "total_column_articles": 111, "frontend_question_id": "1737", "is_new_question": false @@ -19143,9 +19479,9 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 30827, - "total_submitted": 68940, - "total_column_articles": 380, + "total_acs": 30937, + "total_submitted": 69208, + "total_column_articles": 381, "frontend_question_id": "1736", "is_new_question": false }, @@ -19164,9 +19500,9 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 3181, - "total_submitted": 4369, - "total_column_articles": 61, + "total_acs": 3335, + "total_submitted": 4582, + "total_column_articles": 63, "frontend_question_id": "1709", "is_new_question": false }, @@ -19185,9 +19521,9 @@ "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": 4246, - "total_submitted": 8266, - "total_column_articles": 61, + "total_acs": 4331, + "total_submitted": 8403, + "total_column_articles": 62, "frontend_question_id": "1751", "is_new_question": false }, @@ -19206,9 +19542,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": 4421, - "total_submitted": 9885, - "total_column_articles": 100, + "total_acs": 4478, + "total_submitted": 10057, + "total_column_articles": 102, "frontend_question_id": "1750", "is_new_question": false }, @@ -19227,9 +19563,9 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 5324, - "total_submitted": 9932, - "total_column_articles": 115, + "total_acs": 5396, + "total_submitted": 10061, + "total_column_articles": 118, "frontend_question_id": "1749", "is_new_question": false }, @@ -19248,8 +19584,8 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 41288, - "total_submitted": 52662, + "total_acs": 41554, + "total_submitted": 53057, "total_column_articles": 582, "frontend_question_id": "1748", "is_new_question": false @@ -19269,9 +19605,9 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 1399, - "total_submitted": 2023, - "total_column_articles": 42, + "total_acs": 1421, + "total_submitted": 2055, + "total_column_articles": 43, "frontend_question_id": "1708", "is_new_question": false }, @@ -19290,8 +19626,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 4033, - "total_submitted": 6921, + "total_acs": 4062, + "total_submitted": 6959, "total_column_articles": 86, "frontend_question_id": "1727", "is_new_question": false @@ -19311,9 +19647,9 @@ "question__title": "Maximum Number of Balls in a Box", "question__title_slug": "maximum-number-of-balls-in-a-box", "question__hide": false, - "total_acs": 10788, - "total_submitted": 15197, - "total_column_articles": 165, + "total_acs": 10877, + "total_submitted": 15311, + "total_column_articles": 167, "frontend_question_id": "1742", "is_new_question": false }, @@ -19332,8 +19668,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": 35676, - "total_submitted": 42831, + "total_acs": 35808, + "total_submitted": 43001, "total_column_articles": 431, "frontend_question_id": "1725", "is_new_question": false @@ -19353,9 +19689,9 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 5318, - "total_submitted": 6878, - "total_column_articles": 72, + "total_acs": 5712, + "total_submitted": 7377, + "total_column_articles": 76, "frontend_question_id": "1699", "is_new_question": false }, @@ -19374,8 +19710,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 5406, - "total_submitted": 10653, + "total_acs": 5439, + "total_submitted": 10724, "total_column_articles": 128, "frontend_question_id": "1722", "is_new_question": false @@ -19395,9 +19731,9 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 50806, - "total_submitted": 58636, - "total_column_articles": 536, + "total_acs": 50993, + "total_submitted": 58863, + "total_column_articles": 538, "frontend_question_id": "1720", "is_new_question": false }, @@ -19416,8 +19752,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": 745, - "total_submitted": 1434, + "total_acs": 754, + "total_submitted": 1452, "total_column_articles": 23, "frontend_question_id": "1698", "is_new_question": false @@ -19437,9 +19773,9 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 10159, - "total_submitted": 12442, - "total_column_articles": 83, + "total_acs": 11192, + "total_submitted": 13686, + "total_column_articles": 88, "frontend_question_id": "1693", "is_new_question": false }, @@ -19458,9 +19794,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": 1271, - "total_submitted": 2560, - "total_column_articles": 32, + "total_acs": 1337, + "total_submitted": 2654, + "total_column_articles": 35, "frontend_question_id": "1735", "is_new_question": false }, @@ -19479,9 +19815,9 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 28811, - "total_submitted": 39803, - "total_column_articles": 373, + "total_acs": 28850, + "total_submitted": 39849, + "total_column_articles": 376, "frontend_question_id": "1734", "is_new_question": false }, @@ -19500,9 +19836,9 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 2744, - "total_submitted": 5755, - "total_column_articles": 68, + "total_acs": 2782, + "total_submitted": 5857, + "total_column_articles": 69, "frontend_question_id": "1733", "is_new_question": false }, @@ -19521,9 +19857,9 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 16700, - "total_submitted": 21296, - "total_column_articles": 275, + "total_acs": 16863, + "total_submitted": 21509, + "total_column_articles": 278, "frontend_question_id": "1732", "is_new_question": false }, @@ -19542,9 +19878,9 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 17420, - "total_submitted": 35091, - "total_column_articles": 190, + "total_acs": 17498, + "total_submitted": 35256, + "total_column_articles": 192, "frontend_question_id": "1713", "is_new_question": false }, @@ -19563,8 +19899,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": 9472, - "total_submitted": 34347, + "total_acs": 9631, + "total_submitted": 34887, "total_column_articles": 141, "frontend_question_id": "1712", "is_new_question": false @@ -19584,9 +19920,9 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 31434, - "total_submitted": 87504, - "total_column_articles": 367, + "total_acs": 31482, + "total_submitted": 87671, + "total_column_articles": 368, "frontend_question_id": "1711", "is_new_question": false }, @@ -19605,9 +19941,9 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 16520, - "total_submitted": 23721, - "total_column_articles": 249, + "total_acs": 16786, + "total_submitted": 24072, + "total_column_articles": 252, "frontend_question_id": "1710", "is_new_question": false }, @@ -19626,9 +19962,9 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 460, - "total_submitted": 695, - "total_column_articles": 16, + "total_acs": 473, + "total_submitted": 711, + "total_column_articles": 18, "frontend_question_id": "1692", "is_new_question": false }, @@ -19647,8 +19983,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 5455, - "total_submitted": 6057, + "total_acs": 5557, + "total_submitted": 6174, "total_column_articles": 46, "frontend_question_id": "1683", "is_new_question": false @@ -19668,9 +20004,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": 15270, - "total_submitted": 30303, - "total_column_articles": 162, + "total_acs": 15298, + "total_submitted": 30388, + "total_column_articles": 163, "frontend_question_id": "1707", "is_new_question": false }, @@ -19689,9 +20025,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": 27010, - "total_submitted": 53181, - "total_column_articles": 194, + "total_acs": 27211, + "total_submitted": 53560, + "total_column_articles": 196, "frontend_question_id": "1723", "is_new_question": false }, @@ -19710,9 +20046,9 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 27056, - "total_submitted": 59752, - "total_column_articles": 360, + "total_acs": 27123, + "total_submitted": 59908, + "total_column_articles": 361, "frontend_question_id": "1705", "is_new_question": false }, @@ -19731,8 +20067,8 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 15292, - "total_submitted": 19719, + "total_acs": 15425, + "total_submitted": 19909, "total_column_articles": 240, "frontend_question_id": "1704", "is_new_question": false @@ -19752,8 +20088,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 755, - "total_submitted": 1326, + "total_acs": 779, + "total_submitted": 1361, "total_column_articles": 32, "frontend_question_id": "1682", "is_new_question": false @@ -19773,8 +20109,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 3447, - "total_submitted": 9639, + "total_acs": 3522, + "total_submitted": 9878, "total_column_articles": 49, "frontend_question_id": "1677", "is_new_question": false @@ -19794,8 +20130,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": 12696, - "total_submitted": 18207, + "total_acs": 12728, + "total_submitted": 18263, "total_column_articles": 92, "frontend_question_id": "1719", "is_new_question": false @@ -19815,8 +20151,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 2694, - "total_submitted": 5372, + "total_acs": 2721, + "total_submitted": 5423, "total_column_articles": 59, "frontend_question_id": "1718", "is_new_question": false @@ -19836,9 +20172,9 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 2955, - "total_submitted": 6601, - "total_column_articles": 61, + "total_acs": 2990, + "total_submitted": 6683, + "total_column_articles": 62, "frontend_question_id": "1717", "is_new_question": false }, @@ -19857,9 +20193,9 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 38503, - "total_submitted": 54959, - "total_column_articles": 694, + "total_acs": 38761, + "total_submitted": 55412, + "total_column_articles": 706, "frontend_question_id": "1716", "is_new_question": false }, @@ -19878,8 +20214,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": 1923, - "total_submitted": 2374, + "total_acs": 2008, + "total_submitted": 2477, "total_column_articles": 41, "frontend_question_id": "1676", "is_new_question": false @@ -19899,9 +20235,9 @@ "question__title": "Checking Existence of Edge Length Limited Paths", "question__title_slug": "checking-existence-of-edge-length-limited-paths", "question__hide": false, - "total_acs": 2790, - "total_submitted": 5132, - "total_column_articles": 52, + "total_acs": 2834, + "total_submitted": 5210, + "total_column_articles": 55, "frontend_question_id": "1697", "is_new_question": false }, @@ -19920,9 +20256,9 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 9081, - "total_submitted": 22897, - "total_column_articles": 144, + "total_acs": 9341, + "total_submitted": 23424, + "total_column_articles": 147, "frontend_question_id": "1696", "is_new_question": false }, @@ -19941,8 +20277,8 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 10460, - "total_submitted": 20751, + "total_acs": 10672, + "total_submitted": 21129, "total_column_articles": 186, "frontend_question_id": "1695", "is_new_question": false @@ -19962,8 +20298,8 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 9943, - "total_submitted": 15828, + "total_acs": 10050, + "total_submitted": 16036, "total_column_articles": 171, "frontend_question_id": "1694", "is_new_question": false @@ -19983,9 +20319,9 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 17109, - "total_submitted": 27273, - "total_column_articles": 130, + "total_acs": 19198, + "total_submitted": 30491, + "total_column_articles": 139, "frontend_question_id": "1667", "is_new_question": false }, @@ -20004,8 +20340,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": 388, - "total_submitted": 603, + "total_acs": 390, + "total_submitted": 607, "total_column_articles": 18, "frontend_question_id": "1666", "is_new_question": false @@ -20025,9 +20361,9 @@ "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": 342, - "total_submitted": 606, - "total_column_articles": 11, + "total_acs": 344, + "total_submitted": 609, + "total_column_articles": 12, "frontend_question_id": "1714", "is_new_question": false }, @@ -20046,8 +20382,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 5391, - "total_submitted": 9988, + "total_acs": 5426, + "total_submitted": 10033, "total_column_articles": 118, "frontend_question_id": "1690", "is_new_question": false @@ -20067,9 +20403,9 @@ "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": 18510, - "total_submitted": 21372, - "total_column_articles": 243, + "total_acs": 18690, + "total_submitted": 21614, + "total_column_articles": 245, "frontend_question_id": "1689", "is_new_question": false }, @@ -20088,8 +20424,8 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 54911, - "total_submitted": 65151, + "total_acs": 55237, + "total_submitted": 65571, "total_column_articles": 592, "frontend_question_id": "1688", "is_new_question": false @@ -20109,8 +20445,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": 1871, - "total_submitted": 4889, + "total_acs": 1888, + "total_submitted": 4918, "total_column_articles": 30, "frontend_question_id": "1703", "is_new_question": false @@ -20130,9 +20466,9 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 3722, - "total_submitted": 7734, - "total_column_articles": 71, + "total_acs": 3795, + "total_submitted": 7863, + "total_column_articles": 73, "frontend_question_id": "1702", "is_new_question": false }, @@ -20151,8 +20487,8 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 5256, - "total_submitted": 8556, + "total_acs": 5337, + "total_submitted": 8697, "total_column_articles": 115, "frontend_question_id": "1701", "is_new_question": false @@ -20172,9 +20508,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": 12690, - "total_submitted": 18349, - "total_column_articles": 264, + "total_acs": 12846, + "total_submitted": 18569, + "total_column_articles": 265, "frontend_question_id": "1700", "is_new_question": false }, @@ -20193,9 +20529,9 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 4639, - "total_submitted": 6233, - "total_column_articles": 77, + "total_acs": 4754, + "total_submitted": 6368, + "total_column_articles": 78, "frontend_question_id": "1661", "is_new_question": false }, @@ -20214,9 +20550,9 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 6496, - "total_submitted": 13507, - "total_column_articles": 84, + "total_acs": 6538, + "total_submitted": 13595, + "total_column_articles": 85, "frontend_question_id": "1680", "is_new_question": false }, @@ -20235,9 +20571,9 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 2983, - "total_submitted": 7263, - "total_column_articles": 58, + "total_acs": 3043, + "total_submitted": 7383, + "total_column_articles": 61, "frontend_question_id": "1681", "is_new_question": false }, @@ -20256,9 +20592,9 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 8810, - "total_submitted": 17139, - "total_column_articles": 143, + "total_acs": 8878, + "total_submitted": 17265, + "total_column_articles": 145, "frontend_question_id": "1679", "is_new_question": false }, @@ -20277,9 +20613,9 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 23594, - "total_submitted": 28282, - "total_column_articles": 408, + "total_acs": 23914, + "total_submitted": 28664, + "total_column_articles": 413, "frontend_question_id": "1678", "is_new_question": false }, @@ -20298,8 +20634,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 681, - "total_submitted": 913, + "total_acs": 692, + "total_submitted": 926, "total_column_articles": 32, "frontend_question_id": "1660", "is_new_question": false @@ -20319,9 +20655,9 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 1360, - "total_submitted": 2034, - "total_column_articles": 30, + "total_acs": 1396, + "total_submitted": 2100, + "total_column_articles": 31, "frontend_question_id": "1651", "is_new_question": false }, @@ -20340,9 +20676,9 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 3423, - "total_submitted": 7870, - "total_column_articles": 57, + "total_acs": 3451, + "total_submitted": 7916, + "total_column_articles": 58, "frontend_question_id": "1675", "is_new_question": false }, @@ -20361,9 +20697,9 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 3258, - "total_submitted": 8212, - "total_column_articles": 66, + "total_acs": 3295, + "total_submitted": 8310, + "total_column_articles": 67, "frontend_question_id": "1674", "is_new_question": false }, @@ -20382,9 +20718,9 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 9483, - "total_submitted": 25266, - "total_column_articles": 198, + "total_acs": 9574, + "total_submitted": 25431, + "total_column_articles": 201, "frontend_question_id": "1673", "is_new_question": false }, @@ -20403,9 +20739,9 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 90924, - "total_submitted": 104062, - "total_column_articles": 928, + "total_acs": 93293, + "total_submitted": 106933, + "total_column_articles": 964, "frontend_question_id": "1672", "is_new_question": false }, @@ -20424,8 +20760,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": 3314, - "total_submitted": 4161, + "total_acs": 3411, + "total_submitted": 4276, "total_column_articles": 51, "frontend_question_id": "1650", "is_new_question": false @@ -20445,9 +20781,9 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 1472, - "total_submitted": 3343, - "total_column_articles": 31, + "total_acs": 1489, + "total_submitted": 3379, + "total_column_articles": 32, "frontend_question_id": "1687", "is_new_question": false }, @@ -20466,8 +20802,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 3587, - "total_submitted": 7398, + "total_acs": 3633, + "total_submitted": 7480, "total_column_articles": 60, "frontend_question_id": "1686", "is_new_question": false @@ -20487,9 +20823,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": 5539, - "total_submitted": 8697, - "total_column_articles": 120, + "total_acs": 5603, + "total_submitted": 8787, + "total_column_articles": 124, "frontend_question_id": "1685", "is_new_question": false }, @@ -20508,9 +20844,9 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 22256, - "total_submitted": 27076, - "total_column_articles": 447, + "total_acs": 22466, + "total_submitted": 27331, + "total_column_articles": 448, "frontend_question_id": "1684", "is_new_question": false }, @@ -20529,8 +20865,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 1300, - "total_submitted": 3142, + "total_acs": 1343, + "total_submitted": 3233, "total_column_articles": 31, "frontend_question_id": "1645", "is_new_question": false @@ -20550,9 +20886,9 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 6191, - "total_submitted": 9389, - "total_column_articles": 96, + "total_acs": 6259, + "total_submitted": 9482, + "total_column_articles": 99, "frontend_question_id": "1665", "is_new_question": false }, @@ -20571,8 +20907,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 6476, - "total_submitted": 11634, + "total_acs": 6522, + "total_submitted": 11757, "total_column_articles": 125, "frontend_question_id": "1664", "is_new_question": false @@ -20592,9 +20928,9 @@ "question__title": "Smallest String With A Given Numeric Value", "question__title_slug": "smallest-string-with-a-given-numeric-value", "question__hide": false, - "total_acs": 9230, - "total_submitted": 16038, - "total_column_articles": 152, + "total_acs": 9303, + "total_submitted": 16174, + "total_column_articles": 153, "frontend_question_id": "1663", "is_new_question": false }, @@ -20613,9 +20949,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": 25500, - "total_submitted": 31537, - "total_column_articles": 368, + "total_acs": 25680, + "total_submitted": 31765, + "total_column_articles": 370, "frontend_question_id": "1662", "is_new_question": false }, @@ -20634,8 +20970,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": 2718, - "total_submitted": 4919, + "total_acs": 2800, + "total_submitted": 5069, "total_column_articles": 39, "frontend_question_id": "1644", "is_new_question": false @@ -20655,9 +20991,9 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 1906, - "total_submitted": 3556, - "total_column_articles": 44, + "total_acs": 1960, + "total_submitted": 3638, + "total_column_articles": 46, "frontend_question_id": "1635", "is_new_question": false }, @@ -20676,8 +21012,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 1682, - "total_submitted": 3931, + "total_acs": 1688, + "total_submitted": 3966, "total_column_articles": 29, "frontend_question_id": "1659", "is_new_question": false @@ -20697,8 +21033,8 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 6575, - "total_submitted": 14083, + "total_acs": 6617, + "total_submitted": 14181, "total_column_articles": 96, "frontend_question_id": "1657", "is_new_question": false @@ -20718,9 +21054,9 @@ "question__title": "Minimum Operations to Reduce X to Zero", "question__title_slug": "minimum-operations-to-reduce-x-to-zero", "question__hide": false, - "total_acs": 13202, - "total_submitted": 41434, - "total_column_articles": 198, + "total_acs": 13392, + "total_submitted": 41982, + "total_column_articles": 202, "frontend_question_id": "1658", "is_new_question": false }, @@ -20739,8 +21075,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 9887, - "total_submitted": 12711, + "total_acs": 9989, + "total_submitted": 12827, "total_column_articles": 121, "frontend_question_id": "1656", "is_new_question": false @@ -20760,9 +21096,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": 1245, - "total_submitted": 2140, - "total_column_articles": 42, + "total_acs": 1289, + "total_submitted": 2210, + "total_column_articles": 43, "frontend_question_id": "1634", "is_new_question": false }, @@ -20781,9 +21117,9 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 5306, - "total_submitted": 8142, - "total_column_articles": 42, + "total_acs": 5577, + "total_submitted": 8581, + "total_column_articles": 46, "frontend_question_id": "1633", "is_new_question": false }, @@ -20802,9 +21138,9 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 3350, - "total_submitted": 6946, - "total_column_articles": 81, + "total_acs": 3384, + "total_submitted": 7003, + "total_column_articles": 83, "frontend_question_id": "1649", "is_new_question": false }, @@ -20823,9 +21159,9 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 5156, - "total_submitted": 17294, - "total_column_articles": 120, + "total_acs": 5313, + "total_submitted": 17656, + "total_column_articles": 122, "frontend_question_id": "1648", "is_new_question": false }, @@ -20844,9 +21180,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": 9848, - "total_submitted": 18466, - "total_column_articles": 144, + "total_acs": 9960, + "total_submitted": 18676, + "total_column_articles": 146, "frontend_question_id": "1647", "is_new_question": false }, @@ -20865,8 +21201,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 41644, - "total_submitted": 78814, + "total_acs": 41942, + "total_submitted": 79384, "total_column_articles": 422, "frontend_question_id": "1646", "is_new_question": false @@ -20886,9 +21222,9 @@ "question__title": "Design an Expression Tree With Evaluate Function", "question__title_slug": "design-an-expression-tree-with-evaluate-function", "question__hide": false, - "total_acs": 680, - "total_submitted": 822, - "total_column_articles": 24, + "total_acs": 691, + "total_submitted": 836, + "total_column_articles": 25, "frontend_question_id": "1628", "is_new_question": false }, @@ -20907,9 +21243,9 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 6085, - "total_submitted": 11492, - "total_column_articles": 113, + "total_acs": 6137, + "total_submitted": 11671, + "total_column_articles": 116, "frontend_question_id": "1670", "is_new_question": false }, @@ -20928,9 +21264,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": 2753, - "total_submitted": 5877, - "total_column_articles": 54, + "total_acs": 2788, + "total_submitted": 5963, + "total_column_articles": 55, "frontend_question_id": "1671", "is_new_question": false }, @@ -20949,9 +21285,9 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 18183, - "total_submitted": 24131, - "total_column_articles": 316, + "total_acs": 18432, + "total_submitted": 24485, + "total_column_articles": 318, "frontend_question_id": "1669", "is_new_question": false }, @@ -20970,8 +21306,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 9697, - "total_submitted": 21849, + "total_acs": 9862, + "total_submitted": 22224, "total_column_articles": 182, "frontend_question_id": "1668", "is_new_question": false @@ -20991,8 +21327,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": 4902, - "total_submitted": 6289, + "total_acs": 5002, + "total_submitted": 6416, "total_column_articles": 57, "frontend_question_id": "1623", "is_new_question": false @@ -21012,9 +21348,9 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 8501, - "total_submitted": 18813, - "total_column_articles": 137, + "total_acs": 8597, + "total_submitted": 19017, + "total_column_articles": 139, "frontend_question_id": "1642", "is_new_question": false }, @@ -21033,8 +21369,8 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 13919, - "total_submitted": 17950, + "total_acs": 13994, + "total_submitted": 18051, "total_column_articles": 320, "frontend_question_id": "1641", "is_new_question": false @@ -21054,9 +21390,9 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 15123, - "total_submitted": 23594, - "total_column_articles": 253, + "total_acs": 15235, + "total_submitted": 23799, + "total_column_articles": 256, "frontend_question_id": "1640", "is_new_question": false }, @@ -21075,9 +21411,9 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 3241, - "total_submitted": 4402, - "total_column_articles": 51, + "total_acs": 3372, + "total_submitted": 4595, + "total_column_articles": 52, "frontend_question_id": "1613", "is_new_question": false }, @@ -21096,9 +21432,9 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 2960, - "total_submitted": 7540, - "total_column_articles": 46, + "total_acs": 2988, + "total_submitted": 7601, + "total_column_articles": 47, "frontend_question_id": "1655", "is_new_question": false }, @@ -21117,9 +21453,9 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 6091, - "total_submitted": 20060, - "total_column_articles": 84, + "total_acs": 6185, + "total_submitted": 20351, + "total_column_articles": 86, "frontend_question_id": "1654", "is_new_question": false }, @@ -21138,8 +21474,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 5217, - "total_submitted": 9794, + "total_acs": 5291, + "total_submitted": 9915, "total_column_articles": 117, "frontend_question_id": "1653", "is_new_question": false @@ -21159,8 +21495,8 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 9927, - "total_submitted": 15666, + "total_acs": 10058, + "total_submitted": 15886, "total_column_articles": 233, "frontend_question_id": "1652", "is_new_question": false @@ -21180,9 +21516,9 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 33337, - "total_submitted": 66345, - "total_column_articles": 369, + "total_acs": 33768, + "total_submitted": 67139, + "total_column_articles": 376, "frontend_question_id": "1631", "is_new_question": false }, @@ -21201,9 +21537,9 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 9890, - "total_submitted": 13013, - "total_column_articles": 170, + "total_acs": 9994, + "total_submitted": 13169, + "total_column_articles": 173, "frontend_question_id": "1630", "is_new_question": false }, @@ -21222,9 +21558,9 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 34452, - "total_submitted": 61510, - "total_column_articles": 411, + "total_acs": 34566, + "total_submitted": 61727, + "total_column_articles": 413, "frontend_question_id": "1629", "is_new_question": false }, @@ -21243,8 +21579,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": 658, - "total_submitted": 894, + "total_acs": 668, + "total_submitted": 906, "total_column_articles": 31, "frontend_question_id": "1612", "is_new_question": false @@ -21264,9 +21600,9 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 5478, - "total_submitted": 10161, - "total_column_articles": 63, + "total_acs": 5749, + "total_submitted": 10649, + "total_column_articles": 66, "frontend_question_id": "1607", "is_new_question": false }, @@ -21285,8 +21621,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 4883, - "total_submitted": 12092, + "total_acs": 4931, + "total_submitted": 12191, "total_column_articles": 101, "frontend_question_id": "1626", "is_new_question": false @@ -21306,9 +21642,9 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 3447, - "total_submitted": 6225, - "total_column_articles": 73, + "total_acs": 3507, + "total_submitted": 6323, + "total_column_articles": 74, "frontend_question_id": "1625", "is_new_question": false }, @@ -21327,9 +21663,9 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 15867, - "total_submitted": 25660, - "total_column_articles": 283, + "total_acs": 16060, + "total_submitted": 26001, + "total_column_articles": 284, "frontend_question_id": "1624", "is_new_question": false }, @@ -21348,9 +21684,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": 1353, - "total_submitted": 1806, - "total_column_articles": 52, + "total_acs": 1391, + "total_submitted": 1850, + "total_column_articles": 53, "frontend_question_id": "1602", "is_new_question": false }, @@ -21369,8 +21705,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": 1677, - "total_submitted": 3984, + "total_acs": 1706, + "total_submitted": 4026, "total_column_articles": 38, "frontend_question_id": "1639", "is_new_question": false @@ -21390,9 +21726,9 @@ "question__title": "Count Substrings That Differ by One Character", "question__title_slug": "count-substrings-that-differ-by-one-character", "question__hide": false, - "total_acs": 3732, - "total_submitted": 5185, - "total_column_articles": 63, + "total_acs": 3773, + "total_submitted": 5254, + "total_column_articles": 64, "frontend_question_id": "1638", "is_new_question": false }, @@ -21411,9 +21747,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": 7127, - "total_submitted": 8795, - "total_column_articles": 105, + "total_acs": 7189, + "total_submitted": 8873, + "total_column_articles": 106, "frontend_question_id": "1637", "is_new_question": false }, @@ -21432,9 +21768,9 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 13367, - "total_submitted": 19318, - "total_column_articles": 254, + "total_acs": 13497, + "total_submitted": 19533, + "total_column_articles": 258, "frontend_question_id": "1636", "is_new_question": false }, @@ -21453,9 +21789,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": 2224, - "total_submitted": 3490, - "total_column_articles": 46, + "total_acs": 2248, + "total_submitted": 3525, + "total_column_articles": 48, "frontend_question_id": "1617", "is_new_question": false }, @@ -21474,8 +21810,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 5838, - "total_submitted": 20883, + "total_acs": 5873, + "total_submitted": 20982, "total_column_articles": 110, "frontend_question_id": "1616", "is_new_question": false @@ -21495,9 +21831,9 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 7846, - "total_submitted": 14332, - "total_column_articles": 92, + "total_acs": 7992, + "total_submitted": 14543, + "total_column_articles": 96, "frontend_question_id": "1615", "is_new_question": false }, @@ -21516,9 +21852,9 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 52213, - "total_submitted": 62127, - "total_column_articles": 724, + "total_acs": 52679, + "total_submitted": 62750, + "total_column_articles": 737, "frontend_question_id": "1614", "is_new_question": false }, @@ -21537,9 +21873,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": 521, - "total_submitted": 763, - "total_column_articles": 25, + "total_acs": 538, + "total_submitted": 791, + "total_column_articles": 26, "frontend_question_id": "1597", "is_new_question": false }, @@ -21558,9 +21894,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": 4303, - "total_submitted": 5717, - "total_column_articles": 70, + "total_acs": 4501, + "total_submitted": 5962, + "total_column_articles": 72, "frontend_question_id": "1596", "is_new_question": false }, @@ -21579,9 +21915,9 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 10785, - "total_submitted": 12846, - "total_column_articles": 90, + "total_acs": 11715, + "total_submitted": 13911, + "total_column_articles": 95, "frontend_question_id": "1587", "is_new_question": false }, @@ -21600,8 +21936,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 16728, - "total_submitted": 37792, + "total_acs": 16751, + "total_submitted": 37851, "total_column_articles": 158, "frontend_question_id": "1610", "is_new_question": false @@ -21621,8 +21957,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": 2569, - "total_submitted": 4156, + "total_acs": 2601, + "total_submitted": 4212, "total_column_articles": 64, "frontend_question_id": "1611", "is_new_question": false @@ -21642,9 +21978,9 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 30014, - "total_submitted": 51031, - "total_column_articles": 452, + "total_acs": 30140, + "total_submitted": 51267, + "total_column_articles": 454, "frontend_question_id": "1609", "is_new_question": false }, @@ -21663,9 +21999,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": 17752, - "total_submitted": 29555, - "total_column_articles": 329, + "total_acs": 18265, + "total_submitted": 30463, + "total_column_articles": 338, "frontend_question_id": "1608", "is_new_question": false }, @@ -21684,9 +22020,9 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 652, - "total_submitted": 1041, - "total_column_articles": 33, + "total_acs": 662, + "total_submitted": 1058, + "total_column_articles": 34, "frontend_question_id": "1586", "is_new_question": false }, @@ -21705,9 +22041,9 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 3609, - "total_submitted": 22141, - "total_column_articles": 77, + "total_acs": 3641, + "total_submitted": 22327, + "total_column_articles": 78, "frontend_question_id": "1622", "is_new_question": false }, @@ -21726,9 +22062,9 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 13404, - "total_submitted": 20662, - "total_column_articles": 81, + "total_acs": 13417, + "total_submitted": 20680, + "total_column_articles": 82, "frontend_question_id": "1728", "is_new_question": false }, @@ -21747,9 +22083,9 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 3096, - "total_submitted": 8319, - "total_column_articles": 56, + "total_acs": 3140, + "total_submitted": 8399, + "total_column_articles": 57, "frontend_question_id": "1620", "is_new_question": false }, @@ -21768,8 +22104,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": 2252, - "total_submitted": 4914, + "total_acs": 2290, + "total_submitted": 4977, "total_column_articles": 40, "frontend_question_id": "1621", "is_new_question": false @@ -21789,9 +22125,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": 14841, - "total_submitted": 18150, - "total_column_articles": 134, + "total_acs": 16409, + "total_submitted": 20062, + "total_column_articles": 140, "frontend_question_id": "1581", "is_new_question": false }, @@ -21810,9 +22146,9 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 20833, - "total_submitted": 33767, - "total_column_articles": 226, + "total_acs": 20883, + "total_submitted": 33827, + "total_column_articles": 227, "frontend_question_id": "1601", "is_new_question": false }, @@ -21831,8 +22167,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 18090, - "total_submitted": 27171, + "total_acs": 18250, + "total_submitted": 27523, "total_column_articles": 222, "frontend_question_id": "1600", "is_new_question": false @@ -21852,8 +22188,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": 4493, - "total_submitted": 10609, + "total_acs": 4597, + "total_submitted": 10807, "total_column_articles": 79, "frontend_question_id": "1599", "is_new_question": false @@ -21873,9 +22209,9 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 13696, - "total_submitted": 20333, - "total_column_articles": 184, + "total_acs": 13852, + "total_submitted": 20549, + "total_column_articles": 185, "frontend_question_id": "1598", "is_new_question": false }, @@ -21894,8 +22230,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 443, - "total_submitted": 764, + "total_acs": 454, + "total_submitted": 778, "total_column_articles": 26, "frontend_question_id": "1580", "is_new_question": false @@ -21915,9 +22251,9 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 6231, - "total_submitted": 8087, - "total_column_articles": 63, + "total_acs": 6551, + "total_submitted": 8476, + "total_column_articles": 68, "frontend_question_id": "1571", "is_new_question": false }, @@ -21936,9 +22272,9 @@ "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": 2458, - "total_submitted": 4960, - "total_column_articles": 45, + "total_acs": 2492, + "total_submitted": 5045, + "total_column_articles": 47, "frontend_question_id": "1595", "is_new_question": false }, @@ -21957,9 +22293,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": 5058, - "total_submitted": 15589, - "total_column_articles": 111, + "total_acs": 5155, + "total_submitted": 15813, + "total_column_articles": 113, "frontend_question_id": "1594", "is_new_question": false }, @@ -21978,9 +22314,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": 7188, - "total_submitted": 12850, - "total_column_articles": 112, + "total_acs": 7309, + "total_submitted": 13051, + "total_column_articles": 115, "frontend_question_id": "1593", "is_new_question": false }, @@ -21999,9 +22335,9 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 9591, - "total_submitted": 21684, - "total_column_articles": 158, + "total_acs": 9779, + "total_submitted": 22230, + "total_column_articles": 161, "frontend_question_id": "1592", "is_new_question": false }, @@ -22020,8 +22356,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 3332, - "total_submitted": 3749, + "total_acs": 3387, + "total_submitted": 3808, "total_column_articles": 49, "frontend_question_id": "1570", "is_new_question": false @@ -22041,8 +22377,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 4938, - "total_submitted": 6702, + "total_acs": 5045, + "total_submitted": 6849, "total_column_articles": 51, "frontend_question_id": "1565", "is_new_question": false @@ -22062,8 +22398,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": 4824, - "total_submitted": 6423, + "total_acs": 4874, + "total_submitted": 6479, "total_column_articles": 92, "frontend_question_id": "1605", "is_new_question": false @@ -22083,8 +22419,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": 19362, - "total_submitted": 40190, + "total_acs": 19390, + "total_submitted": 40275, "total_column_articles": 182, "frontend_question_id": "1606", "is_new_question": false @@ -22104,9 +22440,9 @@ "question__title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "question__title_slug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "question__hide": false, - "total_acs": 4902, - "total_submitted": 11692, - "total_column_articles": 86, + "total_acs": 4973, + "total_submitted": 11823, + "total_column_articles": 87, "frontend_question_id": "1604", "is_new_question": false }, @@ -22125,9 +22461,9 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 65759, - "total_submitted": 77882, - "total_column_articles": 522, + "total_acs": 66211, + "total_submitted": 78430, + "total_column_articles": 524, "frontend_question_id": "1603", "is_new_question": false }, @@ -22146,9 +22482,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": 2724, - "total_submitted": 6322, - "total_column_articles": 47, + "total_acs": 2773, + "total_submitted": 6407, + "total_column_articles": 48, "frontend_question_id": "1585", "is_new_question": false }, @@ -22167,9 +22503,9 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 37330, - "total_submitted": 56347, - "total_column_articles": 461, + "total_acs": 37833, + "total_submitted": 57181, + "total_column_articles": 464, "frontend_question_id": "1584", "is_new_question": false }, @@ -22188,8 +22524,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 19491, - "total_submitted": 28520, + "total_acs": 19532, + "total_submitted": 28582, "total_column_articles": 247, "frontend_question_id": "1583", "is_new_question": false @@ -22209,9 +22545,9 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 12260, - "total_submitted": 18279, - "total_column_articles": 157, + "total_acs": 12362, + "total_submitted": 18424, + "total_column_articles": 158, "frontend_question_id": "1582", "is_new_question": false }, @@ -22230,8 +22566,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 914, - "total_submitted": 1628, + "total_acs": 926, + "total_submitted": 1646, "total_column_articles": 37, "frontend_question_id": "1564", "is_new_question": false @@ -22251,9 +22587,9 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 4232, - "total_submitted": 9577, - "total_column_articles": 68, + "total_acs": 4346, + "total_submitted": 9786, + "total_column_articles": 70, "frontend_question_id": "1555", "is_new_question": false }, @@ -22272,9 +22608,9 @@ "question__title": "Remove Max Number of Edges to Keep Graph Fully Traversable", "question__title_slug": "remove-max-number-of-edges-to-keep-graph-fully-traversable", "question__hide": false, - "total_acs": 17249, - "total_submitted": 27842, - "total_column_articles": 311, + "total_acs": 17331, + "total_submitted": 27975, + "total_column_articles": 313, "frontend_question_id": "1579", "is_new_question": false }, @@ -22293,9 +22629,9 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 12981, - "total_submitted": 21937, - "total_column_articles": 236, + "total_acs": 13084, + "total_submitted": 22113, + "total_column_articles": 241, "frontend_question_id": "1578", "is_new_question": false }, @@ -22314,8 +22650,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": 5870, - "total_submitted": 17551, + "total_acs": 5928, + "total_submitted": 17678, "total_column_articles": 93, "frontend_question_id": "1577", "is_new_question": false @@ -22335,9 +22671,9 @@ "question__title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "question__title_slug": "replace-all-s-to-avoid-consecutive-repeating-characters", "question__hide": false, - "total_acs": 49522, - "total_submitted": 96335, - "total_column_articles": 595, + "total_acs": 49650, + "total_submitted": 96612, + "total_column_articles": 596, "frontend_question_id": "1576", "is_new_question": false }, @@ -22356,8 +22692,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 911, - "total_submitted": 1500, + "total_acs": 937, + "total_submitted": 1596, "total_column_articles": 28, "frontend_question_id": "1554", "is_new_question": false @@ -22377,9 +22713,9 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 1657, - "total_submitted": 2721, - "total_column_articles": 48, + "total_acs": 1691, + "total_submitted": 2764, + "total_column_articles": 49, "frontend_question_id": "1591", "is_new_question": false }, @@ -22398,8 +22734,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 5026, - "total_submitted": 16194, + "total_acs": 5091, + "total_submitted": 16358, "total_column_articles": 81, "frontend_question_id": "1589", "is_new_question": false @@ -22419,9 +22755,9 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 4989, - "total_submitted": 17869, - "total_column_articles": 68, + "total_acs": 5070, + "total_submitted": 18095, + "total_column_articles": 70, "frontend_question_id": "1590", "is_new_question": false }, @@ -22440,9 +22776,9 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 54964, - "total_submitted": 65449, - "total_column_articles": 854, + "total_acs": 55416, + "total_submitted": 66045, + "total_column_articles": 868, "frontend_question_id": "1588", "is_new_question": false }, @@ -22461,9 +22797,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": 2492, - "total_submitted": 5231, - "total_column_articles": 53, + "total_acs": 2554, + "total_submitted": 5350, + "total_column_articles": 55, "frontend_question_id": "1569", "is_new_question": false }, @@ -22482,9 +22818,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": 3186, - "total_submitted": 6983, - "total_column_articles": 64, + "total_acs": 3237, + "total_submitted": 7114, + "total_column_articles": 66, "frontend_question_id": "1568", "is_new_question": false }, @@ -22503,9 +22839,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": 27481, - "total_submitted": 65111, - "total_column_articles": 378, + "total_acs": 27825, + "total_submitted": 65794, + "total_column_articles": 380, "frontend_question_id": "1567", "is_new_question": false }, @@ -22524,8 +22860,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": 9930, - "total_submitted": 22456, + "total_acs": 10032, + "total_submitted": 22662, "total_column_articles": 157, "frontend_question_id": "1566", "is_new_question": false @@ -22545,9 +22881,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": 4786, - "total_submitted": 7085, - "total_column_articles": 82, + "total_acs": 5077, + "total_submitted": 7515, + "total_column_articles": 86, "frontend_question_id": "1549", "is_new_question": false }, @@ -22566,9 +22902,9 @@ "question__title": "The Most Similar Path in a Graph", "question__title_slug": "the-most-similar-path-in-a-graph", "question__hide": false, - "total_acs": 473, - "total_submitted": 696, - "total_column_articles": 19, + "total_acs": 482, + "total_submitted": 706, + "total_column_articles": 20, "frontend_question_id": "1548", "is_new_question": false }, @@ -22587,8 +22923,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 4529, - "total_submitted": 8226, + "total_acs": 4627, + "total_submitted": 8388, "total_column_articles": 54, "frontend_question_id": "1543", "is_new_question": false @@ -22608,8 +22944,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 4749, - "total_submitted": 12129, + "total_acs": 4791, + "total_submitted": 12221, "total_column_articles": 70, "frontend_question_id": "1563", "is_new_question": false @@ -22629,8 +22965,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 5260, - "total_submitted": 15751, + "total_acs": 5355, + "total_submitted": 15915, "total_column_articles": 106, "frontend_question_id": "1562", "is_new_question": false @@ -22650,9 +22986,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": 14270, - "total_submitted": 18360, - "total_column_articles": 208, + "total_acs": 14385, + "total_submitted": 18498, + "total_column_articles": 209, "frontend_question_id": "1561", "is_new_question": false }, @@ -22671,9 +23007,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": 10076, - "total_submitted": 17581, - "total_column_articles": 111, + "total_acs": 10157, + "total_submitted": 17717, + "total_column_articles": 112, "frontend_question_id": "1560", "is_new_question": false }, @@ -22692,8 +23028,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": 191, - "total_submitted": 336, + "total_acs": 196, + "total_submitted": 344, "total_column_articles": 10, "frontend_question_id": "1538", "is_new_question": false @@ -22713,9 +23049,9 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 7797, - "total_submitted": 13183, - "total_column_articles": 90, + "total_acs": 7964, + "total_submitted": 13457, + "total_column_articles": 92, "frontend_question_id": "1575", "is_new_question": false }, @@ -22734,9 +23070,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": 7810, - "total_submitted": 21846, - "total_column_articles": 130, + "total_acs": 7987, + "total_submitted": 22296, + "total_column_articles": 132, "frontend_question_id": "1574", "is_new_question": false }, @@ -22755,9 +23091,9 @@ "question__title": "Number of Ways to Split a String", "question__title_slug": "number-of-ways-to-split-a-string", "question__hide": false, - "total_acs": 5433, - "total_submitted": 17858, - "total_column_articles": 77, + "total_acs": 5472, + "total_submitted": 17968, + "total_column_articles": 79, "frontend_question_id": "1573", "is_new_question": false }, @@ -22776,9 +23112,9 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 27590, - "total_submitted": 34214, - "total_column_articles": 455, + "total_acs": 27916, + "total_submitted": 34618, + "total_column_articles": 459, "frontend_question_id": "1572", "is_new_question": false }, @@ -22797,9 +23133,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": 9081, - "total_submitted": 29319, - "total_column_articles": 136, + "total_acs": 9173, + "total_submitted": 29505, + "total_column_articles": 137, "frontend_question_id": "1553", "is_new_question": false }, @@ -22818,8 +23154,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 12792, - "total_submitted": 23891, + "total_acs": 13031, + "total_submitted": 24214, "total_column_articles": 173, "frontend_question_id": "1552", "is_new_question": false @@ -22839,9 +23175,9 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 12980, - "total_submitted": 15862, - "total_column_articles": 184, + "total_acs": 13063, + "total_submitted": 15953, + "total_column_articles": 186, "frontend_question_id": "1551", "is_new_question": false }, @@ -22860,8 +23196,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": 627, - "total_submitted": 1087, + "total_acs": 655, + "total_submitted": 1124, "total_column_articles": 31, "frontend_question_id": "1533", "is_new_question": false @@ -22881,9 +23217,9 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 5012, - "total_submitted": 7979, - "total_column_articles": 73, + "total_acs": 5198, + "total_submitted": 8288, + "total_column_articles": 76, "frontend_question_id": "1532", "is_new_question": false }, @@ -22902,9 +23238,9 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 18560, - "total_submitted": 38101, - "total_column_articles": 127, + "total_acs": 20698, + "total_submitted": 42581, + "total_column_articles": 135, "frontend_question_id": "1527", "is_new_question": false }, @@ -22923,9 +23259,9 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 4893, - "total_submitted": 8814, - "total_column_articles": 81, + "total_acs": 4940, + "total_submitted": 8895, + "total_column_articles": 82, "frontend_question_id": "1547", "is_new_question": false }, @@ -22944,9 +23280,9 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 3279, - "total_submitted": 7997, - "total_column_articles": 60, + "total_acs": 3331, + "total_submitted": 8095, + "total_column_articles": 62, "frontend_question_id": "1542", "is_new_question": false }, @@ -22965,8 +23301,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": 8585, - "total_submitted": 15378, + "total_acs": 8634, + "total_submitted": 15458, "total_column_articles": 112, "frontend_question_id": "1545", "is_new_question": false @@ -22986,9 +23322,9 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 23732, - "total_submitted": 42809, - "total_column_articles": 378, + "total_acs": 23908, + "total_submitted": 43101, + "total_column_articles": 379, "frontend_question_id": "1544", "is_new_question": false }, @@ -23007,9 +23343,9 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 1670, - "total_submitted": 2362, - "total_column_articles": 49, + "total_acs": 1692, + "total_submitted": 2388, + "total_column_articles": 50, "frontend_question_id": "1522", "is_new_question": false }, @@ -23028,8 +23364,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 4994, - "total_submitted": 8938, + "total_acs": 5132, + "total_submitted": 9257, "total_column_articles": 48, "frontend_question_id": "1517", "is_new_question": false @@ -23049,9 +23385,9 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 5159, - "total_submitted": 13372, - "total_column_articles": 86, + "total_acs": 5234, + "total_submitted": 13595, + "total_column_articles": 88, "frontend_question_id": "1559", "is_new_question": false }, @@ -23070,9 +23406,9 @@ "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": 5336, - "total_submitted": 8536, - "total_column_articles": 83, + "total_acs": 5375, + "total_submitted": 8589, + "total_column_articles": 84, "frontend_question_id": "1558", "is_new_question": false }, @@ -23091,9 +23427,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": 12958, - "total_submitted": 16160, - "total_column_articles": 183, + "total_acs": 13222, + "total_submitted": 16498, + "total_column_articles": 187, "frontend_question_id": "1557", "is_new_question": false }, @@ -23112,9 +23448,9 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 14949, - "total_submitted": 26300, - "total_column_articles": 241, + "total_acs": 15116, + "total_submitted": 26612, + "total_column_articles": 242, "frontend_question_id": "1556", "is_new_question": false }, @@ -23133,8 +23469,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 5582, - "total_submitted": 14482, + "total_acs": 5631, + "total_submitted": 14572, "total_column_articles": 112, "frontend_question_id": "1537", "is_new_question": false @@ -23154,8 +23490,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": 4605, - "total_submitted": 10274, + "total_acs": 4634, + "total_submitted": 10345, "total_column_articles": 88, "frontend_question_id": "1536", "is_new_question": false @@ -23175,8 +23511,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": 14908, - "total_submitted": 32416, + "total_acs": 14978, + "total_submitted": 32557, "total_column_articles": 201, "frontend_question_id": "1535", "is_new_question": false @@ -23196,9 +23532,9 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 20618, - "total_submitted": 26420, - "total_column_articles": 197, + "total_acs": 21013, + "total_submitted": 26967, + "total_column_articles": 198, "frontend_question_id": "1534", "is_new_question": false }, @@ -23217,8 +23553,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": 303, - "total_submitted": 549, + "total_acs": 306, + "total_submitted": 556, "total_column_articles": 16, "frontend_question_id": "1516", "is_new_question": false @@ -23238,9 +23574,9 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 6441, - "total_submitted": 9363, - "total_column_articles": 81, + "total_acs": 6559, + "total_submitted": 9532, + "total_column_articles": 82, "frontend_question_id": "1511", "is_new_question": false }, @@ -23259,8 +23595,8 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 10076, - "total_submitted": 17398, + "total_acs": 10128, + "total_submitted": 17488, "total_column_articles": 175, "frontend_question_id": "1530", "is_new_question": false @@ -23280,8 +23616,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 10150, - "total_submitted": 14522, + "total_acs": 10204, + "total_submitted": 14596, "total_column_articles": 156, "frontend_question_id": "1529", "is_new_question": false @@ -23301,8 +23637,8 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 34135, - "total_submitted": 43448, + "total_acs": 34403, + "total_submitted": 43826, "total_column_articles": 424, "frontend_question_id": "1528", "is_new_question": false @@ -23322,9 +23658,9 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 827, - "total_submitted": 1006, - "total_column_articles": 22, + "total_acs": 833, + "total_submitted": 1015, + "total_column_articles": 23, "frontend_question_id": "1506", "is_new_question": false }, @@ -23343,9 +23679,9 @@ "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": 6179, - "total_submitted": 14324, - "total_column_articles": 95, + "total_acs": 6228, + "total_submitted": 14394, + "total_column_articles": 96, "frontend_question_id": "1546", "is_new_question": false }, @@ -23364,9 +23700,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": 12393, - "total_submitted": 25725, - "total_column_articles": 146, + "total_acs": 12693, + "total_submitted": 26341, + "total_column_articles": 147, "frontend_question_id": "1541", "is_new_question": false }, @@ -23385,8 +23721,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 5613, - "total_submitted": 17331, + "total_acs": 5649, + "total_submitted": 17462, "total_column_articles": 96, "frontend_question_id": "1540", "is_new_question": false @@ -23406,9 +23742,9 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 28042, - "total_submitted": 51874, - "total_column_articles": 403, + "total_acs": 28746, + "total_submitted": 53277, + "total_column_articles": 411, "frontend_question_id": "1539", "is_new_question": false }, @@ -23427,9 +23763,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": 3149, - "total_submitted": 7772, - "total_column_articles": 63, + "total_acs": 3205, + "total_submitted": 7863, + "total_column_articles": 66, "frontend_question_id": "1521", "is_new_question": false }, @@ -23448,8 +23784,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 2834, - "total_submitted": 8280, + "total_acs": 2856, + "total_submitted": 8319, "total_column_articles": 79, "frontend_question_id": "1520", "is_new_question": false @@ -23469,9 +23805,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": 6319, - "total_submitted": 20233, - "total_column_articles": 134, + "total_acs": 6359, + "total_submitted": 20303, + "total_column_articles": 135, "frontend_question_id": "1519", "is_new_question": false }, @@ -23490,9 +23826,9 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 56700, - "total_submitted": 80791, - "total_column_articles": 845, + "total_acs": 56867, + "total_submitted": 81023, + "total_column_articles": 855, "frontend_question_id": "1518", "is_new_question": false }, @@ -23511,9 +23847,9 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 7229, - "total_submitted": 11808, - "total_column_articles": 98, + "total_acs": 7642, + "total_submitted": 12458, + "total_column_articles": 100, "frontend_question_id": "1501", "is_new_question": false }, @@ -23532,9 +23868,9 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 1560, - "total_submitted": 5321, - "total_column_articles": 41, + "total_acs": 1615, + "total_submitted": 5540, + "total_column_articles": 42, "frontend_question_id": "1500", "is_new_question": false }, @@ -23553,9 +23889,9 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 5728, - "total_submitted": 10712, - "total_column_articles": 47, + "total_acs": 5834, + "total_submitted": 10904, + "total_column_articles": 48, "frontend_question_id": "1495", "is_new_question": false }, @@ -23574,9 +23910,9 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 3757, - "total_submitted": 10742, - "total_column_articles": 68, + "total_acs": 3770, + "total_submitted": 10776, + "total_column_articles": 70, "frontend_question_id": "1515", "is_new_question": false }, @@ -23595,8 +23931,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 2389, - "total_submitted": 6618, + "total_acs": 2402, + "total_submitted": 6645, "total_column_articles": 45, "frontend_question_id": "1531", "is_new_question": false @@ -23616,9 +23952,9 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 12526, - "total_submitted": 32396, - "total_column_articles": 180, + "total_acs": 12605, + "total_submitted": 32563, + "total_column_articles": 181, "frontend_question_id": "1513", "is_new_question": false }, @@ -23637,9 +23973,9 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 65851, - "total_submitted": 77644, - "total_column_articles": 854, + "total_acs": 66346, + "total_submitted": 78334, + "total_column_articles": 865, "frontend_question_id": "1512", "is_new_question": false }, @@ -23658,9 +23994,9 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 1567, - "total_submitted": 1874, - "total_column_articles": 39, + "total_acs": 1593, + "total_submitted": 1904, + "total_column_articles": 40, "frontend_question_id": "1490", "is_new_question": false }, @@ -23679,9 +24015,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": 4000, - "total_submitted": 6281, - "total_column_articles": 70, + "total_acs": 4034, + "total_submitted": 6334, + "total_column_articles": 73, "frontend_question_id": "1526", "is_new_question": false }, @@ -23700,9 +24036,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": 6875, - "total_submitted": 10456, - "total_column_articles": 132, + "total_acs": 6934, + "total_submitted": 10551, + "total_column_articles": 133, "frontend_question_id": "1525", "is_new_question": false }, @@ -23721,9 +24057,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": 7136, - "total_submitted": 16090, - "total_column_articles": 129, + "total_acs": 7217, + "total_submitted": 16279, + "total_column_articles": 130, "frontend_question_id": "1524", "is_new_question": false }, @@ -23742,9 +24078,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": 27987, - "total_submitted": 55038, - "total_column_articles": 443, + "total_acs": 28920, + "total_submitted": 56895, + "total_column_articles": 457, "frontend_question_id": "1523", "is_new_question": false }, @@ -23763,9 +24099,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": 3805, - "total_submitted": 10186, - "total_column_articles": 82, + "total_acs": 3836, + "total_submitted": 10266, + "total_column_articles": 83, "frontend_question_id": "1505", "is_new_question": false }, @@ -23784,9 +24120,9 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 9421, - "total_submitted": 15399, - "total_column_articles": 151, + "total_acs": 9529, + "total_submitted": 15589, + "total_column_articles": 152, "frontend_question_id": "1504", "is_new_question": false }, @@ -23805,9 +24141,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": 9900, - "total_submitted": 18887, - "total_column_articles": 99, + "total_acs": 9979, + "total_submitted": 19082, + "total_column_articles": 100, "frontend_question_id": "1503", "is_new_question": false }, @@ -23826,9 +24162,9 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 35279, - "total_submitted": 49884, - "total_column_articles": 443, + "total_acs": 35718, + "total_submitted": 50597, + "total_column_articles": 448, "frontend_question_id": "1502", "is_new_question": false }, @@ -23847,9 +24183,9 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 18611, - "total_submitted": 27514, - "total_column_articles": 142, + "total_acs": 20648, + "total_submitted": 30597, + "total_column_articles": 152, "frontend_question_id": "1484", "is_new_question": false }, @@ -23868,8 +24204,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 1121, - "total_submitted": 1415, + "total_acs": 1148, + "total_submitted": 1458, "total_column_articles": 35, "frontend_question_id": "1485", "is_new_question": false @@ -23889,8 +24225,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 3017, - "total_submitted": 5412, + "total_acs": 3086, + "total_submitted": 5518, "total_column_articles": 55, "frontend_question_id": "1479", "is_new_question": false @@ -23910,9 +24246,9 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 3701, - "total_submitted": 9476, - "total_column_articles": 78, + "total_acs": 3739, + "total_submitted": 9556, + "total_column_articles": 79, "frontend_question_id": "1499", "is_new_question": false }, @@ -23931,9 +24267,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": 7332, - "total_submitted": 20466, - "total_column_articles": 106, + "total_acs": 7515, + "total_submitted": 20822, + "total_column_articles": 108, "frontend_question_id": "1498", "is_new_question": false }, @@ -23952,8 +24288,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": 10380, - "total_submitted": 26027, + "total_acs": 10559, + "total_submitted": 26403, "total_column_articles": 127, "frontend_question_id": "1497", "is_new_question": false @@ -23973,9 +24309,9 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 13509, - "total_submitted": 25321, - "total_column_articles": 203, + "total_acs": 13628, + "total_submitted": 25525, + "total_column_articles": 205, "frontend_question_id": "1496", "is_new_question": false }, @@ -23994,9 +24330,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": 2617, - "total_submitted": 3699, - "total_column_articles": 85, + "total_acs": 2652, + "total_submitted": 3752, + "total_column_articles": 88, "frontend_question_id": "1474", "is_new_question": false }, @@ -24015,8 +24351,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 6579, - "total_submitted": 11064, + "total_acs": 6654, + "total_submitted": 11175, "total_column_articles": 81, "frontend_question_id": "1510", "is_new_question": false @@ -24036,9 +24372,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": 6550, - "total_submitted": 11879, - "total_column_articles": 112, + "total_acs": 6611, + "total_submitted": 11982, + "total_column_articles": 114, "frontend_question_id": "1509", "is_new_question": false }, @@ -24057,9 +24393,9 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 8252, - "total_submitted": 14618, - "total_column_articles": 81, + "total_acs": 8408, + "total_submitted": 14858, + "total_column_articles": 84, "frontend_question_id": "1508", "is_new_question": false }, @@ -24078,9 +24414,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": 12374, - "total_submitted": 18112, - "total_column_articles": 138, + "total_acs": 12409, + "total_submitted": 18175, + "total_column_articles": 140, "frontend_question_id": "1489", "is_new_question": false }, @@ -24099,9 +24435,9 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 9839, - "total_submitted": 38790, - "total_column_articles": 143, + "total_acs": 9957, + "total_submitted": 39136, + "total_column_articles": 144, "frontend_question_id": "1488", "is_new_question": false }, @@ -24120,9 +24456,9 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 9124, - "total_submitted": 28438, - "total_column_articles": 118, + "total_acs": 9226, + "total_submitted": 28665, + "total_column_articles": 121, "frontend_question_id": "1487", "is_new_question": false }, @@ -24141,9 +24477,9 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 75691, - "total_submitted": 88244, - "total_column_articles": 731, + "total_acs": 75947, + "total_submitted": 88570, + "total_column_articles": 744, "frontend_question_id": "1486", "is_new_question": false }, @@ -24162,8 +24498,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 3908, - "total_submitted": 4777, + "total_acs": 3969, + "total_submitted": 4846, "total_column_articles": 118, "frontend_question_id": "1469", "is_new_question": false @@ -24183,8 +24519,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 4303, - "total_submitted": 6144, + "total_acs": 4405, + "total_submitted": 6300, "total_column_articles": 59, "frontend_question_id": "1468", "is_new_question": false @@ -24204,9 +24540,9 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 3863, - "total_submitted": 6235, - "total_column_articles": 67, + "total_acs": 4024, + "total_submitted": 6478, + "total_column_articles": 68, "frontend_question_id": "1459", "is_new_question": false }, @@ -24225,9 +24561,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": 35851, - "total_submitted": 60711, - "total_column_articles": 463, + "total_acs": 36125, + "total_submitted": 61237, + "total_column_articles": 464, "frontend_question_id": "1482", "is_new_question": false }, @@ -24246,9 +24582,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": 12687, - "total_submitted": 24954, - "total_column_articles": 181, + "total_acs": 13140, + "total_submitted": 26355, + "total_column_articles": 187, "frontend_question_id": "1481", "is_new_question": false }, @@ -24267,9 +24603,9 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 162088, - "total_submitted": 190901, - "total_column_articles": 1567, + "total_acs": 173988, + "total_submitted": 206803, + "total_column_articles": 1632, "frontend_question_id": "1480", "is_new_question": false }, @@ -24288,8 +24624,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 3194, - "total_submitted": 8309, + "total_acs": 3264, + "total_submitted": 8479, "total_column_articles": 47, "frontend_question_id": "1494", "is_new_question": false @@ -24309,9 +24645,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": 12202, - "total_submitted": 20838, - "total_column_articles": 218, + "total_acs": 12428, + "total_submitted": 21222, + "total_column_articles": 221, "frontend_question_id": "1493", "is_new_question": false }, @@ -24330,8 +24666,8 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 10621, - "total_submitted": 16900, + "total_acs": 10717, + "total_submitted": 17064, "total_column_articles": 121, "frontend_question_id": "1492", "is_new_question": false @@ -24351,9 +24687,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": 35228, - "total_submitted": 54658, - "total_column_articles": 496, + "total_acs": 35992, + "total_submitted": 55845, + "total_column_articles": 504, "frontend_question_id": "1491", "is_new_question": false }, @@ -24372,9 +24708,9 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 16363, - "total_submitted": 24457, - "total_column_articles": 172, + "total_acs": 16488, + "total_submitted": 24652, + "total_column_articles": 175, "frontend_question_id": "1473", "is_new_question": false }, @@ -24393,9 +24729,9 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 12294, - "total_submitted": 20067, - "total_column_articles": 195, + "total_acs": 12604, + "total_submitted": 20623, + "total_column_articles": 200, "frontend_question_id": "1472", "is_new_question": false }, @@ -24414,9 +24750,9 @@ "question__title": "The k Strongest Values in an Array", "question__title_slug": "the-k-strongest-values-in-an-array", "question__hide": false, - "total_acs": 8446, - "total_submitted": 15345, - "total_column_articles": 123, + "total_acs": 8522, + "total_submitted": 15476, + "total_column_articles": 124, "frontend_question_id": "1471", "is_new_question": false }, @@ -24435,9 +24771,9 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 60574, - "total_submitted": 72286, - "total_column_articles": 812, + "total_acs": 60970, + "total_submitted": 72780, + "total_column_articles": 824, "frontend_question_id": "1470", "is_new_question": false }, @@ -24456,9 +24792,9 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 7574, - "total_submitted": 18991, - "total_column_articles": 108, + "total_acs": 7769, + "total_submitted": 19529, + "total_column_articles": 113, "frontend_question_id": "1454", "is_new_question": false }, @@ -24477,9 +24813,9 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 7229, - "total_submitted": 8413, - "total_column_articles": 82, + "total_acs": 7591, + "total_submitted": 8857, + "total_column_articles": 87, "frontend_question_id": "1445", "is_new_question": false }, @@ -24498,8 +24834,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": 1957, - "total_submitted": 3110, + "total_acs": 1970, + "total_submitted": 3132, "total_column_articles": 53, "frontend_question_id": "1467", "is_new_question": false @@ -24519,9 +24855,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": 8404, - "total_submitted": 17008, - "total_column_articles": 173, + "total_acs": 8506, + "total_submitted": 17175, + "total_column_articles": 175, "frontend_question_id": "1466", "is_new_question": false }, @@ -24540,8 +24876,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": 7526, - "total_submitted": 23539, + "total_acs": 7688, + "total_submitted": 23859, "total_column_articles": 90, "frontend_question_id": "1465", "is_new_question": false @@ -24561,9 +24897,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": 34247, - "total_submitted": 44824, - "total_column_articles": 476, + "total_acs": 34710, + "total_submitted": 45417, + "total_column_articles": 480, "frontend_question_id": "1464", "is_new_question": false }, @@ -24582,8 +24918,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": 6798, - "total_submitted": 22604, + "total_acs": 6869, + "total_submitted": 22836, "total_column_articles": 121, "frontend_question_id": "1477", "is_new_question": false @@ -24603,8 +24939,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 14231, - "total_submitted": 16455, + "total_acs": 14310, + "total_submitted": 16551, "total_column_articles": 133, "frontend_question_id": "1476", "is_new_question": false @@ -24624,8 +24960,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 3892, - "total_submitted": 6400, + "total_acs": 3976, + "total_submitted": 6536, "total_column_articles": 71, "frontend_question_id": "1478", "is_new_question": false @@ -24645,9 +24981,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": 21325, - "total_submitted": 29862, - "total_column_articles": 344, + "total_acs": 21632, + "total_submitted": 30298, + "total_column_articles": 345, "frontend_question_id": "1475", "is_new_question": false }, @@ -24666,8 +25002,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 6385, - "total_submitted": 14185, + "total_acs": 6432, + "total_submitted": 14267, "total_column_articles": 102, "frontend_question_id": "1458", "is_new_question": false @@ -24687,9 +25023,9 @@ "question__title": "Pseudo-Palindromic Paths in a Binary Tree", "question__title_slug": "pseudo-palindromic-paths-in-a-binary-tree", "question__hide": false, - "total_acs": 9436, - "total_submitted": 15089, - "total_column_articles": 159, + "total_acs": 9510, + "total_submitted": 15208, + "total_column_articles": 160, "frontend_question_id": "1457", "is_new_question": false }, @@ -24708,9 +25044,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": 19944, - "total_submitted": 37484, - "total_column_articles": 286, + "total_acs": 20229, + "total_submitted": 38012, + "total_column_articles": 289, "frontend_question_id": "1456", "is_new_question": false }, @@ -24729,9 +25065,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": 14600, - "total_submitted": 23269, - "total_column_articles": 267, + "total_acs": 14777, + "total_submitted": 23640, + "total_column_articles": 271, "frontend_question_id": "1455", "is_new_question": false }, @@ -24750,9 +25086,9 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 4722, - "total_submitted": 6689, - "total_column_articles": 58, + "total_acs": 4953, + "total_submitted": 7036, + "total_column_articles": 59, "frontend_question_id": "1440", "is_new_question": false }, @@ -24771,8 +25107,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 5841, - "total_submitted": 9276, + "total_acs": 5925, + "total_submitted": 9386, "total_column_articles": 55, "frontend_question_id": "1435", "is_new_question": false @@ -24792,8 +25128,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": 1902, - "total_submitted": 5109, + "total_acs": 1912, + "total_submitted": 5143, "total_column_articles": 37, "frontend_question_id": "1453", "is_new_question": false @@ -24813,9 +25149,9 @@ "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": 6906, - "total_submitted": 13601, - "total_column_articles": 105, + "total_acs": 6959, + "total_submitted": 13679, + "total_column_articles": 107, "frontend_question_id": "1452", "is_new_question": false }, @@ -24834,8 +25170,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 11950, - "total_submitted": 22402, + "total_acs": 12019, + "total_submitted": 22540, "total_column_articles": 181, "frontend_question_id": "1451", "is_new_question": false @@ -24855,9 +25191,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": 27048, - "total_submitted": 33670, - "total_column_articles": 385, + "total_acs": 27306, + "total_submitted": 33983, + "total_column_articles": 388, "frontend_question_id": "1450", "is_new_question": false }, @@ -24876,9 +25212,9 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 3519, - "total_submitted": 5765, - "total_column_articles": 79, + "total_acs": 3631, + "total_submitted": 5934, + "total_column_articles": 84, "frontend_question_id": "1463", "is_new_question": false }, @@ -24897,9 +25233,9 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 9280, - "total_submitted": 20700, - "total_column_articles": 179, + "total_acs": 9483, + "total_submitted": 21112, + "total_column_articles": 180, "frontend_question_id": "1462", "is_new_question": false }, @@ -24918,9 +25254,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": 7611, - "total_submitted": 14726, - "total_column_articles": 108, + "total_acs": 7682, + "total_submitted": 14867, + "total_column_articles": 111, "frontend_question_id": "1461", "is_new_question": false }, @@ -24939,9 +25275,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": 18567, - "total_submitted": 25071, - "total_column_articles": 383, + "total_acs": 18708, + "total_submitted": 25259, + "total_column_articles": 388, "frontend_question_id": "1460", "is_new_question": false }, @@ -24960,9 +25296,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": 3228, - "total_submitted": 6021, - "total_column_articles": 73, + "total_acs": 3300, + "total_submitted": 6151, + "total_column_articles": 75, "frontend_question_id": "1444", "is_new_question": false }, @@ -24981,8 +25317,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": 6616, - "total_submitted": 15746, + "total_acs": 6652, + "total_submitted": 15842, "total_column_articles": 162, "frontend_question_id": "1443", "is_new_question": false @@ -25002,9 +25338,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": 36840, - "total_submitted": 46499, - "total_column_articles": 394, + "total_acs": 36914, + "total_submitted": 46602, + "total_column_articles": 395, "frontend_question_id": "1442", "is_new_question": false }, @@ -25023,9 +25359,9 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 21790, - "total_submitted": 33492, - "total_column_articles": 441, + "total_acs": 21950, + "total_submitted": 33702, + "total_column_articles": 445, "frontend_question_id": "1441", "is_new_question": false }, @@ -25044,9 +25380,9 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 4732, - "total_submitted": 6579, - "total_column_articles": 45, + "total_acs": 4822, + "total_submitted": 6715, + "total_column_articles": 46, "frontend_question_id": "1421", "is_new_question": false }, @@ -25065,9 +25401,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": 6339, - "total_submitted": 11370, - "total_column_articles": 89, + "total_acs": 6405, + "total_submitted": 11463, + "total_column_articles": 90, "frontend_question_id": "1439", "is_new_question": false }, @@ -25086,9 +25422,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": 38824, - "total_submitted": 79356, - "total_column_articles": 522, + "total_acs": 39160, + "total_submitted": 80003, + "total_column_articles": 523, "frontend_question_id": "1438", "is_new_question": false }, @@ -25107,9 +25443,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": 13085, - "total_submitted": 22760, - "total_column_articles": 218, + "total_acs": 13178, + "total_submitted": 22929, + "total_column_articles": 219, "frontend_question_id": "1437", "is_new_question": false }, @@ -25128,9 +25464,9 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 49145, - "total_submitted": 59926, - "total_column_articles": 707, + "total_acs": 49320, + "total_submitted": 60132, + "total_column_articles": 721, "frontend_question_id": "1436", "is_new_question": false }, @@ -25149,9 +25485,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": 4381, - "total_submitted": 7868, - "total_column_articles": 97, + "total_acs": 4521, + "total_submitted": 8086, + "total_column_articles": 98, "frontend_question_id": "1412", "is_new_question": false }, @@ -25170,9 +25506,9 @@ "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": 17764, - "total_submitted": 28379, - "total_column_articles": 216, + "total_acs": 17821, + "total_submitted": 28476, + "total_column_articles": 218, "frontend_question_id": "1449", "is_new_question": false }, @@ -25191,8 +25527,8 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 14789, - "total_submitted": 20556, + "total_acs": 14993, + "total_submitted": 20813, "total_column_articles": 243, "frontend_question_id": "1448", "is_new_question": false @@ -25212,9 +25548,9 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 39890, - "total_submitted": 58877, - "total_column_articles": 512, + "total_acs": 39945, + "total_submitted": 58995, + "total_column_articles": 513, "frontend_question_id": "1447", "is_new_question": false }, @@ -25233,9 +25569,9 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 54295, - "total_submitted": 89072, - "total_column_articles": 725, + "total_acs": 54501, + "total_submitted": 89422, + "total_column_articles": 737, "frontend_question_id": "1446", "is_new_question": false }, @@ -25254,9 +25590,9 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 14718, - "total_submitted": 22904, - "total_column_articles": 138, + "total_acs": 15897, + "total_submitted": 25193, + "total_column_articles": 146, "frontend_question_id": "1407", "is_new_question": false }, @@ -25275,9 +25611,9 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 8571, - "total_submitted": 20772, - "total_column_articles": 178, + "total_acs": 8664, + "total_submitted": 20999, + "total_column_articles": 179, "frontend_question_id": "1424", "is_new_question": false }, @@ -25296,9 +25632,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": 41743, - "total_submitted": 75273, - "total_column_articles": 588, + "total_acs": 42070, + "total_submitted": 75935, + "total_column_articles": 589, "frontend_question_id": "1423", "is_new_question": false }, @@ -25317,9 +25653,9 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 12803, - "total_submitted": 23618, - "total_column_articles": 246, + "total_acs": 12930, + "total_submitted": 23840, + "total_column_articles": 250, "frontend_question_id": "1422", "is_new_question": false }, @@ -25338,9 +25674,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": 7199, - "total_submitted": 9623, - "total_column_articles": 101, + "total_acs": 7479, + "total_submitted": 10013, + "total_column_articles": 107, "frontend_question_id": "1398", "is_new_question": false }, @@ -25359,8 +25695,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": 2994, - "total_submitted": 4831, + "total_acs": 3036, + "total_submitted": 4892, "total_column_articles": 55, "frontend_question_id": "1420", "is_new_question": false @@ -25380,9 +25716,9 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 9491, - "total_submitted": 22095, - "total_column_articles": 186, + "total_acs": 9591, + "total_submitted": 22345, + "total_column_articles": 189, "frontend_question_id": "1419", "is_new_question": false }, @@ -25401,8 +25737,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": 27395, - "total_submitted": 37477, + "total_acs": 27447, + "total_submitted": 37566, "total_column_articles": 433, "frontend_question_id": "1418", "is_new_question": false @@ -25422,9 +25758,9 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 15230, - "total_submitted": 29268, - "total_column_articles": 222, + "total_acs": 15353, + "total_submitted": 29509, + "total_column_articles": 226, "frontend_question_id": "1417", "is_new_question": false }, @@ -25443,8 +25779,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": 3227, - "total_submitted": 6557, + "total_acs": 3258, + "total_submitted": 6623, "total_column_articles": 56, "frontend_question_id": "1434", "is_new_question": false @@ -25464,9 +25800,9 @@ "question__title": "Check If a String Can Break Another String", "question__title_slug": "check-if-a-string-can-break-another-string", "question__hide": false, - "total_acs": 7060, - "total_submitted": 10999, - "total_column_articles": 130, + "total_acs": 7114, + "total_submitted": 11073, + "total_column_articles": 131, "frontend_question_id": "1433", "is_new_question": false }, @@ -25485,8 +25821,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": 5318, - "total_submitted": 13404, + "total_acs": 5365, + "total_submitted": 13506, "total_column_articles": 119, "frontend_question_id": "1432", "is_new_question": false @@ -25506,9 +25842,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": 83654, - "total_submitted": 98961, - "total_column_articles": 1101, + "total_acs": 83880, + "total_submitted": 99236, + "total_column_articles": 1114, "frontend_question_id": "1431", "is_new_question": false }, @@ -25527,9 +25863,9 @@ "question__title": "Number of Ways to Paint N × 3 Grid", "question__title_slug": "number-of-ways-to-paint-n-3-grid", "question__hide": false, - "total_acs": 8825, - "total_submitted": 15801, - "total_column_articles": 150, + "total_acs": 8865, + "total_submitted": 15853, + "total_column_articles": 151, "frontend_question_id": "1411", "is_new_question": false }, @@ -25548,8 +25884,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 8353, - "total_submitted": 17562, + "total_acs": 8417, + "total_submitted": 17668, "total_column_articles": 127, "frontend_question_id": "1410", "is_new_question": false @@ -25569,9 +25905,9 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 9587, - "total_submitted": 11818, - "total_column_articles": 163, + "total_acs": 9662, + "total_submitted": 11896, + "total_column_articles": 165, "frontend_question_id": "1409", "is_new_question": false }, @@ -25590,9 +25926,9 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 16406, - "total_submitted": 26535, - "total_column_articles": 244, + "total_acs": 16526, + "total_submitted": 26733, + "total_column_articles": 245, "frontend_question_id": "1408", "is_new_question": false }, @@ -25611,9 +25947,9 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 12057, - "total_submitted": 14207, - "total_column_articles": 130, + "total_acs": 13093, + "total_submitted": 15404, + "total_column_articles": 141, "frontend_question_id": "1393", "is_new_question": false }, @@ -25632,8 +25968,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 6342, - "total_submitted": 10815, + "total_acs": 6396, + "total_submitted": 10895, "total_column_articles": 98, "frontend_question_id": "1406", "is_new_question": false @@ -25653,9 +25989,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": 8422, - "total_submitted": 16845, - "total_column_articles": 174, + "total_acs": 8485, + "total_submitted": 16964, + "total_column_articles": 175, "frontend_question_id": "1404", "is_new_question": false }, @@ -25674,8 +26010,8 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 24646, - "total_submitted": 35754, + "total_acs": 24753, + "total_submitted": 35908, "total_column_articles": 420, "frontend_question_id": "1403", "is_new_question": false @@ -25695,9 +26031,9 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 3171, - "total_submitted": 5549, - "total_column_articles": 70, + "total_acs": 3271, + "total_submitted": 5717, + "total_column_articles": 73, "frontend_question_id": "1384", "is_new_question": false }, @@ -25716,8 +26052,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 3312, - "total_submitted": 7943, + "total_acs": 3345, + "total_submitted": 8031, "total_column_articles": 62, "frontend_question_id": "1416", "is_new_question": false @@ -25737,9 +26073,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": 7730, - "total_submitted": 11274, - "total_column_articles": 206, + "total_acs": 7791, + "total_submitted": 11372, + "total_column_articles": 207, "frontend_question_id": "1415", "is_new_question": false }, @@ -25758,9 +26094,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": 28651, - "total_submitted": 40591, - "total_column_articles": 431, + "total_acs": 28751, + "total_submitted": 40725, + "total_column_articles": 434, "frontend_question_id": "1414", "is_new_question": false }, @@ -25779,9 +26115,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": 14425, - "total_submitted": 20717, - "total_column_articles": 305, + "total_acs": 14572, + "total_submitted": 20929, + "total_column_articles": 304, "frontend_question_id": "1413", "is_new_question": false }, @@ -25800,9 +26136,9 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 1307, - "total_submitted": 3192, - "total_column_articles": 41, + "total_acs": 1330, + "total_submitted": 3232, + "total_column_articles": 42, "frontend_question_id": "1397", "is_new_question": false }, @@ -25821,9 +26157,9 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 16508, - "total_submitted": 40372, - "total_column_articles": 222, + "total_acs": 16983, + "total_submitted": 41374, + "total_column_articles": 227, "frontend_question_id": "1396", "is_new_question": false }, @@ -25842,9 +26178,9 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 17091, - "total_submitted": 23540, - "total_column_articles": 246, + "total_acs": 17220, + "total_submitted": 23751, + "total_column_articles": 248, "frontend_question_id": "1395", "is_new_question": false }, @@ -25863,9 +26199,9 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 20975, - "total_submitted": 31726, - "total_column_articles": 351, + "total_acs": 21261, + "total_submitted": 32225, + "total_column_articles": 354, "frontend_question_id": "1394", "is_new_question": false }, @@ -25884,9 +26220,9 @@ "question__title": "Replace Employee ID With The Unique Identifier", "question__title_slug": "replace-employee-id-with-the-unique-identifier", "question__hide": false, - "total_acs": 9376, - "total_submitted": 10789, - "total_column_articles": 72, + "total_acs": 9475, + "total_submitted": 10898, + "total_column_articles": 74, "frontend_question_id": "1378", "is_new_question": false }, @@ -25905,9 +26241,9 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 11205, - "total_submitted": 25949, - "total_column_articles": 192, + "total_acs": 11372, + "total_submitted": 26283, + "total_column_articles": 194, "frontend_question_id": "1392", "is_new_question": false }, @@ -25926,8 +26262,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": 7660, - "total_submitted": 18731, + "total_acs": 7716, + "total_submitted": 18854, "total_column_articles": 236, "frontend_question_id": "1391", "is_new_question": false @@ -25947,9 +26283,9 @@ "question__title": "Create Target Array in the Given Order", "question__title_slug": "create-target-array-in-the-given-order", "question__hide": false, - "total_acs": 31717, - "total_submitted": 38167, - "total_column_articles": 521, + "total_acs": 31850, + "total_submitted": 38327, + "total_column_articles": 524, "frontend_question_id": "1389", "is_new_question": false }, @@ -25968,9 +26304,9 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 4317, - "total_submitted": 7069, - "total_column_articles": 67, + "total_acs": 4486, + "total_submitted": 7331, + "total_column_articles": 69, "frontend_question_id": "1369", "is_new_question": false }, @@ -25989,9 +26325,9 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 12049, - "total_submitted": 15886, - "total_column_articles": 212, + "total_acs": 12142, + "total_submitted": 16001, + "total_column_articles": 213, "frontend_question_id": "1402", "is_new_question": false }, @@ -26010,9 +26346,9 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 7792, - "total_submitted": 12745, - "total_column_articles": 127, + "total_acs": 7864, + "total_submitted": 12883, + "total_column_articles": 128, "frontend_question_id": "1400", "is_new_question": false }, @@ -26031,9 +26367,9 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 4814, - "total_submitted": 11340, - "total_column_articles": 108, + "total_acs": 4853, + "total_submitted": 11424, + "total_column_articles": 109, "frontend_question_id": "1401", "is_new_question": false }, @@ -26052,9 +26388,9 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 11419, - "total_submitted": 17061, - "total_column_articles": 185, + "total_acs": 11511, + "total_submitted": 17213, + "total_column_articles": 187, "frontend_question_id": "1399", "is_new_question": false }, @@ -26073,9 +26409,9 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 5370, - "total_submitted": 16096, - "total_column_articles": 100, + "total_acs": 5406, + "total_submitted": 16175, + "total_column_articles": 101, "frontend_question_id": "1383", "is_new_question": false }, @@ -26094,9 +26430,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": 12716, - "total_submitted": 15147, - "total_column_articles": 192, + "total_acs": 12817, + "total_submitted": 15257, + "total_column_articles": 195, "frontend_question_id": "1379", "is_new_question": false }, @@ -26115,9 +26451,9 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 15027, - "total_submitted": 20585, - "total_column_articles": 191, + "total_acs": 15169, + "total_submitted": 20783, + "total_column_articles": 192, "frontend_question_id": "1381", "is_new_question": false }, @@ -26136,9 +26472,9 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 52854, - "total_submitted": 68807, - "total_column_articles": 708, + "total_acs": 52971, + "total_submitted": 68955, + "total_column_articles": 718, "frontend_question_id": "1380", "is_new_question": false }, @@ -26157,8 +26493,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": 4914, - "total_submitted": 7143, + "total_acs": 5024, + "total_submitted": 7306, "total_column_articles": 81, "frontend_question_id": "1364", "is_new_question": false @@ -26178,8 +26514,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 5701, - "total_submitted": 8519, + "total_acs": 5796, + "total_submitted": 8653, "total_column_articles": 73, "frontend_question_id": "1355", "is_new_question": false @@ -26199,9 +26535,9 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 5065, - "total_submitted": 15231, - "total_column_articles": 147, + "total_acs": 5108, + "total_submitted": 15340, + "total_column_articles": 148, "frontend_question_id": "1377", "is_new_question": false }, @@ -26220,9 +26556,9 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 11460, - "total_submitted": 21480, - "total_column_articles": 225, + "total_acs": 11670, + "total_submitted": 21849, + "total_column_articles": 226, "frontend_question_id": "1376", "is_new_question": false }, @@ -26241,8 +26577,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": 9638, - "total_submitted": 16460, + "total_acs": 9688, + "total_submitted": 16527, "total_column_articles": 191, "frontend_question_id": "1375", "is_new_question": false @@ -26262,9 +26598,9 @@ "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": 19168, - "total_submitted": 25743, - "total_column_articles": 254, + "total_acs": 19273, + "total_submitted": 25877, + "total_column_articles": 255, "frontend_question_id": "1374", "is_new_question": false }, @@ -26283,8 +26619,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 5705, - "total_submitted": 10227, + "total_acs": 5772, + "total_submitted": 10327, "total_column_articles": 66, "frontend_question_id": "1388", "is_new_question": false @@ -26304,9 +26640,9 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 11724, - "total_submitted": 16881, - "total_column_articles": 210, + "total_acs": 11799, + "total_submitted": 17001, + "total_column_articles": 211, "frontend_question_id": "1387", "is_new_question": false }, @@ -26325,9 +26661,9 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 7524, - "total_submitted": 23033, - "total_column_articles": 145, + "total_acs": 7611, + "total_submitted": 23255, + "total_column_articles": 147, "frontend_question_id": "1386", "is_new_question": false }, @@ -26346,9 +26682,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": 25597, - "total_submitted": 38929, - "total_column_articles": 350, + "total_acs": 26517, + "total_submitted": 40403, + "total_column_articles": 361, "frontend_question_id": "1385", "is_new_question": false }, @@ -26367,9 +26703,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": 5793, - "total_submitted": 10127, - "total_column_articles": 127, + "total_acs": 5885, + "total_submitted": 10271, + "total_column_articles": 128, "frontend_question_id": "1368", "is_new_question": false }, @@ -26388,9 +26724,9 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 19429, - "total_submitted": 45226, - "total_column_articles": 297, + "total_acs": 19588, + "total_submitted": 45608, + "total_column_articles": 298, "frontend_question_id": "1367", "is_new_question": false }, @@ -26409,9 +26745,9 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 8450, - "total_submitted": 15600, - "total_column_articles": 160, + "total_acs": 8534, + "total_submitted": 15742, + "total_column_articles": 161, "frontend_question_id": "1366", "is_new_question": false }, @@ -26430,9 +26766,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": 96406, - "total_submitted": 116964, - "total_column_articles": 1194, + "total_acs": 97490, + "total_submitted": 118306, + "total_column_articles": 1204, "frontend_question_id": "1365", "is_new_question": false }, @@ -26451,9 +26787,9 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 10867, - "total_submitted": 12799, - "total_column_articles": 98, + "total_acs": 10956, + "total_submitted": 12892, + "total_column_articles": 99, "frontend_question_id": "1350", "is_new_question": false }, @@ -26472,9 +26808,9 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 5142, - "total_submitted": 12911, - "total_column_articles": 71, + "total_acs": 5316, + "total_submitted": 13265, + "total_column_articles": 73, "frontend_question_id": "1341", "is_new_question": false }, @@ -26493,8 +26829,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 3476, - "total_submitted": 12223, + "total_acs": 3505, + "total_submitted": 12327, "total_column_articles": 78, "frontend_question_id": "1354", "is_new_question": false @@ -26514,9 +26850,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": 14965, - "total_submitted": 51104, - "total_column_articles": 186, + "total_acs": 15234, + "total_submitted": 52008, + "total_column_articles": 187, "frontend_question_id": "1353", "is_new_question": false }, @@ -26535,9 +26871,9 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 8730, - "total_submitted": 18942, - "total_column_articles": 101, + "total_acs": 8910, + "total_submitted": 19270, + "total_column_articles": 102, "frontend_question_id": "1352", "is_new_question": false }, @@ -26556,9 +26892,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": 40199, - "total_submitted": 53558, - "total_column_articles": 655, + "total_acs": 40731, + "total_submitted": 54333, + "total_column_articles": 674, "frontend_question_id": "1351", "is_new_question": false }, @@ -26577,9 +26913,9 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 14645, - "total_submitted": 34818, - "total_column_articles": 268, + "total_acs": 14842, + "total_submitted": 35248, + "total_column_articles": 270, "frontend_question_id": "1373", "is_new_question": false }, @@ -26598,9 +26934,9 @@ "question__title": "Longest ZigZag Path in a Binary Tree", "question__title_slug": "longest-zigzag-path-in-a-binary-tree", "question__hide": false, - "total_acs": 10621, - "total_submitted": 20135, - "total_column_articles": 196, + "total_acs": 10738, + "total_submitted": 20327, + "total_column_articles": 198, "frontend_question_id": "1372", "is_new_question": false }, @@ -26619,9 +26955,9 @@ "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": 23123, - "total_submitted": 39748, - "total_column_articles": 289, + "total_acs": 23219, + "total_submitted": 39903, + "total_column_articles": 291, "frontend_question_id": "1371", "is_new_question": false }, @@ -26640,8 +26976,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 50583, - "total_submitted": 64105, + "total_acs": 50703, + "total_submitted": 64260, "total_column_articles": 608, "frontend_question_id": "1370", "is_new_question": false @@ -26661,9 +26997,9 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 4138, - "total_submitted": 7891, - "total_column_articles": 111, + "total_acs": 4176, + "total_submitted": 7952, + "total_column_articles": 112, "frontend_question_id": "1349", "is_new_question": false }, @@ -26682,8 +27018,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 4401, - "total_submitted": 13448, + "total_acs": 4504, + "total_submitted": 13683, "total_column_articles": 68, "frontend_question_id": "1348", "is_new_question": false @@ -26703,8 +27039,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": 9701, - "total_submitted": 12916, + "total_acs": 9793, + "total_submitted": 13032, "total_column_articles": 152, "frontend_question_id": "1347", "is_new_question": false @@ -26724,9 +27060,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": 23791, - "total_submitted": 55621, - "total_column_articles": 397, + "total_acs": 24460, + "total_submitted": 57248, + "total_column_articles": 403, "frontend_question_id": "1346", "is_new_question": false }, @@ -26745,9 +27081,9 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 2739, - "total_submitted": 6072, - "total_column_articles": 65, + "total_acs": 2790, + "total_submitted": 6185, + "total_column_articles": 66, "frontend_question_id": "1336", "is_new_question": false }, @@ -26766,9 +27102,9 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 5582, - "total_submitted": 9601, - "total_column_articles": 114, + "total_acs": 5630, + "total_submitted": 9672, + "total_column_articles": 115, "frontend_question_id": "1340", "is_new_question": false }, @@ -26787,8 +27123,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 10480, - "total_submitted": 25670, + "total_acs": 10622, + "total_submitted": 25971, "total_column_articles": 163, "frontend_question_id": "1339", "is_new_question": false @@ -26808,9 +27144,9 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 10916, - "total_submitted": 16966, - "total_column_articles": 160, + "total_acs": 11016, + "total_submitted": 17110, + "total_column_articles": 161, "frontend_question_id": "1338", "is_new_question": false }, @@ -26829,9 +27165,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": 49377, - "total_submitted": 71561, - "total_column_articles": 786, + "total_acs": 49814, + "total_submitted": 72199, + "total_column_articles": 799, "frontend_question_id": "1337", "is_new_question": false }, @@ -26850,9 +27186,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": 7691, - "total_submitted": 11179, - "total_column_articles": 71, + "total_acs": 7786, + "total_submitted": 11307, + "total_column_articles": 72, "frontend_question_id": "1327", "is_new_question": false }, @@ -26871,9 +27207,9 @@ "question__title": "Count All Valid Pickup and Delivery Options", "question__title_slug": "count-all-valid-pickup-and-delivery-options", "question__hide": false, - "total_acs": 3568, - "total_submitted": 6373, - "total_column_articles": 81, + "total_acs": 3623, + "total_submitted": 6458, + "total_column_articles": 84, "frontend_question_id": "1359", "is_new_question": false }, @@ -26892,9 +27228,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": 8133, - "total_submitted": 15703, - "total_column_articles": 150, + "total_acs": 8268, + "total_submitted": 15929, + "total_column_articles": 153, "frontend_question_id": "1358", "is_new_question": false }, @@ -26913,9 +27249,9 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 5558, - "total_submitted": 10408, - "total_column_articles": 58, + "total_acs": 5658, + "total_submitted": 10580, + "total_column_articles": 59, "frontend_question_id": "1357", "is_new_question": false }, @@ -26934,9 +27270,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": 52498, - "total_submitted": 71813, - "total_column_articles": 600, + "total_acs": 52900, + "total_submitted": 72364, + "total_column_articles": 602, "frontend_question_id": "1356", "is_new_question": false }, @@ -26955,9 +27291,9 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 4476, - "total_submitted": 7544, - "total_column_articles": 70, + "total_acs": 4544, + "total_submitted": 7665, + "total_column_articles": 73, "frontend_question_id": "1335", "is_new_question": false }, @@ -26976,9 +27312,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": 8101, - "total_submitted": 15845, - "total_column_articles": 123, + "total_acs": 8213, + "total_submitted": 16079, + "total_column_articles": 124, "frontend_question_id": "1334", "is_new_question": false }, @@ -26997,9 +27333,9 @@ "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": 6747, - "total_submitted": 12173, - "total_column_articles": 138, + "total_acs": 6813, + "total_submitted": 12291, + "total_column_articles": 139, "frontend_question_id": "1333", "is_new_question": false }, @@ -27018,9 +27354,9 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 32296, - "total_submitted": 41437, - "total_column_articles": 339, + "total_acs": 32455, + "total_submitted": 41640, + "total_column_articles": 340, "frontend_question_id": "1332", "is_new_question": false }, @@ -27039,9 +27375,9 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 7612, - "total_submitted": 12796, - "total_column_articles": 80, + "total_acs": 7723, + "total_submitted": 12970, + "total_column_articles": 81, "frontend_question_id": "1322", "is_new_question": false }, @@ -27060,9 +27396,9 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 7209, - "total_submitted": 11483, - "total_column_articles": 117, + "total_acs": 7458, + "total_submitted": 11880, + "total_column_articles": 118, "frontend_question_id": "1321", "is_new_question": false }, @@ -27081,9 +27417,9 @@ "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": 6962, - "total_submitted": 14604, - "total_column_articles": 103, + "total_acs": 7025, + "total_submitted": 14749, + "total_column_articles": 106, "frontend_question_id": "1326", "is_new_question": false }, @@ -27102,9 +27438,9 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 13382, - "total_submitted": 18307, - "total_column_articles": 222, + "total_acs": 13542, + "total_submitted": 18520, + "total_column_articles": 223, "frontend_question_id": "1325", "is_new_question": false }, @@ -27123,9 +27459,9 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 7226, - "total_submitted": 12265, - "total_column_articles": 149, + "total_acs": 7300, + "total_submitted": 12379, + "total_column_articles": 152, "frontend_question_id": "1324", "is_new_question": false }, @@ -27144,9 +27480,9 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 29782, - "total_submitted": 39601, - "total_column_articles": 561, + "total_acs": 30109, + "total_submitted": 40045, + "total_column_articles": 564, "frontend_question_id": "1323", "is_new_question": false }, @@ -27165,9 +27501,9 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 25560, - "total_submitted": 54863, - "total_column_articles": 279, + "total_acs": 25668, + "total_submitted": 55112, + "total_column_articles": 282, "frontend_question_id": "1345", "is_new_question": false }, @@ -27186,8 +27522,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 7920, - "total_submitted": 13229, + "total_acs": 7982, + "total_submitted": 13367, "total_column_articles": 144, "frontend_question_id": "1344", "is_new_question": false @@ -27207,9 +27543,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": 15088, - "total_submitted": 27012, - "total_column_articles": 257, + "total_acs": 15200, + "total_submitted": 27183, + "total_column_articles": 260, "frontend_question_id": "1343", "is_new_question": false }, @@ -27228,9 +27564,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": 73098, - "total_submitted": 88874, - "total_column_articles": 1005, + "total_acs": 75563, + "total_submitted": 92000, + "total_column_articles": 1040, "frontend_question_id": "1342", "is_new_question": false }, @@ -27249,8 +27585,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": 2918, - "total_submitted": 4929, + "total_acs": 2943, + "total_submitted": 4971, "total_column_articles": 68, "frontend_question_id": "1320", "is_new_question": false @@ -27270,9 +27606,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": 37931, - "total_submitted": 61114, - "total_column_articles": 597, + "total_acs": 38302, + "total_submitted": 61731, + "total_column_articles": 603, "frontend_question_id": "1319", "is_new_question": false }, @@ -27291,8 +27627,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": 7530, - "total_submitted": 11420, + "total_acs": 7586, + "total_submitted": 11491, "total_column_articles": 136, "frontend_question_id": "1318", "is_new_question": false @@ -27312,8 +27648,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": 12157, - "total_submitted": 19663, + "total_acs": 12239, + "total_submitted": 19787, "total_column_articles": 229, "frontend_question_id": "1317", "is_new_question": false @@ -27333,9 +27669,9 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 8323, - "total_submitted": 11156, - "total_column_articles": 84, + "total_acs": 8609, + "total_submitted": 11559, + "total_column_articles": 86, "frontend_question_id": "1308", "is_new_question": false }, @@ -27354,9 +27690,9 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 13974, - "total_submitted": 16994, - "total_column_articles": 132, + "total_acs": 14457, + "total_submitted": 17569, + "total_column_articles": 135, "frontend_question_id": "1303", "is_new_question": false }, @@ -27375,8 +27711,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": 16575, - "total_submitted": 24334, + "total_acs": 16914, + "total_submitted": 24799, "total_column_articles": 194, "frontend_question_id": "1312", "is_new_question": false @@ -27396,8 +27732,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 6506, - "total_submitted": 16742, + "total_acs": 6536, + "total_submitted": 16800, "total_column_articles": 98, "frontend_question_id": "1311", "is_new_question": false @@ -27417,8 +27753,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 39918, - "total_submitted": 55634, + "total_acs": 40029, + "total_submitted": 55808, "total_column_articles": 525, "frontend_question_id": "1310", "is_new_question": false @@ -27438,9 +27774,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": 21870, - "total_submitted": 28631, - "total_column_articles": 389, + "total_acs": 22070, + "total_submitted": 28916, + "total_column_articles": 392, "frontend_question_id": "1309", "is_new_question": false }, @@ -27459,8 +27795,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 4695, - "total_submitted": 12155, + "total_acs": 4738, + "total_submitted": 12242, "total_column_articles": 78, "frontend_question_id": "2227", "is_new_question": false @@ -27480,8 +27816,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": 1037, - "total_submitted": 1896, + "total_acs": 1062, + "total_submitted": 1932, "total_column_articles": 44, "frontend_question_id": "1430", "is_new_question": false @@ -27501,9 +27837,9 @@ "question__title": "All Ancestors of a Node in a Directed Acyclic Graph", "question__title_slug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "question__hide": false, - "total_acs": 4583, - "total_submitted": 10919, - "total_column_articles": 91, + "total_acs": 4673, + "total_submitted": 11056, + "total_column_articles": 92, "frontend_question_id": "2192", "is_new_question": false }, @@ -27522,9 +27858,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": 6028, - "total_submitted": 9408, - "total_column_articles": 65, + "total_acs": 6211, + "total_submitted": 9715, + "total_column_articles": 69, "frontend_question_id": "2269", "is_new_question": false }, @@ -27543,9 +27879,9 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 2070, - "total_submitted": 6233, - "total_column_articles": 62, + "total_acs": 2084, + "total_submitted": 6285, + "total_column_articles": 64, "frontend_question_id": "1307", "is_new_question": false }, @@ -27564,9 +27900,9 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 24421, - "total_submitted": 41954, - "total_column_articles": 372, + "total_acs": 24750, + "total_submitted": 42470, + "total_column_articles": 379, "frontend_question_id": "1306", "is_new_question": false }, @@ -27585,9 +27921,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": 47360, - "total_submitted": 60596, - "total_column_articles": 650, + "total_acs": 47553, + "total_submitted": 60832, + "total_column_articles": 651, "frontend_question_id": "1305", "is_new_question": false }, @@ -27606,9 +27942,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": 24706, - "total_submitted": 34562, - "total_column_articles": 428, + "total_acs": 24973, + "total_submitted": 34983, + "total_column_articles": 430, "frontend_question_id": "1304", "is_new_question": false }, @@ -27627,9 +27963,9 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 10494, - "total_submitted": 16022, - "total_column_articles": 108, + "total_acs": 10749, + "total_submitted": 16422, + "total_column_articles": 110, "frontend_question_id": "1294", "is_new_question": false }, @@ -27648,9 +27984,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": 3052, - "total_submitted": 5117, - "total_column_articles": 100, + "total_acs": 3073, + "total_submitted": 5143, + "total_column_articles": 102, "frontend_question_id": "1298", "is_new_question": false }, @@ -27669,9 +28005,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": 8308, - "total_submitted": 17701, - "total_column_articles": 110, + "total_acs": 8413, + "total_submitted": 17895, + "total_column_articles": 111, "frontend_question_id": "1297", "is_new_question": false }, @@ -27690,8 +28026,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": 10594, - "total_submitted": 21893, + "total_acs": 10666, + "total_submitted": 22062, "total_column_articles": 156, "frontend_question_id": "1296", "is_new_question": false @@ -27711,9 +28047,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": 52952, - "total_submitted": 65703, - "total_column_articles": 701, + "total_acs": 53133, + "total_submitted": 65935, + "total_column_articles": 711, "frontend_question_id": "1295", "is_new_question": false }, @@ -27732,9 +28068,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": 7062, - "total_submitted": 8658, - "total_column_articles": 87, + "total_acs": 7330, + "total_submitted": 8964, + "total_column_articles": 92, "frontend_question_id": "1285", "is_new_question": false }, @@ -27753,9 +28089,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": 72, - "total_submitted": 104, - "total_column_articles": 7, + "total_acs": 81, + "total_submitted": 113, + "total_column_articles": 9, "frontend_question_id": "2263", "is_new_question": false }, @@ -27774,9 +28110,9 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 6444, - "total_submitted": 9220, - "total_column_articles": 93, + "total_acs": 6906, + "total_submitted": 9815, + "total_column_articles": 98, "frontend_question_id": "2305", "is_new_question": false }, @@ -27795,9 +28131,9 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 238, - "total_submitted": 341, - "total_column_articles": 15, + "total_acs": 246, + "total_submitted": 354, + "total_column_articles": 16, "frontend_question_id": "2229", "is_new_question": false }, @@ -27816,9 +28152,9 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 10280, - "total_submitted": 20570, - "total_column_articles": 97, + "total_acs": 10575, + "total_submitted": 21194, + "total_column_articles": 99, "frontend_question_id": "1280", "is_new_question": false }, @@ -27837,9 +28173,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": 17368, - "total_submitted": 46280, - "total_column_articles": 155, + "total_acs": 17563, + "total_submitted": 46817, + "total_column_articles": 158, "frontend_question_id": "1293", "is_new_question": false }, @@ -27858,9 +28194,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": 8523, - "total_submitted": 17364, - "total_column_articles": 130, + "total_acs": 8660, + "total_submitted": 17613, + "total_column_articles": 132, "frontend_question_id": "1292", "is_new_question": false }, @@ -27879,9 +28215,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": 66479, - "total_submitted": 82257, - "total_column_articles": 855, + "total_acs": 66974, + "total_submitted": 82863, + "total_column_articles": 872, "frontend_question_id": "1290", "is_new_question": false }, @@ -27900,9 +28236,9 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 2062, - "total_submitted": 3254, - "total_column_articles": 22, + "total_acs": 2089, + "total_submitted": 3312, + "total_column_articles": 23, "frontend_question_id": "1279", "is_new_question": false }, @@ -27921,9 +28257,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": 3197, - "total_submitted": 4729, - "total_column_articles": 76, + "total_acs": 3215, + "total_submitted": 4754, + "total_column_articles": 78, "frontend_question_id": "1284", "is_new_question": false }, @@ -27942,8 +28278,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": 10427, - "total_submitted": 22738, + "total_acs": 10636, + "total_submitted": 23114, "total_column_articles": 144, "frontend_question_id": "1283", "is_new_question": false @@ -27963,9 +28299,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": 14654, - "total_submitted": 18011, - "total_column_articles": 276, + "total_acs": 14761, + "total_submitted": 18140, + "total_column_articles": 279, "frontend_question_id": "1282", "is_new_question": false }, @@ -27984,9 +28320,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": 57660, - "total_submitted": 69142, - "total_column_articles": 760, + "total_acs": 58389, + "total_submitted": 70017, + "total_column_articles": 776, "frontend_question_id": "1281", "is_new_question": false }, @@ -28005,8 +28341,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": 8558, - "total_submitted": 10600, + "total_acs": 8774, + "total_submitted": 10889, "total_column_articles": 109, "frontend_question_id": "1270", "is_new_question": false @@ -28026,8 +28362,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 3947, - "total_submitted": 4329, + "total_acs": 3987, + "total_submitted": 4388, "total_column_articles": 86, "frontend_question_id": "1265", "is_new_question": false @@ -28047,8 +28383,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 4790, - "total_submitted": 7781, + "total_acs": 4851, + "total_submitted": 7861, "total_column_articles": 74, "frontend_question_id": "1278", "is_new_question": false @@ -28068,9 +28404,9 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 24798, - "total_submitted": 33799, - "total_column_articles": 287, + "total_acs": 25118, + "total_submitted": 34205, + "total_column_articles": 289, "frontend_question_id": "1277", "is_new_question": false }, @@ -28089,8 +28425,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": 7603, - "total_submitted": 15124, + "total_acs": 7657, + "total_submitted": 15220, "total_column_articles": 114, "frontend_question_id": "1276", "is_new_question": false @@ -28110,8 +28446,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": 10039, - "total_submitted": 18334, + "total_acs": 10139, + "total_submitted": 18485, "total_column_articles": 199, "frontend_question_id": "1275", "is_new_question": false @@ -28131,9 +28467,9 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 8028, - "total_submitted": 14015, - "total_column_articles": 120, + "total_acs": 8340, + "total_submitted": 14552, + "total_column_articles": 122, "frontend_question_id": "1264", "is_new_question": false }, @@ -28152,9 +28488,9 @@ "question__title": "Number of Ways to Stay in the Same Place After Some Steps", "question__title_slug": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "question__hide": false, - "total_acs": 31195, - "total_submitted": 63583, - "total_column_articles": 327, + "total_acs": 31297, + "total_submitted": 63795, + "total_column_articles": 329, "frontend_question_id": "1269", "is_new_question": false }, @@ -28173,9 +28509,9 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 11240, - "total_submitted": 19014, - "total_column_articles": 188, + "total_acs": 11547, + "total_submitted": 19533, + "total_column_articles": 191, "frontend_question_id": "1268", "is_new_question": false }, @@ -28194,9 +28530,9 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 11192, - "total_submitted": 18316, - "total_column_articles": 170, + "total_acs": 11308, + "total_submitted": 18509, + "total_column_articles": 171, "frontend_question_id": "1267", "is_new_question": false }, @@ -28215,8 +28551,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 32504, - "total_submitted": 39334, + "total_acs": 32633, + "total_submitted": 39486, "total_column_articles": 487, "frontend_question_id": "1266", "is_new_question": false @@ -28236,9 +28572,9 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 5685, - "total_submitted": 9130, - "total_column_articles": 105, + "total_acs": 5838, + "total_submitted": 9314, + "total_column_articles": 108, "frontend_question_id": "2304", "is_new_question": false }, @@ -28257,9 +28593,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": 4784, - "total_submitted": 8948, - "total_column_articles": 74, + "total_acs": 4839, + "total_submitted": 9033, + "total_column_articles": 75, "frontend_question_id": "2218", "is_new_question": false }, @@ -28278,9 +28614,9 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 10470, - "total_submitted": 15651, - "total_column_articles": 105, + "total_acs": 10618, + "total_submitted": 15868, + "total_column_articles": 107, "frontend_question_id": "2215", "is_new_question": false }, @@ -28299,9 +28635,9 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 1981, - "total_submitted": 2809, - "total_column_articles": 68, + "total_acs": 1996, + "total_submitted": 2830, + "total_column_articles": 70, "frontend_question_id": "1426", "is_new_question": false }, @@ -28320,9 +28656,9 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 12363, - "total_submitted": 16069, - "total_column_articles": 133, + "total_acs": 12791, + "total_submitted": 16636, + "total_column_articles": 139, "frontend_question_id": "1251", "is_new_question": false }, @@ -28341,9 +28677,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": 4261, - "total_submitted": 9995, - "total_column_articles": 77, + "total_acs": 4308, + "total_submitted": 10085, + "total_column_articles": 78, "frontend_question_id": "1263", "is_new_question": false }, @@ -28362,8 +28698,8 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 17293, - "total_submitted": 32729, + "total_acs": 17473, + "total_submitted": 33097, "total_column_articles": 238, "frontend_question_id": "1262", "is_new_question": false @@ -28383,9 +28719,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": 9737, - "total_submitted": 13278, - "total_column_articles": 142, + "total_acs": 9836, + "total_submitted": 13403, + "total_column_articles": 145, "frontend_question_id": "1261", "is_new_question": false }, @@ -28404,9 +28740,9 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 15768, - "total_submitted": 26041, - "total_column_articles": 303, + "total_acs": 15894, + "total_submitted": 26296, + "total_column_articles": 307, "frontend_question_id": "1260", "is_new_question": false }, @@ -28425,8 +28761,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": 128, - "total_submitted": 218, + "total_acs": 131, + "total_submitted": 221, "total_column_articles": 11, "frontend_question_id": "2189", "is_new_question": false @@ -28446,8 +28782,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": 568, - "total_submitted": 954, + "total_acs": 580, + "total_submitted": 970, "total_column_articles": 24, "frontend_question_id": "1618", "is_new_question": false @@ -28467,8 +28803,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 90, - "total_submitted": 135, + "total_acs": 93, + "total_submitted": 138, "total_column_articles": 6, "frontend_question_id": "2198", "is_new_question": false @@ -28488,9 +28824,9 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 7377, - "total_submitted": 11581, - "total_column_articles": 56, + "total_acs": 7591, + "total_submitted": 11908, + "total_column_articles": 58, "frontend_question_id": "2303", "is_new_question": false }, @@ -28509,9 +28845,9 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 3875, - "total_submitted": 5517, - "total_column_articles": 90, + "total_acs": 3927, + "total_submitted": 5581, + "total_column_articles": 91, "frontend_question_id": "1255", "is_new_question": false }, @@ -28530,9 +28866,9 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 28976, - "total_submitted": 46694, - "total_column_articles": 476, + "total_acs": 29711, + "total_submitted": 47802, + "total_column_articles": 486, "frontend_question_id": "1254", "is_new_question": false }, @@ -28551,9 +28887,9 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 6105, - "total_submitted": 15287, - "total_column_articles": 94, + "total_acs": 6232, + "total_submitted": 15569, + "total_column_articles": 96, "frontend_question_id": "1253", "is_new_question": false }, @@ -28572,9 +28908,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": 20369, - "total_submitted": 27291, - "total_column_articles": 360, + "total_acs": 40879, + "total_submitted": 51690, + "total_column_articles": 572, "frontend_question_id": "1252", "is_new_question": false }, @@ -28593,9 +28929,9 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 9182, - "total_submitted": 15439, - "total_column_articles": 81, + "total_acs": 9335, + "total_submitted": 15707, + "total_column_articles": 82, "frontend_question_id": "1241", "is_new_question": false }, @@ -28614,9 +28950,9 @@ "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, + "total_acs": 3299, + "total_submitted": 6418, + "total_column_articles": 51, "frontend_question_id": "2312", "is_new_question": false }, @@ -28635,8 +28971,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 6317, - "total_submitted": 19367, + "total_acs": 6370, + "total_submitted": 19494, "total_column_articles": 146, "frontend_question_id": "2217", "is_new_question": false @@ -28656,9 +28992,9 @@ "question__title": "Leftmost Column with at Least a One", "question__title_slug": "leftmost-column-with-at-least-a-one", "question__hide": false, - "total_acs": 1780, - "total_submitted": 2940, - "total_column_articles": 33, + "total_acs": 1831, + "total_submitted": 3016, + "total_column_articles": 35, "frontend_question_id": "1428", "is_new_question": false }, @@ -28677,8 +29013,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": 3601, - "total_submitted": 6152, + "total_acs": 3654, + "total_submitted": 6239, "total_column_articles": 47, "frontend_question_id": "1250", "is_new_question": false @@ -28698,9 +29034,9 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 33816, - "total_submitted": 57553, - "total_column_articles": 447, + "total_acs": 34338, + "total_submitted": 58343, + "total_column_articles": 451, "frontend_question_id": "1249", "is_new_question": false }, @@ -28719,8 +29055,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 42922, - "total_submitted": 75115, + "total_acs": 43284, + "total_submitted": 75690, "total_column_articles": 554, "frontend_question_id": "1248", "is_new_question": false @@ -28740,8 +29076,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 11264, - "total_submitted": 18036, + "total_acs": 11356, + "total_submitted": 18179, "total_column_articles": 192, "frontend_question_id": "1247", "is_new_question": false @@ -28761,8 +29097,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 1709, - "total_submitted": 3549, + "total_acs": 1758, + "total_submitted": 3624, "total_column_articles": 24, "frontend_question_id": "1242", "is_new_question": false @@ -28782,8 +29118,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 2946, - "total_submitted": 5913, + "total_acs": 2968, + "total_submitted": 5942, "total_column_articles": 71, "frontend_question_id": "1691", "is_new_question": false @@ -28803,9 +29139,9 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 1906, - "total_submitted": 3727, - "total_column_articles": 57, + "total_acs": 1991, + "total_submitted": 3889, + "total_column_articles": 58, "frontend_question_id": "1429", "is_new_question": false }, @@ -28824,9 +29160,9 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 6755, - "total_submitted": 13450, - "total_column_articles": 127, + "total_acs": 6812, + "total_submitted": 13540, + "total_column_articles": 129, "frontend_question_id": "1726", "is_new_question": false }, @@ -28845,9 +29181,9 @@ "question__title": "Greatest English Letter in Upper and Lower Case", "question__title_slug": "greatest-english-letter-in-upper-and-lower-case", "question__hide": false, - "total_acs": 7653, - "total_submitted": 11239, - "total_column_articles": 88, + "total_acs": 8007, + "total_submitted": 11768, + "total_column_articles": 94, "frontend_question_id": "2309", "is_new_question": false }, @@ -28866,9 +29202,9 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 12045, - "total_submitted": 18046, - "total_column_articles": 175, + "total_acs": 12149, + "total_submitted": 18199, + "total_column_articles": 176, "frontend_question_id": "1227", "is_new_question": false }, @@ -28887,8 +29223,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": 3169, - "total_submitted": 6279, + "total_acs": 3208, + "total_submitted": 6348, "total_column_articles": 48, "frontend_question_id": "1240", "is_new_question": false @@ -28908,9 +29244,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": 37628, - "total_submitted": 76942, - "total_column_articles": 411, + "total_acs": 37764, + "total_submitted": 77222, + "total_column_articles": 412, "frontend_question_id": "1239", "is_new_question": false }, @@ -28929,9 +29265,9 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 3907, - "total_submitted": 5866, - "total_column_articles": 89, + "total_acs": 3970, + "total_submitted": 5948, + "total_column_articles": 91, "frontend_question_id": "1238", "is_new_question": false }, @@ -28950,9 +29286,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": 11432, - "total_submitted": 16018, - "total_column_articles": 165, + "total_acs": 11501, + "total_submitted": 16101, + "total_column_articles": 166, "frontend_question_id": "1237", "is_new_question": false }, @@ -28971,9 +29307,9 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 5090, - "total_submitted": 9352, - "total_column_articles": 111, + "total_acs": 5248, + "total_submitted": 9649, + "total_column_articles": 115, "frontend_question_id": "1225", "is_new_question": false }, @@ -28992,8 +29328,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": 2467, - "total_submitted": 5216, + "total_acs": 2498, + "total_submitted": 5279, "total_column_articles": 49, "frontend_question_id": "2193", "is_new_question": false @@ -29013,9 +29349,9 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 8154, - "total_submitted": 17276, - "total_column_articles": 151, + "total_acs": 8208, + "total_submitted": 17397, + "total_column_articles": 153, "frontend_question_id": "2216", "is_new_question": false }, @@ -29034,9 +29370,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": 8720, - "total_submitted": 13903, - "total_column_articles": 98, + "total_acs": 8817, + "total_submitted": 14067, + "total_column_articles": 99, "frontend_question_id": "2225", "is_new_question": false }, @@ -29055,9 +29391,9 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 9110, - "total_submitted": 15621, - "total_column_articles": 115, + "total_acs": 9234, + "total_submitted": 15827, + "total_column_articles": 117, "frontend_question_id": "2273", "is_new_question": false }, @@ -29076,9 +29412,9 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 9039, - "total_submitted": 18849, - "total_column_articles": 163, + "total_acs": 9455, + "total_submitted": 19634, + "total_column_articles": 166, "frontend_question_id": "1235", "is_new_question": false }, @@ -29097,9 +29433,9 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 7501, - "total_submitted": 21272, - "total_column_articles": 112, + "total_acs": 7568, + "total_submitted": 21480, + "total_column_articles": 114, "frontend_question_id": "1234", "is_new_question": false }, @@ -29118,9 +29454,9 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 10447, - "total_submitted": 20830, - "total_column_articles": 151, + "total_acs": 10546, + "total_submitted": 21007, + "total_column_articles": 154, "frontend_question_id": "1233", "is_new_question": false }, @@ -29139,9 +29475,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": 40272, - "total_submitted": 86960, - "total_column_articles": 502, + "total_acs": 40728, + "total_submitted": 87913, + "total_column_articles": 507, "frontend_question_id": "1232", "is_new_question": false }, @@ -29160,9 +29496,9 @@ "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, + "total_acs": 5270, + "total_submitted": 10650, + "total_column_articles": 95, "frontend_question_id": "2321", "is_new_question": false }, @@ -29181,9 +29517,9 @@ "question__title": "Distance to a Cycle in Undirected Graph", "question__title_slug": "distance-to-a-cycle-in-undirected-graph", "question__hide": false, - "total_acs": 119, - "total_submitted": 161, - "total_column_articles": 10, + "total_acs": 128, + "total_submitted": 175, + "total_column_articles": 12, "frontend_question_id": "2204", "is_new_question": false }, @@ -29202,9 +29538,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": 7751, - "total_submitted": 37622, - "total_column_articles": 133, + "total_acs": 7820, + "total_submitted": 37866, + "total_column_articles": 134, "frontend_question_id": "2202", "is_new_question": false }, @@ -29223,9 +29559,9 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 2048, - "total_submitted": 3264, - "total_column_articles": 79, + "total_acs": 2096, + "total_submitted": 3338, + "total_column_articles": 83, "frontend_question_id": "1427", "is_new_question": false }, @@ -29244,8 +29580,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 5436, - "total_submitted": 16329, + "total_acs": 5498, + "total_submitted": 16476, "total_column_articles": 78, "frontend_question_id": "1224", "is_new_question": false @@ -29265,9 +29601,9 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 3903, - "total_submitted": 8076, - "total_column_articles": 68, + "total_acs": 3932, + "total_submitted": 8143, + "total_column_articles": 70, "frontend_question_id": "1223", "is_new_question": false }, @@ -29286,9 +29622,9 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 7316, - "total_submitted": 10673, - "total_column_articles": 168, + "total_acs": 7390, + "total_submitted": 10764, + "total_column_articles": 169, "frontend_question_id": "1222", "is_new_question": false }, @@ -29307,9 +29643,9 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 84829, - "total_submitted": 100403, - "total_column_articles": 1224, + "total_acs": 85374, + "total_submitted": 101047, + "total_column_articles": 1238, "frontend_question_id": "1221", "is_new_question": false }, @@ -29328,9 +29664,9 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 15088, - "total_submitted": 25535, - "total_column_articles": 162, + "total_acs": 15254, + "total_submitted": 25828, + "total_column_articles": 164, "frontend_question_id": "1226", "is_new_question": false }, @@ -29349,9 +29685,9 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 7636, - "total_submitted": 14875, - "total_column_articles": 133, + "total_acs": 7799, + "total_submitted": 15163, + "total_column_articles": 137, "frontend_question_id": "1212", "is_new_question": false }, @@ -29370,9 +29706,9 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 11428, - "total_submitted": 17141, - "total_column_articles": 87, + "total_acs": 11747, + "total_submitted": 17623, + "total_column_articles": 92, "frontend_question_id": "1211", "is_new_question": false }, @@ -29391,9 +29727,9 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 11364, - "total_submitted": 18178, - "total_column_articles": 124, + "total_acs": 11716, + "total_submitted": 18679, + "total_column_articles": 125, "frontend_question_id": "1206", "is_new_question": false }, @@ -29412,8 +29748,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": 919, - "total_submitted": 3017, + "total_acs": 924, + "total_submitted": 3031, "total_column_articles": 29, "frontend_question_id": "1960", "is_new_question": false @@ -29433,9 +29769,9 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 8639, - "total_submitted": 26473, - "total_column_articles": 151, + "total_acs": 8761, + "total_submitted": 26839, + "total_column_articles": 152, "frontend_question_id": "2226", "is_new_question": false }, @@ -29454,9 +29790,9 @@ "question__title": "Sum of Numbers With Units Digit K", "question__title_slug": "sum-of-numbers-with-units-digit-k", "question__hide": false, - "total_acs": 6691, - "total_submitted": 26040, - "total_column_articles": 110, + "total_acs": 6929, + "total_submitted": 26700, + "total_column_articles": 113, "frontend_question_id": "2310", "is_new_question": false }, @@ -29475,8 +29811,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 5786, - "total_submitted": 13761, + "total_acs": 5859, + "total_submitted": 13889, "total_column_articles": 102, "frontend_question_id": "2191", "is_new_question": false @@ -29496,8 +29832,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 25327, - "total_submitted": 41767, + "total_acs": 25399, + "total_submitted": 41876, "total_column_articles": 345, "frontend_question_id": "1220", "is_new_question": false @@ -29517,9 +29853,9 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 36596, - "total_submitted": 52588, - "total_column_articles": 467, + "total_acs": 36840, + "total_submitted": 52964, + "total_column_articles": 472, "frontend_question_id": "1219", "is_new_question": false }, @@ -29538,9 +29874,9 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 40169, - "total_submitted": 77691, - "total_column_articles": 379, + "total_acs": 40418, + "total_submitted": 78182, + "total_column_articles": 383, "frontend_question_id": "1218", "is_new_question": false }, @@ -29559,9 +29895,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": 26837, - "total_submitted": 38314, - "total_column_articles": 433, + "total_acs": 51962, + "total_submitted": 69466, + "total_column_articles": 679, "frontend_question_id": "1217", "is_new_question": false }, @@ -29580,9 +29916,9 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 7397, - "total_submitted": 15971, - "total_column_articles": 98, + "total_acs": 7516, + "total_submitted": 16225, + "total_column_articles": 99, "frontend_question_id": "1205", "is_new_question": false }, @@ -29601,9 +29937,9 @@ "question__title": "Last Person to Fit in the Bus", "question__title_slug": "last-person-to-fit-in-the-bus", "question__hide": false, - "total_acs": 8048, - "total_submitted": 10936, - "total_column_articles": 104, + "total_acs": 8197, + "total_submitted": 11141, + "total_column_articles": 105, "frontend_question_id": "1204", "is_new_question": false }, @@ -29622,8 +29958,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 2819, - "total_submitted": 8699, + "total_acs": 2853, + "total_submitted": 8775, "total_column_articles": 52, "frontend_question_id": "1862", "is_new_question": false @@ -29643,9 +29979,9 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 13204, - "total_submitted": 35372, - "total_column_articles": 204, + "total_acs": 13387, + "total_submitted": 35848, + "total_column_articles": 205, "frontend_question_id": "1514", "is_new_question": false }, @@ -29664,9 +30000,9 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 32526, - "total_submitted": 46973, - "total_column_articles": 605, + "total_acs": 33290, + "total_submitted": 48042, + "total_column_articles": 613, "frontend_question_id": "1706", "is_new_question": false }, @@ -29685,9 +30021,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": 3069, - "total_submitted": 6702, - "total_column_articles": 63, + "total_acs": 3095, + "total_submitted": 6751, + "total_column_articles": 65, "frontend_question_id": "1210", "is_new_question": false }, @@ -29706,9 +30042,9 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 58387, - "total_submitted": 116892, - "total_column_articles": 701, + "total_acs": 58996, + "total_submitted": 118167, + "total_column_articles": 717, "frontend_question_id": "1208", "is_new_question": false }, @@ -29727,9 +30063,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": 15521, - "total_submitted": 30283, - "total_column_articles": 185, + "total_acs": 15714, + "total_submitted": 30682, + "total_column_articles": 186, "frontend_question_id": "1209", "is_new_question": false }, @@ -29748,9 +30084,9 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 66463, - "total_submitted": 91165, - "total_column_articles": 916, + "total_acs": 67069, + "total_submitted": 91976, + "total_column_articles": 933, "frontend_question_id": "1207", "is_new_question": false }, @@ -29769,8 +30105,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 5313, - "total_submitted": 10335, + "total_acs": 5436, + "total_submitted": 10599, "total_column_articles": 91, "frontend_question_id": "1194", "is_new_question": false @@ -29790,9 +30126,9 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 9423, - "total_submitted": 15506, - "total_column_articles": 104, + "total_acs": 9781, + "total_submitted": 16112, + "total_column_articles": 109, "frontend_question_id": "1193", "is_new_question": false }, @@ -29811,8 +30147,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 17557, - "total_submitted": 27240, + "total_acs": 17702, + "total_submitted": 27430, "total_column_articles": 323, "frontend_question_id": "1195", "is_new_question": false @@ -29832,9 +30168,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": 1481, - "total_submitted": 2628, - "total_column_articles": 20, + "total_acs": 1486, + "total_submitted": 2640, + "total_column_articles": 21, "frontend_question_id": "1916", "is_new_question": false }, @@ -29853,9 +30189,9 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 7631, - "total_submitted": 15756, - "total_column_articles": 115, + "total_acs": 7688, + "total_submitted": 15851, + "total_column_articles": 117, "frontend_question_id": "2201", "is_new_question": false }, @@ -29874,8 +30210,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 2540, - "total_submitted": 4671, + "total_acs": 2589, + "total_submitted": 4746, "total_column_articles": 48, "frontend_question_id": "1895", "is_new_question": false @@ -29895,8 +30231,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 6882, - "total_submitted": 8822, + "total_acs": 6955, + "total_submitted": 8907, "total_column_articles": 126, "frontend_question_id": "2079", "is_new_question": false @@ -29916,8 +30252,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 12942, - "total_submitted": 20982, + "total_acs": 12972, + "total_submitted": 21038, "total_column_articles": 159, "frontend_question_id": "1203", "is_new_question": false @@ -29937,9 +30273,9 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 29400, - "total_submitted": 57996, - "total_column_articles": 324, + "total_acs": 29518, + "total_submitted": 58219, + "total_column_articles": 326, "frontend_question_id": "1202", "is_new_question": false }, @@ -29958,9 +30294,9 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 8125, - "total_submitted": 30789, - "total_column_articles": 109, + "total_acs": 8273, + "total_submitted": 31360, + "total_column_articles": 111, "frontend_question_id": "1201", "is_new_question": false }, @@ -29979,9 +30315,9 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 22286, - "total_submitted": 32624, - "total_column_articles": 318, + "total_acs": 51755, + "total_submitted": 71169, + "total_column_articles": 563, "frontend_question_id": "1200", "is_new_question": false }, @@ -30000,8 +30336,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": 3800, - "total_submitted": 6147, + "total_acs": 3869, + "total_submitted": 6247, "total_column_articles": 89, "frontend_question_id": "1944", "is_new_question": false @@ -30021,8 +30357,8 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 27703, - "total_submitted": 43336, + "total_acs": 27835, + "total_submitted": 43559, "total_column_articles": 484, "frontend_question_id": "1405", "is_new_question": false @@ -30042,9 +30378,9 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 7460, - "total_submitted": 14693, - "total_column_articles": 139, + "total_acs": 7532, + "total_submitted": 14825, + "total_column_articles": 140, "frontend_question_id": "2139", "is_new_question": false }, @@ -30063,9 +30399,9 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 7404, - "total_submitted": 12245, - "total_column_articles": 88, + "total_acs": 7544, + "total_submitted": 12482, + "total_column_articles": 90, "frontend_question_id": "1957", "is_new_question": false }, @@ -30084,9 +30420,9 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 39461, - "total_submitted": 61476, - "total_column_articles": 235, + "total_acs": 39790, + "total_submitted": 61947, + "total_column_articles": 236, "frontend_question_id": "1179", "is_new_question": false }, @@ -30105,9 +30441,9 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 6300, - "total_submitted": 11985, - "total_column_articles": 76, + "total_acs": 6406, + "total_submitted": 12153, + "total_column_articles": 79, "frontend_question_id": "1192", "is_new_question": false }, @@ -30126,9 +30462,9 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 7040, - "total_submitted": 26266, - "total_column_articles": 112, + "total_acs": 7109, + "total_submitted": 26502, + "total_column_articles": 113, "frontend_question_id": "1191", "is_new_question": false }, @@ -30147,9 +30483,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": 51823, - "total_submitted": 79933, - "total_column_articles": 673, + "total_acs": 52229, + "total_submitted": 80532, + "total_column_articles": 687, "frontend_question_id": "1190", "is_new_question": false }, @@ -30168,9 +30504,9 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 53686, - "total_submitted": 78287, - "total_column_articles": 744, + "total_acs": 53862, + "total_submitted": 78569, + "total_column_articles": 754, "frontend_question_id": "1189", "is_new_question": false }, @@ -30189,9 +30525,9 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 4389, - "total_submitted": 13482, - "total_column_articles": 90, + "total_acs": 4429, + "total_submitted": 13586, + "total_column_articles": 91, "frontend_question_id": "1483", "is_new_question": false }, @@ -30210,8 +30546,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": 5147, - "total_submitted": 10523, + "total_acs": 5182, + "total_submitted": 10583, "total_column_articles": 79, "frontend_question_id": "1954", "is_new_question": false @@ -30231,9 +30567,9 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 6916, - "total_submitted": 23310, - "total_column_articles": 158, + "total_acs": 6994, + "total_submitted": 23497, + "total_column_articles": 160, "frontend_question_id": "2080", "is_new_question": false }, @@ -30252,9 +30588,9 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 24828, - "total_submitted": 37863, - "total_column_articles": 333, + "total_acs": 25077, + "total_submitted": 38263, + "total_column_articles": 335, "frontend_question_id": "1550", "is_new_question": false }, @@ -30273,9 +30609,9 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 7435, - "total_submitted": 11805, - "total_column_articles": 81, + "total_acs": 7577, + "total_submitted": 12039, + "total_column_articles": 83, "frontend_question_id": "1174", "is_new_question": false }, @@ -30294,9 +30630,9 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 13027, - "total_submitted": 17197, - "total_column_articles": 106, + "total_acs": 13391, + "total_submitted": 17709, + "total_column_articles": 112, "frontend_question_id": "1173", "is_new_question": false }, @@ -30315,9 +30651,9 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 2419, - "total_submitted": 5229, - "total_column_articles": 42, + "total_acs": 2458, + "total_submitted": 5315, + "total_column_articles": 44, "frontend_question_id": "1187", "is_new_question": false }, @@ -30336,9 +30672,9 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 36353, - "total_submitted": 58107, - "total_column_articles": 492, + "total_acs": 36501, + "total_submitted": 58385, + "total_column_articles": 493, "frontend_question_id": "1185", "is_new_question": false }, @@ -30357,9 +30693,9 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 9687, - "total_submitted": 23602, - "total_column_articles": 148, + "total_acs": 9861, + "total_submitted": 23982, + "total_column_articles": 153, "frontend_question_id": "1186", "is_new_question": false }, @@ -30378,9 +30714,9 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 16449, - "total_submitted": 28172, - "total_column_articles": 319, + "total_acs": 16588, + "total_submitted": 28403, + "total_column_articles": 321, "frontend_question_id": "1184", "is_new_question": false }, @@ -30399,9 +30735,9 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 4543, - "total_submitted": 9855, - "total_column_articles": 90, + "total_acs": 4605, + "total_submitted": 9997, + "total_column_articles": 91, "frontend_question_id": "1425", "is_new_question": false }, @@ -30420,9 +30756,9 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 15983, - "total_submitted": 22482, - "total_column_articles": 240, + "total_acs": 16366, + "total_submitted": 22962, + "total_column_articles": 242, "frontend_question_id": "1382", "is_new_question": false }, @@ -30441,9 +30777,9 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 7767, - "total_submitted": 20805, - "total_column_articles": 133, + "total_acs": 7832, + "total_submitted": 20946, + "total_column_articles": 134, "frontend_question_id": "1390", "is_new_question": false }, @@ -30462,9 +30798,9 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 12403, - "total_submitted": 20998, - "total_column_articles": 168, + "total_acs": 12512, + "total_submitted": 21217, + "total_column_articles": 170, "frontend_question_id": "1507", "is_new_question": false }, @@ -30483,9 +30819,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": 19390, - "total_submitted": 41737, - "total_column_articles": 192, + "total_acs": 19430, + "total_submitted": 41801, + "total_column_articles": 194, "frontend_question_id": "1178", "is_new_question": false }, @@ -30504,9 +30840,9 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 7121, - "total_submitted": 25547, - "total_column_articles": 114, + "total_acs": 7172, + "total_submitted": 25667, + "total_column_articles": 115, "frontend_question_id": "1177", "is_new_question": false }, @@ -30525,9 +30861,9 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 5282, - "total_submitted": 11141, - "total_column_articles": 83, + "total_acs": 5315, + "total_submitted": 11205, + "total_column_articles": 84, "frontend_question_id": "1176", "is_new_question": false }, @@ -30546,9 +30882,9 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 9653, - "total_submitted": 19513, - "total_column_articles": 157, + "total_acs": 29812, + "total_submitted": 52763, + "total_column_articles": 342, "frontend_question_id": "1175", "is_new_question": false }, @@ -30567,9 +30903,9 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 9332, - "total_submitted": 15402, - "total_column_articles": 121, + "total_acs": 9602, + "total_submitted": 15871, + "total_column_articles": 122, "frontend_question_id": "1164", "is_new_question": false }, @@ -30588,8 +30924,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 6397, - "total_submitted": 17458, + "total_acs": 6478, + "total_submitted": 17696, "total_column_articles": 116, "frontend_question_id": "1363", "is_new_question": false @@ -30609,9 +30945,9 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 6558, - "total_submitted": 12247, - "total_column_articles": 82, + "total_acs": 6602, + "total_submitted": 12322, + "total_column_articles": 83, "frontend_question_id": "1362", "is_new_question": false }, @@ -30630,8 +30966,8 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 9534, - "total_submitted": 23969, + "total_acs": 9632, + "total_submitted": 24215, "total_column_articles": 251, "frontend_question_id": "1361", "is_new_question": false @@ -30651,9 +30987,9 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 11326, - "total_submitted": 22541, - "total_column_articles": 185, + "total_acs": 11465, + "total_submitted": 22811, + "total_column_articles": 189, "frontend_question_id": "1360", "is_new_question": false }, @@ -30672,9 +31008,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": 15224, - "total_submitted": 24615, - "total_column_articles": 249, + "total_acs": 15277, + "total_submitted": 24685, + "total_column_articles": 250, "frontend_question_id": "1170", "is_new_question": false }, @@ -30693,9 +31029,9 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 7691, - "total_submitted": 23679, - "total_column_articles": 88, + "total_acs": 7730, + "total_submitted": 23793, + "total_column_articles": 90, "frontend_question_id": "1169", "is_new_question": false }, @@ -30714,8 +31050,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 1456, - "total_submitted": 2577, + "total_acs": 1464, + "total_submitted": 2590, "total_column_articles": 38, "frontend_question_id": "1236", "is_new_question": false @@ -30735,9 +31071,9 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 3045, - "total_submitted": 11353, - "total_column_articles": 72, + "total_acs": 3082, + "total_submitted": 11477, + "total_column_articles": 75, "frontend_question_id": "1172", "is_new_question": false }, @@ -30756,9 +31092,9 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 5755, - "total_submitted": 11406, - "total_column_articles": 106, + "total_acs": 5864, + "total_submitted": 11617, + "total_column_articles": 108, "frontend_question_id": "1159", "is_new_question": false }, @@ -30777,9 +31113,9 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 14938, - "total_submitted": 26674, - "total_column_articles": 137, + "total_acs": 16156, + "total_submitted": 28767, + "total_column_articles": 143, "frontend_question_id": "1158", "is_new_question": false }, @@ -30798,8 +31134,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": 16572, - "total_submitted": 34359, + "total_acs": 16772, + "total_submitted": 34738, "total_column_articles": 191, "frontend_question_id": "1171", "is_new_question": false @@ -30819,9 +31155,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": 10065, - "total_submitted": 14099, - "total_column_articles": 171, + "total_acs": 10185, + "total_submitted": 14274, + "total_column_articles": 173, "frontend_question_id": "1935", "is_new_question": false }, @@ -30840,8 +31176,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": 15040, - "total_submitted": 30514, + "total_acs": 15310, + "total_submitted": 30964, "total_column_articles": 174, "frontend_question_id": "1155", "is_new_question": false @@ -30861,9 +31197,9 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 3745, - "total_submitted": 10986, - "total_column_articles": 62, + "total_acs": 3767, + "total_submitted": 11084, + "total_column_articles": 63, "frontend_question_id": "1157", "is_new_question": false }, @@ -30882,9 +31218,9 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 6860, - "total_submitted": 15957, - "total_column_articles": 146, + "total_acs": 6931, + "total_submitted": 16152, + "total_column_articles": 148, "frontend_question_id": "1156", "is_new_question": false }, @@ -30903,9 +31239,9 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 48747, - "total_submitted": 76259, - "total_column_articles": 559, + "total_acs": 49057, + "total_submitted": 76818, + "total_column_articles": 563, "frontend_question_id": "1154", "is_new_question": false }, @@ -30924,9 +31260,9 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 8269, - "total_submitted": 18629, - "total_column_articles": 62, + "total_acs": 8406, + "total_submitted": 18951, + "total_column_articles": 64, "frontend_question_id": "1149", "is_new_question": false }, @@ -30945,9 +31281,9 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 20747, - "total_submitted": 29068, - "total_column_articles": 89, + "total_acs": 22387, + "total_submitted": 31321, + "total_column_articles": 91, "frontend_question_id": "1148", "is_new_question": false }, @@ -30966,9 +31302,9 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 1827, - "total_submitted": 5504, - "total_column_articles": 38, + "total_acs": 1833, + "total_submitted": 5518, + "total_column_articles": 39, "frontend_question_id": "1632", "is_new_question": false }, @@ -30987,9 +31323,9 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 15514, - "total_submitted": 29307, - "total_column_articles": 272, + "total_acs": 15661, + "total_submitted": 29558, + "total_column_articles": 274, "frontend_question_id": "1331", "is_new_question": false }, @@ -31008,8 +31344,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 1510, - "total_submitted": 3762, + "total_acs": 1529, + "total_submitted": 3793, "total_column_articles": 35, "frontend_question_id": "1330", "is_new_question": false @@ -31029,9 +31365,9 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 25130, - "total_submitted": 30382, - "total_column_articles": 357, + "total_acs": 25372, + "total_submitted": 30685, + "total_column_articles": 362, "frontend_question_id": "1302", "is_new_question": false }, @@ -31050,8 +31386,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 8547, - "total_submitted": 11085, + "total_acs": 8593, + "total_submitted": 11140, "total_column_articles": 200, "frontend_question_id": "1329", "is_new_question": false @@ -31071,9 +31407,9 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 6989, - "total_submitted": 14915, - "total_column_articles": 140, + "total_acs": 7036, + "total_submitted": 15032, + "total_column_articles": 141, "frontend_question_id": "1328", "is_new_question": false }, @@ -31092,9 +31428,9 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 5494, - "total_submitted": 9697, - "total_column_articles": 104, + "total_acs": 5558, + "total_submitted": 9815, + "total_column_articles": 107, "frontend_question_id": "1147", "is_new_question": false }, @@ -31113,9 +31449,9 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 249477, - "total_submitted": 386793, - "total_column_articles": 1522, + "total_acs": 253433, + "total_submitted": 392579, + "total_column_articles": 1535, "frontend_question_id": "1143", "is_new_question": false }, @@ -31134,9 +31470,9 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 6331, - "total_submitted": 20278, - "total_column_articles": 85, + "total_acs": 6552, + "total_submitted": 20809, + "total_column_articles": 87, "frontend_question_id": "1146", "is_new_question": false }, @@ -31155,8 +31491,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 7816, - "total_submitted": 16443, + "total_acs": 7886, + "total_submitted": 16571, "total_column_articles": 128, "frontend_question_id": "1145", "is_new_question": false @@ -31176,9 +31512,9 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 11510, - "total_submitted": 25846, - "total_column_articles": 159, + "total_acs": 11581, + "total_submitted": 25979, + "total_column_articles": 160, "frontend_question_id": "1144", "is_new_question": false }, @@ -31197,9 +31533,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": 9979, - "total_submitted": 26833, - "total_column_articles": 62, + "total_acs": 10156, + "total_submitted": 27316, + "total_column_articles": 63, "frontend_question_id": "1142", "is_new_question": false }, @@ -31218,9 +31554,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": 23043, - "total_submitted": 49171, - "total_column_articles": 150, + "total_acs": 24582, + "total_submitted": 52711, + "total_column_articles": 159, "frontend_question_id": "1141", "is_new_question": false }, @@ -31239,9 +31575,9 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 3624, - "total_submitted": 7909, - "total_column_articles": 74, + "total_acs": 3669, + "total_submitted": 7975, + "total_column_articles": 75, "frontend_question_id": "1316", "is_new_question": false }, @@ -31260,9 +31596,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": 15305, - "total_submitted": 18796, - "total_column_articles": 328, + "total_acs": 15428, + "total_submitted": 18941, + "total_column_articles": 330, "frontend_question_id": "1315", "is_new_question": false }, @@ -31281,9 +31617,9 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 18820, - "total_submitted": 24901, - "total_column_articles": 294, + "total_acs": 19016, + "total_submitted": 25170, + "total_column_articles": 295, "frontend_question_id": "1314", "is_new_question": false }, @@ -31302,9 +31638,9 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 38736, - "total_submitted": 46571, - "total_column_articles": 595, + "total_acs": 38925, + "total_submitted": 46782, + "total_column_articles": 597, "frontend_question_id": "1313", "is_new_question": false }, @@ -31323,9 +31659,9 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 8616, - "total_submitted": 13029, - "total_column_articles": 113, + "total_acs": 8692, + "total_submitted": 13141, + "total_column_articles": 114, "frontend_question_id": "1140", "is_new_question": false }, @@ -31344,9 +31680,9 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 11319, - "total_submitted": 23166, - "total_column_articles": 176, + "total_acs": 11413, + "total_submitted": 23367, + "total_column_articles": 178, "frontend_question_id": "1139", "is_new_question": false }, @@ -31365,8 +31701,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 7249, - "total_submitted": 16381, + "total_acs": 7290, + "total_submitted": 16467, "total_column_articles": 164, "frontend_question_id": "1138", "is_new_question": false @@ -31386,8 +31722,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 7107, - "total_submitted": 18300, + "total_acs": 7241, + "total_submitted": 18596, "total_column_articles": 67, "frontend_question_id": "1132", "is_new_question": false @@ -31407,9 +31743,9 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 127634, - "total_submitted": 209718, - "total_column_articles": 1216, + "total_acs": 128605, + "total_submitted": 211330, + "total_column_articles": 1235, "frontend_question_id": "1137", "is_new_question": false }, @@ -31428,9 +31764,9 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 5007, - "total_submitted": 13422, - "total_column_articles": 108, + "total_acs": 5076, + "total_submitted": 13572, + "total_column_articles": 109, "frontend_question_id": "1301", "is_new_question": false }, @@ -31449,8 +31785,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 1193, - "total_submitted": 1915, + "total_acs": 1200, + "total_submitted": 1927, "total_column_articles": 29, "frontend_question_id": "1274", "is_new_question": false @@ -31470,9 +31806,9 @@ "question__title": "Sum of Mutated Array Closest to Target", "question__title_slug": "sum-of-mutated-array-closest-to-target", "question__hide": false, - "total_acs": 27313, - "total_submitted": 58744, - "total_column_articles": 408, + "total_acs": 27514, + "total_submitted": 59254, + "total_column_articles": 411, "frontend_question_id": "1300", "is_new_question": false }, @@ -31491,9 +31827,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": 35105, - "total_submitted": 44541, - "total_column_articles": 499, + "total_acs": 35480, + "total_submitted": 44984, + "total_column_articles": 501, "frontend_question_id": "1299", "is_new_question": false }, @@ -31512,8 +31848,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 3736, - "total_submitted": 8030, + "total_acs": 3771, + "total_submitted": 8098, "total_column_articles": 56, "frontend_question_id": "1131", "is_new_question": false @@ -31533,9 +31869,9 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 8611, - "total_submitted": 21647, - "total_column_articles": 184, + "total_acs": 8746, + "total_submitted": 21950, + "total_column_articles": 185, "frontend_question_id": "1129", "is_new_question": false }, @@ -31554,8 +31890,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 7492, - "total_submitted": 11703, + "total_acs": 7549, + "total_submitted": 11778, "total_column_articles": 131, "frontend_question_id": "1130", "is_new_question": false @@ -31575,9 +31911,9 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 40018, - "total_submitted": 73715, - "total_column_articles": 503, + "total_acs": 40177, + "total_submitted": 74051, + "total_column_articles": 504, "frontend_question_id": "1128", "is_new_question": false }, @@ -31596,9 +31932,9 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 6123, - "total_submitted": 14269, - "total_column_articles": 94, + "total_acs": 6227, + "total_submitted": 14492, + "total_column_articles": 95, "frontend_question_id": "1127", "is_new_question": false }, @@ -31617,9 +31953,9 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 9569, - "total_submitted": 13927, - "total_column_articles": 118, + "total_acs": 9842, + "total_submitted": 14344, + "total_column_articles": 122, "frontend_question_id": "1126", "is_new_question": false }, @@ -31638,9 +31974,9 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 10566, - "total_submitted": 17493, - "total_column_articles": 141, + "total_acs": 10804, + "total_submitted": 17884, + "total_column_articles": 145, "frontend_question_id": "1289", "is_new_question": false }, @@ -31659,9 +31995,9 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 3106, - "total_submitted": 7789, - "total_column_articles": 49, + "total_acs": 3140, + "total_submitted": 7871, + "total_column_articles": 52, "frontend_question_id": "1627", "is_new_question": false }, @@ -31680,9 +32016,9 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 20429, - "total_submitted": 36359, - "total_column_articles": 232, + "total_acs": 20751, + "total_submitted": 37001, + "total_column_articles": 234, "frontend_question_id": "1288", "is_new_question": false }, @@ -31701,9 +32037,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": 19508, - "total_submitted": 32631, - "total_column_articles": 273, + "total_acs": 19689, + "total_submitted": 32985, + "total_column_articles": 277, "frontend_question_id": "1287", "is_new_question": false }, @@ -31722,8 +32058,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 3894, - "total_submitted": 7828, + "total_acs": 3932, + "total_submitted": 7907, "total_column_articles": 62, "frontend_question_id": "1125", "is_new_question": false @@ -31743,9 +32079,9 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 16538, - "total_submitted": 49326, - "total_column_articles": 175, + "total_acs": 16682, + "total_submitted": 49670, + "total_column_articles": 176, "frontend_question_id": "1124", "is_new_question": false }, @@ -31764,9 +32100,9 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 10462, - "total_submitted": 14680, - "total_column_articles": 139, + "total_acs": 10580, + "total_submitted": 14851, + "total_column_articles": 140, "frontend_question_id": "1123", "is_new_question": false }, @@ -31785,9 +32121,9 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 75401, - "total_submitted": 106342, - "total_column_articles": 997, + "total_acs": 76008, + "total_submitted": 107201, + "total_column_articles": 1015, "frontend_question_id": "1122", "is_new_question": false }, @@ -31806,9 +32142,9 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 28176, - "total_submitted": 53092, - "total_column_articles": 422, + "total_acs": 28436, + "total_submitted": 53528, + "total_column_articles": 424, "frontend_question_id": "1116", "is_new_question": false }, @@ -31827,9 +32163,9 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 10212, - "total_submitted": 19130, - "total_column_articles": 66, + "total_acs": 10353, + "total_submitted": 19378, + "total_column_articles": 67, "frontend_question_id": "1113", "is_new_question": false }, @@ -31848,9 +32184,9 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 11996, - "total_submitted": 18277, - "total_column_articles": 120, + "total_acs": 12367, + "total_submitted": 18852, + "total_column_articles": 122, "frontend_question_id": "1112", "is_new_question": false }, @@ -31869,8 +32205,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 2700, - "total_submitted": 5214, + "total_acs": 2721, + "total_submitted": 5249, "total_column_articles": 55, "frontend_question_id": "1259", "is_new_question": false @@ -31890,8 +32226,8 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 8877, - "total_submitted": 16832, + "total_acs": 8946, + "total_submitted": 16954, "total_column_articles": 199, "frontend_question_id": "1291", "is_new_question": false @@ -31911,9 +32247,9 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 5870, - "total_submitted": 9013, - "total_column_articles": 118, + "total_acs": 5919, + "total_submitted": 9083, + "total_column_articles": 122, "frontend_question_id": "1286", "is_new_question": false }, @@ -31932,8 +32268,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": 10079, - "total_submitted": 15149, + "total_acs": 10160, + "total_submitted": 15278, "total_column_articles": 164, "frontend_question_id": "1619", "is_new_question": false @@ -31953,9 +32289,9 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 4355, - "total_submitted": 6184, - "total_column_articles": 80, + "total_acs": 4402, + "total_submitted": 6240, + "total_column_articles": 81, "frontend_question_id": "1188", "is_new_question": false }, @@ -31974,8 +32310,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": 25716, - "total_submitted": 33416, + "total_acs": 25808, + "total_submitted": 33531, "total_column_articles": 422, "frontend_question_id": "1111", "is_new_question": false @@ -31995,9 +32331,9 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 15966, - "total_submitted": 24815, - "total_column_articles": 273, + "total_acs": 16201, + "total_submitted": 25158, + "total_column_articles": 277, "frontend_question_id": "1110", "is_new_question": false }, @@ -32016,9 +32352,9 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 85139, - "total_submitted": 138692, - "total_column_articles": 1235, + "total_acs": 86347, + "total_submitted": 140459, + "total_column_articles": 1254, "frontend_question_id": "1109", "is_new_question": false }, @@ -32037,9 +32373,9 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 102725, - "total_submitted": 119678, - "total_column_articles": 934, + "total_acs": 103231, + "total_submitted": 120343, + "total_column_articles": 945, "frontend_question_id": "1108", "is_new_question": false }, @@ -32058,8 +32394,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 10326, - "total_submitted": 25033, + "total_acs": 10474, + "total_submitted": 25400, "total_column_articles": 124, "frontend_question_id": "1107", "is_new_question": false @@ -32079,9 +32415,9 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 94259, - "total_submitted": 144486, - "total_column_articles": 676, + "total_acs": 95031, + "total_submitted": 145640, + "total_column_articles": 678, "frontend_question_id": "1114", "is_new_question": false }, @@ -32100,8 +32436,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 3490, - "total_submitted": 7066, + "total_acs": 3510, + "total_submitted": 7091, "total_column_articles": 48, "frontend_question_id": "1246", "is_new_question": false @@ -32121,8 +32457,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 2035, - "total_submitted": 3686, + "total_acs": 2057, + "total_submitted": 3717, "total_column_articles": 61, "frontend_question_id": "1273", "is_new_question": false @@ -32142,8 +32478,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 2139, - "total_submitted": 3901, + "total_acs": 2173, + "total_submitted": 3955, "total_column_articles": 41, "frontend_question_id": "1272", "is_new_question": false @@ -32163,8 +32499,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 2818, - "total_submitted": 5495, + "total_acs": 2825, + "total_submitted": 5509, "total_column_articles": 54, "frontend_question_id": "1271", "is_new_question": false @@ -32184,9 +32520,9 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 10965, - "total_submitted": 23046, - "total_column_articles": 122, + "total_acs": 11162, + "total_submitted": 23458, + "total_column_articles": 123, "frontend_question_id": "1098", "is_new_question": false }, @@ -32205,9 +32541,9 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 5124, - "total_submitted": 8702, - "total_column_articles": 156, + "total_acs": 5159, + "total_submitted": 8761, + "total_column_articles": 158, "frontend_question_id": "1106", "is_new_question": false }, @@ -32226,9 +32562,9 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 6333, - "total_submitted": 11082, - "total_column_articles": 80, + "total_acs": 6404, + "total_submitted": 11190, + "total_column_articles": 81, "frontend_question_id": "1105", "is_new_question": false }, @@ -32247,9 +32583,9 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 39532, - "total_submitted": 61992, - "total_column_articles": 1157, + "total_acs": 39728, + "total_submitted": 62278, + "total_column_articles": 1168, "frontend_question_id": "1103", "is_new_question": false }, @@ -32268,9 +32604,9 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 30686, - "total_submitted": 40384, - "total_column_articles": 723, + "total_acs": 30772, + "total_submitted": 40496, + "total_column_articles": 734, "frontend_question_id": "1104", "is_new_question": false }, @@ -32289,8 +32625,8 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 9318, - "total_submitted": 17787, + "total_acs": 9445, + "total_submitted": 18003, "total_column_articles": 151, "frontend_question_id": "1097", "is_new_question": false @@ -32310,8 +32646,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 5589, - "total_submitted": 9693, + "total_acs": 5693, + "total_submitted": 9872, "total_column_articles": 85, "frontend_question_id": "1231", "is_new_question": false @@ -32331,9 +32667,9 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 1683, - "total_submitted": 2956, - "total_column_articles": 66, + "total_acs": 1709, + "total_submitted": 2988, + "total_column_articles": 67, "frontend_question_id": "1258", "is_new_question": false }, @@ -32352,8 +32688,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 2240, - "total_submitted": 3906, + "total_acs": 2252, + "total_submitted": 3921, "total_column_articles": 54, "frontend_question_id": "1257", "is_new_question": false @@ -32373,9 +32709,9 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 1802, - "total_submitted": 2668, - "total_column_articles": 44, + "total_acs": 1812, + "total_submitted": 2681, + "total_column_articles": 45, "frontend_question_id": "1256", "is_new_question": false }, @@ -32394,9 +32730,9 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 2184, - "total_submitted": 3888, - "total_column_articles": 59, + "total_acs": 2205, + "total_submitted": 3915, + "total_column_articles": 60, "frontend_question_id": "1096", "is_new_question": false }, @@ -32415,9 +32751,9 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 53705, - "total_submitted": 95285, - "total_column_articles": 560, + "total_acs": 54187, + "total_submitted": 96098, + "total_column_articles": 561, "frontend_question_id": "1115", "is_new_question": false }, @@ -32436,9 +32772,9 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 21495, - "total_submitted": 40491, - "total_column_articles": 300, + "total_acs": 21715, + "total_submitted": 40857, + "total_column_articles": 302, "frontend_question_id": "1117", "is_new_question": false }, @@ -32457,9 +32793,9 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 23665, - "total_submitted": 63088, - "total_column_articles": 436, + "total_acs": 23827, + "total_submitted": 63537, + "total_column_articles": 439, "frontend_question_id": "1095", "is_new_question": false }, @@ -32478,9 +32814,9 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 49776, - "total_submitted": 91559, - "total_column_articles": 871, + "total_acs": 50906, + "total_submitted": 93943, + "total_column_articles": 894, "frontend_question_id": "1094", "is_new_question": false }, @@ -32499,8 +32835,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 4528, - "total_submitted": 12322, + "total_acs": 4560, + "total_submitted": 12450, "total_column_articles": 76, "frontend_question_id": "1093", "is_new_question": false @@ -32520,9 +32856,9 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 19630, - "total_submitted": 44654, - "total_column_articles": 254, + "total_acs": 20064, + "total_submitted": 45540, + "total_column_articles": 258, "frontend_question_id": "550", "is_new_question": false }, @@ -32541,9 +32877,9 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 22184, - "total_submitted": 32521, - "total_column_articles": 176, + "total_acs": 22565, + "total_submitted": 33100, + "total_column_articles": 178, "frontend_question_id": "534", "is_new_question": false }, @@ -32562,9 +32898,9 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 27687, - "total_submitted": 51336, - "total_column_articles": 199, + "total_acs": 28118, + "total_submitted": 52112, + "total_column_articles": 201, "frontend_question_id": "512", "is_new_question": false }, @@ -32583,9 +32919,9 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 42697, - "total_submitted": 59049, - "total_column_articles": 205, + "total_acs": 44986, + "total_submitted": 62214, + "total_column_articles": 214, "frontend_question_id": "511", "is_new_question": false }, @@ -32604,8 +32940,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 2239, - "total_submitted": 3953, + "total_acs": 2261, + "total_submitted": 3985, "total_column_articles": 48, "frontend_question_id": "1216", "is_new_question": false @@ -32625,8 +32961,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 4696, - "total_submitted": 9046, + "total_acs": 4741, + "total_submitted": 9151, "total_column_articles": 89, "frontend_question_id": "1245", "is_new_question": false @@ -32646,8 +32982,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 3311, - "total_submitted": 5280, + "total_acs": 3348, + "total_submitted": 5343, "total_column_articles": 53, "frontend_question_id": "1244", "is_new_question": false @@ -32667,8 +33003,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 3077, - "total_submitted": 5759, + "total_acs": 3090, + "total_submitted": 5786, "total_column_articles": 70, "frontend_question_id": "1243", "is_new_question": false @@ -32688,9 +33024,9 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 22758, - "total_submitted": 40881, - "total_column_articles": 184, + "total_acs": 24110, + "total_submitted": 43423, + "total_column_articles": 189, "frontend_question_id": "1084", "is_new_question": false }, @@ -32709,9 +33045,9 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 15190, - "total_submitted": 28835, - "total_column_articles": 137, + "total_acs": 15424, + "total_submitted": 29244, + "total_column_articles": 138, "frontend_question_id": "1083", "is_new_question": false }, @@ -32730,9 +33066,9 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 16409, - "total_submitted": 21539, - "total_column_articles": 123, + "total_acs": 16618, + "total_submitted": 21789, + "total_column_articles": 124, "frontend_question_id": "1082", "is_new_question": false }, @@ -32751,9 +33087,9 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 47289, - "total_submitted": 122510, - "total_column_articles": 475, + "total_acs": 48086, + "total_submitted": 124470, + "total_column_articles": 482, "frontend_question_id": "1091", "is_new_question": false }, @@ -32772,8 +33108,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 3689, - "total_submitted": 7116, + "total_acs": 3755, + "total_submitted": 7225, "total_column_articles": 70, "frontend_question_id": "1092", "is_new_question": false @@ -32793,9 +33129,9 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 4930, - "total_submitted": 8826, - "total_column_articles": 106, + "total_acs": 5001, + "total_submitted": 8919, + "total_column_articles": 107, "frontend_question_id": "1090", "is_new_question": false }, @@ -32814,9 +33150,9 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 51749, - "total_submitted": 85174, - "total_column_articles": 691, + "total_acs": 52076, + "total_submitted": 85775, + "total_column_articles": 700, "frontend_question_id": "1089", "is_new_question": false }, @@ -32835,9 +33171,9 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 901, - "total_submitted": 1954, - "total_column_articles": 23, + "total_acs": 918, + "total_submitted": 1983, + "total_column_articles": 25, "frontend_question_id": "1199", "is_new_question": false }, @@ -32856,8 +33192,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 4885, - "total_submitted": 9243, + "total_acs": 4949, + "total_submitted": 9354, "total_column_articles": 93, "frontend_question_id": "1230", "is_new_question": false @@ -32877,9 +33213,9 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 4605, - "total_submitted": 10204, - "total_column_articles": 96, + "total_acs": 4751, + "total_submitted": 10478, + "total_column_articles": 101, "frontend_question_id": "1229", "is_new_question": false }, @@ -32898,8 +33234,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 3658, - "total_submitted": 6834, + "total_acs": 3668, + "total_submitted": 6851, "total_column_articles": 70, "frontend_question_id": "1228", "is_new_question": false @@ -32919,9 +33255,9 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 11671, - "total_submitted": 16159, - "total_column_articles": 118, + "total_acs": 11977, + "total_submitted": 16611, + "total_column_articles": 119, "frontend_question_id": "1077", "is_new_question": false }, @@ -32940,9 +33276,9 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 14908, - "total_submitted": 30323, - "total_column_articles": 116, + "total_acs": 15140, + "total_submitted": 30824, + "total_column_articles": 117, "frontend_question_id": "1076", "is_new_question": false }, @@ -32961,9 +33297,9 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 13865, - "total_submitted": 19920, - "total_column_articles": 95, + "total_acs": 14064, + "total_submitted": 20186, + "total_column_articles": 96, "frontend_question_id": "1075", "is_new_question": false }, @@ -32982,9 +33318,9 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 14371, - "total_submitted": 19560, - "total_column_articles": 232, + "total_acs": 14529, + "total_submitted": 19752, + "total_column_articles": 234, "frontend_question_id": "1079", "is_new_question": false }, @@ -33003,8 +33339,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 20575, - "total_submitted": 35382, + "total_acs": 20874, + "total_submitted": 35877, "total_column_articles": 210, "frontend_question_id": "1081", "is_new_question": false @@ -33024,8 +33360,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": 5946, - "total_submitted": 11688, + "total_acs": 6050, + "total_submitted": 11873, "total_column_articles": 120, "frontend_question_id": "1080", "is_new_question": false @@ -33045,9 +33381,9 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 34092, - "total_submitted": 52020, - "total_column_articles": 468, + "total_acs": 34217, + "total_submitted": 52254, + "total_column_articles": 469, "frontend_question_id": "1078", "is_new_question": false }, @@ -33066,9 +33402,9 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 11412, - "total_submitted": 23957, - "total_column_articles": 87, + "total_acs": 11585, + "total_submitted": 24302, + "total_column_articles": 88, "frontend_question_id": "1070", "is_new_question": false }, @@ -33087,9 +33423,9 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 15376, - "total_submitted": 18874, - "total_column_articles": 74, + "total_acs": 15567, + "total_submitted": 19113, + "total_column_articles": 75, "frontend_question_id": "1069", "is_new_question": false }, @@ -33108,9 +33444,9 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 17788, - "total_submitted": 20563, - "total_column_articles": 84, + "total_acs": 18009, + "total_submitted": 20840, + "total_column_articles": 85, "frontend_question_id": "1068", "is_new_question": false }, @@ -33129,8 +33465,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 771, - "total_submitted": 1286, + "total_acs": 779, + "total_submitted": 1297, "total_column_articles": 19, "frontend_question_id": "1183", "is_new_question": false @@ -33150,8 +33486,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 2278, - "total_submitted": 5372, + "total_acs": 2292, + "total_submitted": 5389, "total_column_articles": 48, "frontend_question_id": "1215", "is_new_question": false @@ -33171,8 +33507,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 4380, - "total_submitted": 6717, + "total_acs": 4412, + "total_submitted": 6767, "total_column_articles": 88, "frontend_question_id": "1214", "is_new_question": false @@ -33192,9 +33528,9 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 7500, - "total_submitted": 9604, - "total_column_articles": 162, + "total_acs": 7578, + "total_submitted": 9697, + "total_column_articles": 164, "frontend_question_id": "1213", "is_new_question": false }, @@ -33213,9 +33549,9 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 3036, - "total_submitted": 8720, - "total_column_articles": 61, + "total_acs": 3088, + "total_submitted": 8825, + "total_column_articles": 62, "frontend_question_id": "1073", "is_new_question": false }, @@ -33234,9 +33570,9 @@ "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": 4323, - "total_submitted": 7114, - "total_column_articles": 68, + "total_acs": 4355, + "total_submitted": 7163, + "total_column_articles": 69, "frontend_question_id": "1072", "is_new_question": false }, @@ -33255,9 +33591,9 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 38301, - "total_submitted": 65319, - "total_column_articles": 706, + "total_acs": 38455, + "total_submitted": 65596, + "total_column_articles": 715, "frontend_question_id": "1071", "is_new_question": false }, @@ -33276,8 +33612,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": 20274, - "total_submitted": 30211, + "total_acs": 20346, + "total_submitted": 30314, "total_column_articles": 211, "frontend_question_id": "1074", "is_new_question": false @@ -33297,9 +33633,9 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 2195, - "total_submitted": 3655, - "total_column_articles": 42, + "total_acs": 2223, + "total_submitted": 3691, + "total_column_articles": 43, "frontend_question_id": "1168", "is_new_question": false }, @@ -33318,8 +33654,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": 4742, - "total_submitted": 6419, + "total_acs": 4776, + "total_submitted": 6468, "total_column_articles": 77, "frontend_question_id": "1198", "is_new_question": false @@ -33339,9 +33675,9 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 6119, - "total_submitted": 15937, - "total_column_articles": 74, + "total_acs": 6174, + "total_submitted": 16064, + "total_column_articles": 75, "frontend_question_id": "1197", "is_new_question": false }, @@ -33360,8 +33696,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": 4326, - "total_submitted": 6367, + "total_acs": 4349, + "total_submitted": 6396, "total_column_articles": 73, "frontend_question_id": "1196", "is_new_question": false @@ -33381,9 +33717,9 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 9874, - "total_submitted": 25171, - "total_column_articles": 136, + "total_acs": 9978, + "total_submitted": 25405, + "total_column_articles": 140, "frontend_question_id": "1054", "is_new_question": false }, @@ -33402,8 +33738,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 6965, - "total_submitted": 15048, + "total_acs": 7009, + "total_submitted": 15127, "total_column_articles": 108, "frontend_question_id": "1053", "is_new_question": false @@ -33423,9 +33759,9 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 56309, - "total_submitted": 97018, - "total_column_articles": 850, + "total_acs": 56769, + "total_submitted": 97861, + "total_column_articles": 861, "frontend_question_id": "1052", "is_new_question": false }, @@ -33444,8 +33780,8 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 62532, - "total_submitted": 78112, + "total_acs": 62775, + "total_submitted": 78427, "total_column_articles": 634, "frontend_question_id": "1051", "is_new_question": false @@ -33465,9 +33801,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": 24617, - "total_submitted": 31834, - "total_column_articles": 111, + "total_acs": 25979, + "total_submitted": 33539, + "total_column_articles": 117, "frontend_question_id": "1050", "is_new_question": false }, @@ -33486,9 +33822,9 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 12970, - "total_submitted": 20413, - "total_column_articles": 151, + "total_acs": 13255, + "total_submitted": 20828, + "total_column_articles": 153, "frontend_question_id": "1045", "is_new_question": false }, @@ -33507,8 +33843,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 4221, - "total_submitted": 9275, + "total_acs": 4305, + "total_submitted": 9448, "total_column_articles": 82, "frontend_question_id": "1182", "is_new_question": false @@ -33528,8 +33864,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 6828, - "total_submitted": 25406, + "total_acs": 6898, + "total_submitted": 25557, "total_column_articles": 116, "frontend_question_id": "1163", "is_new_question": false @@ -33549,8 +33885,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 1694, - "total_submitted": 4437, + "total_acs": 1699, + "total_submitted": 4442, "total_column_articles": 33, "frontend_question_id": "1181", "is_new_question": false @@ -33570,9 +33906,9 @@ "question__title": "Count Substrings with Only One Distinct Letter", "question__title_slug": "count-substrings-with-only-one-distinct-letter", "question__hide": false, - "total_acs": 3746, - "total_submitted": 4823, - "total_column_articles": 87, + "total_acs": 3760, + "total_submitted": 4838, + "total_column_articles": 88, "frontend_question_id": "1180", "is_new_question": false }, @@ -33591,9 +33927,9 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 75600, - "total_submitted": 111831, - "total_column_articles": 591, + "total_acs": 77765, + "total_submitted": 114836, + "total_column_articles": 601, "frontend_question_id": "1049", "is_new_question": false }, @@ -33612,9 +33948,9 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 14369, - "total_submitted": 29963, - "total_column_articles": 214, + "total_acs": 14572, + "total_submitted": 30382, + "total_column_articles": 216, "frontend_question_id": "1048", "is_new_question": false }, @@ -33633,9 +33969,9 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 161169, - "total_submitted": 221814, - "total_column_articles": 1264, + "total_acs": 164277, + "total_submitted": 226071, + "total_column_articles": 1287, "frontend_question_id": "1047", "is_new_question": false }, @@ -33654,9 +33990,9 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 76565, - "total_submitted": 116500, - "total_column_articles": 1049, + "total_acs": 77475, + "total_submitted": 117805, + "total_column_articles": 1067, "frontend_question_id": "1046", "is_new_question": false }, @@ -33675,8 +34011,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 3158, - "total_submitted": 6589, + "total_acs": 3202, + "total_submitted": 6644, "total_column_articles": 45, "frontend_question_id": "1167", "is_new_question": false @@ -33696,9 +34032,9 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 3965, - "total_submitted": 8086, - "total_column_articles": 67, + "total_acs": 4036, + "total_submitted": 8265, + "total_column_articles": 69, "frontend_question_id": "1166", "is_new_question": false }, @@ -33717,8 +34053,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 1961, - "total_submitted": 5245, + "total_acs": 1982, + "total_submitted": 5307, "total_column_articles": 26, "frontend_question_id": "1153", "is_new_question": false @@ -33738,9 +34074,9 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 8588, - "total_submitted": 10284, - "total_column_articles": 139, + "total_acs": 8617, + "total_submitted": 10318, + "total_column_articles": 140, "frontend_question_id": "1165", "is_new_question": false }, @@ -33759,9 +34095,9 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 24239, - "total_submitted": 68654, - "total_column_articles": 211, + "total_acs": 24415, + "total_submitted": 69127, + "total_column_articles": 213, "frontend_question_id": "1044", "is_new_question": false }, @@ -33780,9 +34116,9 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 9904, - "total_submitted": 14131, - "total_column_articles": 130, + "total_acs": 9983, + "total_submitted": 14245, + "total_column_articles": 131, "frontend_question_id": "1043", "is_new_question": false }, @@ -33801,9 +34137,9 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 14443, - "total_submitted": 26352, - "total_column_articles": 191, + "total_acs": 14548, + "total_submitted": 26561, + "total_column_articles": 193, "frontend_question_id": "1042", "is_new_question": false }, @@ -33822,8 +34158,8 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 9306, - "total_submitted": 18668, + "total_acs": 9430, + "total_submitted": 18894, "total_column_articles": 146, "frontend_question_id": "1041", "is_new_question": false @@ -33843,8 +34179,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 1281, - "total_submitted": 2190, + "total_acs": 1290, + "total_submitted": 2208, "total_column_articles": 20, "frontend_question_id": "1121", "is_new_question": false @@ -33864,9 +34200,9 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 45966, - "total_submitted": 97776, - "total_column_articles": 586, + "total_acs": 46559, + "total_submitted": 99073, + "total_column_articles": 589, "frontend_question_id": "1162", "is_new_question": false }, @@ -33885,9 +34221,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": 12951, - "total_submitted": 20590, - "total_column_articles": 215, + "total_acs": 13055, + "total_submitted": 20776, + "total_column_articles": 217, "frontend_question_id": "1161", "is_new_question": false }, @@ -33906,9 +34242,9 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 37456, - "total_submitted": 76134, - "total_column_articles": 382, + "total_acs": 37718, + "total_submitted": 76667, + "total_column_articles": 383, "frontend_question_id": "1037", "is_new_question": false }, @@ -33927,9 +34263,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": 35201, - "total_submitted": 43765, - "total_column_articles": 414, + "total_acs": 35699, + "total_submitted": 44352, + "total_column_articles": 417, "frontend_question_id": "1038", "is_new_question": false }, @@ -33948,9 +34284,9 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 3121, - "total_submitted": 5954, - "total_column_articles": 33, + "total_acs": 3143, + "total_submitted": 6012, + "total_column_articles": 37, "frontend_question_id": "1040", "is_new_question": false }, @@ -33969,9 +34305,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": 66256, - "total_submitted": 96772, - "total_column_articles": 970, + "total_acs": 66590, + "total_submitted": 97316, + "total_column_articles": 985, "frontend_question_id": "1160", "is_new_question": false }, @@ -33990,8 +34326,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 5840, - "total_submitted": 10249, + "total_acs": 5902, + "total_submitted": 10352, "total_column_articles": 74, "frontend_question_id": "1039", "is_new_question": false @@ -34011,9 +34347,9 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 2043, - "total_submitted": 5096, - "total_column_articles": 46, + "total_acs": 2087, + "total_submitted": 5207, + "total_column_articles": 47, "frontend_question_id": "1152", "is_new_question": false }, @@ -34032,9 +34368,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": 7212, - "total_submitted": 13980, - "total_column_articles": 112, + "total_acs": 7363, + "total_submitted": 14246, + "total_column_articles": 114, "frontend_question_id": "1151", "is_new_question": false }, @@ -34053,8 +34389,8 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 19243, - "total_submitted": 41131, + "total_acs": 19612, + "total_submitted": 41813, "total_column_articles": 210, "frontend_question_id": "1036", "is_new_question": false @@ -34074,9 +34410,9 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 52908, - "total_submitted": 78685, - "total_column_articles": 495, + "total_acs": 53978, + "total_submitted": 80059, + "total_column_articles": 502, "frontend_question_id": "1035", "is_new_question": false }, @@ -34095,9 +34431,9 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 30571, - "total_submitted": 55196, - "total_column_articles": 493, + "total_acs": 31023, + "total_submitted": 55951, + "total_column_articles": 497, "frontend_question_id": "1034", "is_new_question": false }, @@ -34116,9 +34452,9 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 12259, - "total_submitted": 30767, - "total_column_articles": 183, + "total_acs": 12304, + "total_submitted": 30869, + "total_column_articles": 185, "frontend_question_id": "1033", "is_new_question": false }, @@ -34137,9 +34473,9 @@ "question__title": "Check If a Number Is Majority Element in a Sorted Array", "question__title_slug": "check-if-a-number-is-majority-element-in-a-sorted-array", "question__hide": false, - "total_acs": 6027, - "total_submitted": 10102, - "total_column_articles": 107, + "total_acs": 6094, + "total_submitted": 10224, + "total_column_articles": 108, "frontend_question_id": "1150", "is_new_question": false }, @@ -34158,9 +34494,9 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 4568, - "total_submitted": 7662, - "total_column_articles": 78, + "total_acs": 4643, + "total_submitted": 7826, + "total_column_articles": 79, "frontend_question_id": "1136", "is_new_question": false }, @@ -34179,8 +34515,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 9773, - "total_submitted": 17276, + "total_acs": 9899, + "total_submitted": 17447, "total_column_articles": 130, "frontend_question_id": "1135", "is_new_question": false @@ -34200,9 +34536,9 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 7047, - "total_submitted": 18210, - "total_column_articles": 88, + "total_acs": 7183, + "total_submitted": 18453, + "total_column_articles": 91, "frontend_question_id": "1102", "is_new_question": false }, @@ -34221,8 +34557,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 3766, - "total_submitted": 5804, + "total_acs": 3791, + "total_submitted": 5837, "total_column_articles": 81, "frontend_question_id": "1133", "is_new_question": false @@ -34242,9 +34578,9 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 3576, - "total_submitted": 8293, - "total_column_articles": 64, + "total_acs": 3618, + "total_submitted": 8362, + "total_column_articles": 65, "frontend_question_id": "1032", "is_new_question": false }, @@ -34263,9 +34599,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": 7214, - "total_submitted": 12336, - "total_column_articles": 108, + "total_acs": 7374, + "total_submitted": 12591, + "total_column_articles": 110, "frontend_question_id": "1031", "is_new_question": false }, @@ -34284,8 +34620,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 20420, - "total_submitted": 30409, + "total_acs": 20531, + "total_submitted": 30571, "total_column_articles": 228, "frontend_question_id": "1029", "is_new_question": false @@ -34305,9 +34641,9 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 43829, - "total_submitted": 61831, - "total_column_articles": 478, + "total_acs": 43999, + "total_submitted": 62066, + "total_column_articles": 479, "frontend_question_id": "1030", "is_new_question": false }, @@ -34326,9 +34662,9 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 22944, - "total_submitted": 31515, - "total_column_articles": 481, + "total_acs": 23035, + "total_submitted": 31639, + "total_column_articles": 482, "frontend_question_id": "1028", "is_new_question": false }, @@ -34347,9 +34683,9 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 12563, - "total_submitted": 18313, - "total_column_articles": 223, + "total_acs": 12688, + "total_submitted": 18478, + "total_column_articles": 225, "frontend_question_id": "1026", "is_new_question": false }, @@ -34368,8 +34704,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 3327, - "total_submitted": 5354, + "total_acs": 3362, + "total_submitted": 5401, "total_column_articles": 64, "frontend_question_id": "1120", "is_new_question": false @@ -34389,8 +34725,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 3819, - "total_submitted": 4931, + "total_acs": 3841, + "total_submitted": 4964, "total_column_articles": 67, "frontend_question_id": "1134", "is_new_question": false @@ -34410,9 +34746,9 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 9395, - "total_submitted": 10835, - "total_column_articles": 167, + "total_acs": 9457, + "total_submitted": 10903, + "total_column_articles": 168, "frontend_question_id": "1119", "is_new_question": false }, @@ -34431,9 +34767,9 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 3100, - "total_submitted": 4839, - "total_column_articles": 58, + "total_acs": 3143, + "total_submitted": 4893, + "total_column_articles": 60, "frontend_question_id": "1118", "is_new_question": false }, @@ -34452,9 +34788,9 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 17979, - "total_submitted": 41079, - "total_column_articles": 161, + "total_acs": 18193, + "total_submitted": 41540, + "total_column_articles": 166, "frontend_question_id": "1027", "is_new_question": false }, @@ -34473,9 +34809,9 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 86039, - "total_submitted": 121596, - "total_column_articles": 719, + "total_acs": 86553, + "total_submitted": 122313, + "total_column_articles": 729, "frontend_question_id": "1025", "is_new_question": false }, @@ -34494,9 +34830,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": 3293, - "total_submitted": 4831, - "total_column_articles": 85, + "total_acs": 3343, + "total_submitted": 4891, + "total_column_articles": 87, "frontend_question_id": "1101", "is_new_question": false }, @@ -34515,9 +34851,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": 7311, - "total_submitted": 10439, - "total_column_articles": 146, + "total_acs": 7414, + "total_submitted": 10603, + "total_column_articles": 147, "frontend_question_id": "1100", "is_new_question": false }, @@ -34536,8 +34872,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 7036, - "total_submitted": 11785, + "total_acs": 7158, + "total_submitted": 11993, "total_column_articles": 126, "frontend_question_id": "1099", "is_new_question": false @@ -34557,8 +34893,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": 4283, - "total_submitted": 5517, + "total_acs": 4302, + "total_submitted": 5542, "total_column_articles": 94, "frontend_question_id": "1085", "is_new_question": false @@ -34578,9 +34914,9 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 39027, - "total_submitted": 71692, - "total_column_articles": 427, + "total_acs": 39308, + "total_submitted": 72296, + "total_column_articles": 431, "frontend_question_id": "1024", "is_new_question": false }, @@ -34599,9 +34935,9 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 8941, - "total_submitted": 15758, - "total_column_articles": 200, + "total_acs": 9016, + "total_submitted": 15887, + "total_column_articles": 201, "frontend_question_id": "1023", "is_new_question": false }, @@ -34620,9 +34956,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": 50432, - "total_submitted": 67049, - "total_column_articles": 598, + "total_acs": 50614, + "total_submitted": 67282, + "total_column_articles": 597, "frontend_question_id": "1022", "is_new_question": false }, @@ -34641,9 +34977,9 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 89845, - "total_submitted": 110300, - "total_column_articles": 1014, + "total_acs": 90199, + "total_submitted": 110730, + "total_column_articles": 1023, "frontend_question_id": "1021", "is_new_question": false }, @@ -34662,9 +34998,9 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 1311, - "total_submitted": 2793, - "total_column_articles": 42, + "total_acs": 1336, + "total_submitted": 2843, + "total_column_articles": 43, "frontend_question_id": "1088", "is_new_question": false }, @@ -34683,8 +35019,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 2551, - "total_submitted": 4632, + "total_acs": 2595, + "total_submitted": 4690, "total_column_articles": 70, "frontend_question_id": "1087", "is_new_question": false @@ -34704,8 +35040,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 3040, - "total_submitted": 5489, + "total_acs": 3076, + "total_submitted": 5552, "total_column_articles": 91, "frontend_question_id": "1065", "is_new_question": false @@ -34725,8 +35061,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 5997, - "total_submitted": 8876, + "total_acs": 6029, + "total_submitted": 8926, "total_column_articles": 102, "frontend_question_id": "1086", "is_new_question": false @@ -34746,9 +35082,9 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 45592, - "total_submitted": 74111, - "total_column_articles": 646, + "total_acs": 46219, + "total_submitted": 75075, + "total_column_articles": 652, "frontend_question_id": "1020", "is_new_question": false }, @@ -34767,9 +35103,9 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 25818, - "total_submitted": 42641, - "total_column_articles": 367, + "total_acs": 26091, + "total_submitted": 43078, + "total_column_articles": 373, "frontend_question_id": "1019", "is_new_question": false }, @@ -34788,8 +35124,8 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 46854, - "total_submitted": 91266, + "total_acs": 47007, + "total_submitted": 91564, "total_column_articles": 411, "frontend_question_id": "1018", "is_new_question": false @@ -34809,8 +35145,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 4299, - "total_submitted": 7621, + "total_acs": 4363, + "total_submitted": 7714, "total_column_articles": 62, "frontend_question_id": "1017", "is_new_question": false @@ -34830,8 +35166,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 4236, - "total_submitted": 9925, + "total_acs": 4264, + "total_submitted": 9985, "total_column_articles": 85, "frontend_question_id": "1056", "is_new_question": false @@ -34851,9 +35187,9 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 1182, - "total_submitted": 2652, - "total_column_articles": 29, + "total_acs": 1200, + "total_submitted": 2684, + "total_column_articles": 30, "frontend_question_id": "1067", "is_new_question": false }, @@ -34872,8 +35208,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 2713, - "total_submitted": 5489, + "total_acs": 2736, + "total_submitted": 5522, "total_column_articles": 56, "frontend_question_id": "1066", "is_new_question": false @@ -34893,8 +35229,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 5710, - "total_submitted": 8861, + "total_acs": 5734, + "total_submitted": 8900, "total_column_articles": 90, "frontend_question_id": "1064", "is_new_question": false @@ -34914,8 +35250,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": 6523, - "total_submitted": 11223, + "total_acs": 6568, + "total_submitted": 11301, "total_column_articles": 103, "frontend_question_id": "1016", "is_new_question": false @@ -34935,9 +35271,9 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 5980, - "total_submitted": 16396, - "total_column_articles": 48, + "total_acs": 6023, + "total_submitted": 16515, + "total_column_articles": 50, "frontend_question_id": "1015", "is_new_question": false }, @@ -34956,9 +35292,9 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 54356, - "total_submitted": 96043, - "total_column_articles": 608, + "total_acs": 54667, + "total_submitted": 96549, + "total_column_articles": 610, "frontend_question_id": "1014", "is_new_question": false }, @@ -34977,9 +35313,9 @@ "question__title": "Partition Array Into Three Parts With Equal Sum", "question__title_slug": "partition-array-into-three-parts-with-equal-sum", "question__hide": false, - "total_acs": 53402, - "total_submitted": 136665, - "total_column_articles": 980, + "total_acs": 53638, + "total_submitted": 137341, + "total_column_articles": 992, "frontend_question_id": "1013", "is_new_question": false }, @@ -34998,8 +35334,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 2508, - "total_submitted": 3458, + "total_acs": 2524, + "total_submitted": 3477, "total_column_articles": 53, "frontend_question_id": "1063", "is_new_question": false @@ -35019,9 +35355,9 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 4994, - "total_submitted": 8932, - "total_column_articles": 69, + "total_acs": 5062, + "total_submitted": 9067, + "total_column_articles": 70, "frontend_question_id": "1062", "is_new_question": false }, @@ -35040,9 +35376,9 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 8683, - "total_submitted": 16271, - "total_column_articles": 128, + "total_acs": 8870, + "total_submitted": 16604, + "total_column_articles": 129, "frontend_question_id": "1060", "is_new_question": false }, @@ -35061,8 +35397,8 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 3519, - "total_submitted": 5684, + "total_acs": 3561, + "total_submitted": 5743, "total_column_articles": 81, "frontend_question_id": "1061", "is_new_question": false @@ -35082,8 +35418,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 4121, - "total_submitted": 11237, + "total_acs": 4159, + "total_submitted": 11301, "total_column_articles": 79, "frontend_question_id": "1012", "is_new_question": false @@ -35103,9 +35439,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": 78885, - "total_submitted": 127243, - "total_column_articles": 742, + "total_acs": 79686, + "total_submitted": 128618, + "total_column_articles": 753, "frontend_question_id": "1011", "is_new_question": false }, @@ -35124,8 +35460,8 @@ "question__title": "Pairs of Songs With Total Durations Divisible by 60", "question__title_slug": "pairs-of-songs-with-total-durations-divisible-by-60", "question__hide": false, - "total_acs": 21005, - "total_submitted": 45661, + "total_acs": 21104, + "total_submitted": 45885, "total_column_articles": 275, "frontend_question_id": "1010", "is_new_question": false @@ -35145,9 +35481,9 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 19267, - "total_submitted": 32627, - "total_column_articles": 282, + "total_acs": 19411, + "total_submitted": 32882, + "total_column_articles": 285, "frontend_question_id": "1009", "is_new_question": false }, @@ -35166,8 +35502,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 1618, - "total_submitted": 4569, + "total_acs": 1630, + "total_submitted": 4605, "total_column_articles": 45, "frontend_question_id": "1058", "is_new_question": false @@ -35187,8 +35523,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 3724, - "total_submitted": 7564, + "total_acs": 3757, + "total_submitted": 7607, "total_column_articles": 48, "frontend_question_id": "1057", "is_new_question": false @@ -35208,8 +35544,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 7201, - "total_submitted": 11911, + "total_acs": 7290, + "total_submitted": 12042, "total_column_articles": 125, "frontend_question_id": "1055", "is_new_question": false @@ -35229,9 +35565,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": 23370, - "total_submitted": 32380, - "total_column_articles": 306, + "total_acs": 23645, + "total_submitted": 32767, + "total_column_articles": 307, "frontend_question_id": "1008", "is_new_question": false }, @@ -35250,8 +35586,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 7658, - "total_submitted": 16218, + "total_acs": 7702, + "total_submitted": 16370, "total_column_articles": 104, "frontend_question_id": "1007", "is_new_question": false @@ -35271,9 +35607,9 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 46064, - "total_submitted": 73470, - "total_column_articles": 628, + "total_acs": 46149, + "total_submitted": 73586, + "total_column_articles": 629, "frontend_question_id": "1006", "is_new_question": false }, @@ -35292,9 +35628,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": 88656, - "total_submitted": 171937, - "total_column_articles": 1204, + "total_acs": 90359, + "total_submitted": 175171, + "total_column_articles": 1221, "frontend_question_id": "1005", "is_new_question": false }, @@ -35313,9 +35649,9 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 93731, - "total_submitted": 156133, - "total_column_articles": 901, + "total_acs": 95279, + "total_submitted": 158831, + "total_column_articles": 916, "frontend_question_id": "1004", "is_new_question": false }, @@ -35334,9 +35670,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": 14126, - "total_submitted": 24281, - "total_column_articles": 219, + "total_acs": 14211, + "total_submitted": 24425, + "total_column_articles": 221, "frontend_question_id": "1003", "is_new_question": false }, @@ -35355,9 +35691,9 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 68408, - "total_submitted": 95103, - "total_column_articles": 697, + "total_acs": 69164, + "total_submitted": 96224, + "total_column_articles": 711, "frontend_question_id": "1002", "is_new_question": false }, @@ -35376,8 +35712,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 18590, - "total_submitted": 41279, + "total_acs": 18608, + "total_submitted": 41339, "total_column_articles": 268, "frontend_question_id": "1001", "is_new_question": false @@ -35397,8 +35733,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 5013, - "total_submitted": 11495, + "total_acs": 5082, + "total_submitted": 11613, "total_column_articles": 55, "frontend_question_id": "1000", "is_new_question": false @@ -35418,9 +35754,9 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 32629, - "total_submitted": 47193, - "total_column_articles": 599, + "total_acs": 32714, + "total_submitted": 47322, + "total_column_articles": 601, "frontend_question_id": "999", "is_new_question": false }, @@ -35439,9 +35775,9 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 9117, - "total_submitted": 14634, - "total_column_articles": 144, + "total_acs": 9184, + "total_submitted": 14727, + "total_column_articles": 145, "frontend_question_id": "998", "is_new_question": false }, @@ -35460,9 +35796,9 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 74350, - "total_submitted": 140713, - "total_column_articles": 770, + "total_acs": 74904, + "total_submitted": 141897, + "total_column_articles": 783, "frontend_question_id": "997", "is_new_question": false }, @@ -35481,9 +35817,9 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 5535, - "total_submitted": 11223, - "total_column_articles": 111, + "total_acs": 5602, + "total_submitted": 11350, + "total_column_articles": 114, "frontend_question_id": "996", "is_new_question": false }, @@ -35502,8 +35838,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": 23741, - "total_submitted": 44302, + "total_acs": 23827, + "total_submitted": 44472, "total_column_articles": 266, "frontend_question_id": "995", "is_new_question": false @@ -35523,9 +35859,9 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 85676, - "total_submitted": 168039, - "total_column_articles": 1819, + "total_acs": 87004, + "total_submitted": 170679, + "total_column_articles": 1838, "frontend_question_id": "994", "is_new_question": false }, @@ -35544,9 +35880,9 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 58198, - "total_submitted": 104625, - "total_column_articles": 917, + "total_acs": 58461, + "total_submitted": 105123, + "total_column_articles": 927, "frontend_question_id": "993", "is_new_question": false }, @@ -35565,9 +35901,9 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 27503, - "total_submitted": 58963, - "total_column_articles": 308, + "total_acs": 27663, + "total_submitted": 59300, + "total_column_articles": 309, "frontend_question_id": "992", "is_new_question": false }, @@ -35586,8 +35922,8 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 10491, - "total_submitted": 20077, + "total_acs": 10554, + "total_submitted": 20205, "total_column_articles": 127, "frontend_question_id": "991", "is_new_question": false @@ -35607,9 +35943,9 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 43070, - "total_submitted": 82476, - "total_column_articles": 685, + "total_acs": 43585, + "total_submitted": 83360, + "total_column_articles": 701, "frontend_question_id": "990", "is_new_question": false }, @@ -35628,9 +35964,9 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 62055, - "total_submitted": 132264, - "total_column_articles": 692, + "total_acs": 62592, + "total_submitted": 133418, + "total_column_articles": 708, "frontend_question_id": "989", "is_new_question": false }, @@ -35649,8 +35985,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 12434, - "total_submitted": 24573, + "total_acs": 12556, + "total_submitted": 24813, "total_column_articles": 151, "frontend_question_id": "988", "is_new_question": false @@ -35670,8 +36006,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": 27445, - "total_submitted": 51378, + "total_acs": 27573, + "total_submitted": 51646, "total_column_articles": 458, "frontend_question_id": "987", "is_new_question": false @@ -35691,9 +36027,9 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 47452, - "total_submitted": 69288, - "total_column_articles": 458, + "total_acs": 48417, + "total_submitted": 70649, + "total_column_articles": 466, "frontend_question_id": "986", "is_new_question": false }, @@ -35712,9 +36048,9 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 17712, - "total_submitted": 29261, - "total_column_articles": 205, + "total_acs": 17770, + "total_submitted": 29344, + "total_column_articles": 207, "frontend_question_id": "985", "is_new_question": false }, @@ -35733,9 +36069,9 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 10875, - "total_submitted": 25569, - "total_column_articles": 180, + "total_acs": 10950, + "total_submitted": 25725, + "total_column_articles": 182, "frontend_question_id": "984", "is_new_question": false }, @@ -35754,9 +36090,9 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 37304, - "total_submitted": 58821, - "total_column_articles": 494, + "total_acs": 37532, + "total_submitted": 59200, + "total_column_articles": 495, "frontend_question_id": "983", "is_new_question": false }, @@ -35775,9 +36111,9 @@ "question__title": "Triples with Bitwise AND Equal To Zero", "question__title_slug": "triples-with-bitwise-and-equal-to-zero", "question__hide": false, - "total_acs": 3204, - "total_submitted": 5692, - "total_column_articles": 40, + "total_acs": 3248, + "total_submitted": 5758, + "total_column_articles": 41, "frontend_question_id": "982", "is_new_question": false }, @@ -35796,9 +36132,9 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 24782, - "total_submitted": 46695, - "total_column_articles": 350, + "total_acs": 25047, + "total_submitted": 47202, + "total_column_articles": 352, "frontend_question_id": "981", "is_new_question": false }, @@ -35817,9 +36153,9 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 17495, - "total_submitted": 23764, - "total_column_articles": 260, + "total_acs": 17636, + "total_submitted": 23960, + "total_column_articles": 262, "frontend_question_id": "980", "is_new_question": false }, @@ -35838,9 +36174,9 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 10783, - "total_submitted": 14967, - "total_column_articles": 166, + "total_acs": 10909, + "total_submitted": 15150, + "total_column_articles": 168, "frontend_question_id": "979", "is_new_question": false }, @@ -35859,9 +36195,9 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 47651, - "total_submitted": 100329, - "total_column_articles": 646, + "total_acs": 47898, + "total_submitted": 100838, + "total_column_articles": 647, "frontend_question_id": "978", "is_new_question": false }, @@ -35880,9 +36216,9 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 356194, - "total_submitted": 516535, - "total_column_articles": 2401, + "total_acs": 364378, + "total_submitted": 528507, + "total_column_articles": 2441, "frontend_question_id": "977", "is_new_question": false }, @@ -35901,9 +36237,9 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 69066, - "total_submitted": 117983, - "total_column_articles": 686, + "total_acs": 69736, + "total_submitted": 119384, + "total_column_articles": 701, "frontend_question_id": "976", "is_new_question": false }, @@ -35922,9 +36258,9 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 4139, - "total_submitted": 9013, - "total_column_articles": 67, + "total_acs": 4183, + "total_submitted": 9107, + "total_column_articles": 69, "frontend_question_id": "975", "is_new_question": false }, @@ -35943,9 +36279,9 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 47761, - "total_submitted": 100905, - "total_column_articles": 464, + "total_acs": 48376, + "total_submitted": 102069, + "total_column_articles": 467, "frontend_question_id": "974", "is_new_question": false }, @@ -35964,9 +36300,9 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 82396, - "total_submitted": 127108, - "total_column_articles": 730, + "total_acs": 83025, + "total_submitted": 128017, + "total_column_articles": 744, "frontend_question_id": "973", "is_new_question": false }, @@ -35985,9 +36321,9 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 407764, - "total_submitted": 611916, - "total_column_articles": 2509, + "total_acs": 415090, + "total_submitted": 622828, + "total_column_articles": 2541, "frontend_question_id": "509", "is_new_question": false }, @@ -36006,8 +36342,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 1665, - "total_submitted": 4124, + "total_acs": 1673, + "total_submitted": 4143, "total_column_articles": 39, "frontend_question_id": "972", "is_new_question": false @@ -36027,9 +36363,9 @@ "question__title": "Flip Binary Tree To Match Preorder Traversal", "question__title_slug": "flip-binary-tree-to-match-preorder-traversal", "question__hide": false, - "total_acs": 8626, - "total_submitted": 19285, - "total_column_articles": 136, + "total_acs": 8735, + "total_submitted": 19532, + "total_column_articles": 137, "frontend_question_id": "971", "is_new_question": false }, @@ -36048,9 +36384,9 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 12375, - "total_submitted": 30059, - "total_column_articles": 141, + "total_acs": 12531, + "total_submitted": 30476, + "total_column_articles": 142, "frontend_question_id": "970", "is_new_question": false }, @@ -36069,9 +36405,9 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 42461, - "total_submitted": 62555, - "total_column_articles": 617, + "total_acs": 42749, + "total_submitted": 62991, + "total_column_articles": 618, "frontend_question_id": "969", "is_new_question": false }, @@ -36090,9 +36426,9 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 40205, - "total_submitted": 77970, - "total_column_articles": 459, + "total_acs": 41048, + "total_submitted": 79574, + "total_column_articles": 464, "frontend_question_id": "968", "is_new_question": false }, @@ -36111,9 +36447,9 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 9859, - "total_submitted": 20211, - "total_column_articles": 190, + "total_acs": 10035, + "total_submitted": 20475, + "total_column_articles": 195, "frontend_question_id": "967", "is_new_question": false }, @@ -36132,9 +36468,9 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 3722, - "total_submitted": 8979, - "total_column_articles": 60, + "total_acs": 3741, + "total_submitted": 9035, + "total_column_articles": 61, "frontend_question_id": "966", "is_new_question": false }, @@ -36153,9 +36489,9 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 70202, - "total_submitted": 97221, - "total_column_articles": 784, + "total_acs": 70608, + "total_submitted": 97874, + "total_column_articles": 796, "frontend_question_id": "965", "is_new_question": false }, @@ -36174,9 +36510,9 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 1803, - "total_submitted": 4040, - "total_column_articles": 32, + "total_acs": 1818, + "total_submitted": 4061, + "total_column_articles": 33, "frontend_question_id": "964", "is_new_question": false }, @@ -36195,9 +36531,9 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 3088, - "total_submitted": 6058, - "total_column_articles": 38, + "total_acs": 3124, + "total_submitted": 6119, + "total_column_articles": 39, "frontend_question_id": "963", "is_new_question": false }, @@ -36216,9 +36552,9 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 18163, - "total_submitted": 39964, - "total_column_articles": 177, + "total_acs": 18419, + "total_submitted": 40488, + "total_column_articles": 178, "frontend_question_id": "962", "is_new_question": false }, @@ -36237,9 +36573,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": 73320, - "total_submitted": 104156, - "total_column_articles": 664, + "total_acs": 73557, + "total_submitted": 104468, + "total_column_articles": 675, "frontend_question_id": "961", "is_new_question": false }, @@ -36258,9 +36594,9 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 2694, - "total_submitted": 4678, - "total_column_articles": 46, + "total_acs": 2744, + "total_submitted": 4769, + "total_column_articles": 48, "frontend_question_id": "960", "is_new_question": false }, @@ -36279,8 +36615,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 21335, - "total_submitted": 28748, + "total_acs": 21412, + "total_submitted": 28851, "total_column_articles": 328, "frontend_question_id": "959", "is_new_question": false @@ -36300,9 +36636,9 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 38266, - "total_submitted": 70385, - "total_column_articles": 368, + "total_acs": 38967, + "total_submitted": 71595, + "total_column_articles": 373, "frontend_question_id": "958", "is_new_question": false }, @@ -36321,9 +36657,9 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 16770, - "total_submitted": 45721, - "total_column_articles": 163, + "total_acs": 16894, + "total_submitted": 46061, + "total_column_articles": 165, "frontend_question_id": "957", "is_new_question": false }, @@ -36342,8 +36678,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 5084, - "total_submitted": 11402, + "total_acs": 5158, + "total_submitted": 11497, "total_column_articles": 63, "frontend_question_id": "956", "is_new_question": false @@ -36363,9 +36699,9 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 4339, - "total_submitted": 12627, - "total_column_articles": 76, + "total_acs": 4406, + "total_submitted": 12786, + "total_column_articles": 77, "frontend_question_id": "955", "is_new_question": false }, @@ -36384,8 +36720,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 40408, - "total_submitted": 103866, + "total_acs": 40481, + "total_submitted": 104041, "total_column_articles": 452, "frontend_question_id": "954", "is_new_question": false @@ -36405,9 +36741,9 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 48051, - "total_submitted": 83137, - "total_column_articles": 617, + "total_acs": 48360, + "total_submitted": 83695, + "total_column_articles": 618, "frontend_question_id": "953", "is_new_question": false }, @@ -36426,9 +36762,9 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 3993, - "total_submitted": 10687, - "total_column_articles": 72, + "total_acs": 4060, + "total_submitted": 10834, + "total_column_articles": 73, "frontend_question_id": "952", "is_new_question": false }, @@ -36447,9 +36783,9 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 14163, - "total_submitted": 21288, - "total_column_articles": 205, + "total_acs": 14325, + "total_submitted": 21545, + "total_column_articles": 207, "frontend_question_id": "951", "is_new_question": false }, @@ -36468,8 +36804,8 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 12015, - "total_submitted": 15328, + "total_acs": 12090, + "total_submitted": 15414, "total_column_articles": 189, "frontend_question_id": "950", "is_new_question": false @@ -36489,9 +36825,9 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 9955, - "total_submitted": 26521, - "total_column_articles": 154, + "total_acs": 10045, + "total_submitted": 26692, + "total_column_articles": 157, "frontend_question_id": "949", "is_new_question": false }, @@ -36510,9 +36846,9 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 8163, - "total_submitted": 20530, - "total_column_articles": 119, + "total_acs": 8231, + "total_submitted": 20705, + "total_column_articles": 120, "frontend_question_id": "948", "is_new_question": false }, @@ -36531,9 +36867,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": 28977, - "total_submitted": 47428, - "total_column_articles": 375, + "total_acs": 29171, + "total_submitted": 47758, + "total_column_articles": 379, "frontend_question_id": "947", "is_new_question": false }, @@ -36552,9 +36888,9 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 38253, - "total_submitted": 59885, - "total_column_articles": 407, + "total_acs": 38887, + "total_submitted": 60791, + "total_column_articles": 413, "frontend_question_id": "946", "is_new_question": false }, @@ -36573,9 +36909,9 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 38981, - "total_submitted": 80699, - "total_column_articles": 570, + "total_acs": 39156, + "total_submitted": 81104, + "total_column_articles": 571, "frontend_question_id": "945", "is_new_question": false }, @@ -36594,9 +36930,9 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 53188, - "total_submitted": 76758, - "total_column_articles": 465, + "total_acs": 53345, + "total_submitted": 77028, + "total_column_articles": 468, "frontend_question_id": "944", "is_new_question": false }, @@ -36615,8 +36951,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 2562, - "total_submitted": 5554, + "total_acs": 2583, + "total_submitted": 5598, "total_column_articles": 58, "frontend_question_id": "943", "is_new_question": false @@ -36636,9 +36972,9 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 59937, - "total_submitted": 77429, - "total_column_articles": 708, + "total_acs": 60287, + "total_submitted": 77875, + "total_column_articles": 721, "frontend_question_id": "942", "is_new_question": false }, @@ -36657,9 +36993,9 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 69361, - "total_submitted": 175955, - "total_column_articles": 691, + "total_acs": 70045, + "total_submitted": 177563, + "total_column_articles": 705, "frontend_question_id": "941", "is_new_question": false }, @@ -36678,9 +37014,9 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 7146, - "total_submitted": 16437, - "total_column_articles": 82, + "total_acs": 7253, + "total_submitted": 16687, + "total_column_articles": 84, "frontend_question_id": "940", "is_new_question": false }, @@ -36699,9 +37035,9 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 7214, - "total_submitted": 15304, - "total_column_articles": 81, + "total_acs": 7283, + "total_submitted": 15432, + "total_column_articles": 82, "frontend_question_id": "939", "is_new_question": false }, @@ -36720,8 +37056,8 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 110099, - "total_submitted": 134107, + "total_acs": 110583, + "total_submitted": 134688, "total_column_articles": 925, "frontend_question_id": "938", "is_new_question": false @@ -36741,9 +37077,9 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 38974, - "total_submitted": 61062, - "total_column_articles": 456, + "total_acs": 39209, + "total_submitted": 61401, + "total_column_articles": 458, "frontend_question_id": "937", "is_new_question": false }, @@ -36762,9 +37098,9 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 2044, - "total_submitted": 5089, - "total_column_articles": 33, + "total_acs": 2077, + "total_submitted": 5171, + "total_column_articles": 34, "frontend_question_id": "936", "is_new_question": false }, @@ -36783,8 +37119,8 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 7859, - "total_submitted": 15951, + "total_acs": 7934, + "total_submitted": 16095, "total_column_articles": 109, "frontend_question_id": "935", "is_new_question": false @@ -36804,9 +37140,9 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 34510, - "total_submitted": 71981, - "total_column_articles": 404, + "total_acs": 35129, + "total_submitted": 73293, + "total_column_articles": 408, "frontend_question_id": "934", "is_new_question": false }, @@ -36825,9 +37161,9 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 83105, - "total_submitted": 107839, - "total_column_articles": 736, + "total_acs": 83751, + "total_submitted": 108713, + "total_column_articles": 739, "frontend_question_id": "933", "is_new_question": false }, @@ -36846,9 +37182,9 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 10927, - "total_submitted": 16889, - "total_column_articles": 109, + "total_acs": 11110, + "total_submitted": 17144, + "total_column_articles": 111, "frontend_question_id": "932", "is_new_question": false }, @@ -36867,9 +37203,9 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 41239, - "total_submitted": 61425, - "total_column_articles": 579, + "total_acs": 42003, + "total_submitted": 62534, + "total_column_articles": 613, "frontend_question_id": "931", "is_new_question": false }, @@ -36888,9 +37224,9 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 38945, - "total_submitted": 71191, - "total_column_articles": 381, + "total_acs": 39228, + "total_submitted": 71662, + "total_column_articles": 385, "frontend_question_id": "930", "is_new_question": false }, @@ -36909,9 +37245,9 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 51211, - "total_submitted": 74440, - "total_column_articles": 489, + "total_acs": 51457, + "total_submitted": 74801, + "total_column_articles": 494, "frontend_question_id": "929", "is_new_question": false }, @@ -36930,9 +37266,9 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 2907, - "total_submitted": 6757, - "total_column_articles": 63, + "total_acs": 2941, + "total_submitted": 6827, + "total_column_articles": 64, "frontend_question_id": "928", "is_new_question": false }, @@ -36951,8 +37287,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 4136, - "total_submitted": 11911, + "total_acs": 4177, + "total_submitted": 12033, "total_column_articles": 87, "frontend_question_id": "927", "is_new_question": false @@ -36972,9 +37308,9 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 31853, - "total_submitted": 50231, - "total_column_articles": 462, + "total_acs": 32153, + "total_submitted": 50648, + "total_column_articles": 465, "frontend_question_id": "926", "is_new_question": false }, @@ -36993,9 +37329,9 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 56022, - "total_submitted": 146435, - "total_column_articles": 748, + "total_acs": 56499, + "total_submitted": 147725, + "total_column_articles": 763, "frontend_question_id": "925", "is_new_question": false }, @@ -37014,8 +37350,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 8233, - "total_submitted": 22971, + "total_acs": 8322, + "total_submitted": 23189, "total_column_articles": 122, "frontend_question_id": "924", "is_new_question": false @@ -37035,9 +37371,9 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 7926, - "total_submitted": 22244, - "total_column_articles": 94, + "total_acs": 7985, + "total_submitted": 22448, + "total_column_articles": 96, "frontend_question_id": "923", "is_new_question": false }, @@ -37056,9 +37392,9 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 99537, - "total_submitted": 139531, - "total_column_articles": 944, + "total_acs": 100221, + "total_submitted": 140447, + "total_column_articles": 953, "frontend_question_id": "922", "is_new_question": false }, @@ -37077,9 +37413,9 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 31507, - "total_submitted": 42163, - "total_column_articles": 426, + "total_acs": 31983, + "total_submitted": 42833, + "total_column_articles": 428, "frontend_question_id": "921", "is_new_question": false }, @@ -37098,8 +37434,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 2398, - "total_submitted": 4802, + "total_acs": 2432, + "total_submitted": 4869, "total_column_articles": 31, "frontend_question_id": "920", "is_new_question": false @@ -37119,9 +37455,9 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 8348, - "total_submitted": 12667, - "total_column_articles": 142, + "total_acs": 8472, + "total_submitted": 12863, + "total_column_articles": 144, "frontend_question_id": "919", "is_new_question": false }, @@ -37140,9 +37476,9 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 42357, - "total_submitted": 113957, - "total_column_articles": 401, + "total_acs": 42945, + "total_submitted": 115297, + "total_column_articles": 403, "frontend_question_id": "918", "is_new_question": false }, @@ -37161,9 +37497,9 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 69304, - "total_submitted": 115394, - "total_column_articles": 960, + "total_acs": 69761, + "total_submitted": 116215, + "total_column_articles": 973, "frontend_question_id": "917", "is_new_question": false }, @@ -37182,9 +37518,9 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 7674, - "total_submitted": 16945, - "total_column_articles": 100, + "total_acs": 7735, + "total_submitted": 17054, + "total_column_articles": 101, "frontend_question_id": "916", "is_new_question": false }, @@ -37203,9 +37539,9 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 11954, - "total_submitted": 25381, - "total_column_articles": 141, + "total_acs": 12058, + "total_submitted": 25664, + "total_column_articles": 142, "frontend_question_id": "915", "is_new_question": false }, @@ -37224,9 +37560,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": 53982, - "total_submitted": 140571, - "total_column_articles": 686, + "total_acs": 54272, + "total_submitted": 141473, + "total_column_articles": 689, "frontend_question_id": "914", "is_new_question": false }, @@ -37245,8 +37581,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 17269, - "total_submitted": 30374, + "total_acs": 17310, + "total_submitted": 30461, "total_column_articles": 133, "frontend_question_id": "913", "is_new_question": false @@ -37266,9 +37602,9 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 392687, - "total_submitted": 705378, - "total_column_articles": 1618, + "total_acs": 401673, + "total_submitted": 721375, + "total_column_articles": 1637, "frontend_question_id": "912", "is_new_question": false }, @@ -37287,9 +37623,9 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 28802, - "total_submitted": 53385, - "total_column_articles": 340, + "total_acs": 28957, + "total_submitted": 53746, + "total_column_articles": 341, "frontend_question_id": "911", "is_new_question": false }, @@ -37308,9 +37644,9 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 8941, - "total_submitted": 26328, - "total_column_articles": 93, + "total_acs": 9026, + "total_submitted": 26561, + "total_column_articles": 96, "frontend_question_id": "910", "is_new_question": false }, @@ -37329,9 +37665,9 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 17581, - "total_submitted": 38549, - "total_column_articles": 211, + "total_acs": 17994, + "total_submitted": 39241, + "total_column_articles": 213, "frontend_question_id": "909", "is_new_question": false }, @@ -37350,9 +37686,9 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 50390, - "total_submitted": 67757, - "total_column_articles": 521, + "total_acs": 50552, + "total_submitted": 67972, + "total_column_articles": 523, "frontend_question_id": "908", "is_new_question": false }, @@ -37371,9 +37707,9 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 17893, - "total_submitted": 52366, - "total_column_articles": 190, + "total_acs": 18253, + "total_submitted": 53281, + "total_column_articles": 191, "frontend_question_id": "907", "is_new_question": false }, @@ -37392,9 +37728,9 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 2917, - "total_submitted": 9737, - "total_column_articles": 54, + "total_acs": 2959, + "total_submitted": 9853, + "total_column_articles": 55, "frontend_question_id": "906", "is_new_question": false }, @@ -37413,9 +37749,9 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 107907, - "total_submitted": 151371, - "total_column_articles": 1307, + "total_acs": 108386, + "total_submitted": 152028, + "total_column_articles": 1311, "frontend_question_id": "905", "is_new_question": false }, @@ -37434,9 +37770,9 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 53991, - "total_submitted": 123259, - "total_column_articles": 655, + "total_acs": 55921, + "total_submitted": 127833, + "total_column_articles": 671, "frontend_question_id": "904", "is_new_question": false }, @@ -37455,8 +37791,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 3380, - "total_submitted": 6136, + "total_acs": 3406, + "total_submitted": 6172, "total_column_articles": 52, "frontend_question_id": "903", "is_new_question": false @@ -37476,9 +37812,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": 5055, - "total_submitted": 13681, - "total_column_articles": 105, + "total_acs": 5131, + "total_submitted": 13882, + "total_column_articles": 107, "frontend_question_id": "902", "is_new_question": false }, @@ -37497,9 +37833,9 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 25760, - "total_submitted": 45936, - "total_column_articles": 308, + "total_acs": 26106, + "total_submitted": 46497, + "total_column_articles": 312, "frontend_question_id": "901", "is_new_question": false }, @@ -37518,8 +37854,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 4367, - "total_submitted": 8618, + "total_acs": 4423, + "total_submitted": 8726, "total_column_articles": 71, "frontend_question_id": "900", "is_new_question": false @@ -37539,9 +37875,9 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 5460, - "total_submitted": 10034, - "total_column_articles": 59, + "total_acs": 5536, + "total_submitted": 10190, + "total_column_articles": 60, "frontend_question_id": "899", "is_new_question": false }, @@ -37560,8 +37896,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 6728, - "total_submitted": 18745, + "total_acs": 6794, + "total_submitted": 18923, "total_column_articles": 48, "frontend_question_id": "898", "is_new_question": false @@ -37581,9 +37917,9 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 70569, - "total_submitted": 95154, - "total_column_articles": 813, + "total_acs": 70913, + "total_submitted": 95615, + "total_column_articles": 825, "frontend_question_id": "897", "is_new_question": false }, @@ -37602,9 +37938,9 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 70422, - "total_submitted": 121806, - "total_column_articles": 843, + "total_acs": 71020, + "total_submitted": 123207, + "total_column_articles": 863, "frontend_question_id": "896", "is_new_question": false }, @@ -37623,9 +37959,9 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 12116, - "total_submitted": 20560, - "total_column_articles": 143, + "total_acs": 12258, + "total_submitted": 20790, + "total_column_articles": 146, "frontend_question_id": "895", "is_new_question": false }, @@ -37644,9 +37980,9 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 16182, - "total_submitted": 20831, - "total_column_articles": 161, + "total_acs": 16319, + "total_submitted": 20995, + "total_column_articles": 164, "frontend_question_id": "894", "is_new_question": false }, @@ -37665,8 +38001,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 11766, - "total_submitted": 16192, + "total_acs": 11804, + "total_submitted": 16244, "total_column_articles": 126, "frontend_question_id": "893", "is_new_question": false @@ -37686,9 +38022,9 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 35575, - "total_submitted": 55644, - "total_column_articles": 717, + "total_acs": 35686, + "total_submitted": 55809, + "total_column_articles": 727, "frontend_question_id": "892", "is_new_question": false }, @@ -37707,8 +38043,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 3487, - "total_submitted": 10107, + "total_acs": 3529, + "total_submitted": 10198, "total_column_articles": 48, "frontend_question_id": "891", "is_new_question": false @@ -37728,8 +38064,8 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 29303, - "total_submitted": 36983, + "total_acs": 29442, + "total_submitted": 37169, "total_column_articles": 430, "frontend_question_id": "890", "is_new_question": false @@ -37749,9 +38085,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": 26665, - "total_submitted": 39378, - "total_column_articles": 270, + "total_acs": 27263, + "total_submitted": 40236, + "total_column_articles": 272, "frontend_question_id": "889", "is_new_question": false }, @@ -37770,9 +38106,9 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 61201, - "total_submitted": 95725, - "total_column_articles": 528, + "total_acs": 61483, + "total_submitted": 96157, + "total_column_articles": 529, "frontend_question_id": "888", "is_new_question": false }, @@ -37791,9 +38127,9 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 65570, - "total_submitted": 219122, - "total_column_articles": 417, + "total_acs": 66372, + "total_submitted": 221203, + "total_column_articles": 420, "frontend_question_id": "887", "is_new_question": false }, @@ -37812,9 +38148,9 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 17574, - "total_submitted": 36150, - "total_column_articles": 318, + "total_acs": 17967, + "total_submitted": 36864, + "total_column_articles": 325, "frontend_question_id": "886", "is_new_question": false }, @@ -37833,9 +38169,9 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 6201, - "total_submitted": 8829, - "total_column_articles": 94, + "total_acs": 6317, + "total_submitted": 8974, + "total_column_articles": 96, "frontend_question_id": "885", "is_new_question": false }, @@ -37854,9 +38190,9 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 43869, - "total_submitted": 61039, - "total_column_articles": 556, + "total_acs": 44068, + "total_submitted": 61328, + "total_column_articles": 557, "frontend_question_id": "884", "is_new_question": false }, @@ -37875,9 +38211,9 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 42392, - "total_submitted": 55351, - "total_column_articles": 525, + "total_acs": 42510, + "total_submitted": 55509, + "total_column_articles": 526, "frontend_question_id": "883", "is_new_question": false }, @@ -37896,9 +38232,9 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 2777, - "total_submitted": 5567, - "total_column_articles": 47, + "total_acs": 2814, + "total_submitted": 5625, + "total_column_articles": 49, "frontend_question_id": "882", "is_new_question": false }, @@ -37917,9 +38253,9 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 58414, - "total_submitted": 108492, - "total_column_articles": 683, + "total_acs": 58811, + "total_submitted": 109282, + "total_column_articles": 684, "frontend_question_id": "881", "is_new_question": false }, @@ -37938,9 +38274,9 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 7177, - "total_submitted": 27549, - "total_column_articles": 91, + "total_acs": 7228, + "total_submitted": 27752, + "total_column_articles": 92, "frontend_question_id": "880", "is_new_question": false }, @@ -37959,9 +38295,9 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 26759, - "total_submitted": 55578, - "total_column_articles": 175, + "total_acs": 26878, + "total_submitted": 55788, + "total_column_articles": 176, "frontend_question_id": "478", "is_new_question": false }, @@ -37980,9 +38316,9 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 22194, - "total_submitted": 52984, - "total_column_articles": 203, + "total_acs": 22282, + "total_submitted": 53173, + "total_column_articles": 204, "frontend_question_id": "497", "is_new_question": false }, @@ -38001,8 +38337,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 20538, - "total_submitted": 44061, + "total_acs": 20599, + "total_submitted": 44196, "total_column_articles": 201, "frontend_question_id": "519", "is_new_question": false @@ -38022,9 +38358,9 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 44368, - "total_submitted": 92169, - "total_column_articles": 335, + "total_acs": 45098, + "total_submitted": 93723, + "total_column_articles": 355, "frontend_question_id": "528", "is_new_question": false }, @@ -38043,8 +38379,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 24552, - "total_submitted": 44453, + "total_acs": 24717, + "total_submitted": 44730, "total_column_articles": 209, "frontend_question_id": "879", "is_new_question": false @@ -38064,9 +38400,9 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 5540, - "total_submitted": 18680, - "total_column_articles": 76, + "total_acs": 5614, + "total_submitted": 18884, + "total_column_articles": 78, "frontend_question_id": "878", "is_new_question": false }, @@ -38085,9 +38421,9 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 81487, - "total_submitted": 107022, - "total_column_articles": 555, + "total_acs": 82062, + "total_submitted": 107760, + "total_column_articles": 558, "frontend_question_id": "877", "is_new_question": false }, @@ -38106,9 +38442,9 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 266670, - "total_submitted": 377752, - "total_column_articles": 2657, + "total_acs": 274053, + "total_submitted": 388244, + "total_column_articles": 2713, "frontend_question_id": "876", "is_new_question": false }, @@ -38127,9 +38463,9 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 102163, - "total_submitted": 200933, - "total_column_articles": 808, + "total_acs": 103832, + "total_submitted": 204575, + "total_column_articles": 822, "frontend_question_id": "875", "is_new_question": false }, @@ -38148,9 +38484,9 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 23823, - "total_submitted": 56311, - "total_column_articles": 281, + "total_acs": 23958, + "total_submitted": 56613, + "total_column_articles": 283, "frontend_question_id": "874", "is_new_question": false }, @@ -38169,9 +38505,9 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 21420, - "total_submitted": 40258, - "total_column_articles": 158, + "total_acs": 42975, + "total_submitted": 76715, + "total_column_articles": 333, "frontend_question_id": "873", "is_new_question": false }, @@ -38190,9 +38526,9 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 66091, - "total_submitted": 101492, - "total_column_articles": 797, + "total_acs": 66328, + "total_submitted": 101882, + "total_column_articles": 806, "frontend_question_id": "872", "is_new_question": false }, @@ -38211,9 +38547,9 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 85070, - "total_submitted": 154162, - "total_column_articles": 409, + "total_acs": 86037, + "total_submitted": 155908, + "total_column_articles": 412, "frontend_question_id": "470", "is_new_question": false }, @@ -38232,9 +38568,9 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 12796, - "total_submitted": 35631, - "total_column_articles": 165, + "total_acs": 29440, + "total_submitted": 68265, + "total_column_articles": 331, "frontend_question_id": "871", "is_new_question": false }, @@ -38253,9 +38589,9 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 25462, - "total_submitted": 54377, - "total_column_articles": 285, + "total_acs": 26020, + "total_submitted": 55408, + "total_column_articles": 288, "frontend_question_id": "870", "is_new_question": false }, @@ -38274,9 +38610,9 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 34369, - "total_submitted": 53672, - "total_column_articles": 489, + "total_acs": 34491, + "total_submitted": 53901, + "total_column_articles": 490, "frontend_question_id": "869", "is_new_question": false }, @@ -38295,9 +38631,9 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 48149, - "total_submitted": 69261, - "total_column_articles": 640, + "total_acs": 48394, + "total_submitted": 69658, + "total_column_articles": 642, "frontend_question_id": "868", "is_new_question": false }, @@ -38316,9 +38652,9 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 90880, - "total_submitted": 136198, - "total_column_articles": 815, + "total_acs": 91145, + "total_submitted": 136600, + "total_column_articles": 824, "frontend_question_id": "867", "is_new_question": false }, @@ -38337,8 +38673,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 9249, - "total_submitted": 39888, + "total_acs": 9318, + "total_submitted": 40118, "total_column_articles": 110, "frontend_question_id": "866", "is_new_question": false @@ -38358,9 +38694,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": 12017, - "total_submitted": 17799, - "total_column_articles": 182, + "total_acs": 12148, + "total_submitted": 17964, + "total_column_articles": 183, "frontend_question_id": "865", "is_new_question": false }, @@ -38379,9 +38715,9 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 4053, - "total_submitted": 8494, - "total_column_articles": 60, + "total_acs": 4105, + "total_submitted": 8607, + "total_column_articles": 61, "frontend_question_id": "864", "is_new_question": false }, @@ -38400,9 +38736,9 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 24129, - "total_submitted": 54553, - "total_column_articles": 331, + "total_acs": 24614, + "total_submitted": 55652, + "total_column_articles": 343, "frontend_question_id": "710", "is_new_question": false }, @@ -38421,9 +38757,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": 44314, - "total_submitted": 72513, - "total_column_articles": 655, + "total_acs": 44998, + "total_submitted": 73497, + "total_column_articles": 660, "frontend_question_id": "863", "is_new_question": false }, @@ -38442,9 +38778,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": 23133, - "total_submitted": 108186, - "total_column_articles": 197, + "total_acs": 23523, + "total_submitted": 109455, + "total_column_articles": 202, "frontend_question_id": "862", "is_new_question": false }, @@ -38463,8 +38799,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 33676, - "total_submitted": 41697, + "total_acs": 33768, + "total_submitted": 41810, "total_column_articles": 479, "frontend_question_id": "861", "is_new_question": false @@ -38484,9 +38820,9 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 125888, - "total_submitted": 214898, - "total_column_articles": 1053, + "total_acs": 127933, + "total_submitted": 218308, + "total_column_articles": 1062, "frontend_question_id": "860", "is_new_question": false }, @@ -38505,9 +38841,9 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 63229, - "total_submitted": 183402, - "total_column_articles": 802, + "total_acs": 63541, + "total_submitted": 184277, + "total_column_articles": 811, "frontend_question_id": "859", "is_new_question": false }, @@ -38526,8 +38862,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 3645, - "total_submitted": 6515, + "total_acs": 3687, + "total_submitted": 6588, "total_column_articles": 58, "frontend_question_id": "858", "is_new_question": false @@ -38547,9 +38883,9 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 3902, - "total_submitted": 8098, - "total_column_articles": 68, + "total_acs": 3954, + "total_submitted": 8199, + "total_column_articles": 70, "frontend_question_id": "857", "is_new_question": false }, @@ -38568,8 +38904,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 19969, - "total_submitted": 31556, + "total_acs": 20122, + "total_submitted": 31820, "total_column_articles": 272, "frontend_question_id": "856", "is_new_question": false @@ -38589,9 +38925,9 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 7668, - "total_submitted": 18786, - "total_column_articles": 75, + "total_acs": 7837, + "total_submitted": 19238, + "total_column_articles": 76, "frontend_question_id": "855", "is_new_question": false }, @@ -38610,8 +38946,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 5128, - "total_submitted": 14064, + "total_acs": 5194, + "total_submitted": 14191, "total_column_articles": 88, "frontend_question_id": "854", "is_new_question": false @@ -38631,9 +38967,9 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 13757, - "total_submitted": 34418, - "total_column_articles": 166, + "total_acs": 13958, + "total_submitted": 34872, + "total_column_articles": 167, "frontend_question_id": "853", "is_new_question": false }, @@ -38652,15 +38988,15 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 112219, - "total_submitted": 161140, - "total_column_articles": 954, + "total_acs": 114106, + "total_submitted": 164142, + "total_column_articles": 969, "frontend_question_id": "852", "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -38673,9 +39009,9 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 27220, - "total_submitted": 43340, - "total_column_articles": 300, + "total_acs": 27346, + "total_submitted": 43536, + "total_column_articles": 303, "frontend_question_id": "851", "is_new_question": false }, @@ -38694,8 +39030,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 3354, - "total_submitted": 7338, + "total_acs": 3782, + "total_submitted": 7837, "total_column_articles": 56, "frontend_question_id": "850", "is_new_question": false @@ -38715,9 +39051,9 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 18442, - "total_submitted": 42537, - "total_column_articles": 234, + "total_acs": 18582, + "total_submitted": 42824, + "total_column_articles": 235, "frontend_question_id": "849", "is_new_question": false }, @@ -38736,9 +39072,9 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 11643, - "total_submitted": 25553, - "total_column_articles": 125, + "total_acs": 11741, + "total_submitted": 25737, + "total_column_articles": 128, "frontend_question_id": "848", "is_new_question": false }, @@ -38757,9 +39093,9 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 22165, - "total_submitted": 32683, - "total_column_articles": 194, + "total_acs": 22446, + "total_submitted": 33054, + "total_column_articles": 197, "frontend_question_id": "847", "is_new_question": false }, @@ -38778,9 +39114,9 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 36403, - "total_submitted": 63642, - "total_column_articles": 494, + "total_acs": 36557, + "total_submitted": 63886, + "total_column_articles": 495, "frontend_question_id": "846", "is_new_question": false }, @@ -38799,9 +39135,9 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 43258, - "total_submitted": 102449, - "total_column_articles": 630, + "total_acs": 43620, + "total_submitted": 103139, + "total_column_articles": 633, "frontend_question_id": "845", "is_new_question": false }, @@ -38820,9 +39156,9 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 142527, - "total_submitted": 290032, - "total_column_articles": 1435, + "total_acs": 145807, + "total_submitted": 297149, + "total_column_articles": 1459, "frontend_question_id": "844", "is_new_question": false }, @@ -38841,8 +39177,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 3677, - "total_submitted": 9513, + "total_acs": 3725, + "total_submitted": 9686, "total_column_articles": 52, "frontend_question_id": "843", "is_new_question": false @@ -38862,9 +39198,9 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 31366, - "total_submitted": 64635, - "total_column_articles": 345, + "total_acs": 31535, + "total_submitted": 65002, + "total_column_articles": 346, "frontend_question_id": "842", "is_new_question": false }, @@ -38883,9 +39219,9 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 68691, - "total_submitted": 103044, - "total_column_articles": 676, + "total_acs": 69513, + "total_submitted": 104145, + "total_column_articles": 687, "frontend_question_id": "841", "is_new_question": false }, @@ -38904,9 +39240,9 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 9969, - "total_submitted": 27412, - "total_column_articles": 128, + "total_acs": 10075, + "total_submitted": 27716, + "total_column_articles": 131, "frontend_question_id": "840", "is_new_question": false }, @@ -38925,9 +39261,9 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 21405, - "total_submitted": 36800, - "total_column_articles": 305, + "total_acs": 21552, + "total_submitted": 37018, + "total_column_articles": 306, "frontend_question_id": "839", "is_new_question": false }, @@ -38946,9 +39282,9 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 36641, - "total_submitted": 65987, - "total_column_articles": 525, + "total_acs": 36805, + "total_submitted": 66284, + "total_column_articles": 526, "frontend_question_id": "838", "is_new_question": false }, @@ -38967,8 +39303,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 20720, - "total_submitted": 52426, + "total_acs": 20783, + "total_submitted": 52552, "total_column_articles": 256, "frontend_question_id": "837", "is_new_question": false @@ -38988,8 +39324,8 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 43655, - "total_submitted": 89933, + "total_acs": 43993, + "total_submitted": 90524, "total_column_articles": 732, "frontend_question_id": "836", "is_new_question": false @@ -39009,8 +39345,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 2637, - "total_submitted": 3550, + "total_acs": 2681, + "total_submitted": 3614, "total_column_articles": 32, "frontend_question_id": "489", "is_new_question": false @@ -39030,8 +39366,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 5169, - "total_submitted": 8985, + "total_acs": 5217, + "total_submitted": 9070, "total_column_articles": 59, "frontend_question_id": "835", "is_new_question": false @@ -39051,9 +39387,9 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 14868, - "total_submitted": 27938, - "total_column_articles": 147, + "total_acs": 14977, + "total_submitted": 28098, + "total_column_articles": 148, "frontend_question_id": "834", "is_new_question": false }, @@ -39072,9 +39408,9 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 6633, - "total_submitted": 15033, - "total_column_articles": 98, + "total_acs": 6716, + "total_submitted": 15188, + "total_column_articles": 100, "frontend_question_id": "833", "is_new_question": false }, @@ -39093,9 +39429,9 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 93340, - "total_submitted": 117454, - "total_column_articles": 1027, + "total_acs": 93650, + "total_submitted": 117814, + "total_column_articles": 1045, "frontend_question_id": "832", "is_new_question": false }, @@ -39114,9 +39450,9 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 84516, - "total_submitted": 190079, - "total_column_articles": 595, + "total_acs": 85502, + "total_submitted": 192351, + "total_column_articles": 610, "frontend_question_id": "622", "is_new_question": false }, @@ -39135,9 +39471,9 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 28372, - "total_submitted": 53512, - "total_column_articles": 329, + "total_acs": 28765, + "total_submitted": 54292, + "total_column_articles": 335, "frontend_question_id": "641", "is_new_question": false }, @@ -39156,8 +39492,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 8953, - "total_submitted": 21444, + "total_acs": 9008, + "total_submitted": 21567, "total_column_articles": 95, "frontend_question_id": "831", "is_new_question": false @@ -39177,9 +39513,9 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 55482, - "total_submitted": 102118, - "total_column_articles": 632, + "total_acs": 55658, + "total_submitted": 102415, + "total_column_articles": 636, "frontend_question_id": "830", "is_new_question": false }, @@ -39198,9 +39534,9 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 28077, - "total_submitted": 59406, - "total_column_articles": 342, + "total_acs": 28246, + "total_submitted": 59823, + "total_column_articles": 343, "frontend_question_id": "829", "is_new_question": false }, @@ -39219,8 +39555,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": 5059, - "total_submitted": 9174, + "total_acs": 5147, + "total_submitted": 9318, "total_column_articles": 82, "frontend_question_id": "828", "is_new_question": false @@ -39240,9 +39576,9 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 14147, - "total_submitted": 35801, - "total_column_articles": 255, + "total_acs": 14507, + "total_submitted": 36614, + "total_column_articles": 265, "frontend_question_id": "827", "is_new_question": false }, @@ -39261,9 +39597,9 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 11556, - "total_submitted": 28666, - "total_column_articles": 168, + "total_acs": 11841, + "total_submitted": 29236, + "total_column_articles": 176, "frontend_question_id": "826", "is_new_question": false }, @@ -39282,8 +39618,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 34340, - "total_submitted": 75106, + "total_acs": 34448, + "total_submitted": 75360, "total_column_articles": 325, "frontend_question_id": "825", "is_new_question": false @@ -39303,9 +39639,9 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 50946, - "total_submitted": 77988, - "total_column_articles": 678, + "total_acs": 51079, + "total_submitted": 78192, + "total_column_articles": 688, "frontend_question_id": "824", "is_new_question": false }, @@ -39324,9 +39660,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": 3965, - "total_submitted": 10624, - "total_column_articles": 77, + "total_acs": 4030, + "total_submitted": 10761, + "total_column_articles": 80, "frontend_question_id": "708", "is_new_question": false }, @@ -39345,8 +39681,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 4035, - "total_submitted": 9412, + "total_acs": 4118, + "total_submitted": 9573, "total_column_articles": 63, "frontend_question_id": "823", "is_new_question": false @@ -39366,8 +39702,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 3808, - "total_submitted": 7458, + "total_acs": 3856, + "total_submitted": 7568, "total_column_articles": 54, "frontend_question_id": "822", "is_new_question": false @@ -39387,9 +39723,9 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 66721, - "total_submitted": 91042, - "total_column_articles": 911, + "total_acs": 67039, + "total_submitted": 91542, + "total_column_articles": 924, "frontend_question_id": "821", "is_new_question": false }, @@ -39408,9 +39744,9 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 62537, - "total_submitted": 121475, - "total_column_articles": 676, + "total_acs": 62941, + "total_submitted": 122116, + "total_column_articles": 689, "frontend_question_id": "820", "is_new_question": false }, @@ -39429,9 +39765,9 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 126384, - "total_submitted": 373827, - "total_column_articles": 809, + "total_acs": 130247, + "total_submitted": 384920, + "total_column_articles": 831, "frontend_question_id": "707", "is_new_question": false }, @@ -39450,9 +39786,9 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 53257, - "total_submitted": 115169, - "total_column_articles": 631, + "total_acs": 53548, + "total_submitted": 115846, + "total_column_articles": 633, "frontend_question_id": "819", "is_new_question": false }, @@ -39471,8 +39807,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 4622, - "total_submitted": 10460, + "total_acs": 4691, + "total_submitted": 10597, "total_column_articles": 51, "frontend_question_id": "818", "is_new_question": false @@ -39492,9 +39828,9 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 15879, - "total_submitted": 26741, - "total_column_articles": 197, + "total_acs": 16011, + "total_submitted": 26981, + "total_column_articles": 198, "frontend_question_id": "817", "is_new_question": false }, @@ -39513,8 +39849,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 4678, - "total_submitted": 9282, + "total_acs": 4748, + "total_submitted": 9422, "total_column_articles": 81, "frontend_question_id": "816", "is_new_question": false @@ -39534,9 +39870,9 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 30721, - "total_submitted": 70809, - "total_column_articles": 347, + "total_acs": 31042, + "total_submitted": 71480, + "total_column_articles": 351, "frontend_question_id": "815", "is_new_question": false }, @@ -39555,8 +39891,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 29454, - "total_submitted": 41936, + "total_acs": 29724, + "total_submitted": 42333, "total_column_articles": 439, "frontend_question_id": "814", "is_new_question": false @@ -39576,9 +39912,9 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 9486, - "total_submitted": 16872, - "total_column_articles": 108, + "total_acs": 9645, + "total_submitted": 17193, + "total_column_articles": 110, "frontend_question_id": "813", "is_new_question": false }, @@ -39597,9 +39933,9 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 32969, - "total_submitted": 47770, - "total_column_articles": 293, + "total_acs": 33090, + "total_submitted": 47956, + "total_column_articles": 294, "frontend_question_id": "812", "is_new_question": false }, @@ -39618,9 +39954,9 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 18096, - "total_submitted": 25385, - "total_column_articles": 237, + "total_acs": 18190, + "total_submitted": 25512, + "total_column_articles": 238, "frontend_question_id": "811", "is_new_question": false }, @@ -39639,9 +39975,9 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 17805, - "total_submitted": 24517, - "total_column_articles": 145, + "total_acs": 17848, + "total_submitted": 24576, + "total_column_articles": 147, "frontend_question_id": "810", "is_new_question": false }, @@ -39660,8 +39996,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 6103, - "total_submitted": 14549, + "total_acs": 6179, + "total_submitted": 14740, "total_column_articles": 105, "frontend_question_id": "809", "is_new_question": false @@ -39681,8 +40017,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 5365, - "total_submitted": 11152, + "total_acs": 5417, + "total_submitted": 11259, "total_column_articles": 46, "frontend_question_id": "808", "is_new_question": false @@ -39702,9 +40038,9 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 48885, - "total_submitted": 55258, - "total_column_articles": 684, + "total_acs": 49226, + "total_submitted": 55694, + "total_column_articles": 694, "frontend_question_id": "807", "is_new_question": false }, @@ -39723,8 +40059,8 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 47926, - "total_submitted": 69393, + "total_acs": 48190, + "total_submitted": 69814, "total_column_articles": 586, "frontend_question_id": "806", "is_new_question": false @@ -39744,9 +40080,9 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 3740, - "total_submitted": 12615, - "total_column_articles": 61, + "total_acs": 3815, + "total_submitted": 12843, + "total_column_articles": 63, "frontend_question_id": "805", "is_new_question": false }, @@ -39765,9 +40101,9 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 72593, - "total_submitted": 88285, - "total_column_articles": 766, + "total_acs": 72858, + "total_submitted": 88603, + "total_column_articles": 776, "frontend_question_id": "804", "is_new_question": false }, @@ -39786,9 +40122,9 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 13261, - "total_submitted": 27835, - "total_column_articles": 141, + "total_acs": 13339, + "total_submitted": 28019, + "total_column_articles": 142, "frontend_question_id": "803", "is_new_question": false }, @@ -39807,9 +40143,9 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 37407, - "total_submitted": 63923, - "total_column_articles": 390, + "total_acs": 37679, + "total_submitted": 64348, + "total_column_articles": 391, "frontend_question_id": "802", "is_new_question": false }, @@ -39828,8 +40164,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 8986, - "total_submitted": 20852, + "total_acs": 9106, + "total_submitted": 21053, "total_column_articles": 113, "frontend_question_id": "801", "is_new_question": false @@ -39849,8 +40185,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 1908, - "total_submitted": 2694, + "total_acs": 1922, + "total_submitted": 2712, "total_column_articles": 47, "frontend_question_id": "800", "is_new_question": false @@ -39870,9 +40206,9 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 79372, - "total_submitted": 124175, - "total_column_articles": 514, + "total_acs": 80222, + "total_submitted": 125535, + "total_column_articles": 518, "frontend_question_id": "706", "is_new_question": false }, @@ -39891,9 +40227,9 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 86641, - "total_submitted": 135692, - "total_column_articles": 536, + "total_acs": 87486, + "total_submitted": 137116, + "total_column_articles": 540, "frontend_question_id": "705", "is_new_question": false }, @@ -39912,9 +40248,9 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 7949, - "total_submitted": 18640, - "total_column_articles": 91, + "total_acs": 8089, + "total_submitted": 18964, + "total_column_articles": 92, "frontend_question_id": "799", "is_new_question": false }, @@ -39933,8 +40269,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 20049, - "total_submitted": 32538, + "total_acs": 20106, + "total_submitted": 32619, "total_column_articles": 209, "frontend_question_id": "798", "is_new_question": false @@ -39954,9 +40290,9 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 72310, - "total_submitted": 91642, - "total_column_articles": 1386, + "total_acs": 73779, + "total_submitted": 93372, + "total_column_articles": 1414, "frontend_question_id": "797", "is_new_question": false }, @@ -39975,9 +40311,9 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 69657, - "total_submitted": 110347, - "total_column_articles": 772, + "total_acs": 70150, + "total_submitted": 111103, + "total_column_articles": 778, "frontend_question_id": "796", "is_new_question": false }, @@ -39996,8 +40332,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 11230, - "total_submitted": 21152, + "total_acs": 11346, + "total_submitted": 21366, "total_column_articles": 120, "frontend_question_id": "795", "is_new_question": false @@ -40017,9 +40353,9 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 29619, - "total_submitted": 76160, - "total_column_articles": 475, + "total_acs": 29673, + "total_submitted": 76347, + "total_column_articles": 476, "frontend_question_id": "794", "is_new_question": false }, @@ -40038,9 +40374,9 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 8531, - "total_submitted": 20919, - "total_column_articles": 104, + "total_acs": 8757, + "total_submitted": 21474, + "total_column_articles": 106, "frontend_question_id": "793", "is_new_question": false }, @@ -40059,9 +40395,9 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 11575, - "total_submitted": 24596, - "total_column_articles": 127, + "total_acs": 11687, + "total_submitted": 24803, + "total_column_articles": 130, "frontend_question_id": "792", "is_new_question": false }, @@ -40080,9 +40416,9 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 14373, - "total_submitted": 20581, - "total_column_articles": 255, + "total_acs": 14501, + "total_submitted": 20756, + "total_column_articles": 257, "frontend_question_id": "791", "is_new_question": false }, @@ -40101,8 +40437,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 5368, - "total_submitted": 11568, + "total_acs": 5430, + "total_submitted": 11699, "total_column_articles": 88, "frontend_question_id": "790", "is_new_question": false @@ -40122,8 +40458,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 22057, - "total_submitted": 32063, + "total_acs": 22106, + "total_submitted": 32137, "total_column_articles": 313, "frontend_question_id": "789", "is_new_question": false @@ -40143,8 +40479,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 20157, - "total_submitted": 32908, + "total_acs": 20252, + "total_submitted": 33057, "total_column_articles": 215, "frontend_question_id": "788", "is_new_question": false @@ -40164,9 +40500,9 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 54279, - "total_submitted": 138945, - "total_column_articles": 498, + "total_acs": 54902, + "total_submitted": 140538, + "total_column_articles": 502, "frontend_question_id": "787", "is_new_question": false }, @@ -40185,9 +40521,9 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 27907, - "total_submitted": 41133, - "total_column_articles": 281, + "total_acs": 28151, + "total_submitted": 41515, + "total_column_articles": 282, "frontend_question_id": "786", "is_new_question": false }, @@ -40206,9 +40542,9 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 58927, - "total_submitted": 110798, - "total_column_articles": 1087, + "total_acs": 59803, + "total_submitted": 112290, + "total_column_articles": 1110, "frontend_question_id": "785", "is_new_question": false }, @@ -40227,9 +40563,9 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 67032, - "total_submitted": 95627, - "total_column_articles": 776, + "total_acs": 67713, + "total_submitted": 96556, + "total_column_articles": 793, "frontend_question_id": "784", "is_new_question": false }, @@ -40248,9 +40584,9 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 77859, - "total_submitted": 129991, - "total_column_articles": 753, + "total_acs": 78197, + "total_submitted": 130505, + "total_column_articles": 763, "frontend_question_id": "783", "is_new_question": false }, @@ -40269,8 +40605,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 1886, - "total_submitted": 4483, + "total_acs": 1901, + "total_submitted": 4524, "total_column_articles": 39, "frontend_question_id": "782", "is_new_question": false @@ -40290,9 +40626,9 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 49134, - "total_submitted": 81519, - "total_column_articles": 728, + "total_acs": 49467, + "total_submitted": 82123, + "total_column_articles": 741, "frontend_question_id": "781", "is_new_question": false }, @@ -40311,8 +40647,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 24727, - "total_submitted": 65294, + "total_acs": 24789, + "total_submitted": 65472, "total_column_articles": 254, "frontend_question_id": "780", "is_new_question": false @@ -40332,9 +40668,9 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 21093, - "total_submitted": 48143, - "total_column_articles": 269, + "total_acs": 21192, + "total_submitted": 48356, + "total_column_articles": 271, "frontend_question_id": "779", "is_new_question": false }, @@ -40353,9 +40689,9 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 28125, - "total_submitted": 47801, - "total_column_articles": 390, + "total_acs": 28312, + "total_submitted": 48124, + "total_column_articles": 391, "frontend_question_id": "778", "is_new_question": false }, @@ -40374,9 +40710,9 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 6765, - "total_submitted": 20793, - "total_column_articles": 77, + "total_acs": 6969, + "total_submitted": 21255, + "total_column_articles": 84, "frontend_question_id": "777", "is_new_question": false }, @@ -40395,9 +40731,9 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 648114, - "total_submitted": 1190674, - "total_column_articles": 3347, + "total_acs": 666476, + "total_submitted": 1223981, + "total_column_articles": 3415, "frontend_question_id": "704", "is_new_question": false }, @@ -40416,9 +40752,9 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 2220, - "total_submitted": 3792, - "total_column_articles": 43, + "total_acs": 2242, + "total_submitted": 3825, + "total_column_articles": 44, "frontend_question_id": "776", "is_new_question": false }, @@ -40437,9 +40773,9 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 6257, - "total_submitted": 13661, - "total_column_articles": 99, + "total_acs": 6314, + "total_submitted": 13765, + "total_column_articles": 101, "frontend_question_id": "775", "is_new_question": false }, @@ -40458,9 +40794,9 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 74996, - "total_submitted": 143977, - "total_column_articles": 707, + "total_acs": 75558, + "total_submitted": 145047, + "total_column_articles": 711, "frontend_question_id": "703", "is_new_question": false }, @@ -40479,8 +40815,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 1701, - "total_submitted": 2726, + "total_acs": 1740, + "total_submitted": 2791, "total_column_articles": 30, "frontend_question_id": "774", "is_new_question": false @@ -40500,9 +40836,9 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 28853, - "total_submitted": 40943, - "total_column_articles": 413, + "total_acs": 29114, + "total_submitted": 41299, + "total_column_articles": 416, "frontend_question_id": "773", "is_new_question": false }, @@ -40521,8 +40857,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": 6328, - "total_submitted": 8516, + "total_acs": 6424, + "total_submitted": 8659, "total_column_articles": 107, "frontend_question_id": "702", "is_new_question": false @@ -40542,9 +40878,9 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 9490, - "total_submitted": 18502, - "total_column_articles": 163, + "total_acs": 9660, + "total_submitted": 18811, + "total_column_articles": 167, "frontend_question_id": "772", "is_new_question": false }, @@ -40563,9 +40899,9 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 132561, - "total_submitted": 184553, - "total_column_articles": 1001, + "total_acs": 135259, + "total_submitted": 188448, + "total_column_articles": 1022, "frontend_question_id": "701", "is_new_question": false }, @@ -40584,9 +40920,9 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 179861, - "total_submitted": 232101, - "total_column_articles": 1313, + "total_acs": 183205, + "total_submitted": 236341, + "total_column_articles": 1362, "frontend_question_id": "700", "is_new_question": false }, @@ -40605,9 +40941,9 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 167622, - "total_submitted": 196759, - "total_column_articles": 1284, + "total_acs": 168361, + "total_submitted": 197593, + "total_column_articles": 1296, "frontend_question_id": "771", "is_new_question": false }, @@ -40626,8 +40962,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 1509, - "total_submitted": 2674, + "total_acs": 1526, + "total_submitted": 2713, "total_column_articles": 32, "frontend_question_id": "770", "is_new_question": false @@ -40647,9 +40983,9 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 17886, - "total_submitted": 30571, - "total_column_articles": 234, + "total_acs": 18074, + "total_submitted": 30877, + "total_column_articles": 235, "frontend_question_id": "769", "is_new_question": false }, @@ -40668,9 +41004,9 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 7745, - "total_submitted": 14829, - "total_column_articles": 110, + "total_acs": 7804, + "total_submitted": 14920, + "total_column_articles": 112, "frontend_question_id": "768", "is_new_question": false }, @@ -40689,9 +41025,9 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 46120, - "total_submitted": 95857, - "total_column_articles": 544, + "total_acs": 46477, + "total_submitted": 96607, + "total_column_articles": 545, "frontend_question_id": "767", "is_new_question": false }, @@ -40710,9 +41046,9 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 61469, - "total_submitted": 87129, - "total_column_articles": 702, + "total_acs": 61770, + "total_submitted": 87566, + "total_column_articles": 714, "frontend_question_id": "766", "is_new_question": false }, @@ -40731,9 +41067,9 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 109700, - "total_submitted": 140557, - "total_column_articles": 822, + "total_acs": 110529, + "total_submitted": 141571, + "total_column_articles": 836, "frontend_question_id": "590", "is_new_question": false }, @@ -40752,9 +41088,9 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 150704, - "total_submitted": 197727, - "total_column_articles": 966, + "total_acs": 153353, + "total_submitted": 201022, + "total_column_articles": 990, "frontend_question_id": "589", "is_new_question": false }, @@ -40773,9 +41109,9 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 113848, - "total_submitted": 152731, - "total_column_articles": 918, + "total_acs": 115254, + "total_submitted": 154592, + "total_column_articles": 934, "frontend_question_id": "559", "is_new_question": false }, @@ -40794,9 +41130,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": 3629, - "total_submitted": 7077, - "total_column_articles": 51, + "total_acs": 3663, + "total_submitted": 7133, + "total_column_articles": 52, "frontend_question_id": "558", "is_new_question": false }, @@ -40815,8 +41151,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 23236, - "total_submitted": 32577, + "total_acs": 23327, + "total_submitted": 32706, "total_column_articles": 305, "frontend_question_id": "427", "is_new_question": false @@ -40836,9 +41172,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": 1408, - "total_submitted": 1894, - "total_column_articles": 38, + "total_acs": 1437, + "total_submitted": 1928, + "total_column_articles": 40, "frontend_question_id": "431", "is_new_question": false }, @@ -40857,9 +41193,9 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 33034, - "total_submitted": 49936, - "total_column_articles": 502, + "total_acs": 33199, + "total_submitted": 50208, + "total_column_articles": 505, "frontend_question_id": "765", "is_new_question": false }, @@ -40878,9 +41214,9 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 5254, - "total_submitted": 10608, - "total_column_articles": 69, + "total_acs": 5344, + "total_submitted": 10765, + "total_column_articles": 70, "frontend_question_id": "764", "is_new_question": false }, @@ -40899,9 +41235,9 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 121108, - "total_submitted": 157834, - "total_column_articles": 1283, + "total_acs": 123170, + "total_submitted": 160428, + "total_column_articles": 1302, "frontend_question_id": "763", "is_new_question": false }, @@ -40920,9 +41256,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": 52020, - "total_submitted": 68736, - "total_column_articles": 452, + "total_acs": 52242, + "total_submitted": 69052, + "total_column_articles": 454, "frontend_question_id": "762", "is_new_question": false }, @@ -40941,9 +41277,9 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 52815, - "total_submitted": 89230, - "total_column_articles": 773, + "total_acs": 53233, + "total_submitted": 89913, + "total_column_articles": 787, "frontend_question_id": "430", "is_new_question": false }, @@ -40962,8 +41298,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 4194, - "total_submitted": 6211, + "total_acs": 4235, + "total_submitted": 6265, "total_column_articles": 72, "frontend_question_id": "428", "is_new_question": false @@ -40983,9 +41319,9 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 120240, - "total_submitted": 166969, - "total_column_articles": 957, + "total_acs": 121857, + "total_submitted": 169088, + "total_column_articles": 975, "frontend_question_id": "429", "is_new_question": false }, @@ -41004,8 +41340,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 2560, - "total_submitted": 4290, + "total_acs": 2587, + "total_submitted": 4332, "total_column_articles": 39, "frontend_question_id": "761", "is_new_question": false @@ -41025,9 +41361,9 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 4833, - "total_submitted": 5776, - "total_column_articles": 111, + "total_acs": 4857, + "total_submitted": 5806, + "total_column_articles": 112, "frontend_question_id": "760", "is_new_question": false }, @@ -41046,9 +41382,9 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 3218, - "total_submitted": 4656, - "total_column_articles": 66, + "total_acs": 3274, + "total_submitted": 4738, + "total_column_articles": 68, "frontend_question_id": "759", "is_new_question": false }, @@ -41067,8 +41403,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 3975, - "total_submitted": 8302, + "total_acs": 4000, + "total_submitted": 8342, "total_column_articles": 76, "frontend_question_id": "758", "is_new_question": false @@ -41088,8 +41424,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 3096, - "total_submitted": 7103, + "total_acs": 3119, + "total_submitted": 7151, "total_column_articles": 47, "frontend_question_id": "757", "is_new_question": false @@ -41109,9 +41445,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": 11002, - "total_submitted": 16219, - "total_column_articles": 169, + "total_acs": 11168, + "total_submitted": 16451, + "total_column_articles": 171, "frontend_question_id": "426", "is_new_question": false }, @@ -41130,8 +41466,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 5562, - "total_submitted": 10226, + "total_acs": 5618, + "total_submitted": 10391, "total_column_articles": 88, "frontend_question_id": "756", "is_new_question": false @@ -41151,8 +41487,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 1620, - "total_submitted": 3305, + "total_acs": 1635, + "total_submitted": 3333, "total_column_articles": 37, "frontend_question_id": "755", "is_new_question": false @@ -41172,9 +41508,9 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 10432, - "total_submitted": 23552, - "total_column_articles": 123, + "total_acs": 10529, + "total_submitted": 23777, + "total_column_articles": 124, "frontend_question_id": "754", "is_new_question": false }, @@ -41193,9 +41529,9 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 4417, - "total_submitted": 7240, - "total_column_articles": 60, + "total_acs": 4451, + "total_submitted": 7294, + "total_column_articles": 61, "frontend_question_id": "753", "is_new_question": false }, @@ -41214,9 +41550,9 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 95504, - "total_submitted": 180513, - "total_column_articles": 967, + "total_acs": 96899, + "total_submitted": 183158, + "total_column_articles": 993, "frontend_question_id": "752", "is_new_question": false }, @@ -41235,8 +41571,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 1616, - "total_submitted": 3381, + "total_acs": 1625, + "total_submitted": 3406, "total_column_articles": 31, "frontend_question_id": "751", "is_new_question": false @@ -41256,8 +41592,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 2727, - "total_submitted": 3783, + "total_acs": 2757, + "total_submitted": 3826, "total_column_articles": 48, "frontend_question_id": "750", "is_new_question": false @@ -41277,8 +41613,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 2048, - "total_submitted": 4053, + "total_acs": 2091, + "total_submitted": 4152, "total_column_articles": 47, "frontend_question_id": "749", "is_new_question": false @@ -41298,9 +41634,9 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 42168, - "total_submitted": 62289, - "total_column_articles": 518, + "total_acs": 42379, + "total_submitted": 62642, + "total_column_articles": 519, "frontend_question_id": "748", "is_new_question": false }, @@ -41319,9 +41655,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": 83977, - "total_submitted": 182886, - "total_column_articles": 844, + "total_acs": 84293, + "total_submitted": 183538, + "total_column_articles": 861, "frontend_question_id": "747", "is_new_question": false }, @@ -41340,9 +41676,9 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 221693, - "total_submitted": 356127, - "total_column_articles": 1896, + "total_acs": 226208, + "total_submitted": 362352, + "total_column_articles": 1918, "frontend_question_id": "746", "is_new_question": false }, @@ -41361,9 +41697,9 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 4165, - "total_submitted": 10090, - "total_column_articles": 78, + "total_acs": 4267, + "total_submitted": 10344, + "total_column_articles": 79, "frontend_question_id": "745", "is_new_question": false }, @@ -41382,9 +41718,9 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 92160, - "total_submitted": 188240, - "total_column_articles": 804, + "total_acs": 93258, + "total_submitted": 190864, + "total_column_articles": 821, "frontend_question_id": "744", "is_new_question": false }, @@ -41403,9 +41739,9 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 81695, - "total_submitted": 150056, - "total_column_articles": 685, + "total_acs": 82654, + "total_submitted": 151790, + "total_column_articles": 699, "frontend_question_id": "743", "is_new_question": false }, @@ -41424,8 +41760,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 2119, - "total_submitted": 4363, + "total_acs": 2125, + "total_submitted": 4393, "total_column_articles": 70, "frontend_question_id": "742", "is_new_question": false @@ -41445,9 +41781,9 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 109030, - "total_submitted": 141012, - "total_column_articles": 798, + "total_acs": 109681, + "total_submitted": 141938, + "total_column_articles": 810, "frontend_question_id": "709", "is_new_question": false }, @@ -41466,9 +41802,9 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 5437, - "total_submitted": 14133, - "total_column_articles": 64, + "total_acs": 16369, + "total_submitted": 32037, + "total_column_articles": 118, "frontend_question_id": "741", "is_new_question": false }, @@ -41487,9 +41823,9 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 80986, - "total_submitted": 129116, - "total_column_articles": 825, + "total_acs": 81598, + "total_submitted": 130047, + "total_column_articles": 837, "frontend_question_id": "740", "is_new_question": false }, @@ -41508,9 +41844,9 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 316302, - "total_submitted": 456486, - "total_column_articles": 2139, + "total_acs": 322459, + "total_submitted": 465118, + "total_column_articles": 2167, "frontend_question_id": "739", "is_new_question": false }, @@ -41529,9 +41865,9 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 62742, - "total_submitted": 125128, - "total_column_articles": 757, + "total_acs": 63952, + "total_submitted": 127562, + "total_column_articles": 772, "frontend_question_id": "738", "is_new_question": false }, @@ -41550,9 +41886,9 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 5120, - "total_submitted": 10793, - "total_column_articles": 93, + "total_acs": 5166, + "total_submitted": 10887, + "total_column_articles": 94, "frontend_question_id": "737", "is_new_question": false }, @@ -41571,9 +41907,9 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 1975, - "total_submitted": 4137, - "total_column_articles": 58, + "total_acs": 12757, + "total_submitted": 18838, + "total_column_articles": 142, "frontend_question_id": "736", "is_new_question": false }, @@ -41592,9 +41928,9 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 31049, - "total_submitted": 75064, - "total_column_articles": 374, + "total_acs": 31648, + "total_submitted": 76534, + "total_column_articles": 382, "frontend_question_id": "735", "is_new_question": false }, @@ -41613,9 +41949,9 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 2773, - "total_submitted": 5820, - "total_column_articles": 53, + "total_acs": 2796, + "total_submitted": 5873, + "total_column_articles": 54, "frontend_question_id": "734", "is_new_question": false }, @@ -41634,9 +41970,9 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 117466, - "total_submitted": 202005, - "total_column_articles": 1002, + "total_acs": 120148, + "total_submitted": 206468, + "total_column_articles": 1014, "frontend_question_id": "733", "is_new_question": false }, @@ -41655,9 +41991,9 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 20458, - "total_submitted": 28118, - "total_column_articles": 207, + "total_acs": 20920, + "total_submitted": 28717, + "total_column_articles": 208, "frontend_question_id": "732", "is_new_question": false }, @@ -41676,9 +42012,9 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 7733, - "total_submitted": 14255, - "total_column_articles": 82, + "total_acs": 8225, + "total_submitted": 15046, + "total_column_articles": 86, "frontend_question_id": "731", "is_new_question": false }, @@ -41697,9 +42033,9 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 16394, - "total_submitted": 25353, - "total_column_articles": 112, + "total_acs": 16526, + "total_submitted": 25556, + "total_column_articles": 115, "frontend_question_id": "730", "is_new_question": false }, @@ -41718,9 +42054,9 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 17251, - "total_submitted": 31187, - "total_column_articles": 203, + "total_acs": 42264, + "total_submitted": 72576, + "total_column_articles": 382, "frontend_question_id": "729", "is_new_question": false }, @@ -41739,9 +42075,9 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 71829, - "total_submitted": 91120, - "total_column_articles": 667, + "total_acs": 72188, + "total_submitted": 91629, + "total_column_articles": 678, "frontend_question_id": "728", "is_new_question": false }, @@ -41760,9 +42096,9 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 4623, - "total_submitted": 11187, - "total_column_articles": 66, + "total_acs": 4698, + "total_submitted": 11402, + "total_column_articles": 67, "frontend_question_id": "727", "is_new_question": false }, @@ -41781,9 +42117,9 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 24416, - "total_submitted": 44293, - "total_column_articles": 438, + "total_acs": 24545, + "total_submitted": 44511, + "total_column_articles": 442, "frontend_question_id": "726", "is_new_question": false }, @@ -41802,9 +42138,9 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 55016, - "total_submitted": 90799, - "total_column_articles": 691, + "total_acs": 55314, + "total_submitted": 91306, + "total_column_articles": 702, "frontend_question_id": "725", "is_new_question": false }, @@ -41823,9 +42159,9 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 192367, - "total_submitted": 390916, - "total_column_articles": 1109, + "total_acs": 199565, + "total_submitted": 403261, + "total_column_articles": 1159, "frontend_question_id": "724", "is_new_question": false }, @@ -41844,9 +42180,9 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 1795, - "total_submitted": 2443, - "total_column_articles": 46, + "total_acs": 1804, + "total_submitted": 2475, + "total_column_articles": 47, "frontend_question_id": "723", "is_new_question": false }, @@ -41865,8 +42201,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 6413, - "total_submitted": 19592, + "total_acs": 6461, + "total_submitted": 19738, "total_column_articles": 87, "frontend_question_id": "722", "is_new_question": false @@ -41886,9 +42222,9 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 33916, - "total_submitted": 71281, - "total_column_articles": 376, + "total_acs": 34231, + "total_submitted": 71879, + "total_column_articles": 381, "frontend_question_id": "721", "is_new_question": false }, @@ -41907,15 +42243,15 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 60153, - "total_submitted": 116084, - "total_column_articles": 655, + "total_acs": 60772, + "total_submitted": 117249, + "total_column_articles": 658, "frontend_question_id": "720", "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -41928,9 +42264,9 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 29936, - "total_submitted": 64531, - "total_column_articles": 252, + "total_acs": 30154, + "total_submitted": 64971, + "total_column_articles": 253, "frontend_question_id": "719", "is_new_question": false }, @@ -41949,9 +42285,9 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 133609, - "total_submitted": 234818, - "total_column_articles": 815, + "total_acs": 136667, + "total_submitted": 239913, + "total_column_articles": 838, "frontend_question_id": "718", "is_new_question": false }, @@ -41970,9 +42306,9 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 62994, - "total_submitted": 113604, - "total_column_articles": 756, + "total_acs": 63250, + "total_submitted": 114065, + "total_column_articles": 769, "frontend_question_id": "717", "is_new_question": false }, @@ -41991,9 +42327,9 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 6154, - "total_submitted": 12976, - "total_column_articles": 100, + "total_acs": 6221, + "total_submitted": 13104, + "total_column_articles": 101, "frontend_question_id": "716", "is_new_question": false }, @@ -42012,9 +42348,9 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 16377, - "total_submitted": 30517, - "total_column_articles": 176, + "total_acs": 16609, + "total_submitted": 31002, + "total_column_articles": 178, "frontend_question_id": "715", "is_new_question": false }, @@ -42033,9 +42369,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": 157375, - "total_submitted": 212373, - "total_column_articles": 1022, + "total_acs": 160365, + "total_submitted": 216164, + "total_column_articles": 1035, "frontend_question_id": "714", "is_new_question": false }, @@ -42054,9 +42390,9 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 79628, - "total_submitted": 163405, - "total_column_articles": 736, + "total_acs": 80696, + "total_submitted": 165511, + "total_column_articles": 749, "frontend_question_id": "713", "is_new_question": false }, @@ -42075,9 +42411,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": 23080, - "total_submitted": 33904, - "total_column_articles": 257, + "total_acs": 23449, + "total_submitted": 34471, + "total_column_articles": 259, "frontend_question_id": "712", "is_new_question": false }, @@ -42096,8 +42432,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 1086, - "total_submitted": 1900, + "total_acs": 1106, + "total_submitted": 1927, "total_column_articles": 33, "frontend_question_id": "711", "is_new_question": false @@ -42117,9 +42453,9 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 20254, - "total_submitted": 36726, - "total_column_articles": 203, + "total_acs": 20335, + "total_submitted": 36885, + "total_column_articles": 204, "frontend_question_id": "699", "is_new_question": false }, @@ -42138,9 +42474,9 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 53050, - "total_submitted": 127378, - "total_column_articles": 890, + "total_acs": 54427, + "total_submitted": 130906, + "total_column_articles": 916, "frontend_question_id": "698", "is_new_question": false }, @@ -42159,9 +42495,9 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 77366, - "total_submitted": 128751, - "total_column_articles": 968, + "total_acs": 77869, + "total_submitted": 129669, + "total_column_articles": 980, "frontend_question_id": "697", "is_new_question": false }, @@ -42180,9 +42516,9 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 61149, - "total_submitted": 95956, - "total_column_articles": 549, + "total_acs": 61626, + "total_submitted": 96726, + "total_column_articles": 552, "frontend_question_id": "696", "is_new_question": false }, @@ -42201,9 +42537,9 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 215665, - "total_submitted": 318595, - "total_column_articles": 2080, + "total_acs": 219370, + "total_submitted": 323997, + "total_column_articles": 2101, "frontend_question_id": "695", "is_new_question": false }, @@ -42222,9 +42558,9 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 7619, - "total_submitted": 13638, - "total_column_articles": 140, + "total_acs": 7816, + "total_submitted": 13984, + "total_column_articles": 142, "frontend_question_id": "694", "is_new_question": false }, @@ -42243,9 +42579,9 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 70009, - "total_submitted": 107088, - "total_column_articles": 754, + "total_acs": 70361, + "total_submitted": 107671, + "total_column_articles": 765, "frontend_question_id": "693", "is_new_question": false }, @@ -42264,9 +42600,9 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 84175, - "total_submitted": 148286, - "total_column_articles": 907, + "total_acs": 85509, + "total_submitted": 150431, + "total_column_articles": 927, "frontend_question_id": "692", "is_new_question": false }, @@ -42285,9 +42621,9 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 20896, - "total_submitted": 33877, - "total_column_articles": 182, + "total_acs": 21014, + "total_submitted": 34128, + "total_column_articles": 184, "frontend_question_id": "691", "is_new_question": false }, @@ -42306,9 +42642,9 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 61013, - "total_submitted": 93498, - "total_column_articles": 627, + "total_acs": 61247, + "total_submitted": 93785, + "total_column_articles": 628, "frontend_question_id": "690", "is_new_question": false }, @@ -42327,8 +42663,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": 21302, - "total_submitted": 37781, + "total_acs": 21355, + "total_submitted": 37879, "total_column_articles": 279, "frontend_question_id": "689", "is_new_question": false @@ -42348,9 +42684,9 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 32772, - "total_submitted": 56248, - "total_column_articles": 363, + "total_acs": 32923, + "total_submitted": 56534, + "total_column_articles": 365, "frontend_question_id": "688", "is_new_question": false }, @@ -42369,9 +42705,9 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 46819, - "total_submitted": 103787, - "total_column_articles": 338, + "total_acs": 47349, + "total_submitted": 104800, + "total_column_articles": 341, "frontend_question_id": "687", "is_new_question": false }, @@ -42390,9 +42726,9 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 45746, - "total_submitted": 114018, - "total_column_articles": 594, + "total_acs": 45988, + "total_submitted": 114925, + "total_column_articles": 595, "frontend_question_id": "686", "is_new_question": false }, @@ -42411,9 +42747,9 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 23474, - "total_submitted": 55382, - "total_column_articles": 299, + "total_acs": 23695, + "total_submitted": 55920, + "total_column_articles": 301, "frontend_question_id": "685", "is_new_question": false }, @@ -42432,9 +42768,9 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 76798, - "total_submitted": 114382, - "total_column_articles": 777, + "total_acs": 77749, + "total_submitted": 115688, + "total_column_articles": 787, "frontend_question_id": "684", "is_new_question": false }, @@ -42453,8 +42789,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 3228, - "total_submitted": 7141, + "total_acs": 3268, + "total_submitted": 7219, "total_column_articles": 69, "frontend_question_id": "683", "is_new_question": false @@ -42474,9 +42810,9 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 82441, - "total_submitted": 114394, - "total_column_articles": 899, + "total_acs": 82925, + "total_submitted": 115167, + "total_column_articles": 900, "frontend_question_id": "682", "is_new_question": false }, @@ -42495,8 +42831,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 3477, - "total_submitted": 6959, + "total_acs": 3615, + "total_submitted": 7309, "total_column_articles": 81, "frontend_question_id": "681", "is_new_question": false @@ -42516,9 +42852,9 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 112633, - "total_submitted": 280615, - "total_column_articles": 1022, + "total_acs": 113814, + "total_submitted": 283567, + "total_column_articles": 1032, "frontend_question_id": "680", "is_new_question": false }, @@ -42537,9 +42873,9 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 33574, - "total_submitted": 62395, - "total_column_articles": 326, + "total_acs": 34053, + "total_submitted": 63207, + "total_column_articles": 329, "frontend_question_id": "679", "is_new_question": false }, @@ -42558,9 +42894,9 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 56107, - "total_submitted": 143938, - "total_column_articles": 571, + "total_acs": 56664, + "total_submitted": 145373, + "total_column_articles": 573, "frontend_question_id": "678", "is_new_question": false }, @@ -42579,9 +42915,9 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 41882, - "total_submitted": 63103, - "total_column_articles": 613, + "total_acs": 42502, + "total_submitted": 64096, + "total_column_articles": 624, "frontend_question_id": "677", "is_new_question": false }, @@ -42600,9 +42936,9 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 11473, - "total_submitted": 19092, - "total_column_articles": 196, + "total_acs": 33501, + "total_submitted": 51036, + "total_column_articles": 427, "frontend_question_id": "676", "is_new_question": false }, @@ -42621,8 +42957,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 19928, - "total_submitted": 37053, + "total_acs": 19988, + "total_submitted": 37206, "total_column_articles": 208, "frontend_question_id": "675", "is_new_question": false @@ -42642,9 +42978,9 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 136016, - "total_submitted": 256026, - "total_column_articles": 1049, + "total_acs": 138913, + "total_submitted": 260687, + "total_column_articles": 1070, "frontend_question_id": "674", "is_new_question": false }, @@ -42663,9 +42999,9 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 66865, - "total_submitted": 151084, - "total_column_articles": 543, + "total_acs": 67889, + "total_submitted": 153257, + "total_column_articles": 544, "frontend_question_id": "673", "is_new_question": false }, @@ -42684,8 +43020,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 4876, - "total_submitted": 9031, + "total_acs": 4914, + "total_submitted": 9109, "total_column_articles": 56, "frontend_question_id": "672", "is_new_question": false @@ -42705,9 +43041,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": 61910, - "total_submitted": 128270, - "total_column_articles": 780, + "total_acs": 62243, + "total_submitted": 129149, + "total_column_articles": 794, "frontend_question_id": "671", "is_new_question": false }, @@ -42726,9 +43062,9 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 27382, - "total_submitted": 59338, - "total_column_articles": 393, + "total_acs": 27945, + "total_submitted": 60532, + "total_column_articles": 395, "frontend_question_id": "670", "is_new_question": false }, @@ -42747,9 +43083,9 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 65646, - "total_submitted": 98346, - "total_column_articles": 491, + "total_acs": 67394, + "total_submitted": 100950, + "total_column_articles": 498, "frontend_question_id": "669", "is_new_question": false }, @@ -42768,8 +43104,8 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 28065, - "total_submitted": 47860, + "total_acs": 28149, + "total_submitted": 47993, "total_column_articles": 259, "frontend_question_id": "668", "is_new_question": false @@ -42789,8 +43125,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 9790, - "total_submitted": 15743, + "total_acs": 9886, + "total_submitted": 15897, "total_column_articles": 147, "frontend_question_id": "667", "is_new_question": false @@ -42810,8 +43146,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 2837, - "total_submitted": 4604, + "total_acs": 2866, + "total_submitted": 4641, "total_column_articles": 95, "frontend_question_id": "666", "is_new_question": false @@ -42831,9 +43167,9 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 86547, - "total_submitted": 314869, - "total_column_articles": 1042, + "total_acs": 87094, + "total_submitted": 316658, + "total_column_articles": 1054, "frontend_question_id": "665", "is_new_question": false }, @@ -42852,9 +43188,9 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 24183, - "total_submitted": 36994, - "total_column_articles": 205, + "total_acs": 24292, + "total_submitted": 37135, + "total_column_articles": 206, "frontend_question_id": "664", "is_new_question": false }, @@ -42873,8 +43209,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 2362, - "total_submitted": 5185, + "total_acs": 2375, + "total_submitted": 5217, "total_column_articles": 51, "frontend_question_id": "663", "is_new_question": false @@ -42894,9 +43230,9 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 48037, - "total_submitted": 116834, - "total_column_articles": 429, + "total_acs": 49077, + "total_submitted": 119306, + "total_column_articles": 434, "frontend_question_id": "662", "is_new_question": false }, @@ -42915,8 +43251,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 47257, - "total_submitted": 73169, + "total_acs": 47474, + "total_submitted": 73571, "total_column_articles": 507, "frontend_question_id": "661", "is_new_question": false @@ -42936,9 +43272,9 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 1021, - "total_submitted": 1573, - "total_column_articles": 29, + "total_acs": 1037, + "total_submitted": 1593, + "total_column_articles": 30, "frontend_question_id": "660", "is_new_question": false }, @@ -42957,9 +43293,9 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 32117, - "total_submitted": 59122, - "total_column_articles": 302, + "total_acs": 32303, + "total_submitted": 59493, + "total_column_articles": 303, "frontend_question_id": "659", "is_new_question": false }, @@ -42978,9 +43314,9 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 41505, - "total_submitted": 90490, - "total_column_articles": 364, + "total_acs": 42208, + "total_submitted": 91958, + "total_column_articles": 372, "frontend_question_id": "658", "is_new_question": false }, @@ -42999,9 +43335,9 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 90960, - "total_submitted": 115885, - "total_column_articles": 708, + "total_acs": 91583, + "total_submitted": 116661, + "total_column_articles": 721, "frontend_question_id": "657", "is_new_question": false }, @@ -43020,8 +43356,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 1174, - "total_submitted": 3594, + "total_acs": 1190, + "total_submitted": 3631, "total_column_articles": 31, "frontend_question_id": "656", "is_new_question": false @@ -43041,9 +43377,9 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 11866, - "total_submitted": 19658, - "total_column_articles": 199, + "total_acs": 11971, + "total_submitted": 19800, + "total_column_articles": 200, "frontend_question_id": "655", "is_new_question": false }, @@ -43062,9 +43398,9 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 109433, - "total_submitted": 134644, - "total_column_articles": 970, + "total_acs": 112022, + "total_submitted": 137648, + "total_column_articles": 995, "frontend_question_id": "654", "is_new_question": false }, @@ -43083,9 +43419,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": 94141, - "total_submitted": 148920, - "total_column_articles": 838, + "total_acs": 95054, + "total_submitted": 150307, + "total_column_articles": 856, "frontend_question_id": "653", "is_new_question": false }, @@ -43104,9 +43440,9 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 53913, - "total_submitted": 92427, - "total_column_articles": 372, + "total_acs": 54920, + "total_submitted": 94031, + "total_column_articles": 375, "frontend_question_id": "652", "is_new_question": false }, @@ -43125,8 +43461,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 5196, - "total_submitted": 8823, + "total_acs": 5243, + "total_submitted": 8910, "total_column_articles": 83, "frontend_question_id": "651", "is_new_question": false @@ -43146,9 +43482,9 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 58188, - "total_submitted": 101754, - "total_column_articles": 723, + "total_acs": 58646, + "total_submitted": 102520, + "total_column_articles": 733, "frontend_question_id": "650", "is_new_question": false }, @@ -43167,9 +43503,9 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 32617, - "total_submitted": 68052, - "total_column_articles": 341, + "total_acs": 32964, + "total_submitted": 68781, + "total_column_articles": 343, "frontend_question_id": "649", "is_new_question": false }, @@ -43188,9 +43524,9 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 29538, - "total_submitted": 49145, - "total_column_articles": 384, + "total_acs": 57699, + "total_submitted": 89549, + "total_column_articles": 699, "frontend_question_id": "648", "is_new_question": false }, @@ -43209,9 +43545,9 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 195458, - "total_submitted": 294003, - "total_column_articles": 1320, + "total_acs": 199863, + "total_submitted": 300482, + "total_column_articles": 1344, "frontend_question_id": "647", "is_new_question": false }, @@ -43230,9 +43566,9 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 29800, - "total_submitted": 51051, - "total_column_articles": 271, + "total_acs": 30179, + "total_submitted": 51643, + "total_column_articles": 273, "frontend_question_id": "646", "is_new_question": false }, @@ -43251,9 +43587,9 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 84579, - "total_submitted": 202862, - "total_column_articles": 836, + "total_acs": 85287, + "total_submitted": 204732, + "total_column_articles": 851, "frontend_question_id": "645", "is_new_question": false }, @@ -43272,8 +43608,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 1685, - "total_submitted": 3952, + "total_acs": 1731, + "total_submitted": 4032, "total_column_articles": 34, "frontend_question_id": "644", "is_new_question": false @@ -43293,9 +43629,9 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 82034, - "total_submitted": 185460, - "total_column_articles": 742, + "total_acs": 83203, + "total_submitted": 188420, + "total_column_articles": 761, "frontend_question_id": "643", "is_new_question": false }, @@ -43314,9 +43650,9 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 4364, - "total_submitted": 7795, - "total_column_articles": 77, + "total_acs": 4460, + "total_submitted": 7980, + "total_column_articles": 81, "frontend_question_id": "642", "is_new_question": false }, @@ -43335,9 +43671,9 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 12784, - "total_submitted": 30102, - "total_column_articles": 259, + "total_acs": 12867, + "total_submitted": 30324, + "total_column_articles": 261, "frontend_question_id": "640", "is_new_question": false }, @@ -43356,8 +43692,8 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 21544, - "total_submitted": 57466, + "total_acs": 21609, + "total_submitted": 57643, "total_column_articles": 293, "frontend_question_id": "639", "is_new_question": false @@ -43377,9 +43713,9 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 31836, - "total_submitted": 49437, - "total_column_articles": 302, + "total_acs": 32027, + "total_submitted": 49793, + "total_column_articles": 304, "frontend_question_id": "638", "is_new_question": false }, @@ -43398,9 +43734,9 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 107087, - "total_submitted": 153967, - "total_column_articles": 863, + "total_acs": 108617, + "total_submitted": 156089, + "total_column_articles": 880, "frontend_question_id": "637", "is_new_question": false }, @@ -43419,9 +43755,9 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 13005, - "total_submitted": 22724, - "total_column_articles": 147, + "total_acs": 13131, + "total_submitted": 22936, + "total_column_articles": 148, "frontend_question_id": "636", "is_new_question": false }, @@ -43440,9 +43776,9 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 5492, - "total_submitted": 9757, - "total_column_articles": 89, + "total_acs": 5555, + "total_submitted": 9870, + "total_column_articles": 92, "frontend_question_id": "635", "is_new_question": false }, @@ -43461,8 +43797,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 1874, - "total_submitted": 4055, + "total_acs": 1885, + "total_submitted": 4090, "total_column_articles": 23, "frontend_question_id": "634", "is_new_question": false @@ -43482,9 +43818,9 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 113991, - "total_submitted": 293415, - "total_column_articles": 920, + "total_acs": 114954, + "total_submitted": 295968, + "total_column_articles": 935, "frontend_question_id": "633", "is_new_question": false }, @@ -43503,9 +43839,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": 21912, - "total_submitted": 36296, - "total_column_articles": 281, + "total_acs": 22058, + "total_submitted": 36498, + "total_column_articles": 283, "frontend_question_id": "632", "is_new_question": false }, @@ -43524,8 +43860,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 1474, - "total_submitted": 4622, + "total_acs": 1482, + "total_submitted": 4635, "total_column_articles": 42, "frontend_question_id": "631", "is_new_question": false @@ -43545,9 +43881,9 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 26159, - "total_submitted": 56518, - "total_column_articles": 242, + "total_acs": 26256, + "total_submitted": 56737, + "total_column_articles": 244, "frontend_question_id": "630", "is_new_question": false }, @@ -43566,9 +43902,9 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 20000, - "total_submitted": 38702, - "total_column_articles": 183, + "total_acs": 20071, + "total_submitted": 38846, + "total_column_articles": 185, "frontend_question_id": "629", "is_new_question": false }, @@ -43587,9 +43923,9 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 96519, - "total_submitted": 184429, - "total_column_articles": 906, + "total_acs": 97452, + "total_submitted": 186251, + "total_column_articles": 927, "frontend_question_id": "628", "is_new_question": false }, @@ -43608,9 +43944,9 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 119424, - "total_submitted": 147268, - "total_column_articles": 482, + "total_acs": 122713, + "total_submitted": 151142, + "total_column_articles": 491, "frontend_question_id": "627", "is_new_question": false }, @@ -43629,9 +43965,9 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 57607, - "total_submitted": 84565, - "total_column_articles": 475, + "total_acs": 58337, + "total_submitted": 85565, + "total_column_articles": 483, "frontend_question_id": "626", "is_new_question": false }, @@ -43650,8 +43986,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 2976, - "total_submitted": 8594, + "total_acs": 2988, + "total_submitted": 8650, "total_column_articles": 59, "frontend_question_id": "625", "is_new_question": false @@ -43671,9 +44007,9 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 2771, - "total_submitted": 6354, - "total_column_articles": 60, + "total_acs": 2795, + "total_submitted": 6436, + "total_column_articles": 63, "frontend_question_id": "624", "is_new_question": false }, @@ -43692,8 +44028,8 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 14482, - "total_submitted": 26432, + "total_acs": 14653, + "total_submitted": 26694, "total_column_articles": 256, "frontend_question_id": "623", "is_new_question": false @@ -43713,9 +44049,9 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 104686, - "total_submitted": 179119, - "total_column_articles": 674, + "total_acs": 106651, + "total_submitted": 182235, + "total_column_articles": 684, "frontend_question_id": "621", "is_new_question": false }, @@ -43734,9 +44070,9 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 112827, - "total_submitted": 146108, - "total_column_articles": 391, + "total_acs": 113636, + "total_submitted": 147157, + "total_column_articles": 394, "frontend_question_id": "620", "is_new_question": false }, @@ -43755,9 +44091,9 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 17565, - "total_submitted": 38083, - "total_column_articles": 120, + "total_acs": 17989, + "total_submitted": 38957, + "total_column_articles": 125, "frontend_question_id": "619", "is_new_question": false }, @@ -43776,9 +44112,9 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 7027, - "total_submitted": 11383, - "total_column_articles": 67, + "total_acs": 7208, + "total_submitted": 11665, + "total_column_articles": 68, "frontend_question_id": "618", "is_new_question": false }, @@ -43797,9 +44133,9 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 298188, - "total_submitted": 377399, - "total_column_articles": 1895, + "total_acs": 303410, + "total_submitted": 383983, + "total_column_articles": 1925, "frontend_question_id": "617", "is_new_question": false }, @@ -43818,8 +44154,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 4793, - "total_submitted": 9913, + "total_acs": 4823, + "total_submitted": 9966, "total_column_articles": 77, "frontend_question_id": "616", "is_new_question": false @@ -43839,9 +44175,9 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 8124, - "total_submitted": 19551, - "total_column_articles": 129, + "total_acs": 8264, + "total_submitted": 19867, + "total_column_articles": 130, "frontend_question_id": "615", "is_new_question": false }, @@ -43860,8 +44196,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 12428, - "total_submitted": 34393, + "total_acs": 12640, + "total_submitted": 34867, "total_column_articles": 96, "frontend_question_id": "614", "is_new_question": false @@ -43881,8 +44217,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 16249, - "total_submitted": 20315, + "total_acs": 16451, + "total_submitted": 20577, "total_column_articles": 109, "frontend_question_id": "613", "is_new_question": false @@ -43902,9 +44238,9 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 11061, - "total_submitted": 16840, - "total_column_articles": 89, + "total_acs": 11229, + "total_submitted": 17103, + "total_column_articles": 90, "frontend_question_id": "612", "is_new_question": false }, @@ -43923,9 +44259,9 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 69956, - "total_submitted": 130522, - "total_column_articles": 521, + "total_acs": 71085, + "total_submitted": 132538, + "total_column_articles": 527, "frontend_question_id": "611", "is_new_question": false }, @@ -43944,9 +44280,9 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 15081, - "total_submitted": 23548, - "total_column_articles": 97, + "total_acs": 15299, + "total_submitted": 23924, + "total_column_articles": 99, "frontend_question_id": "610", "is_new_question": false }, @@ -43965,9 +44301,9 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 8275, - "total_submitted": 16416, - "total_column_articles": 133, + "total_acs": 8371, + "total_submitted": 16605, + "total_column_articles": 134, "frontend_question_id": "609", "is_new_question": false }, @@ -43986,9 +44322,9 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 22744, - "total_submitted": 35751, - "total_column_articles": 214, + "total_acs": 24626, + "total_submitted": 38792, + "total_column_articles": 227, "frontend_question_id": "608", "is_new_question": false }, @@ -44007,9 +44343,9 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 30154, - "total_submitted": 44251, - "total_column_articles": 196, + "total_acs": 32179, + "total_submitted": 47181, + "total_column_articles": 202, "frontend_question_id": "607", "is_new_question": false }, @@ -44028,9 +44364,9 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 63031, - "total_submitted": 100048, - "total_column_articles": 672, + "total_acs": 63361, + "total_submitted": 100604, + "total_column_articles": 684, "frontend_question_id": "606", "is_new_question": false }, @@ -44049,9 +44385,9 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 136428, - "total_submitted": 414947, - "total_column_articles": 1537, + "total_acs": 137614, + "total_submitted": 418893, + "total_column_articles": 1547, "frontend_question_id": "605", "is_new_question": false }, @@ -44070,9 +44406,9 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 3161, - "total_submitted": 8279, - "total_column_articles": 76, + "total_acs": 3200, + "total_submitted": 8355, + "total_column_articles": 78, "frontend_question_id": "604", "is_new_question": false }, @@ -44091,9 +44427,9 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 19546, - "total_submitted": 30097, - "total_column_articles": 178, + "total_acs": 19967, + "total_submitted": 30795, + "total_column_articles": 182, "frontend_question_id": "603", "is_new_question": false }, @@ -44112,9 +44448,9 @@ "question__title": "Friend Requests II: Who Has the Most Friends", "question__title_slug": "friend-requests-ii-who-has-the-most-friends", "question__hide": false, - "total_acs": 12434, - "total_submitted": 20659, - "total_column_articles": 118, + "total_acs": 12654, + "total_submitted": 21024, + "total_column_articles": 121, "frontend_question_id": "602", "is_new_question": false }, @@ -44133,9 +44469,9 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 40548, - "total_submitted": 83917, - "total_column_articles": 484, + "total_acs": 40912, + "total_submitted": 85215, + "total_column_articles": 487, "frontend_question_id": "601", "is_new_question": false }, @@ -44154,9 +44490,9 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 21086, - "total_submitted": 43562, - "total_column_articles": 255, + "total_acs": 21154, + "total_submitted": 43695, + "total_column_articles": 257, "frontend_question_id": "600", "is_new_question": false }, @@ -44175,9 +44511,9 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 75703, - "total_submitted": 132449, - "total_column_articles": 661, + "total_acs": 76472, + "total_submitted": 133806, + "total_column_articles": 673, "frontend_question_id": "599", "is_new_question": false }, @@ -44196,9 +44532,9 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 46155, - "total_submitted": 80474, - "total_column_articles": 539, + "total_acs": 46426, + "total_submitted": 80929, + "total_column_articles": 541, "frontend_question_id": "598", "is_new_question": false }, @@ -44217,9 +44553,9 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 15219, - "total_submitted": 34704, - "total_column_articles": 111, + "total_acs": 15458, + "total_submitted": 35274, + "total_column_articles": 112, "frontend_question_id": "597", "is_new_question": false }, @@ -44238,9 +44574,9 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 111382, - "total_submitted": 238490, - "total_column_articles": 386, + "total_acs": 113724, + "total_submitted": 242114, + "total_column_articles": 392, "frontend_question_id": "596", "is_new_question": false }, @@ -44259,9 +44595,9 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 161620, - "total_submitted": 227058, - "total_column_articles": 380, + "total_acs": 168380, + "total_submitted": 238309, + "total_column_articles": 397, "frontend_question_id": "595", "is_new_question": false }, @@ -44280,9 +44616,9 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 68986, - "total_submitted": 121971, - "total_column_articles": 607, + "total_acs": 69497, + "total_submitted": 122957, + "total_column_articles": 610, "frontend_question_id": "594", "is_new_question": false }, @@ -44301,9 +44637,9 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 10956, - "total_submitted": 24825, - "total_column_articles": 174, + "total_acs": 11068, + "total_submitted": 25068, + "total_column_articles": 175, "frontend_question_id": "593", "is_new_question": false }, @@ -44322,9 +44658,9 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 6147, - "total_submitted": 11664, - "total_column_articles": 149, + "total_acs": 6232, + "total_submitted": 11809, + "total_column_articles": 150, "frontend_question_id": "592", "is_new_question": false }, @@ -44343,9 +44679,9 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 16532, - "total_submitted": 31603, - "total_column_articles": 191, + "total_acs": 16566, + "total_submitted": 31670, + "total_column_articles": 192, "frontend_question_id": "591", "is_new_question": false }, @@ -44364,9 +44700,9 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 2457, - "total_submitted": 5807, - "total_column_articles": 45, + "total_acs": 2505, + "total_submitted": 5902, + "total_column_articles": 46, "frontend_question_id": "588", "is_new_question": false }, @@ -44385,8 +44721,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 16506, - "total_submitted": 26784, + "total_acs": 16526, + "total_submitted": 26835, "total_column_articles": 129, "frontend_question_id": "587", "is_new_question": false @@ -44406,9 +44742,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": 34702, - "total_submitted": 47766, - "total_column_articles": 181, + "total_acs": 36746, + "total_submitted": 50754, + "total_column_articles": 187, "frontend_question_id": "586", "is_new_question": false }, @@ -44427,9 +44763,9 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 12457, - "total_submitted": 24861, - "total_column_articles": 143, + "total_acs": 12633, + "total_submitted": 25267, + "total_column_articles": 145, "frontend_question_id": "585", "is_new_question": false }, @@ -44448,9 +44784,9 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 54341, - "total_submitted": 77976, - "total_column_articles": 201, + "total_acs": 59656, + "total_submitted": 85967, + "total_column_articles": 212, "frontend_question_id": "584", "is_new_question": false }, @@ -44469,9 +44805,9 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 84398, - "total_submitted": 129600, - "total_column_articles": 727, + "total_acs": 86311, + "total_submitted": 132281, + "total_column_articles": 748, "frontend_question_id": "583", "is_new_question": false }, @@ -44490,9 +44826,9 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 10867, - "total_submitted": 24778, - "total_column_articles": 168, + "total_acs": 10971, + "total_submitted": 24966, + "total_column_articles": 171, "frontend_question_id": "582", "is_new_question": false }, @@ -44511,9 +44847,9 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 137011, - "total_submitted": 332074, - "total_column_articles": 1116, + "total_acs": 139376, + "total_submitted": 337357, + "total_column_articles": 1133, "frontend_question_id": "581", "is_new_question": false }, @@ -44532,9 +44868,9 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 16638, - "total_submitted": 31713, - "total_column_articles": 117, + "total_acs": 17005, + "total_submitted": 32363, + "total_column_articles": 121, "frontend_question_id": "580", "is_new_question": false }, @@ -44553,9 +44889,9 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 11343, - "total_submitted": 26691, - "total_column_articles": 170, + "total_acs": 11531, + "total_submitted": 27042, + "total_column_articles": 172, "frontend_question_id": "579", "is_new_question": false }, @@ -44574,9 +44910,9 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 15366, - "total_submitted": 33335, - "total_column_articles": 160, + "total_acs": 15611, + "total_submitted": 34186, + "total_column_articles": 163, "frontend_question_id": "578", "is_new_question": false }, @@ -44595,9 +44931,9 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 23376, - "total_submitted": 33739, - "total_column_articles": 125, + "total_acs": 23661, + "total_submitted": 34169, + "total_column_articles": 127, "frontend_question_id": "577", "is_new_question": false }, @@ -44616,9 +44952,9 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 31012, - "total_submitted": 65964, - "total_column_articles": 335, + "total_acs": 31248, + "total_submitted": 66418, + "total_column_articles": 340, "frontend_question_id": "576", "is_new_question": false }, @@ -44637,9 +44973,9 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 97312, - "total_submitted": 137190, - "total_column_articles": 920, + "total_acs": 97988, + "total_submitted": 138219, + "total_column_articles": 934, "frontend_question_id": "575", "is_new_question": false }, @@ -44658,9 +44994,9 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 18838, - "total_submitted": 28557, - "total_column_articles": 142, + "total_acs": 19100, + "total_submitted": 28943, + "total_column_articles": 144, "frontend_question_id": "574", "is_new_question": false }, @@ -44679,8 +45015,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 1414, - "total_submitted": 2182, + "total_acs": 1424, + "total_submitted": 2202, "total_column_articles": 42, "frontend_question_id": "573", "is_new_question": false @@ -44700,9 +45036,9 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 130816, - "total_submitted": 274386, - "total_column_articles": 1066, + "total_acs": 132995, + "total_submitted": 279112, + "total_column_articles": 1091, "frontend_question_id": "572", "is_new_question": false }, @@ -44721,9 +45057,9 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 10074, - "total_submitted": 21626, - "total_column_articles": 127, + "total_acs": 10292, + "total_submitted": 22095, + "total_column_articles": 129, "frontend_question_id": "571", "is_new_question": false }, @@ -44742,9 +45078,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": 20720, - "total_submitted": 31582, - "total_column_articles": 157, + "total_acs": 21174, + "total_submitted": 32309, + "total_column_articles": 161, "frontend_question_id": "570", "is_new_question": false }, @@ -44763,9 +45099,9 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 15070, - "total_submitted": 26461, - "total_column_articles": 212, + "total_acs": 15365, + "total_submitted": 26974, + "total_column_articles": 216, "frontend_question_id": "569", "is_new_question": false }, @@ -44784,9 +45120,9 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 1616, - "total_submitted": 3131, - "total_column_articles": 32, + "total_acs": 1643, + "total_submitted": 3178, + "total_column_articles": 34, "frontend_question_id": "568", "is_new_question": false }, @@ -44805,9 +45141,9 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 200823, - "total_submitted": 456372, - "total_column_articles": 1884, + "total_acs": 204240, + "total_submitted": 463588, + "total_column_articles": 1901, "frontend_question_id": "567", "is_new_question": false }, @@ -44826,9 +45162,9 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 110562, - "total_submitted": 166800, - "total_column_articles": 1027, + "total_acs": 112348, + "total_submitted": 169749, + "total_column_articles": 1054, "frontend_question_id": "566", "is_new_question": false }, @@ -44847,9 +45183,9 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 18216, - "total_submitted": 30666, - "total_column_articles": 194, + "total_acs": 18427, + "total_submitted": 31011, + "total_column_articles": 196, "frontend_question_id": "565", "is_new_question": false }, @@ -44868,8 +45204,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 23435, - "total_submitted": 77022, + "total_acs": 23471, + "total_submitted": 77136, "total_column_articles": 249, "frontend_question_id": "564", "is_new_question": false @@ -44889,9 +45225,9 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 66689, - "total_submitted": 101503, - "total_column_articles": 671, + "total_acs": 67053, + "total_submitted": 102077, + "total_column_articles": 683, "frontend_question_id": "563", "is_new_question": false }, @@ -44910,8 +45246,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": 5109, - "total_submitted": 10500, + "total_acs": 5147, + "total_submitted": 10574, "total_column_articles": 87, "frontend_question_id": "562", "is_new_question": false @@ -44928,12 +45264,12 @@ { "stat": { "question_id": 561, - "question__title": "Array Partition I", - "question__title_slug": "array-partition-i", + "question__title": "Array Partition", + "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 111235, - "total_submitted": 142235, - "total_column_articles": 916, + "total_acs": 112333, + "total_submitted": 143587, + "total_column_articles": 937, "frontend_question_id": "561", "is_new_question": false }, @@ -44952,9 +45288,9 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 240073, - "total_submitted": 529335, - "total_column_articles": 1513, + "total_acs": 244302, + "total_submitted": 538518, + "total_column_articles": 1532, "frontend_question_id": "560", "is_new_question": false }, @@ -44973,9 +45309,9 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 248988, - "total_submitted": 335536, - "total_column_articles": 2079, + "total_acs": 252197, + "total_submitted": 340019, + "total_column_articles": 2100, "frontend_question_id": "557", "is_new_question": false }, @@ -44994,9 +45330,9 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 21210, - "total_submitted": 63172, - "total_column_articles": 319, + "total_acs": 39356, + "total_submitted": 106432, + "total_column_articles": 511, "frontend_question_id": "556", "is_new_question": false }, @@ -45015,8 +45351,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 1460, - "total_submitted": 3975, + "total_acs": 1470, + "total_submitted": 4003, "total_column_articles": 28, "frontend_question_id": "555", "is_new_question": false @@ -45036,9 +45372,9 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 52448, - "total_submitted": 103047, - "total_column_articles": 534, + "total_acs": 52819, + "total_submitted": 103730, + "total_column_articles": 539, "frontend_question_id": "554", "is_new_question": false }, @@ -45057,8 +45393,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 28974, - "total_submitted": 44609, + "total_acs": 29070, + "total_submitted": 44773, "total_column_articles": 349, "frontend_question_id": "553", "is_new_question": false @@ -45078,9 +45414,9 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 26101, - "total_submitted": 45293, - "total_column_articles": 309, + "total_acs": 26207, + "total_submitted": 45471, + "total_column_articles": 312, "frontend_question_id": "552", "is_new_question": false }, @@ -45099,9 +45435,9 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 67801, - "total_submitted": 119542, - "total_column_articles": 859, + "total_acs": 68266, + "total_submitted": 120358, + "total_column_articles": 873, "frontend_question_id": "551", "is_new_question": false }, @@ -45120,8 +45456,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 1176, - "total_submitted": 2289, + "total_acs": 1208, + "total_submitted": 2373, "total_column_articles": 33, "frontend_question_id": "1730", "is_new_question": false @@ -45141,8 +45477,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 3186, - "total_submitted": 6232, + "total_acs": 3227, + "total_submitted": 6299, "total_column_articles": 67, "frontend_question_id": "549", "is_new_question": false @@ -45162,8 +45498,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 2051, - "total_submitted": 5531, + "total_acs": 2074, + "total_submitted": 5576, "total_column_articles": 50, "frontend_question_id": "548", "is_new_question": false @@ -45183,9 +45519,9 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 219073, - "total_submitted": 352535, - "total_column_articles": 1551, + "total_acs": 221788, + "total_submitted": 356799, + "total_column_articles": 1559, "frontend_question_id": "547", "is_new_question": false }, @@ -45204,8 +45540,8 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 16561, - "total_submitted": 26609, + "total_acs": 16622, + "total_submitted": 26729, "total_column_articles": 130, "frontend_question_id": "546", "is_new_question": false @@ -45225,8 +45561,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 4705, - "total_submitted": 10723, + "total_acs": 4740, + "total_submitted": 10794, "total_column_articles": 92, "frontend_question_id": "545", "is_new_question": false @@ -45246,9 +45582,9 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 2923, - "total_submitted": 4087, - "total_column_articles": 64, + "total_acs": 2951, + "total_submitted": 4129, + "total_column_articles": 65, "frontend_question_id": "544", "is_new_question": false }, @@ -45267,9 +45603,9 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 232506, - "total_submitted": 406572, - "total_column_articles": 1717, + "total_acs": 237232, + "total_submitted": 414208, + "total_column_articles": 1747, "frontend_question_id": "543", "is_new_question": false }, @@ -45288,9 +45624,9 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 107216, - "total_submitted": 231607, - "total_column_articles": 935, + "total_acs": 108482, + "total_submitted": 234391, + "total_column_articles": 959, "frontend_question_id": "542", "is_new_question": false }, @@ -45309,9 +45645,9 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 123456, - "total_submitted": 207898, - "total_column_articles": 1120, + "total_acs": 126791, + "total_submitted": 213644, + "total_column_articles": 1146, "frontend_question_id": "541", "is_new_question": false }, @@ -45330,9 +45666,9 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 99236, - "total_submitted": 163166, - "total_column_articles": 958, + "total_acs": 100247, + "total_submitted": 164890, + "total_column_articles": 974, "frontend_question_id": "540", "is_new_question": false }, @@ -45351,9 +45687,9 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 54420, - "total_submitted": 81874, - "total_column_articles": 617, + "total_acs": 54679, + "total_submitted": 82282, + "total_column_articles": 618, "frontend_question_id": "539", "is_new_question": false }, @@ -45372,9 +45708,9 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 168787, - "total_submitted": 227435, - "total_column_articles": 1200, + "total_acs": 172068, + "total_submitted": 231345, + "total_column_articles": 1219, "frontend_question_id": "538", "is_new_question": false }, @@ -45393,8 +45729,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 40869, - "total_submitted": 54612, + "total_acs": 40980, + "total_submitted": 54757, "total_column_articles": 626, "frontend_question_id": "537", "is_new_question": false @@ -45414,8 +45750,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 4707, - "total_submitted": 8699, + "total_acs": 4760, + "total_submitted": 8788, "total_column_articles": 80, "frontend_question_id": "536", "is_new_question": false @@ -45435,9 +45771,9 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 36853, - "total_submitted": 42041, - "total_column_articles": 238, + "total_acs": 39256, + "total_submitted": 44752, + "total_column_articles": 250, "frontend_question_id": "535", "is_new_question": false }, @@ -45456,9 +45792,9 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 2202, - "total_submitted": 4156, - "total_column_articles": 41, + "total_acs": 2218, + "total_submitted": 4196, + "total_column_articles": 42, "frontend_question_id": "533", "is_new_question": false }, @@ -45477,9 +45813,9 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 57174, - "total_submitted": 126792, - "total_column_articles": 658, + "total_acs": 57482, + "total_submitted": 127461, + "total_column_articles": 669, "frontend_question_id": "532", "is_new_question": false }, @@ -45498,9 +45834,9 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 5017, - "total_submitted": 7749, - "total_column_articles": 97, + "total_acs": 5049, + "total_submitted": 7806, + "total_column_articles": 98, "frontend_question_id": "531", "is_new_question": false }, @@ -45519,9 +45855,9 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 122158, - "total_submitted": 193895, - "total_column_articles": 878, + "total_acs": 124610, + "total_submitted": 197535, + "total_column_articles": 900, "frontend_question_id": "530", "is_new_question": false }, @@ -45540,9 +45876,9 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 45638, - "total_submitted": 70925, - "total_column_articles": 535, + "total_acs": 45864, + "total_submitted": 71298, + "total_column_articles": 536, "frontend_question_id": "529", "is_new_question": false }, @@ -45561,9 +45897,9 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 15472, - "total_submitted": 24258, - "total_column_articles": 228, + "total_acs": 15662, + "total_submitted": 24552, + "total_column_articles": 229, "frontend_question_id": "1721", "is_new_question": false }, @@ -45582,8 +45918,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 2408, - "total_submitted": 4062, + "total_acs": 2427, + "total_submitted": 4086, "total_column_articles": 36, "frontend_question_id": "527", "is_new_question": false @@ -45603,9 +45939,9 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 40015, - "total_submitted": 54542, - "total_column_articles": 447, + "total_acs": 40247, + "total_submitted": 54853, + "total_column_articles": 449, "frontend_question_id": "526", "is_new_question": false }, @@ -45624,9 +45960,9 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 57491, - "total_submitted": 105605, - "total_column_articles": 619, + "total_acs": 58002, + "total_submitted": 106547, + "total_column_articles": 620, "frontend_question_id": "525", "is_new_question": false }, @@ -45645,9 +45981,9 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 88411, - "total_submitted": 177074, - "total_column_articles": 868, + "total_acs": 89173, + "total_submitted": 178467, + "total_column_articles": 885, "frontend_question_id": "524", "is_new_question": false }, @@ -45666,9 +46002,9 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 82867, - "total_submitted": 294862, - "total_column_articles": 705, + "total_acs": 83537, + "total_submitted": 297046, + "total_column_articles": 717, "frontend_question_id": "523", "is_new_question": false }, @@ -45687,9 +46023,9 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 28291, - "total_submitted": 58059, - "total_column_articles": 327, + "total_acs": 28783, + "total_submitted": 58966, + "total_column_articles": 330, "frontend_question_id": "522", "is_new_question": false }, @@ -45708,8 +46044,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 57384, - "total_submitted": 77830, + "total_acs": 57637, + "total_submitted": 78167, "total_column_articles": 511, "frontend_question_id": "521", "is_new_question": false @@ -45729,9 +46065,9 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 75800, - "total_submitted": 132306, - "total_column_articles": 1153, + "total_acs": 76256, + "total_submitted": 133104, + "total_column_articles": 1171, "frontend_question_id": "520", "is_new_question": false }, @@ -45750,9 +46086,9 @@ "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": 155, - "total_submitted": 298, - "total_column_articles": 6, + "total_acs": 166, + "total_submitted": 324, + "total_column_articles": 7, "frontend_question_id": "1983", "is_new_question": false }, @@ -45771,9 +46107,9 @@ "question__title": "Coin Change 2", "question__title_slug": "coin-change-2", "question__hide": false, - "total_acs": 171530, - "total_submitted": 249315, - "total_column_articles": 973, + "total_acs": 175067, + "total_submitted": 254069, + "total_column_articles": 995, "frontend_question_id": "518", "is_new_question": false }, @@ -45792,8 +46128,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 21562, - "total_submitted": 42192, + "total_acs": 21673, + "total_submitted": 42403, "total_column_articles": 189, "frontend_question_id": "517", "is_new_question": false @@ -45813,9 +46149,9 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 130934, - "total_submitted": 196618, - "total_column_articles": 867, + "total_acs": 133351, + "total_submitted": 200075, + "total_column_articles": 887, "frontend_question_id": "516", "is_new_question": false }, @@ -45834,9 +46170,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": 91004, - "total_submitted": 137448, - "total_column_articles": 928, + "total_acs": 92507, + "total_submitted": 139644, + "total_column_articles": 944, "frontend_question_id": "515", "is_new_question": false }, @@ -45855,9 +46191,9 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 23243, - "total_submitted": 46001, - "total_column_articles": 279, + "total_acs": 23426, + "total_submitted": 46278, + "total_column_articles": 280, "frontend_question_id": "514", "is_new_question": false }, @@ -45876,9 +46212,9 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 125102, - "total_submitted": 167909, - "total_column_articles": 1245, + "total_acs": 127737, + "total_submitted": 171370, + "total_column_articles": 1269, "frontend_question_id": "513", "is_new_question": false }, @@ -45897,8 +46233,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 249, - "total_submitted": 591, + "total_acs": 265, + "total_submitted": 641, "total_column_articles": 17, "frontend_question_id": "2036", "is_new_question": false @@ -45918,8 +46254,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": 2981, - "total_submitted": 7934, + "total_acs": 3014, + "total_submitted": 8037, "total_column_articles": 44, "frontend_question_id": "1059", "is_new_question": false @@ -45939,9 +46275,9 @@ "question__title": "Count Subarrays With More Ones Than Zeros", "question__title_slug": "count-subarrays-with-more-ones-than-zeros", "question__hide": false, - "total_acs": 434, - "total_submitted": 794, - "total_column_articles": 15, + "total_acs": 458, + "total_submitted": 836, + "total_column_articles": 17, "frontend_question_id": "2031", "is_new_question": false }, @@ -45960,8 +46296,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 4720, - "total_submitted": 7786, + "total_acs": 4775, + "total_submitted": 7866, "total_column_articles": 68, "frontend_question_id": "510", "is_new_question": false @@ -45981,9 +46317,9 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 39182, - "total_submitted": 51967, - "total_column_articles": 534, + "total_acs": 39498, + "total_submitted": 52367, + "total_column_articles": 535, "frontend_question_id": "508", "is_new_question": false }, @@ -46002,9 +46338,9 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 66437, - "total_submitted": 135393, - "total_column_articles": 479, + "total_acs": 66914, + "total_submitted": 136360, + "total_column_articles": 482, "frontend_question_id": "507", "is_new_question": false }, @@ -46023,9 +46359,9 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 65477, - "total_submitted": 100491, - "total_column_articles": 844, + "total_acs": 65980, + "total_submitted": 101279, + "total_column_articles": 856, "frontend_question_id": "506", "is_new_question": false }, @@ -46044,9 +46380,9 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 7668, - "total_submitted": 15285, - "total_column_articles": 92, + "total_acs": 7734, + "total_submitted": 15403, + "total_column_articles": 93, "frontend_question_id": "505", "is_new_question": false }, @@ -46065,9 +46401,9 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 75351, - "total_submitted": 144667, - "total_column_articles": 751, + "total_acs": 75819, + "total_submitted": 145540, + "total_column_articles": 762, "frontend_question_id": "504", "is_new_question": false }, @@ -46086,9 +46422,9 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 147903, - "total_submitted": 225776, - "total_column_articles": 1290, + "total_acs": 151016, + "total_submitted": 230212, + "total_column_articles": 1311, "frontend_question_id": "503", "is_new_question": false }, @@ -46107,9 +46443,9 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 32308, - "total_submitted": 72572, - "total_column_articles": 384, + "total_acs": 32448, + "total_submitted": 72824, + "total_column_articles": 386, "frontend_question_id": "502", "is_new_question": false }, @@ -46128,9 +46464,9 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 106908, - "total_submitted": 199978, - "total_column_articles": 794, + "total_acs": 109289, + "total_submitted": 203984, + "total_column_articles": 819, "frontend_question_id": "501", "is_new_question": false }, @@ -46149,9 +46485,9 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 59784, - "total_submitted": 80316, - "total_column_articles": 862, + "total_acs": 60214, + "total_submitted": 80883, + "total_column_articles": 876, "frontend_question_id": "500", "is_new_question": false }, @@ -46170,8 +46506,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 3463, - "total_submitted": 8702, + "total_acs": 3526, + "total_submitted": 8797, "total_column_articles": 66, "frontend_question_id": "499", "is_new_question": false @@ -46191,9 +46527,9 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 85981, - "total_submitted": 156260, - "total_column_articles": 953, + "total_acs": 87095, + "total_submitted": 158188, + "total_column_articles": 969, "frontend_question_id": "498", "is_new_question": false }, @@ -46212,9 +46548,9 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 193493, - "total_submitted": 270985, - "total_column_articles": 1841, + "total_acs": 197419, + "total_submitted": 276242, + "total_column_articles": 1861, "frontend_question_id": "496", "is_new_question": false }, @@ -46233,9 +46569,9 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 75685, - "total_submitted": 125496, - "total_column_articles": 1053, + "total_acs": 76403, + "total_submitted": 126618, + "total_column_articles": 1070, "frontend_question_id": "495", "is_new_question": false }, @@ -46254,9 +46590,9 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 242813, - "total_submitted": 494287, - "total_column_articles": 1483, + "total_acs": 248247, + "total_submitted": 505313, + "total_column_articles": 1515, "frontend_question_id": "494", "is_new_question": false }, @@ -46275,9 +46611,9 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 32153, - "total_submitted": 90504, - "total_column_articles": 327, + "total_acs": 32512, + "total_submitted": 91394, + "total_column_articles": 329, "frontend_question_id": "493", "is_new_question": false }, @@ -46296,9 +46632,9 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 50016, - "total_submitted": 82298, - "total_column_articles": 471, + "total_acs": 50267, + "total_submitted": 82708, + "total_column_articles": 472, "frontend_question_id": "492", "is_new_question": false }, @@ -46317,9 +46653,9 @@ "question__title": "Increasing Subsequences", "question__title_slug": "increasing-subsequences", "question__hide": false, - "total_acs": 84894, - "total_submitted": 160410, - "total_column_articles": 648, + "total_acs": 87190, + "total_submitted": 164883, + "total_column_articles": 666, "frontend_question_id": "491", "is_new_question": false }, @@ -46338,8 +46674,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 9277, - "total_submitted": 18737, + "total_acs": 9359, + "total_submitted": 18910, "total_column_articles": 111, "frontend_question_id": "490", "is_new_question": false @@ -46359,9 +46695,9 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 2671, - "total_submitted": 5741, - "total_column_articles": 54, + "total_acs": 2698, + "total_submitted": 5791, + "total_column_articles": 57, "frontend_question_id": "1643", "is_new_question": false }, @@ -46380,8 +46716,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 18948, - "total_submitted": 37356, + "total_acs": 19001, + "total_submitted": 37493, "total_column_articles": 179, "frontend_question_id": "488", "is_new_question": false @@ -46401,9 +46737,9 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 10337, - "total_submitted": 17835, - "total_column_articles": 188, + "total_acs": 10519, + "total_submitted": 18102, + "total_column_articles": 189, "frontend_question_id": "487", "is_new_question": false }, @@ -46422,9 +46758,9 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 56681, - "total_submitted": 95791, - "total_column_articles": 465, + "total_acs": 57163, + "total_submitted": 96600, + "total_column_articles": 468, "frontend_question_id": "486", "is_new_question": false }, @@ -46443,9 +46779,9 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 159024, - "total_submitted": 259990, - "total_column_articles": 1266, + "total_acs": 160855, + "total_submitted": 262869, + "total_column_articles": 1290, "frontend_question_id": "485", "is_new_question": false }, @@ -46464,8 +46800,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 2006, - "total_submitted": 3296, + "total_acs": 2020, + "total_submitted": 3331, "total_column_articles": 42, "frontend_question_id": "484", "is_new_question": false @@ -46485,8 +46821,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 17755, - "total_submitted": 29994, + "total_acs": 17846, + "total_submitted": 30116, "total_column_articles": 137, "frontend_question_id": "483", "is_new_question": false @@ -46506,9 +46842,9 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 48013, - "total_submitted": 102119, - "total_column_articles": 502, + "total_acs": 48386, + "total_submitted": 102905, + "total_column_articles": 505, "frontend_question_id": "482", "is_new_question": false }, @@ -46527,9 +46863,9 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 7921, - "total_submitted": 13896, - "total_column_articles": 140, + "total_acs": 8022, + "total_submitted": 14059, + "total_column_articles": 141, "frontend_question_id": "481", "is_new_question": false }, @@ -46548,9 +46884,9 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 34686, - "total_submitted": 77718, - "total_column_articles": 456, + "total_acs": 34896, + "total_submitted": 78212, + "total_column_articles": 458, "frontend_question_id": "480", "is_new_question": false }, @@ -46569,9 +46905,9 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 21652, - "total_submitted": 34542, - "total_column_articles": 162, + "total_acs": 21687, + "total_submitted": 34622, + "total_column_articles": 163, "frontend_question_id": "479", "is_new_question": false }, @@ -46590,9 +46926,9 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 42366, - "total_submitted": 69986, - "total_column_articles": 360, + "total_acs": 42528, + "total_submitted": 70250, + "total_column_articles": 362, "frontend_question_id": "477", "is_new_question": false }, @@ -46611,9 +46947,9 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 71648, - "total_submitted": 101006, - "total_column_articles": 958, + "total_acs": 72151, + "total_submitted": 101744, + "total_column_articles": 973, "frontend_question_id": "476", "is_new_question": false }, @@ -46632,9 +46968,9 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 60268, - "total_submitted": 147926, - "total_column_articles": 637, + "total_acs": 60768, + "total_submitted": 149069, + "total_column_articles": 645, "frontend_question_id": "475", "is_new_question": false }, @@ -46653,9 +46989,9 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 112563, - "total_submitted": 177428, - "total_column_articles": 839, + "total_acs": 114924, + "total_submitted": 180702, + "total_column_articles": 844, "frontend_question_id": "474", "is_new_question": false }, @@ -46674,9 +47010,9 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 57850, - "total_submitted": 124806, - "total_column_articles": 446, + "total_acs": 58640, + "total_submitted": 126350, + "total_column_articles": 447, "frontend_question_id": "473", "is_new_question": false }, @@ -46695,9 +47031,9 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 23979, - "total_submitted": 47423, - "total_column_articles": 243, + "total_acs": 24119, + "total_submitted": 47624, + "total_column_articles": 245, "frontend_question_id": "472", "is_new_question": false }, @@ -46716,8 +47052,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 2043, - "total_submitted": 3371, + "total_acs": 2060, + "total_submitted": 3407, "total_column_articles": 34, "frontend_question_id": "471", "is_new_question": false @@ -46737,8 +47073,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 1997, - "total_submitted": 4633, + "total_acs": 2033, + "total_submitted": 4722, "total_column_articles": 26, "frontend_question_id": "469", "is_new_question": false @@ -46758,9 +47094,9 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 53547, - "total_submitted": 189774, - "total_column_articles": 639, + "total_acs": 54092, + "total_submitted": 191898, + "total_column_articles": 644, "frontend_question_id": "468", "is_new_question": false }, @@ -46779,9 +47115,9 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 32771, - "total_submitted": 63276, - "total_column_articles": 343, + "total_acs": 32965, + "total_submitted": 63642, + "total_column_articles": 344, "frontend_question_id": "467", "is_new_question": false }, @@ -46800,8 +47136,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 12569, - "total_submitted": 33587, + "total_acs": 12593, + "total_submitted": 33654, "total_column_articles": 192, "frontend_question_id": "466", "is_new_question": false @@ -46821,9 +47157,9 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 2157, - "total_submitted": 3999, - "total_column_articles": 30, + "total_acs": 2233, + "total_submitted": 4100, + "total_column_articles": 34, "frontend_question_id": "465", "is_new_question": false }, @@ -46842,8 +47178,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 32751, - "total_submitted": 77845, + "total_acs": 32951, + "total_submitted": 78471, "total_column_articles": 255, "frontend_question_id": "464", "is_new_question": false @@ -46863,9 +47199,9 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 101694, - "total_submitted": 144676, - "total_column_articles": 1171, + "total_acs": 102898, + "total_submitted": 146354, + "total_column_articles": 1193, "frontend_question_id": "463", "is_new_question": false }, @@ -46884,9 +47220,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": 46250, - "total_submitted": 74414, - "total_column_articles": 474, + "total_acs": 46581, + "total_submitted": 74910, + "total_column_articles": 477, "frontend_question_id": "462", "is_new_question": false }, @@ -46905,9 +47241,9 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 222168, - "total_submitted": 271900, - "total_column_articles": 1731, + "total_acs": 225156, + "total_submitted": 275466, + "total_column_articles": 1745, "frontend_question_id": "461", "is_new_question": false }, @@ -46926,9 +47262,9 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 50142, - "total_submitted": 113901, - "total_column_articles": 527, + "total_acs": 50895, + "total_submitted": 115648, + "total_column_articles": 534, "frontend_question_id": "460", "is_new_question": false }, @@ -46947,9 +47283,9 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 122518, - "total_submitted": 240745, - "total_column_articles": 915, + "total_acs": 125120, + "total_submitted": 245769, + "total_column_articles": 941, "frontend_question_id": "459", "is_new_question": false }, @@ -46968,9 +47304,9 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 24842, - "total_submitted": 35574, - "total_column_articles": 225, + "total_acs": 24918, + "total_submitted": 35679, + "total_column_articles": 227, "frontend_question_id": "458", "is_new_question": false }, @@ -46989,8 +47325,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 32284, - "total_submitted": 74308, + "total_acs": 32425, + "total_submitted": 74664, "total_column_articles": 350, "frontend_question_id": "457", "is_new_question": false @@ -47010,9 +47346,9 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 67503, - "total_submitted": 185395, - "total_column_articles": 545, + "total_acs": 68015, + "total_submitted": 186621, + "total_column_articles": 547, "frontend_question_id": "456", "is_new_question": false }, @@ -47031,9 +47367,9 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 229563, - "total_submitted": 401098, - "total_column_articles": 1773, + "total_acs": 233570, + "total_submitted": 408137, + "total_column_articles": 1801, "frontend_question_id": "455", "is_new_question": false }, @@ -47052,9 +47388,9 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 129293, - "total_submitted": 205262, - "total_column_articles": 800, + "total_acs": 132255, + "total_submitted": 209543, + "total_column_articles": 809, "frontend_question_id": "454", "is_new_question": false }, @@ -47073,9 +47409,9 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 65944, - "total_submitted": 107317, - "total_column_articles": 763, + "total_acs": 66459, + "total_submitted": 108116, + "total_column_articles": 776, "frontend_question_id": "453", "is_new_question": false }, @@ -47094,9 +47430,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": 146449, - "total_submitted": 289122, - "total_column_articles": 1184, + "total_acs": 148992, + "total_submitted": 294215, + "total_column_articles": 1201, "frontend_question_id": "452", "is_new_question": false }, @@ -47115,9 +47451,9 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 103793, - "total_submitted": 144805, - "total_column_articles": 1156, + "total_acs": 104830, + "total_submitted": 146186, + "total_column_articles": 1173, "frontend_question_id": "451", "is_new_question": false }, @@ -47136,9 +47472,9 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 142021, - "total_submitted": 272997, - "total_column_articles": 1471, + "total_acs": 145109, + "total_submitted": 278504, + "total_column_articles": 1498, "frontend_question_id": "450", "is_new_question": false }, @@ -47157,9 +47493,9 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 43290, - "total_submitted": 71565, - "total_column_articles": 395, + "total_acs": 43552, + "total_submitted": 72030, + "total_column_articles": 398, "frontend_question_id": "449", "is_new_question": false }, @@ -47178,9 +47514,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": 207536, - "total_submitted": 315426, - "total_column_articles": 1508, + "total_acs": 211436, + "total_submitted": 321283, + "total_column_articles": 1534, "frontend_question_id": "448", "is_new_question": false }, @@ -47199,9 +47535,9 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 52342, - "total_submitted": 78636, - "total_column_articles": 418, + "total_acs": 52482, + "total_submitted": 78825, + "total_column_articles": 419, "frontend_question_id": "447", "is_new_question": false }, @@ -47220,9 +47556,9 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 21353, - "total_submitted": 38847, - "total_column_articles": 185, + "total_acs": 21441, + "total_submitted": 39051, + "total_column_articles": 186, "frontend_question_id": "446", "is_new_question": false }, @@ -47241,9 +47577,9 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 104760, - "total_submitted": 175117, - "total_column_articles": 1163, + "total_acs": 105750, + "total_submitted": 176607, + "total_column_articles": 1169, "frontend_question_id": "445", "is_new_question": false }, @@ -47262,8 +47598,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 4628, - "total_submitted": 16404, + "total_acs": 4681, + "total_submitted": 16499, "total_column_articles": 73, "frontend_question_id": "444", "is_new_question": false @@ -47283,9 +47619,9 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 67342, - "total_submitted": 141099, - "total_column_articles": 791, + "total_acs": 67883, + "total_submitted": 142286, + "total_column_articles": 803, "frontend_question_id": "443", "is_new_question": false }, @@ -47304,9 +47640,9 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 92963, - "total_submitted": 124165, - "total_column_articles": 893, + "total_acs": 93741, + "total_submitted": 125190, + "total_column_articles": 910, "frontend_question_id": "442", "is_new_question": false }, @@ -47325,9 +47661,9 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 97672, - "total_submitted": 213730, - "total_column_articles": 926, + "total_acs": 98906, + "total_submitted": 216431, + "total_column_articles": 942, "frontend_question_id": "441", "is_new_question": false }, @@ -47346,8 +47682,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 41787, - "total_submitted": 98012, + "total_acs": 42374, + "total_submitted": 99288, "total_column_articles": 282, "frontend_question_id": "440", "is_new_question": false @@ -47367,9 +47703,9 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 3537, - "total_submitted": 5906, - "total_column_articles": 82, + "total_acs": 3569, + "total_submitted": 5949, + "total_column_articles": 86, "frontend_question_id": "439", "is_new_question": false }, @@ -47388,9 +47724,9 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 198481, - "total_submitted": 363174, - "total_column_articles": 1627, + "total_acs": 203768, + "total_submitted": 372814, + "total_column_articles": 1645, "frontend_question_id": "438", "is_new_question": false }, @@ -47409,9 +47745,9 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 174258, - "total_submitted": 309946, - "total_column_articles": 1285, + "total_acs": 177342, + "total_submitted": 316583, + "total_column_articles": 1298, "frontend_question_id": "437", "is_new_question": false }, @@ -47430,9 +47766,9 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 37871, - "total_submitted": 66532, - "total_column_articles": 502, + "total_acs": 38186, + "total_submitted": 67094, + "total_column_articles": 504, "frontend_question_id": "436", "is_new_question": false }, @@ -47451,9 +47787,9 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 155558, - "total_submitted": 305622, - "total_column_articles": 1255, + "total_acs": 158715, + "total_submitted": 311726, + "total_column_articles": 1276, "frontend_question_id": "435", "is_new_question": false }, @@ -47472,9 +47808,9 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 75459, - "total_submitted": 190680, - "total_column_articles": 1003, + "total_acs": 76020, + "total_submitted": 192388, + "total_column_articles": 1020, "frontend_question_id": "434", "is_new_question": false }, @@ -47493,9 +47829,9 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 45094, - "total_submitted": 81826, - "total_column_articles": 664, + "total_acs": 45349, + "total_submitted": 82288, + "total_column_articles": 675, "frontend_question_id": "433", "is_new_question": false }, @@ -47514,8 +47850,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 26458, - "total_submitted": 56020, + "total_acs": 26567, + "total_submitted": 56398, "total_column_articles": 280, "frontend_question_id": "432", "is_new_question": false @@ -47535,9 +47871,9 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 2036, - "total_submitted": 3291, - "total_column_articles": 41, + "total_acs": 2073, + "total_submitted": 3340, + "total_column_articles": 43, "frontend_question_id": "425", "is_new_question": false }, @@ -47556,9 +47892,9 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 68357, - "total_submitted": 126824, - "total_column_articles": 595, + "total_acs": 69982, + "total_submitted": 129519, + "total_column_articles": 606, "frontend_question_id": "424", "is_new_question": false }, @@ -47577,9 +47913,9 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 35922, - "total_submitted": 58821, - "total_column_articles": 415, + "total_acs": 36008, + "total_submitted": 58969, + "total_column_articles": 418, "frontend_question_id": "423", "is_new_question": false }, @@ -47598,9 +47934,9 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 2833, - "total_submitted": 6516, - "total_column_articles": 73, + "total_acs": 2857, + "total_submitted": 6568, + "total_column_articles": 74, "frontend_question_id": "422", "is_new_question": false }, @@ -47619,9 +47955,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": 38777, - "total_submitted": 62587, - "total_column_articles": 366, + "total_acs": 39040, + "total_submitted": 63012, + "total_column_articles": 371, "frontend_question_id": "421", "is_new_question": false }, @@ -47640,8 +47976,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 17482, - "total_submitted": 44319, + "total_acs": 17538, + "total_submitted": 44463, "total_column_articles": 154, "frontend_question_id": "420", "is_new_question": false @@ -47661,9 +47997,9 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 37665, - "total_submitted": 47800, - "total_column_articles": 496, + "total_acs": 37928, + "total_submitted": 48177, + "total_column_articles": 499, "frontend_question_id": "419", "is_new_question": false }, @@ -47682,8 +48018,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 3137, - "total_submitted": 8254, + "total_acs": 3182, + "total_submitted": 8337, "total_column_articles": 48, "frontend_question_id": "418", "is_new_question": false @@ -47703,9 +48039,9 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 65208, - "total_submitted": 118262, - "total_column_articles": 719, + "total_acs": 66192, + "total_submitted": 119865, + "total_column_articles": 726, "frontend_question_id": "417", "is_new_question": false }, @@ -47724,9 +48060,9 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 285206, - "total_submitted": 549360, - "total_column_articles": 1522, + "total_acs": 291664, + "total_submitted": 561566, + "total_column_articles": 1550, "frontend_question_id": "416", "is_new_question": false }, @@ -47745,9 +48081,9 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 212381, - "total_submitted": 386826, - "total_column_articles": 1426, + "total_acs": 215338, + "total_submitted": 392046, + "total_column_articles": 1449, "frontend_question_id": "415", "is_new_question": false }, @@ -47766,9 +48102,9 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 111831, - "total_submitted": 283232, - "total_column_articles": 1380, + "total_acs": 113032, + "total_submitted": 286131, + "total_column_articles": 1401, "frontend_question_id": "414", "is_new_question": false }, @@ -47787,9 +48123,9 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 100336, - "total_submitted": 144436, - "total_column_articles": 1273, + "total_acs": 101387, + "total_submitted": 145876, + "total_column_articles": 1292, "frontend_question_id": "413", "is_new_question": false }, @@ -47808,9 +48144,9 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 131995, - "total_submitted": 185757, - "total_column_articles": 775, + "total_acs": 135368, + "total_submitted": 191014, + "total_column_articles": 810, "frontend_question_id": "412", "is_new_question": false }, @@ -47829,9 +48165,9 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 1225, - "total_submitted": 2502, - "total_column_articles": 31, + "total_acs": 1249, + "total_submitted": 2547, + "total_column_articles": 32, "frontend_question_id": "411", "is_new_question": false }, @@ -47850,9 +48186,9 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 52569, - "total_submitted": 90282, - "total_column_articles": 441, + "total_acs": 53187, + "total_submitted": 91159, + "total_column_articles": 446, "frontend_question_id": "410", "is_new_question": false }, @@ -47871,9 +48207,9 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 129154, - "total_submitted": 232234, - "total_column_articles": 1694, + "total_acs": 132438, + "total_submitted": 237918, + "total_column_articles": 1724, "frontend_question_id": "409", "is_new_question": false }, @@ -47892,9 +48228,9 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 5218, - "total_submitted": 15072, - "total_column_articles": 100, + "total_acs": 5277, + "total_submitted": 15218, + "total_column_articles": 101, "frontend_question_id": "408", "is_new_question": false }, @@ -47913,8 +48249,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 29042, - "total_submitted": 50229, + "total_acs": 29280, + "total_submitted": 50674, "total_column_articles": 273, "frontend_question_id": "407", "is_new_question": false @@ -47934,9 +48270,9 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 178151, - "total_submitted": 236511, - "total_column_articles": 1110, + "total_acs": 181698, + "total_submitted": 240996, + "total_column_articles": 1138, "frontend_question_id": "406", "is_new_question": false }, @@ -47955,9 +48291,9 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 54785, - "total_submitted": 98497, - "total_column_articles": 539, + "total_acs": 55163, + "total_submitted": 99196, + "total_column_articles": 540, "frontend_question_id": "405", "is_new_question": false }, @@ -47976,9 +48312,9 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 163027, - "total_submitted": 267370, - "total_column_articles": 1626, + "total_acs": 166115, + "total_submitted": 272038, + "total_column_articles": 1648, "frontend_question_id": "404", "is_new_question": false }, @@ -47997,9 +48333,9 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 53335, - "total_submitted": 116516, - "total_column_articles": 511, + "total_acs": 53734, + "total_submitted": 117311, + "total_column_articles": 513, "frontend_question_id": "403", "is_new_question": false }, @@ -48018,9 +48354,9 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 110082, - "total_submitted": 341397, - "total_column_articles": 790, + "total_acs": 111506, + "total_submitted": 346185, + "total_column_articles": 805, "frontend_question_id": "402", "is_new_question": false }, @@ -48039,9 +48375,9 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 62340, - "total_submitted": 100627, - "total_column_articles": 764, + "total_acs": 62714, + "total_submitted": 101182, + "total_column_articles": 777, "frontend_question_id": "401", "is_new_question": false }, @@ -48060,9 +48396,9 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 49800, - "total_submitted": 109239, - "total_column_articles": 547, + "total_acs": 50205, + "total_submitted": 110215, + "total_column_articles": 550, "frontend_question_id": "400", "is_new_question": false }, @@ -48081,9 +48417,9 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 58381, - "total_submitted": 98443, - "total_column_articles": 693, + "total_acs": 59368, + "total_submitted": 100135, + "total_column_articles": 709, "frontend_question_id": "399", "is_new_question": false }, @@ -48102,8 +48438,8 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 52667, - "total_submitted": 72639, + "total_acs": 52902, + "total_submitted": 73157, "total_column_articles": 427, "frontend_question_id": "398", "is_new_question": false @@ -48123,9 +48459,9 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 56525, - "total_submitted": 131826, - "total_column_articles": 621, + "total_acs": 56982, + "total_submitted": 132958, + "total_column_articles": 626, "frontend_question_id": "397", "is_new_question": false }, @@ -48144,9 +48480,9 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 42671, - "total_submitted": 79433, - "total_column_articles": 536, + "total_acs": 42952, + "total_submitted": 79920, + "total_column_articles": 540, "frontend_question_id": "396", "is_new_question": false }, @@ -48165,9 +48501,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": 67852, - "total_submitted": 129203, - "total_column_articles": 552, + "total_acs": 68784, + "total_submitted": 130930, + "total_column_articles": 557, "frontend_question_id": "395", "is_new_question": false }, @@ -48186,9 +48522,9 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 177979, - "total_submitted": 316240, - "total_column_articles": 1780, + "total_acs": 182204, + "total_submitted": 323144, + "total_column_articles": 1813, "frontend_question_id": "394", "is_new_question": false }, @@ -48207,9 +48543,9 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 35065, - "total_submitted": 79875, - "total_column_articles": 440, + "total_acs": 35218, + "total_submitted": 80248, + "total_column_articles": 442, "frontend_question_id": "393", "is_new_question": false }, @@ -48228,9 +48564,9 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 209709, - "total_submitted": 400492, - "total_column_articles": 2086, + "total_acs": 215632, + "total_submitted": 412059, + "total_column_articles": 2137, "frontend_question_id": "392", "is_new_question": false }, @@ -48249,8 +48585,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 23577, - "total_submitted": 50979, + "total_acs": 23708, + "total_submitted": 51287, "total_column_articles": 216, "frontend_question_id": "391", "is_new_question": false @@ -48270,9 +48606,9 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 32716, - "total_submitted": 53675, - "total_column_articles": 415, + "total_acs": 32991, + "total_submitted": 54112, + "total_column_articles": 416, "frontend_question_id": "390", "is_new_question": false }, @@ -48291,9 +48627,9 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 130800, - "total_submitted": 192021, - "total_column_articles": 1339, + "total_acs": 132187, + "total_submitted": 194198, + "total_column_articles": 1349, "frontend_question_id": "389", "is_new_question": false }, @@ -48312,9 +48648,9 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 30496, - "total_submitted": 47686, - "total_column_articles": 474, + "total_acs": 30669, + "total_submitted": 47950, + "total_column_articles": 477, "frontend_question_id": "388", "is_new_question": false }, @@ -48333,9 +48669,9 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 309904, - "total_submitted": 562414, - "total_column_articles": 1717, + "total_acs": 314099, + "total_submitted": 569471, + "total_column_articles": 1738, "frontend_question_id": "387", "is_new_question": false }, @@ -48354,8 +48690,8 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 62828, - "total_submitted": 83682, + "total_acs": 63420, + "total_submitted": 84488, "total_column_articles": 613, "frontend_question_id": "386", "is_new_question": false @@ -48375,9 +48711,9 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 28681, - "total_submitted": 52131, - "total_column_articles": 275, + "total_acs": 28790, + "total_submitted": 52361, + "total_column_articles": 279, "frontend_question_id": "385", "is_new_question": false }, @@ -48396,9 +48732,9 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 102917, - "total_submitted": 168196, - "total_column_articles": 490, + "total_acs": 104093, + "total_submitted": 170085, + "total_column_articles": 497, "frontend_question_id": "384", "is_new_question": false }, @@ -48417,9 +48753,9 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 191387, - "total_submitted": 302975, - "total_column_articles": 1821, + "total_acs": 198965, + "total_submitted": 317044, + "total_column_articles": 1887, "frontend_question_id": "383", "is_new_question": false }, @@ -48438,9 +48774,9 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 47849, - "total_submitted": 66270, - "total_column_articles": 376, + "total_acs": 48305, + "total_submitted": 66842, + "total_column_articles": 377, "frontend_question_id": "382", "is_new_question": false }, @@ -48459,9 +48795,9 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 23793, - "total_submitted": 55268, - "total_column_articles": 212, + "total_acs": 23955, + "total_submitted": 55680, + "total_column_articles": 213, "frontend_question_id": "381", "is_new_question": false }, @@ -48480,9 +48816,9 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 83585, - "total_submitted": 158192, - "total_column_articles": 1090, + "total_acs": 84654, + "total_submitted": 160228, + "total_column_articles": 1146, "frontend_question_id": "380", "is_new_question": false }, @@ -48501,9 +48837,9 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 4665, - "total_submitted": 7545, - "total_column_articles": 92, + "total_acs": 4773, + "total_submitted": 7759, + "total_column_articles": 95, "frontend_question_id": "379", "is_new_question": false }, @@ -48522,9 +48858,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": 104051, - "total_submitted": 164340, - "total_column_articles": 737, + "total_acs": 104964, + "total_submitted": 165726, + "total_column_articles": 750, "frontend_question_id": "378", "is_new_question": false }, @@ -48543,9 +48879,9 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 100059, - "total_submitted": 190470, - "total_column_articles": 756, + "total_acs": 102049, + "total_submitted": 194079, + "total_column_articles": 771, "frontend_question_id": "377", "is_new_question": false }, @@ -48564,9 +48900,9 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 124967, - "total_submitted": 264780, - "total_column_articles": 1210, + "total_acs": 127619, + "total_submitted": 270132, + "total_column_articles": 1234, "frontend_question_id": "376", "is_new_question": false }, @@ -48585,9 +48921,9 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 38793, - "total_submitted": 63597, - "total_column_articles": 299, + "total_acs": 39117, + "total_submitted": 64046, + "total_column_articles": 304, "frontend_question_id": "375", "is_new_question": false }, @@ -48606,9 +48942,9 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 121300, - "total_submitted": 232879, - "total_column_articles": 802, + "total_acs": 123632, + "total_submitted": 237345, + "total_column_articles": 813, "frontend_question_id": "374", "is_new_question": false }, @@ -48627,9 +48963,9 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 50051, - "total_submitted": 120770, - "total_column_articles": 486, + "total_acs": 50463, + "total_submitted": 121999, + "total_column_articles": 489, "frontend_question_id": "373", "is_new_question": false }, @@ -48648,9 +48984,9 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 40097, - "total_submitted": 69967, - "total_column_articles": 402, + "total_acs": 40359, + "total_submitted": 70425, + "total_column_articles": 403, "frontend_question_id": "372", "is_new_question": false }, @@ -48669,9 +49005,9 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 94851, - "total_submitted": 154344, - "total_column_articles": 605, + "total_acs": 95555, + "total_submitted": 155404, + "total_column_articles": 608, "frontend_question_id": "371", "is_new_question": false }, @@ -48690,9 +49026,9 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 8112, - "total_submitted": 10756, - "total_column_articles": 204, + "total_acs": 8382, + "total_submitted": 11106, + "total_column_articles": 205, "frontend_question_id": "370", "is_new_question": false }, @@ -48711,8 +49047,8 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 6512, - "total_submitted": 10366, + "total_acs": 6611, + "total_submitted": 10534, "total_column_articles": 186, "frontend_question_id": "369", "is_new_question": false @@ -48732,9 +49068,9 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 49302, - "total_submitted": 107197, - "total_column_articles": 519, + "total_acs": 49674, + "total_submitted": 107970, + "total_column_articles": 522, "frontend_question_id": "368", "is_new_question": false }, @@ -48753,9 +49089,9 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 164757, - "total_submitted": 367236, - "total_column_articles": 1265, + "total_acs": 167693, + "total_submitted": 373794, + "total_column_articles": 1289, "frontend_question_id": "367", "is_new_question": false }, @@ -48774,9 +49110,9 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 6981, - "total_submitted": 8863, - "total_column_articles": 174, + "total_acs": 7135, + "total_submitted": 9064, + "total_column_articles": 178, "frontend_question_id": "366", "is_new_question": false }, @@ -48795,9 +49131,9 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 41079, - "total_submitted": 106905, - "total_column_articles": 546, + "total_acs": 41401, + "total_submitted": 107550, + "total_column_articles": 548, "frontend_question_id": "365", "is_new_question": false }, @@ -48816,9 +49152,9 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 2638, - "total_submitted": 3546, - "total_column_articles": 65, + "total_acs": 2668, + "total_submitted": 3601, + "total_column_articles": 66, "frontend_question_id": "364", "is_new_question": false }, @@ -48837,9 +49173,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": 37381, - "total_submitted": 76869, - "total_column_articles": 246, + "total_acs": 37590, + "total_submitted": 77307, + "total_column_articles": 247, "frontend_question_id": "363", "is_new_question": false }, @@ -48858,9 +49194,9 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 5255, - "total_submitted": 7615, - "total_column_articles": 95, + "total_acs": 5377, + "total_submitted": 7797, + "total_column_articles": 97, "frontend_question_id": "362", "is_new_question": false }, @@ -48879,8 +49215,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 4772, - "total_submitted": 8172, + "total_acs": 4821, + "total_submitted": 8254, "total_column_articles": 92, "frontend_question_id": "361", "is_new_question": false @@ -48900,8 +49236,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 4045, - "total_submitted": 6582, + "total_acs": 4089, + "total_submitted": 6648, "total_column_articles": 79, "frontend_question_id": "360", "is_new_question": false @@ -48921,9 +49257,9 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 6888, - "total_submitted": 9271, - "total_column_articles": 86, + "total_acs": 6998, + "total_submitted": 9417, + "total_column_articles": 88, "frontend_question_id": "359", "is_new_question": false }, @@ -48942,9 +49278,9 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 5604, - "total_submitted": 15686, - "total_column_articles": 73, + "total_acs": 5672, + "total_submitted": 15920, + "total_column_articles": 74, "frontend_question_id": "358", "is_new_question": false }, @@ -48963,9 +49299,9 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 61231, - "total_submitted": 102123, - "total_column_articles": 863, + "total_acs": 61564, + "total_submitted": 102645, + "total_column_articles": 875, "frontend_question_id": "357", "is_new_question": false }, @@ -48984,9 +49320,9 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 2143, - "total_submitted": 5940, - "total_column_articles": 55, + "total_acs": 2180, + "total_submitted": 6022, + "total_column_articles": 56, "frontend_question_id": "356", "is_new_question": false }, @@ -49005,9 +49341,9 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 35276, - "total_submitted": 86100, - "total_column_articles": 574, + "total_acs": 35792, + "total_submitted": 87676, + "total_column_articles": 581, "frontend_question_id": "355", "is_new_question": false }, @@ -49026,9 +49362,9 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 87281, - "total_submitted": 210389, - "total_column_articles": 697, + "total_acs": 88044, + "total_submitted": 213413, + "total_column_articles": 716, "frontend_question_id": "354", "is_new_question": false }, @@ -49047,8 +49383,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 3379, - "total_submitted": 7791, + "total_acs": 3437, + "total_submitted": 7904, "total_column_articles": 68, "frontend_question_id": "353", "is_new_question": false @@ -49068,9 +49404,9 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 23167, - "total_submitted": 34309, - "total_column_articles": 372, + "total_acs": 23271, + "total_submitted": 34457, + "total_column_articles": 373, "frontend_question_id": "352", "is_new_question": false }, @@ -49089,8 +49425,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 6420, - "total_submitted": 10673, + "total_acs": 6474, + "total_submitted": 10754, "total_column_articles": 119, "frontend_question_id": "351", "is_new_question": false @@ -49110,9 +49446,9 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 370511, - "total_submitted": 657716, - "total_column_articles": 2166, + "total_acs": 376159, + "total_submitted": 667234, + "total_column_articles": 2199, "frontend_question_id": "350", "is_new_question": false }, @@ -49131,9 +49467,9 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 314373, - "total_submitted": 423295, - "total_column_articles": 2147, + "total_acs": 319351, + "total_submitted": 429643, + "total_column_articles": 2172, "frontend_question_id": "349", "is_new_question": false }, @@ -49152,9 +49488,9 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 7457, - "total_submitted": 12423, - "total_column_articles": 113, + "total_acs": 7548, + "total_submitted": 12567, + "total_column_articles": 116, "frontend_question_id": "348", "is_new_question": false }, @@ -49173,9 +49509,9 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 311451, - "total_submitted": 493710, - "total_column_articles": 2240, + "total_acs": 317315, + "total_submitted": 502736, + "total_column_articles": 2273, "frontend_question_id": "347", "is_new_question": false }, @@ -49194,9 +49530,9 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 16557, - "total_submitted": 23092, - "total_column_articles": 179, + "total_acs": 16722, + "total_submitted": 23314, + "total_column_articles": 182, "frontend_question_id": "346", "is_new_question": false }, @@ -49215,9 +49551,9 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 131124, - "total_submitted": 241744, - "total_column_articles": 1212, + "total_acs": 132462, + "total_submitted": 244035, + "total_column_articles": 1234, "frontend_question_id": "345", "is_new_question": false }, @@ -49236,9 +49572,9 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 562174, - "total_submitted": 713591, - "total_column_articles": 2905, + "total_acs": 570822, + "total_submitted": 724024, + "total_column_articles": 2946, "frontend_question_id": "344", "is_new_question": false }, @@ -49257,9 +49593,9 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 177931, - "total_submitted": 287441, - "total_column_articles": 1525, + "total_acs": 181713, + "total_submitted": 293301, + "total_column_articles": 1544, "frontend_question_id": "343", "is_new_question": false }, @@ -49278,9 +49614,9 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 107483, - "total_submitted": 206088, - "total_column_articles": 917, + "total_acs": 108410, + "total_submitted": 207650, + "total_column_articles": 932, "frontend_question_id": "342", "is_new_question": false }, @@ -49299,9 +49635,9 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 63499, - "total_submitted": 87339, - "total_column_articles": 581, + "total_acs": 64092, + "total_submitted": 88136, + "total_column_articles": 587, "frontend_question_id": "341", "is_new_question": false }, @@ -49320,9 +49656,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": 19467, - "total_submitted": 38410, - "total_column_articles": 258, + "total_acs": 19850, + "total_submitted": 39158, + "total_column_articles": 259, "frontend_question_id": "340", "is_new_question": false }, @@ -49341,9 +49677,9 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 5215, - "total_submitted": 6305, - "total_column_articles": 75, + "total_acs": 5267, + "total_submitted": 6365, + "total_column_articles": 76, "frontend_question_id": "339", "is_new_question": false }, @@ -49362,9 +49698,9 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 225577, - "total_submitted": 286728, - "total_column_articles": 1827, + "total_acs": 229125, + "total_submitted": 291204, + "total_column_articles": 1837, "frontend_question_id": "338", "is_new_question": false }, @@ -49383,9 +49719,9 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 197747, - "total_submitted": 325378, - "total_column_articles": 1331, + "total_acs": 201687, + "total_submitted": 331840, + "total_column_articles": 1359, "frontend_question_id": "337", "is_new_question": false }, @@ -49404,9 +49740,9 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 24664, - "total_submitted": 63012, - "total_column_articles": 214, + "total_acs": 24812, + "total_submitted": 63418, + "total_column_articles": 215, "frontend_question_id": "336", "is_new_question": false }, @@ -49425,8 +49761,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 17292, - "total_submitted": 40469, + "total_acs": 17338, + "total_submitted": 40601, "total_column_articles": 155, "frontend_question_id": "335", "is_new_question": false @@ -49446,9 +49782,9 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 98216, - "total_submitted": 226845, - "total_column_articles": 674, + "total_acs": 99220, + "total_submitted": 229273, + "total_column_articles": 688, "frontend_question_id": "334", "is_new_question": false }, @@ -49467,8 +49803,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 6744, - "total_submitted": 14095, + "total_acs": 6838, + "total_submitted": 14311, "total_column_articles": 122, "frontend_question_id": "333", "is_new_question": false @@ -49488,9 +49824,9 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 59742, - "total_submitted": 128322, - "total_column_articles": 452, + "total_acs": 60848, + "total_submitted": 130504, + "total_column_articles": 461, "frontend_question_id": "332", "is_new_question": false }, @@ -49509,9 +49845,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": 53001, - "total_submitted": 110367, - "total_column_articles": 580, + "total_acs": 53340, + "total_submitted": 111034, + "total_column_articles": 583, "frontend_question_id": "331", "is_new_question": false }, @@ -49530,9 +49866,9 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 20801, - "total_submitted": 39244, - "total_column_articles": 165, + "total_acs": 20891, + "total_submitted": 39409, + "total_column_articles": 166, "frontend_question_id": "330", "is_new_question": false }, @@ -49551,9 +49887,9 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 77139, - "total_submitted": 152727, - "total_column_articles": 691, + "total_acs": 78334, + "total_submitted": 154629, + "total_column_articles": 713, "frontend_question_id": "329", "is_new_question": false }, @@ -49572,9 +49908,9 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 166473, - "total_submitted": 254596, - "total_column_articles": 1338, + "total_acs": 168790, + "total_submitted": 258173, + "total_column_articles": 1347, "frontend_question_id": "328", "is_new_question": false }, @@ -49593,8 +49929,8 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 31638, - "total_submitted": 76197, + "total_acs": 32064, + "total_submitted": 77310, "total_column_articles": 274, "frontend_question_id": "327", "is_new_question": false @@ -49614,9 +49950,9 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 170403, - "total_submitted": 336049, - "total_column_articles": 740, + "total_acs": 172206, + "total_submitted": 339493, + "total_column_articles": 754, "frontend_question_id": "326", "is_new_question": false }, @@ -49635,9 +49971,9 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 13335, - "total_submitted": 25140, - "total_column_articles": 158, + "total_acs": 13528, + "total_submitted": 25518, + "total_column_articles": 160, "frontend_question_id": "325", "is_new_question": false }, @@ -49656,9 +49992,9 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 52824, - "total_submitted": 129933, - "total_column_articles": 340, + "total_acs": 53977, + "total_submitted": 132629, + "total_column_articles": 352, "frontend_question_id": "324", "is_new_question": false }, @@ -49677,9 +50013,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": 17154, - "total_submitted": 26435, - "total_column_articles": 247, + "total_acs": 17543, + "total_submitted": 27013, + "total_column_articles": 248, "frontend_question_id": "323", "is_new_question": false }, @@ -49698,9 +50034,9 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 466640, - "total_submitted": 1020575, - "total_column_articles": 2808, + "total_acs": 474999, + "total_submitted": 1037944, + "total_column_articles": 2861, "frontend_question_id": "322", "is_new_question": false }, @@ -49719,9 +50055,9 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 31277, - "total_submitted": 74313, - "total_column_articles": 260, + "total_acs": 31488, + "total_submitted": 74835, + "total_column_articles": 262, "frontend_question_id": "321", "is_new_question": false }, @@ -49740,8 +50076,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 3897, - "total_submitted": 5619, + "total_acs": 3955, + "total_submitted": 5698, "total_column_articles": 67, "frontend_question_id": "320", "is_new_question": false @@ -49761,9 +50097,9 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 53370, - "total_submitted": 93048, - "total_column_articles": 468, + "total_acs": 53657, + "total_submitted": 93543, + "total_column_articles": 472, "frontend_question_id": "319", "is_new_question": false }, @@ -49782,9 +50118,9 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 58325, - "total_submitted": 79130, - "total_column_articles": 548, + "total_acs": 58775, + "total_submitted": 79782, + "total_column_articles": 553, "frontend_question_id": "318", "is_new_question": false }, @@ -49803,9 +50139,9 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 6118, - "total_submitted": 12818, - "total_column_articles": 80, + "total_acs": 6204, + "total_submitted": 13009, + "total_column_articles": 82, "frontend_question_id": "317", "is_new_question": false }, @@ -49824,9 +50160,9 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 91989, - "total_submitted": 191934, - "total_column_articles": 726, + "total_acs": 93214, + "total_submitted": 194462, + "total_column_articles": 741, "frontend_question_id": "316", "is_new_question": false }, @@ -49845,9 +50181,9 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 64913, - "total_submitted": 152730, - "total_column_articles": 628, + "total_acs": 65910, + "total_submitted": 154894, + "total_column_articles": 637, "frontend_question_id": "315", "is_new_question": false }, @@ -49866,9 +50202,9 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 7473, - "total_submitted": 13467, - "total_column_articles": 128, + "total_acs": 7585, + "total_submitted": 13667, + "total_column_articles": 129, "frontend_question_id": "314", "is_new_question": false }, @@ -49887,9 +50223,9 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 49435, - "total_submitted": 83356, - "total_column_articles": 429, + "total_acs": 49865, + "total_submitted": 84233, + "total_column_articles": 432, "frontend_question_id": "313", "is_new_question": false }, @@ -49908,9 +50244,9 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 78962, - "total_submitted": 113801, - "total_column_articles": 525, + "total_acs": 80358, + "total_submitted": 115669, + "total_column_articles": 531, "frontend_question_id": "312", "is_new_question": false }, @@ -49929,8 +50265,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 5250, - "total_submitted": 6871, + "total_acs": 5311, + "total_submitted": 6945, "total_column_articles": 69, "frontend_question_id": "311", "is_new_question": false @@ -49950,9 +50286,9 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 49915, - "total_submitted": 115751, - "total_column_articles": 411, + "total_acs": 50359, + "total_submitted": 116905, + "total_column_articles": 415, "frontend_question_id": "310", "is_new_question": false }, @@ -49971,9 +50307,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": 185832, - "total_submitted": 294162, - "total_column_articles": 1485, + "total_acs": 189427, + "total_submitted": 299331, + "total_column_articles": 1506, "frontend_question_id": "309", "is_new_question": false }, @@ -49992,9 +50328,9 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 3238, - "total_submitted": 5112, - "total_column_articles": 67, + "total_acs": 3277, + "total_submitted": 5161, + "total_column_articles": 69, "frontend_question_id": "308", "is_new_question": false }, @@ -50013,9 +50349,9 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 54975, - "total_submitted": 107631, - "total_column_articles": 490, + "total_acs": 55610, + "total_submitted": 108851, + "total_column_articles": 496, "frontend_question_id": "307", "is_new_question": false }, @@ -50034,9 +50370,9 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 43012, - "total_submitted": 112550, - "total_column_articles": 620, + "total_acs": 43288, + "total_submitted": 113344, + "total_column_articles": 624, "frontend_question_id": "306", "is_new_question": false }, @@ -50055,9 +50391,9 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 6897, - "total_submitted": 16516, - "total_column_articles": 104, + "total_acs": 7031, + "total_submitted": 16789, + "total_column_articles": 106, "frontend_question_id": "305", "is_new_question": false }, @@ -50076,9 +50412,9 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 96217, - "total_submitted": 162101, - "total_column_articles": 991, + "total_acs": 97596, + "total_submitted": 164143, + "total_column_articles": 1009, "frontend_question_id": "304", "is_new_question": false }, @@ -50097,9 +50433,9 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 173321, - "total_submitted": 230517, - "total_column_articles": 1558, + "total_acs": 175456, + "total_submitted": 233081, + "total_column_articles": 1571, "frontend_question_id": "303", "is_new_question": false }, @@ -50118,8 +50454,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 2996, - "total_submitted": 4487, + "total_acs": 3036, + "total_submitted": 4543, "total_column_articles": 55, "frontend_question_id": "302", "is_new_question": false @@ -50139,9 +50475,9 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 73433, - "total_submitted": 133071, - "total_column_articles": 492, + "total_acs": 74775, + "total_submitted": 135521, + "total_column_articles": 497, "frontend_question_id": "301", "is_new_question": false }, @@ -50160,9 +50496,9 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 550505, - "total_submitted": 1025768, - "total_column_articles": 3358, + "total_acs": 560101, + "total_submitted": 1042139, + "total_column_articles": 3425, "frontend_question_id": "300", "is_new_question": false }, @@ -50181,9 +50517,9 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 69373, - "total_submitted": 122332, - "total_column_articles": 776, + "total_acs": 70369, + "total_submitted": 123896, + "total_column_articles": 798, "frontend_question_id": "299", "is_new_question": false }, @@ -50202,9 +50538,9 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 7286, - "total_submitted": 12244, - "total_column_articles": 114, + "total_acs": 7411, + "total_submitted": 12441, + "total_column_articles": 117, "frontend_question_id": "298", "is_new_question": false }, @@ -50223,9 +50559,9 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 164459, - "total_submitted": 283842, - "total_column_articles": 1093, + "total_acs": 167417, + "total_submitted": 288627, + "total_column_articles": 1104, "frontend_question_id": "297", "is_new_question": false }, @@ -50244,9 +50580,9 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 3456, - "total_submitted": 5588, - "total_column_articles": 59, + "total_acs": 3508, + "total_submitted": 5679, + "total_column_articles": 60, "frontend_question_id": "296", "is_new_question": false }, @@ -50265,9 +50601,9 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 86689, - "total_submitted": 164161, - "total_column_articles": 648, + "total_acs": 87747, + "total_submitted": 166175, + "total_column_articles": 652, "frontend_question_id": "295", "is_new_question": false }, @@ -50286,9 +50622,9 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 5092, - "total_submitted": 8639, - "total_column_articles": 76, + "total_acs": 5169, + "total_submitted": 8758, + "total_column_articles": 77, "frontend_question_id": "294", "is_new_question": false }, @@ -50307,8 +50643,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 6605, - "total_submitted": 9185, + "total_acs": 6675, + "total_submitted": 9260, "total_column_articles": 107, "frontend_question_id": "293", "is_new_question": false @@ -50328,9 +50664,9 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 136391, - "total_submitted": 192934, - "total_column_articles": 905, + "total_acs": 137288, + "total_submitted": 194270, + "total_column_articles": 917, "frontend_question_id": "292", "is_new_question": false }, @@ -50349,8 +50685,8 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 3683, - "total_submitted": 6964, + "total_acs": 3756, + "total_submitted": 7108, "total_column_articles": 82, "frontend_question_id": "291", "is_new_question": false @@ -50370,9 +50706,9 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 106753, - "total_submitted": 236468, - "total_column_articles": 1414, + "total_acs": 107812, + "total_submitted": 238917, + "total_column_articles": 1435, "frontend_question_id": "290", "is_new_question": false }, @@ -50391,9 +50727,9 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 64123, - "total_submitted": 84926, - "total_column_articles": 973, + "total_acs": 64713, + "total_submitted": 85709, + "total_column_articles": 985, "frontend_question_id": "289", "is_new_question": false }, @@ -50412,8 +50748,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 5136, - "total_submitted": 10763, + "total_acs": 5200, + "total_submitted": 10875, "total_column_articles": 76, "frontend_question_id": "288", "is_new_question": false @@ -50433,9 +50769,9 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 250020, - "total_submitted": 385768, - "total_column_articles": 1648, + "total_acs": 253959, + "total_submitted": 392035, + "total_column_articles": 1664, "frontend_question_id": "287", "is_new_question": false }, @@ -50454,9 +50790,9 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 16008, - "total_submitted": 29912, - "total_column_articles": 209, + "total_acs": 16186, + "total_submitted": 30193, + "total_column_articles": 212, "frontend_question_id": "286", "is_new_question": false }, @@ -50475,9 +50811,9 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 12358, - "total_submitted": 19256, - "total_column_articles": 160, + "total_acs": 12545, + "total_submitted": 19547, + "total_column_articles": 161, "frontend_question_id": "285", "is_new_question": false }, @@ -50496,9 +50832,9 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 28549, - "total_submitted": 37185, - "total_column_articles": 237, + "total_acs": 28748, + "total_submitted": 37468, + "total_column_articles": 239, "frontend_question_id": "284", "is_new_question": false }, @@ -50517,9 +50853,9 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 787821, - "total_submitted": 1230347, - "total_column_articles": 4914, + "total_acs": 801473, + "total_submitted": 1251563, + "total_column_articles": 4996, "frontend_question_id": "283", "is_new_question": false }, @@ -50538,9 +50874,9 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 22844, - "total_submitted": 47967, - "total_column_articles": 191, + "total_acs": 23109, + "total_submitted": 48569, + "total_column_articles": 196, "frontend_question_id": "282", "is_new_question": false }, @@ -50559,8 +50895,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 4148, - "total_submitted": 5436, + "total_acs": 4228, + "total_submitted": 5553, "total_column_articles": 102, "frontend_question_id": "281", "is_new_question": false @@ -50580,9 +50916,9 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 8106, - "total_submitted": 11736, - "total_column_articles": 99, + "total_acs": 8212, + "total_submitted": 11884, + "total_column_articles": 100, "frontend_question_id": "280", "is_new_question": false }, @@ -50601,9 +50937,9 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 301500, - "total_submitted": 462625, - "total_column_articles": 1652, + "total_acs": 306882, + "total_submitted": 470387, + "total_column_articles": 1677, "frontend_question_id": "279", "is_new_question": false }, @@ -50622,9 +50958,9 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 350230, - "total_submitted": 770776, - "total_column_articles": 1929, + "total_acs": 357712, + "total_submitted": 786414, + "total_column_articles": 1976, "frontend_question_id": "278", "is_new_question": false }, @@ -50643,9 +50979,9 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 11489, - "total_submitted": 19741, - "total_column_articles": 122, + "total_acs": 11655, + "total_submitted": 20019, + "total_column_articles": 123, "frontend_question_id": "277", "is_new_question": false }, @@ -50664,9 +51000,9 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 9044, - "total_submitted": 17473, - "total_column_articles": 168, + "total_acs": 9118, + "total_submitted": 17593, + "total_column_articles": 170, "frontend_question_id": "276", "is_new_question": false }, @@ -50685,8 +51021,8 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 59844, - "total_submitted": 131281, + "total_acs": 60390, + "total_submitted": 132441, "total_column_articles": 498, "frontend_question_id": "275", "is_new_question": false @@ -50706,9 +51042,9 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 64244, - "total_submitted": 145207, - "total_column_articles": 662, + "total_acs": 64754, + "total_submitted": 146227, + "total_column_articles": 672, "frontend_question_id": "274", "is_new_question": false }, @@ -50727,9 +51063,9 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 33258, - "total_submitted": 91162, - "total_column_articles": 394, + "total_acs": 33503, + "total_submitted": 91798, + "total_column_articles": 395, "frontend_question_id": "273", "is_new_question": false }, @@ -50748,9 +51084,9 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 4993, - "total_submitted": 7614, - "total_column_articles": 104, + "total_acs": 5080, + "total_submitted": 7722, + "total_column_articles": 105, "frontend_question_id": "272", "is_new_question": false }, @@ -50769,8 +51105,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 3747, - "total_submitted": 6552, + "total_acs": 3809, + "total_submitted": 6651, "total_column_articles": 61, "frontend_question_id": "271", "is_new_question": false @@ -50790,9 +51126,9 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 14450, - "total_submitted": 25065, - "total_column_articles": 173, + "total_acs": 14666, + "total_submitted": 25405, + "total_column_articles": 174, "frontend_question_id": "270", "is_new_question": false }, @@ -50811,8 +51147,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 9633, - "total_submitted": 26966, + "total_acs": 9769, + "total_submitted": 27348, "total_column_articles": 158, "frontend_question_id": "269", "is_new_question": false @@ -50832,9 +51168,9 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 241914, - "total_submitted": 367373, - "total_column_articles": 1837, + "total_acs": 245020, + "total_submitted": 371864, + "total_column_articles": 1851, "frontend_question_id": "268", "is_new_question": false }, @@ -50853,9 +51189,9 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 4928, - "total_submitted": 10699, - "total_column_articles": 103, + "total_acs": 5007, + "total_submitted": 10876, + "total_column_articles": 105, "frontend_question_id": "267", "is_new_question": false }, @@ -50874,8 +51210,8 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 9488, - "total_submitted": 13659, + "total_acs": 9578, + "total_submitted": 13782, "total_column_articles": 140, "frontend_question_id": "266", "is_new_question": false @@ -50895,9 +51231,9 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 10707, - "total_submitted": 17175, - "total_column_articles": 235, + "total_acs": 10836, + "total_submitted": 17371, + "total_column_articles": 236, "frontend_question_id": "265", "is_new_question": false }, @@ -50916,9 +51252,9 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 129780, - "total_submitted": 221592, - "total_column_articles": 809, + "total_acs": 131102, + "total_submitted": 223701, + "total_column_articles": 826, "frontend_question_id": "264", "is_new_question": false }, @@ -50937,9 +51273,9 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 129133, - "total_submitted": 252326, - "total_column_articles": 983, + "total_acs": 130103, + "total_submitted": 254297, + "total_column_articles": 996, "frontend_question_id": "263", "is_new_question": false }, @@ -50958,9 +51294,9 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 50599, - "total_submitted": 119252, - "total_column_articles": 491, + "total_acs": 51176, + "total_submitted": 120725, + "total_column_articles": 499, "frontend_question_id": "262", "is_new_question": false }, @@ -50979,9 +51315,9 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 13318, - "total_submitted": 26325, - "total_column_articles": 185, + "total_acs": 13543, + "total_submitted": 26741, + "total_column_articles": 186, "frontend_question_id": "261", "is_new_question": false }, @@ -51000,9 +51336,9 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 93527, - "total_submitted": 127198, - "total_column_articles": 816, + "total_acs": 94428, + "total_submitted": 128481, + "total_column_articles": 828, "frontend_question_id": "260", "is_new_question": false }, @@ -51021,9 +51357,9 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 10181, - "total_submitted": 18229, - "total_column_articles": 119, + "total_acs": 10294, + "total_submitted": 18452, + "total_column_articles": 120, "frontend_question_id": "259", "is_new_question": false }, @@ -51042,9 +51378,9 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 139821, - "total_submitted": 196750, - "total_column_articles": 1187, + "total_acs": 140715, + "total_submitted": 197971, + "total_column_articles": 1209, "frontend_question_id": "258", "is_new_question": false }, @@ -51063,9 +51399,9 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 222456, - "total_submitted": 318314, - "total_column_articles": 1522, + "total_acs": 226823, + "total_submitted": 324236, + "total_column_articles": 1545, "frontend_question_id": "257", "is_new_question": false }, @@ -51084,9 +51420,9 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 17243, - "total_submitted": 25425, - "total_column_articles": 264, + "total_acs": 17456, + "total_submitted": 25688, + "total_column_articles": 267, "frontend_question_id": "256", "is_new_question": false }, @@ -51105,9 +51441,9 @@ "question__title": "Verify Preorder Sequence in Binary Search Tree", "question__title_slug": "verify-preorder-sequence-in-binary-search-tree", "question__hide": false, - "total_acs": 7502, - "total_submitted": 15420, - "total_column_articles": 91, + "total_acs": 7625, + "total_submitted": 15599, + "total_column_articles": 93, "frontend_question_id": "255", "is_new_question": false }, @@ -51126,8 +51462,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 8059, - "total_submitted": 14064, + "total_acs": 8181, + "total_submitted": 14256, "total_column_articles": 115, "frontend_question_id": "254", "is_new_question": false @@ -51147,9 +51483,9 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 50569, - "total_submitted": 97923, - "total_column_articles": 493, + "total_acs": 51473, + "total_submitted": 99682, + "total_column_articles": 495, "frontend_question_id": "253", "is_new_question": false }, @@ -51168,8 +51504,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 18411, - "total_submitted": 32144, + "total_acs": 18667, + "total_submitted": 32545, "total_column_articles": 205, "frontend_question_id": "252", "is_new_question": false @@ -51189,9 +51525,9 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 5610, - "total_submitted": 10102, - "total_column_articles": 96, + "total_acs": 5697, + "total_submitted": 10271, + "total_column_articles": 97, "frontend_question_id": "251", "is_new_question": false }, @@ -51210,9 +51546,9 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 6270, - "total_submitted": 9877, - "total_column_articles": 121, + "total_acs": 6355, + "total_submitted": 10013, + "total_column_articles": 123, "frontend_question_id": "250", "is_new_question": false }, @@ -51231,9 +51567,9 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 8474, - "total_submitted": 13030, - "total_column_articles": 148, + "total_acs": 8596, + "total_submitted": 13203, + "total_column_articles": 149, "frontend_question_id": "249", "is_new_question": false }, @@ -51252,8 +51588,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 3585, - "total_submitted": 7406, + "total_acs": 3623, + "total_submitted": 7482, "total_column_articles": 70, "frontend_question_id": "248", "is_new_question": false @@ -51273,8 +51609,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 7087, - "total_submitted": 13176, + "total_acs": 7165, + "total_submitted": 13315, "total_column_articles": 123, "frontend_question_id": "247", "is_new_question": false @@ -51294,8 +51630,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 8447, - "total_submitted": 17724, + "total_acs": 8551, + "total_submitted": 17932, "total_column_articles": 151, "frontend_question_id": "246", "is_new_question": false @@ -51315,9 +51651,9 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 6173, - "total_submitted": 10692, - "total_column_articles": 82, + "total_acs": 6251, + "total_submitted": 10844, + "total_column_articles": 83, "frontend_question_id": "245", "is_new_question": false }, @@ -51336,9 +51672,9 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 7816, - "total_submitted": 13429, - "total_column_articles": 94, + "total_acs": 7930, + "total_submitted": 13589, + "total_column_articles": 95, "frontend_question_id": "244", "is_new_question": false }, @@ -51357,9 +51693,9 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 12681, - "total_submitted": 19114, - "total_column_articles": 152, + "total_acs": 12849, + "total_submitted": 19355, + "total_column_articles": 155, "frontend_question_id": "243", "is_new_question": false }, @@ -51378,9 +51714,9 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 442782, - "total_submitted": 676451, - "total_column_articles": 2510, + "total_acs": 450497, + "total_submitted": 687683, + "total_column_articles": 2548, "frontend_question_id": "242", "is_new_question": false }, @@ -51399,9 +51735,9 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 45849, - "total_submitted": 62236, - "total_column_articles": 426, + "total_acs": 64169, + "total_submitted": 84791, + "total_column_articles": 603, "frontend_question_id": "241", "is_new_question": false }, @@ -51420,9 +51756,9 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 286789, - "total_submitted": 556618, - "total_column_articles": 1410, + "total_acs": 291118, + "total_submitted": 563814, + "total_column_articles": 1435, "frontend_question_id": "240", "is_new_question": false }, @@ -51441,9 +51777,9 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 313035, - "total_submitted": 626777, - "total_column_articles": 2170, + "total_acs": 319434, + "total_submitted": 639438, + "total_column_articles": 2239, "frontend_question_id": "239", "is_new_question": false }, @@ -51462,9 +51798,9 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 201616, - "total_submitted": 273014, - "total_column_articles": 1281, + "total_acs": 204866, + "total_submitted": 277142, + "total_column_articles": 1297, "frontend_question_id": "238", "is_new_question": false }, @@ -51483,9 +51819,9 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 298322, - "total_submitted": 347194, - "total_column_articles": 1563, + "total_acs": 300887, + "total_submitted": 350152, + "total_column_articles": 1574, "frontend_question_id": "237", "is_new_question": false }, @@ -51504,9 +51840,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": 402232, - "total_submitted": 581806, - "total_column_articles": 2101, + "total_acs": 409432, + "total_submitted": 592061, + "total_column_articles": 2126, "frontend_question_id": "236", "is_new_question": false }, @@ -51525,9 +51861,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": 253315, - "total_submitted": 375574, - "total_column_articles": 1419, + "total_acs": 258370, + "total_submitted": 382828, + "total_column_articles": 1445, "frontend_question_id": "235", "is_new_question": false }, @@ -51546,9 +51882,9 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 455480, - "total_submitted": 877933, - "total_column_articles": 2796, + "total_acs": 463187, + "total_submitted": 890623, + "total_column_articles": 2820, "frontend_question_id": "234", "is_new_question": false }, @@ -51567,9 +51903,9 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 43182, - "total_submitted": 89375, - "total_column_articles": 517, + "total_acs": 43584, + "total_submitted": 90152, + "total_column_articles": 520, "frontend_question_id": "233", "is_new_question": false }, @@ -51588,9 +51924,9 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 251781, - "total_submitted": 365693, - "total_column_articles": 1821, + "total_acs": 256406, + "total_submitted": 372367, + "total_column_articles": 1842, "frontend_question_id": "232", "is_new_question": false }, @@ -51609,9 +51945,9 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 234475, - "total_submitted": 464538, - "total_column_articles": 1696, + "total_acs": 236874, + "total_submitted": 469330, + "total_column_articles": 1714, "frontend_question_id": "231", "is_new_question": false }, @@ -51630,9 +51966,9 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 217750, - "total_submitted": 288347, - "total_column_articles": 1501, + "total_acs": 220473, + "total_submitted": 291836, + "total_column_articles": 1517, "frontend_question_id": "230", "is_new_question": false }, @@ -51651,9 +51987,9 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 82286, - "total_submitted": 153399, - "total_column_articles": 767, + "total_acs": 82990, + "total_submitted": 154721, + "total_column_articles": 782, "frontend_question_id": "229", "is_new_question": false }, @@ -51672,9 +52008,9 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 74290, - "total_submitted": 131710, - "total_column_articles": 837, + "total_acs": 75063, + "total_submitted": 133270, + "total_column_articles": 853, "frontend_question_id": "228", "is_new_question": false }, @@ -51693,9 +52029,9 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 117794, - "total_submitted": 267363, - "total_column_articles": 911, + "total_acs": 119447, + "total_submitted": 270943, + "total_column_articles": 931, "frontend_question_id": "227", "is_new_question": false }, @@ -51714,9 +52050,9 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 483611, - "total_submitted": 610420, - "total_column_articles": 3156, + "total_acs": 492431, + "total_submitted": 621217, + "total_column_articles": 3226, "frontend_question_id": "226", "is_new_question": false }, @@ -51735,9 +52071,9 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 203879, - "total_submitted": 301634, - "total_column_articles": 5125, + "total_acs": 207445, + "total_submitted": 306848, + "total_column_articles": 5141, "frontend_question_id": "225", "is_new_question": false }, @@ -51756,9 +52092,9 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 93006, - "total_submitted": 221594, - "total_column_articles": 810, + "total_acs": 94264, + "total_submitted": 224435, + "total_column_articles": 830, "frontend_question_id": "224", "is_new_question": false }, @@ -51777,9 +52113,9 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 48960, - "total_submitted": 92369, - "total_column_articles": 582, + "total_acs": 49301, + "total_submitted": 92953, + "total_column_articles": 583, "frontend_question_id": "223", "is_new_question": false }, @@ -51798,9 +52134,9 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 195616, - "total_submitted": 244674, - "total_column_articles": 1300, + "total_acs": 199764, + "total_submitted": 249750, + "total_column_articles": 1327, "frontend_question_id": "222", "is_new_question": false }, @@ -51819,9 +52155,9 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 206552, - "total_submitted": 421514, - "total_column_articles": 1356, + "total_acs": 210366, + "total_submitted": 428873, + "total_column_articles": 1376, "frontend_question_id": "221", "is_new_question": false }, @@ -51840,9 +52176,9 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 81492, - "total_submitted": 280725, - "total_column_articles": 536, + "total_acs": 82291, + "total_submitted": 283261, + "total_column_articles": 544, "frontend_question_id": "220", "is_new_question": false }, @@ -51861,9 +52197,9 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 187701, - "total_submitted": 422918, - "total_column_articles": 1537, + "total_acs": 189709, + "total_submitted": 427483, + "total_column_articles": 1552, "frontend_question_id": "219", "is_new_question": false }, @@ -51882,9 +52218,9 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 40648, - "total_submitted": 74057, - "total_column_articles": 355, + "total_acs": 41031, + "total_submitted": 74712, + "total_column_articles": 359, "frontend_question_id": "218", "is_new_question": false }, @@ -51903,9 +52239,9 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 599467, - "total_submitted": 1076633, - "total_column_articles": 2803, + "total_acs": 609409, + "total_submitted": 1094464, + "total_column_articles": 2845, "frontend_question_id": "217", "is_new_question": false }, @@ -51924,9 +52260,9 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 170711, - "total_submitted": 234962, - "total_column_articles": 1485, + "total_acs": 174704, + "total_submitted": 240661, + "total_column_articles": 1514, "frontend_question_id": "216", "is_new_question": false }, @@ -51945,9 +52281,9 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 662903, - "total_submitted": 1023650, - "total_column_articles": 3294, + "total_acs": 674043, + "total_submitted": 1040607, + "total_column_articles": 3337, "frontend_question_id": "215", "is_new_question": false }, @@ -51966,9 +52302,9 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 38052, - "total_submitted": 99223, - "total_column_articles": 386, + "total_acs": 38502, + "total_submitted": 100193, + "total_column_articles": 391, "frontend_question_id": "214", "is_new_question": false }, @@ -51987,9 +52323,9 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 256793, - "total_submitted": 586359, - "total_column_articles": 2242, + "total_acs": 260644, + "total_submitted": 594817, + "total_column_articles": 2253, "frontend_question_id": "213", "is_new_question": false }, @@ -52008,9 +52344,9 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 77691, - "total_submitted": 170799, - "total_column_articles": 683, + "total_acs": 78387, + "total_submitted": 172558, + "total_column_articles": 686, "frontend_question_id": "212", "is_new_question": false }, @@ -52029,9 +52365,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": 60875, - "total_submitted": 120369, - "total_column_articles": 637, + "total_acs": 61587, + "total_submitted": 122093, + "total_column_articles": 645, "frontend_question_id": "211", "is_new_question": false }, @@ -52050,9 +52386,9 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 134427, - "total_submitted": 241161, - "total_column_articles": 1012, + "total_acs": 136735, + "total_submitted": 245162, + "total_column_articles": 1028, "frontend_question_id": "210", "is_new_question": false }, @@ -52071,9 +52407,9 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 358840, - "total_submitted": 735764, - "total_column_articles": 2386, + "total_acs": 368428, + "total_submitted": 756973, + "total_column_articles": 2421, "frontend_question_id": "209", "is_new_question": false }, @@ -52092,9 +52428,9 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 205864, - "total_submitted": 286252, - "total_column_articles": 1330, + "total_acs": 209917, + "total_submitted": 291829, + "total_column_articles": 1359, "frontend_question_id": "208", "is_new_question": false }, @@ -52113,9 +52449,9 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 221156, - "total_submitted": 410634, - "total_column_articles": 1513, + "total_acs": 225216, + "total_submitted": 418137, + "total_column_articles": 1538, "frontend_question_id": "207", "is_new_question": false }, @@ -52134,9 +52470,9 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 1096101, - "total_submitted": 1499934, - "total_column_articles": 9544, + "total_acs": 1116638, + "total_submitted": 1527101, + "total_column_articles": 9643, "frontend_question_id": "206", "is_new_question": false }, @@ -52155,9 +52491,9 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 147841, - "total_submitted": 296394, - "total_column_articles": 1125, + "total_acs": 152288, + "total_submitted": 305442, + "total_column_articles": 1169, "frontend_question_id": "205", "is_new_question": false }, @@ -52176,9 +52512,9 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 209169, - "total_submitted": 557320, - "total_column_articles": 896, + "total_acs": 212341, + "total_submitted": 565540, + "total_column_articles": 927, "frontend_question_id": "204", "is_new_question": false }, @@ -52197,9 +52533,9 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 378921, - "total_submitted": 704312, - "total_column_articles": 2448, + "total_acs": 386970, + "total_submitted": 718250, + "total_column_articles": 2477, "frontend_question_id": "203", "is_new_question": false }, @@ -52218,9 +52554,9 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 263285, - "total_submitted": 418220, - "total_column_articles": 2028, + "total_acs": 269251, + "total_submitted": 427391, + "total_column_articles": 2063, "frontend_question_id": "202", "is_new_question": false }, @@ -52239,9 +52575,9 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 63211, - "total_submitted": 118131, - "total_column_articles": 438, + "total_acs": 63827, + "total_submitted": 119221, + "total_column_articles": 447, "frontend_question_id": "201", "is_new_question": false }, @@ -52260,9 +52596,9 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 497378, - "total_submitted": 857317, - "total_column_articles": 3125, + "total_acs": 506194, + "total_submitted": 870925, + "total_column_articles": 3165, "frontend_question_id": "200", "is_new_question": false }, @@ -52281,9 +52617,9 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 217248, - "total_submitted": 331295, - "total_column_articles": 2227, + "total_acs": 220895, + "total_submitted": 336660, + "total_column_articles": 2246, "frontend_question_id": "199", "is_new_question": false }, @@ -52302,9 +52638,9 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 576285, - "total_submitted": 1079221, - "total_column_articles": 3837, + "total_acs": 584645, + "total_submitted": 1093306, + "total_column_articles": 3872, "frontend_question_id": "198", "is_new_question": false }, @@ -52323,9 +52659,9 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 129667, - "total_submitted": 242002, - "total_column_articles": 725, + "total_acs": 131955, + "total_submitted": 245921, + "total_column_articles": 734, "frontend_question_id": "197", "is_new_question": false }, @@ -52344,9 +52680,9 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 146039, - "total_submitted": 216492, - "total_column_articles": 570, + "total_acs": 149656, + "total_submitted": 221487, + "total_column_articles": 578, "frontend_question_id": "196", "is_new_question": false }, @@ -52365,8 +52701,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 43825, - "total_submitted": 99678, + "total_acs": 44143, + "total_submitted": 100386, "total_column_articles": 174, "frontend_question_id": "195", "is_new_question": false @@ -52386,9 +52722,9 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 12743, - "total_submitted": 36677, - "total_column_articles": 88, + "total_acs": 12843, + "total_submitted": 37035, + "total_column_articles": 87, "frontend_question_id": "194", "is_new_question": false }, @@ -52407,8 +52743,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 32318, - "total_submitted": 97241, + "total_acs": 32564, + "total_submitted": 97925, "total_column_articles": 166, "frontend_question_id": "193", "is_new_question": false @@ -52428,9 +52764,9 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 26353, - "total_submitted": 73547, - "total_column_articles": 207, + "total_acs": 26552, + "total_submitted": 74186, + "total_column_articles": 209, "frontend_question_id": "192", "is_new_question": false }, @@ -52449,9 +52785,9 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 263491, - "total_submitted": 347108, - "total_column_articles": 1672, + "total_acs": 266641, + "total_submitted": 351088, + "total_column_articles": 1690, "frontend_question_id": "191", "is_new_question": false }, @@ -52470,9 +52806,9 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 175387, - "total_submitted": 246537, - "total_column_articles": 1096, + "total_acs": 177182, + "total_submitted": 248921, + "total_column_articles": 1114, "frontend_question_id": "190", "is_new_question": false }, @@ -52491,9 +52827,9 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 520492, - "total_submitted": 1172898, - "total_column_articles": 2612, + "total_acs": 527220, + "total_submitted": 1188025, + "total_column_articles": 2646, "frontend_question_id": "189", "is_new_question": false }, @@ -52512,9 +52848,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": 134306, - "total_submitted": 321147, - "total_column_articles": 1037, + "total_acs": 136871, + "total_submitted": 326478, + "total_column_articles": 1047, "frontend_question_id": "188", "is_new_question": false }, @@ -52533,9 +52869,9 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 104928, - "total_submitted": 198659, - "total_column_articles": 768, + "total_acs": 106601, + "total_submitted": 201691, + "total_column_articles": 774, "frontend_question_id": "187", "is_new_question": false }, @@ -52554,8 +52890,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 10497, - "total_submitted": 13865, + "total_acs": 10599, + "total_submitted": 14017, "total_column_articles": 157, "frontend_question_id": "186", "is_new_question": false @@ -52575,9 +52911,9 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 94023, - "total_submitted": 182375, - "total_column_articles": 823, + "total_acs": 95116, + "total_submitted": 184159, + "total_column_articles": 830, "frontend_question_id": "185", "is_new_question": false }, @@ -52596,9 +52932,9 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 134767, - "total_submitted": 271244, - "total_column_articles": 891, + "total_acs": 136357, + "total_submitted": 273954, + "total_column_articles": 898, "frontend_question_id": "184", "is_new_question": false }, @@ -52617,9 +52953,9 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 222344, - "total_submitted": 333085, - "total_column_articles": 816, + "total_acs": 228421, + "total_submitted": 342416, + "total_column_articles": 832, "frontend_question_id": "183", "is_new_question": false }, @@ -52638,9 +52974,9 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 235190, - "total_submitted": 296451, - "total_column_articles": 803, + "total_acs": 237885, + "total_submitted": 299861, + "total_column_articles": 813, "frontend_question_id": "182", "is_new_question": false }, @@ -52659,9 +52995,9 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 216812, - "total_submitted": 313416, - "total_column_articles": 902, + "total_acs": 219365, + "total_submitted": 317220, + "total_column_articles": 910, "frontend_question_id": "181", "is_new_question": false }, @@ -52680,9 +53016,9 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 115921, - "total_submitted": 240106, - "total_column_articles": 687, + "total_acs": 117343, + "total_submitted": 242973, + "total_column_articles": 693, "frontend_question_id": "180", "is_new_question": false }, @@ -52701,9 +53037,9 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 161574, - "total_submitted": 392570, - "total_column_articles": 1232, + "total_acs": 163545, + "total_submitted": 397527, + "total_column_articles": 1249, "frontend_question_id": "179", "is_new_question": false }, @@ -52722,9 +53058,9 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 156475, - "total_submitted": 258334, - "total_column_articles": 839, + "total_acs": 158340, + "total_submitted": 261218, + "total_column_articles": 850, "frontend_question_id": "178", "is_new_question": false }, @@ -52743,9 +53079,9 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 165390, - "total_submitted": 355327, - "total_column_articles": 667, + "total_acs": 167170, + "total_submitted": 358866, + "total_column_articles": 676, "frontend_question_id": "177", "is_new_question": false }, @@ -52764,9 +53100,9 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 323420, - "total_submitted": 903815, - "total_column_articles": 1334, + "total_acs": 327374, + "total_submitted": 914117, + "total_column_articles": 1356, "frontend_question_id": "176", "is_new_question": false }, @@ -52785,9 +53121,9 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 394368, - "total_submitted": 535136, - "total_column_articles": 1822, + "total_acs": 398854, + "total_submitted": 541078, + "total_column_articles": 1837, "frontend_question_id": "175", "is_new_question": false }, @@ -52806,9 +53142,9 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 50206, - "total_submitted": 103629, - "total_column_articles": 1017, + "total_acs": 50865, + "total_submitted": 104809, + "total_column_articles": 1056, "frontend_question_id": "174", "is_new_question": false }, @@ -52827,9 +53163,9 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 95907, - "total_submitted": 118234, - "total_column_articles": 784, + "total_acs": 96869, + "total_submitted": 119372, + "total_column_articles": 796, "frontend_question_id": "173", "is_new_question": false }, @@ -52848,9 +53184,9 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 145042, - "total_submitted": 298261, - "total_column_articles": 971, + "total_acs": 146144, + "total_submitted": 300151, + "total_column_articles": 982, "frontend_question_id": "172", "is_new_question": false }, @@ -52869,9 +53205,9 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 135246, - "total_submitted": 188783, - "total_column_articles": 1133, + "total_acs": 136614, + "total_submitted": 190742, + "total_column_articles": 1149, "frontend_question_id": "171", "is_new_question": false }, @@ -52890,8 +53226,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 13200, - "total_submitted": 30860, + "total_acs": 13374, + "total_submitted": 31265, "total_column_articles": 129, "frontend_question_id": "170", "is_new_question": false @@ -52911,9 +53247,9 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 543467, - "total_submitted": 812711, - "total_column_articles": 2984, + "total_acs": 550841, + "total_submitted": 823539, + "total_column_articles": 3013, "frontend_question_id": "169", "is_new_question": false }, @@ -52932,9 +53268,9 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 110622, - "total_submitted": 252961, - "total_column_articles": 953, + "total_acs": 111890, + "total_submitted": 255925, + "total_column_articles": 973, "frontend_question_id": "168", "is_new_question": false }, @@ -52953,9 +53289,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": 448972, - "total_submitted": 764909, - "total_column_articles": 2884, + "total_acs": 455047, + "total_submitted": 774828, + "total_column_articles": 2916, "frontend_question_id": "167", "is_new_question": false }, @@ -52974,9 +53310,9 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 52954, - "total_submitted": 158689, - "total_column_articles": 454, + "total_acs": 53500, + "total_submitted": 160361, + "total_column_articles": 462, "frontend_question_id": "166", "is_new_question": false }, @@ -52995,9 +53331,9 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 117040, - "total_submitted": 225162, - "total_column_articles": 1115, + "total_acs": 118711, + "total_submitted": 228545, + "total_column_articles": 1132, "frontend_question_id": "165", "is_new_question": false }, @@ -53016,9 +53352,9 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 72141, - "total_submitted": 118880, - "total_column_articles": 586, + "total_acs": 72690, + "total_submitted": 119866, + "total_column_articles": 589, "frontend_question_id": "164", "is_new_question": false }, @@ -53037,8 +53373,8 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 14277, - "total_submitted": 41096, + "total_acs": 14545, + "total_submitted": 41789, "total_column_articles": 210, "frontend_question_id": "163", "is_new_question": false @@ -53058,9 +53394,9 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 237599, - "total_submitted": 480106, - "total_column_articles": 1576, + "total_acs": 241077, + "total_submitted": 486929, + "total_column_articles": 1590, "frontend_question_id": "162", "is_new_question": false }, @@ -53079,9 +53415,9 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 10653, - "total_submitted": 31386, - "total_column_articles": 136, + "total_acs": 10820, + "total_submitted": 31857, + "total_column_articles": 139, "frontend_question_id": "161", "is_new_question": false }, @@ -53100,9 +53436,9 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 501238, - "total_submitted": 796252, - "total_column_articles": 2943, + "total_acs": 509613, + "total_submitted": 808914, + "total_column_articles": 2987, "frontend_question_id": "160", "is_new_question": false }, @@ -53121,9 +53457,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": 24204, - "total_submitted": 43508, - "total_column_articles": 274, + "total_acs": 24554, + "total_submitted": 44055, + "total_column_articles": 278, "frontend_question_id": "159", "is_new_question": false }, @@ -53142,9 +53478,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": 4030, - "total_submitted": 6726, - "total_column_articles": 87, + "total_acs": 4083, + "total_submitted": 6819, + "total_column_articles": 88, "frontend_question_id": "158", "is_new_question": false }, @@ -53163,9 +53499,9 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 8019, - "total_submitted": 14751, - "total_column_articles": 113, + "total_acs": 8132, + "total_submitted": 14976, + "total_column_articles": 115, "frontend_question_id": "157", "is_new_question": false }, @@ -53184,9 +53520,9 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 10195, - "total_submitted": 14081, - "total_column_articles": 187, + "total_acs": 10382, + "total_submitted": 14316, + "total_column_articles": 189, "frontend_question_id": "156", "is_new_question": false }, @@ -53205,9 +53541,9 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 395637, - "total_submitted": 678753, - "total_column_articles": 2156, + "total_acs": 400206, + "total_submitted": 686049, + "total_column_articles": 2167, "frontend_question_id": "155", "is_new_question": false }, @@ -53226,9 +53562,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": 145617, - "total_submitted": 275175, - "total_column_articles": 1112, + "total_acs": 147096, + "total_submitted": 278089, + "total_column_articles": 1131, "frontend_question_id": "154", "is_new_question": false }, @@ -53247,9 +53583,9 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 299333, - "total_submitted": 525586, - "total_column_articles": 2047, + "total_acs": 303136, + "total_submitted": 532168, + "total_column_articles": 2065, "frontend_question_id": "153", "is_new_question": false }, @@ -53268,9 +53604,9 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 278867, - "total_submitted": 652451, - "total_column_articles": 1747, + "total_acs": 283673, + "total_submitted": 662995, + "total_column_articles": 1769, "frontend_question_id": "152", "is_new_question": false }, @@ -53289,9 +53625,9 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 267489, - "total_submitted": 529379, - "total_column_articles": 2100, + "total_acs": 272692, + "total_submitted": 539039, + "total_column_articles": 2132, "frontend_question_id": "151", "is_new_question": false }, @@ -53310,9 +53646,9 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 196615, - "total_submitted": 365947, - "total_column_articles": 1502, + "total_acs": 200178, + "total_submitted": 372386, + "total_column_articles": 1524, "frontend_question_id": "150", "is_new_question": false }, @@ -53331,9 +53667,9 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 63800, - "total_submitted": 170622, - "total_column_articles": 655, + "total_acs": 64574, + "total_submitted": 172239, + "total_column_articles": 658, "frontend_question_id": "149", "is_new_question": false }, @@ -53352,9 +53688,9 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 311040, - "total_submitted": 468499, - "total_column_articles": 1775, + "total_acs": 316820, + "total_submitted": 477317, + "total_column_articles": 1798, "frontend_question_id": "148", "is_new_question": false }, @@ -53373,9 +53709,9 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 125797, - "total_submitted": 182351, - "total_column_articles": 958, + "total_acs": 126920, + "total_submitted": 183856, + "total_column_articles": 973, "frontend_question_id": "147", "is_new_question": false }, @@ -53394,9 +53730,9 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 367649, - "total_submitted": 694520, - "total_column_articles": 2637, + "total_acs": 374228, + "total_submitted": 706137, + "total_column_articles": 2690, "frontend_question_id": "146", "is_new_question": false }, @@ -53415,9 +53751,9 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 463352, - "total_submitted": 610040, - "total_column_articles": 2174, + "total_acs": 470813, + "total_submitted": 619501, + "total_column_articles": 2202, "frontend_question_id": "145", "is_new_question": false }, @@ -53436,9 +53772,9 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 634958, - "total_submitted": 892696, - "total_column_articles": 2734, + "total_acs": 645705, + "total_submitted": 907544, + "total_column_articles": 2782, "frontend_question_id": "144", "is_new_question": false }, @@ -53457,9 +53793,9 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 189709, - "total_submitted": 296438, - "total_column_articles": 1472, + "total_acs": 193034, + "total_submitted": 301482, + "total_column_articles": 1503, "frontend_question_id": "143", "is_new_question": false }, @@ -53478,9 +53814,9 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 475077, - "total_submitted": 845118, - "total_column_articles": 2762, + "total_acs": 486285, + "total_submitted": 864110, + "total_column_articles": 2816, "frontend_question_id": "142", "is_new_question": false }, @@ -53499,9 +53835,9 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 772484, - "total_submitted": 1500970, - "total_column_articles": 3964, + "total_acs": 783980, + "total_submitted": 1523397, + "total_column_articles": 4010, "frontend_question_id": "141", "is_new_question": false }, @@ -53520,9 +53856,9 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 70574, - "total_submitted": 131666, - "total_column_articles": 768, + "total_acs": 71485, + "total_submitted": 132784, + "total_column_articles": 789, "frontend_question_id": "140", "is_new_question": false }, @@ -53541,9 +53877,9 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 317266, - "total_submitted": 595503, - "total_column_articles": 1892, + "total_acs": 323787, + "total_submitted": 606790, + "total_column_articles": 1911, "frontend_question_id": "139", "is_new_question": false }, @@ -53562,9 +53898,9 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 156419, - "total_submitted": 233572, - "total_column_articles": 1127, + "total_acs": 158551, + "total_submitted": 236566, + "total_column_articles": 1147, "frontend_question_id": "138", "is_new_question": false }, @@ -53583,9 +53919,9 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 127294, - "total_submitted": 176438, - "total_column_articles": 939, + "total_acs": 128469, + "total_submitted": 178117, + "total_column_articles": 955, "frontend_question_id": "137", "is_new_question": false }, @@ -53604,9 +53940,9 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 715633, - "total_submitted": 990741, - "total_column_articles": 3243, + "total_acs": 725378, + "total_submitted": 1004188, + "total_column_articles": 3273, "frontend_question_id": "136", "is_new_question": false }, @@ -53625,9 +53961,9 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 152652, - "total_submitted": 309873, - "total_column_articles": 1158, + "total_acs": 155541, + "total_submitted": 315436, + "total_column_articles": 1182, "frontend_question_id": "135", "is_new_question": false }, @@ -53646,9 +53982,9 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 185597, - "total_submitted": 345789, - "total_column_articles": 1318, + "total_acs": 188887, + "total_submitted": 352728, + "total_column_articles": 1330, "frontend_question_id": "134", "is_new_question": false }, @@ -53667,9 +54003,9 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 94794, - "total_submitted": 138531, - "total_column_articles": 675, + "total_acs": 95704, + "total_submitted": 139827, + "total_column_articles": 678, "frontend_question_id": "133", "is_new_question": false }, @@ -53688,9 +54024,9 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 61682, - "total_submitted": 124370, - "total_column_articles": 527, + "total_acs": 62417, + "total_submitted": 125672, + "total_column_articles": 533, "frontend_question_id": "132", "is_new_question": false }, @@ -53709,9 +54045,9 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 206876, - "total_submitted": 283192, - "total_column_articles": 1297, + "total_acs": 210864, + "total_submitted": 288459, + "total_column_articles": 1329, "frontend_question_id": "131", "is_new_question": false }, @@ -53730,9 +54066,9 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 182953, - "total_submitted": 399938, - "total_column_articles": 1698, + "total_acs": 185260, + "total_submitted": 404660, + "total_column_articles": 1718, "frontend_question_id": "130", "is_new_question": false }, @@ -53751,9 +54087,9 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 169073, - "total_submitted": 243320, - "total_column_articles": 1481, + "total_acs": 171335, + "total_submitted": 246348, + "total_column_articles": 1505, "frontend_question_id": "129", "is_new_question": false }, @@ -53772,9 +54108,9 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 282637, - "total_submitted": 513672, - "total_column_articles": 1788, + "total_acs": 288276, + "total_submitted": 523810, + "total_column_articles": 1804, "frontend_question_id": "128", "is_new_question": false }, @@ -53793,9 +54129,9 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 155243, - "total_submitted": 325449, - "total_column_articles": 851, + "total_acs": 157098, + "total_submitted": 328794, + "total_column_articles": 857, "frontend_question_id": "127", "is_new_question": false }, @@ -53814,9 +54150,9 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 47277, - "total_submitted": 116164, - "total_column_articles": 421, + "total_acs": 47624, + "total_submitted": 117755, + "total_column_articles": 423, "frontend_question_id": "126", "is_new_question": false }, @@ -53835,9 +54171,9 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 374383, - "total_submitted": 797866, - "total_column_articles": 2373, + "total_acs": 378944, + "total_submitted": 807822, + "total_column_articles": 2396, "frontend_question_id": "125", "is_new_question": false }, @@ -53856,9 +54192,9 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 244106, - "total_submitted": 541342, - "total_column_articles": 1574, + "total_acs": 248462, + "total_submitted": 550594, + "total_column_articles": 1595, "frontend_question_id": "124", "is_new_question": false }, @@ -53877,9 +54213,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": 190437, - "total_submitted": 336682, - "total_column_articles": 1170, + "total_acs": 193667, + "total_submitted": 341532, + "total_column_articles": 1181, "frontend_question_id": "123", "is_new_question": false }, @@ -53898,9 +54234,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": 669082, - "total_submitted": 946641, - "total_column_articles": 3704, + "total_acs": 678878, + "total_submitted": 959534, + "total_column_articles": 3739, "frontend_question_id": "122", "is_new_question": false }, @@ -53919,9 +54255,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": 830284, - "total_submitted": 1432556, - "total_column_articles": 4864, + "total_acs": 844525, + "total_submitted": 1456256, + "total_column_articles": 4926, "frontend_question_id": "121", "is_new_question": false }, @@ -53940,9 +54276,9 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 242404, - "total_submitted": 353006, - "total_column_articles": 2066, + "total_acs": 244842, + "total_submitted": 356465, + "total_column_articles": 2082, "frontend_question_id": "120", "is_new_question": false }, @@ -53961,9 +54297,9 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 210037, - "total_submitted": 306645, - "total_column_articles": 1686, + "total_acs": 212711, + "total_submitted": 310324, + "total_column_articles": 1704, "frontend_question_id": "119", "is_new_question": false }, @@ -53982,9 +54318,9 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 316786, - "total_submitted": 422081, - "total_column_articles": 2534, + "total_acs": 321300, + "total_submitted": 427888, + "total_column_articles": 2563, "frontend_question_id": "118", "is_new_question": false }, @@ -54003,9 +54339,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": 141771, - "total_submitted": 220423, - "total_column_articles": 1108, + "total_acs": 144022, + "total_submitted": 223605, + "total_column_articles": 1123, "frontend_question_id": "117", "is_new_question": false }, @@ -54024,9 +54360,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": 265261, - "total_submitted": 369471, - "total_column_articles": 2085, + "total_acs": 269691, + "total_submitted": 375331, + "total_column_articles": 2125, "frontend_question_id": "116", "is_new_question": false }, @@ -54045,9 +54381,9 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 94224, - "total_submitted": 180791, - "total_column_articles": 940, + "total_acs": 96110, + "total_submitted": 184227, + "total_column_articles": 957, "frontend_question_id": "115", "is_new_question": false }, @@ -54066,9 +54402,9 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 272997, - "total_submitted": 374688, - "total_column_articles": 2196, + "total_acs": 277578, + "total_submitted": 380917, + "total_column_articles": 2230, "frontend_question_id": "114", "is_new_question": false }, @@ -54087,9 +54423,9 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 268093, - "total_submitted": 424533, - "total_column_articles": 1836, + "total_acs": 272133, + "total_submitted": 430656, + "total_column_articles": 1851, "frontend_question_id": "113", "is_new_question": false }, @@ -54108,9 +54444,9 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 409163, - "total_submitted": 766789, - "total_column_articles": 2466, + "total_acs": 415860, + "total_submitted": 779176, + "total_column_articles": 2501, "frontend_question_id": "112", "is_new_question": false }, @@ -54129,9 +54465,9 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 413206, - "total_submitted": 816334, - "total_column_articles": 2974, + "total_acs": 419646, + "total_submitted": 827956, + "total_column_articles": 3022, "frontend_question_id": "111", "is_new_question": false }, @@ -54150,9 +54486,9 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 377688, - "total_submitted": 661060, - "total_column_articles": 2052, + "total_acs": 383978, + "total_submitted": 671740, + "total_column_articles": 2079, "frontend_question_id": "110", "is_new_question": false }, @@ -54171,9 +54507,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": 122232, - "total_submitted": 160177, - "total_column_articles": 954, + "total_acs": 123494, + "total_submitted": 161808, + "total_column_articles": 977, "frontend_question_id": "109", "is_new_question": false }, @@ -54192,9 +54528,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": 272866, - "total_submitted": 354643, - "total_column_articles": 1648, + "total_acs": 276928, + "total_submitted": 359740, + "total_column_articles": 1668, "frontend_question_id": "108", "is_new_question": false }, @@ -54213,9 +54549,9 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 219140, - "total_submitted": 306439, - "total_column_articles": 1683, + "total_acs": 221701, + "total_submitted": 309799, + "total_column_articles": 1695, "frontend_question_id": "107", "is_new_question": false }, @@ -54234,9 +54570,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": 206691, - "total_submitted": 285328, - "total_column_articles": 1316, + "total_acs": 210339, + "total_submitted": 290299, + "total_column_articles": 1341, "frontend_question_id": "106", "is_new_question": false }, @@ -54255,9 +54591,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": 377884, - "total_submitted": 531119, - "total_column_articles": 2111, + "total_acs": 384125, + "total_submitted": 539508, + "total_column_articles": 2135, "frontend_question_id": "105", "is_new_question": false }, @@ -54276,9 +54612,9 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 766536, - "total_submitted": 994722, - "total_column_articles": 3779, + "total_acs": 778500, + "total_submitted": 1010059, + "total_column_articles": 3871, "frontend_question_id": "104", "is_new_question": false }, @@ -54297,9 +54633,9 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 246297, - "total_submitted": 429750, - "total_column_articles": 2113, + "total_acs": 249708, + "total_submitted": 435637, + "total_column_articles": 2132, "frontend_question_id": "103", "is_new_question": false }, @@ -54318,9 +54654,9 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 604257, - "total_submitted": 931227, - "total_column_articles": 3576, + "total_acs": 615428, + "total_submitted": 948048, + "total_column_articles": 3620, "frontend_question_id": "102", "is_new_question": false }, @@ -54339,9 +54675,9 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 624114, - "total_submitted": 1077998, - "total_column_articles": 3325, + "total_acs": 634162, + "total_submitted": 1094029, + "total_column_articles": 3379, "frontend_question_id": "101", "is_new_question": false }, @@ -54360,9 +54696,9 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 355030, - "total_submitted": 593602, - "total_column_articles": 2557, + "total_acs": 359962, + "total_submitted": 601791, + "total_column_articles": 2581, "frontend_question_id": "100", "is_new_question": false }, @@ -54381,9 +54717,9 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 106850, - "total_submitted": 176898, - "total_column_articles": 864, + "total_acs": 108314, + "total_submitted": 179278, + "total_column_articles": 888, "frontend_question_id": "99", "is_new_question": false }, @@ -54402,9 +54738,9 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 537117, - "total_submitted": 1482142, - "total_column_articles": 3023, + "total_acs": 547350, + "total_submitted": 1507806, + "total_column_articles": 3092, "frontend_question_id": "98", "is_new_question": false }, @@ -54423,9 +54759,9 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 89034, - "total_submitted": 197461, - "total_column_articles": 718, + "total_acs": 90452, + "total_submitted": 200633, + "total_column_articles": 734, "frontend_question_id": "97", "is_new_question": false }, @@ -54444,9 +54780,9 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 263052, - "total_submitted": 373463, - "total_column_articles": 1946, + "total_acs": 268371, + "total_submitted": 380769, + "total_column_articles": 1983, "frontend_question_id": "96", "is_new_question": false }, @@ -54465,9 +54801,9 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 136894, - "total_submitted": 189288, - "total_column_articles": 856, + "total_acs": 138556, + "total_submitted": 191412, + "total_column_articles": 875, "frontend_question_id": "95", "is_new_question": false }, @@ -54486,9 +54822,9 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 865600, - "total_submitted": 1139606, - "total_column_articles": 3370, + "total_acs": 879423, + "total_submitted": 1157368, + "total_column_articles": 3410, "frontend_question_id": "94", "is_new_question": false }, @@ -54507,9 +54843,9 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 240641, - "total_submitted": 424735, - "total_column_articles": 1927, + "total_acs": 245372, + "total_submitted": 432097, + "total_column_articles": 1957, "frontend_question_id": "93", "is_new_question": false }, @@ -54528,9 +54864,9 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 309403, - "total_submitted": 558332, - "total_column_articles": 2961, + "total_acs": 314084, + "total_submitted": 566643, + "total_column_articles": 2994, "frontend_question_id": "92", "is_new_question": false }, @@ -54549,9 +54885,9 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 222024, - "total_submitted": 686687, - "total_column_articles": 1967, + "total_acs": 224701, + "total_submitted": 693594, + "total_column_articles": 1978, "frontend_question_id": "91", "is_new_question": false }, @@ -54570,9 +54906,9 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 215273, - "total_submitted": 338558, - "total_column_articles": 1796, + "total_acs": 219473, + "total_submitted": 345050, + "total_column_articles": 1818, "frontend_question_id": "90", "is_new_question": false }, @@ -54591,9 +54927,9 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 98186, - "total_submitted": 131346, - "total_column_articles": 805, + "total_acs": 98991, + "total_submitted": 132395, + "total_column_articles": 809, "frontend_question_id": "89", "is_new_question": false }, @@ -54612,9 +54948,9 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 690235, - "total_submitted": 1318076, - "total_column_articles": 4645, + "total_acs": 700543, + "total_submitted": 1337370, + "total_column_articles": 4717, "frontend_question_id": "88", "is_new_question": false }, @@ -54633,9 +54969,9 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 49276, - "total_submitted": 102860, - "total_column_articles": 382, + "total_acs": 49586, + "total_submitted": 103619, + "total_column_articles": 384, "frontend_question_id": "87", "is_new_question": false }, @@ -54654,9 +54990,9 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 158330, - "total_submitted": 249873, - "total_column_articles": 1473, + "total_acs": 161059, + "total_submitted": 253876, + "total_column_articles": 1518, "frontend_question_id": "86", "is_new_question": false }, @@ -54675,9 +55011,9 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 135911, - "total_submitted": 254909, - "total_column_articles": 978, + "total_acs": 137835, + "total_submitted": 258066, + "total_column_articles": 987, "frontend_question_id": "85", "is_new_question": false }, @@ -54696,9 +55032,9 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 262003, - "total_submitted": 590880, - "total_column_articles": 1586, + "total_acs": 266316, + "total_submitted": 599678, + "total_column_articles": 1607, "frontend_question_id": "84", "is_new_question": false }, @@ -54717,9 +55053,9 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 448319, - "total_submitted": 837398, - "total_column_articles": 2817, + "total_acs": 454583, + "total_submitted": 849277, + "total_column_articles": 2865, "frontend_question_id": "83", "is_new_question": false }, @@ -54738,9 +55074,9 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 268208, - "total_submitted": 502444, - "total_column_articles": 2322, + "total_acs": 271895, + "total_submitted": 509003, + "total_column_articles": 2339, "frontend_question_id": "82", "is_new_question": false }, @@ -54759,9 +55095,9 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 163486, - "total_submitted": 396189, - "total_column_articles": 1263, + "total_acs": 165262, + "total_submitted": 400650, + "total_column_articles": 1285, "frontend_question_id": "81", "is_new_question": false }, @@ -54780,9 +55116,9 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 187618, - "total_submitted": 302243, - "total_column_articles": 1625, + "total_acs": 189774, + "total_submitted": 305871, + "total_column_articles": 1635, "frontend_question_id": "80", "is_new_question": false }, @@ -54801,9 +55137,9 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 332437, - "total_submitted": 716890, - "total_column_articles": 2045, + "total_acs": 338051, + "total_submitted": 728450, + "total_column_articles": 2072, "frontend_question_id": "79", "is_new_question": false }, @@ -54822,9 +55158,9 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 471123, - "total_submitted": 584441, - "total_column_articles": 3414, + "total_acs": 479244, + "total_submitted": 594263, + "total_column_articles": 3451, "frontend_question_id": "78", "is_new_question": false }, @@ -54843,9 +55179,9 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 374803, - "total_submitted": 485894, - "total_column_articles": 2189, + "total_acs": 382388, + "total_submitted": 495647, + "total_column_articles": 2222, "frontend_question_id": "77", "is_new_question": false }, @@ -54864,9 +55200,9 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 305312, - "total_submitted": 688000, - "total_column_articles": 2476, + "total_acs": 311724, + "total_submitted": 701094, + "total_column_articles": 2511, "frontend_question_id": "76", "is_new_question": false }, @@ -54885,9 +55221,9 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 403632, - "total_submitted": 671331, - "total_column_articles": 2769, + "total_acs": 410590, + "total_submitted": 682834, + "total_column_articles": 2820, "frontend_question_id": "75", "is_new_question": false }, @@ -54906,9 +55242,9 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 245689, - "total_submitted": 515194, - "total_column_articles": 2433, + "total_acs": 249431, + "total_submitted": 521994, + "total_column_articles": 2457, "frontend_question_id": "74", "is_new_question": false }, @@ -54927,9 +55263,9 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 194448, - "total_submitted": 313350, - "total_column_articles": 1456, + "total_acs": 197306, + "total_submitted": 317680, + "total_column_articles": 1480, "frontend_question_id": "73", "is_new_question": false }, @@ -54948,9 +55284,9 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 270860, - "total_submitted": 433976, - "total_column_articles": 2319, + "total_acs": 275707, + "total_submitted": 441436, + "total_column_articles": 2365, "frontend_question_id": "72", "is_new_question": false }, @@ -54969,9 +55305,9 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 151826, - "total_submitted": 343156, - "total_column_articles": 1436, + "total_acs": 153470, + "total_submitted": 346820, + "total_column_articles": 1462, "frontend_question_id": "71", "is_new_question": false }, @@ -54990,9 +55326,9 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 869248, - "total_submitted": 1616353, - "total_column_articles": 5018, + "total_acs": 883000, + "total_submitted": 1640437, + "total_column_articles": 5066, "frontend_question_id": "70", "is_new_question": false }, @@ -55011,9 +55347,9 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 564414, - "total_submitted": 1454345, - "total_column_articles": 2806, + "total_acs": 573183, + "total_submitted": 1477010, + "total_column_articles": 2846, "frontend_question_id": "69", "is_new_question": false }, @@ -55032,9 +55368,9 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 45574, - "total_submitted": 87407, - "total_column_articles": 680, + "total_acs": 45932, + "total_submitted": 88089, + "total_column_articles": 697, "frontend_question_id": "68", "is_new_question": false }, @@ -55053,9 +55389,9 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 256579, - "total_submitted": 476723, - "total_column_articles": 2329, + "total_acs": 259457, + "total_submitted": 482162, + "total_column_articles": 2351, "frontend_question_id": "67", "is_new_question": false }, @@ -55074,9 +55410,9 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 506613, - "total_submitted": 1104596, - "total_column_articles": 4545, + "total_acs": 512503, + "total_submitted": 1118056, + "total_column_articles": 4587, "frontend_question_id": "66", "is_new_question": false }, @@ -55095,9 +55431,9 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 55992, - "total_submitted": 204084, - "total_column_articles": 801, + "total_acs": 56429, + "total_submitted": 205569, + "total_column_articles": 805, "frontend_question_id": "65", "is_new_question": false }, @@ -55116,9 +55452,9 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 381871, - "total_submitted": 551453, - "total_column_articles": 2790, + "total_acs": 387247, + "total_submitted": 559121, + "total_column_articles": 2814, "frontend_question_id": "64", "is_new_question": false }, @@ -55137,9 +55473,9 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 271825, - "total_submitted": 672471, - "total_column_articles": 2385, + "total_acs": 276501, + "total_submitted": 682829, + "total_column_articles": 2402, "frontend_question_id": "63", "is_new_question": false }, @@ -55158,9 +55494,9 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 461874, - "total_submitted": 687476, - "total_column_articles": 3342, + "total_acs": 470019, + "total_submitted": 698901, + "total_column_articles": 3382, "frontend_question_id": "62", "is_new_question": false }, @@ -55179,9 +55515,9 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 258465, - "total_submitted": 620308, - "total_column_articles": 2568, + "total_acs": 261293, + "total_submitted": 627057, + "total_column_articles": 2590, "frontend_question_id": "61", "is_new_question": false }, @@ -55200,9 +55536,9 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 109614, - "total_submitted": 206427, - "total_column_articles": 1210, + "total_acs": 110489, + "total_submitted": 207997, + "total_column_articles": 1228, "frontend_question_id": "60", "is_new_question": false }, @@ -55221,9 +55557,9 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 210699, - "total_submitted": 276759, - "total_column_articles": 2522, + "total_acs": 215640, + "total_submitted": 283598, + "total_column_articles": 2557, "frontend_question_id": "59", "is_new_question": false }, @@ -55242,9 +55578,9 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 333221, - "total_submitted": 821504, - "total_column_articles": 3535, + "total_acs": 337212, + "total_submitted": 829319, + "total_column_articles": 3566, "frontend_question_id": "58", "is_new_question": false }, @@ -55263,9 +55599,9 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 114743, - "total_submitted": 275878, - "total_column_articles": 1175, + "total_acs": 116142, + "total_submitted": 279162, + "total_column_articles": 1195, "frontend_question_id": "57", "is_new_question": false }, @@ -55284,9 +55620,9 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 472261, - "total_submitted": 968428, - "total_column_articles": 3332, + "total_acs": 480952, + "total_submitted": 985052, + "total_column_articles": 3383, "frontend_question_id": "56", "is_new_question": false }, @@ -55305,9 +55641,9 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 525896, - "total_submitted": 1206907, - "total_column_articles": 3814, + "total_acs": 535178, + "total_submitted": 1227363, + "total_column_articles": 3859, "frontend_question_id": "55", "is_new_question": false }, @@ -55326,9 +55662,9 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 276418, - "total_submitted": 565416, - "total_column_articles": 2980, + "total_acs": 281879, + "total_submitted": 575925, + "total_column_articles": 3025, "frontend_question_id": "54", "is_new_question": false }, @@ -55347,9 +55683,9 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 1084874, - "total_submitted": 1979349, - "total_column_articles": 5515, + "total_acs": 1103402, + "total_submitted": 2013992, + "total_column_articles": 5586, "frontend_question_id": "53", "is_new_question": false }, @@ -55368,9 +55704,9 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 96249, - "total_submitted": 117007, - "total_column_articles": 775, + "total_acs": 97230, + "total_submitted": 118187, + "total_column_articles": 780, "frontend_question_id": "52", "is_new_question": false }, @@ -55389,9 +55725,9 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 227874, - "total_submitted": 307826, - "total_column_articles": 2365, + "total_acs": 231556, + "total_submitted": 312642, + "total_column_articles": 2392, "frontend_question_id": "51", "is_new_question": false }, @@ -55410,9 +55746,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 299529, - "total_submitted": 790672, - "total_column_articles": 1767, + "total_acs": 302867, + "total_submitted": 799701, + "total_column_articles": 1782, "frontend_question_id": "50", "is_new_question": false }, @@ -55431,9 +55767,9 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 345044, - "total_submitted": 511863, - "total_column_articles": 1951, + "total_acs": 351245, + "total_submitted": 520650, + "total_column_articles": 1983, "frontend_question_id": "49", "is_new_question": false }, @@ -55452,9 +55788,9 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 340938, - "total_submitted": 459321, - "total_column_articles": 3344, + "total_acs": 346925, + "total_submitted": 467317, + "total_column_articles": 3383, "frontend_question_id": "48", "is_new_question": false }, @@ -55473,9 +55809,9 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 337414, - "total_submitted": 520113, - "total_column_articles": 2250, + "total_acs": 343497, + "total_submitted": 529069, + "total_column_articles": 2280, "frontend_question_id": "47", "is_new_question": false }, @@ -55494,9 +55830,9 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 651135, - "total_submitted": 828242, - "total_column_articles": 4556, + "total_acs": 662199, + "total_submitted": 842204, + "total_column_articles": 4625, "frontend_question_id": "46", "is_new_question": false }, @@ -55515,9 +55851,9 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 353823, - "total_submitted": 789584, - "total_column_articles": 2563, + "total_acs": 360525, + "total_submitted": 803581, + "total_column_articles": 2594, "frontend_question_id": "45", "is_new_question": false }, @@ -55536,9 +55872,9 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 110948, - "total_submitted": 331901, - "total_column_articles": 727, + "total_acs": 112242, + "total_submitted": 335491, + "total_column_articles": 740, "frontend_question_id": "44", "is_new_question": false }, @@ -55557,9 +55893,9 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 235497, - "total_submitted": 525348, - "total_column_articles": 1585, + "total_acs": 239048, + "total_submitted": 533192, + "total_column_articles": 1602, "frontend_question_id": "43", "is_new_question": false }, @@ -55578,9 +55914,9 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 511335, - "total_submitted": 834037, - "total_column_articles": 3403, + "total_acs": 521203, + "total_submitted": 848321, + "total_column_articles": 3435, "frontend_question_id": "42", "is_new_question": false }, @@ -55599,9 +55935,9 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 233620, - "total_submitted": 546990, - "total_column_articles": 1822, + "total_acs": 236662, + "total_submitted": 553906, + "total_column_articles": 1833, "frontend_question_id": "41", "is_new_question": false }, @@ -55620,9 +55956,9 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 311310, - "total_submitted": 513332, - "total_column_articles": 2096, + "total_acs": 317193, + "total_submitted": 523387, + "total_column_articles": 2120, "frontend_question_id": "40", "is_new_question": false }, @@ -55641,9 +55977,9 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 536553, - "total_submitted": 737634, - "total_column_articles": 3035, + "total_acs": 546961, + "total_submitted": 752327, + "total_column_articles": 3083, "frontend_question_id": "39", "is_new_question": false }, @@ -55662,9 +55998,9 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 291533, - "total_submitted": 485300, - "total_column_articles": 2928, + "total_acs": 294052, + "total_submitted": 489580, + "total_column_articles": 2942, "frontend_question_id": "38", "is_new_question": false }, @@ -55683,9 +56019,9 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 152802, - "total_submitted": 226174, - "total_column_articles": 1229, + "total_acs": 155273, + "total_submitted": 229839, + "total_column_articles": 1240, "frontend_question_id": "37", "is_new_question": false }, @@ -55704,9 +56040,9 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 293911, - "total_submitted": 462973, - "total_column_articles": 2080, + "total_acs": 298117, + "total_submitted": 470008, + "total_column_articles": 2112, "frontend_question_id": "36", "is_new_question": false }, @@ -55725,9 +56061,9 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 846209, - "total_submitted": 1870246, - "total_column_articles": 5837, + "total_acs": 861200, + "total_submitted": 1905115, + "total_column_articles": 5918, "frontend_question_id": "35", "is_new_question": false }, @@ -55746,9 +56082,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": 574093, - "total_submitted": 1357468, - "total_column_articles": 5513, + "total_acs": 585373, + "total_submitted": 1383782, + "total_column_articles": 5597, "frontend_question_id": "34", "is_new_question": false }, @@ -55767,9 +56103,9 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 564396, - "total_submitted": 1292004, - "total_column_articles": 3690, + "total_acs": 573855, + "total_submitted": 1313250, + "total_column_articles": 3742, "frontend_question_id": "33", "is_new_question": false }, @@ -55788,9 +56124,9 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 282982, - "total_submitted": 772399, - "total_column_articles": 1818, + "total_acs": 287531, + "total_submitted": 784100, + "total_column_articles": 1842, "frontend_question_id": "32", "is_new_question": false }, @@ -55809,9 +56145,9 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 324511, - "total_submitted": 860689, - "total_column_articles": 2539, + "total_acs": 332533, + "total_submitted": 879773, + "total_column_articles": 2595, "frontend_question_id": "31", "is_new_question": false }, @@ -55830,9 +56166,9 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 129438, - "total_submitted": 330535, - "total_column_articles": 1051, + "total_acs": 131176, + "total_submitted": 334255, + "total_column_articles": 1072, "frontend_question_id": "30", "is_new_question": false }, @@ -55851,9 +56187,9 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 171198, - "total_submitted": 771029, - "total_column_articles": 1328, + "total_acs": 173230, + "total_submitted": 779777, + "total_column_articles": 1349, "frontend_question_id": "29", "is_new_question": false }, @@ -55872,9 +56208,9 @@ "question__title": "Implement strStr()", "question__title_slug": "implement-strstr", "question__hide": false, - "total_acs": 673286, - "total_submitted": 1647493, - "total_column_articles": 4598, + "total_acs": 683390, + "total_submitted": 1668019, + "total_column_articles": 4666, "frontend_question_id": "28", "is_new_question": false }, @@ -55893,9 +56229,9 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 740349, - "total_submitted": 1244779, - "total_column_articles": 5827, + "total_acs": 754396, + "total_submitted": 1268303, + "total_column_articles": 5911, "frontend_question_id": "27", "is_new_question": false }, @@ -55914,9 +56250,9 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 1156673, - "total_submitted": 2134584, - "total_column_articles": 6363, + "total_acs": 1174207, + "total_submitted": 2165279, + "total_column_articles": 6470, "frontend_question_id": "26", "is_new_question": false }, @@ -55935,9 +56271,9 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 359689, - "total_submitted": 532470, - "total_column_articles": 3111, + "total_acs": 365459, + "total_submitted": 540923, + "total_column_articles": 3142, "frontend_question_id": "25", "is_new_question": false }, @@ -55956,9 +56292,9 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 466026, - "total_submitted": 656507, - "total_column_articles": 3518, + "total_acs": 474068, + "total_submitted": 667415, + "total_column_articles": 3556, "frontend_question_id": "24", "is_new_question": false }, @@ -55977,9 +56313,9 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 491161, - "total_submitted": 861594, - "total_column_articles": 3298, + "total_acs": 499164, + "total_submitted": 875099, + "total_column_articles": 3359, "frontend_question_id": "23", "is_new_question": false }, @@ -55998,9 +56334,9 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 534122, - "total_submitted": 689415, - "total_column_articles": 3794, + "total_acs": 542971, + "total_submitted": 700720, + "total_column_articles": 3851, "frontend_question_id": "22", "is_new_question": false }, @@ -56019,9 +56355,9 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 1058454, - "total_submitted": 1586593, - "total_column_articles": 5527, + "total_acs": 1076759, + "total_submitted": 1613943, + "total_column_articles": 5650, "frontend_question_id": "21", "is_new_question": false }, @@ -56040,9 +56376,9 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 1136699, - "total_submitted": 2547549, - "total_column_articles": 7690, + "total_acs": 1154302, + "total_submitted": 2586744, + "total_column_articles": 7801, "frontend_question_id": "20", "is_new_question": false }, @@ -56061,9 +56397,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": 830514, - "total_submitted": 1877474, - "total_column_articles": 6085, + "total_acs": 845656, + "total_submitted": 1908759, + "total_column_articles": 6181, "frontend_question_id": "19", "is_new_question": false }, @@ -56082,9 +56418,9 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 334416, - "total_submitted": 855915, - "total_column_articles": 2227, + "total_acs": 339964, + "total_submitted": 875234, + "total_column_articles": 2256, "frontend_question_id": "18", "is_new_question": false }, @@ -56103,9 +56439,9 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 513174, - "total_submitted": 887559, - "total_column_articles": 4418, + "total_acs": 522399, + "total_submitted": 903535, + "total_column_articles": 4476, "frontend_question_id": "17", "is_new_question": false }, @@ -56124,9 +56460,9 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 368607, - "total_submitted": 808581, - "total_column_articles": 2005, + "total_acs": 375139, + "total_submitted": 823588, + "total_column_articles": 2021, "frontend_question_id": "16", "is_new_question": false }, @@ -56145,9 +56481,9 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 1022991, - "total_submitted": 2864818, - "total_column_articles": 4617, + "total_acs": 1041253, + "total_submitted": 2909543, + "total_column_articles": 4673, "frontend_question_id": "15", "is_new_question": false }, @@ -56166,9 +56502,9 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 864938, - "total_submitted": 2031654, - "total_column_articles": 5337, + "total_acs": 876665, + "total_submitted": 2055381, + "total_column_articles": 5418, "frontend_question_id": "14", "is_new_question": false }, @@ -56187,9 +56523,9 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 656089, - "total_submitted": 1049827, - "total_column_articles": 5318, + "total_acs": 664261, + "total_submitted": 1063355, + "total_column_articles": 5385, "frontend_question_id": "13", "is_new_question": false }, @@ -56208,9 +56544,9 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 306203, - "total_submitted": 462465, - "total_column_articles": 2385, + "total_acs": 310141, + "total_submitted": 468434, + "total_column_articles": 2410, "frontend_question_id": "12", "is_new_question": false }, @@ -56229,9 +56565,9 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 762411, - "total_submitted": 1244323, - "total_column_articles": 4310, + "total_acs": 773840, + "total_submitted": 1263831, + "total_column_articles": 4361, "frontend_question_id": "11", "is_new_question": false }, @@ -56250,9 +56586,9 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 289010, - "total_submitted": 912549, - "total_column_articles": 1716, + "total_acs": 293302, + "total_submitted": 926160, + "total_column_articles": 1746, "frontend_question_id": "10", "is_new_question": false }, @@ -56271,9 +56607,9 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 1072492, - "total_submitted": 1875296, - "total_column_articles": 6677, + "total_acs": 1086347, + "total_submitted": 1901490, + "total_column_articles": 6774, "frontend_question_id": "9", "is_new_question": false }, @@ -56292,9 +56628,9 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 468108, - "total_submitted": 2166343, - "total_column_articles": 3528, + "total_acs": 473627, + "total_submitted": 2193854, + "total_column_articles": 3568, "frontend_question_id": "8", "is_new_question": false }, @@ -56313,9 +56649,9 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 1038790, - "total_submitted": 2940508, - "total_column_articles": 6378, + "total_acs": 1046748, + "total_submitted": 2962017, + "total_column_articles": 6418, "frontend_question_id": "7", "is_new_question": false }, @@ -56334,9 +56670,9 @@ "question__title": "ZigZag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 450611, - "total_submitted": 866903, - "total_column_articles": 3733, + "total_acs": 455947, + "total_submitted": 877190, + "total_column_articles": 3778, "frontend_question_id": "6", "is_new_question": false }, @@ -56355,9 +56691,9 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1086474, - "total_submitted": 2951015, - "total_column_articles": 5896, + "total_acs": 1103643, + "total_submitted": 2994609, + "total_column_articles": 5989, "frontend_question_id": "5", "is_new_question": false }, @@ -56376,9 +56712,9 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 741756, - "total_submitted": 1789366, - "total_column_articles": 5441, + "total_acs": 752082, + "total_submitted": 1813302, + "total_column_articles": 5521, "frontend_question_id": "4", "is_new_question": false }, @@ -56397,9 +56733,9 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 1818462, - "total_submitted": 4680332, - "total_column_articles": 10873, + "total_acs": 1846008, + "total_submitted": 4748330, + "total_column_articles": 11005, "frontend_question_id": "3", "is_new_question": false }, @@ -56418,9 +56754,9 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 1390141, - "total_submitted": 3318582, - "total_column_articles": 9882, + "total_acs": 1408839, + "total_submitted": 3360218, + "total_column_articles": 9997, "frontend_question_id": "2", "is_new_question": false }, @@ -56439,9 +56775,9 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 3527479, - "total_submitted": 6703238, - "total_column_articles": 18177, + "total_acs": 3578676, + "total_submitted": 6794580, + "total_column_articles": 18367, "frontend_question_id": "1", "is_new_question": false }, diff --git a/leetcode-cn/originData/[no content]find-minimum-time-to-finish-all-jobs-ii.json b/leetcode-cn/originData/[no content]find-minimum-time-to-finish-all-jobs-ii.json new file mode 100644 index 00000000..65aba941 --- /dev/null +++ b/leetcode-cn/originData/[no content]find-minimum-time-to-finish-all-jobs-ii.json @@ -0,0 +1,68 @@ +{ + "data": { + "question": { + "questionId": "2458", + "questionFrontendId": "2323", + "categoryTitle": "Algorithms", + "boundTopicId": 1634177, + "title": "Find Minimum Time to Finish All Jobs II", + "titleSlug": "find-minimum-time-to-finish-all-jobs-ii", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Greedy", + "slug": "greedy", + "translatedName": "贪心", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": "排序", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"58\", \"totalSubmission\": \"61\", \"totalAcceptedRaw\": 58, \"totalSubmissionRaw\": 61, \"acRate\": \"95.1%\"}", + "hints": [ + "It is always optimal to pair the worker with the least amount of time with the job that requires the least amount of time.", + "Sort both arrays." + ], + "solution": null, + "status": null, + "sampleTestCase": "[5,2,4]\n[1,7,5]", + "metaData": "{\n \"name\": \"minimumTime\",\n \"params\": [\n {\n \"name\": \"jobs\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"workers\"\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[5,2,4]\n[1,7,5]\n[3,18,15,9]\n[6,5,1,3]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]product-sales-analysis-iv.json b/leetcode-cn/originData/[no content]product-sales-analysis-iv.json new file mode 100644 index 00000000..d2e869b8 --- /dev/null +++ b/leetcode-cn/originData/[no content]product-sales-analysis-iv.json @@ -0,0 +1,67 @@ +{ + "data": { + "question": { + "questionId": "2451", + "questionFrontendId": "2324", + "categoryTitle": "Database", + "boundTopicId": 1645125, + "title": "Product Sales Analysis IV", + "titleSlug": "product-sales-analysis-iv", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": "数据库", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"65\", \"totalSubmission\": \"78\", \"totalAcceptedRaw\": 65, \"totalSubmissionRaw\": 78, \"acRate\": \"83.3%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\": {\"Sales\": [\"sale_id\", \"product_id\", \"user_id\", \"quantity\"], \"Product\": [\"product_id\", \"price\"]}, \"rows\": {\"Sales\": [[1, 1, 101, 10], [2, 3, 101, 7], [3, 1, 102, 9], [4, 2, 102, 6], [5, 3, 102, 10], [6, 1, 102, 6]], \"Product\": [[1, 10], [2, 25], [3, 15]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table If Not Exists Product (product_id int, price int)\"\n ],\n \"mssql\": [\n \"Create table Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table Product (product_id int, price int)\"\n ],\n \"oraclesql\": [\n \"Create table Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table Product (product_id int, price int)\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Sales (sale_id int, product_id int, user_id int, quantity int)", + "Create table If Not Exists Product (product_id int, price int)", + "Truncate table Sales", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('1', '1', '101', '10')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('2', '3', '101', '7')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('3', '1', '102', '9')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('4', '2', '102', '6')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('5', '3', '102', '10')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('6', '1', '102', '6')", + "Truncate table Product", + "insert into Product (product_id, price) values ('1', '10')", + "insert into Product (product_id, price) values ('2', '25')", + "insert into Product (product_id, price) values ('3', '15')" + ], + "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\": {\"Sales\": [\"sale_id\", \"product_id\", \"user_id\", \"quantity\"], \"Product\": [\"product_id\", \"price\"]}, \"rows\": {\"Sales\": [[1, 1, 101, 10], [2, 3, 101, 7], [3, 1, 102, 9], [4, 2, 102, 6], [5, 3, 102, 10], [6, 1, 102, 6]], \"Product\": [[1, 10], [2, 25], [3, 15]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]product-sales-analysis-v.json b/leetcode-cn/originData/[no content]product-sales-analysis-v.json new file mode 100644 index 00000000..b71e4a7e --- /dev/null +++ b/leetcode-cn/originData/[no content]product-sales-analysis-v.json @@ -0,0 +1,59 @@ +{ + "data": { + "question": { + "questionId": "2452", + "questionFrontendId": "2329", + "categoryTitle": "Database", + "boundTopicId": 1643199, + "title": "Product Sales Analysis V", + "titleSlug": "product-sales-analysis-v", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"64\", \"totalSubmission\": \"79\", \"totalAcceptedRaw\": 64, \"totalSubmissionRaw\": 79, \"acRate\": \"81.0%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\": {\"Sales\": [\"sale_id\", \"product_id\", \"user_id\", \"quantity\"], \"Product\": [\"product_id\", \"price\"]}, \"rows\": {\"Sales\": [[1, 1, 101, 10], [2, 2, 101, 1], [3, 3, 102, 3], [4, 3, 102, 2], [5, 2, 103, 3]], \"Product\": [[1, 10], [2, 25], [3, 15]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table If Not Exists Product (product_id int, price int)\"\n ],\n \"mssql\": [\n \"Create table Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table Product (product_id int, price int)\"\n ],\n \"oraclesql\": [\n \"Create table Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table Product (product_id int, price int)\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Sales (sale_id int, product_id int, user_id int, quantity int)", + "Create table If Not Exists Product (product_id int, price int)", + "Truncate table Sales", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('1', '1', '101', '10')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('2', '2', '101', '1')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('3', '3', '102', '3')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('4', '3', '102', '2')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('5', '2', '103', '3')", + "Truncate table Product", + "insert into Product (product_id, price) values ('1', '10')", + "insert into Product (product_id, price) values ('2', '25')", + "insert into Product (product_id, price) values ('3', '15')" + ], + "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\": {\"Sales\": [\"sale_id\", \"product_id\", \"user_id\", \"quantity\"], \"Product\": [\"product_id\", \"price\"]}, \"rows\": {\"Sales\": [[1, 1, 101, 10], [2, 2, 101, 1], [3, 3, 102, 3], [4, 3, 102, 2], [5, 2, 103, 3]], \"Product\": [[1, 10], [2, 25], [3, 15]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]valid-palindrome-iv.json b/leetcode-cn/originData/[no content]valid-palindrome-iv.json new file mode 100644 index 00000000..b099cf7e --- /dev/null +++ b/leetcode-cn/originData/[no content]valid-palindrome-iv.json @@ -0,0 +1,49 @@ +{ + "data": { + "question": { + "questionId": "2468", + "questionFrontendId": "2330", + "categoryTitle": "Algorithms", + "boundTopicId": 1655329, + "title": "Valid Palindrome IV", + "titleSlug": "valid-palindrome-iv", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"31\", \"totalSubmission\": \"38\", \"totalAcceptedRaw\": 31, \"totalSubmissionRaw\": 38, \"acRate\": \"81.6%\"}", + "hints": [ + "Count the number of pairs of characters that should be equal if s were a palindrome, but are not equal.", + "If the number of pairs is 0, then s is already palindrome. You can pick any pair of characters and change them both to a different character and s will stay a palindrome." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"abcdba\"", + "metaData": "{\n \"name\": \"makePalindrome\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "\"abcdba\"\n\"aa\"\n\"abcdef\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/array-partition.json b/leetcode-cn/originData/array-partition.json new file mode 100644 index 00000000..7f1a7079 --- /dev/null +++ b/leetcode-cn/originData/array-partition.json @@ -0,0 +1,191 @@ +{ + "data": { + "question": { + "questionId": "561", + "questionFrontendId": "561", + "categoryTitle": "Algorithms", + "boundTopicId": 1148, + "title": "Array Partition", + "titleSlug": "array-partition", + "content": "

Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,4,3,2]\nOutput: 4\nExplanation: All possible pairings (ignoring the ordering of elements) are:\n1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3\n2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3\n3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4\nSo the maximum possible sum is 4.
\n\n

Example 2:

\n\n
\nInput: nums = [6,2,6,5,1,2]\nOutput: 9\nExplanation: The optimal pairing is (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 104
  • \n\t
  • nums.length == 2 * n
  • \n\t
  • -104 <= nums[i] <= 104
  • \n
\n", + "translatedTitle": "数组拆分", + "translatedContent": "

给定长度为 2n 的整数数组 nums ,你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ,使得从 1 到 nmin(ai, bi) 总和最大。

\n\n

返回该 最大总和

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [1,4,3,2]\n输出:4\n解释:所有可能的分法(忽略元素顺序)为:\n1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3\n2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3\n3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4\n所以最大总和为 4
\n\n

示例 2:

\n\n
\n输入:nums = [6,2,6,5,1,2]\n输出:9\n解释:最优的分法为 (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 104
  • \n\t
  • nums.length == 2 * n
  • \n\t
  • -104 <= nums[i] <= 104
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 305, + "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, \"dart\": false}", + "topicTags": [ + { + "name": "Greedy", + "slug": "greedy", + "translatedName": "贪心", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Counting Sort", + "slug": "counting-sort", + "translatedName": "计数排序", + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": "排序", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int arrayPairSum(vector& nums) {\n\n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int arrayPairSum(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def arrayPairSum(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def arrayPairSum(self, nums: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint arrayPairSum(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int ArrayPairSum(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar arrayPairSum = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef array_pair_sum(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func arrayPairSum(_ nums: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func arrayPairSum(nums []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def arrayPairSum(nums: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun arrayPairSum(nums: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn array_pair_sum(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 arrayPairSum($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function arrayPairSum(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (array-pair-sum nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec array_pair_sum(Nums :: [integer()]) -> integer().\narray_pair_sum(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec array_pair_sum(nums :: [integer]) :: integer\n def array_pair_sum(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int arrayPairSum(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"112.3K\", \"totalSubmission\": \"143.6K\", \"totalAcceptedRaw\": 112333, \"totalSubmissionRaw\": 143587, \"acRate\": \"78.2%\"}", + "hints": [ + "Obviously, brute force won't help here. Think of something else, take some example like 1,2,3,4.", + "How will you make pairs to get the result? There must be some pattern.", + "Did you observe that- Minimum element gets add into the result in sacrifice of maximum element.", + "Still won't able to find pairs? Sort the array and try to find the pattern." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,4,3,2]", + "metaData": "{\r\n \"name\": \"arrayPairSum\",\r\n \"params\": [\r\n {\r\n \"name\": \"nums\",\r\n \"type\": \"integer[]\"\r\n }\r\n ],\r\n \"return\": {\r\n \"type\": \"integer\"\r\n }\r\n}\r\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,4,3,2]\n[6,2,6,5,1,2]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/count-the-number-of-ideal-arrays.json b/leetcode-cn/originData/count-the-number-of-ideal-arrays.json new file mode 100644 index 00000000..e884c2ce --- /dev/null +++ b/leetcode-cn/originData/count-the-number-of-ideal-arrays.json @@ -0,0 +1,165 @@ +{ + "data": { + "question": { + "questionId": "2415", + "questionFrontendId": "2338", + "categoryTitle": "Algorithms", + "boundTopicId": 1655097, + "title": "Count the Number of Ideal Arrays", + "titleSlug": "count-the-number-of-ideal-arrays", + "content": "

You are given two integers n and maxValue, which are used to describe an ideal array.

\n\n

A 0-indexed integer array arr of length n is considered ideal if the following conditions hold:

\n\n
    \n\t
  • Every arr[i] is a value from 1 to maxValue, for 0 <= i < n.
  • \n\t
  • Every arr[i] is divisible by arr[i - 1], for 0 < i < n.
  • \n
\n\n

Return the number of distinct ideal arrays of length n. Since the answer may be very large, return it modulo 109 + 7.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 2, maxValue = 5\nOutput: 10\nExplanation: The following are the possible ideal arrays:\n- Arrays starting with the value 1 (5 arrays): [1,1], [1,2], [1,3], [1,4], [1,5]\n- Arrays starting with the value 2 (2 arrays): [2,2], [2,4]\n- Arrays starting with the value 3 (1 array): [3,3]\n- Arrays starting with the value 4 (1 array): [4,4]\n- Arrays starting with the value 5 (1 array): [5,5]\nThere are a total of 5 + 2 + 1 + 1 + 1 = 10 distinct ideal arrays.\n
\n\n

Example 2:

\n\n
\nInput: n = 5, maxValue = 3\nOutput: 11\nExplanation: The following are the possible ideal arrays:\n- Arrays starting with the value 1 (9 arrays): \n   - With no other distinct values (1 array): [1,1,1,1,1] \n   - With 2nd distinct value 2 (4 arrays): [1,1,1,1,2], [1,1,1,2,2], [1,1,2,2,2], [1,2,2,2,2]\n   - With 2nd distinct value 3 (4 arrays): [1,1,1,1,3], [1,1,1,3,3], [1,1,3,3,3], [1,3,3,3,3]\n- Arrays starting with the value 2 (1 array): [2,2,2,2,2]\n- Arrays starting with the value 3 (1 array): [3,3,3,3,3]\nThere are a total of 9 + 1 + 1 = 11 distinct ideal arrays.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 2 <= n <= 104
  • \n\t
  • 1 <= maxValue <= 104
  • \n
\n", + "translatedTitle": "统计理想数组的数目", + "translatedContent": "

给你两个整数 nmaxValue ,用于描述一个 理想数组

\n\n

对于下标从 0 开始、长度为 n 的整数数组 arr ,如果满足以下条件,则认为该数组是一个 理想数组

\n\n
    \n\t
  • 每个 arr[i] 都是从 1maxValue 范围内的一个值,其中 0 <= i < n
  • \n\t
  • 每个 arr[i] 都可以被 arr[i - 1] 整除,其中 0 < i < n
  • \n
\n\n

返回长度为 n不同 理想数组的数目。由于答案可能很大,返回对 109 + 7 取余的结果。

\n\n

 

\n\n

示例 1:

\n\n
输入:n = 2, maxValue = 5\n输出:10\n解释:存在以下理想数组:\n- 以 1 开头的数组(5 个):[1,1]、[1,2]、[1,3]、[1,4]、[1,5]\n- 以 2 开头的数组(2 个):[2,2]、[2,4]\n- 以 3 开头的数组(1 个):[3,3]\n- 以 4 开头的数组(1 个):[4,4]\n- 以 5 开头的数组(1 个):[5,5]\n共计 5 + 2 + 1 + 1 + 1 = 10 个不同理想数组。\n
\n\n

示例 2:

\n\n
输入:n = 5, maxValue = 3\n输出:11\n解释:存在以下理想数组:\n- 以 1 开头的数组(9 个):\n   - 不含其他不同值(1 个):[1,1,1,1,1] \n   - 含一个不同值 2(4 个):[1,1,1,1,2], [1,1,1,2,2], [1,1,2,2,2], [1,2,2,2,2]\n   - 含一个不同值 3(4 个):[1,1,1,1,3], [1,1,1,3,3], [1,1,3,3,3], [1,3,3,3,3]\n- 以 2 开头的数组(1 个):[2,2,2,2,2]\n- 以 3 开头的数组(1 个):[3,3,3,3,3]\n共计 9 + 1 + 1 = 11 个不同理想数组。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 2 <= n <= 104
  • \n\t
  • 1 <= maxValue <= 104
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 22, + "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, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int idealArrays(int n, int maxValue) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int idealArrays(int n, int maxValue) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def idealArrays(self, n, maxValue):\n \"\"\"\n :type n: int\n :type maxValue: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def idealArrays(self, n: int, maxValue: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint idealArrays(int n, int maxValue){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int IdealArrays(int n, int maxValue) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} maxValue\n * @return {number}\n */\nvar idealArrays = function(n, maxValue) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} max_value\n# @return {Integer}\ndef ideal_arrays(n, max_value)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func idealArrays(_ n: Int, _ maxValue: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func idealArrays(n int, maxValue int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def idealArrays(n: Int, maxValue: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun idealArrays(n: Int, maxValue: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn ideal_arrays(n: i32, max_value: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $maxValue\n * @return Integer\n */\n function idealArrays($n, $maxValue) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function idealArrays(n: number, maxValue: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (ideal-arrays n maxValue)\n (-> exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec ideal_arrays(N :: integer(), MaxValue :: integer()) -> integer().\nideal_arrays(N, MaxValue) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec ideal_arrays(n :: integer, max_value :: integer) :: integer\n def ideal_arrays(n, max_value) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int idealArrays(int n, int maxValue) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"6.2K\", \"totalAcceptedRaw\": 1576, \"totalSubmissionRaw\": 6196, \"acRate\": \"25.4%\"}", + "hints": [ + "Notice that an ideal array is non-decreasing.", + "Consider an alternative problem: where an ideal array must also be strictly increasing. Can you use DP to solve it?", + "Will combinatorics help to get an answer from the alternative problem to the actual problem?" + ], + "solution": null, + "status": null, + "sampleTestCase": "2\n5", + "metaData": "{\n \"name\": \"idealArrays\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"maxValue\"\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "2\n5\n5\n3", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/decode-the-message.json b/leetcode-cn/originData/decode-the-message.json new file mode 100644 index 00000000..2b137655 --- /dev/null +++ b/leetcode-cn/originData/decode-the-message.json @@ -0,0 +1,178 @@ +{ + "data": { + "question": { + "questionId": "2406", + "questionFrontendId": "2325", + "categoryTitle": "Algorithms", + "boundTopicId": 1632815, + "title": "Decode the Message", + "titleSlug": "decode-the-message", + "content": "

You are given the strings key and message, which represent a cipher key and a secret message, respectively. The steps to decode message are as follows:

\n\n
    \n\t
  1. Use the first appearance of all 26 lowercase English letters in key as the order of the substitution table.
  2. \n\t
  3. Align the substitution table with the regular English alphabet.
  4. \n\t
  5. Each letter in message is then substituted using the table.
  6. \n\t
  7. Spaces ' ' are transformed to themselves.
  8. \n
\n\n
    \n\t
  • For example, given key = "happy boy" (actual key would have at least one instance of each letter in the alphabet), we have the partial substitution table of ('h' -> 'a', 'a' -> 'b', 'p' -> 'c', 'y' -> 'd', 'b' -> 'e', 'o' -> 'f').
  • \n
\n\n

Return the decoded message.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: key = "the quick brown fox jumps over the lazy dog", message = "vkbs bs t suepuv"\nOutput: "this is a secret"\nExplanation: The diagram above shows the substitution table.\nIt is obtained by taking the first appearance of each letter in "the quick brown fox jumps over the lazy dog".\n
\n\n

Example 2:

\n\"\"\n
\nInput: key = "eljuxhpwnyrdgtqkviszcfmabo", message = "zwx hnfx lqantp mnoeius ycgk vcnjrdb"\nOutput: "the five boxing wizards jump quickly"\nExplanation: The diagram above shows the substitution table.\nIt is obtained by taking the first appearance of each letter in "eljuxhpwnyrdgtqkviszcfmabo".\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 26 <= key.length <= 2000
  • \n\t
  • key consists of lowercase English letters and ' '.
  • \n\t
  • key contains every letter in the English alphabet ('a' to 'z') at least once.
  • \n\t
  • 1 <= message.length <= 2000
  • \n\t
  • message consists of lowercase English letters and ' '.
  • \n
\n", + "translatedTitle": "解密消息", + "translatedContent": "

给你字符串 keymessage ,分别表示一个加密密钥和一段加密消息。解密 message 的步骤如下:

\n\n
    \n\t
  1. 使用 key 中 26 个英文小写字母第一次出现的顺序作为替换表中的字母 顺序
  2. \n\t
  3. 将替换表与普通英文字母表对齐,形成对照表。
  4. \n\t
  5. 按照对照表 替换 message 中的每个字母。
  6. \n\t
  7. 空格 ' ' 保持不变。
  8. \n
\n\n
    \n\t
  • 例如,key = \"happy boy\"(实际的加密密钥会包含字母表中每个字母 至少一次),据此,可以得到部分对照表('h' -> 'a''a' -> 'b''p' -> 'c''y' -> 'd''b' -> 'e''o' -> 'f')。
  • \n
\n\n

返回解密后的消息。

\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
\n输入:key = \"the quick brown fox jumps over the lazy dog\", message = \"vkbs bs t suepuv\"\n输出:\"this is a secret\"\n解释:对照表如上图所示。\n提取 \"the quick brown fox jumps over the lazy dog\" 中每个字母的首次出现可以得到替换表。\n
\n\n

示例 2:

\n\n

\"\"

\n\n
\n输入:key = \"eljuxhpwnyrdgtqkviszcfmabo\", message = \"zwx hnfx lqantp mnoeius ycgk vcnjrdb\"\n输出:\"the five boxing wizards jump quickly\"\n解释:对照表如上图所示。\n提取 \"eljuxhpwnyrdgtqkviszcfmabo\" 中每个字母的首次出现可以得到替换表。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 26 <= key.length <= 2000
  • \n\t
  • key 由小写英文字母及 ' ' 组成
  • \n\t
  • key 包含英文字母表中每个字符('a''z'至少一次
  • \n\t
  • 1 <= message.length <= 2000
  • \n\t
  • message 由小写英文字母和 ' ' 组成
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 9, + "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, \"dart\": false}", + "topicTags": [ + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": "字符串", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n string decodeMessage(string key, string message) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public String decodeMessage(String key, String message) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def decodeMessage(self, key, message):\n \"\"\"\n :type key: str\n :type message: str\n :rtype: str\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def decodeMessage(self, key: str, message: str) -> str:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nchar * decodeMessage(char * key, char * message){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public string DecodeMessage(string key, string message) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} key\n * @param {string} message\n * @return {string}\n */\nvar decodeMessage = function(key, message) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} key\n# @param {String} message\n# @return {String}\ndef decode_message(key, message)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func decodeMessage(_ key: String, _ message: String) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func decodeMessage(key string, message string) string {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def decodeMessage(key: String, message: String): String = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun decodeMessage(key: String, message: String): String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn decode_message(key: String, message: String) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $key\n * @param String $message\n * @return String\n */\n function decodeMessage($key, $message) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function decodeMessage(key: string, message: string): string {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (decode-message key message)\n (-> string? string? string?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec decode_message(Key :: unicode:unicode_binary(), Message :: unicode:unicode_binary()) -> unicode:unicode_binary().\ndecode_message(Key, Message) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec decode_message(key :: String.t, message :: String.t) :: String.t\n def decode_message(key, message) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n String decodeMessage(String key, String message) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"10.4K\", \"totalAcceptedRaw\": 8575, \"totalSubmissionRaw\": 10413, \"acRate\": \"82.3%\"}", + "hints": [ + "Iterate through the characters in the key to construct a mapping to the English alphabet.", + "Make sure to check that the current character is not already in the mapping (only the first appearance is considered).", + "Map the characters in the message according to the constructed mapping." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"the quick brown fox jumps over the lazy dog\"\n\"vkbs bs t suepuv\"", + "metaData": "{\n \"name\": \"decodeMessage\",\n \"params\": [\n {\n \"name\": \"key\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"message\"\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "\"the quick brown fox jumps over the lazy dog\"\n\"vkbs bs t suepuv\"\n\"eljuxhpwnyrdgtqkviszcfmabo\"\n\"zwx hnfx lqantp mnoeius ycgk vcnjrdb\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/evaluate-boolean-binary-tree.json b/leetcode-cn/originData/evaluate-boolean-binary-tree.json new file mode 100644 index 00000000..cbb7b4cb --- /dev/null +++ b/leetcode-cn/originData/evaluate-boolean-binary-tree.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2416", + "questionFrontendId": "2331", + "categoryTitle": "Algorithms", + "boundTopicId": 1654490, + "title": "Evaluate Boolean Binary Tree", + "titleSlug": "evaluate-boolean-binary-tree", + "content": "

You are given the root of a full binary tree with the following properties:

\n\n
    \n\t
  • Leaf nodes have either the value 0 or 1, where 0 represents False and 1 represents True.
  • \n\t
  • Non-leaf nodes have either the value 2 or 3, where 2 represents the boolean OR and 3 represents the boolean AND.
  • \n
\n\n

The evaluation of a node is as follows:

\n\n
    \n\t
  • If the node is a leaf node, the evaluation is the value of the node, i.e. True or False.
  • \n\t
  • Otherwise, evaluate the node's two children and apply the boolean operation of its value with the children's evaluations.
  • \n
\n\n

Return the boolean result of evaluating the root node.

\n\n

A full binary tree is a binary tree where each node has either 0 or 2 children.

\n\n

A leaf node is a node that has zero children.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: root = [2,1,3,null,null,0,1]\nOutput: true\nExplanation: The above diagram illustrates the evaluation process.\nThe AND node evaluates to False AND True = False.\nThe OR node evaluates to True OR False = True.\nThe root node evaluates to True, so we return true.
\n\n

Example 2:

\n\n
\nInput: root = [0]\nOutput: false\nExplanation: The root node is a leaf node and it evaluates to false, so we return false.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • The number of nodes in the tree is in the range [1, 1000].
  • \n\t
  • 0 <= Node.val <= 3
  • \n\t
  • Every node has either 0 or 2 children.
  • \n\t
  • Leaf nodes have a value of 0 or 1.
  • \n\t
  • Non-leaf nodes have a value of 2 or 3.
  • \n
\n", + "translatedTitle": "计算布尔二叉树的值", + "translatedContent": "

给你一棵 完整二叉树 的根,这棵树有以下特征:

\n\n
    \n\t
  • 叶子节点 要么值为 0 要么值为 1 ,其中 0 表示 False ,1 表示 True 。
  • \n\t
  • 非叶子节点 要么值为 2 要么值为 3 ,其中 2 表示逻辑或 OR3 表示逻辑与 AND 。
  • \n
\n\n

计算 一个节点的值方式如下:

\n\n
    \n\t
  • 如果节点是个叶子节点,那么节点的  为它本身,即 True 或者 False 。
  • \n\t
  • 否则,计算 两个孩子的节点值,然后将该节点的运算符对两个孩子值进行 运算 。
  • \n
\n\n

返回根节点 root 的布尔运算值。

\n\n

完整二叉树 是每个节点有 0 个或者 2 个孩子的二叉树。

\n\n

叶子节点 是没有孩子的节点。

\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
输入:root = [2,1,3,null,null,0,1]\n输出:true\n解释:上图展示了计算过程。\nAND 与运算节点的值为 False AND True = False 。\nOR 运算节点的值为 True OR False = True 。\n根节点的值为 True ,所以我们返回 true 。
\n\n

示例 2:

\n\n
输入:root = [0]\n输出:false\n解释:根节点是叶子节点,且值为 false,所以我们返回 false 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 树中节点数目在 [1, 1000] 之间。
  • \n\t
  • 0 <= Node.val <= 3
  • \n\t
  • 每个节点的孩子数为 0 或 2 。
  • \n\t
  • 叶子节点的值为 0 或 1 。
  • \n\t
  • 非叶子节点的值为 2 或 3
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"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, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}\n * };\n */\nclass Solution {\npublic:\n bool evaluateTree(TreeNode* root) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * int val;\n * TreeNode left;\n * TreeNode right;\n * TreeNode() {}\n * TreeNode(int val) { this.val = val; }\n * TreeNode(int val, TreeNode left, TreeNode right) {\n * this.val = val;\n * this.left = left;\n * this.right = right;\n * }\n * }\n */\nclass Solution {\n public boolean evaluateTree(TreeNode root) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "# Definition for a binary tree node.\n# class TreeNode(object):\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution(object):\n def evaluateTree(self, root):\n \"\"\"\n :type root: Optional[TreeNode]\n :rtype: bool\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def evaluateTree(self, root: Optional[TreeNode]) -> bool:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * struct TreeNode *left;\n * struct TreeNode *right;\n * };\n */\n\n\nbool evaluateTree(struct TreeNode* root){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public int val;\n * public TreeNode left;\n * public TreeNode right;\n * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {\n * this.val = val;\n * this.left = left;\n * this.right = right;\n * }\n * }\n */\npublic class Solution {\n public bool EvaluateTree(TreeNode root) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * Definition for a binary tree node.\n * function TreeNode(val, left, right) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n */\n/**\n * @param {TreeNode} root\n * @return {boolean}\n */\nvar evaluateTree = function(root) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# Definition for a binary tree node.\n# class TreeNode\n# attr_accessor :val, :left, :right\n# def initialize(val = 0, left = nil, right = nil)\n# @val = val\n# @left = left\n# @right = right\n# end\n# end\n# @param {TreeNode} root\n# @return {Boolean}\ndef evaluate_tree(root)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public var val: Int\n * public var left: TreeNode?\n * public var right: TreeNode?\n * public init() { self.val = 0; self.left = nil; self.right = nil; }\n * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }\n * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {\n * self.val = val\n * self.left = left\n * self.right = right\n * }\n * }\n */\nclass Solution {\n func evaluateTree(_ root: TreeNode?) -> Bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "/**\n * Definition for a binary tree node.\n * type TreeNode struct {\n * Val int\n * Left *TreeNode\n * Right *TreeNode\n * }\n */\nfunc evaluateTree(root *TreeNode) bool {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) {\n * var value: Int = _value\n * var left: TreeNode = _left\n * var right: TreeNode = _right\n * }\n */\nobject Solution {\n def evaluateTree(root: TreeNode): Boolean = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "/**\n * Example:\n * var ti = TreeNode(5)\n * var v = ti.`val`\n * Definition for a binary tree node.\n * class TreeNode(var `val`: Int) {\n * var left: TreeNode? = null\n * var right: TreeNode? = null\n * }\n */\nclass Solution {\n fun evaluateTree(root: TreeNode?): Boolean {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "// Definition for a binary tree node.\n// #[derive(Debug, PartialEq, Eq)]\n// pub struct TreeNode {\n// pub val: i32,\n// pub left: Option>>,\n// pub right: Option>>,\n// }\n//\n// impl TreeNode {\n// #[inline]\n// pub fn new(val: i32) -> Self {\n// TreeNode {\n// val,\n// left: None,\n// right: None\n// }\n// }\n// }\nuse std::rc::Rc;\nuse std::cell::RefCell;\nimpl Solution {\n pub fn evaluate_tree(root: Option>>) -> bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * public $val = null;\n * public $left = null;\n * public $right = null;\n * function __construct($val = 0, $left = null, $right = null) {\n * $this->val = $val;\n * $this->left = $left;\n * $this->right = $right;\n * }\n * }\n */\nclass Solution {\n\n /**\n * @param TreeNode $root\n * @return Boolean\n */\n function evaluateTree($root) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * val: number\n * left: TreeNode | null\n * right: TreeNode | null\n * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n * }\n */\n\nfunction evaluateTree(root: TreeNode | null): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "; Definition for a binary tree node.\n#|\n\n; val : integer?\n; left : (or/c tree-node? #f)\n; right : (or/c tree-node? #f)\n(struct tree-node\n (val left right) #:mutable #:transparent)\n\n; constructor\n(define (make-tree-node [val 0])\n (tree-node val #f #f))\n\n|#\n\n(define/contract (evaluate-tree root)\n (-> (or/c tree-node? #f) boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "%% Definition for a binary tree node.\n%%\n%% -record(tree_node, {val = 0 :: integer(),\n%% left = null :: 'null' | #tree_node{},\n%% right = null :: 'null' | #tree_node{}}).\n\n-spec evaluate_tree(Root :: #tree_node{} | null) -> boolean().\nevaluate_tree(Root) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "# Definition for a binary tree node.\n#\n# defmodule TreeNode do\n# @type t :: %__MODULE__{\n# val: integer,\n# left: TreeNode.t() | nil,\n# right: TreeNode.t() | nil\n# }\n# defstruct val: 0, left: nil, right: nil\n# end\n\ndefmodule Solution do\n @spec evaluate_tree(root :: TreeNode.t | nil) :: boolean\n def evaluate_tree(root) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * int val;\n * TreeNode? left;\n * TreeNode? right;\n * TreeNode([this.val = 0, this.left, this.right]);\n * }\n */\nclass Solution {\n bool evaluateTree(TreeNode? root) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"5K\", \"totalAcceptedRaw\": 4137, \"totalSubmissionRaw\": 5027, \"acRate\": \"82.3%\"}", + "hints": [ + "Traverse the tree using depth-first search in post-order.", + "Can you use recursion to solve this easily?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[2,1,3,null,null,0,1]", + "metaData": "{\n \"name\": \"evaluateTree\",\n \"params\": [\n {\n \"name\": \"root\",\n \"type\": \"TreeNode\"\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

\\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[2,1,3,null,null,0,1]\n[0]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-amount-of-time-to-fill-cups.json b/leetcode-cn/originData/minimum-amount-of-time-to-fill-cups.json new file mode 100644 index 00000000..46d8dede --- /dev/null +++ b/leetcode-cn/originData/minimum-amount-of-time-to-fill-cups.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2412", + "questionFrontendId": "2335", + "categoryTitle": "Algorithms", + "boundTopicId": 1655091, + "title": "Minimum Amount of Time to Fill Cups", + "titleSlug": "minimum-amount-of-time-to-fill-cups", + "content": "

You have a water dispenser that can dispense cold, warm, and hot water. Every second, you can either fill up 2 cups with different types of water, or 1 cup of any type of water.

\n\n

You are given a 0-indexed integer array amount of length 3 where amount[0], amount[1], and amount[2] denote the number of cold, warm, and hot water cups you need to fill respectively. Return the minimum number of seconds needed to fill up all the cups.

\n\n

 

\n

Example 1:

\n\n
\nInput: amount = [1,4,2]\nOutput: 4\nExplanation: One way to fill up the cups is:\nSecond 1: Fill up a cold cup and a warm cup.\nSecond 2: Fill up a warm cup and a hot cup.\nSecond 3: Fill up a warm cup and a hot cup.\nSecond 4: Fill up a warm cup.\nIt can be proven that 4 is the minimum number of seconds needed.\n
\n\n

Example 2:

\n\n
\nInput: amount = [5,4,4]\nOutput: 7\nExplanation: One way to fill up the cups is:\nSecond 1: Fill up a cold cup, and a hot cup.\nSecond 2: Fill up a cold cup, and a warm cup.\nSecond 3: Fill up a cold cup, and a warm cup.\nSecond 4: Fill up a warm cup, and a hot cup.\nSecond 5: Fill up a cold cup, and a hot cup.\nSecond 6: Fill up a cold cup, and a warm cup.\nSecond 7: Fill up a hot cup.\n
\n\n

Example 3:

\n\n
\nInput: amount = [5,0,0]\nOutput: 5\nExplanation: Every second, we fill up a cold cup.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • amount.length == 3
  • \n\t
  • 0 <= amount[i] <= 100
  • \n
\n", + "translatedTitle": "装满杯子需要的最短总时长", + "translatedContent": "

现有一台饮水机,可以制备冷水、温水和热水。每秒钟,可以装满 2不同 类型的水或者 1 杯任意类型的水。

\n\n

给你一个下标从 0 开始、长度为 3 的整数数组 amount ,其中 amount[0]amount[1]amount[2] 分别表示需要装满冷水、温水和热水的杯子数量。返回装满所有杯子所需的 最少 秒数。

\n\n

 

\n\n

示例 1:

\n\n
输入:amount = [1,4,2]\n输出:4\n解释:下面给出一种方案:\n第 1 秒:装满一杯冷水和一杯温水。\n第 2 秒:装满一杯温水和一杯热水。\n第 3 秒:装满一杯温水和一杯热水。\n第 4 秒:装满一杯温水。\n可以证明最少需要 4 秒才能装满所有杯子。\n
\n\n

示例 2:

\n\n
输入:amount = [5,4,4]\n输出:7\n解释:下面给出一种方案:\n第 1 秒:装满一杯冷水和一杯热水。\n第 2 秒:装满一杯冷水和一杯温水。\n第 3 秒:装满一杯冷水和一杯温水。\n第 4 秒:装满一杯温水和一杯热水。\n第 5 秒:装满一杯冷水和一杯热水。\n第 6 秒:装满一杯冷水和一杯温水。\n第 7 秒:装满一杯热水。\n
\n\n

示例 3:

\n\n
输入:amount = [5,0,0]\n输出:5\n解释:每秒装满一杯冷水。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • amount.length == 3
  • \n\t
  • 0 <= amount[i] <= 100
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 9, + "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, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int fillCups(vector& amount) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int fillCups(int[] amount) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def fillCups(self, amount):\n \"\"\"\n :type amount: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def fillCups(self, amount: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint fillCups(int* amount, int amountSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int FillCups(int[] amount) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} amount\n * @return {number}\n */\nvar fillCups = function(amount) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} amount\n# @return {Integer}\ndef fill_cups(amount)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func fillCups(_ amount: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func fillCups(amount []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def fillCups(amount: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun fillCups(amount: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn fill_cups(amount: Vec) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $amount\n * @return Integer\n */\n function fillCups($amount) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function fillCups(amount: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (fill-cups amount)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec fill_cups(Amount :: [integer()]) -> integer().\nfill_cups(Amount) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec fill_cups(amount :: [integer]) :: integer\n def fill_cups(amount) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int fillCups(List amount) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"14K\", \"totalAcceptedRaw\": 7882, \"totalSubmissionRaw\": 14036, \"acRate\": \"56.2%\"}", + "hints": [ + "To minimize the amount of time needed, you want to fill up as many cups as possible in each second. This means that you want to maximize the number of seconds where you are filling up two cups.", + "You always want to fill up the two types of water with the most unfilled cups." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,4,2]", + "metaData": "{\n \"name\": \"fillCups\",\n \"params\": [\n {\n \"name\": \"amount\",\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,4,2]\n[5,4,4]\n[5,0,0]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-sum-of-squared-difference.json b/leetcode-cn/originData/minimum-sum-of-squared-difference.json new file mode 100644 index 00000000..7d5ac7a0 --- /dev/null +++ b/leetcode-cn/originData/minimum-sum-of-squared-difference.json @@ -0,0 +1,165 @@ +{ + "data": { + "question": { + "questionId": "2418", + "questionFrontendId": "2333", + "categoryTitle": "Algorithms", + "boundTopicId": 1654902, + "title": "Minimum Sum of Squared Difference", + "titleSlug": "minimum-sum-of-squared-difference", + "content": "

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

\n\n

The sum of squared difference of arrays nums1 and nums2 is defined as the sum of (nums1[i] - nums2[i])2 for each 0 <= i < n.

\n\n

You are also given two positive integers k1 and k2. You can modify any of the elements of nums1 by +1 or -1 at most k1 times. Similarly, you can modify any of the elements of nums2 by +1 or -1 at most k2 times.

\n\n

Return the minimum sum of squared difference after modifying array nums1 at most k1 times and modifying array nums2 at most k2 times.

\n\n

Note: You are allowed to modify the array elements to become negative integers.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [1,2,3,4], nums2 = [2,10,20,19], k1 = 0, k2 = 0\nOutput: 579\nExplanation: The elements in nums1 and nums2 cannot be modified because k1 = 0 and k2 = 0. \nThe sum of square difference will be: (1 - 2)2 + (2 - 10)2 + (3 - 20)2 + (4 - 19)2 = 579.\n
\n\n

Example 2:

\n\n
\nInput: nums1 = [1,4,10,12], nums2 = [5,8,6,9], k1 = 1, k2 = 1\nOutput: 43\nExplanation: One way to obtain the minimum sum of square difference is: \n- Increase nums1[0] once.\n- Increase nums2[2] once.\nThe minimum of the sum of square difference will be: \n(2 - 5)2 + (4 - 8)2 + (10 - 7)2 + (12 - 9)2 = 43.\nNote that, there are other ways to obtain the minimum of the sum of square difference, but there is no way to obtain a sum smaller than 43.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 0 <= nums1[i], nums2[i] <= 105
  • \n\t
  • 0 <= k1, k2 <= 109
  • \n
\n", + "translatedTitle": "最小差值平方和", + "translatedContent": "

给你两个下标从 0 开始的整数数组 nums1 和 nums2 ,长度为 n 。

\n\n

数组 nums1 和 nums2 的 差值平方和 定义为所有满足 0 <= i < n 的 (nums1[i] - nums2[i])2 之和。

\n\n

同时给你两个正整数 k1 和 k2 。你可以将 nums1 中的任意元素 +1 或者 -1 至多 k1 次。类似的,你可以将 nums2 中的任意元素 +1 或者 -1 至多 k2 次。

\n\n

请你返回修改数组 nums1 至多 k1 次且修改数组 nums2 至多 k2 次后的最小 差值平方和 。

\n\n

注意:你可以将数组中的元素变成  整数。

\n\n

 

\n\n

示例 1:

\n\n
输入:nums1 = [1,2,3,4], nums2 = [2,10,20,19], k1 = 0, k2 = 0\n输出:579\n解释:nums1 和 nums2 中的元素不能修改,因为 k1 = 0 和 k2 = 0 。\n差值平方和为:(1 - 2)2 + (2 - 10)2 + (3 - 20)2 + (4 - 19)2 = 579 。\n
\n\n

示例 2:

\n\n
输入:nums1 = [1,4,10,12], nums2 = [5,8,6,9], k1 = 1, k2 = 1\n输出:43\n解释:一种得到最小差值平方和的方式为:\n- 将 nums1[0] 增加一次。\n- 将 nums2[2] 增加一次。\n最小差值平方和为:\n(2 - 5)2 + (4 - 8)2 + (10 - 7)2 + (12 - 9)2 = 43 。\n注意,也有其他方式可以得到最小差值平方和,但没有得到比 43 更小答案的方案。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 0 <= nums1[i], nums2[i] <= 105
  • \n\t
  • 0 <= k1, k2 <= 109
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 18, + "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, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long minSumSquareDiff(vector& nums1, vector& nums2, int k1, int k2) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long minSumSquareDiff(int[] nums1, int[] nums2, int k1, int k2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minSumSquareDiff(self, nums1, nums2, k1, k2):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :type k1: int\n :type k2: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minSumSquareDiff(self, nums1: List[int], nums2: List[int], k1: int, k2: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nlong long minSumSquareDiff(int* nums1, int nums1Size, int* nums2, int nums2Size, int k1, int k2){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MinSumSquareDiff(int[] nums1, int[] nums2, int k1, int k2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @param {number} k1\n * @param {number} k2\n * @return {number}\n */\nvar minSumSquareDiff = function(nums1, nums2, k1, k2) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @param {Integer} k1\n# @param {Integer} k2\n# @return {Integer}\ndef min_sum_square_diff(nums1, nums2, k1, k2)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minSumSquareDiff(_ nums1: [Int], _ nums2: [Int], _ k1: Int, _ k2: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minSumSquareDiff(nums1 []int, nums2 []int, k1 int, k2 int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minSumSquareDiff(nums1: Array[Int], nums2: Array[Int], k1: Int, k2: Int): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minSumSquareDiff(nums1: IntArray, nums2: IntArray, k1: Int, k2: Int): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_sum_square_diff(nums1: Vec, nums2: Vec, k1: i32, k2: i32) -> i64 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums1\n * @param Integer[] $nums2\n * @param Integer $k1\n * @param Integer $k2\n * @return Integer\n */\n function minSumSquareDiff($nums1, $nums2, $k1, $k2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minSumSquareDiff(nums1: number[], nums2: number[], k1: number, k2: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-sum-square-diff nums1 nums2 k1 k2)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_sum_square_diff(Nums1 :: [integer()], Nums2 :: [integer()], K1 :: integer(), K2 :: integer()) -> integer().\nmin_sum_square_diff(Nums1, Nums2, K1, K2) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_sum_square_diff(nums1 :: [integer], nums2 :: [integer], k1 :: integer, k2 :: integer) :: integer\n def min_sum_square_diff(nums1, nums2, k1, k2) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minSumSquareDiff(List nums1, List nums2, int k1, int k2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"10.7K\", \"totalAcceptedRaw\": 2509, \"totalSubmissionRaw\": 10728, \"acRate\": \"23.4%\"}", + "hints": [ + "There is no difference between the purpose of k1 and k2. Adding +1 to one element in nums1 is same as performing -1 to one element in nums2, and vice versa.", + "Reduce the sum of squared difference greedily. One operation of k should use the index that has the current maximum difference.", + "Binary search the maximum difference for the final result." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,3,4]\n[2,10,20,19]\n0\n0", + "metaData": "{\n \"name\": \"minSumSquareDiff\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k1\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k2\"\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,2,3,4]\n[2,10,20,19]\n0\n0\n[1,4,10,12]\n[5,8,6,9]\n1\n1", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/move-pieces-to-obtain-a-string.json b/leetcode-cn/originData/move-pieces-to-obtain-a-string.json new file mode 100644 index 00000000..1c5ce40e --- /dev/null +++ b/leetcode-cn/originData/move-pieces-to-obtain-a-string.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2414", + "questionFrontendId": "2337", + "categoryTitle": "Algorithms", + "boundTopicId": 1655096, + "title": "Move Pieces to Obtain a String", + "titleSlug": "move-pieces-to-obtain-a-string", + "content": "

You are given two strings start and target, both of length n. Each string consists only of the characters 'L', 'R', and '_' where:

\n\n
    \n\t
  • The characters 'L' and 'R' represent pieces, where a piece 'L' can move to the left only if there is a blank space directly to its left, and a piece 'R' can move to the right only if there is a blank space directly to its right.
  • \n\t
  • The character '_' represents a blank space that can be occupied by any of the 'L' or 'R' pieces.
  • \n
\n\n

Return true if it is possible to obtain the string target by moving the pieces of the string start any number of times. Otherwise, return false.

\n\n

 

\n

Example 1:

\n\n
\nInput: start = "_L__R__R_", target = "L______RR"\nOutput: true\nExplanation: We can obtain the string target from start by doing the following moves:\n- Move the first piece one step to the left, start becomes equal to "L___R__R_".\n- Move the last piece one step to the right, start becomes equal to "L___R___R".\n- Move the second piece three steps to the right, start becomes equal to "L______RR".\nSince it is possible to get the string target from start, we return true.\n
\n\n

Example 2:

\n\n
\nInput: start = "R_L_", target = "__LR"\nOutput: false\nExplanation: The 'R' piece in the string start can move one step to the right to obtain "_RL_".\nAfter that, no pieces can move anymore, so it is impossible to obtain the string target from start.\n
\n\n

Example 3:

\n\n
\nInput: start = "_R", target = "R_"\nOutput: false\nExplanation: The piece in the string start can move only to the right, so it is impossible to obtain the string target from start.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == start.length == target.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • start and target consist of the characters 'L', 'R', and '_'.
  • \n
\n", + "translatedTitle": "移动片段得到字符串", + "translatedContent": "

给你两个字符串 starttarget ,长度均为 n 。每个字符串 由字符 'L''R''_' 组成,其中:

\n\n
    \n\t
  • 字符 'L''R' 表示片段,其中片段 'L' 只有在其左侧直接存在一个 空位 时才能向 移动,而片段 'R' 只有在其右侧直接存在一个 空位 时才能向 移动。
  • \n\t
  • 字符 '_' 表示可以被 任意 'L''R' 片段占据的空位。
  • \n
\n\n

如果在移动字符串 start 中的片段任意次之后可以得到字符串 target ,返回 true ;否则,返回 false

\n\n

 

\n\n

示例 1:

\n\n
输入:start = \"_L__R__R_\", target = \"L______RR\"\n输出:true\n解释:可以从字符串 start 获得 target ,需要进行下面的移动:\n- 将第一个片段向左移动一步,字符串现在变为 \"L___R__R_\" 。\n- 将最后一个片段向右移动一步,字符串现在变为 \"L___R___R\" 。\n- 将第二个片段向右移动散步,字符串现在变为 \"L______RR\" 。\n可以从字符串 start 得到 target ,所以返回 true 。\n
\n\n

示例 2:

\n\n
输入:start = \"R_L_\", target = \"__LR\"\n输出:false\n解释:字符串 start 中的 'R' 片段可以向右移动一步得到 \"_RL_\" 。\n但是,在这一步之后,不存在可以移动的片段,所以无法从字符串 start 得到 target 。\n
\n\n

示例 3:

\n\n
输入:start = \"_R\", target = \"R_\"\n输出:false\n解释:字符串 start 中的片段只能向右移动,所以无法从字符串 start 得到 target 。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == start.length == target.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • starttarget 由字符 'L''R''_' 组成
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 17, + "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, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool canChange(string start, string target) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean canChange(String start, String target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def canChange(self, start, target):\n \"\"\"\n :type start: str\n :type target: str\n :rtype: bool\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def canChange(self, start: str, target: str) -> bool:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nbool canChange(char * start, char * target){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool CanChange(string start, string target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} start\n * @param {string} target\n * @return {boolean}\n */\nvar canChange = function(start, target) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} start\n# @param {String} target\n# @return {Boolean}\ndef can_change(start, target)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func canChange(_ start: String, _ target: String) -> Bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func canChange(start string, target string) bool {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def canChange(start: String, target: String): Boolean = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun canChange(start: String, target: String): Boolean {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn can_change(start: String, target: String) -> bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $start\n * @param String $target\n * @return Boolean\n */\n function canChange($start, $target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function canChange(start: string, target: string): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (can-change start target)\n (-> string? string? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec can_change(Start :: unicode:unicode_binary(), Target :: unicode:unicode_binary()) -> boolean().\ncan_change(Start, Target) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec can_change(start :: String.t, target :: String.t) :: boolean\n def can_change(start, target) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool canChange(String start, String target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"14K\", \"totalAcceptedRaw\": 5822, \"totalSubmissionRaw\": 14024, \"acRate\": \"41.5%\"}", + "hints": [ + "After some sequence of moves, can the order of the pieces change?", + "Try to match each piece in s with a piece in e." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"_L__R__R_\"\n\"L______RR\"", + "metaData": "{\n \"name\": \"canChange\",\n \"params\": [\n {\n \"name\": \"start\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"target\"\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

\\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "\"_L__R__R_\"\n\"L______RR\"\n\"R_L_\"\n\"__LR\"\n\"_R\"\n\"R_\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/number-of-increasing-paths-in-a-grid.json b/leetcode-cn/originData/number-of-increasing-paths-in-a-grid.json new file mode 100644 index 00000000..e500829d --- /dev/null +++ b/leetcode-cn/originData/number-of-increasing-paths-in-a-grid.json @@ -0,0 +1,213 @@ +{ + "data": { + "question": { + "questionId": "2409", + "questionFrontendId": "2328", + "categoryTitle": "Algorithms", + "boundTopicId": 1632857, + "title": "Number of Increasing Paths in a Grid", + "titleSlug": "number-of-increasing-paths-in-a-grid", + "content": "

You are given an m x n integer matrix grid, where you can move from a cell to any adjacent cell in all 4 directions.

\n\n

Return the number of strictly increasing paths in the grid such that you can start from any cell and end at any cell. Since the answer may be very large, return it modulo 109 + 7.

\n\n

Two paths are considered different if they do not have exactly the same sequence of visited cells.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: grid = [[1,1],[3,4]]\nOutput: 8\nExplanation: The strictly increasing paths are:\n- Paths with length 1: [1], [1], [3], [4].\n- Paths with length 2: [1 -> 3], [1 -> 4], [3 -> 4].\n- Paths with length 3: [1 -> 3 -> 4].\nThe total number of paths is 4 + 3 + 1 = 8.\n
\n\n

Example 2:

\n\n
\nInput: grid = [[1],[2]]\nOutput: 3\nExplanation: The strictly increasing paths are:\n- Paths with length 1: [1], [2].\n- Paths with length 2: [1 -> 2].\nThe total number of paths is 2 + 1 = 3.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • m == grid.length
  • \n\t
  • n == grid[i].length
  • \n\t
  • 1 <= m, n <= 1000
  • \n\t
  • 1 <= m * n <= 105
  • \n\t
  • 1 <= grid[i][j] <= 105
  • \n
\n", + "translatedTitle": "网格图中递增路径的数目", + "translatedContent": "

给你一个 m x n 的整数网格图 grid ,你可以从一个格子移动到 4 个方向相邻的任意一个格子。

\n\n

请你返回在网格图中从 任意 格子出发,达到 任意 格子,且路径中的数字是 严格递增 的路径数目。由于答案可能会很大,请将结果对 109 + 7 取余 后返回。

\n\n

如果两条路径中访问过的格子不是完全相同的,那么它们视为两条不同的路径。

\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
输入:grid = [[1,1],[3,4]]\n输出:8\n解释:严格递增路径包括:\n- 长度为 1 的路径:[1],[1],[3],[4] 。\n- 长度为 2 的路径:[1 -> 3],[1 -> 4],[3 -> 4] 。\n- 长度为 3 的路径:[1 -> 3 -> 4] 。\n路径数目为 4 + 3 + 1 = 8 。\n
\n\n

示例 2:

\n\n
输入:grid = [[1],[2]]\n输出:3\n解释:严格递增路径包括:\n- 长度为 1 的路径:[1],[2] 。\n- 长度为 2 的路径:[1 -> 2] 。\n路径数目为 2 + 1 = 3 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • m == grid.length
  • \n\t
  • n == grid[i].length
  • \n\t
  • 1 <= m, n <= 1000
  • \n\t
  • 1 <= m * n <= 105
  • \n\t
  • 1 <= grid[i][j] <= 105
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 18, + "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, \"dart\": 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": "Graph", + "slug": "graph", + "translatedName": "图", + "__typename": "TopicTagNode" + }, + { + "name": "Topological Sort", + "slug": "topological-sort", + "translatedName": "拓扑排序", + "__typename": "TopicTagNode" + }, + { + "name": "Memoization", + "slug": "memoization", + "translatedName": "记忆化搜索", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + }, + { + "name": "Matrix", + "slug": "matrix", + "translatedName": "矩阵", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countPaths(vector>& grid) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countPaths(int[][] grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countPaths(self, grid):\n \"\"\"\n :type grid: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countPaths(self, grid: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint countPaths(int** grid, int gridSize, int* gridColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountPaths(int[][] grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} grid\n * @return {number}\n */\nvar countPaths = function(grid) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} grid\n# @return {Integer}\ndef count_paths(grid)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countPaths(_ grid: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countPaths(grid [][]int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countPaths(grid: Array[Array[Int]]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countPaths(grid: Array): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_paths(grid: Vec>) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $grid\n * @return Integer\n */\n function countPaths($grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countPaths(grid: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-paths grid)\n (-> (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_paths(Grid :: [[integer()]]) -> integer().\ncount_paths(Grid) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_paths(grid :: [[integer]]) :: integer\n def count_paths(grid) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int countPaths(List> grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"9.2K\", \"totalAcceptedRaw\": 4513, \"totalSubmissionRaw\": 9174, \"acRate\": \"49.2%\"}", + "hints": [ + "How can you calculate the number of increasing paths that start from a cell (i, j)? Think about dynamic programming.", + "Define f(i, j) as the number of increasing paths starting from cell (i, j). Try to find how f(i, j) is related to each of f(i, j+1), f(i, j-1), f(i+1, j) and f(i-1, j)." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[1,1],[3,4]]", + "metaData": "{\n \"name\": \"countPaths\",\n \"params\": [\n {\n \"name\": \"grid\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[[1,1],[3,4]]\n[[1],[2]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/number-of-people-aware-of-a-secret.json b/leetcode-cn/originData/number-of-people-aware-of-a-secret.json new file mode 100644 index 00000000..c4eb694a --- /dev/null +++ b/leetcode-cn/originData/number-of-people-aware-of-a-secret.json @@ -0,0 +1,184 @@ +{ + "data": { + "question": { + "questionId": "2408", + "questionFrontendId": "2327", + "categoryTitle": "Algorithms", + "boundTopicId": 1632832, + "title": "Number of People Aware of a Secret", + "titleSlug": "number-of-people-aware-of-a-secret", + "content": "

On day 1, one person discovers a secret.

\n\n

You are given an integer delay, which means that each person will share the secret with a new person every day, starting from delay days after discovering the secret. You are also given an integer forget, which means that each person will forget the secret forget days after discovering it. A person cannot share the secret on the same day they forgot it, or on any day afterwards.

\n\n

Given an integer n, return the number of people who know the secret at the end of day n. Since the answer may be very large, return it modulo 109 + 7.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 6, delay = 2, forget = 4\nOutput: 5\nExplanation:\nDay 1: Suppose the first person is named A. (1 person)\nDay 2: A is the only person who knows the secret. (1 person)\nDay 3: A shares the secret with a new person, B. (2 people)\nDay 4: A shares the secret with a new person, C. (3 people)\nDay 5: A forgets the secret, and B shares the secret with a new person, D. (3 people)\nDay 6: B shares the secret with E, and C shares the secret with F. (5 people)\n
\n\n

Example 2:

\n\n
\nInput: n = 4, delay = 1, forget = 3\nOutput: 6\nExplanation:\nDay 1: The first person is named A. (1 person)\nDay 2: A shares the secret with B. (2 people)\nDay 3: A and B share the secret with 2 new people, C and D. (4 people)\nDay 4: A forgets the secret. B, C, and D share the secret with 3 new people. (6 people)\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 2 <= n <= 1000
  • \n\t
  • 1 <= delay < forget <= n
  • \n
\n", + "translatedTitle": "知道秘密的人数", + "translatedContent": "

在第 1 天,有一个人发现了一个秘密。

\n\n

给你一个整数 delay ,表示每个人会在发现秘密后的 delay 天之后,每天 给一个新的人 分享 秘密。同时给你一个整数 forget ,表示每个人在发现秘密 forget 天之后会 忘记 这个秘密。一个人 不能 在忘记秘密那一天及之后的日子里分享秘密。

\n\n

给你一个整数 n ,请你返回在第 n 天结束时,知道秘密的人数。由于答案可能会很大,请你将结果对 109 + 7 取余 后返回。

\n\n

 

\n\n

示例 1:

\n\n
输入:n = 6, delay = 2, forget = 4\n输出:5\n解释:\n第 1 天:假设第一个人叫 A 。(一个人知道秘密)\n第 2 天:A 是唯一一个知道秘密的人。(一个人知道秘密)\n第 3 天:A 把秘密分享给 B 。(两个人知道秘密)\n第 4 天:A 把秘密分享给一个新的人 C 。(三个人知道秘密)\n第 5 天:A 忘记了秘密,B 把秘密分享给一个新的人 D 。(三个人知道秘密)\n第 6 天:B 把秘密分享给 E,C 把秘密分享给 F 。(五个人知道秘密)\n
\n\n

示例 2:

\n\n
输入:n = 4, delay = 1, forget = 3\n输出:6\n解释:\n第 1 天:第一个知道秘密的人为 A 。(一个人知道秘密)\n第 2 天:A 把秘密分享给 B 。(两个人知道秘密)\n第 3 天:A 和 B 把秘密分享给 2 个新的人 C 和 D 。(四个人知道秘密)\n第 4 天:A 忘记了秘密,B、C、D 分别分享给 3 个新的人。(六个人知道秘密)\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 2 <= n <= 1000
  • \n\t
  • 1 <= delay < forget <= n
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 30, + "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, \"dart\": false}", + "topicTags": [ + { + "name": "Queue", + "slug": "queue", + "translatedName": "队列", + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": "模拟", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int peopleAwareOfSecret(int n, int delay, int forget) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int peopleAwareOfSecret(int n, int delay, int forget) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def peopleAwareOfSecret(self, n, delay, forget):\n \"\"\"\n :type n: int\n :type delay: int\n :type forget: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def peopleAwareOfSecret(self, n: int, delay: int, forget: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint peopleAwareOfSecret(int n, int delay, int forget){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int PeopleAwareOfSecret(int n, int delay, int forget) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} delay\n * @param {number} forget\n * @return {number}\n */\nvar peopleAwareOfSecret = function(n, delay, forget) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} delay\n# @param {Integer} forget\n# @return {Integer}\ndef people_aware_of_secret(n, delay, forget)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func peopleAwareOfSecret(_ n: Int, _ delay: Int, _ forget: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func peopleAwareOfSecret(n int, delay int, forget int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def peopleAwareOfSecret(n: Int, delay: Int, forget: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun peopleAwareOfSecret(n: Int, delay: Int, forget: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn people_aware_of_secret(n: i32, delay: i32, forget: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $delay\n * @param Integer $forget\n * @return Integer\n */\n function peopleAwareOfSecret($n, $delay, $forget) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function peopleAwareOfSecret(n: number, delay: number, forget: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (people-aware-of-secret n delay forget)\n (-> exact-integer? exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec people_aware_of_secret(N :: integer(), Delay :: integer(), Forget :: integer()) -> integer().\npeople_aware_of_secret(N, Delay, Forget) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec people_aware_of_secret(n :: integer, delay :: integer, forget :: integer) :: integer\n def people_aware_of_secret(n, delay, forget) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int peopleAwareOfSecret(int n, int delay, int forget) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"15.2K\", \"totalAcceptedRaw\": 6773, \"totalSubmissionRaw\": 15162, \"acRate\": \"44.7%\"}", + "hints": [ + "Let dp[i][j] be the number of people who have known the secret for exactly j + 1 days, at day i.", + "If j > 0, dp[i][j] = dp[i – 1][j – 1].", + "dp[i][0] = sum(dp[i – 1][j]) for j in [delay – 1, forget – 2]." + ], + "solution": null, + "status": null, + "sampleTestCase": "6\n2\n4", + "metaData": "{\n \"name\": \"peopleAwareOfSecret\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"delay\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"forget\"\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "6\n2\n4\n4\n1\n3", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/smallest-number-in-infinite-set.json b/leetcode-cn/originData/smallest-number-in-infinite-set.json new file mode 100644 index 00000000..06bc237f --- /dev/null +++ b/leetcode-cn/originData/smallest-number-in-infinite-set.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2413", + "questionFrontendId": "2336", + "categoryTitle": "Algorithms", + "boundTopicId": 1655094, + "title": "Smallest Number in Infinite Set", + "titleSlug": "smallest-number-in-infinite-set", + "content": "

You have a set which contains all positive integers [1, 2, 3, 4, 5, ...].

\n\n

Implement the SmallestInfiniteSet class:

\n\n
    \n\t
  • SmallestInfiniteSet() Initializes the SmallestInfiniteSet object to contain all positive integers.
  • \n\t
  • int popSmallest() Removes and returns the smallest integer contained in the infinite set.
  • \n\t
  • void addBack(int num) Adds a positive integer num back into the infinite set, if it is not already in the infinite set.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput\n["SmallestInfiniteSet", "addBack", "popSmallest", "popSmallest", "popSmallest", "addBack", "popSmallest", "popSmallest", "popSmallest"]\n[[], [2], [], [], [], [1], [], [], []]\nOutput\n[null, null, 1, 2, 3, null, 1, 4, 5]\n\nExplanation\nSmallestInfiniteSet smallestInfiniteSet = new SmallestInfiniteSet();\nsmallestInfiniteSet.addBack(2);    // 2 is already in the set, so no change is made.\nsmallestInfiniteSet.popSmallest(); // return 1, since 1 is the smallest number, and remove it from the set.\nsmallestInfiniteSet.popSmallest(); // return 2, and remove it from the set.\nsmallestInfiniteSet.popSmallest(); // return 3, and remove it from the set.\nsmallestInfiniteSet.addBack(1);    // 1 is added back to the set.\nsmallestInfiniteSet.popSmallest(); // return 1, since 1 was added back to the set and\n                                   // is the smallest number, and remove it from the set.\nsmallestInfiniteSet.popSmallest(); // return 4, and remove it from the set.\nsmallestInfiniteSet.popSmallest(); // return 5, and remove it from the set.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= num <= 1000
  • \n\t
  • At most 1000 calls will be made in total to popSmallest and addBack.
  • \n
\n", + "translatedTitle": "无限集中的最小数字", + "translatedContent": "

现有一个包含所有正整数的集合 [1, 2, 3, 4, 5, ...]

\n\n

实现 SmallestInfiniteSet 类:

\n\n
    \n\t
  • SmallestInfiniteSet() 初始化 SmallestInfiniteSet 对象以包含 所有 正整数。
  • \n\t
  • int popSmallest() 移除 并返回该无限集中的最小整数。
  • \n\t
  • void addBack(int num) 如果正整数 num 存在于无限集中,则将一个 num 添加 到该无限集中。
  • \n
\n\n

 

\n\n

示例:

\n\n
输入\n[\"SmallestInfiniteSet\", \"addBack\", \"popSmallest\", \"popSmallest\", \"popSmallest\", \"addBack\", \"popSmallest\", \"popSmallest\", \"popSmallest\"]\n[[], [2], [], [], [], [1], [], [], []]\n输出\n[null, null, 1, 2, 3, null, 1, 4, 5]\n\n解释\nSmallestInfiniteSet smallestInfiniteSet = new SmallestInfiniteSet();\nsmallestInfiniteSet.addBack(2);    // 2 已经在集合中,所以不做任何变更。\nsmallestInfiniteSet.popSmallest(); // 返回 1 ,因为 1 是最小的整数,并将其从集合中移除。\nsmallestInfiniteSet.popSmallest(); // 返回 2 ,并将其从集合中移除。\nsmallestInfiniteSet.popSmallest(); // 返回 3 ,并将其从集合中移除。\nsmallestInfiniteSet.addBack(1);    // 将 1 添加到该集合中。\nsmallestInfiniteSet.popSmallest(); // 返回 1 ,因为 1 在上一步中被添加到集合中,\n                                   // 且 1 是最小的整数,并将其从集合中移除。\nsmallestInfiniteSet.popSmallest(); // 返回 4 ,并将其从集合中移除。\nsmallestInfiniteSet.popSmallest(); // 返回 5 ,并将其从集合中移除。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= num <= 1000
  • \n\t
  • 最多调用 popSmallestaddBack 方法 共计 1000
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 7, + "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, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class SmallestInfiniteSet {\npublic:\n SmallestInfiniteSet() {\n\n }\n \n int popSmallest() {\n\n }\n \n void addBack(int num) {\n\n }\n};\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * SmallestInfiniteSet* obj = new SmallestInfiniteSet();\n * int param_1 = obj->popSmallest();\n * obj->addBack(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class SmallestInfiniteSet {\n\n public SmallestInfiniteSet() {\n\n }\n \n public int popSmallest() {\n\n }\n \n public void addBack(int num) {\n\n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * SmallestInfiniteSet obj = new SmallestInfiniteSet();\n * int param_1 = obj.popSmallest();\n * obj.addBack(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class SmallestInfiniteSet(object):\n\n def __init__(self):\n\n\n def popSmallest(self):\n \"\"\"\n :rtype: int\n \"\"\"\n\n\n def addBack(self, num):\n \"\"\"\n :type num: int\n :rtype: None\n \"\"\"\n\n\n\n# Your SmallestInfiniteSet object will be instantiated and called as such:\n# obj = SmallestInfiniteSet()\n# param_1 = obj.popSmallest()\n# obj.addBack(num)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class SmallestInfiniteSet:\n\n def __init__(self):\n\n\n def popSmallest(self) -> int:\n\n\n def addBack(self, num: int) -> None:\n\n\n\n# Your SmallestInfiniteSet object will be instantiated and called as such:\n# obj = SmallestInfiniteSet()\n# param_1 = obj.popSmallest()\n# obj.addBack(num)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\n\ntypedef struct {\n\n} SmallestInfiniteSet;\n\n\nSmallestInfiniteSet* smallestInfiniteSetCreate() {\n\n}\n\nint smallestInfiniteSetPopSmallest(SmallestInfiniteSet* obj) {\n\n}\n\nvoid smallestInfiniteSetAddBack(SmallestInfiniteSet* obj, int num) {\n\n}\n\nvoid smallestInfiniteSetFree(SmallestInfiniteSet* obj) {\n\n}\n\n/**\n * Your SmallestInfiniteSet struct will be instantiated and called as such:\n * SmallestInfiniteSet* obj = smallestInfiniteSetCreate();\n * int param_1 = smallestInfiniteSetPopSmallest(obj);\n \n * smallestInfiniteSetAddBack(obj, num);\n \n * smallestInfiniteSetFree(obj);\n*/", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class SmallestInfiniteSet {\n\n public SmallestInfiniteSet() {\n\n }\n \n public int PopSmallest() {\n\n }\n \n public void AddBack(int num) {\n\n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * SmallestInfiniteSet obj = new SmallestInfiniteSet();\n * int param_1 = obj.PopSmallest();\n * obj.AddBack(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "\nvar SmallestInfiniteSet = function() {\n\n};\n\n/**\n * @return {number}\n */\nSmallestInfiniteSet.prototype.popSmallest = function() {\n\n};\n\n/** \n * @param {number} num\n * @return {void}\n */\nSmallestInfiniteSet.prototype.addBack = function(num) {\n\n};\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * var obj = new SmallestInfiniteSet()\n * var param_1 = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "class SmallestInfiniteSet\n def initialize()\n\n end\n\n\n=begin\n :rtype: Integer\n=end\n def pop_smallest()\n\n end\n\n\n=begin\n :type num: Integer\n :rtype: Void\n=end\n def add_back(num)\n\n end\n\n\nend\n\n# Your SmallestInfiniteSet object will be instantiated and called as such:\n# obj = SmallestInfiniteSet.new()\n# param_1 = obj.pop_smallest()\n# obj.add_back(num)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "\nclass SmallestInfiniteSet {\n\n init() {\n\n }\n \n func popSmallest() -> Int {\n\n }\n \n func addBack(_ num: Int) {\n\n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * let obj = SmallestInfiniteSet()\n * let ret_1: Int = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "type SmallestInfiniteSet struct {\n\n}\n\n\nfunc Constructor() SmallestInfiniteSet {\n\n}\n\n\nfunc (this *SmallestInfiniteSet) PopSmallest() int {\n\n}\n\n\nfunc (this *SmallestInfiniteSet) AddBack(num int) {\n\n}\n\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * obj := Constructor();\n * param_1 := obj.PopSmallest();\n * obj.AddBack(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "class SmallestInfiniteSet() {\n\n def popSmallest(): Int = {\n\n }\n\n def addBack(num: Int) {\n\n }\n\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * var obj = new SmallestInfiniteSet()\n * var param_1 = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class SmallestInfiniteSet() {\n\n fun popSmallest(): Int {\n\n }\n\n fun addBack(num: Int) {\n\n }\n\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * var obj = SmallestInfiniteSet()\n * var param_1 = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "struct SmallestInfiniteSet {\n\n}\n\n\n/**\n * `&self` means the method takes an immutable reference.\n * If you need a mutable reference, change it to `&mut self` instead.\n */\nimpl SmallestInfiniteSet {\n\n fn new() -> Self {\n\n }\n \n fn pop_smallest(&self) -> i32 {\n\n }\n \n fn add_back(&self, num: i32) {\n\n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * let obj = SmallestInfiniteSet::new();\n * let ret_1: i32 = obj.pop_smallest();\n * obj.add_back(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class SmallestInfiniteSet {\n /**\n */\n function __construct() {\n\n }\n\n /**\n * @return Integer\n */\n function popSmallest() {\n\n }\n\n /**\n * @param Integer $num\n * @return NULL\n */\n function addBack($num) {\n\n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * $obj = SmallestInfiniteSet();\n * $ret_1 = $obj->popSmallest();\n * $obj->addBack($num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "class SmallestInfiniteSet {\n constructor() {\n\n }\n\n popSmallest(): number {\n\n }\n\n addBack(num: number): void {\n\n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * var obj = new SmallestInfiniteSet()\n * var param_1 = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define smallest-infinite-set%\n (class object%\n (super-new)\n \n (init-field)\n \n ; pop-smallest : -> exact-integer?\n (define/public (pop-smallest)\n\n )\n ; add-back : exact-integer? -> void?\n (define/public (add-back num)\n\n )))\n\n;; Your smallest-infinite-set% object will be instantiated and called as such:\n;; (define obj (new smallest-infinite-set%))\n;; (define param_1 (send obj pop-smallest))\n;; (send obj add-back num)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec smallest_infinite_set_init_() -> any().\nsmallest_infinite_set_init_() ->\n .\n\n-spec smallest_infinite_set_pop_smallest() -> integer().\nsmallest_infinite_set_pop_smallest() ->\n .\n\n-spec smallest_infinite_set_add_back(Num :: integer()) -> any().\nsmallest_infinite_set_add_back(Num) ->\n .\n\n\n%% Your functions will be called as such:\n%% smallest_infinite_set_init_(),\n%% Param_1 = smallest_infinite_set_pop_smallest(),\n%% smallest_infinite_set_add_back(Num),\n\n%% smallest_infinite_set_init_ will be called before every test case, in which you can do some necessary initializations.", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule SmallestInfiniteSet do\n @spec init_() :: any\n def init_() do\n\n end\n\n @spec pop_smallest() :: integer\n def pop_smallest() do\n\n end\n\n @spec add_back(num :: integer) :: any\n def add_back(num) do\n\n end\nend\n\n# Your functions will be called as such:\n# SmallestInfiniteSet.init_()\n# param_1 = SmallestInfiniteSet.pop_smallest()\n# SmallestInfiniteSet.add_back(num)\n\n# SmallestInfiniteSet.init_ will be called before every test case, in which you can do some necessary initializations.", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class SmallestInfiniteSet {\n\n SmallestInfiniteSet() {\n\n }\n \n int popSmallest() {\n\n }\n \n void addBack(int num) {\n\n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * SmallestInfiniteSet obj = SmallestInfiniteSet();\n * int param1 = obj.popSmallest();\n * obj.addBack(num);\n */", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 6758, \"totalSubmissionRaw\": 9743, \"acRate\": \"69.4%\"}", + "hints": [ + "Based on the constraints, what is the maximum element that can possibly be popped?", + "Maintain whether elements are in or not in the set. How many elements do we consider?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"SmallestInfiniteSet\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\"]\n[[],[2],[],[],[],[1],[],[],[]]", + "metaData": "{\n \"classname\": \"SmallestInfiniteSet\",\n \"constructor\": {\n \"params\": []\n },\n \"methods\": [\n {\n \"params\": [],\n \"name\": \"popSmallest\",\n \"return\": {\n \"type\": \"integer\"\n }\n },\n {\n \"params\": [\n {\n \"type\": \"integer\",\n \"name\": \"num\"\n }\n ],\n \"name\": \"addBack\",\n \"return\": {\n \"type\": \"void\"\n }\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n },\n \"systemdesign\": true\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[\"SmallestInfiniteSet\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\"]\n[[],[2],[],[],[],[1],[],[],[]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/spiral-matrix-iv.json b/leetcode-cn/originData/spiral-matrix-iv.json new file mode 100644 index 00000000..82f2ebc9 --- /dev/null +++ b/leetcode-cn/originData/spiral-matrix-iv.json @@ -0,0 +1,190 @@ +{ + "data": { + "question": { + "questionId": "2411", + "questionFrontendId": "2326", + "categoryTitle": "Algorithms", + "boundTopicId": 1632820, + "title": "Spiral Matrix IV", + "titleSlug": "spiral-matrix-iv", + "content": "

You are given two integers m and n, which represent the dimensions of a matrix.

\n\n

You are also given the head of a linked list of integers.

\n\n

Generate an m x n matrix that contains the integers in the linked list presented in spiral order (clockwise), starting from the top-left of the matrix. If there are remaining empty spaces, fill them with -1.

\n\n

Return the generated matrix.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: m = 3, n = 5, head = [3,0,2,6,8,1,7,9,4,2,5,5,0]\nOutput: [[3,0,2,6,8],[5,0,-1,-1,1],[5,2,4,9,7]]\nExplanation: The diagram above shows how the values are printed in the matrix.\nNote that the remaining spaces in the matrix are filled with -1.\n
\n\n

Example 2:

\n\"\"\n
\nInput: m = 1, n = 4, head = [0,1,2]\nOutput: [[0,1,2,-1]]\nExplanation: The diagram above shows how the values are printed from left to right in the matrix.\nThe last space in the matrix is set to -1.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= m, n <= 105
  • \n\t
  • 1 <= m * n <= 105
  • \n\t
  • The number of nodes in the list is in the range [1, m * n].
  • \n\t
  • 0 <= Node.val <= 1000
  • \n
\n", + "translatedTitle": "螺旋矩阵 IV", + "translatedContent": "

给你两个整数:mn ,表示矩阵的维数。

\n\n

另给你一个整数链表的头节点 head

\n\n

请你生成一个大小为 m x n 的螺旋矩阵,矩阵包含链表中的所有整数。链表中的整数从矩阵 左上角 开始、顺时针 螺旋 顺序填充。如果还存在剩余的空格,则用 -1 填充。

\n\n

返回生成的矩阵。

\n\n

 

\n\n

示例 1:

\n\"\"\n
输入:m = 3, n = 5, head = [3,0,2,6,8,1,7,9,4,2,5,5,0]\n输出:[[3,0,2,6,8],[5,0,-1,-1,1],[5,2,4,9,7]]\n解释:上图展示了链表中的整数在矩阵中是如何排布的。\n注意,矩阵中剩下的空格用 -1 填充。\n
\n\n

示例 2:

\n\"\"\n
输入:m = 1, n = 4, head = [0,1,2]\n输出:[[0,1,2,-1]]\n解释:上图展示了链表中的整数在矩阵中是如何从左到右排布的。 \n注意,矩阵中剩下的空格用 -1 填充。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= m, n <= 105
  • \n\t
  • 1 <= m * n <= 105
  • \n\t
  • 链表中节点数目在范围 [1, m * n]
  • \n\t
  • 0 <= Node.val <= 1000
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 11, + "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, \"dart\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Linked List", + "slug": "linked-list", + "translatedName": "链表", + "__typename": "TopicTagNode" + }, + { + "name": "Matrix", + "slug": "matrix", + "translatedName": "矩阵", + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": "模拟", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "/**\n * Definition for singly-linked list.\n * struct ListNode {\n * int val;\n * ListNode *next;\n * ListNode() : val(0), next(nullptr) {}\n * ListNode(int x) : val(x), next(nullptr) {}\n * ListNode(int x, ListNode *next) : val(x), next(next) {}\n * };\n */\nclass Solution {\npublic:\n vector> spiralMatrix(int m, int n, ListNode* head) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * int val;\n * ListNode next;\n * ListNode() {}\n * ListNode(int val) { this.val = val; }\n * ListNode(int val, ListNode next) { this.val = val; this.next = next; }\n * }\n */\nclass Solution {\n public int[][] spiralMatrix(int m, int n, ListNode head) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "# Definition for singly-linked list.\n# class ListNode(object):\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution(object):\n def spiralMatrix(self, m, n, head):\n \"\"\"\n :type m: int\n :type n: int\n :type head: Optional[ListNode]\n :rtype: List[List[int]]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def spiralMatrix(self, m: int, n: int, head: Optional[ListNode]) -> List[List[int]]:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Definition for singly-linked list.\n * struct ListNode {\n * int val;\n * struct ListNode *next;\n * };\n */\n\n\n/**\n * Return an array of arrays of size *returnSize.\n * The sizes of the arrays are returned as *returnColumnSizes array.\n * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().\n */\nint** spiralMatrix(int m, int n, struct ListNode* head, int* returnSize, int** returnColumnSizes){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * public int val;\n * public ListNode next;\n * public ListNode(int val=0, ListNode next=null) {\n * this.val = val;\n * this.next = next;\n * }\n * }\n */\npublic class Solution {\n public int[][] SpiralMatrix(int m, int n, ListNode head) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * Definition for singly-linked list.\n * function ListNode(val, next) {\n * this.val = (val===undefined ? 0 : val)\n * this.next = (next===undefined ? null : next)\n * }\n */\n/**\n * @param {number} m\n * @param {number} n\n * @param {ListNode} head\n * @return {number[][]}\n */\nvar spiralMatrix = function(m, n, head) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# Definition for singly-linked list.\n# class ListNode\n# attr_accessor :val, :next\n# def initialize(val = 0, _next = nil)\n# @val = val\n# @next = _next\n# end\n# end\n# @param {Integer} m\n# @param {Integer} n\n# @param {ListNode} head\n# @return {Integer[][]}\ndef spiral_matrix(m, n, head)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * public var val: Int\n * public var next: ListNode?\n * public init() { self.val = 0; self.next = nil; }\n * public init(_ val: Int) { self.val = val; self.next = nil; }\n * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }\n * }\n */\nclass Solution {\n func spiralMatrix(_ m: Int, _ n: Int, _ head: ListNode?) -> [[Int]] {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "/**\n * Definition for singly-linked list.\n * type ListNode struct {\n * Val int\n * Next *ListNode\n * }\n */\nfunc spiralMatrix(m int, n int, head *ListNode) [][]int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode(_x: Int = 0, _next: ListNode = null) {\n * var next: ListNode = _next\n * var x: Int = _x\n * }\n */\nobject Solution {\n def spiralMatrix(m: Int, n: Int, head: ListNode): Array[Array[Int]] = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "/**\n * Example:\n * var li = ListNode(5)\n * var v = li.`val`\n * Definition for singly-linked list.\n * class ListNode(var `val`: Int) {\n * var next: ListNode? = null\n * }\n */\nclass Solution {\n fun spiralMatrix(m: Int, n: Int, head: ListNode?): Array {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "// Definition for singly-linked list.\n// #[derive(PartialEq, Eq, Clone, Debug)]\n// pub struct ListNode {\n// pub val: i32,\n// pub next: Option>\n// }\n//\n// impl ListNode {\n// #[inline]\n// fn new(val: i32) -> Self {\n// ListNode {\n// next: None,\n// val\n// }\n// }\n// }\nimpl Solution {\n pub fn spiral_matrix(m: i32, n: i32, head: Option>) -> Vec> {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "/**\n * Definition for a singly-linked list.\n * class ListNode {\n * public $val = 0;\n * public $next = null;\n * function __construct($val = 0, $next = null) {\n * $this->val = $val;\n * $this->next = $next;\n * }\n * }\n */\nclass Solution {\n\n /**\n * @param Integer $m\n * @param Integer $n\n * @param ListNode $head\n * @return Integer[][]\n */\n function spiralMatrix($m, $n, $head) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode {\n * val: number\n * next: ListNode | null\n * constructor(val?: number, next?: ListNode | null) {\n * this.val = (val===undefined ? 0 : val)\n * this.next = (next===undefined ? null : next)\n * }\n * }\n */\n\nfunction spiralMatrix(m: number, n: number, head: ListNode | null): number[][] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "; Definition for singly-linked list:\n#|\n\n; val : integer?\n; next : (or/c list-node? #f)\n(struct list-node\n (val next) #:mutable #:transparent)\n\n; constructor\n(define (make-list-node [val 0])\n (list-node val #f))\n\n|#\n\n(define/contract (spiral-matrix m n head)\n (-> exact-integer? exact-integer? (or/c list-node? #f) (listof (listof exact-integer?)))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "%% Definition for singly-linked list.\n%%\n%% -record(list_node, {val = 0 :: integer(),\n%% next = null :: 'null' | #list_node{}}).\n\n-spec spiral_matrix(M :: integer(), N :: integer(), Head :: #list_node{} | null) -> [[integer()]].\nspiral_matrix(M, N, Head) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "# Definition for singly-linked list.\n#\n# defmodule ListNode do\n# @type t :: %__MODULE__{\n# val: integer,\n# next: ListNode.t() | nil\n# }\n# defstruct val: 0, next: nil\n# end\n\ndefmodule Solution do\n @spec spiral_matrix(m :: integer, n :: integer, head :: ListNode.t | nil) :: [[integer]]\n def spiral_matrix(m, n, head) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode {\n * int val;\n * ListNode? next;\n * ListNode([this.val = 0, this.next]);\n * }\n */\nclass Solution {\n List> spiralMatrix(int m, int n, ListNode? head) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"11.1K\", \"totalAcceptedRaw\": 7454, \"totalSubmissionRaw\": 11129, \"acRate\": \"67.0%\"}", + "hints": [ + "First, generate an m x n matrix filled with -1s.", + "Navigate within the matrix at (i, j) with the help of a direction vector ⟨di, dj⟩. At (i, j), you need to decide if you can keep going in the current direction.", + "If you cannot keep going, rotate the direction vector clockwise by 90 degrees." + ], + "solution": null, + "status": null, + "sampleTestCase": "3\n5\n[3,0,2,6,8,1,7,9,4,2,5,5,0]", + "metaData": "{\n \"name\": \"spiralMatrix\",\n \"params\": [\n {\n \"name\": \"m\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"n\"\n },\n {\n \"type\": \"ListNode\",\n \"name\": \"head\"\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "3\n5\n[3,0,2,6,8,1,7,9,4,2,5,5,0]\n1\n4\n[0,1,2]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/subarray-with-elements-greater-than-varying-threshold.json b/leetcode-cn/originData/subarray-with-elements-greater-than-varying-threshold.json new file mode 100644 index 00000000..e9d78789 --- /dev/null +++ b/leetcode-cn/originData/subarray-with-elements-greater-than-varying-threshold.json @@ -0,0 +1,165 @@ +{ + "data": { + "question": { + "questionId": "2419", + "questionFrontendId": "2334", + "categoryTitle": "Algorithms", + "boundTopicId": 1654903, + "title": "Subarray With Elements Greater Than Varying Threshold", + "titleSlug": "subarray-with-elements-greater-than-varying-threshold", + "content": "

You are given an integer array nums and an integer threshold.

\n\n

Find any subarray of nums of length k such that every element in the subarray is greater than threshold / k.

\n\n

Return the size of any such subarray. If there is no such subarray, return -1.

\n\n

A subarray is a contiguous non-empty sequence of elements within an array.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,3,4,3,1], threshold = 6\nOutput: 3\nExplanation: The subarray [3,4,3] has a size of 3, and every element is greater than 6 / 3 = 2.\nNote that this is the only valid subarray.\n
\n\n

Example 2:

\n\n
\nInput: nums = [6,5,6,5,8], threshold = 7\nOutput: 1\nExplanation: The subarray [8] has a size of 1, and 8 > 7 / 1 = 7. So 1 is returned.\nNote that the subarray [6,5] has a size of 2, and every element is greater than 7 / 2 = 3.5. \nSimilarly, the subarrays [6,5,6], [6,5,6,5], [6,5,6,5,8] also satisfy the given conditions.\nTherefore, 2, 3, 4, or 5 may also be returned.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i], threshold <= 109
  • \n
\n", + "translatedTitle": "元素值大于变化阈值的子数组", + "translatedContent": "

给你一个整数数组 nums 和一个整数 threshold 。

\n\n

找到长度为 k 的 nums 子数组,满足数组中 每个 元素都 大于 threshold / k 。

\n\n

请你返回满足要求的 任意 子数组的 大小 。如果没有这样的子数组,返回 -1 。

\n\n

子数组 是数组中一段连续非空的元素序列。

\n\n

 

\n\n

示例 1:

\n\n
输入:nums = [1,3,4,3,1], threshold = 6\n输出:3\n解释:子数组 [3,4,3] 大小为 3 ,每个元素都大于 6 / 3 = 2 。\n注意这是唯一合法的子数组。\n
\n\n

示例 2:

\n\n
输入:nums = [6,5,6,5,8], threshold = 7\n输出:1\n解释:子数组 [8] 大小为 1 ,且 8 > 7 / 1 = 7 。所以返回 1 。\n注意子数组 [6,5] 大小为 2 ,每个元素都大于 7 / 2 = 3.5 。\n类似的,子数组 [6,5,6] ,[6,5,6,5] ,[6,5,6,5,8] 都是符合条件的子数组。\n所以返回 2, 3, 4 和 5 都可以。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i], threshold <= 109
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 11, + "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, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int validSubarraySize(vector& nums, int threshold) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int validSubarraySize(int[] nums, int threshold) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def validSubarraySize(self, nums, threshold):\n \"\"\"\n :type nums: List[int]\n :type threshold: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def validSubarraySize(self, nums: List[int], threshold: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint validSubarraySize(int* nums, int numsSize, int threshold){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int ValidSubarraySize(int[] nums, int threshold) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} threshold\n * @return {number}\n */\nvar validSubarraySize = function(nums, threshold) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} threshold\n# @return {Integer}\ndef valid_subarray_size(nums, threshold)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func validSubarraySize(_ nums: [Int], _ threshold: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func validSubarraySize(nums []int, threshold int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def validSubarraySize(nums: Array[Int], threshold: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun validSubarraySize(nums: IntArray, threshold: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn valid_subarray_size(nums: Vec, threshold: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $threshold\n * @return Integer\n */\n function validSubarraySize($nums, $threshold) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function validSubarraySize(nums: number[], threshold: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (valid-subarray-size nums threshold)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec valid_subarray_size(Nums :: [integer()], Threshold :: integer()) -> integer().\nvalid_subarray_size(Nums, Threshold) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec valid_subarray_size(nums :: [integer], threshold :: integer) :: integer\n def valid_subarray_size(nums, threshold) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int validSubarraySize(List nums, int threshold) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 1535, \"totalSubmissionRaw\": 3567, \"acRate\": \"43.0%\"}", + "hints": [ + "For all elements to be greater than the threshold/length, the minimum element in the subarray must be greater than the threshold/length.", + "For a given index, could you find the largest subarray such that the given index is the minimum element?", + "Could you use a monotonic stack to get the next and previous smallest element for every index?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,4,3,1]\n6", + "metaData": "{\n \"name\": \"validSubarraySize\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"threshold\"\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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,3,4,3,1]\n6\n[6,5,6,5,8]\n7", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/the-latest-time-to-catch-a-bus.json b/leetcode-cn/originData/the-latest-time-to-catch-a-bus.json new file mode 100644 index 00000000..dea6088f --- /dev/null +++ b/leetcode-cn/originData/the-latest-time-to-catch-a-bus.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2417", + "questionFrontendId": "2332", + "categoryTitle": "Algorithms", + "boundTopicId": 1654851, + "title": "The Latest Time to Catch a Bus", + "titleSlug": "the-latest-time-to-catch-a-bus", + "content": "

You are given a 0-indexed integer array buses of length n, where buses[i] represents the departure time of the ith bus. You are also given a 0-indexed integer array passengers of length m, where passengers[j] represents the arrival time of the jth passenger. All bus departure times are unique. All passenger arrival times are unique.

\n\n

You are given an integer capacity, which represents the maximum number of passengers that can get on each bus.

\n\n

The passengers will get on the next available bus. You can get on a bus that will depart at x minutes if you arrive at y minutes where y <= x, and the bus is not full. Passengers with the earliest arrival times get on the bus first.

\n\n

Return the latest time you may arrive at the bus station to catch a bus. You cannot arrive at the same time as another passenger.

\n\n

Note: The arrays buses and passengers are not necessarily sorted.

\n\n

 

\n

Example 1:

\n\n
\nInput: buses = [10,20], passengers = [2,17,18,19], capacity = 2\nOutput: 16\nExplanation: \nThe 1st bus departs with the 1st passenger. \nThe 2nd bus departs with you and the 2nd passenger.\nNote that you must not arrive at the same time as the passengers, which is why you must arrive before the 2nd passenger to catch the bus.
\n\n

Example 2:

\n\n
\nInput: buses = [20,30,10], passengers = [19,13,26,4,25,11,21], capacity = 2\nOutput: 20\nExplanation: \nThe 1st bus departs with the 4th passenger. \nThe 2nd bus departs with the 6th and 2nd passengers.\nThe 3rd bus departs with the 1st passenger and you.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == buses.length
  • \n\t
  • m == passengers.length
  • \n\t
  • 1 <= n, m, capacity <= 105
  • \n\t
  • 2 <= buses[i], passengers[i] <= 109
  • \n\t
  • Each element in buses is unique.
  • \n\t
  • Each element in passengers is unique.
  • \n
\n", + "translatedTitle": "坐上公交的最晚时间", + "translatedContent": "

给你一个下标从 0 开始长度为 n 的整数数组 buses ,其中 buses[i] 表示第 i 辆公交车的出发时间。同时给你一个下标从 0 开始长度为 m 的整数数组 passengers ,其中 passengers[j] 表示第 j 位乘客的到达时间。所有公交车出发的时间互不相同,所有乘客到达的时间也互不相同。

\n\n

给你一个整数 capacity ,表示每辆公交车 最多 能容纳的乘客数目。

\n\n

每位乘客都会搭乘下一辆有座位的公交车。如果你在 y 时刻到达,公交在 x 时刻出发,满足 y <= x  且公交没有满,那么你可以搭乘这一辆公交。最早 到达的乘客优先上车。

\n\n

返回你可以搭乘公交车的最晚到达公交站时间。你 不能 跟别的乘客同时刻到达。

\n\n

注意:数组 buses 和 passengers 不一定是有序的。

\n\n

 

\n\n

示例 1:

\n\n
输入:buses = [10,20], passengers = [2,17,18,19], capacity = 2\n输出:16\n解释:\n第 1 辆公交车载着第 1 位乘客。\n第 2 辆公交车载着你和第 2 位乘客。\n注意你不能跟其他乘客同一时间到达,所以你必须在第二位乘客之前到达。
\n\n

示例 2:

\n\n
输入:buses = [20,30,10], passengers = [19,13,26,4,25,11,21], capacity = 2\n输出:20\n解释:\n第 1 辆公交车载着第 4 位乘客。\n第 2 辆公交车载着第 6 位和第 2 位乘客。\n第 3 辆公交车载着第 1 位乘客和你。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == buses.length
  • \n\t
  • m == passengers.length
  • \n\t
  • 1 <= n, m, capacity <= 105
  • \n\t
  • 2 <= buses[i], passengers[i] <= 109
  • \n\t
  • buses 中的元素 互不相同 
  • \n\t
  • passengers 中的元素 互不相同 。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 14, + "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, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int latestTimeCatchTheBus(vector& buses, vector& passengers, int capacity) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int latestTimeCatchTheBus(int[] buses, int[] passengers, int capacity) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def latestTimeCatchTheBus(self, buses, passengers, capacity):\n \"\"\"\n :type buses: List[int]\n :type passengers: List[int]\n :type capacity: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def latestTimeCatchTheBus(self, buses: List[int], passengers: List[int], capacity: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint latestTimeCatchTheBus(int* buses, int busesSize, int* passengers, int passengersSize, int capacity){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int LatestTimeCatchTheBus(int[] buses, int[] passengers, int capacity) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} buses\n * @param {number[]} passengers\n * @param {number} capacity\n * @return {number}\n */\nvar latestTimeCatchTheBus = function(buses, passengers, capacity) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} buses\n# @param {Integer[]} passengers\n# @param {Integer} capacity\n# @return {Integer}\ndef latest_time_catch_the_bus(buses, passengers, capacity)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func latestTimeCatchTheBus(_ buses: [Int], _ passengers: [Int], _ capacity: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func latestTimeCatchTheBus(buses []int, passengers []int, capacity int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def latestTimeCatchTheBus(buses: Array[Int], passengers: Array[Int], capacity: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun latestTimeCatchTheBus(buses: IntArray, passengers: IntArray, capacity: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn latest_time_catch_the_bus(buses: Vec, passengers: Vec, capacity: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $buses\n * @param Integer[] $passengers\n * @param Integer $capacity\n * @return Integer\n */\n function latestTimeCatchTheBus($buses, $passengers, $capacity) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function latestTimeCatchTheBus(buses: number[], passengers: number[], capacity: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (latest-time-catch-the-bus buses passengers capacity)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec latest_time_catch_the_bus(Buses :: [integer()], Passengers :: [integer()], Capacity :: integer()) -> integer().\nlatest_time_catch_the_bus(Buses, Passengers, Capacity) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec latest_time_catch_the_bus(buses :: [integer], passengers :: [integer], capacity :: integer) :: integer\n def latest_time_catch_the_bus(buses, passengers, capacity) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int latestTimeCatchTheBus(List buses, List passengers, int capacity) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"13.4K\", \"totalAcceptedRaw\": 2890, \"totalSubmissionRaw\": 13429, \"acRate\": \"21.5%\"}", + "hints": [ + "Sort the buses and passengers arrays.", + "Use 2 pointers to traverse buses and passengers with a simulation of passengers getting on a particular bus." + ], + "solution": null, + "status": null, + "sampleTestCase": "[10,20]\n[2,17,18,19]\n2", + "metaData": "{\n \"name\": \"latestTimeCatchTheBus\",\n \"params\": [\n {\n \"name\": \"buses\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"passengers\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"capacity\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 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\"],\"dart\":[\"Dart\",\"

Dart 2.17.3<\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[10,20]\n[2,17,18,19]\n2\n[20,30,10]\n[19,13,26,4,25,11,21]\n2", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/元素值大于变化阈值的子数组 [subarray-with-elements-greater-than-varying-threshold].html b/leetcode-cn/problem (Chinese)/元素值大于变化阈值的子数组 [subarray-with-elements-greater-than-varying-threshold].html new file mode 100644 index 00000000..3e1a9bc4 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/元素值大于变化阈值的子数组 [subarray-with-elements-greater-than-varying-threshold].html @@ -0,0 +1,35 @@ +

给你一个整数数组 nums 和一个整数 threshold 。

+ +

找到长度为 k 的 nums 子数组,满足数组中 每个 元素都 大于 threshold / k 。

+ +

请你返回满足要求的 任意 子数组的 大小 。如果没有这样的子数组,返回 -1 。

+ +

子数组 是数组中一段连续非空的元素序列。

+ +

 

+ +

示例 1:

+ +
输入:nums = [1,3,4,3,1], threshold = 6
+输出:3
+解释:子数组 [3,4,3] 大小为 3 ,每个元素都大于 6 / 3 = 2 。
+注意这是唯一合法的子数组。
+
+ +

示例 2:

+ +
输入:nums = [6,5,6,5,8], threshold = 7
+输出:1
+解释:子数组 [8] 大小为 1 ,且 8 > 7 / 1 = 7 。所以返回 1 。
+注意子数组 [6,5] 大小为 2 ,每个元素都大于 7 / 2 = 3.5 。
+类似的,子数组 [6,5,6] ,[6,5,6,5] ,[6,5,6,5,8] 都是符合条件的子数组。
+所以返回 2, 3, 4 和 5 都可以。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i], threshold <= 109
  • +
diff --git a/leetcode-cn/problem (Chinese)/坐上公交的最晚时间 [the-latest-time-to-catch-a-bus].html b/leetcode-cn/problem (Chinese)/坐上公交的最晚时间 [the-latest-time-to-catch-a-bus].html new file mode 100644 index 00000000..2096378c --- /dev/null +++ b/leetcode-cn/problem (Chinese)/坐上公交的最晚时间 [the-latest-time-to-catch-a-bus].html @@ -0,0 +1,43 @@ +

给你一个下标从 0 开始长度为 n 的整数数组 buses ,其中 buses[i] 表示第 i 辆公交车的出发时间。同时给你一个下标从 0 开始长度为 m 的整数数组 passengers ,其中 passengers[j] 表示第 j 位乘客的到达时间。所有公交车出发的时间互不相同,所有乘客到达的时间也互不相同。

+ +

给你一个整数 capacity ,表示每辆公交车 最多 能容纳的乘客数目。

+ +

每位乘客都会搭乘下一辆有座位的公交车。如果你在 y 时刻到达,公交在 x 时刻出发,满足 y <= x  且公交没有满,那么你可以搭乘这一辆公交。最早 到达的乘客优先上车。

+ +

返回你可以搭乘公交车的最晚到达公交站时间。你 不能 跟别的乘客同时刻到达。

+ +

注意:数组 buses 和 passengers 不一定是有序的。

+ +

 

+ +

示例 1:

+ +
输入:buses = [10,20], passengers = [2,17,18,19], capacity = 2
+输出:16
+解释:
+第 1 辆公交车载着第 1 位乘客。
+第 2 辆公交车载着你和第 2 位乘客。
+注意你不能跟其他乘客同一时间到达,所以你必须在第二位乘客之前到达。
+ +

示例 2:

+ +
输入:buses = [20,30,10], passengers = [19,13,26,4,25,11,21], capacity = 2
+输出:20
+解释:
+第 1 辆公交车载着第 4 位乘客。
+第 2 辆公交车载着第 6 位和第 2 位乘客。
+第 3 辆公交车载着第 1 位乘客和你。
+
+ +

 

+ +

提示:

+ +
    +
  • n == buses.length
  • +
  • m == passengers.length
  • +
  • 1 <= n, m, capacity <= 105
  • +
  • 2 <= buses[i], passengers[i] <= 109
  • +
  • buses 中的元素 互不相同 
  • +
  • passengers 中的元素 互不相同 。
  • +
diff --git a/leetcode-cn/problem (Chinese)/数组拆分 [array-partition].html b/leetcode-cn/problem (Chinese)/数组拆分 [array-partition].html new file mode 100644 index 00000000..e7552341 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/数组拆分 [array-partition].html @@ -0,0 +1,34 @@ +

给定长度为 2n 的整数数组 nums ,你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ,使得从 1 到 nmin(ai, bi) 总和最大。

+ +

返回该 最大总和

+ +

 

+ +

示例 1:

+ +
+输入:nums = [1,4,3,2]
+输出:4
+解释:所有可能的分法(忽略元素顺序)为:
+1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3
+2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3
+3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4
+所以最大总和为 4
+ +

示例 2:

+ +
+输入:nums = [6,2,6,5,1,2]
+输出:9
+解释:最优的分法为 (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 104
  • +
  • nums.length == 2 * n
  • +
  • -104 <= nums[i] <= 104
  • +
diff --git a/leetcode-cn/problem (Chinese)/无限集中的最小数字 [smallest-number-in-infinite-set].html b/leetcode-cn/problem (Chinese)/无限集中的最小数字 [smallest-number-in-infinite-set].html new file mode 100644 index 00000000..dedf2497 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/无限集中的最小数字 [smallest-number-in-infinite-set].html @@ -0,0 +1,40 @@ +

现有一个包含所有正整数的集合 [1, 2, 3, 4, 5, ...]

+ +

实现 SmallestInfiniteSet 类:

+ +
    +
  • SmallestInfiniteSet() 初始化 SmallestInfiniteSet 对象以包含 所有 正整数。
  • +
  • int popSmallest() 移除 并返回该无限集中的最小整数。
  • +
  • void addBack(int num) 如果正整数 num 存在于无限集中,则将一个 num 添加 到该无限集中。
  • +
+ +

 

+ +

示例:

+ +
输入
+["SmallestInfiniteSet", "addBack", "popSmallest", "popSmallest", "popSmallest", "addBack", "popSmallest", "popSmallest", "popSmallest"]
+[[], [2], [], [], [], [1], [], [], []]
+输出
+[null, null, 1, 2, 3, null, 1, 4, 5]
+
+解释
+SmallestInfiniteSet smallestInfiniteSet = new SmallestInfiniteSet();
+smallestInfiniteSet.addBack(2);    // 2 已经在集合中,所以不做任何变更。
+smallestInfiniteSet.popSmallest(); // 返回 1 ,因为 1 是最小的整数,并将其从集合中移除。
+smallestInfiniteSet.popSmallest(); // 返回 2 ,并将其从集合中移除。
+smallestInfiniteSet.popSmallest(); // 返回 3 ,并将其从集合中移除。
+smallestInfiniteSet.addBack(1);    // 将 1 添加到该集合中。
+smallestInfiniteSet.popSmallest(); // 返回 1 ,因为 1 在上一步中被添加到集合中,
+                                   // 且 1 是最小的整数,并将其从集合中移除。
+smallestInfiniteSet.popSmallest(); // 返回 4 ,并将其从集合中移除。
+smallestInfiniteSet.popSmallest(); // 返回 5 ,并将其从集合中移除。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= num <= 1000
  • +
  • 最多调用 popSmallestaddBack 方法 共计 1000
  • +
diff --git a/leetcode-cn/problem (Chinese)/最小差值平方和 [minimum-sum-of-squared-difference].html b/leetcode-cn/problem (Chinese)/最小差值平方和 [minimum-sum-of-squared-difference].html new file mode 100644 index 00000000..0ecd40a4 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/最小差值平方和 [minimum-sum-of-squared-difference].html @@ -0,0 +1,41 @@ +

给你两个下标从 0 开始的整数数组 nums1 和 nums2 ,长度为 n 。

+ +

数组 nums1 和 nums2 的 差值平方和 定义为所有满足 0 <= i < n 的 (nums1[i] - nums2[i])2 之和。

+ +

同时给你两个正整数 k1 和 k2 。你可以将 nums1 中的任意元素 +1 或者 -1 至多 k1 次。类似的,你可以将 nums2 中的任意元素 +1 或者 -1 至多 k2 次。

+ +

请你返回修改数组 nums1 至多 k1 次且修改数组 nums2 至多 k2 次后的最小 差值平方和 。

+ +

注意:你可以将数组中的元素变成  整数。

+ +

 

+ +

示例 1:

+ +
输入:nums1 = [1,2,3,4], nums2 = [2,10,20,19], k1 = 0, k2 = 0
+输出:579
+解释:nums1 和 nums2 中的元素不能修改,因为 k1 = 0 和 k2 = 0 。
+差值平方和为:(1 - 2)2 + (2 - 10)2 + (3 - 20)2 + (4 - 19)2 = 579 。
+
+ +

示例 2:

+ +
输入:nums1 = [1,4,10,12], nums2 = [5,8,6,9], k1 = 1, k2 = 1
+输出:43
+解释:一种得到最小差值平方和的方式为:
+- 将 nums1[0] 增加一次。
+- 将 nums2[2] 增加一次。
+最小差值平方和为:
+(2 - 5)2 + (4 - 8)2 + (10 - 7)2 + (12 - 9)2 = 43 。
+注意,也有其他方式可以得到最小差值平方和,但没有得到比 43 更小答案的方案。
+ +

 

+ +

提示:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 1 <= n <= 105
  • +
  • 0 <= nums1[i], nums2[i] <= 105
  • +
  • 0 <= k1, k2 <= 109
  • +
diff --git a/leetcode-cn/problem (Chinese)/知道秘密的人数 [number-of-people-aware-of-a-secret].html b/leetcode-cn/problem (Chinese)/知道秘密的人数 [number-of-people-aware-of-a-secret].html new file mode 100644 index 00000000..d1e4d67a --- /dev/null +++ b/leetcode-cn/problem (Chinese)/知道秘密的人数 [number-of-people-aware-of-a-secret].html @@ -0,0 +1,40 @@ +

在第 1 天,有一个人发现了一个秘密。

+ +

给你一个整数 delay ,表示每个人会在发现秘密后的 delay 天之后,每天 给一个新的人 分享 秘密。同时给你一个整数 forget ,表示每个人在发现秘密 forget 天之后会 忘记 这个秘密。一个人 不能 在忘记秘密那一天及之后的日子里分享秘密。

+ +

给你一个整数 n ,请你返回在第 n 天结束时,知道秘密的人数。由于答案可能会很大,请你将结果对 109 + 7 取余 后返回。

+ +

 

+ +

示例 1:

+ +
输入:n = 6, delay = 2, forget = 4
+输出:5
+解释:
+第 1 天:假设第一个人叫 A 。(一个人知道秘密)
+第 2 天:A 是唯一一个知道秘密的人。(一个人知道秘密)
+第 3 天:A 把秘密分享给 B 。(两个人知道秘密)
+第 4 天:A 把秘密分享给一个新的人 C 。(三个人知道秘密)
+第 5 天:A 忘记了秘密,B 把秘密分享给一个新的人 D 。(三个人知道秘密)
+第 6 天:B 把秘密分享给 E,C 把秘密分享给 F 。(五个人知道秘密)
+
+ +

示例 2:

+ +
输入:n = 4, delay = 1, forget = 3
+输出:6
+解释:
+第 1 天:第一个知道秘密的人为 A 。(一个人知道秘密)
+第 2 天:A 把秘密分享给 B 。(两个人知道秘密)
+第 3 天:A 和 B 把秘密分享给 2 个新的人 C 和 D 。(四个人知道秘密)
+第 4 天:A 忘记了秘密,B、C、D 分别分享给 3 个新的人。(六个人知道秘密)
+
+ +

 

+ +

提示:

+ +
    +
  • 2 <= n <= 1000
  • +
  • 1 <= delay < forget <= n
  • +
diff --git a/leetcode-cn/problem (Chinese)/移动片段得到字符串 [move-pieces-to-obtain-a-string].html b/leetcode-cn/problem (Chinese)/移动片段得到字符串 [move-pieces-to-obtain-a-string].html new file mode 100644 index 00000000..c39c4e51 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/移动片段得到字符串 [move-pieces-to-obtain-a-string].html @@ -0,0 +1,45 @@ +

给你两个字符串 starttarget ,长度均为 n 。每个字符串 由字符 'L''R''_' 组成,其中:

+ +
    +
  • 字符 'L''R' 表示片段,其中片段 'L' 只有在其左侧直接存在一个 空位 时才能向 移动,而片段 'R' 只有在其右侧直接存在一个 空位 时才能向 移动。
  • +
  • 字符 '_' 表示可以被 任意 'L''R' 片段占据的空位。
  • +
+ +

如果在移动字符串 start 中的片段任意次之后可以得到字符串 target ,返回 true ;否则,返回 false

+ +

 

+ +

示例 1:

+ +
输入:start = "_L__R__R_", target = "L______RR"
+输出:true
+解释:可以从字符串 start 获得 target ,需要进行下面的移动:
+- 将第一个片段向左移动一步,字符串现在变为 "L___R__R_" 。
+- 将最后一个片段向右移动一步,字符串现在变为 "L___R___R" 。
+- 将第二个片段向右移动散步,字符串现在变为 "L______RR" 。
+可以从字符串 start 得到 target ,所以返回 true 。
+
+ +

示例 2:

+ +
输入:start = "R_L_", target = "__LR"
+输出:false
+解释:字符串 start 中的 'R' 片段可以向右移动一步得到 "_RL_" 。
+但是,在这一步之后,不存在可以移动的片段,所以无法从字符串 start 得到 target 。
+
+ +

示例 3:

+ +
输入:start = "_R", target = "R_"
+输出:false
+解释:字符串 start 中的片段只能向右移动,所以无法从字符串 start 得到 target 。
+ +

 

+ +

提示:

+ +
    +
  • n == start.length == target.length
  • +
  • 1 <= n <= 105
  • +
  • starttarget 由字符 'L''R''_' 组成
  • +
diff --git a/leetcode-cn/problem (Chinese)/统计理想数组的数目 [count-the-number-of-ideal-arrays].html b/leetcode-cn/problem (Chinese)/统计理想数组的数目 [count-the-number-of-ideal-arrays].html new file mode 100644 index 00000000..e908e104 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/统计理想数组的数目 [count-the-number-of-ideal-arrays].html @@ -0,0 +1,48 @@ +

给你两个整数 nmaxValue ,用于描述一个 理想数组

+ +

对于下标从 0 开始、长度为 n 的整数数组 arr ,如果满足以下条件,则认为该数组是一个 理想数组

+ +
    +
  • 每个 arr[i] 都是从 1maxValue 范围内的一个值,其中 0 <= i < n
  • +
  • 每个 arr[i] 都可以被 arr[i - 1] 整除,其中 0 < i < n
  • +
+ +

返回长度为 n不同 理想数组的数目。由于答案可能很大,返回对 109 + 7 取余的结果。

+ +

 

+ +

示例 1:

+ +
输入:n = 2, maxValue = 5
+输出:10
+解释:存在以下理想数组:
+- 以 1 开头的数组(5 个):[1,1]、[1,2]、[1,3]、[1,4]、[1,5]
+- 以 2 开头的数组(2 个):[2,2]、[2,4]
+- 以 3 开头的数组(1 个):[3,3]
+- 以 4 开头的数组(1 个):[4,4]
+- 以 5 开头的数组(1 个):[5,5]
+共计 5 + 2 + 1 + 1 + 1 = 10 个不同理想数组。
+
+ +

示例 2:

+ +
输入:n = 5, maxValue = 3
+输出:11
+解释:存在以下理想数组:
+- 以 1 开头的数组(9 个):
+   - 不含其他不同值(1 个):[1,1,1,1,1] 
+   - 含一个不同值 2(4 个):[1,1,1,1,2], [1,1,1,2,2], [1,1,2,2,2], [1,2,2,2,2]
+   - 含一个不同值 3(4 个):[1,1,1,1,3], [1,1,1,3,3], [1,1,3,3,3], [1,3,3,3,3]
+- 以 2 开头的数组(1 个):[2,2,2,2,2]
+- 以 3 开头的数组(1 个):[3,3,3,3,3]
+共计 9 + 1 + 1 = 11 个不同理想数组。
+
+ +

 

+ +

提示:

+ +
    +
  • 2 <= n <= 104
  • +
  • 1 <= maxValue <= 104
  • +
diff --git a/leetcode-cn/problem (Chinese)/网格图中递增路径的数目 [number-of-increasing-paths-in-a-grid].html b/leetcode-cn/problem (Chinese)/网格图中递增路径的数目 [number-of-increasing-paths-in-a-grid].html new file mode 100644 index 00000000..35d68458 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/网格图中递增路径的数目 [number-of-increasing-paths-in-a-grid].html @@ -0,0 +1,42 @@ +

给你一个 m x n 的整数网格图 grid ,你可以从一个格子移动到 4 个方向相邻的任意一个格子。

+ +

请你返回在网格图中从 任意 格子出发,达到 任意 格子,且路径中的数字是 严格递增 的路径数目。由于答案可能会很大,请将结果对 109 + 7 取余 后返回。

+ +

如果两条路径中访问过的格子不是完全相同的,那么它们视为两条不同的路径。

+ +

 

+ +

示例 1:

+ +

+ +
输入:grid = [[1,1],[3,4]]
+输出:8
+解释:严格递增路径包括:
+- 长度为 1 的路径:[1],[1],[3],[4] 。
+- 长度为 2 的路径:[1 -> 3],[1 -> 4],[3 -> 4] 。
+- 长度为 3 的路径:[1 -> 3 -> 4] 。
+路径数目为 4 + 3 + 1 = 8 。
+
+ +

示例 2:

+ +
输入:grid = [[1],[2]]
+输出:3
+解释:严格递增路径包括:
+- 长度为 1 的路径:[1],[2] 。
+- 长度为 2 的路径:[1 -> 2] 。
+路径数目为 2 + 1 = 3 。
+
+ +

 

+ +

提示:

+ +
    +
  • m == grid.length
  • +
  • n == grid[i].length
  • +
  • 1 <= m, n <= 1000
  • +
  • 1 <= m * n <= 105
  • +
  • 1 <= grid[i][j] <= 105
  • +
diff --git a/leetcode-cn/problem (Chinese)/螺旋矩阵 IV [spiral-matrix-iv].html b/leetcode-cn/problem (Chinese)/螺旋矩阵 IV [spiral-matrix-iv].html new file mode 100644 index 00000000..9e0465cb --- /dev/null +++ b/leetcode-cn/problem (Chinese)/螺旋矩阵 IV [spiral-matrix-iv].html @@ -0,0 +1,35 @@ +

给你两个整数:mn ,表示矩阵的维数。

+ +

另给你一个整数链表的头节点 head

+ +

请你生成一个大小为 m x n 的螺旋矩阵,矩阵包含链表中的所有整数。链表中的整数从矩阵 左上角 开始、顺时针 螺旋 顺序填充。如果还存在剩余的空格,则用 -1 填充。

+ +

返回生成的矩阵。

+ +

 

+ +

示例 1:

+ +
输入:m = 3, n = 5, head = [3,0,2,6,8,1,7,9,4,2,5,5,0]
+输出:[[3,0,2,6,8],[5,0,-1,-1,1],[5,2,4,9,7]]
+解释:上图展示了链表中的整数在矩阵中是如何排布的。
+注意,矩阵中剩下的空格用 -1 填充。
+
+ +

示例 2:

+ +
输入:m = 1, n = 4, head = [0,1,2]
+输出:[[0,1,2,-1]]
+解释:上图展示了链表中的整数在矩阵中是如何从左到右排布的。 
+注意,矩阵中剩下的空格用 -1 填充。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= m, n <= 105
  • +
  • 1 <= m * n <= 105
  • +
  • 链表中节点数目在范围 [1, m * n]
  • +
  • 0 <= Node.val <= 1000
  • +
diff --git a/leetcode-cn/problem (Chinese)/装满杯子需要的最短总时长 [minimum-amount-of-time-to-fill-cups].html b/leetcode-cn/problem (Chinese)/装满杯子需要的最短总时长 [minimum-amount-of-time-to-fill-cups].html new file mode 100644 index 00000000..3a53f392 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/装满杯子需要的最短总时长 [minimum-amount-of-time-to-fill-cups].html @@ -0,0 +1,47 @@ +

现有一台饮水机,可以制备冷水、温水和热水。每秒钟,可以装满 2不同 类型的水或者 1 杯任意类型的水。

+ +

给你一个下标从 0 开始、长度为 3 的整数数组 amount ,其中 amount[0]amount[1]amount[2] 分别表示需要装满冷水、温水和热水的杯子数量。返回装满所有杯子所需的 最少 秒数。

+ +

 

+ +

示例 1:

+ +
输入:amount = [1,4,2]
+输出:4
+解释:下面给出一种方案:
+第 1 秒:装满一杯冷水和一杯温水。
+第 2 秒:装满一杯温水和一杯热水。
+第 3 秒:装满一杯温水和一杯热水。
+第 4 秒:装满一杯温水。
+可以证明最少需要 4 秒才能装满所有杯子。
+
+ +

示例 2:

+ +
输入:amount = [5,4,4]
+输出:7
+解释:下面给出一种方案:
+第 1 秒:装满一杯冷水和一杯热水。
+第 2 秒:装满一杯冷水和一杯温水。
+第 3 秒:装满一杯冷水和一杯温水。
+第 4 秒:装满一杯温水和一杯热水。
+第 5 秒:装满一杯冷水和一杯热水。
+第 6 秒:装满一杯冷水和一杯温水。
+第 7 秒:装满一杯热水。
+
+ +

示例 3:

+ +
输入:amount = [5,0,0]
+输出:5
+解释:每秒装满一杯冷水。
+
+ +

 

+ +

提示:

+ +
    +
  • amount.length == 3
  • +
  • 0 <= amount[i] <= 100
  • +
diff --git a/leetcode-cn/problem (Chinese)/解密消息 [decode-the-message].html b/leetcode-cn/problem (Chinese)/解密消息 [decode-the-message].html new file mode 100644 index 00000000..5cd4b094 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/解密消息 [decode-the-message].html @@ -0,0 +1,50 @@ +

给你字符串 keymessage ,分别表示一个加密密钥和一段加密消息。解密 message 的步骤如下:

+ +
    +
  1. 使用 key 中 26 个英文小写字母第一次出现的顺序作为替换表中的字母 顺序
  2. +
  3. 将替换表与普通英文字母表对齐,形成对照表。
  4. +
  5. 按照对照表 替换 message 中的每个字母。
  6. +
  7. 空格 ' ' 保持不变。
  8. +
+ +
    +
  • 例如,key = "happy boy"(实际的加密密钥会包含字母表中每个字母 至少一次),据此,可以得到部分对照表('h' -> 'a''a' -> 'b''p' -> 'c''y' -> 'd''b' -> 'e''o' -> 'f')。
  • +
+ +

返回解密后的消息。

+ +

 

+ +

示例 1:

+ +

+ +
+输入:key = "the quick brown fox jumps over the lazy dog", message = "vkbs bs t suepuv"
+输出:"this is a secret"
+解释:对照表如上图所示。
+提取 "the quick brown fox jumps over the lazy dog" 中每个字母的首次出现可以得到替换表。
+
+ +

示例 2:

+ +

+ +
+输入:key = "eljuxhpwnyrdgtqkviszcfmabo", message = "zwx hnfx lqantp mnoeius ycgk vcnjrdb"
+输出:"the five boxing wizards jump quickly"
+解释:对照表如上图所示。
+提取 "eljuxhpwnyrdgtqkviszcfmabo" 中每个字母的首次出现可以得到替换表。
+
+ +

 

+ +

提示:

+ +
    +
  • 26 <= key.length <= 2000
  • +
  • key 由小写英文字母及 ' ' 组成
  • +
  • key 包含英文字母表中每个字符('a''z'至少一次
  • +
  • 1 <= message.length <= 2000
  • +
  • message 由小写英文字母和 ' ' 组成
  • +
diff --git a/leetcode-cn/problem (Chinese)/计算布尔二叉树的值 [evaluate-boolean-binary-tree].html b/leetcode-cn/problem (Chinese)/计算布尔二叉树的值 [evaluate-boolean-binary-tree].html new file mode 100644 index 00000000..076c7971 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/计算布尔二叉树的值 [evaluate-boolean-binary-tree].html @@ -0,0 +1,51 @@ +

给你一棵 完整二叉树 的根,这棵树有以下特征:

+ +
    +
  • 叶子节点 要么值为 0 要么值为 1 ,其中 0 表示 False ,1 表示 True 。
  • +
  • 非叶子节点 要么值为 2 要么值为 3 ,其中 2 表示逻辑或 OR3 表示逻辑与 AND 。
  • +
+ +

计算 一个节点的值方式如下:

+ +
    +
  • 如果节点是个叶子节点,那么节点的  为它本身,即 True 或者 False 。
  • +
  • 否则,计算 两个孩子的节点值,然后将该节点的运算符对两个孩子值进行 运算 。
  • +
+ +

返回根节点 root 的布尔运算值。

+ +

完整二叉树 是每个节点有 0 个或者 2 个孩子的二叉树。

+ +

叶子节点 是没有孩子的节点。

+ +

 

+ +

示例 1:

+ +

+ +
输入:root = [2,1,3,null,null,0,1]
+输出:true
+解释:上图展示了计算过程。
+AND 与运算节点的值为 False AND True = False 。
+OR 运算节点的值为 True OR False = True 。
+根节点的值为 True ,所以我们返回 true 。
+ +

示例 2:

+ +
输入:root = [0]
+输出:false
+解释:根节点是叶子节点,且值为 false,所以我们返回 false 。
+
+ +

 

+ +

提示:

+ +
    +
  • 树中节点数目在 [1, 1000] 之间。
  • +
  • 0 <= Node.val <= 3
  • +
  • 每个节点的孩子数为 0 或 2 。
  • +
  • 叶子节点的值为 0 或 1 。
  • +
  • 非叶子节点的值为 2 或 3
  • +
diff --git a/leetcode-cn/problem (English)/元素值大于变化阈值的子数组(English) [subarray-with-elements-greater-than-varying-threshold].html b/leetcode-cn/problem (English)/元素值大于变化阈值的子数组(English) [subarray-with-elements-greater-than-varying-threshold].html new file mode 100644 index 00000000..740b0b4c --- /dev/null +++ b/leetcode-cn/problem (English)/元素值大于变化阈值的子数组(English) [subarray-with-elements-greater-than-varying-threshold].html @@ -0,0 +1,35 @@ +

You are given an integer array nums and an integer threshold.

+ +

Find any subarray of nums of length k such that every element in the subarray is greater than threshold / k.

+ +

Return the size of any such subarray. If there is no such subarray, return -1.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,4,3,1], threshold = 6
+Output: 3
+Explanation: The subarray [3,4,3] has a size of 3, and every element is greater than 6 / 3 = 2.
+Note that this is the only valid subarray.
+
+ +

Example 2:

+ +
+Input: nums = [6,5,6,5,8], threshold = 7
+Output: 1
+Explanation: The subarray [8] has a size of 1, and 8 > 7 / 1 = 7. So 1 is returned.
+Note that the subarray [6,5] has a size of 2, and every element is greater than 7 / 2 = 3.5. 
+Similarly, the subarrays [6,5,6], [6,5,6,5], [6,5,6,5,8] also satisfy the given conditions.
+Therefore, 2, 3, 4, or 5 may also be returned.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i], threshold <= 109
  • +
diff --git a/leetcode-cn/problem (English)/坐上公交的最晚时间(English) [the-latest-time-to-catch-a-bus].html b/leetcode-cn/problem (English)/坐上公交的最晚时间(English) [the-latest-time-to-catch-a-bus].html new file mode 100644 index 00000000..2c48a021 --- /dev/null +++ b/leetcode-cn/problem (English)/坐上公交的最晚时间(English) [the-latest-time-to-catch-a-bus].html @@ -0,0 +1,43 @@ +

You are given a 0-indexed integer array buses of length n, where buses[i] represents the departure time of the ith bus. You are also given a 0-indexed integer array passengers of length m, where passengers[j] represents the arrival time of the jth passenger. All bus departure times are unique. All passenger arrival times are unique.

+ +

You are given an integer capacity, which represents the maximum number of passengers that can get on each bus.

+ +

The passengers will get on the next available bus. You can get on a bus that will depart at x minutes if you arrive at y minutes where y <= x, and the bus is not full. Passengers with the earliest arrival times get on the bus first.

+ +

Return the latest time you may arrive at the bus station to catch a bus. You cannot arrive at the same time as another passenger.

+ +

Note: The arrays buses and passengers are not necessarily sorted.

+ +

 

+

Example 1:

+ +
+Input: buses = [10,20], passengers = [2,17,18,19], capacity = 2
+Output: 16
+Explanation: 
+The 1st bus departs with the 1st passenger. 
+The 2nd bus departs with you and the 2nd passenger.
+Note that you must not arrive at the same time as the passengers, which is why you must arrive before the 2nd passenger to catch the bus.
+ +

Example 2:

+ +
+Input: buses = [20,30,10], passengers = [19,13,26,4,25,11,21], capacity = 2
+Output: 20
+Explanation: 
+The 1st bus departs with the 4th passenger. 
+The 2nd bus departs with the 6th and 2nd passengers.
+The 3rd bus departs with the 1st passenger and you.
+
+ +

 

+

Constraints:

+ +
    +
  • n == buses.length
  • +
  • m == passengers.length
  • +
  • 1 <= n, m, capacity <= 105
  • +
  • 2 <= buses[i], passengers[i] <= 109
  • +
  • Each element in buses is unique.
  • +
  • Each element in passengers is unique.
  • +
diff --git a/leetcode-cn/problem (English)/数组拆分(English) [array-partition].html b/leetcode-cn/problem (English)/数组拆分(English) [array-partition].html new file mode 100644 index 00000000..a1780f7c --- /dev/null +++ b/leetcode-cn/problem (English)/数组拆分(English) [array-partition].html @@ -0,0 +1,30 @@ +

Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,4,3,2]
+Output: 4
+Explanation: All possible pairings (ignoring the ordering of elements) are:
+1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3
+2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3
+3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4
+So the maximum possible sum is 4.
+ +

Example 2:

+ +
+Input: nums = [6,2,6,5,1,2]
+Output: 9
+Explanation: The optimal pairing is (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
  • +
  • nums.length == 2 * n
  • +
  • -104 <= nums[i] <= 104
  • +
diff --git a/leetcode-cn/problem (English)/无限集中的最小数字(English) [smallest-number-in-infinite-set].html b/leetcode-cn/problem (English)/无限集中的最小数字(English) [smallest-number-in-infinite-set].html new file mode 100644 index 00000000..2d99f9ad --- /dev/null +++ b/leetcode-cn/problem (English)/无限集中的最小数字(English) [smallest-number-in-infinite-set].html @@ -0,0 +1,40 @@ +

You have a set which contains all positive integers [1, 2, 3, 4, 5, ...].

+ +

Implement the SmallestInfiniteSet class:

+ +
    +
  • SmallestInfiniteSet() Initializes the SmallestInfiniteSet object to contain all positive integers.
  • +
  • int popSmallest() Removes and returns the smallest integer contained in the infinite set.
  • +
  • void addBack(int num) Adds a positive integer num back into the infinite set, if it is not already in the infinite set.
  • +
+ +

 

+

Example 1:

+ +
+Input
+["SmallestInfiniteSet", "addBack", "popSmallest", "popSmallest", "popSmallest", "addBack", "popSmallest", "popSmallest", "popSmallest"]
+[[], [2], [], [], [], [1], [], [], []]
+Output
+[null, null, 1, 2, 3, null, 1, 4, 5]
+
+Explanation
+SmallestInfiniteSet smallestInfiniteSet = new SmallestInfiniteSet();
+smallestInfiniteSet.addBack(2);    // 2 is already in the set, so no change is made.
+smallestInfiniteSet.popSmallest(); // return 1, since 1 is the smallest number, and remove it from the set.
+smallestInfiniteSet.popSmallest(); // return 2, and remove it from the set.
+smallestInfiniteSet.popSmallest(); // return 3, and remove it from the set.
+smallestInfiniteSet.addBack(1);    // 1 is added back to the set.
+smallestInfiniteSet.popSmallest(); // return 1, since 1 was added back to the set and
+                                   // is the smallest number, and remove it from the set.
+smallestInfiniteSet.popSmallest(); // return 4, and remove it from the set.
+smallestInfiniteSet.popSmallest(); // return 5, and remove it from the set.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num <= 1000
  • +
  • At most 1000 calls will be made in total to popSmallest and addBack.
  • +
diff --git a/leetcode-cn/problem (English)/最小差值平方和(English) [minimum-sum-of-squared-difference].html b/leetcode-cn/problem (English)/最小差值平方和(English) [minimum-sum-of-squared-difference].html new file mode 100644 index 00000000..826e374b --- /dev/null +++ b/leetcode-cn/problem (English)/最小差值平方和(English) [minimum-sum-of-squared-difference].html @@ -0,0 +1,41 @@ +

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

+ +

The sum of squared difference of arrays nums1 and nums2 is defined as the sum of (nums1[i] - nums2[i])2 for each 0 <= i < n.

+ +

You are also given two positive integers k1 and k2. You can modify any of the elements of nums1 by +1 or -1 at most k1 times. Similarly, you can modify any of the elements of nums2 by +1 or -1 at most k2 times.

+ +

Return the minimum sum of squared difference after modifying array nums1 at most k1 times and modifying array nums2 at most k2 times.

+ +

Note: You are allowed to modify the array elements to become negative integers.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3,4], nums2 = [2,10,20,19], k1 = 0, k2 = 0
+Output: 579
+Explanation: The elements in nums1 and nums2 cannot be modified because k1 = 0 and k2 = 0. 
+The sum of square difference will be: (1 - 2)2 + (2 - 10)2 + (3 - 20)2 + (4 - 19)2 = 579.
+
+ +

Example 2:

+ +
+Input: nums1 = [1,4,10,12], nums2 = [5,8,6,9], k1 = 1, k2 = 1
+Output: 43
+Explanation: One way to obtain the minimum sum of square difference is: 
+- Increase nums1[0] once.
+- Increase nums2[2] once.
+The minimum of the sum of square difference will be: 
+(2 - 5)2 + (4 - 8)2 + (10 - 7)2 + (12 - 9)2 = 43.
+Note that, there are other ways to obtain the minimum of the sum of square difference, but there is no way to obtain a sum smaller than 43.
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 1 <= n <= 105
  • +
  • 0 <= nums1[i], nums2[i] <= 105
  • +
  • 0 <= k1, k2 <= 109
  • +
diff --git a/leetcode-cn/problem (English)/知道秘密的人数(English) [number-of-people-aware-of-a-secret].html b/leetcode-cn/problem (English)/知道秘密的人数(English) [number-of-people-aware-of-a-secret].html new file mode 100644 index 00000000..663381d0 --- /dev/null +++ b/leetcode-cn/problem (English)/知道秘密的人数(English) [number-of-people-aware-of-a-secret].html @@ -0,0 +1,40 @@ +

On day 1, one person discovers a secret.

+ +

You are given an integer delay, which means that each person will share the secret with a new person every day, starting from delay days after discovering the secret. You are also given an integer forget, which means that each person will forget the secret forget days after discovering it. A person cannot share the secret on the same day they forgot it, or on any day afterwards.

+ +

Given an integer n, return the number of people who know the secret at the end of day n. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 6, delay = 2, forget = 4
+Output: 5
+Explanation:
+Day 1: Suppose the first person is named A. (1 person)
+Day 2: A is the only person who knows the secret. (1 person)
+Day 3: A shares the secret with a new person, B. (2 people)
+Day 4: A shares the secret with a new person, C. (3 people)
+Day 5: A forgets the secret, and B shares the secret with a new person, D. (3 people)
+Day 6: B shares the secret with E, and C shares the secret with F. (5 people)
+
+ +

Example 2:

+ +
+Input: n = 4, delay = 1, forget = 3
+Output: 6
+Explanation:
+Day 1: The first person is named A. (1 person)
+Day 2: A shares the secret with B. (2 people)
+Day 3: A and B share the secret with 2 new people, C and D. (4 people)
+Day 4: A forgets the secret. B, C, and D share the secret with 3 new people. (6 people)
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 1000
  • +
  • 1 <= delay < forget <= n
  • +
diff --git a/leetcode-cn/problem (English)/移动片段得到字符串(English) [move-pieces-to-obtain-a-string].html b/leetcode-cn/problem (English)/移动片段得到字符串(English) [move-pieces-to-obtain-a-string].html new file mode 100644 index 00000000..815eb798 --- /dev/null +++ b/leetcode-cn/problem (English)/移动片段得到字符串(English) [move-pieces-to-obtain-a-string].html @@ -0,0 +1,46 @@ +

You are given two strings start and target, both of length n. Each string consists only of the characters 'L', 'R', and '_' where:

+ +
    +
  • The characters 'L' and 'R' represent pieces, where a piece 'L' can move to the left only if there is a blank space directly to its left, and a piece 'R' can move to the right only if there is a blank space directly to its right.
  • +
  • The character '_' represents a blank space that can be occupied by any of the 'L' or 'R' pieces.
  • +
+ +

Return true if it is possible to obtain the string target by moving the pieces of the string start any number of times. Otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: start = "_L__R__R_", target = "L______RR"
+Output: true
+Explanation: We can obtain the string target from start by doing the following moves:
+- Move the first piece one step to the left, start becomes equal to "L___R__R_".
+- Move the last piece one step to the right, start becomes equal to "L___R___R".
+- Move the second piece three steps to the right, start becomes equal to "L______RR".
+Since it is possible to get the string target from start, we return true.
+
+ +

Example 2:

+ +
+Input: start = "R_L_", target = "__LR"
+Output: false
+Explanation: The 'R' piece in the string start can move one step to the right to obtain "_RL_".
+After that, no pieces can move anymore, so it is impossible to obtain the string target from start.
+
+ +

Example 3:

+ +
+Input: start = "_R", target = "R_"
+Output: false
+Explanation: The piece in the string start can move only to the right, so it is impossible to obtain the string target from start.
+ +

 

+

Constraints:

+ +
    +
  • n == start.length == target.length
  • +
  • 1 <= n <= 105
  • +
  • start and target consist of the characters 'L', 'R', and '_'.
  • +
diff --git a/leetcode-cn/problem (English)/统计理想数组的数目(English) [count-the-number-of-ideal-arrays].html b/leetcode-cn/problem (English)/统计理想数组的数目(English) [count-the-number-of-ideal-arrays].html new file mode 100644 index 00000000..44f2ebe0 --- /dev/null +++ b/leetcode-cn/problem (English)/统计理想数组的数目(English) [count-the-number-of-ideal-arrays].html @@ -0,0 +1,48 @@ +

You are given two integers n and maxValue, which are used to describe an ideal array.

+ +

A 0-indexed integer array arr of length n is considered ideal if the following conditions hold:

+ +
    +
  • Every arr[i] is a value from 1 to maxValue, for 0 <= i < n.
  • +
  • Every arr[i] is divisible by arr[i - 1], for 0 < i < n.
  • +
+ +

Return the number of distinct ideal arrays of length n. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 2, maxValue = 5
+Output: 10
+Explanation: The following are the possible ideal arrays:
+- Arrays starting with the value 1 (5 arrays): [1,1], [1,2], [1,3], [1,4], [1,5]
+- Arrays starting with the value 2 (2 arrays): [2,2], [2,4]
+- Arrays starting with the value 3 (1 array): [3,3]
+- Arrays starting with the value 4 (1 array): [4,4]
+- Arrays starting with the value 5 (1 array): [5,5]
+There are a total of 5 + 2 + 1 + 1 + 1 = 10 distinct ideal arrays.
+
+ +

Example 2:

+ +
+Input: n = 5, maxValue = 3
+Output: 11
+Explanation: The following are the possible ideal arrays:
+- Arrays starting with the value 1 (9 arrays): 
+   - With no other distinct values (1 array): [1,1,1,1,1] 
+   - With 2nd distinct value 2 (4 arrays): [1,1,1,1,2], [1,1,1,2,2], [1,1,2,2,2], [1,2,2,2,2]
+   - With 2nd distinct value 3 (4 arrays): [1,1,1,1,3], [1,1,1,3,3], [1,1,3,3,3], [1,3,3,3,3]
+- Arrays starting with the value 2 (1 array): [2,2,2,2,2]
+- Arrays starting with the value 3 (1 array): [3,3,3,3,3]
+There are a total of 9 + 1 + 1 = 11 distinct ideal arrays.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 104
  • +
  • 1 <= maxValue <= 104
  • +
diff --git a/leetcode-cn/problem (English)/网格图中递增路径的数目(English) [number-of-increasing-paths-in-a-grid].html b/leetcode-cn/problem (English)/网格图中递增路径的数目(English) [number-of-increasing-paths-in-a-grid].html new file mode 100644 index 00000000..3afd0789 --- /dev/null +++ b/leetcode-cn/problem (English)/网格图中递增路径的数目(English) [number-of-increasing-paths-in-a-grid].html @@ -0,0 +1,40 @@ +

You are given an m x n integer matrix grid, where you can move from a cell to any adjacent cell in all 4 directions.

+ +

Return the number of strictly increasing paths in the grid such that you can start from any cell and end at any cell. Since the answer may be very large, return it modulo 109 + 7.

+ +

Two paths are considered different if they do not have exactly the same sequence of visited cells.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,1],[3,4]]
+Output: 8
+Explanation: The strictly increasing paths are:
+- Paths with length 1: [1], [1], [3], [4].
+- Paths with length 2: [1 -> 3], [1 -> 4], [3 -> 4].
+- Paths with length 3: [1 -> 3 -> 4].
+The total number of paths is 4 + 3 + 1 = 8.
+
+ +

Example 2:

+ +
+Input: grid = [[1],[2]]
+Output: 3
+Explanation: The strictly increasing paths are:
+- Paths with length 1: [1], [2].
+- Paths with length 2: [1 -> 2].
+The total number of paths is 2 + 1 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
  • +
  • n == grid[i].length
  • +
  • 1 <= m, n <= 1000
  • +
  • 1 <= m * n <= 105
  • +
  • 1 <= grid[i][j] <= 105
  • +
diff --git a/leetcode-cn/problem (English)/螺旋矩阵 IV(English) [spiral-matrix-iv].html b/leetcode-cn/problem (English)/螺旋矩阵 IV(English) [spiral-matrix-iv].html new file mode 100644 index 00000000..97f87499 --- /dev/null +++ b/leetcode-cn/problem (English)/螺旋矩阵 IV(English) [spiral-matrix-iv].html @@ -0,0 +1,35 @@ +

You are given two integers m and n, which represent the dimensions of a matrix.

+ +

You are also given the head of a linked list of integers.

+ +

Generate an m x n matrix that contains the integers in the linked list presented in spiral order (clockwise), starting from the top-left of the matrix. If there are remaining empty spaces, fill them with -1.

+ +

Return the generated matrix.

+ +

 

+

Example 1:

+ +
+Input: m = 3, n = 5, head = [3,0,2,6,8,1,7,9,4,2,5,5,0]
+Output: [[3,0,2,6,8],[5,0,-1,-1,1],[5,2,4,9,7]]
+Explanation: The diagram above shows how the values are printed in the matrix.
+Note that the remaining spaces in the matrix are filled with -1.
+
+ +

Example 2:

+ +
+Input: m = 1, n = 4, head = [0,1,2]
+Output: [[0,1,2,-1]]
+Explanation: The diagram above shows how the values are printed from left to right in the matrix.
+The last space in the matrix is set to -1.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 105
  • +
  • 1 <= m * n <= 105
  • +
  • The number of nodes in the list is in the range [1, m * n].
  • +
  • 0 <= Node.val <= 1000
  • +
diff --git a/leetcode-cn/problem (English)/装满杯子需要的最短总时长(English) [minimum-amount-of-time-to-fill-cups].html b/leetcode-cn/problem (English)/装满杯子需要的最短总时长(English) [minimum-amount-of-time-to-fill-cups].html new file mode 100644 index 00000000..c11fb2a7 --- /dev/null +++ b/leetcode-cn/problem (English)/装满杯子需要的最短总时长(English) [minimum-amount-of-time-to-fill-cups].html @@ -0,0 +1,48 @@ +

You have a water dispenser that can dispense cold, warm, and hot water. Every second, you can either fill up 2 cups with different types of water, or 1 cup of any type of water.

+ +

You are given a 0-indexed integer array amount of length 3 where amount[0], amount[1], and amount[2] denote the number of cold, warm, and hot water cups you need to fill respectively. Return the minimum number of seconds needed to fill up all the cups.

+ +

 

+

Example 1:

+ +
+Input: amount = [1,4,2]
+Output: 4
+Explanation: One way to fill up the cups is:
+Second 1: Fill up a cold cup and a warm cup.
+Second 2: Fill up a warm cup and a hot cup.
+Second 3: Fill up a warm cup and a hot cup.
+Second 4: Fill up a warm cup.
+It can be proven that 4 is the minimum number of seconds needed.
+
+ +

Example 2:

+ +
+Input: amount = [5,4,4]
+Output: 7
+Explanation: One way to fill up the cups is:
+Second 1: Fill up a cold cup, and a hot cup.
+Second 2: Fill up a cold cup, and a warm cup.
+Second 3: Fill up a cold cup, and a warm cup.
+Second 4: Fill up a warm cup, and a hot cup.
+Second 5: Fill up a cold cup, and a hot cup.
+Second 6: Fill up a cold cup, and a warm cup.
+Second 7: Fill up a hot cup.
+
+ +

Example 3:

+ +
+Input: amount = [5,0,0]
+Output: 5
+Explanation: Every second, we fill up a cold cup.
+
+ +

 

+

Constraints:

+ +
    +
  • amount.length == 3
  • +
  • 0 <= amount[i] <= 100
  • +
diff --git a/leetcode-cn/problem (English)/解密消息(English) [decode-the-message].html b/leetcode-cn/problem (English)/解密消息(English) [decode-the-message].html new file mode 100644 index 00000000..3889cd80 --- /dev/null +++ b/leetcode-cn/problem (English)/解密消息(English) [decode-the-message].html @@ -0,0 +1,44 @@ +

You are given the strings key and message, which represent a cipher key and a secret message, respectively. The steps to decode message are as follows:

+ +
    +
  1. Use the first appearance of all 26 lowercase English letters in key as the order of the substitution table.
  2. +
  3. Align the substitution table with the regular English alphabet.
  4. +
  5. Each letter in message is then substituted using the table.
  6. +
  7. Spaces ' ' are transformed to themselves.
  8. +
+ +
    +
  • For example, given key = "happy boy" (actual key would have at least one instance of each letter in the alphabet), we have the partial substitution table of ('h' -> 'a', 'a' -> 'b', 'p' -> 'c', 'y' -> 'd', 'b' -> 'e', 'o' -> 'f').
  • +
+ +

Return the decoded message.

+ +

 

+

Example 1:

+ +
+Input: key = "the quick brown fox jumps over the lazy dog", message = "vkbs bs t suepuv"
+Output: "this is a secret"
+Explanation: The diagram above shows the substitution table.
+It is obtained by taking the first appearance of each letter in "the quick brown fox jumps over the lazy dog".
+
+ +

Example 2:

+ +
+Input: key = "eljuxhpwnyrdgtqkviszcfmabo", message = "zwx hnfx lqantp mnoeius ycgk vcnjrdb"
+Output: "the five boxing wizards jump quickly"
+Explanation: The diagram above shows the substitution table.
+It is obtained by taking the first appearance of each letter in "eljuxhpwnyrdgtqkviszcfmabo".
+
+ +

 

+

Constraints:

+ +
    +
  • 26 <= key.length <= 2000
  • +
  • key consists of lowercase English letters and ' '.
  • +
  • key contains every letter in the English alphabet ('a' to 'z') at least once.
  • +
  • 1 <= message.length <= 2000
  • +
  • message consists of lowercase English letters and ' '.
  • +
diff --git a/leetcode-cn/problem (English)/计算布尔二叉树的值(English) [evaluate-boolean-binary-tree].html b/leetcode-cn/problem (English)/计算布尔二叉树的值(English) [evaluate-boolean-binary-tree].html new file mode 100644 index 00000000..6a7844aa --- /dev/null +++ b/leetcode-cn/problem (English)/计算布尔二叉树的值(English) [evaluate-boolean-binary-tree].html @@ -0,0 +1,49 @@ +

You are given the root of a full binary tree with the following properties:

+ +
    +
  • Leaf nodes have either the value 0 or 1, where 0 represents False and 1 represents True.
  • +
  • Non-leaf nodes have either the value 2 or 3, where 2 represents the boolean OR and 3 represents the boolean AND.
  • +
+ +

The evaluation of a node is as follows:

+ +
    +
  • If the node is a leaf node, the evaluation is the value of the node, i.e. True or False.
  • +
  • Otherwise, evaluate the node's two children and apply the boolean operation of its value with the children's evaluations.
  • +
+ +

Return the boolean result of evaluating the root node.

+ +

A full binary tree is a binary tree where each node has either 0 or 2 children.

+ +

A leaf node is a node that has zero children.

+ +

 

+

Example 1:

+ +
+Input: root = [2,1,3,null,null,0,1]
+Output: true
+Explanation: The above diagram illustrates the evaluation process.
+The AND node evaluates to False AND True = False.
+The OR node evaluates to True OR False = True.
+The root node evaluates to True, so we return true.
+ +

Example 2:

+ +
+Input: root = [0]
+Output: false
+Explanation: The root node is a leaf node and it evaluates to false, so we return false.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 1000].
  • +
  • 0 <= Node.val <= 3
  • +
  • Every node has either 0 or 2 children.
  • +
  • Leaf nodes have a value of 0 or 1.
  • +
  • Non-leaf nodes have a value of 2 or 3.
  • +
diff --git a/leetcode/origin-data.json b/leetcode/origin-data.json index 6d182c9a..c1599650 100644 --- a/leetcode/origin-data.json +++ b/leetcode/origin-data.json @@ -1,11 +1,103 @@ { "user_name": "", "num_solved": 0, - "num_total": 2322, + "num_total": 2338, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, "stat_status_pairs": [ + { + "stat": { + "question_id": 2468, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Valid Palindrome IV", + "question__title_slug": "valid-palindrome-iv", + "question__hide": false, + "total_acs": 437, + "total_submitted": 555, + "frontend_question_id": 2330, + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2458, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Find Minimum Time to Finish All Jobs II", + "question__title_slug": "find-minimum-time-to-finish-all-jobs-ii", + "question__hide": false, + "total_acs": 558, + "total_submitted": 717, + "frontend_question_id": 2323, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2452, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Product Sales Analysis V", + "question__title_slug": "product-sales-analysis-v", + "question__hide": false, + "total_acs": 326, + "total_submitted": 396, + "frontend_question_id": 2329, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2451, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Product Sales Analysis IV", + "question__title_slug": "product-sales-analysis-iv", + "question__hide": false, + "total_acs": 424, + "total_submitted": 486, + "frontend_question_id": 2324, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2446, @@ -15,8 +107,8 @@ "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, + "total_acs": 487, + "total_submitted": 613, "frontend_question_id": 2314, "is_new_question": false }, @@ -38,8 +130,8 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 371, - "total_submitted": 487, + "total_acs": 624, + "total_submitted": 797, "frontend_question_id": 2308, "is_new_question": false }, @@ -61,8 +153,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 498, - "total_submitted": 577, + "total_acs": 768, + "total_submitted": 873, "frontend_question_id": 2298, "is_new_question": false }, @@ -84,8 +176,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": 657, - "total_submitted": 1644, + "total_acs": 930, + "total_submitted": 2513, "frontend_question_id": 2292, "is_new_question": false }, @@ -107,8 +199,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 938, - "total_submitted": 1880, + "total_acs": 1088, + "total_submitted": 2231, "frontend_question_id": 2291, "is_new_question": false }, @@ -130,8 +222,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": 509, - "total_submitted": 999, + "total_acs": 526, + "total_submitted": 1040, "frontend_question_id": 2282, "is_new_question": false }, @@ -153,8 +245,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 683, - "total_submitted": 989, + "total_acs": 878, + "total_submitted": 1294, "frontend_question_id": 2277, "is_new_question": false }, @@ -167,6 +259,282 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2419, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Subarray With Elements Greater Than Varying Threshold", + "question__title_slug": "subarray-with-elements-greater-than-varying-threshold", + "question__hide": false, + "total_acs": 2349, + "total_submitted": 6628, + "frontend_question_id": 2334, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2418, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Sum of Squared Difference", + "question__title_slug": "minimum-sum-of-squared-difference", + "question__hide": false, + "total_acs": 5329, + "total_submitted": 23658, + "frontend_question_id": 2333, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2417, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "The Latest Time to Catch a Bus", + "question__title_slug": "the-latest-time-to-catch-a-bus", + "question__hide": false, + "total_acs": 7210, + "total_submitted": 36155, + "frontend_question_id": 2332, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2416, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Evaluate Boolean Binary Tree", + "question__title_slug": "evaluate-boolean-binary-tree", + "question__hide": false, + "total_acs": 14710, + "total_submitted": 18795, + "frontend_question_id": 2331, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2415, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Count the Number of Ideal Arrays", + "question__title_slug": "count-the-number-of-ideal-arrays", + "question__hide": false, + "total_acs": 1730, + "total_submitted": 9224, + "frontend_question_id": 2338, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2414, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Move Pieces to Obtain a String", + "question__title_slug": "move-pieces-to-obtain-a-string", + "question__hide": false, + "total_acs": 10402, + "total_submitted": 22390, + "frontend_question_id": 2337, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2413, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Smallest Number in Infinite Set", + "question__title_slug": "smallest-number-in-infinite-set", + "question__hide": false, + "total_acs": 14059, + "total_submitted": 19875, + "frontend_question_id": 2336, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2412, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Amount of Time to Fill Cups", + "question__title_slug": "minimum-amount-of-time-to-fill-cups", + "question__hide": false, + "total_acs": 15781, + "total_submitted": 29482, + "frontend_question_id": 2335, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2411, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Spiral Matrix IV", + "question__title_slug": "spiral-matrix-iv", + "question__hide": false, + "total_acs": 16259, + "total_submitted": 21946, + "frontend_question_id": 2326, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2409, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Number of Increasing Paths in a Grid", + "question__title_slug": "number-of-increasing-paths-in-a-grid", + "question__hide": false, + "total_acs": 9386, + "total_submitted": 20033, + "frontend_question_id": 2328, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2408, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Number of People Aware of a Secret", + "question__title_slug": "number-of-people-aware-of-a-secret", + "question__hide": false, + "total_acs": 10649, + "total_submitted": 24551, + "frontend_question_id": 2327, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2406, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Decode the Message", + "question__title_slug": "decode-the-message", + "question__hide": false, + "total_acs": 21867, + "total_submitted": 26218, + "frontend_question_id": 2325, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2405, @@ -176,8 +544,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 1729, - "total_submitted": 2208, + "total_acs": 1947, + "total_submitted": 2487, "frontend_question_id": 2268, "is_new_question": false }, @@ -199,8 +567,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 4633, - "total_submitted": 8568, + "total_acs": 5947, + "total_submitted": 10776, "frontend_question_id": 2318, "is_new_question": false }, @@ -222,8 +590,8 @@ "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, + "total_acs": 13536, + "total_submitted": 35806, "frontend_question_id": 2316, "is_new_question": false }, @@ -245,8 +613,8 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 8984, - "total_submitted": 12050, + "total_acs": 10459, + "total_submitted": 13733, "frontend_question_id": 2317, "is_new_question": false }, @@ -268,8 +636,8 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 16708, - "total_submitted": 20754, + "total_acs": 20261, + "total_submitted": 24953, "frontend_question_id": 2315, "is_new_question": false }, @@ -291,8 +659,8 @@ "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, + "total_acs": 3655, + "total_submitted": 7574, "frontend_question_id": 2322, "is_new_question": false }, @@ -314,10 +682,10 @@ "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, + "total_acs": 455, + "total_submitted": 635, "frontend_question_id": 2313, - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -337,8 +705,8 @@ "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, + "total_acs": 23242, + "total_submitted": 34645, "frontend_question_id": 2319, "is_new_question": false }, @@ -360,8 +728,8 @@ "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, + "total_acs": 15666, + "total_submitted": 40930, "frontend_question_id": 2320, "is_new_question": false }, @@ -383,8 +751,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 662, - "total_submitted": 1030, + "total_acs": 700, + "total_submitted": 1094, "frontend_question_id": 2254, "is_new_question": false }, @@ -406,8 +774,8 @@ "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, + "total_acs": 12812, + "total_submitted": 36894, "frontend_question_id": 2311, "is_new_question": false }, @@ -429,8 +797,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": 9792, - "total_submitted": 19498, + "total_acs": 10607, + "total_submitted": 20863, "frontend_question_id": 2302, "is_new_question": false }, @@ -452,8 +820,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 8696, - "total_submitted": 22484, + "total_acs": 9002, + "total_submitted": 23206, "frontend_question_id": 2301, "is_new_question": false }, @@ -475,8 +843,8 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 15682, - "total_submitted": 52499, + "total_acs": 16360, + "total_submitted": 54211, "frontend_question_id": 2300, "is_new_question": false }, @@ -498,8 +866,8 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 19427, - "total_submitted": 34437, + "total_acs": 20358, + "total_submitted": 36012, "frontend_question_id": 2299, "is_new_question": false }, @@ -521,8 +889,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 6072, - "total_submitted": 18457, + "total_acs": 6346, + "total_submitted": 19139, "frontend_question_id": 2306, "is_new_question": false }, @@ -544,8 +912,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 9707, - "total_submitted": 26760, + "total_acs": 10169, + "total_submitted": 27565, "frontend_question_id": 2296, "is_new_question": false }, @@ -567,8 +935,8 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 19956, - "total_submitted": 35161, + "total_acs": 20752, + "total_submitted": 36383, "frontend_question_id": 2295, "is_new_question": false }, @@ -590,8 +958,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": 19337, - "total_submitted": 27183, + "total_acs": 20127, + "total_submitted": 28187, "frontend_question_id": 2294, "is_new_question": false }, @@ -613,8 +981,8 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 23865, - "total_submitted": 37503, + "total_acs": 24948, + "total_submitted": 39127, "frontend_question_id": 2293, "is_new_question": false }, @@ -636,8 +1004,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": 1128, - "total_submitted": 1610, + "total_acs": 1195, + "total_submitted": 1708, "frontend_question_id": 2237, "is_new_question": false }, @@ -659,8 +1027,8 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 27044, - "total_submitted": 30033, + "total_acs": 32999, + "total_submitted": 36805, "frontend_question_id": 2236, "is_new_question": false }, @@ -682,8 +1050,8 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 49972, - "total_submitted": 54095, + "total_acs": 62135, + "total_submitted": 67553, "frontend_question_id": 2235, "is_new_question": false }, @@ -705,8 +1073,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 167, - "total_submitted": 264, + "total_acs": 191, + "total_submitted": 291, "frontend_question_id": 2253, "is_new_question": false }, @@ -728,8 +1096,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 194, - "total_submitted": 350, + "total_acs": 226, + "total_submitted": 405, "frontend_question_id": 2252, "is_new_question": false }, @@ -751,8 +1119,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 2792, - "total_submitted": 19202, + "total_acs": 2922, + "total_submitted": 19798, "frontend_question_id": 2286, "is_new_question": false }, @@ -774,8 +1142,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 15035, - "total_submitted": 25208, + "total_acs": 15956, + "total_submitted": 26631, "frontend_question_id": 2285, "is_new_question": false }, @@ -797,8 +1165,8 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 18238, - "total_submitted": 33142, + "total_acs": 18954, + "total_submitted": 34416, "frontend_question_id": 2284, "is_new_question": false }, @@ -820,8 +1188,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": 21854, - "total_submitted": 29346, + "total_acs": 23032, + "total_submitted": 30953, "frontend_question_id": 2283, "is_new_question": false }, @@ -843,8 +1211,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": 1615, - "total_submitted": 2115, + "total_acs": 1800, + "total_submitted": 2345, "frontend_question_id": 2238, "is_new_question": false }, @@ -866,8 +1234,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 9261, - "total_submitted": 19235, + "total_acs": 9982, + "total_submitted": 20513, "frontend_question_id": 2290, "is_new_question": false }, @@ -889,8 +1257,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 8099, - "total_submitted": 40321, + "total_acs": 8590, + "total_submitted": 42364, "frontend_question_id": 2289, "is_new_question": false }, @@ -912,8 +1280,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 12641, - "total_submitted": 48082, + "total_acs": 12996, + "total_submitted": 49258, "frontend_question_id": 2288, "is_new_question": false }, @@ -935,8 +1303,8 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 20835, - "total_submitted": 36144, + "total_acs": 21665, + "total_submitted": 37597, "frontend_question_id": 2287, "is_new_question": false }, @@ -958,8 +1326,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": 1311, - "total_submitted": 2599, + "total_acs": 1465, + "total_submitted": 2896, "frontend_question_id": 2230, "is_new_question": false }, @@ -981,8 +1349,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": 1898, - "total_submitted": 4238, + "total_acs": 2125, + "total_submitted": 4778, "frontend_question_id": 2228, "is_new_question": false }, @@ -1004,8 +1372,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 1346, - "total_submitted": 2125, + "total_acs": 1422, + "total_submitted": 2291, "frontend_question_id": 2219, "is_new_question": false }, @@ -1027,8 +1395,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 4277, - "total_submitted": 18316, + "total_acs": 4709, + "total_submitted": 19759, "frontend_question_id": 2281, "is_new_question": false }, @@ -1050,8 +1418,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": 16409, - "total_submitted": 72204, + "total_acs": 16786, + "total_submitted": 73582, "frontend_question_id": 2280, "is_new_question": false }, @@ -1073,8 +1441,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": 21589, - "total_submitted": 35412, + "total_acs": 24765, + "total_submitted": 39955, "frontend_question_id": 2279, "is_new_question": false }, @@ -1096,8 +1464,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 26498, - "total_submitted": 36204, + "total_acs": 27897, + "total_submitted": 38025, "frontend_question_id": 2278, "is_new_question": false }, @@ -1119,8 +1487,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 7728, - "total_submitted": 17625, + "total_acs": 8120, + "total_submitted": 18486, "frontend_question_id": 2246, "is_new_question": false }, @@ -1142,8 +1510,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": 5744, - "total_submitted": 16657, + "total_acs": 5804, + "total_submitted": 16799, "frontend_question_id": 2245, "is_new_question": false }, @@ -1165,8 +1533,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 20722, - "total_submitted": 37524, + "total_acs": 21608, + "total_submitted": 38938, "frontend_question_id": 2244, "is_new_question": false }, @@ -1188,8 +1556,8 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 20272, - "total_submitted": 30566, + "total_acs": 20928, + "total_submitted": 31496, "frontend_question_id": 2243, "is_new_question": false }, @@ -1211,8 +1579,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 5078, - "total_submitted": 15762, + "total_acs": 6172, + "total_submitted": 18352, "frontend_question_id": 2272, "is_new_question": false }, @@ -1234,8 +1602,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": 8673, - "total_submitted": 28673, + "total_acs": 9143, + "total_submitted": 29763, "frontend_question_id": 2271, "is_new_question": false }, @@ -1257,8 +1625,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 15811, - "total_submitted": 36736, + "total_acs": 16416, + "total_submitted": 37979, "frontend_question_id": 2270, "is_new_question": false }, @@ -1280,8 +1648,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 7821, - "total_submitted": 25035, + "total_acs": 8060, + "total_submitted": 25685, "frontend_question_id": 2276, "is_new_question": false }, @@ -1303,8 +1671,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": 14946, - "total_submitted": 20922, + "total_acs": 15323, + "total_submitted": 21423, "frontend_question_id": 2275, "is_new_question": false }, @@ -1326,8 +1694,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 19068, - "total_submitted": 36518, + "total_acs": 20176, + "total_submitted": 38622, "frontend_question_id": 2274, "is_new_question": false }, @@ -1349,8 +1717,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 5126, - "total_submitted": 9095, + "total_acs": 5909, + "total_submitted": 10468, "frontend_question_id": 2214, "is_new_question": false }, @@ -1372,8 +1740,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 5764, - "total_submitted": 16595, + "total_acs": 6094, + "total_submitted": 17440, "frontend_question_id": 2242, "is_new_question": false }, @@ -1395,8 +1763,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 10066, - "total_submitted": 26726, + "total_acs": 10298, + "total_submitted": 27291, "frontend_question_id": 2241, "is_new_question": false }, @@ -1418,8 +1786,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": 14617, - "total_submitted": 26141, + "total_acs": 15424, + "total_submitted": 27437, "frontend_question_id": 2240, "is_new_question": false }, @@ -1441,8 +1809,8 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 21595, - "total_submitted": 46989, + "total_acs": 22754, + "total_submitted": 49394, "frontend_question_id": 2239, "is_new_question": false }, @@ -1464,8 +1832,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": 9243, - "total_submitted": 24904, + "total_acs": 9476, + "total_submitted": 25498, "frontend_question_id": 2267, "is_new_question": false }, @@ -1487,8 +1855,8 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 10370, - "total_submitted": 21706, + "total_acs": 10716, + "total_submitted": 22463, "frontend_question_id": 2266, "is_new_question": false }, @@ -1510,8 +1878,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": 18676, - "total_submitted": 21876, + "total_acs": 19951, + "total_submitted": 23345, "frontend_question_id": 2265, "is_new_question": false }, @@ -1533,8 +1901,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": 20864, - "total_submitted": 35484, + "total_acs": 21539, + "total_submitted": 36570, "frontend_question_id": 2264, "is_new_question": false }, @@ -1556,8 +1924,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": 22068, - "total_submitted": 34694, + "total_acs": 22896, + "total_submitted": 35793, "frontend_question_id": 2224, "is_new_question": false }, @@ -1579,8 +1947,8 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 4442, - "total_submitted": 12721, + "total_acs": 4551, + "total_submitted": 13087, "frontend_question_id": 2258, "is_new_question": false }, @@ -1602,8 +1970,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 9703, - "total_submitted": 18851, + "total_acs": 9971, + "total_submitted": 19275, "frontend_question_id": 2257, "is_new_question": false }, @@ -1625,8 +1993,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 13153, - "total_submitted": 37350, + "total_acs": 13554, + "total_submitted": 38279, "frontend_question_id": 2256, "is_new_question": false }, @@ -1648,8 +2016,8 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 20713, - "total_submitted": 28364, + "total_acs": 21777, + "total_submitted": 29724, "frontend_question_id": 2255, "is_new_question": false }, @@ -1671,8 +2039,8 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 10886, - "total_submitted": 19950, + "total_acs": 11868, + "total_submitted": 21557, "frontend_question_id": 2262, "is_new_question": false }, @@ -1694,8 +2062,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 13681, - "total_submitted": 29989, + "total_acs": 14162, + "total_submitted": 30819, "frontend_question_id": 2261, "is_new_question": false }, @@ -1717,8 +2085,8 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 21860, - "total_submitted": 41145, + "total_acs": 22988, + "total_submitted": 43381, "frontend_question_id": 2260, "is_new_question": false }, @@ -1740,8 +2108,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": 24527, - "total_submitted": 52265, + "total_acs": 26215, + "total_submitted": 55684, "frontend_question_id": 2259, "is_new_question": false }, @@ -1763,8 +2131,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": 1789, - "total_submitted": 3638, + "total_acs": 1960, + "total_submitted": 3937, "frontend_question_id": 2205, "is_new_question": false }, @@ -1786,8 +2154,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 728, - "total_submitted": 1647, + "total_acs": 795, + "total_submitted": 1743, "frontend_question_id": 2199, "is_new_question": false }, @@ -1809,8 +2177,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 8457, - "total_submitted": 16455, + "total_acs": 8776, + "total_submitted": 17034, "frontend_question_id": 2251, "is_new_question": false }, @@ -1832,8 +2200,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": 8607, - "total_submitted": 26474, + "total_acs": 8911, + "total_submitted": 27181, "frontend_question_id": 2250, "is_new_question": false }, @@ -1855,8 +2223,8 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 14008, - "total_submitted": 27822, + "total_acs": 14318, + "total_submitted": 28406, "frontend_question_id": 2249, "is_new_question": false }, @@ -1878,8 +2246,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 25000, - "total_submitted": 35858, + "total_acs": 26161, + "total_submitted": 37510, "frontend_question_id": 2248, "is_new_question": false }, @@ -1901,8 +2269,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 3732, - "total_submitted": 13892, + "total_acs": 3806, + "total_submitted": 14218, "frontend_question_id": 2234, "is_new_question": false }, @@ -1924,8 +2292,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 16302, - "total_submitted": 40254, + "total_acs": 16815, + "total_submitted": 41438, "frontend_question_id": 2233, "is_new_question": false }, @@ -1947,8 +2315,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": 11147, - "total_submitted": 17513, + "total_acs": 11351, + "total_submitted": 17804, "frontend_question_id": 2232, "is_new_question": false }, @@ -1970,8 +2338,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": 20903, - "total_submitted": 35598, + "total_acs": 21744, + "total_submitted": 36805, "frontend_question_id": 2231, "is_new_question": false }, @@ -1993,8 +2361,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 3775, - "total_submitted": 10918, + "total_acs": 3872, + "total_submitted": 11144, "frontend_question_id": 2223, "is_new_question": false }, @@ -2016,8 +2384,8 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 12702, - "total_submitted": 27164, + "total_acs": 13187, + "total_submitted": 28062, "frontend_question_id": 2222, "is_new_question": false }, @@ -2039,8 +2407,8 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 22357, - "total_submitted": 28213, + "total_acs": 23714, + "total_submitted": 29974, "frontend_question_id": 2221, "is_new_question": false }, @@ -2062,8 +2430,8 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 19781, - "total_submitted": 24178, + "total_acs": 20523, + "total_submitted": 25085, "frontend_question_id": 2220, "is_new_question": false }, @@ -2085,8 +2453,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": 1727, - "total_submitted": 3152, + "total_acs": 1963, + "total_submitted": 3648, "frontend_question_id": 2184, "is_new_question": false }, @@ -2108,8 +2476,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": 6732, - "total_submitted": 18814, + "total_acs": 6878, + "total_submitted": 19231, "frontend_question_id": 2203, "is_new_question": false }, @@ -2131,8 +2499,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": 24521, - "total_submitted": 38249, + "total_acs": 24935, + "total_submitted": 38898, "frontend_question_id": 2200, "is_new_question": false }, @@ -2154,8 +2522,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 2498, - "total_submitted": 8281, + "total_acs": 2533, + "total_submitted": 8439, "frontend_question_id": 2213, "is_new_question": false }, @@ -2177,8 +2545,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 9400, - "total_submitted": 19657, + "total_acs": 9577, + "total_submitted": 19976, "frontend_question_id": 2212, "is_new_question": false }, @@ -2200,8 +2568,8 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 14513, - "total_submitted": 35519, + "total_acs": 14885, + "total_submitted": 36248, "frontend_question_id": 2211, "is_new_question": false }, @@ -2223,8 +2591,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": 20692, - "total_submitted": 36346, + "total_acs": 21301, + "total_submitted": 37351, "frontend_question_id": 2210, "is_new_question": false }, @@ -2246,8 +2614,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 1842, - "total_submitted": 2781, + "total_acs": 1997, + "total_submitted": 3026, "frontend_question_id": 2175, "is_new_question": false }, @@ -2269,8 +2637,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": 2442, - "total_submitted": 3504, + "total_acs": 2711, + "total_submitted": 3871, "frontend_question_id": 2174, "is_new_question": false }, @@ -2292,8 +2660,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 1223, - "total_submitted": 2191, + "total_acs": 1328, + "total_submitted": 2348, "frontend_question_id": 2173, "is_new_question": false }, @@ -2315,8 +2683,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": 19052, - "total_submitted": 31482, + "total_acs": 19490, + "total_submitted": 32164, "frontend_question_id": 2190, "is_new_question": false }, @@ -2338,8 +2706,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": 7353, - "total_submitted": 22554, + "total_acs": 7557, + "total_submitted": 23034, "frontend_question_id": 2209, "is_new_question": false }, @@ -2361,8 +2729,8 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 13234, - "total_submitted": 29885, + "total_acs": 13584, + "total_submitted": 30586, "frontend_question_id": 2208, "is_new_question": false }, @@ -2384,8 +2752,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": 12092, - "total_submitted": 37970, + "total_acs": 12338, + "total_submitted": 38619, "frontend_question_id": 2207, "is_new_question": false }, @@ -2407,8 +2775,8 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 28352, - "total_submitted": 37156, + "total_acs": 29631, + "total_submitted": 38978, "frontend_question_id": 2206, "is_new_question": false }, @@ -2430,8 +2798,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 8333, - "total_submitted": 23005, + "total_acs": 8484, + "total_submitted": 23371, "frontend_question_id": 2197, "is_new_question": false }, @@ -2453,8 +2821,8 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 17240, - "total_submitted": 24352, + "total_acs": 17784, + "total_submitted": 25071, "frontend_question_id": 2196, "is_new_question": false }, @@ -2476,8 +2844,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 17341, - "total_submitted": 74101, + "total_acs": 17789, + "total_submitted": 75550, "frontend_question_id": 2195, "is_new_question": false }, @@ -2499,8 +2867,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": 26784, - "total_submitted": 31274, + "total_acs": 27713, + "total_submitted": 32361, "frontend_question_id": 2194, "is_new_question": false }, @@ -2522,8 +2890,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 1089, - "total_submitted": 1841, + "total_acs": 1134, + "total_submitted": 1915, "frontend_question_id": 2168, "is_new_question": false }, @@ -2545,8 +2913,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 2056, - "total_submitted": 3232, + "total_acs": 2184, + "total_submitted": 3414, "frontend_question_id": 2159, "is_new_question": false }, @@ -2568,8 +2936,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 8541, - "total_submitted": 31474, + "total_acs": 8717, + "total_submitted": 32030, "frontend_question_id": 2183, "is_new_question": false }, @@ -2591,8 +2959,8 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 13810, - "total_submitted": 26913, + "total_acs": 14020, + "total_submitted": 27321, "frontend_question_id": 2182, "is_new_question": false }, @@ -2614,8 +2982,8 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 37210, - "total_submitted": 42930, + "total_acs": 39027, + "total_submitted": 45010, "frontend_question_id": 2181, "is_new_question": false }, @@ -2637,8 +3005,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 27324, - "total_submitted": 42515, + "total_acs": 28081, + "total_submitted": 43669, "frontend_question_id": 2180, "is_new_question": false }, @@ -2660,8 +3028,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": 10152, - "total_submitted": 17247, + "total_acs": 11809, + "total_submitted": 20298, "frontend_question_id": 2158, "is_new_question": false }, @@ -2683,8 +3051,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": 730, - "total_submitted": 1416, + "total_acs": 781, + "total_submitted": 1533, "frontend_question_id": 2153, "is_new_question": false }, @@ -2706,8 +3074,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 6716, - "total_submitted": 16409, + "total_acs": 6866, + "total_submitted": 16805, "frontend_question_id": 2188, "is_new_question": false }, @@ -2729,8 +3097,8 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 22467, - "total_submitted": 73259, + "total_acs": 23087, + "total_submitted": 75037, "frontend_question_id": 2187, "is_new_question": false }, @@ -2752,8 +3120,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": 23527, - "total_submitted": 33047, + "total_acs": 23906, + "total_submitted": 33580, "frontend_question_id": 2186, "is_new_question": false }, @@ -2775,8 +3143,8 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 34918, - "total_submitted": 45143, + "total_acs": 36270, + "total_submitted": 46914, "frontend_question_id": 2185, "is_new_question": false }, @@ -2798,8 +3166,8 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 5749, - "total_submitted": 13171, + "total_acs": 5859, + "total_submitted": 13385, "frontend_question_id": 2172, "is_new_question": false }, @@ -2821,8 +3189,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 15935, - "total_submitted": 38479, + "total_acs": 16667, + "total_submitted": 40142, "frontend_question_id": 2171, "is_new_question": false }, @@ -2844,8 +3212,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": 16399, - "total_submitted": 49727, + "total_acs": 16660, + "total_submitted": 50440, "frontend_question_id": 2170, "is_new_question": false }, @@ -2867,8 +3235,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 34361, - "total_submitted": 45473, + "total_acs": 35278, + "total_submitted": 46668, "frontend_question_id": 2169, "is_new_question": false }, @@ -2890,8 +3258,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": 984, - "total_submitted": 2091, + "total_acs": 1003, + "total_submitted": 2164, "frontend_question_id": 2152, "is_new_question": false }, @@ -2913,8 +3281,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": 8409, - "total_submitted": 21296, + "total_acs": 8528, + "total_submitted": 21605, "frontend_question_id": 2167, "is_new_question": false }, @@ -2936,8 +3304,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 15273, - "total_submitted": 49607, + "total_acs": 15507, + "total_submitted": 50164, "frontend_question_id": 2166, "is_new_question": false }, @@ -2959,8 +3327,8 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 21896, - "total_submitted": 43053, + "total_acs": 22256, + "total_submitted": 43774, "frontend_question_id": 2165, "is_new_question": false }, @@ -2982,8 +3350,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 29458, - "total_submitted": 43869, + "total_acs": 30196, + "total_submitted": 45007, "frontend_question_id": 2164, "is_new_question": false }, @@ -3005,8 +3373,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": 510, - "total_submitted": 998, + "total_acs": 518, + "total_submitted": 1013, "frontend_question_id": 2143, "is_new_question": false }, @@ -3028,8 +3396,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": 3083, - "total_submitted": 6114, + "total_acs": 3296, + "total_submitted": 6565, "frontend_question_id": 2142, "is_new_question": false }, @@ -3051,8 +3419,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 3883, - "total_submitted": 11114, + "total_acs": 3981, + "total_submitted": 11349, "frontend_question_id": 2179, "is_new_question": false }, @@ -3074,8 +3442,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 23827, - "total_submitted": 41094, + "total_acs": 25508, + "total_submitted": 43815, "frontend_question_id": 2178, "is_new_question": false }, @@ -3097,8 +3465,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": 21634, - "total_submitted": 35092, + "total_acs": 23654, + "total_submitted": 37838, "frontend_question_id": 2177, "is_new_question": false }, @@ -3120,8 +3488,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": 28743, - "total_submitted": 35758, + "total_acs": 29981, + "total_submitted": 37310, "frontend_question_id": 2176, "is_new_question": false }, @@ -3143,8 +3511,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 5953, - "total_submitted": 24000, + "total_acs": 6044, + "total_submitted": 24329, "frontend_question_id": 2157, "is_new_question": false }, @@ -3166,8 +3534,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 9535, - "total_submitted": 44628, + "total_acs": 9658, + "total_submitted": 45009, "frontend_question_id": 2156, "is_new_question": false }, @@ -3189,8 +3557,8 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 40355, - "total_submitted": 54880, + "total_acs": 41713, + "total_submitted": 56739, "frontend_question_id": 2154, "is_new_question": false }, @@ -3212,8 +3580,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": 1133, - "total_submitted": 1654, + "total_acs": 1178, + "total_submitted": 1749, "frontend_question_id": 2137, "is_new_question": false }, @@ -3235,8 +3603,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 8868, - "total_submitted": 18949, + "total_acs": 9025, + "total_submitted": 19191, "frontend_question_id": 2151, "is_new_question": false }, @@ -3258,8 +3626,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 34335, - "total_submitted": 41960, + "total_acs": 37196, + "total_submitted": 45528, "frontend_question_id": 2149, "is_new_question": false }, @@ -3281,8 +3649,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": 25284, - "total_submitted": 41804, + "total_acs": 25754, + "total_submitted": 42562, "frontend_question_id": 2150, "is_new_question": false }, @@ -3304,8 +3672,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": 29246, - "total_submitted": 48497, + "total_acs": 29871, + "total_submitted": 49555, "frontend_question_id": 2148, "is_new_question": false }, @@ -3327,8 +3695,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": 21456, - "total_submitted": 28134, + "total_acs": 23256, + "total_submitted": 30507, "frontend_question_id": 2128, "is_new_question": false }, @@ -3350,8 +3718,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": 5149, - "total_submitted": 11249, + "total_acs": 5383, + "total_submitted": 11774, "frontend_question_id": 2163, "is_new_question": false }, @@ -3373,8 +3741,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 8746, - "total_submitted": 24143, + "total_acs": 9327, + "total_submitted": 25310, "frontend_question_id": 2162, "is_new_question": false }, @@ -3396,8 +3764,8 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 23937, - "total_submitted": 28765, + "total_acs": 25252, + "total_submitted": 30274, "frontend_question_id": 2161, "is_new_question": false }, @@ -3419,8 +3787,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": 38206, - "total_submitted": 43306, + "total_acs": 40381, + "total_submitted": 45769, "frontend_question_id": 2160, "is_new_question": false }, @@ -3442,8 +3810,8 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 8676, - "total_submitted": 22588, + "total_acs": 8875, + "total_submitted": 23126, "frontend_question_id": 2141, "is_new_question": false }, @@ -3465,8 +3833,8 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 19596, - "total_submitted": 43654, + "total_acs": 19941, + "total_submitted": 44335, "frontend_question_id": 2140, "is_new_question": false }, @@ -3488,8 +3856,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": 20840, - "total_submitted": 33301, + "total_acs": 21096, + "total_submitted": 33627, "frontend_question_id": 2155, "is_new_question": false }, @@ -3511,8 +3879,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": 26734, - "total_submitted": 40852, + "total_acs": 27217, + "total_submitted": 41602, "frontend_question_id": 2138, "is_new_question": false }, @@ -3534,8 +3902,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": 477, - "total_submitted": 1181, + "total_acs": 492, + "total_submitted": 1216, "frontend_question_id": 2123, "is_new_question": false }, @@ -3557,8 +3925,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": 1056, - "total_submitted": 1436, + "total_acs": 1077, + "total_submitted": 1465, "frontend_question_id": 2113, "is_new_question": false }, @@ -3580,8 +3948,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 7615, - "total_submitted": 11241, + "total_acs": 7822, + "total_submitted": 11553, "frontend_question_id": 2136, "is_new_question": false }, @@ -3603,8 +3971,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": 20738, - "total_submitted": 50485, + "total_acs": 22026, + "total_submitted": 53130, "frontend_question_id": 2135, "is_new_question": false }, @@ -3626,8 +3994,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": 14923, - "total_submitted": 30658, + "total_acs": 15327, + "total_submitted": 31408, "frontend_question_id": 2134, "is_new_question": false }, @@ -3649,8 +4017,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": 32338, - "total_submitted": 61573, + "total_acs": 33509, + "total_submitted": 63872, "frontend_question_id": 2133, "is_new_question": false }, @@ -3672,8 +4040,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 872, - "total_submitted": 1519, + "total_acs": 911, + "total_submitted": 1586, "frontend_question_id": 2118, "is_new_question": false }, @@ -3695,8 +4063,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 3130, - "total_submitted": 4428, + "total_acs": 3280, + "total_submitted": 4648, "frontend_question_id": 2112, "is_new_question": false }, @@ -3718,8 +4086,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": 7261, - "total_submitted": 18256, + "total_acs": 7417, + "total_submitted": 18630, "frontend_question_id": 2147, "is_new_question": false }, @@ -3741,8 +4109,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": 9401, - "total_submitted": 23091, + "total_acs": 9558, + "total_submitted": 23462, "frontend_question_id": 2146, "is_new_question": false }, @@ -3764,8 +4132,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 12342, - "total_submitted": 34475, + "total_acs": 12496, + "total_submitted": 34856, "frontend_question_id": 2145, "is_new_question": false }, @@ -3787,8 +4155,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": 24271, - "total_submitted": 39848, + "total_acs": 24855, + "total_submitted": 40802, "frontend_question_id": 2144, "is_new_question": false }, @@ -3810,8 +4178,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": 1509, - "total_submitted": 2616, + "total_acs": 1554, + "total_submitted": 2691, "frontend_question_id": 2107, "is_new_question": false }, @@ -3833,8 +4201,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": 5197, - "total_submitted": 16942, + "total_acs": 5323, + "total_submitted": 17256, "frontend_question_id": 2127, "is_new_question": false }, @@ -3856,8 +4224,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 20033, - "total_submitted": 40982, + "total_acs": 20418, + "total_submitted": 41711, "frontend_question_id": 2126, "is_new_question": false }, @@ -3879,8 +4247,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": 29706, - "total_submitted": 35681, + "total_acs": 30685, + "total_submitted": 36879, "frontend_question_id": 2125, "is_new_question": false }, @@ -3902,8 +4270,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": 33208, - "total_submitted": 45937, + "total_acs": 34069, + "total_submitted": 47132, "frontend_question_id": 2124, "is_new_question": false }, @@ -3925,8 +4293,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": 1382, - "total_submitted": 3602, + "total_acs": 1410, + "total_submitted": 3685, "frontend_question_id": 2098, "is_new_question": false }, @@ -3948,8 +4316,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 6821, - "total_submitted": 18122, + "total_acs": 6934, + "total_submitted": 18422, "frontend_question_id": 2122, "is_new_question": false }, @@ -3971,8 +4339,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 11915, - "total_submitted": 28093, + "total_acs": 12139, + "total_submitted": 28544, "frontend_question_id": 2121, "is_new_question": false }, @@ -3994,8 +4362,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": 16467, - "total_submitted": 19688, + "total_acs": 16850, + "total_submitted": 20116, "frontend_question_id": 2120, "is_new_question": false }, @@ -4017,8 +4385,8 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 32540, - "total_submitted": 42687, + "total_acs": 33635, + "total_submitted": 44114, "frontend_question_id": 2119, "is_new_question": false }, @@ -4040,8 +4408,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": 15665, - "total_submitted": 39976, + "total_acs": 17586, + "total_submitted": 44231, "frontend_question_id": 2131, "is_new_question": false }, @@ -4063,8 +4431,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": 43715, - "total_submitted": 53283, + "total_acs": 46564, + "total_submitted": 56826, "frontend_question_id": 2130, "is_new_question": false }, @@ -4086,8 +4454,8 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 25888, - "total_submitted": 43105, + "total_acs": 26656, + "total_submitted": 44297, "frontend_question_id": 2129, "is_new_question": false }, @@ -4109,8 +4477,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": 9116, - "total_submitted": 24635, + "total_acs": 9240, + "total_submitted": 24911, "frontend_question_id": 2111, "is_new_question": false }, @@ -4132,8 +4500,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": 20391, - "total_submitted": 36360, + "total_acs": 20859, + "total_submitted": 37094, "frontend_question_id": 2110, "is_new_question": false }, @@ -4155,8 +4523,8 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 22785, - "total_submitted": 40614, + "total_acs": 23131, + "total_submitted": 41283, "frontend_question_id": 2109, "is_new_question": false }, @@ -4178,8 +4546,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": 50338, - "total_submitted": 63816, + "total_acs": 52013, + "total_submitted": 65957, "frontend_question_id": 2108, "is_new_question": false }, @@ -4201,8 +4569,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": 2560, - "total_submitted": 4475, + "total_acs": 2606, + "total_submitted": 4557, "frontend_question_id": 2093, "is_new_question": false }, @@ -4224,8 +4592,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": 6627, - "total_submitted": 18843, + "total_acs": 6705, + "total_submitted": 19086, "frontend_question_id": 2106, "is_new_question": false }, @@ -4247,8 +4615,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 11880, - "total_submitted": 23326, + "total_acs": 12124, + "total_submitted": 23919, "frontend_question_id": 2105, "is_new_question": false }, @@ -4270,8 +4638,8 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 38279, - "total_submitted": 63298, + "total_acs": 40677, + "total_submitted": 67510, "frontend_question_id": 2104, "is_new_question": false }, @@ -4293,8 +4661,8 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 35462, - "total_submitted": 43442, + "total_acs": 36559, + "total_submitted": 44827, "frontend_question_id": 2103, "is_new_question": false }, @@ -4316,8 +4684,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": 4072, - "total_submitted": 5985, + "total_acs": 4161, + "total_submitted": 6100, "frontend_question_id": 2083, "is_new_question": false }, @@ -4339,8 +4707,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": 4014, - "total_submitted": 4389, + "total_acs": 4204, + "total_submitted": 4595, "frontend_question_id": 2084, "is_new_question": false }, @@ -4362,8 +4730,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 4857, - "total_submitted": 5992, + "total_acs": 5065, + "total_submitted": 6251, "frontend_question_id": 2082, "is_new_question": false }, @@ -4385,8 +4753,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 2046, - "total_submitted": 7232, + "total_acs": 2076, + "total_submitted": 7369, "frontend_question_id": 2117, "is_new_question": false }, @@ -4408,8 +4776,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": 10259, - "total_submitted": 32945, + "total_acs": 10597, + "total_submitted": 33910, "frontend_question_id": 2116, "is_new_question": false }, @@ -4431,8 +4799,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": 36702, - "total_submitted": 78902, + "total_acs": 39433, + "total_submitted": 84067, "frontend_question_id": 2115, "is_new_question": false }, @@ -4454,8 +4822,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": 84240, - "total_submitted": 95159, + "total_acs": 88847, + "total_submitted": 100397, "frontend_question_id": 2114, "is_new_question": false }, @@ -4477,8 +4845,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": 1982, - "total_submitted": 3484, + "total_acs": 2037, + "total_submitted": 3591, "frontend_question_id": 2077, "is_new_question": false }, @@ -4500,8 +4868,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": 47404, - "total_submitted": 97717, + "total_acs": 50888, + "total_submitted": 104621, "frontend_question_id": 2096, "is_new_question": false }, @@ -4523,8 +4891,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": 55694, - "total_submitted": 99038, + "total_acs": 58785, + "total_submitted": 104871, "frontend_question_id": 2095, "is_new_question": false }, @@ -4546,8 +4914,8 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 16699, - "total_submitted": 29433, + "total_acs": 17164, + "total_submitted": 30179, "frontend_question_id": 2094, "is_new_question": false }, @@ -4569,8 +4937,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 4699, - "total_submitted": 6434, + "total_acs": 4896, + "total_submitted": 6714, "frontend_question_id": 2072, "is_new_question": false }, @@ -4592,8 +4960,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 16324, - "total_submitted": 48108, + "total_acs": 16709, + "total_submitted": 49178, "frontend_question_id": 2092, "is_new_question": false }, @@ -4615,8 +4983,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 20836, - "total_submitted": 36096, + "total_acs": 21475, + "total_submitted": 37291, "frontend_question_id": 2091, "is_new_question": false }, @@ -4638,8 +5006,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 16514, - "total_submitted": 39523, + "total_acs": 16920, + "total_submitted": 40489, "frontend_question_id": 2090, "is_new_question": false }, @@ -4661,8 +5029,8 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 64314, - "total_submitted": 82473, + "total_acs": 66903, + "total_submitted": 86061, "frontend_question_id": 2089, "is_new_question": false }, @@ -4684,8 +5052,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 1293, - "total_submitted": 2552, + "total_acs": 1335, + "total_submitted": 2622, "frontend_question_id": 2067, "is_new_question": false }, @@ -4707,8 +5075,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 3940, - "total_submitted": 4624, + "total_acs": 4084, + "total_submitted": 4785, "frontend_question_id": 2066, "is_new_question": false }, @@ -4730,8 +5098,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 6364, - "total_submitted": 9901, + "total_acs": 6771, + "total_submitted": 10477, "frontend_question_id": 2102, "is_new_question": false }, @@ -4753,8 +5121,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 13205, - "total_submitted": 32622, + "total_acs": 13858, + "total_submitted": 34225, "frontend_question_id": 2101, "is_new_question": false }, @@ -4776,8 +5144,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": 12129, - "total_submitted": 25417, + "total_acs": 12546, + "total_submitted": 26261, "frontend_question_id": 2100, "is_new_question": false }, @@ -4799,8 +5167,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": 19387, - "total_submitted": 44701, + "total_acs": 20210, + "total_submitted": 46630, "frontend_question_id": 2099, "is_new_question": false }, @@ -4822,8 +5190,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 2859, - "total_submitted": 5202, + "total_acs": 2909, + "total_submitted": 5301, "frontend_question_id": 2061, "is_new_question": false }, @@ -4845,8 +5213,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 5387, - "total_submitted": 13042, + "total_acs": 5428, + "total_submitted": 13137, "frontend_question_id": 2081, "is_new_question": false }, @@ -4868,8 +5236,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 4968, - "total_submitted": 12359, + "total_acs": 5073, + "total_submitted": 12585, "frontend_question_id": 2097, "is_new_question": false }, @@ -4891,8 +5259,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 3962, - "total_submitted": 13266, + "total_acs": 4095, + "total_submitted": 13594, "frontend_question_id": 2132, "is_new_question": false }, @@ -4914,8 +5282,8 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 27738, - "total_submitted": 40750, + "total_acs": 28546, + "total_submitted": 42013, "frontend_question_id": 2078, "is_new_question": false }, @@ -4937,8 +5305,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 10812, - "total_submitted": 20083, + "total_acs": 10970, + "total_submitted": 20443, "frontend_question_id": 2076, "is_new_question": false }, @@ -4960,8 +5328,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 8457, - "total_submitted": 16915, + "total_acs": 8620, + "total_submitted": 17220, "frontend_question_id": 2075, "is_new_question": false }, @@ -4983,8 +5351,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 10590, - "total_submitted": 20786, + "total_acs": 10850, + "total_submitted": 21224, "frontend_question_id": 2074, "is_new_question": false }, @@ -5006,8 +5374,8 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 25415, - "total_submitted": 40916, + "total_acs": 26264, + "total_submitted": 42271, "frontend_question_id": 2073, "is_new_question": false }, @@ -5029,8 +5397,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": 3375, - "total_submitted": 4595, + "total_acs": 3519, + "total_submitted": 4800, "frontend_question_id": 2051, "is_new_question": false }, @@ -5052,8 +5420,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 4194, - "total_submitted": 6647, + "total_acs": 4285, + "total_submitted": 6785, "frontend_question_id": 2088, "is_new_question": false }, @@ -5075,8 +5443,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": 9496, - "total_submitted": 18829, + "total_acs": 9761, + "total_submitted": 19321, "frontend_question_id": 2087, "is_new_question": false }, @@ -5098,8 +5466,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": 10841, - "total_submitted": 24017, + "total_acs": 11111, + "total_submitted": 24640, "frontend_question_id": 2086, "is_new_question": false }, @@ -5121,8 +5489,8 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 26961, - "total_submitted": 38552, + "total_acs": 27893, + "total_submitted": 39902, "frontend_question_id": 2085, "is_new_question": false }, @@ -5144,8 +5512,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 9625, - "total_submitted": 16575, + "total_acs": 10037, + "total_submitted": 17314, "frontend_question_id": 2065, "is_new_question": false }, @@ -5167,8 +5535,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": 13324, - "total_submitted": 26978, + "total_acs": 13754, + "total_submitted": 27835, "frontend_question_id": 2064, "is_new_question": false }, @@ -5190,8 +5558,8 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 15193, - "total_submitted": 27786, + "total_acs": 15662, + "total_submitted": 28667, "frontend_question_id": 2063, "is_new_question": false }, @@ -5213,8 +5581,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 18623, - "total_submitted": 28306, + "total_acs": 19096, + "total_submitted": 28983, "frontend_question_id": 2062, "is_new_question": false }, @@ -5236,8 +5604,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 3735, - "total_submitted": 4778, + "total_acs": 3869, + "total_submitted": 4943, "frontend_question_id": 2041, "is_new_question": false }, @@ -5259,8 +5627,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": 6751, - "total_submitted": 16664, + "total_acs": 6930, + "total_submitted": 17078, "frontend_question_id": 2060, "is_new_question": false }, @@ -5282,8 +5650,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 10647, - "total_submitted": 22727, + "total_acs": 10810, + "total_submitted": 23019, "frontend_question_id": 2059, "is_new_question": false }, @@ -5305,8 +5673,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": 17103, - "total_submitted": 29738, + "total_acs": 17527, + "total_submitted": 30540, "frontend_question_id": 2058, "is_new_question": false }, @@ -5328,8 +5696,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 27566, - "total_submitted": 38091, + "total_acs": 28227, + "total_submitted": 39086, "frontend_question_id": 2057, "is_new_question": false }, @@ -5351,8 +5719,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": 5239, - "total_submitted": 14529, + "total_acs": 5326, + "total_submitted": 14758, "frontend_question_id": 2071, "is_new_question": false }, @@ -5374,8 +5742,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 9032, - "total_submitted": 18495, + "total_acs": 9252, + "total_submitted": 18925, "frontend_question_id": 2070, "is_new_question": false }, @@ -5397,8 +5765,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 6173, - "total_submitted": 28047, + "total_acs": 6270, + "total_submitted": 28407, "frontend_question_id": 2069, "is_new_question": false }, @@ -5420,8 +5788,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": 19151, - "total_submitted": 29169, + "total_acs": 19674, + "total_submitted": 29988, "frontend_question_id": 2068, "is_new_question": false }, @@ -5443,8 +5811,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 11553, - "total_submitted": 19312, + "total_acs": 12028, + "total_submitted": 20175, "frontend_question_id": 2050, "is_new_question": false }, @@ -5466,8 +5834,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 11323, - "total_submitted": 24174, + "total_acs": 11565, + "total_submitted": 24683, "frontend_question_id": 2049, "is_new_question": false }, @@ -5489,8 +5857,8 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 8948, - "total_submitted": 19171, + "total_acs": 9107, + "total_submitted": 19456, "frontend_question_id": 2048, "is_new_question": false }, @@ -5512,8 +5880,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": 15849, - "total_submitted": 53648, + "total_acs": 16209, + "total_submitted": 54772, "frontend_question_id": 2047, "is_new_question": false }, @@ -5535,8 +5903,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 5499, - "total_submitted": 6427, + "total_acs": 5668, + "total_submitted": 6622, "frontend_question_id": 2026, "is_new_question": false }, @@ -5558,8 +5926,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 6728, - "total_submitted": 17846, + "total_acs": 6880, + "total_submitted": 18188, "frontend_question_id": 2045, "is_new_question": false }, @@ -5581,8 +5949,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": 14792, - "total_submitted": 19917, + "total_acs": 15168, + "total_submitted": 20388, "frontend_question_id": 2044, "is_new_question": false }, @@ -5604,8 +5972,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 13671, - "total_submitted": 20844, + "total_acs": 13896, + "total_submitted": 21174, "frontend_question_id": 2043, "is_new_question": false }, @@ -5627,8 +5995,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": 27298, - "total_submitted": 40738, + "total_acs": 28049, + "total_submitted": 41965, "frontend_question_id": 2042, "is_new_question": false }, @@ -5650,8 +6018,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": 4676, - "total_submitted": 6452, + "total_acs": 4875, + "total_submitted": 6723, "frontend_question_id": 2020, "is_new_question": false }, @@ -5673,8 +6041,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": 2770, - "total_submitted": 4736, + "total_acs": 2834, + "total_submitted": 4819, "frontend_question_id": 2056, "is_new_question": false }, @@ -5696,8 +6064,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 12928, - "total_submitted": 28922, + "total_acs": 13810, + "total_submitted": 30913, "frontend_question_id": 2055, "is_new_question": false }, @@ -5719,8 +6087,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 9619, - "total_submitted": 21919, + "total_acs": 9844, + "total_submitted": 22349, "frontend_question_id": 2054, "is_new_question": false }, @@ -5742,8 +6110,8 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 26612, - "total_submitted": 36679, + "total_acs": 27404, + "total_submitted": 37784, "frontend_question_id": 2053, "is_new_question": false }, @@ -5765,8 +6133,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": 6645, - "total_submitted": 33715, + "total_acs": 6996, + "total_submitted": 36483, "frontend_question_id": 2035, "is_new_question": false }, @@ -5788,8 +6156,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 34395, - "total_submitted": 70536, + "total_acs": 36259, + "total_submitted": 74107, "frontend_question_id": 2034, "is_new_question": false }, @@ -5811,8 +6179,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": 14726, - "total_submitted": 28793, + "total_acs": 15492, + "total_submitted": 30077, "frontend_question_id": 2033, "is_new_question": false }, @@ -5834,8 +6202,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 30197, - "total_submitted": 41425, + "total_acs": 31003, + "total_submitted": 42553, "frontend_question_id": 2032, "is_new_question": false }, @@ -5857,8 +6225,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": 2212, - "total_submitted": 3889, + "total_acs": 2324, + "total_submitted": 4086, "frontend_question_id": 2010, "is_new_question": false }, @@ -5880,8 +6248,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": 4863, - "total_submitted": 12457, + "total_acs": 4952, + "total_submitted": 12728, "frontend_question_id": 2030, "is_new_question": false }, @@ -5903,8 +6271,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 5169, - "total_submitted": 20485, + "total_acs": 5265, + "total_submitted": 20712, "frontend_question_id": 2029, "is_new_question": false }, @@ -5926,8 +6294,8 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 14237, - "total_submitted": 33312, + "total_acs": 14496, + "total_submitted": 33872, "frontend_question_id": 2028, "is_new_question": false }, @@ -5949,8 +6317,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 19864, - "total_submitted": 37075, + "total_acs": 20327, + "total_submitted": 37927, "frontend_question_id": 2027, "is_new_question": false }, @@ -5972,8 +6340,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 329, - "total_submitted": 516, + "total_acs": 333, + "total_submitted": 520, "frontend_question_id": 2005, "is_new_question": false }, @@ -5995,8 +6363,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": 3994, - "total_submitted": 10430, + "total_acs": 4100, + "total_submitted": 10727, "frontend_question_id": 2004, "is_new_question": false }, @@ -6018,8 +6386,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": 7534, - "total_submitted": 15214, + "total_acs": 7773, + "total_submitted": 15661, "frontend_question_id": 2039, "is_new_question": false }, @@ -6041,8 +6409,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": 7266, - "total_submitted": 24472, + "total_acs": 7452, + "total_submitted": 25227, "frontend_question_id": 2040, "is_new_question": false }, @@ -6064,8 +6432,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": 13585, - "total_submitted": 23883, + "total_acs": 14057, + "total_submitted": 24596, "frontend_question_id": 2038, "is_new_question": false }, @@ -6087,8 +6455,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": 27649, - "total_submitted": 33456, + "total_acs": 28873, + "total_submitted": 34944, "frontend_question_id": 2037, "is_new_question": false }, @@ -6110,8 +6478,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": 4569, - "total_submitted": 13539, + "total_acs": 4653, + "total_submitted": 13903, "frontend_question_id": 2019, "is_new_question": false }, @@ -6133,8 +6501,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": 10979, - "total_submitted": 22641, + "total_acs": 11686, + "total_submitted": 24035, "frontend_question_id": 2018, "is_new_question": false }, @@ -6156,8 +6524,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 10983, - "total_submitted": 26134, + "total_acs": 11145, + "total_submitted": 26511, "frontend_question_id": 2017, "is_new_question": false }, @@ -6179,8 +6547,8 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 36266, - "total_submitted": 67208, + "total_acs": 37490, + "total_submitted": 69598, "frontend_question_id": 2016, "is_new_question": false }, @@ -6202,8 +6570,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 3062, - "total_submitted": 6013, + "total_acs": 3178, + "total_submitted": 6238, "frontend_question_id": 1990, "is_new_question": false }, @@ -6225,8 +6593,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": 1185, - "total_submitted": 1969, + "total_acs": 1222, + "total_submitted": 2048, "frontend_question_id": 2015, "is_new_question": false }, @@ -6248,8 +6616,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": 979, - "total_submitted": 1932, + "total_acs": 995, + "total_submitted": 1960, "frontend_question_id": 1999, "is_new_question": false }, @@ -6271,8 +6639,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 4386, - "total_submitted": 7951, + "total_acs": 4470, + "total_submitted": 8090, "frontend_question_id": 2014, "is_new_question": false }, @@ -6294,8 +6662,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 27004, - "total_submitted": 55727, + "total_acs": 28651, + "total_submitted": 58666, "frontend_question_id": 2013, "is_new_question": false }, @@ -6317,8 +6685,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 14881, - "total_submitted": 32226, + "total_acs": 15079, + "total_submitted": 32641, "frontend_question_id": 2012, "is_new_question": false }, @@ -6340,8 +6708,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": 116614, - "total_submitted": 130862, + "total_acs": 121379, + "total_submitted": 136223, "frontend_question_id": 2011, "is_new_question": false }, @@ -6363,8 +6731,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 4327, - "total_submitted": 6262, + "total_acs": 4617, + "total_submitted": 6662, "frontend_question_id": 1988, "is_new_question": false }, @@ -6386,8 +6754,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": 5437, - "total_submitted": 17161, + "total_acs": 5575, + "total_submitted": 17497, "frontend_question_id": 2025, "is_new_question": false }, @@ -6409,8 +6777,8 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 15857, - "total_submitted": 27308, + "total_acs": 16396, + "total_submitted": 28137, "frontend_question_id": 2024, "is_new_question": false }, @@ -6432,8 +6800,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": 20445, - "total_submitted": 28095, + "total_acs": 21036, + "total_submitted": 28878, "frontend_question_id": 2023, "is_new_question": false }, @@ -6455,8 +6823,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 36333, - "total_submitted": 61738, + "total_acs": 37564, + "total_submitted": 64000, "frontend_question_id": 2022, "is_new_question": false }, @@ -6478,8 +6846,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": 5192, - "total_submitted": 12093, + "total_acs": 5266, + "total_submitted": 12243, "frontend_question_id": 2003, "is_new_question": false }, @@ -6501,8 +6869,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": 12545, - "total_submitted": 23676, + "total_acs": 12789, + "total_submitted": 24088, "frontend_question_id": 2002, "is_new_question": false }, @@ -6524,8 +6892,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 17072, - "total_submitted": 39100, + "total_acs": 17301, + "total_submitted": 39552, "frontend_question_id": 2001, "is_new_question": false }, @@ -6547,8 +6915,8 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 37851, - "total_submitted": 48655, + "total_acs": 38798, + "total_submitted": 49983, "frontend_question_id": 2000, "is_new_question": false }, @@ -6570,8 +6938,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 5691, - "total_submitted": 11339, + "total_acs": 5856, + "total_submitted": 11653, "frontend_question_id": 1978, "is_new_question": false }, @@ -6593,8 +6961,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": 6186, - "total_submitted": 8224, + "total_acs": 6283, + "total_submitted": 8354, "frontend_question_id": 1973, "is_new_question": false }, @@ -6616,8 +6984,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 5063, - "total_submitted": 11091, + "total_acs": 5179, + "total_submitted": 11354, "frontend_question_id": 1998, "is_new_question": false }, @@ -6639,8 +7007,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": 6068, - "total_submitted": 17061, + "total_acs": 6143, + "total_submitted": 17257, "frontend_question_id": 1997, "is_new_question": false }, @@ -6662,8 +7030,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": 20787, - "total_submitted": 58625, + "total_acs": 21970, + "total_submitted": 60960, "frontend_question_id": 1996, "is_new_question": false }, @@ -6685,8 +7053,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 21191, - "total_submitted": 36347, + "total_acs": 21640, + "total_submitted": 37092, "frontend_question_id": 1995, "is_new_question": false }, @@ -6708,8 +7076,8 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 108333, - "total_submitted": 214082, + "total_acs": 112889, + "total_submitted": 223128, "frontend_question_id": 1971, "is_new_question": false }, @@ -6731,8 +7099,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": 4254, - "total_submitted": 7876, + "total_acs": 4492, + "total_submitted": 8298, "frontend_question_id": 1972, "is_new_question": false }, @@ -6754,8 +7122,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": 7366, - "total_submitted": 16117, + "total_acs": 7530, + "total_submitted": 16473, "frontend_question_id": 2009, "is_new_question": false }, @@ -6777,8 +7145,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 14172, - "total_submitted": 33105, + "total_acs": 14569, + "total_submitted": 34058, "frontend_question_id": 2008, "is_new_question": false }, @@ -6800,8 +7168,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 46584, - "total_submitted": 121226, + "total_acs": 47358, + "total_submitted": 123316, "frontend_question_id": 2007, "is_new_question": false }, @@ -6823,8 +7191,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": 56603, - "total_submitted": 68662, + "total_acs": 58580, + "total_submitted": 71158, "frontend_question_id": 2006, "is_new_question": false }, @@ -6846,8 +7214,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 7458, - "total_submitted": 14254, + "total_acs": 7590, + "total_submitted": 14526, "frontend_question_id": 1987, "is_new_question": false }, @@ -6869,8 +7237,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": 13336, - "total_submitted": 41265, + "total_acs": 13699, + "total_submitted": 42204, "frontend_question_id": 1986, "is_new_question": false }, @@ -6892,8 +7260,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": 32267, - "total_submitted": 72058, + "total_acs": 33034, + "total_submitted": 73774, "frontend_question_id": 1985, "is_new_question": false }, @@ -6915,8 +7283,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": 25248, - "total_submitted": 47266, + "total_acs": 25871, + "total_submitted": 48497, "frontend_question_id": 1984, "is_new_question": false }, @@ -6938,8 +7306,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": 1625, - "total_submitted": 2452, + "total_acs": 1698, + "total_submitted": 2561, "frontend_question_id": 1966, "is_new_question": false }, @@ -6961,8 +7329,8 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 24795, - "total_submitted": 30396, + "total_acs": 27816, + "total_submitted": 34089, "frontend_question_id": 1965, "is_new_question": false }, @@ -6984,8 +7352,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 3296, - "total_submitted": 6761, + "total_acs": 3340, + "total_submitted": 6867, "frontend_question_id": 1982, "is_new_question": false }, @@ -7007,8 +7375,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": 16082, - "total_submitted": 49445, + "total_acs": 16409, + "total_submitted": 50470, "frontend_question_id": 1981, "is_new_question": false }, @@ -7030,8 +7398,8 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 25536, - "total_submitted": 40221, + "total_acs": 26046, + "total_submitted": 41011, "frontend_question_id": 1980, "is_new_question": false }, @@ -7053,8 +7421,8 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 46571, - "total_submitted": 60032, + "total_acs": 47896, + "total_submitted": 61799, "frontend_question_id": 1979, "is_new_question": false }, @@ -7076,8 +7444,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 3870, - "total_submitted": 11343, + "total_acs": 3943, + "total_submitted": 11527, "frontend_question_id": 1994, "is_new_question": false }, @@ -7099,8 +7467,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 7502, - "total_submitted": 17535, + "total_acs": 7631, + "total_submitted": 17822, "frontend_question_id": 1993, "is_new_question": false }, @@ -7122,8 +7490,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 15136, - "total_submitted": 22365, + "total_acs": 15540, + "total_submitted": 22911, "frontend_question_id": 1992, "is_new_question": false }, @@ -7145,8 +7513,8 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 32657, - "total_submitted": 49013, + "total_acs": 34257, + "total_submitted": 51183, "frontend_question_id": 1991, "is_new_question": false }, @@ -7168,8 +7536,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": 9015, - "total_submitted": 18295, + "total_acs": 9171, + "total_submitted": 18595, "frontend_question_id": 1970, "is_new_question": false }, @@ -7191,8 +7559,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": 7321, - "total_submitted": 22202, + "total_acs": 7426, + "total_submitted": 22439, "frontend_question_id": 1969, "is_new_question": false }, @@ -7214,8 +7582,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": 31717, - "total_submitted": 39773, + "total_acs": 32420, + "total_submitted": 40582, "frontend_question_id": 1967, "is_new_question": false }, @@ -7237,8 +7605,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": 4693, - "total_submitted": 6477, + "total_acs": 4919, + "total_submitted": 6777, "frontend_question_id": 1951, "is_new_question": false }, @@ -7260,8 +7628,8 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 5630, - "total_submitted": 9563, + "total_acs": 5870, + "total_submitted": 9978, "frontend_question_id": 1949, "is_new_question": false }, @@ -7283,8 +7651,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": 8719, - "total_submitted": 18936, + "total_acs": 8819, + "total_submitted": 19116, "frontend_question_id": 1964, "is_new_question": false }, @@ -7306,8 +7674,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": 29871, - "total_submitted": 44061, + "total_acs": 30610, + "total_submitted": 45099, "frontend_question_id": 1963, "is_new_question": false }, @@ -7329,8 +7697,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 19409, - "total_submitted": 34003, + "total_acs": 20042, + "total_submitted": 34847, "frontend_question_id": 1962, "is_new_question": false }, @@ -7352,8 +7720,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": 27368, - "total_submitted": 50322, + "total_acs": 27846, + "total_submitted": 51199, "frontend_question_id": 1961, "is_new_question": false }, @@ -7375,8 +7743,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 5639, - "total_submitted": 9185, + "total_acs": 5781, + "total_submitted": 9432, "frontend_question_id": 1939, "is_new_question": false }, @@ -7398,8 +7766,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 3062, - "total_submitted": 13972, + "total_acs": 3153, + "total_submitted": 14346, "frontend_question_id": 1977, "is_new_question": false }, @@ -7421,8 +7789,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": 16104, - "total_submitted": 48974, + "total_acs": 16594, + "total_submitted": 50636, "frontend_question_id": 1976, "is_new_question": false }, @@ -7444,8 +7812,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 10668, - "total_submitted": 23637, + "total_acs": 10814, + "total_submitted": 23919, "frontend_question_id": 1975, "is_new_question": false }, @@ -7467,8 +7835,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": 21721, - "total_submitted": 30416, + "total_acs": 22177, + "total_submitted": 31043, "frontend_question_id": 1974, "is_new_question": false }, @@ -7490,8 +7858,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 7375, - "total_submitted": 9530, + "total_acs": 7546, + "total_submitted": 9759, "frontend_question_id": 1934, "is_new_question": false }, @@ -7513,8 +7881,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 7792, - "total_submitted": 15327, + "total_acs": 7887, + "total_submitted": 15484, "frontend_question_id": 1955, "is_new_question": false }, @@ -7536,8 +7904,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": 17449, - "total_submitted": 35762, + "total_acs": 17739, + "total_submitted": 36266, "frontend_question_id": 1968, "is_new_question": false }, @@ -7559,8 +7927,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": 15470, - "total_submitted": 40748, + "total_acs": 15652, + "total_submitted": 41146, "frontend_question_id": 1953, "is_new_question": false }, @@ -7582,8 +7950,8 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 28425, - "total_submitted": 50178, + "total_acs": 28907, + "total_submitted": 50995, "frontend_question_id": 1952, "is_new_question": false }, @@ -7605,8 +7973,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": 1050, - "total_submitted": 2034, + "total_acs": 1088, + "total_submitted": 2105, "frontend_question_id": 2052, "is_new_question": false }, @@ -7628,8 +7996,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": 5625, - "total_submitted": 13496, + "total_acs": 5700, + "total_submitted": 13664, "frontend_question_id": 1959, "is_new_question": false }, @@ -7651,8 +8019,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 7320, - "total_submitted": 16708, + "total_acs": 7384, + "total_submitted": 16826, "frontend_question_id": 1958, "is_new_question": false }, @@ -7674,8 +8042,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 5420, - "total_submitted": 9186, + "total_acs": 5519, + "total_submitted": 9372, "frontend_question_id": 1948, "is_new_question": false }, @@ -7697,8 +8065,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 15160, - "total_submitted": 25153, + "total_acs": 15463, + "total_submitted": 25567, "frontend_question_id": 1947, "is_new_question": false }, @@ -7720,8 +8088,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 14838, - "total_submitted": 43375, + "total_acs": 14959, + "total_submitted": 43668, "frontend_question_id": 1946, "is_new_question": false }, @@ -7743,8 +8111,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": 27918, - "total_submitted": 45597, + "total_acs": 28473, + "total_submitted": 46543, "frontend_question_id": 1945, "is_new_question": false }, @@ -7766,8 +8134,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 2921, - "total_submitted": 4636, + "total_acs": 2978, + "total_submitted": 4732, "frontend_question_id": 2021, "is_new_question": false }, @@ -7789,8 +8157,8 @@ "question__title": "Erect the Fence II", "question__title_slug": "erect-the-fence-ii", "question__hide": false, - "total_acs": 454, - "total_submitted": 837, + "total_acs": 457, + "total_submitted": 841, "frontend_question_id": 1924, "is_new_question": false }, @@ -7812,8 +8180,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": 502, - "total_submitted": 1098, + "total_acs": 509, + "total_submitted": 1115, "frontend_question_id": 1956, "is_new_question": false }, @@ -7835,8 +8203,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": 1813, - "total_submitted": 3596, + "total_acs": 1876, + "total_submitted": 3747, "frontend_question_id": 1950, "is_new_question": false }, @@ -7858,8 +8226,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 3760, - "total_submitted": 4751, + "total_acs": 3811, + "total_submitted": 4810, "frontend_question_id": 1940, "is_new_question": false }, @@ -7881,8 +8249,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": 2196, - "total_submitted": 4348, + "total_acs": 2225, + "total_submitted": 4406, "frontend_question_id": 1933, "is_new_question": false }, @@ -7904,8 +8272,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 2324, - "total_submitted": 4383, + "total_acs": 2374, + "total_submitted": 4486, "frontend_question_id": 1918, "is_new_question": false }, @@ -7927,8 +8295,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 3493, - "total_submitted": 8923, + "total_acs": 3527, + "total_submitted": 9010, "frontend_question_id": 1938, "is_new_question": false }, @@ -7950,8 +8318,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 42952, - "total_submitted": 119874, + "total_acs": 44413, + "total_submitted": 123723, "frontend_question_id": 1937, "is_new_question": false }, @@ -7973,8 +8341,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 19552, - "total_submitted": 45932, + "total_acs": 19775, + "total_submitted": 46447, "frontend_question_id": 1936, "is_new_question": false }, @@ -7996,8 +8364,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 320, - "total_submitted": 905, + "total_acs": 381, + "total_submitted": 1022, "frontend_question_id": 2307, "is_new_question": false }, @@ -8019,8 +8387,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 2955, - "total_submitted": 6894, + "total_acs": 3015, + "total_submitted": 7019, "frontend_question_id": 1919, "is_new_question": false }, @@ -8042,8 +8410,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 3733, - "total_submitted": 12444, + "total_acs": 3809, + "total_submitted": 12720, "frontend_question_id": 1917, "is_new_question": false }, @@ -8065,8 +8433,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 1024, - "total_submitted": 1767, + "total_acs": 1039, + "total_submitted": 1794, "frontend_question_id": 1908, "is_new_question": false }, @@ -8088,8 +8456,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": 6551, - "total_submitted": 11450, + "total_acs": 6648, + "total_submitted": 11628, "frontend_question_id": 1931, "is_new_question": false }, @@ -8111,8 +8479,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 4851, - "total_submitted": 13822, + "total_acs": 4927, + "total_submitted": 14012, "frontend_question_id": 1932, "is_new_question": false }, @@ -8134,8 +8502,8 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 16528, - "total_submitted": 32183, + "total_acs": 16712, + "total_submitted": 32507, "frontend_question_id": 1930, "is_new_question": false }, @@ -8157,8 +8525,8 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 207351, - "total_submitted": 226473, + "total_acs": 215700, + "total_submitted": 235659, "frontend_question_id": 1929, "is_new_question": false }, @@ -8180,8 +8548,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 5894, - "total_submitted": 9116, + "total_acs": 6027, + "total_submitted": 9361, "frontend_question_id": 1907, "is_new_question": false }, @@ -8203,8 +8571,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 425, - "total_submitted": 662, + "total_acs": 513, + "total_submitted": 817, "frontend_question_id": 2297, "is_new_question": false }, @@ -8226,8 +8594,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 8042, - "total_submitted": 17029, + "total_acs": 8156, + "total_submitted": 17238, "frontend_question_id": 1943, "is_new_question": false }, @@ -8249,8 +8617,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": 11592, - "total_submitted": 29426, + "total_acs": 11716, + "total_submitted": 29700, "frontend_question_id": 1942, "is_new_question": false }, @@ -8272,8 +8640,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": 38914, - "total_submitted": 50468, + "total_acs": 39776, + "total_submitted": 51629, "frontend_question_id": 1941, "is_new_question": false }, @@ -8295,8 +8663,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 1477, - "total_submitted": 3268, + "total_acs": 1497, + "total_submitted": 3311, "frontend_question_id": 1902, "is_new_question": false }, @@ -8318,8 +8686,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 5048, - "total_submitted": 17864, + "total_acs": 5107, + "total_submitted": 18123, "frontend_question_id": 1923, "is_new_question": false }, @@ -8341,8 +8709,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 16177, - "total_submitted": 42310, + "total_acs": 16467, + "total_submitted": 43087, "frontend_question_id": 1922, "is_new_question": false }, @@ -8364,8 +8732,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 16910, - "total_submitted": 44801, + "total_acs": 17171, + "total_submitted": 45429, "frontend_question_id": 1921, "is_new_question": false }, @@ -8387,8 +8755,8 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 178300, - "total_submitted": 194797, + "total_acs": 184685, + "total_submitted": 201738, "frontend_question_id": 1920, "is_new_question": false }, @@ -8410,8 +8778,8 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 22857, - "total_submitted": 42525, + "total_acs": 23619, + "total_submitted": 44012, "frontend_question_id": 1901, "is_new_question": false }, @@ -8433,8 +8801,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 3927, - "total_submitted": 8783, + "total_acs": 4020, + "total_submitted": 9010, "frontend_question_id": 1892, "is_new_question": false }, @@ -8456,8 +8824,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 42972, - "total_submitted": 89306, + "total_acs": 43712, + "total_submitted": 90953, "frontend_question_id": 1891, "is_new_question": false }, @@ -8479,8 +8847,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 9016, - "total_submitted": 20498, + "total_acs": 9113, + "total_submitted": 20680, "frontend_question_id": 1915, "is_new_question": false }, @@ -8502,8 +8870,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 9700, - "total_submitted": 20478, + "total_acs": 9760, + "total_submitted": 20582, "frontend_question_id": 1914, "is_new_question": false }, @@ -8525,8 +8893,8 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 55100, - "total_submitted": 67791, + "total_acs": 56338, + "total_submitted": 69311, "frontend_question_id": 1913, "is_new_question": false }, @@ -8548,8 +8916,8 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 18727, - "total_submitted": 22781, + "total_acs": 20535, + "total_submitted": 25008, "frontend_question_id": 1890, "is_new_question": false }, @@ -8571,8 +8939,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": 11041, - "total_submitted": 29376, + "total_acs": 11256, + "total_submitted": 29955, "frontend_question_id": 1928, "is_new_question": false }, @@ -8594,8 +8962,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 6955, - "total_submitted": 14714, + "total_acs": 7027, + "total_submitted": 14905, "frontend_question_id": 1927, "is_new_question": false }, @@ -8617,8 +8985,8 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 22348, - "total_submitted": 53343, + "total_acs": 23258, + "total_submitted": 55168, "frontend_question_id": 1926, "is_new_question": false }, @@ -8640,8 +9008,8 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 23322, - "total_submitted": 34433, + "total_acs": 23721, + "total_submitted": 35014, "frontend_question_id": 1925, "is_new_question": false }, @@ -8663,8 +9031,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 2325, - "total_submitted": 3977, + "total_acs": 2400, + "total_submitted": 4096, "frontend_question_id": 1885, "is_new_question": false }, @@ -8686,8 +9054,8 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 39107, - "total_submitted": 58323, + "total_acs": 40893, + "total_submitted": 60842, "frontend_question_id": 1905, "is_new_question": false }, @@ -8709,8 +9077,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 8194, - "total_submitted": 18757, + "total_acs": 8297, + "total_submitted": 18972, "frontend_question_id": 1906, "is_new_question": false }, @@ -8732,8 +9100,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": 16742, - "total_submitted": 36074, + "total_acs": 16902, + "total_submitted": 36453, "frontend_question_id": 1904, "is_new_question": false }, @@ -8755,8 +9123,8 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 34856, - "total_submitted": 61828, + "total_acs": 35616, + "total_submitted": 63114, "frontend_question_id": 1903, "is_new_question": false }, @@ -8778,8 +9146,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": 22936, - "total_submitted": 32726, + "total_acs": 23633, + "total_submitted": 33652, "frontend_question_id": 1884, "is_new_question": false }, @@ -8801,8 +9169,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 6100, - "total_submitted": 8068, + "total_acs": 6230, + "total_submitted": 8235, "frontend_question_id": 1875, "is_new_question": false }, @@ -8824,8 +9192,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 12629, - "total_submitted": 13897, + "total_acs": 12845, + "total_submitted": 14139, "frontend_question_id": 1874, "is_new_question": false }, @@ -8847,8 +9215,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": 4062, - "total_submitted": 7865, + "total_acs": 4097, + "total_submitted": 7917, "frontend_question_id": 1900, "is_new_question": false }, @@ -8870,8 +9238,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 15141, - "total_submitted": 39810, + "total_acs": 15539, + "total_submitted": 40576, "frontend_question_id": 1898, "is_new_question": false }, @@ -8893,8 +9261,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 16285, - "total_submitted": 26148, + "total_acs": 17017, + "total_submitted": 27212, "frontend_question_id": 1899, "is_new_question": false }, @@ -8916,8 +9284,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": 23250, - "total_submitted": 38706, + "total_acs": 23487, + "total_submitted": 39124, "frontend_question_id": 1897, "is_new_question": false }, @@ -8939,8 +9307,8 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 44895, - "total_submitted": 58980, + "total_acs": 50054, + "total_submitted": 68421, "frontend_question_id": 1873, "is_new_question": false }, @@ -8962,8 +9330,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 4110, - "total_submitted": 9943, + "total_acs": 4158, + "total_submitted": 10059, "frontend_question_id": 1912, "is_new_question": false }, @@ -8985,8 +9353,8 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 17342, - "total_submitted": 29312, + "total_acs": 17771, + "total_submitted": 30048, "frontend_question_id": 1911, "is_new_question": false }, @@ -9008,8 +9376,8 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 30770, - "total_submitted": 42456, + "total_acs": 31946, + "total_submitted": 43956, "frontend_question_id": 1910, "is_new_question": false }, @@ -9031,8 +9399,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": 29695, - "total_submitted": 111243, + "total_acs": 30595, + "total_submitted": 114970, "frontend_question_id": 1909, "is_new_question": false }, @@ -9054,8 +9422,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": 21867, - "total_submitted": 37789, + "total_acs": 22211, + "total_submitted": 38367, "frontend_question_id": 1868, "is_new_question": false }, @@ -9077,8 +9445,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 8122, - "total_submitted": 26728, + "total_acs": 8200, + "total_submitted": 26913, "frontend_question_id": 1889, "is_new_question": false }, @@ -9100,8 +9468,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": 12930, - "total_submitted": 34717, + "total_acs": 13114, + "total_submitted": 35187, "frontend_question_id": 1888, "is_new_question": false }, @@ -9123,8 +9491,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": 17507, - "total_submitted": 28271, + "total_acs": 17706, + "total_submitted": 28589, "frontend_question_id": 1887, "is_new_question": false }, @@ -9146,8 +9514,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": 34237, - "total_submitted": 61735, + "total_acs": 35220, + "total_submitted": 63546, "frontend_question_id": 1886, "is_new_question": false }, @@ -9169,8 +9537,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 8146, - "total_submitted": 10831, + "total_acs": 8447, + "total_submitted": 11228, "frontend_question_id": 1867, "is_new_question": false }, @@ -9192,8 +9560,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": 4835, - "total_submitted": 12544, + "total_acs": 4893, + "total_submitted": 12660, "frontend_question_id": 1883, "is_new_question": false }, @@ -9215,8 +9583,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 19068, - "total_submitted": 49601, + "total_acs": 19538, + "total_submitted": 50633, "frontend_question_id": 1882, "is_new_question": false }, @@ -9238,8 +9606,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 18923, - "total_submitted": 52465, + "total_acs": 19133, + "total_submitted": 52984, "frontend_question_id": 1881, "is_new_question": false }, @@ -9261,8 +9629,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": 41581, - "total_submitted": 56606, + "total_acs": 42032, + "total_submitted": 57208, "frontend_question_id": 1880, "is_new_question": false }, @@ -9284,8 +9652,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 4335, - "total_submitted": 6575, + "total_acs": 4436, + "total_submitted": 6747, "frontend_question_id": 1858, "is_new_question": false }, @@ -9307,8 +9675,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": 2746, - "total_submitted": 5086, + "total_acs": 2776, + "total_submitted": 5139, "frontend_question_id": 1896, "is_new_question": false }, @@ -9330,8 +9698,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": 668, - "total_submitted": 1308, + "total_acs": 691, + "total_submitted": 1372, "frontend_question_id": 2247, "is_new_question": false }, @@ -9353,8 +9721,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": 20643, - "total_submitted": 48589, + "total_acs": 21187, + "total_submitted": 49605, "frontend_question_id": 1894, "is_new_question": false }, @@ -9376,8 +9744,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": 22910, - "total_submitted": 44878, + "total_acs": 23297, + "total_submitted": 45650, "frontend_question_id": 1893, "is_new_question": false }, @@ -9399,8 +9767,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 7425, - "total_submitted": 8470, + "total_acs": 7592, + "total_submitted": 8663, "frontend_question_id": 1853, "is_new_question": false }, @@ -9422,8 +9790,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 4101, - "total_submitted": 5675, + "total_acs": 4168, + "total_submitted": 5776, "frontend_question_id": 1852, "is_new_question": false }, @@ -9445,8 +9813,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 5797, - "total_submitted": 11115, + "total_acs": 5915, + "total_submitted": 11325, "frontend_question_id": 1872, "is_new_question": false }, @@ -9468,8 +9836,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 24592, - "total_submitted": 98195, + "total_acs": 25728, + "total_submitted": 102107, "frontend_question_id": 1871, "is_new_question": false }, @@ -9491,8 +9859,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 20555, - "total_submitted": 56075, + "total_acs": 21041, + "total_submitted": 57283, "frontend_question_id": 1870, "is_new_question": false }, @@ -9514,8 +9882,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": 30331, - "total_submitted": 50234, + "total_acs": 30671, + "total_submitted": 50831, "frontend_question_id": 1869, "is_new_question": false }, @@ -9537,8 +9905,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 6033, - "total_submitted": 12605, + "total_acs": 6191, + "total_submitted": 12916, "frontend_question_id": 1843, "is_new_question": false }, @@ -9560,8 +9928,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 2604, - "total_submitted": 4812, + "total_acs": 2769, + "total_submitted": 5144, "frontend_question_id": 1842, "is_new_question": false }, @@ -9583,8 +9951,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": 8511, - "total_submitted": 15377, + "total_acs": 8664, + "total_submitted": 15624, "frontend_question_id": 1866, "is_new_question": false }, @@ -9606,8 +9974,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 16391, - "total_submitted": 33010, + "total_acs": 16667, + "total_submitted": 33450, "frontend_question_id": 1865, "is_new_question": false }, @@ -9629,8 +9997,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": 14452, - "total_submitted": 36696, + "total_acs": 14731, + "total_submitted": 37272, "frontend_question_id": 1864, "is_new_question": false }, @@ -9652,8 +10020,8 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 36304, - "total_submitted": 46153, + "total_acs": 37126, + "total_submitted": 47150, "frontend_question_id": 1863, "is_new_question": false }, @@ -9675,8 +10043,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": 3033, - "total_submitted": 4404, + "total_acs": 3115, + "total_submitted": 4543, "frontend_question_id": 2046, "is_new_question": false }, @@ -9698,8 +10066,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 7267, - "total_submitted": 12661, + "total_acs": 7477, + "total_submitted": 13047, "frontend_question_id": 1841, "is_new_question": false }, @@ -9721,8 +10089,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": 10015, - "total_submitted": 21844, + "total_acs": 10201, + "total_submitted": 22199, "frontend_question_id": 1878, "is_new_question": false }, @@ -9744,8 +10112,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 8234, - "total_submitted": 19147, + "total_acs": 8374, + "total_submitted": 19385, "frontend_question_id": 1879, "is_new_question": false }, @@ -9767,8 +10135,8 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 52273, - "total_submitted": 64832, + "total_acs": 53242, + "total_submitted": 66064, "frontend_question_id": 1877, "is_new_question": false }, @@ -9790,8 +10158,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": 47106, - "total_submitted": 67473, + "total_acs": 48325, + "total_submitted": 69180, "frontend_question_id": 1876, "is_new_question": false }, @@ -9813,8 +10181,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": 11775, - "total_submitted": 29504, + "total_acs": 11968, + "total_submitted": 29948, "frontend_question_id": 1857, "is_new_question": false }, @@ -9836,8 +10204,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 14359, - "total_submitted": 39418, + "total_acs": 14922, + "total_submitted": 40687, "frontend_question_id": 1856, "is_new_question": false }, @@ -9859,8 +10227,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": 28243, - "total_submitted": 54443, + "total_acs": 29025, + "total_submitted": 55844, "frontend_question_id": 1855, "is_new_question": false }, @@ -9882,8 +10250,8 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 32811, - "total_submitted": 55527, + "total_acs": 33570, + "total_submitted": 56666, "frontend_question_id": 1854, "is_new_question": false }, @@ -9905,8 +10273,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": 14694, - "total_submitted": 21285, + "total_acs": 15227, + "total_submitted": 21986, "frontend_question_id": 1836, "is_new_question": false }, @@ -9928,8 +10296,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 8410, - "total_submitted": 10105, + "total_acs": 8658, + "total_submitted": 10402, "frontend_question_id": 1831, "is_new_question": false }, @@ -9951,8 +10319,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 2832, - "total_submitted": 5740, + "total_acs": 2874, + "total_submitted": 5825, "frontend_question_id": 1826, "is_new_question": false }, @@ -9974,8 +10342,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": 1192, - "total_submitted": 2234, + "total_acs": 1216, + "total_submitted": 2270, "frontend_question_id": 1989, "is_new_question": false }, @@ -9997,8 +10365,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": 14628, - "total_submitted": 20373, + "total_acs": 14768, + "total_submitted": 20585, "frontend_question_id": 1850, "is_new_question": false }, @@ -10020,8 +10388,8 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 8432, - "total_submitted": 18117, + "total_acs": 8805, + "total_submitted": 18916, "frontend_question_id": 1851, "is_new_question": false }, @@ -10043,8 +10411,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": 15095, - "total_submitted": 47729, + "total_acs": 15283, + "total_submitted": 48247, "frontend_question_id": 1849, "is_new_question": false }, @@ -10066,8 +10434,8 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 26440, - "total_submitted": 44448, + "total_acs": 26780, + "total_submitted": 45082, "frontend_question_id": 1848, "is_new_question": false }, @@ -10089,8 +10457,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": 10685, - "total_submitted": 11921, + "total_acs": 10888, + "total_submitted": 12155, "frontend_question_id": 1821, "is_new_question": false }, @@ -10112,8 +10480,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 28897, - "total_submitted": 44565, + "total_acs": 29419, + "total_submitted": 45340, "frontend_question_id": 1861, "is_new_question": false }, @@ -10135,8 +10503,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 12829, - "total_submitted": 17997, + "total_acs": 12946, + "total_submitted": 18171, "frontend_question_id": 1860, "is_new_question": false }, @@ -10158,8 +10526,8 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 71454, - "total_submitted": 84654, + "total_acs": 73272, + "total_submitted": 86832, "frontend_question_id": 1859, "is_new_question": false }, @@ -10181,8 +10549,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 2568, - "total_submitted": 5297, + "total_acs": 2806, + "total_submitted": 5793, "frontend_question_id": 1820, "is_new_question": false }, @@ -10204,8 +10572,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 5213, - "total_submitted": 14830, + "total_acs": 5258, + "total_submitted": 14918, "frontend_question_id": 1840, "is_new_question": false }, @@ -10227,8 +10595,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": 19354, - "total_submitted": 40220, + "total_acs": 19622, + "total_submitted": 40790, "frontend_question_id": 1839, "is_new_question": false }, @@ -10250,8 +10618,8 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 24566, - "total_submitted": 65450, + "total_acs": 25319, + "total_submitted": 67251, "frontend_question_id": 1838, "is_new_question": false }, @@ -10273,8 +10641,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 29521, - "total_submitted": 38549, + "total_acs": 29848, + "total_submitted": 38958, "frontend_question_id": 1837, "is_new_question": false }, @@ -10296,8 +10664,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 9521, - "total_submitted": 14713, + "total_acs": 9766, + "total_submitted": 15077, "frontend_question_id": 1811, "is_new_question": false }, @@ -10319,8 +10687,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": 11046, - "total_submitted": 18652, + "total_acs": 11267, + "total_submitted": 18959, "frontend_question_id": 1835, "is_new_question": false }, @@ -10336,14 +10704,14 @@ { "stat": { "question_id": 1962, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "single-threaded-cpu", + "question__article__has_video_solution": false, "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 38144, - "total_submitted": 91904, + "total_acs": 38772, + "total_submitted": 93293, "frontend_question_id": 1834, "is_new_question": false }, @@ -10365,8 +10733,8 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 33240, - "total_submitted": 51038, + "total_acs": 33603, + "total_submitted": 51561, "frontend_question_id": 1833, "is_new_question": false }, @@ -10388,8 +10756,8 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 91353, - "total_submitted": 112259, + "total_acs": 93326, + "total_submitted": 114719, "frontend_question_id": 1832, "is_new_question": false }, @@ -10411,8 +10779,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": 1941, - "total_submitted": 3581, + "total_acs": 1978, + "total_submitted": 3649, "frontend_question_id": 1810, "is_new_question": false }, @@ -10434,8 +10802,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 9768, - "total_submitted": 16316, + "total_acs": 9948, + "total_submitted": 16641, "frontend_question_id": 1809, "is_new_question": false }, @@ -10457,8 +10825,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 5774, - "total_submitted": 16904, + "total_acs": 5866, + "total_submitted": 17117, "frontend_question_id": 1847, "is_new_question": false }, @@ -10480,8 +10848,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 14675, - "total_submitted": 25187, + "total_acs": 14882, + "total_submitted": 25525, "frontend_question_id": 1846, "is_new_question": false }, @@ -10503,8 +10871,8 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 20955, - "total_submitted": 33553, + "total_acs": 21475, + "total_submitted": 34229, "frontend_question_id": 1845, "is_new_question": false }, @@ -10526,8 +10894,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 43129, - "total_submitted": 54038, + "total_acs": 43903, + "total_submitted": 55035, "frontend_question_id": 1844, "is_new_question": false }, @@ -10549,8 +10917,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 7702, - "total_submitted": 22553, + "total_acs": 7873, + "total_submitted": 23035, "frontend_question_id": 1825, "is_new_question": false }, @@ -10572,8 +10940,8 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 17108, - "total_submitted": 34643, + "total_acs": 17516, + "total_submitted": 35427, "frontend_question_id": 1824, "is_new_question": false }, @@ -10595,8 +10963,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": 51998, - "total_submitted": 67742, + "total_acs": 53800, + "total_submitted": 69960, "frontend_question_id": 1823, "is_new_question": false }, @@ -10618,8 +10986,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": 110481, - "total_submitted": 164828, + "total_acs": 113466, + "total_submitted": 169375, "frontend_question_id": 1822, "is_new_question": false }, @@ -10641,8 +11009,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 8562, - "total_submitted": 14357, + "total_acs": 8752, + "total_submitted": 14646, "frontend_question_id": 1804, "is_new_question": false }, @@ -10664,8 +11032,8 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 27773, - "total_submitted": 30653, + "total_acs": 30633, + "total_submitted": 33756, "frontend_question_id": 1795, "is_new_question": false }, @@ -10687,8 +11055,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 5870, - "total_submitted": 15766, + "total_acs": 5930, + "total_submitted": 15892, "frontend_question_id": 1819, "is_new_question": false }, @@ -10710,8 +11078,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 15647, - "total_submitted": 52570, + "total_acs": 16096, + "total_submitted": 53970, "frontend_question_id": 1818, "is_new_question": false }, @@ -10733,8 +11101,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 35893, - "total_submitted": 44504, + "total_acs": 36502, + "total_submitted": 45252, "frontend_question_id": 1817, "is_new_question": false }, @@ -10756,8 +11124,8 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 66552, - "total_submitted": 81683, + "total_acs": 68002, + "total_submitted": 83462, "frontend_question_id": 1816, "is_new_question": false }, @@ -10779,8 +11147,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": 1321, - "total_submitted": 2025, + "total_acs": 1325, + "total_submitted": 2032, "frontend_question_id": 1794, "is_new_question": false }, @@ -10802,8 +11170,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 11246, - "total_submitted": 14125, + "total_acs": 11569, + "total_submitted": 14532, "frontend_question_id": 1789, "is_new_question": false }, @@ -10825,8 +11193,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": 2323, - "total_submitted": 4812, + "total_acs": 2342, + "total_submitted": 4848, "frontend_question_id": 1830, "is_new_question": false }, @@ -10848,8 +11216,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 17059, - "total_submitted": 22358, + "total_acs": 17439, + "total_submitted": 22804, "frontend_question_id": 1829, "is_new_question": false }, @@ -10871,8 +11239,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": 42177, - "total_submitted": 48821, + "total_acs": 42957, + "total_submitted": 49682, "frontend_question_id": 1828, "is_new_question": false }, @@ -10894,8 +11262,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": 45750, - "total_submitted": 58496, + "total_acs": 46696, + "total_submitted": 59711, "frontend_question_id": 1827, "is_new_question": false }, @@ -10917,8 +11285,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 1492, - "total_submitted": 2207, + "total_acs": 1502, + "total_submitted": 2226, "frontend_question_id": 1788, "is_new_question": false }, @@ -10940,8 +11308,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 4778, - "total_submitted": 15581, + "total_acs": 4809, + "total_submitted": 15643, "frontend_question_id": 1808, "is_new_question": false }, @@ -10963,8 +11331,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": 13538, - "total_submitted": 19055, + "total_acs": 13661, + "total_submitted": 19216, "frontend_question_id": 1806, "is_new_question": false }, @@ -10986,8 +11354,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": 19934, - "total_submitted": 29974, + "total_acs": 20224, + "total_submitted": 30375, "frontend_question_id": 1807, "is_new_question": false }, @@ -11009,8 +11377,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": 27821, - "total_submitted": 77465, + "total_acs": 28269, + "total_submitted": 78630, "frontend_question_id": 1805, "is_new_question": false }, @@ -11032,8 +11400,8 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 12197, - "total_submitted": 13696, + "total_acs": 12598, + "total_submitted": 14159, "frontend_question_id": 1783, "is_new_question": false }, @@ -11055,8 +11423,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 4127, - "total_submitted": 10049, + "total_acs": 4154, + "total_submitted": 10172, "frontend_question_id": 1778, "is_new_question": false }, @@ -11078,8 +11446,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": 10557, - "total_submitted": 19965, + "total_acs": 10713, + "total_submitted": 20184, "frontend_question_id": 1798, "is_new_question": false }, @@ -11101,8 +11469,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": 11406, - "total_submitted": 36786, + "total_acs": 11641, + "total_submitted": 37380, "frontend_question_id": 1802, "is_new_question": false }, @@ -11124,8 +11492,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 12707, - "total_submitted": 27384, + "total_acs": 12787, + "total_submitted": 27521, "frontend_question_id": 1801, "is_new_question": false }, @@ -11147,8 +11515,8 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 31698, - "total_submitted": 49360, + "total_acs": 32215, + "total_submitted": 50330, "frontend_question_id": 1800, "is_new_question": false }, @@ -11170,8 +11538,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 12409, - "total_submitted": 14471, + "total_acs": 12607, + "total_submitted": 14720, "frontend_question_id": 1777, "is_new_question": false }, @@ -11193,8 +11561,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 16196, - "total_submitted": 39623, + "total_acs": 16505, + "total_submitted": 40334, "frontend_question_id": 1814, "is_new_question": false }, @@ -11216,8 +11584,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": 4440, - "total_submitted": 11116, + "total_acs": 4480, + "total_submitted": 11231, "frontend_question_id": 1815, "is_new_question": false }, @@ -11239,8 +11607,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 10369, - "total_submitted": 31697, + "total_acs": 10547, + "total_submitted": 32156, "frontend_question_id": 1813, "is_new_question": false }, @@ -11262,8 +11630,8 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 39760, - "total_submitted": 51193, + "total_acs": 40489, + "total_submitted": 52136, "frontend_question_id": 1812, "is_new_question": false }, @@ -11285,8 +11653,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 4043, - "total_submitted": 6167, + "total_acs": 4091, + "total_submitted": 6235, "frontend_question_id": 1772, "is_new_question": false }, @@ -11308,8 +11676,8 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 14937, - "total_submitted": 28573, + "total_acs": 15199, + "total_submitted": 29000, "frontend_question_id": 1793, "is_new_question": false }, @@ -11331,8 +11699,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 15880, - "total_submitted": 30973, + "total_acs": 16059, + "total_submitted": 31252, "frontend_question_id": 1792, "is_new_question": false }, @@ -11354,8 +11722,8 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 91345, - "total_submitted": 109255, + "total_acs": 93888, + "total_submitted": 112327, "frontend_question_id": 1791, "is_new_question": false }, @@ -11377,8 +11745,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": 48674, - "total_submitted": 106586, + "total_acs": 50241, + "total_submitted": 110081, "frontend_question_id": 1790, "is_new_question": false }, @@ -11400,8 +11768,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": 5370, - "total_submitted": 6388, + "total_acs": 5521, + "total_submitted": 6570, "frontend_question_id": 1767, "is_new_question": false }, @@ -11423,8 +11791,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": 3787, - "total_submitted": 9547, + "total_acs": 3803, + "total_submitted": 9600, "frontend_question_id": 1787, "is_new_question": false }, @@ -11446,8 +11814,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": 14057, - "total_submitted": 35980, + "total_acs": 14363, + "total_submitted": 36689, "frontend_question_id": 1786, "is_new_question": false }, @@ -11469,8 +11837,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": 14878, - "total_submitted": 35471, + "total_acs": 15016, + "total_submitted": 35768, "frontend_question_id": 1785, "is_new_question": false }, @@ -11492,8 +11860,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": 25468, - "total_submitted": 62460, + "total_acs": 25806, + "total_submitted": 63322, "frontend_question_id": 1784, "is_new_question": false }, @@ -11515,8 +11883,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 117096, - "total_submitted": 146947, + "total_acs": 119160, + "total_submitted": 149747, "frontend_question_id": 1762, "is_new_question": false }, @@ -11538,8 +11906,8 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 95397, - "total_submitted": 101446, + "total_acs": 105020, + "total_submitted": 111717, "frontend_question_id": 1757, "is_new_question": false }, @@ -11561,8 +11929,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": 4830, - "total_submitted": 10428, + "total_acs": 4886, + "total_submitted": 10541, "frontend_question_id": 1803, "is_new_question": false }, @@ -11584,8 +11952,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 12894, - "total_submitted": 28000, + "total_acs": 13081, + "total_submitted": 28375, "frontend_question_id": 1799, "is_new_question": false }, @@ -11607,8 +11975,8 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 11894, - "total_submitted": 21700, + "total_acs": 12180, + "total_submitted": 22142, "frontend_question_id": 1797, "is_new_question": false }, @@ -11630,8 +11998,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 27883, - "total_submitted": 56862, + "total_acs": 28352, + "total_submitted": 57829, "frontend_question_id": 1796, "is_new_question": false }, @@ -11653,8 +12021,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 6128, - "total_submitted": 7759, + "total_acs": 6268, + "total_submitted": 7952, "frontend_question_id": 1756, "is_new_question": false }, @@ -11676,8 +12044,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 19076, - "total_submitted": 36081, + "total_acs": 19245, + "total_submitted": 36347, "frontend_question_id": 1776, "is_new_question": false }, @@ -11699,8 +12067,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": 16767, - "total_submitted": 32246, + "total_acs": 17323, + "total_submitted": 33256, "frontend_question_id": 1775, "is_new_question": false }, @@ -11722,8 +12090,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 17543, - "total_submitted": 38020, + "total_acs": 17968, + "total_submitted": 38879, "frontend_question_id": 1774, "is_new_question": false }, @@ -11745,8 +12113,8 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 109047, - "total_submitted": 129218, + "total_acs": 111271, + "total_submitted": 131855, "frontend_question_id": 1773, "is_new_question": false }, @@ -11768,8 +12136,8 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 9283, - "total_submitted": 13723, + "total_acs": 9612, + "total_submitted": 14169, "frontend_question_id": 1747, "is_new_question": false }, @@ -11791,8 +12159,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 7770, - "total_submitted": 22319, + "total_acs": 7856, + "total_submitted": 22569, "frontend_question_id": 1771, "is_new_question": false }, @@ -11814,8 +12182,8 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 36701, - "total_submitted": 104515, + "total_acs": 37686, + "total_submitted": 107758, "frontend_question_id": 1770, "is_new_question": false }, @@ -11837,8 +12205,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": 79087, - "total_submitted": 92416, + "total_acs": 80374, + "total_submitted": 93929, "frontend_question_id": 1769, "is_new_question": false }, @@ -11860,8 +12228,8 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 63914, - "total_submitted": 84313, + "total_acs": 65605, + "total_submitted": 86465, "frontend_question_id": 1768, "is_new_question": false }, @@ -11883,8 +12251,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 6082, - "total_submitted": 9842, + "total_acs": 6186, + "total_submitted": 10000, "frontend_question_id": 1746, "is_new_question": false }, @@ -11906,8 +12274,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": 31403, - "total_submitted": 34218, + "total_acs": 33775, + "total_submitted": 36745, "frontend_question_id": 1741, "is_new_question": false }, @@ -11929,8 +12297,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 4551, - "total_submitted": 12083, + "total_acs": 4603, + "total_submitted": 12176, "frontend_question_id": 1782, "is_new_question": false }, @@ -11952,8 +12320,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 13929, - "total_submitted": 23180, + "total_acs": 14068, + "total_submitted": 23404, "frontend_question_id": 1781, "is_new_question": false }, @@ -11975,8 +12343,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": 22995, - "total_submitted": 35300, + "total_acs": 23316, + "total_submitted": 35804, "frontend_question_id": 1780, "is_new_question": false }, @@ -11998,8 +12366,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": 57740, - "total_submitted": 85489, + "total_acs": 59719, + "total_submitted": 88399, "frontend_question_id": 1779, "is_new_question": false }, @@ -12021,8 +12389,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": 16518, - "total_submitted": 39747, + "total_acs": 16739, + "total_submitted": 40204, "frontend_question_id": 1761, "is_new_question": false }, @@ -12044,8 +12412,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": 20403, - "total_submitted": 34579, + "total_acs": 21045, + "total_submitted": 35526, "frontend_question_id": 1760, "is_new_question": false }, @@ -12067,8 +12435,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 19339, - "total_submitted": 41172, + "total_acs": 19588, + "total_submitted": 41648, "frontend_question_id": 1759, "is_new_question": false }, @@ -12090,8 +12458,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": 28502, - "total_submitted": 48256, + "total_acs": 28768, + "total_submitted": 48799, "frontend_question_id": 1758, "is_new_question": false }, @@ -12113,8 +12481,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 12418, - "total_submitted": 18135, + "total_acs": 12880, + "total_submitted": 18749, "frontend_question_id": 1740, "is_new_question": false }, @@ -12136,8 +12504,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": 11395, - "total_submitted": 22982, + "total_acs": 11779, + "total_submitted": 23703, "frontend_question_id": 1731, "is_new_question": false }, @@ -12159,8 +12527,8 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 9256, - "total_submitted": 25424, + "total_acs": 9391, + "total_submitted": 25781, "frontend_question_id": 1755, "is_new_question": false }, @@ -12182,8 +12550,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 14838, - "total_submitted": 33376, + "total_acs": 14968, + "total_submitted": 33607, "frontend_question_id": 1754, "is_new_question": false }, @@ -12205,8 +12573,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 23167, - "total_submitted": 35318, + "total_acs": 23653, + "total_submitted": 35994, "frontend_question_id": 1753, "is_new_question": false }, @@ -12228,8 +12596,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": 38622, - "total_submitted": 79842, + "total_acs": 39951, + "total_submitted": 82231, "frontend_question_id": 1752, "is_new_question": false }, @@ -12251,8 +12619,8 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 22100, - "total_submitted": 30710, + "total_acs": 24006, + "total_submitted": 33276, "frontend_question_id": 1729, "is_new_question": false }, @@ -12274,8 +12642,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 17263, - "total_submitted": 28737, + "total_acs": 17504, + "total_submitted": 29096, "frontend_question_id": 1765, "is_new_question": false }, @@ -12297,8 +12665,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 5824, - "total_submitted": 15199, + "total_acs": 5908, + "total_submitted": 15379, "frontend_question_id": 1766, "is_new_question": false }, @@ -12320,8 +12688,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": 10799, - "total_submitted": 20363, + "total_acs": 10900, + "total_submitted": 20579, "frontend_question_id": 1764, "is_new_question": false }, @@ -12343,8 +12711,8 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 26023, - "total_submitted": 42058, + "total_acs": 26505, + "total_submitted": 42846, "frontend_question_id": 1763, "is_new_question": false }, @@ -12366,8 +12734,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": 8130, - "total_submitted": 25001, + "total_acs": 8172, + "total_submitted": 25100, "frontend_question_id": 1744, "is_new_question": false }, @@ -12389,8 +12757,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 15644, - "total_submitted": 32476, + "total_acs": 15982, + "total_submitted": 33429, "frontend_question_id": 1745, "is_new_question": false }, @@ -12412,8 +12780,8 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 27133, - "total_submitted": 39783, + "total_acs": 27513, + "total_submitted": 40287, "frontend_question_id": 1743, "is_new_question": false }, @@ -12435,8 +12803,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": 1774, - "total_submitted": 3433, + "total_acs": 1790, + "total_submitted": 3481, "frontend_question_id": 1724, "is_new_question": false }, @@ -12458,8 +12826,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 9246, - "total_submitted": 11859, + "total_acs": 9374, + "total_submitted": 12024, "frontend_question_id": 1715, "is_new_question": false }, @@ -12481,8 +12849,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 5029, - "total_submitted": 9817, + "total_acs": 5054, + "total_submitted": 9865, "frontend_question_id": 1739, "is_new_question": false }, @@ -12504,8 +12872,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 15125, - "total_submitted": 24420, + "total_acs": 15319, + "total_submitted": 24738, "frontend_question_id": 1738, "is_new_question": false }, @@ -12527,8 +12895,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": 9953, - "total_submitted": 28654, + "total_acs": 10048, + "total_submitted": 28859, "frontend_question_id": 1737, "is_new_question": false }, @@ -12550,8 +12918,8 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 23366, - "total_submitted": 55474, + "total_acs": 23638, + "total_submitted": 56148, "frontend_question_id": 1736, "is_new_question": false }, @@ -12573,8 +12941,8 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 11535, - "total_submitted": 14891, + "total_acs": 11832, + "total_submitted": 15275, "frontend_question_id": 1709, "is_new_question": false }, @@ -12596,8 +12964,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": 15857, - "total_submitted": 28641, + "total_acs": 16132, + "total_submitted": 29136, "frontend_question_id": 1751, "is_new_question": false }, @@ -12619,8 +12987,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": 14630, - "total_submitted": 33700, + "total_acs": 14824, + "total_submitted": 34186, "frontend_question_id": 1750, "is_new_question": false }, @@ -12642,8 +13010,8 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 23417, - "total_submitted": 40719, + "total_acs": 23887, + "total_submitted": 41424, "frontend_question_id": 1749, "is_new_question": false }, @@ -12665,8 +13033,8 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 80677, - "total_submitted": 106634, + "total_acs": 81933, + "total_submitted": 108283, "frontend_question_id": 1748, "is_new_question": false }, @@ -12688,8 +13056,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 5886, - "total_submitted": 9224, + "total_acs": 5963, + "total_submitted": 9330, "frontend_question_id": 1708, "is_new_question": false }, @@ -12711,8 +13079,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 12355, - "total_submitted": 20405, + "total_acs": 12476, + "total_submitted": 20592, "frontend_question_id": 1727, "is_new_question": false }, @@ -12734,8 +13102,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": 40586, - "total_submitted": 55016, + "total_acs": 40991, + "total_submitted": 55554, "frontend_question_id": 1742, "is_new_question": false }, @@ -12757,8 +13125,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": 44165, - "total_submitted": 55980, + "total_acs": 44718, + "total_submitted": 56701, "frontend_question_id": 1725, "is_new_question": false }, @@ -12780,8 +13148,8 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 20280, - "total_submitted": 23594, + "total_acs": 20982, + "total_submitted": 24422, "frontend_question_id": 1699, "is_new_question": false }, @@ -12803,8 +13171,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 13063, - "total_submitted": 27085, + "total_acs": 13189, + "total_submitted": 27353, "frontend_question_id": 1722, "is_new_question": false }, @@ -12826,8 +13194,8 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 76071, - "total_submitted": 88563, + "total_acs": 77601, + "total_submitted": 90311, "frontend_question_id": 1720, "is_new_question": false }, @@ -12849,8 +13217,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": 4722, - "total_submitted": 7661, + "total_acs": 4779, + "total_submitted": 7799, "frontend_question_id": 1698, "is_new_question": false }, @@ -12872,8 +13240,8 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 28868, - "total_submitted": 31420, + "total_acs": 31379, + "total_submitted": 34159, "frontend_question_id": 1693, "is_new_question": false }, @@ -12895,8 +13263,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": 3330, - "total_submitted": 6742, + "total_acs": 3373, + "total_submitted": 6810, "frontend_question_id": 1735, "is_new_question": false }, @@ -12918,8 +13286,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 9732, - "total_submitted": 15821, + "total_acs": 9843, + "total_submitted": 15967, "frontend_question_id": 1734, "is_new_question": false }, @@ -12941,8 +13309,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 6325, - "total_submitted": 15428, + "total_acs": 6365, + "total_submitted": 15534, "frontend_question_id": 1733, "is_new_question": false }, @@ -12964,8 +13332,8 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 76768, - "total_submitted": 97401, + "total_acs": 78200, + "total_submitted": 99232, "frontend_question_id": 1732, "is_new_question": false }, @@ -12987,8 +13355,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 7671, - "total_submitted": 15620, + "total_acs": 7781, + "total_submitted": 15849, "frontend_question_id": 1713, "is_new_question": false }, @@ -13010,8 +13378,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": 21270, - "total_submitted": 66627, + "total_acs": 21753, + "total_submitted": 67763, "frontend_question_id": 1712, "is_new_question": false }, @@ -13033,8 +13401,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 26153, - "total_submitted": 91511, + "total_acs": 26514, + "total_submitted": 92634, "frontend_question_id": 1711, "is_new_question": false }, @@ -13056,8 +13424,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 149896, - "total_submitted": 207899, + "total_acs": 215771, + "total_submitted": 289867, "frontend_question_id": 1710, "is_new_question": false }, @@ -13079,8 +13447,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 1626, - "total_submitted": 2641, + "total_acs": 1640, + "total_submitted": 2661, "frontend_question_id": 1692, "is_new_question": false }, @@ -13102,8 +13470,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 18464, - "total_submitted": 20293, + "total_acs": 18705, + "total_submitted": 20548, "frontend_question_id": 1683, "is_new_question": false }, @@ -13125,8 +13493,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": 9840, - "total_submitted": 22486, + "total_acs": 10177, + "total_submitted": 23181, "frontend_question_id": 1707, "is_new_question": false }, @@ -13148,8 +13516,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": 15764, - "total_submitted": 36899, + "total_acs": 16076, + "total_submitted": 37691, "frontend_question_id": 1723, "is_new_question": false }, @@ -13171,8 +13539,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 14938, - "total_submitted": 40605, + "total_acs": 15112, + "total_submitted": 40965, "frontend_question_id": 1705, "is_new_question": false }, @@ -13194,8 +13562,8 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 87968, - "total_submitted": 113086, + "total_acs": 88821, + "total_submitted": 114248, "frontend_question_id": 1704, "is_new_question": false }, @@ -13217,8 +13585,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 3567, - "total_submitted": 7068, + "total_acs": 3607, + "total_submitted": 7136, "frontend_question_id": 1682, "is_new_question": false }, @@ -13240,8 +13608,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 11160, - "total_submitted": 27720, + "total_acs": 11336, + "total_submitted": 28206, "frontend_question_id": 1677, "is_new_question": false }, @@ -13263,8 +13631,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": 2642, - "total_submitted": 6243, + "total_acs": 2662, + "total_submitted": 6291, "frontend_question_id": 1719, "is_new_question": false }, @@ -13286,8 +13654,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 9107, - "total_submitted": 17663, + "total_acs": 9192, + "total_submitted": 17782, "frontend_question_id": 1718, "is_new_question": false }, @@ -13309,8 +13677,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 10145, - "total_submitted": 22242, + "total_acs": 10269, + "total_submitted": 22503, "frontend_question_id": 1717, "is_new_question": false }, @@ -13332,8 +13700,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 31012, - "total_submitted": 47752, + "total_acs": 31345, + "total_submitted": 48269, "frontend_question_id": 1716, "is_new_question": false }, @@ -13355,8 +13723,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": 22968, - "total_submitted": 28913, + "total_acs": 23373, + "total_submitted": 29403, "frontend_question_id": 1676, "is_new_question": false }, @@ -13378,8 +13746,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": 8464, - "total_submitted": 17164, + "total_acs": 8678, + "total_submitted": 17539, "frontend_question_id": 1697, "is_new_question": false }, @@ -13401,8 +13769,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 45245, - "total_submitted": 105719, + "total_acs": 84967, + "total_submitted": 182943, "frontend_question_id": 1696, "is_new_question": false }, @@ -13424,8 +13792,8 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 97310, - "total_submitted": 168258, + "total_acs": 98144, + "total_submitted": 169636, "frontend_question_id": 1695, "is_new_question": false }, @@ -13447,8 +13815,8 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 25534, - "total_submitted": 39273, + "total_acs": 25786, + "total_submitted": 39659, "frontend_question_id": 1694, "is_new_question": false }, @@ -13470,8 +13838,8 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 33189, - "total_submitted": 51219, + "total_acs": 36713, + "total_submitted": 56394, "frontend_question_id": 1667, "is_new_question": false }, @@ -13493,8 +13861,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": 2478, - "total_submitted": 3607, + "total_acs": 2487, + "total_submitted": 3618, "frontend_question_id": 1666, "is_new_question": false }, @@ -13516,8 +13884,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": 1006, - "total_submitted": 1977, + "total_acs": 1009, + "total_submitted": 1988, "frontend_question_id": 1714, "is_new_question": false }, @@ -13539,8 +13907,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 27021, - "total_submitted": 45939, + "total_acs": 27233, + "total_submitted": 46297, "frontend_question_id": 1690, "is_new_question": false }, @@ -13562,8 +13930,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": 136121, - "total_submitted": 151107, + "total_acs": 138328, + "total_submitted": 153621, "frontend_question_id": 1689, "is_new_question": false }, @@ -13585,8 +13953,8 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 71181, - "total_submitted": 85846, + "total_acs": 72188, + "total_submitted": 87005, "frontend_question_id": 1688, "is_new_question": false }, @@ -13608,8 +13976,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": 6441, - "total_submitted": 15522, + "total_acs": 6524, + "total_submitted": 15727, "frontend_question_id": 1703, "is_new_question": false }, @@ -13631,8 +13999,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 9034, - "total_submitted": 19799, + "total_acs": 9130, + "total_submitted": 20007, "frontend_question_id": 1702, "is_new_question": false }, @@ -13654,8 +14022,8 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 19999, - "total_submitted": 32319, + "total_acs": 20178, + "total_submitted": 32574, "frontend_question_id": 1701, "is_new_question": false }, @@ -13677,8 +14045,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": 42380, - "total_submitted": 62650, + "total_acs": 43306, + "total_submitted": 63991, "frontend_question_id": 1700, "is_new_question": false }, @@ -13700,8 +14068,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 16803, - "total_submitted": 21113, + "total_acs": 16992, + "total_submitted": 21342, "frontend_question_id": 1661, "is_new_question": false }, @@ -13723,8 +14091,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 34421, - "total_submitted": 65454, + "total_acs": 34561, + "total_submitted": 65763, "frontend_question_id": 1680, "is_new_question": false }, @@ -13746,8 +14114,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 6006, - "total_submitted": 16139, + "total_acs": 6035, + "total_submitted": 16194, "frontend_question_id": 1681, "is_new_question": false }, @@ -13769,8 +14137,8 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 110915, - "total_submitted": 192835, + "total_acs": 111494, + "total_submitted": 193956, "frontend_question_id": 1679, "is_new_question": false }, @@ -13792,8 +14160,8 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 117782, - "total_submitted": 137176, + "total_acs": 120416, + "total_submitted": 140216, "frontend_question_id": 1678, "is_new_question": false }, @@ -13815,8 +14183,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 11412, - "total_submitted": 15723, + "total_acs": 11591, + "total_submitted": 15981, "frontend_question_id": 1660, "is_new_question": false }, @@ -13838,8 +14206,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 4348, - "total_submitted": 6464, + "total_acs": 4404, + "total_submitted": 6537, "frontend_question_id": 1651, "is_new_question": false }, @@ -13861,8 +14229,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 43828, - "total_submitted": 83654, + "total_acs": 44028, + "total_submitted": 84079, "frontend_question_id": 1675, "is_new_question": false }, @@ -13884,8 +14252,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 6338, - "total_submitted": 16531, + "total_acs": 6424, + "total_submitted": 16706, "frontend_question_id": 1674, "is_new_question": false }, @@ -13907,8 +14275,8 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 44233, - "total_submitted": 90775, + "total_acs": 44842, + "total_submitted": 91826, "frontend_question_id": 1673, "is_new_question": false }, @@ -13930,8 +14298,8 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 320470, - "total_submitted": 359922, + "total_acs": 333324, + "total_submitted": 374595, "frontend_question_id": 1672, "is_new_question": false }, @@ -13953,8 +14321,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": 132531, - "total_submitted": 171212, + "total_acs": 134707, + "total_submitted": 174104, "frontend_question_id": 1650, "is_new_question": false }, @@ -13976,8 +14344,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 4002, - "total_submitted": 10502, + "total_acs": 4051, + "total_submitted": 10632, "frontend_question_id": 1687, "is_new_question": false }, @@ -13999,8 +14367,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 11548, - "total_submitted": 21421, + "total_acs": 11715, + "total_submitted": 21688, "frontend_question_id": 1686, "is_new_question": false }, @@ -14022,8 +14390,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": 21284, - "total_submitted": 32436, + "total_acs": 21666, + "total_submitted": 33005, "frontend_question_id": 1685, "is_new_question": false }, @@ -14045,8 +14413,8 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 93339, - "total_submitted": 113985, + "total_acs": 94876, + "total_submitted": 115942, "frontend_question_id": 1684, "is_new_question": false }, @@ -14068,8 +14436,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 4191, - "total_submitted": 10809, + "total_acs": 4243, + "total_submitted": 10944, "frontend_question_id": 1645, "is_new_question": false }, @@ -14091,8 +14459,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 11880, - "total_submitted": 21309, + "total_acs": 12048, + "total_submitted": 21573, "frontend_question_id": 1665, "is_new_question": false }, @@ -14114,8 +14482,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 24891, - "total_submitted": 39243, + "total_acs": 25202, + "total_submitted": 39676, "frontend_question_id": 1664, "is_new_question": false }, @@ -14137,8 +14505,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": 81323, - "total_submitted": 121292, + "total_acs": 81680, + "total_submitted": 121814, "frontend_question_id": 1663, "is_new_question": false }, @@ -14160,8 +14528,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": 150730, - "total_submitted": 184029, + "total_acs": 152746, + "total_submitted": 186505, "frontend_question_id": 1662, "is_new_question": false }, @@ -14183,8 +14551,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": 46745, - "total_submitted": 79221, + "total_acs": 47444, + "total_submitted": 80434, "frontend_question_id": 1644, "is_new_question": false }, @@ -14206,8 +14574,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 5565, - "total_submitted": 10426, + "total_acs": 5640, + "total_submitted": 10564, "frontend_question_id": 1635, "is_new_question": false }, @@ -14229,8 +14597,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 3785, - "total_submitted": 9975, + "total_acs": 3809, + "total_submitted": 10028, "frontend_question_id": 1659, "is_new_question": false }, @@ -14252,8 +14620,8 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 40656, - "total_submitted": 74716, + "total_acs": 40880, + "total_submitted": 75114, "frontend_question_id": 1657, "is_new_question": false }, @@ -14275,8 +14643,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": 97562, - "total_submitted": 259176, + "total_acs": 98507, + "total_submitted": 261594, "frontend_question_id": 1658, "is_new_question": false }, @@ -14298,8 +14666,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 40617, - "total_submitted": 48233, + "total_acs": 41402, + "total_submitted": 49189, "frontend_question_id": 1656, "is_new_question": false }, @@ -14321,8 +14689,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": 6394, - "total_submitted": 11920, + "total_acs": 6561, + "total_submitted": 12222, "frontend_question_id": 1634, "is_new_question": false }, @@ -14344,8 +14712,8 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 14412, - "total_submitted": 20882, + "total_acs": 14930, + "total_submitted": 21661, "frontend_question_id": 1633, "is_new_question": false }, @@ -14367,8 +14735,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 20195, - "total_submitted": 54173, + "total_acs": 20331, + "total_submitted": 54543, "frontend_question_id": 1649, "is_new_question": false }, @@ -14390,8 +14758,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 30793, - "total_submitted": 99569, + "total_acs": 31070, + "total_submitted": 100631, "frontend_question_id": 1648, "is_new_question": false }, @@ -14413,8 +14781,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": 145017, - "total_submitted": 243992, + "total_acs": 148907, + "total_submitted": 250553, "frontend_question_id": 1647, "is_new_question": false }, @@ -14436,8 +14804,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 63577, - "total_submitted": 125543, + "total_acs": 64964, + "total_submitted": 128398, "frontend_question_id": 1646, "is_new_question": false }, @@ -14459,8 +14827,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": 17953, - "total_submitted": 21882, + "total_acs": 18337, + "total_submitted": 22337, "frontend_question_id": 1628, "is_new_question": false }, @@ -14482,8 +14850,8 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 15610, - "total_submitted": 27933, + "total_acs": 15835, + "total_submitted": 28306, "frontend_question_id": 1670, "is_new_question": false }, @@ -14505,8 +14873,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": 14802, - "total_submitted": 34432, + "total_acs": 15312, + "total_submitted": 35703, "frontend_question_id": 1671, "is_new_question": false }, @@ -14528,8 +14896,8 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 52699, - "total_submitted": 70737, + "total_acs": 53492, + "total_submitted": 71775, "frontend_question_id": 1669, "is_new_question": false }, @@ -14551,8 +14919,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 25927, - "total_submitted": 65490, + "total_acs": 26278, + "total_submitted": 66309, "frontend_question_id": 1668, "is_new_question": false }, @@ -14574,8 +14942,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": 13879, - "total_submitted": 15704, + "total_acs": 14050, + "total_submitted": 15922, "frontend_question_id": 1623, "is_new_question": false }, @@ -14597,8 +14965,8 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 96382, - "total_submitted": 200205, + "total_acs": 97838, + "total_submitted": 203085, "frontend_question_id": 1642, "is_new_question": false }, @@ -14620,8 +14988,8 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 134941, - "total_submitted": 173943, + "total_acs": 136224, + "total_submitted": 175619, "frontend_question_id": 1641, "is_new_question": false }, @@ -14643,8 +15011,8 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 68717, - "total_submitted": 122870, + "total_acs": 69046, + "total_submitted": 123382, "frontend_question_id": 1640, "is_new_question": false }, @@ -14666,8 +15034,8 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 11339, - "total_submitted": 14947, + "total_acs": 11590, + "total_submitted": 15278, "frontend_question_id": 1613, "is_new_question": false }, @@ -14689,8 +15057,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 8340, - "total_submitted": 20810, + "total_acs": 8446, + "total_submitted": 21119, "frontend_question_id": 1655, "is_new_question": false }, @@ -14712,8 +15080,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 24339, - "total_submitted": 87790, + "total_acs": 25049, + "total_submitted": 89881, "frontend_question_id": 1654, "is_new_question": false }, @@ -14735,8 +15103,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 23792, - "total_submitted": 41200, + "total_acs": 24545, + "total_submitted": 42389, "frontend_question_id": 1653, "is_new_question": false }, @@ -14758,8 +15126,8 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 24165, - "total_submitted": 39609, + "total_acs": 24433, + "total_submitted": 40018, "frontend_question_id": 1652, "is_new_question": false }, @@ -14781,8 +15149,8 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 113325, - "total_submitted": 205472, + "total_acs": 115344, + "total_submitted": 208921, "frontend_question_id": 1631, "is_new_question": false }, @@ -14804,8 +15172,8 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 35756, - "total_submitted": 45170, + "total_acs": 36533, + "total_submitted": 46086, "frontend_question_id": 1630, "is_new_question": false }, @@ -14827,8 +15195,8 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 78532, - "total_submitted": 131822, + "total_acs": 79056, + "total_submitted": 132732, "frontend_question_id": 1629, "is_new_question": false }, @@ -14850,8 +15218,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": 5160, - "total_submitted": 7413, + "total_acs": 5224, + "total_submitted": 7500, "frontend_question_id": 1612, "is_new_question": false }, @@ -14873,8 +15241,8 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 15735, - "total_submitted": 28687, + "total_acs": 16283, + "total_submitted": 29587, "frontend_question_id": 1607, "is_new_question": false }, @@ -14896,8 +15264,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 19466, - "total_submitted": 47575, + "total_acs": 19783, + "total_submitted": 48289, "frontend_question_id": 1626, "is_new_question": false }, @@ -14919,8 +15287,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 10729, - "total_submitted": 16296, + "total_acs": 10807, + "total_submitted": 16417, "frontend_question_id": 1625, "is_new_question": false }, @@ -14942,8 +15310,8 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 33605, - "total_submitted": 56621, + "total_acs": 33916, + "total_submitted": 57185, "frontend_question_id": 1624, "is_new_question": false }, @@ -14965,8 +15333,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": 18882, - "total_submitted": 25059, + "total_acs": 19005, + "total_submitted": 25242, "frontend_question_id": 1602, "is_new_question": false }, @@ -14988,8 +15356,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": 7022, - "total_submitted": 16476, + "total_acs": 7104, + "total_submitted": 16666, "frontend_question_id": 1639, "is_new_question": false }, @@ -15011,8 +15379,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": 18725, - "total_submitted": 26063, + "total_acs": 19106, + "total_submitted": 26617, "frontend_question_id": 1638, "is_new_question": false }, @@ -15034,8 +15402,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": 30469, - "total_submitted": 36263, + "total_acs": 30919, + "total_submitted": 36804, "frontend_question_id": 1637, "is_new_question": false }, @@ -15057,8 +15425,8 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 65414, - "total_submitted": 95537, + "total_acs": 66918, + "total_submitted": 97741, "frontend_question_id": 1636, "is_new_question": false }, @@ -15080,8 +15448,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": 6621, - "total_submitted": 10086, + "total_acs": 6689, + "total_submitted": 10197, "frontend_question_id": 1617, "is_new_question": false }, @@ -15103,8 +15471,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 17271, - "total_submitted": 55120, + "total_acs": 17432, + "total_submitted": 55588, "frontend_question_id": 1616, "is_new_question": false }, @@ -15126,8 +15494,8 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 43428, - "total_submitted": 75575, + "total_acs": 45007, + "total_submitted": 78147, "frontend_question_id": 1615, "is_new_question": false }, @@ -15149,8 +15517,8 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 91189, - "total_submitted": 110305, + "total_acs": 92509, + "total_submitted": 111936, "frontend_question_id": 1614, "is_new_question": false }, @@ -15172,8 +15540,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": 8453, - "total_submitted": 13848, + "total_acs": 8804, + "total_submitted": 14396, "frontend_question_id": 1597, "is_new_question": false }, @@ -15195,8 +15563,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": 20248, - "total_submitted": 23826, + "total_acs": 20589, + "total_submitted": 24270, "frontend_question_id": 1596, "is_new_question": false }, @@ -15218,8 +15586,8 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 30487, - "total_submitted": 33868, + "total_acs": 32441, + "total_submitted": 35971, "frontend_question_id": 1587, "is_new_question": false }, @@ -15241,8 +15609,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 29335, - "total_submitted": 78938, + "total_acs": 29975, + "total_submitted": 80562, "frontend_question_id": 1610, "is_new_question": false }, @@ -15264,8 +15632,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": 10594, - "total_submitted": 16963, + "total_acs": 10707, + "total_submitted": 17105, "frontend_question_id": 1611, "is_new_question": false }, @@ -15287,8 +15655,8 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 33957, - "total_submitted": 63783, + "total_acs": 34481, + "total_submitted": 64792, "frontend_question_id": 1609, "is_new_question": false }, @@ -15310,8 +15678,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": 44772, - "total_submitted": 74036, + "total_acs": 45848, + "total_submitted": 75840, "frontend_question_id": 1608, "is_new_question": false }, @@ -15333,8 +15701,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 11110, - "total_submitted": 15727, + "total_acs": 11190, + "total_submitted": 15837, "frontend_question_id": 1586, "is_new_question": false }, @@ -15356,8 +15724,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 7513, - "total_submitted": 48229, + "total_acs": 7613, + "total_submitted": 48690, "frontend_question_id": 1622, "is_new_question": false }, @@ -15379,8 +15747,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 4933, - "total_submitted": 11963, + "total_acs": 4971, + "total_submitted": 12067, "frontend_question_id": 1728, "is_new_question": false }, @@ -15402,8 +15770,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 6542, - "total_submitted": 17611, + "total_acs": 6569, + "total_submitted": 17693, "frontend_question_id": 1620, "is_new_question": false }, @@ -15425,8 +15793,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": 7028, - "total_submitted": 16588, + "total_acs": 7134, + "total_submitted": 16834, "frontend_question_id": 1621, "is_new_question": false }, @@ -15448,8 +15816,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": 34677, - "total_submitted": 38435, + "total_acs": 37388, + "total_submitted": 41408, "frontend_question_id": 1581, "is_new_question": false }, @@ -15471,8 +15839,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 8151, - "total_submitted": 16000, + "total_acs": 8211, + "total_submitted": 16139, "frontend_question_id": 1601, "is_new_question": false }, @@ -15494,8 +15862,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 12109, - "total_submitted": 19053, + "total_acs": 12207, + "total_submitted": 19220, "frontend_question_id": 1600, "is_new_question": false }, @@ -15517,8 +15885,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": 9875, - "total_submitted": 22481, + "total_acs": 9937, + "total_submitted": 22609, "frontend_question_id": 1599, "is_new_question": false }, @@ -15540,8 +15908,8 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 44230, - "total_submitted": 68716, + "total_acs": 44849, + "total_submitted": 69741, "frontend_question_id": 1598, "is_new_question": false }, @@ -15563,8 +15931,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 3354, - "total_submitted": 5273, + "total_acs": 3453, + "total_submitted": 5436, "frontend_question_id": 1580, "is_new_question": false }, @@ -15586,8 +15954,8 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 23073, - "total_submitted": 25637, + "total_acs": 23665, + "total_submitted": 26287, "frontend_question_id": 1571, "is_new_question": false }, @@ -15609,8 +15977,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": 6430, - "total_submitted": 13966, + "total_acs": 6480, + "total_submitted": 14072, "frontend_question_id": 1595, "is_new_question": false }, @@ -15632,8 +16000,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": 17151, - "total_submitted": 51742, + "total_acs": 17340, + "total_submitted": 52282, "frontend_question_id": 1594, "is_new_question": false }, @@ -15655,8 +16023,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": 21466, - "total_submitted": 39232, + "total_acs": 21705, + "total_submitted": 39602, "frontend_question_id": 1593, "is_new_question": false }, @@ -15678,8 +16046,8 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 38184, - "total_submitted": 86965, + "total_acs": 38794, + "total_submitted": 88395, "frontend_question_id": 1592, "is_new_question": false }, @@ -15701,8 +16069,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 155142, - "total_submitted": 171885, + "total_acs": 156976, + "total_submitted": 173939, "frontend_question_id": 1570, "is_new_question": false }, @@ -15724,8 +16092,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 15203, - "total_submitted": 18234, + "total_acs": 15380, + "total_submitted": 18432, "frontend_question_id": 1565, "is_new_question": false }, @@ -15747,8 +16115,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": 26945, - "total_submitted": 34505, + "total_acs": 27441, + "total_submitted": 35127, "frontend_question_id": 1605, "is_new_question": false }, @@ -15770,8 +16138,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": 8732, - "total_submitted": 21005, + "total_acs": 9138, + "total_submitted": 21875, "frontend_question_id": 1606, "is_new_question": false }, @@ -15793,8 +16161,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": 22455, - "total_submitted": 47580, + "total_acs": 22934, + "total_submitted": 48529, "frontend_question_id": 1604, "is_new_question": false }, @@ -15816,8 +16184,8 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 126334, - "total_submitted": 144001, + "total_acs": 128406, + "total_submitted": 146320, "frontend_question_id": 1603, "is_new_question": false }, @@ -15839,8 +16207,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": 6148, - "total_submitted": 12679, + "total_acs": 6173, + "total_submitted": 12752, "frontend_question_id": 1585, "is_new_question": false }, @@ -15862,8 +16230,8 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 104353, - "total_submitted": 162057, + "total_acs": 108253, + "total_submitted": 168046, "frontend_question_id": 1584, "is_new_question": false }, @@ -15885,8 +16253,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 17331, - "total_submitted": 29659, + "total_acs": 17523, + "total_submitted": 29963, "frontend_question_id": 1583, "is_new_question": false }, @@ -15908,8 +16276,8 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 32571, - "total_submitted": 49954, + "total_acs": 32861, + "total_submitted": 50367, "frontend_question_id": 1582, "is_new_question": false }, @@ -15931,8 +16299,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 11447, - "total_submitted": 17431, + "total_acs": 13195, + "total_submitted": 19702, "frontend_question_id": 1564, "is_new_question": false }, @@ -15954,8 +16322,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 11342, - "total_submitted": 21332, + "total_acs": 11489, + "total_submitted": 21593, "frontend_question_id": 1555, "is_new_question": false }, @@ -15977,8 +16345,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": 13682, - "total_submitted": 26472, + "total_acs": 14156, + "total_submitted": 27261, "frontend_question_id": 1579, "is_new_question": false }, @@ -16000,8 +16368,8 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 66364, - "total_submitted": 108329, + "total_acs": 67419, + "total_submitted": 110191, "frontend_question_id": 1578, "is_new_question": false }, @@ -16023,8 +16391,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": 15813, - "total_submitted": 40091, + "total_acs": 15933, + "total_submitted": 40334, "frontend_question_id": 1577, "is_new_question": false }, @@ -16046,8 +16414,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": 45590, - "total_submitted": 92140, + "total_acs": 45868, + "total_submitted": 92738, "frontend_question_id": 1576, "is_new_question": false }, @@ -16069,8 +16437,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 17154, - "total_submitted": 36292, + "total_acs": 17833, + "total_submitted": 38473, "frontend_question_id": 1554, "is_new_question": false }, @@ -16092,8 +16460,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 6464, - "total_submitted": 11279, + "total_acs": 6561, + "total_submitted": 11434, "frontend_question_id": 1591, "is_new_question": false }, @@ -16115,8 +16483,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 13043, - "total_submitted": 35465, + "total_acs": 13204, + "total_submitted": 35850, "frontend_question_id": 1589, "is_new_question": false }, @@ -16138,8 +16506,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 16786, - "total_submitted": 59646, + "total_acs": 16995, + "total_submitted": 60433, "frontend_question_id": 1590, "is_new_question": false }, @@ -16161,8 +16529,8 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 105852, - "total_submitted": 126642, + "total_acs": 108252, + "total_submitted": 129483, "frontend_question_id": 1588, "is_new_question": false }, @@ -16184,8 +16552,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": 9982, - "total_submitted": 20373, + "total_acs": 10076, + "total_submitted": 20588, "frontend_question_id": 1569, "is_new_question": false }, @@ -16207,8 +16575,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": 8811, - "total_submitted": 18293, + "total_acs": 8938, + "total_submitted": 18603, "frontend_question_id": 1568, "is_new_question": false }, @@ -16230,8 +16598,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": 56356, - "total_submitted": 130321, + "total_acs": 58447, + "total_submitted": 134951, "frontend_question_id": 1567, "is_new_question": false }, @@ -16253,8 +16621,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": 24992, - "total_submitted": 57407, + "total_acs": 25198, + "total_submitted": 57890, "frontend_question_id": 1566, "is_new_question": false }, @@ -16276,8 +16644,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": 14726, - "total_submitted": 21753, + "total_acs": 15193, + "total_submitted": 22478, "frontend_question_id": 1549, "is_new_question": false }, @@ -16299,8 +16667,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": 13860, - "total_submitted": 24366, + "total_acs": 13950, + "total_submitted": 24512, "frontend_question_id": 1548, "is_new_question": false }, @@ -16322,8 +16690,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 14145, - "total_submitted": 22495, + "total_acs": 14330, + "total_submitted": 22793, "frontend_question_id": 1543, "is_new_question": false }, @@ -16345,8 +16713,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 13273, - "total_submitted": 32601, + "total_acs": 13525, + "total_submitted": 33257, "frontend_question_id": 1563, "is_new_question": false }, @@ -16368,8 +16736,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 13403, - "total_submitted": 32285, + "total_acs": 13568, + "total_submitted": 32632, "frontend_question_id": 1562, "is_new_question": false }, @@ -16391,8 +16759,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": 49472, - "total_submitted": 63079, + "total_acs": 50288, + "total_submitted": 64063, "frontend_question_id": 1561, "is_new_question": false }, @@ -16414,8 +16782,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": 22195, - "total_submitted": 38057, + "total_acs": 22349, + "total_submitted": 38304, "frontend_question_id": 1560, "is_new_question": false }, @@ -16437,8 +16805,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": 1460, - "total_submitted": 2330, + "total_acs": 1474, + "total_submitted": 2344, "frontend_question_id": 1538, "is_new_question": false }, @@ -16460,8 +16828,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 10428, - "total_submitted": 18221, + "total_acs": 10590, + "total_submitted": 18492, "frontend_question_id": 1575, "is_new_question": false }, @@ -16483,8 +16851,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": 19734, - "total_submitted": 54796, + "total_acs": 20059, + "total_submitted": 55692, "frontend_question_id": 1574, "is_new_question": false }, @@ -16506,8 +16874,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": 20237, - "total_submitted": 62947, + "total_acs": 20452, + "total_submitted": 63536, "frontend_question_id": 1573, "is_new_question": false }, @@ -16529,8 +16897,8 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 116220, - "total_submitted": 146375, + "total_acs": 119179, + "total_submitted": 149962, "frontend_question_id": 1572, "is_new_question": false }, @@ -16552,8 +16920,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": 23255, - "total_submitted": 69731, + "total_acs": 23540, + "total_submitted": 70412, "frontend_question_id": 1553, "is_new_question": false }, @@ -16575,8 +16943,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 29800, - "total_submitted": 53446, + "total_acs": 30425, + "total_submitted": 54399, "frontend_question_id": 1552, "is_new_question": false }, @@ -16598,8 +16966,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 67771, - "total_submitted": 83712, + "total_acs": 68352, + "total_submitted": 84402, "frontend_question_id": 1551, "is_new_question": false }, @@ -16621,8 +16989,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": 4753, - "total_submitted": 9442, + "total_acs": 4817, + "total_submitted": 9550, "frontend_question_id": 1533, "is_new_question": false }, @@ -16644,8 +17012,8 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 16837, - "total_submitted": 23694, + "total_acs": 17176, + "total_submitted": 24187, "frontend_question_id": 1532, "is_new_question": false }, @@ -16667,8 +17035,8 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 37044, - "total_submitted": 83308, + "total_acs": 40231, + "total_submitted": 91104, "frontend_question_id": 1527, "is_new_question": false }, @@ -16690,8 +17058,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 26963, - "total_submitted": 48471, + "total_acs": 28365, + "total_submitted": 50730, "frontend_question_id": 1547, "is_new_question": false }, @@ -16713,8 +17081,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 9360, - "total_submitted": 22723, + "total_acs": 9459, + "total_submitted": 22919, "frontend_question_id": 1542, "is_new_question": false }, @@ -16736,8 +17104,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": 25435, - "total_submitted": 43704, + "total_acs": 25827, + "total_submitted": 44418, "frontend_question_id": 1545, "is_new_question": false }, @@ -16759,8 +17127,8 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 50965, - "total_submitted": 89996, + "total_acs": 51611, + "total_submitted": 91090, "frontend_question_id": 1544, "is_new_question": false }, @@ -16782,8 +17150,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 33281, - "total_submitted": 45426, + "total_acs": 33653, + "total_submitted": 45948, "frontend_question_id": 1522, "is_new_question": false }, @@ -16805,8 +17173,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 19210, - "total_submitted": 32344, + "total_acs": 19442, + "total_submitted": 32851, "frontend_question_id": 1517, "is_new_question": false }, @@ -16828,8 +17196,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 25448, - "total_submitted": 52907, + "total_acs": 25865, + "total_submitted": 53834, "frontend_question_id": 1559, "is_new_question": false }, @@ -16851,8 +17219,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": 15844, - "total_submitted": 24666, + "total_acs": 15976, + "total_submitted": 24888, "frontend_question_id": 1558, "is_new_question": false }, @@ -16874,8 +17242,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": 64925, - "total_submitted": 82045, + "total_acs": 66703, + "total_submitted": 84181, "frontend_question_id": 1557, "is_new_question": false }, @@ -16897,8 +17265,8 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 34633, - "total_submitted": 62301, + "total_acs": 34940, + "total_submitted": 62899, "frontend_question_id": 1556, "is_new_question": false }, @@ -16920,8 +17288,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 17555, - "total_submitted": 44646, + "total_acs": 17753, + "total_submitted": 45161, "frontend_question_id": 1537, "is_new_question": false }, @@ -16943,8 +17311,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": 11574, - "total_submitted": 25125, + "total_acs": 11652, + "total_submitted": 25245, "frontend_question_id": 1536, "is_new_question": false }, @@ -16966,8 +17334,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": 25154, - "total_submitted": 51542, + "total_acs": 25333, + "total_submitted": 51882, "frontend_question_id": 1535, "is_new_question": false }, @@ -16989,8 +17357,8 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 78130, - "total_submitted": 96847, + "total_acs": 79017, + "total_submitted": 97917, "frontend_question_id": 1534, "is_new_question": false }, @@ -17012,8 +17380,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": 1799, - "total_submitted": 2792, + "total_acs": 1813, + "total_submitted": 2814, "frontend_question_id": 1516, "is_new_question": false }, @@ -17035,8 +17403,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 29513, - "total_submitted": 40262, + "total_acs": 29889, + "total_submitted": 40725, "frontend_question_id": 1511, "is_new_question": false }, @@ -17058,8 +17426,8 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 27507, - "total_submitted": 45808, + "total_acs": 27991, + "total_submitted": 46588, "frontend_question_id": 1530, "is_new_question": false }, @@ -17081,8 +17449,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 33450, - "total_submitted": 46236, + "total_acs": 33683, + "total_submitted": 46541, "frontend_question_id": 1529, "is_new_question": false }, @@ -17104,8 +17472,8 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 215981, - "total_submitted": 251907, + "total_acs": 219507, + "total_submitted": 255929, "frontend_question_id": 1528, "is_new_question": false }, @@ -17127,8 +17495,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 22429, - "total_submitted": 28835, + "total_acs": 22719, + "total_submitted": 29210, "frontend_question_id": 1506, "is_new_question": false }, @@ -17150,8 +17518,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": 20831, - "total_submitted": 44396, + "total_acs": 21094, + "total_submitted": 44919, "frontend_question_id": 1546, "is_new_question": false }, @@ -17173,8 +17541,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": 31337, - "total_submitted": 63317, + "total_acs": 32043, + "total_submitted": 64554, "frontend_question_id": 1541, "is_new_question": false }, @@ -17196,8 +17564,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 13875, - "total_submitted": 42340, + "total_acs": 13973, + "total_submitted": 42578, "frontend_question_id": 1540, "is_new_question": false }, @@ -17219,8 +17587,8 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 176561, - "total_submitted": 317209, + "total_acs": 178967, + "total_submitted": 321342, "frontend_question_id": 1539, "is_new_question": false }, @@ -17242,8 +17610,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": 7673, - "total_submitted": 17690, + "total_acs": 7746, + "total_submitted": 17807, "frontend_question_id": 1521, "is_new_question": false }, @@ -17265,8 +17633,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 11239, - "total_submitted": 29959, + "total_acs": 11342, + "total_submitted": 30230, "frontend_question_id": 1520, "is_new_question": false }, @@ -17288,8 +17656,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": 17642, - "total_submitted": 43749, + "total_acs": 17781, + "total_submitted": 44055, "frontend_question_id": 1519, "is_new_question": false }, @@ -17311,8 +17679,8 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 51176, - "total_submitted": 84728, + "total_acs": 51575, + "total_submitted": 85404, "frontend_question_id": 1518, "is_new_question": false }, @@ -17334,8 +17702,8 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 20272, - "total_submitted": 35064, + "total_acs": 21031, + "total_submitted": 36282, "frontend_question_id": 1501, "is_new_question": false }, @@ -17357,8 +17725,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 2991, - "total_submitted": 6671, + "total_acs": 3023, + "total_submitted": 6735, "frontend_question_id": 1500, "is_new_question": false }, @@ -17380,8 +17748,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 19907, - "total_submitted": 39629, + "total_acs": 20177, + "total_submitted": 40197, "frontend_question_id": 1495, "is_new_question": false }, @@ -17403,8 +17771,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 9770, - "total_submitted": 25387, + "total_acs": 9895, + "total_submitted": 25737, "frontend_question_id": 1515, "is_new_question": false }, @@ -17426,8 +17794,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 11652, - "total_submitted": 30359, + "total_acs": 11762, + "total_submitted": 30643, "frontend_question_id": 1531, "is_new_question": false }, @@ -17449,8 +17817,8 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 30629, - "total_submitted": 68612, + "total_acs": 30919, + "total_submitted": 69130, "frontend_question_id": 1513, "is_new_question": false }, @@ -17472,8 +17840,8 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 310743, - "total_submitted": 352948, + "total_acs": 315348, + "total_submitted": 358131, "frontend_question_id": 1512, "is_new_question": false }, @@ -17495,8 +17863,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 21923, - "total_submitted": 26177, + "total_acs": 22097, + "total_submitted": 26387, "frontend_question_id": 1490, "is_new_question": false }, @@ -17518,8 +17886,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": 25664, - "total_submitted": 37613, + "total_acs": 25993, + "total_submitted": 38082, "frontend_question_id": 1526, "is_new_question": false }, @@ -17541,8 +17909,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": 74028, - "total_submitted": 105991, + "total_acs": 75244, + "total_submitted": 107668, "frontend_question_id": 1525, "is_new_question": false }, @@ -17564,8 +17932,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": 24693, - "total_submitted": 56902, + "total_acs": 25069, + "total_submitted": 57667, "frontend_question_id": 1524, "is_new_question": false }, @@ -17587,8 +17955,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": 103985, - "total_submitted": 222673, + "total_acs": 108732, + "total_submitted": 233133, "frontend_question_id": 1523, "is_new_question": false }, @@ -17610,8 +17978,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": 7668, - "total_submitted": 20264, + "total_acs": 7704, + "total_submitted": 20369, "frontend_question_id": 1505, "is_new_question": false }, @@ -17633,8 +18001,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 37150, - "total_submitted": 63724, + "total_acs": 37609, + "total_submitted": 64624, "frontend_question_id": 1504, "is_new_question": false }, @@ -17656,8 +18024,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": 15817, - "total_submitted": 28737, + "total_acs": 15938, + "total_submitted": 28963, "frontend_question_id": 1503, "is_new_question": false }, @@ -17679,8 +18047,8 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 90049, - "total_submitted": 130210, + "total_acs": 91983, + "total_submitted": 133149, "frontend_question_id": 1502, "is_new_question": false }, @@ -17702,8 +18070,8 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 43254, - "total_submitted": 51416, + "total_acs": 46829, + "total_submitted": 55572, "frontend_question_id": 1484, "is_new_question": false }, @@ -17725,8 +18093,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 17327, - "total_submitted": 21752, + "total_acs": 17477, + "total_submitted": 21940, "frontend_question_id": 1485, "is_new_question": false }, @@ -17748,8 +18116,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 13216, - "total_submitted": 16041, + "total_acs": 13373, + "total_submitted": 16212, "frontend_question_id": 1479, "is_new_question": false }, @@ -17771,8 +18139,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 31762, - "total_submitted": 68038, + "total_acs": 32204, + "total_submitted": 69065, "frontend_question_id": 1499, "is_new_question": false }, @@ -17794,8 +18162,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": 31308, - "total_submitted": 80150, + "total_acs": 31823, + "total_submitted": 81639, "frontend_question_id": 1498, "is_new_question": false }, @@ -17817,8 +18185,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": 32512, - "total_submitted": 80926, + "total_acs": 33060, + "total_submitted": 82423, "frontend_question_id": 1497, "is_new_question": false }, @@ -17840,8 +18208,8 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 37149, - "total_submitted": 66595, + "total_acs": 37513, + "total_submitted": 67223, "frontend_question_id": 1496, "is_new_question": false }, @@ -17863,8 +18231,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": 20878, - "total_submitted": 28399, + "total_acs": 21103, + "total_submitted": 28679, "frontend_question_id": 1474, "is_new_question": false }, @@ -17886,8 +18254,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 59884, - "total_submitted": 98654, + "total_acs": 60289, + "total_submitted": 99350, "frontend_question_id": 1510, "is_new_question": false }, @@ -17909,8 +18277,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": 65441, - "total_submitted": 118600, + "total_acs": 66398, + "total_submitted": 120555, "frontend_question_id": 1509, "is_new_question": false }, @@ -17932,8 +18300,8 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 26465, - "total_submitted": 44639, + "total_acs": 26822, + "total_submitted": 45252, "frontend_question_id": 1508, "is_new_question": false }, @@ -17955,8 +18323,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": 8305, - "total_submitted": 15664, + "total_acs": 8457, + "total_submitted": 15934, "frontend_question_id": 1489, "is_new_question": false }, @@ -17978,8 +18346,8 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 25065, - "total_submitted": 97535, + "total_acs": 25411, + "total_submitted": 98704, "frontend_question_id": 1488, "is_new_question": false }, @@ -18001,8 +18369,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 24754, - "total_submitted": 70365, + "total_acs": 25106, + "total_submitted": 71142, "frontend_question_id": 1487, "is_new_question": false }, @@ -18024,8 +18392,8 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 125653, - "total_submitted": 149382, + "total_acs": 126819, + "total_submitted": 150796, "frontend_question_id": 1486, "is_new_question": false }, @@ -18047,8 +18415,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 36295, - "total_submitted": 44401, + "total_acs": 36752, + "total_submitted": 44960, "frontend_question_id": 1469, "is_new_question": false }, @@ -18070,8 +18438,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 16475, - "total_submitted": 20119, + "total_acs": 16713, + "total_submitted": 20405, "frontend_question_id": 1468, "is_new_question": false }, @@ -18093,8 +18461,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 10094, - "total_submitted": 14585, + "total_acs": 10456, + "total_submitted": 15083, "frontend_question_id": 1459, "is_new_question": false }, @@ -18116,8 +18484,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": 41221, - "total_submitted": 72785, + "total_acs": 42091, + "total_submitted": 74274, "frontend_question_id": 1482, "is_new_question": false }, @@ -18139,8 +18507,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": 73449, - "total_submitted": 122383, + "total_acs": 74442, + "total_submitted": 124686, "frontend_question_id": 1481, "is_new_question": false }, @@ -18162,8 +18530,8 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 654473, - "total_submitted": 723374, + "total_acs": 696409, + "total_submitted": 770051, "frontend_question_id": 1480, "is_new_question": false }, @@ -18185,8 +18553,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 11366, - "total_submitted": 36008, + "total_acs": 11464, + "total_submitted": 36383, "frontend_question_id": 1494, "is_new_question": false }, @@ -18208,8 +18576,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": 42889, - "total_submitted": 71298, + "total_acs": 43618, + "total_submitted": 72560, "frontend_question_id": 1493, "is_new_question": false }, @@ -18231,8 +18599,8 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 96586, - "total_submitted": 155516, + "total_acs": 97682, + "total_submitted": 157273, "frontend_question_id": 1492, "is_new_question": false }, @@ -18254,8 +18622,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": 119802, - "total_submitted": 186706, + "total_acs": 123601, + "total_submitted": 193131, "frontend_question_id": 1491, "is_new_question": false }, @@ -18277,8 +18645,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 16845, - "total_submitted": 32954, + "total_acs": 49598, + "total_submitted": 79436, "frontend_question_id": 1473, "is_new_question": false }, @@ -18300,8 +18668,8 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 82127, - "total_submitted": 109185, + "total_acs": 83817, + "total_submitted": 111270, "frontend_question_id": 1472, "is_new_question": false }, @@ -18323,8 +18691,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": 28144, - "total_submitted": 47011, + "total_acs": 28368, + "total_submitted": 47355, "frontend_question_id": 1471, "is_new_question": false }, @@ -18346,8 +18714,8 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 328146, - "total_submitted": 371158, + "total_acs": 332543, + "total_submitted": 376097, "frontend_question_id": 1470, "is_new_question": false }, @@ -18369,8 +18737,8 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 24624, - "total_submitted": 64291, + "total_acs": 25020, + "total_submitted": 65372, "frontend_question_id": 1454, "is_new_question": false }, @@ -18392,8 +18760,8 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 29732, - "total_submitted": 32486, + "total_acs": 30508, + "total_submitted": 33342, "frontend_question_id": 1445, "is_new_question": false }, @@ -18415,8 +18783,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": 6129, - "total_submitted": 10025, + "total_acs": 6163, + "total_submitted": 10088, "frontend_question_id": 1467, "is_new_question": false }, @@ -18438,8 +18806,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": 57155, - "total_submitted": 93195, + "total_acs": 58321, + "total_submitted": 95098, "frontend_question_id": 1466, "is_new_question": false }, @@ -18461,8 +18829,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": 94342, - "total_submitted": 253421, + "total_acs": 149179, + "total_submitted": 365360, "frontend_question_id": 1465, "is_new_question": false }, @@ -18484,8 +18852,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": 139094, - "total_submitted": 176598, + "total_acs": 141180, + "total_submitted": 179069, "frontend_question_id": 1464, "is_new_question": false }, @@ -18507,8 +18875,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": 38986, - "total_submitted": 105523, + "total_acs": 39351, + "total_submitted": 106447, "frontend_question_id": 1477, "is_new_question": false }, @@ -18530,8 +18898,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 73022, - "total_submitted": 82732, + "total_acs": 73795, + "total_submitted": 83571, "frontend_question_id": 1476, "is_new_question": false }, @@ -18553,8 +18921,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 16219, - "total_submitted": 29326, + "total_acs": 16430, + "total_submitted": 29692, "frontend_question_id": 1478, "is_new_question": false }, @@ -18576,8 +18944,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": 80918, - "total_submitted": 107502, + "total_acs": 82220, + "total_submitted": 109216, "frontend_question_id": 1475, "is_new_question": false }, @@ -18599,8 +18967,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 17061, - "total_submitted": 37482, + "total_acs": 17234, + "total_submitted": 37771, "frontend_question_id": 1458, "is_new_question": false }, @@ -18622,8 +18990,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": 52658, - "total_submitted": 78695, + "total_acs": 52986, + "total_submitted": 79251, "frontend_question_id": 1457, "is_new_question": false }, @@ -18645,8 +19013,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": 45243, - "total_submitted": 78468, + "total_acs": 45706, + "total_submitted": 79248, "frontend_question_id": 1456, "is_new_question": false }, @@ -18668,8 +19036,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": 51962, - "total_submitted": 80561, + "total_acs": 52509, + "total_submitted": 81512, "frontend_question_id": 1455, "is_new_question": false }, @@ -18691,8 +19059,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 14303, - "total_submitted": 18839, + "total_acs": 14746, + "total_submitted": 19376, "frontend_question_id": 1440, "is_new_question": false }, @@ -18714,8 +19082,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 16762, - "total_submitted": 21470, + "total_acs": 16942, + "total_submitted": 21681, "frontend_question_id": 1435, "is_new_question": false }, @@ -18737,8 +19105,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": 4699, - "total_submitted": 12815, + "total_acs": 4707, + "total_submitted": 12841, "frontend_question_id": 1453, "is_new_question": false }, @@ -18760,8 +19128,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": 19157, - "total_submitted": 33757, + "total_acs": 19242, + "total_submitted": 33913, "frontend_question_id": 1452, "is_new_question": false }, @@ -18783,8 +19151,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 38490, - "total_submitted": 61952, + "total_acs": 38773, + "total_submitted": 62346, "frontend_question_id": 1451, "is_new_question": false }, @@ -18806,8 +19174,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": 86175, - "total_submitted": 112961, + "total_acs": 86808, + "total_submitted": 113805, "frontend_question_id": 1450, "is_new_question": false }, @@ -18829,8 +19197,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 62413, - "total_submitted": 88354, + "total_acs": 63740, + "total_submitted": 90279, "frontend_question_id": 1463, "is_new_question": false }, @@ -18852,8 +19220,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 33404, - "total_submitted": 69301, + "total_acs": 33952, + "total_submitted": 70254, "frontend_question_id": 1462, "is_new_question": false }, @@ -18875,8 +19243,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": 99853, - "total_submitted": 175693, + "total_acs": 100362, + "total_submitted": 176579, "frontend_question_id": 1461, "is_new_question": false }, @@ -18898,8 +19266,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": 89250, - "total_submitted": 123327, + "total_acs": 89978, + "total_submitted": 124362, "frontend_question_id": 1460, "is_new_question": false }, @@ -18921,8 +19289,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": 11954, - "total_submitted": 21593, + "total_acs": 12044, + "total_submitted": 21775, "frontend_question_id": 1444, "is_new_question": false }, @@ -18944,8 +19312,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": 30118, - "total_submitted": 54036, + "total_acs": 30379, + "total_submitted": 54447, "frontend_question_id": 1443, "is_new_question": false }, @@ -18967,8 +19335,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": 26689, - "total_submitted": 35578, + "total_acs": 27017, + "total_submitted": 35971, "frontend_question_id": 1442, "is_new_question": false }, @@ -18990,8 +19358,8 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 62505, - "total_submitted": 87874, + "total_acs": 63349, + "total_submitted": 88987, "frontend_question_id": 1441, "is_new_question": false }, @@ -19013,8 +19381,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 18001, - "total_submitted": 21486, + "total_acs": 18283, + "total_submitted": 21796, "frontend_question_id": 1421, "is_new_question": false }, @@ -19036,8 +19404,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": 25655, - "total_submitted": 41741, + "total_acs": 25851, + "total_submitted": 42061, "frontend_question_id": 1439, "is_new_question": false }, @@ -19059,8 +19427,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": 88033, - "total_submitted": 187303, + "total_acs": 89721, + "total_submitted": 190299, "frontend_question_id": 1438, "is_new_question": false }, @@ -19082,8 +19450,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": 59196, - "total_submitted": 99248, + "total_acs": 59489, + "total_submitted": 99833, "frontend_question_id": 1437, "is_new_question": false }, @@ -19105,8 +19473,8 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 103037, - "total_submitted": 132527, + "total_acs": 103996, + "total_submitted": 133765, "frontend_question_id": 1436, "is_new_question": false }, @@ -19128,8 +19496,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": 17332, - "total_submitted": 27605, + "total_acs": 17554, + "total_submitted": 27923, "frontend_question_id": 1412, "is_new_question": false }, @@ -19151,8 +19519,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": 12508, - "total_submitted": 26728, + "total_acs": 12654, + "total_submitted": 27035, "frontend_question_id": 1449, "is_new_question": false }, @@ -19174,8 +19542,8 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 179620, - "total_submitted": 245941, + "total_acs": 183796, + "total_submitted": 251739, "frontend_question_id": 1448, "is_new_question": false }, @@ -19197,8 +19565,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 21708, - "total_submitted": 33786, + "total_acs": 21919, + "total_submitted": 34080, "frontend_question_id": 1447, "is_new_question": false }, @@ -19220,8 +19588,8 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 123205, - "total_submitted": 199162, + "total_acs": 123961, + "total_submitted": 200508, "frontend_question_id": 1446, "is_new_question": false }, @@ -19243,8 +19611,8 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 38179, - "total_submitted": 48734, + "total_acs": 40303, + "total_submitted": 52559, "frontend_question_id": 1407, "is_new_question": false }, @@ -19266,8 +19634,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 42318, - "total_submitted": 84428, + "total_acs": 42666, + "total_submitted": 85119, "frontend_question_id": 1424, "is_new_question": false }, @@ -19289,8 +19657,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": 187762, - "total_submitted": 358511, + "total_acs": 190838, + "total_submitted": 364332, "frontend_question_id": 1423, "is_new_question": false }, @@ -19312,8 +19680,8 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 39744, - "total_submitted": 68808, + "total_acs": 39965, + "total_submitted": 69192, "frontend_question_id": 1422, "is_new_question": false }, @@ -19335,8 +19703,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": 30587, - "total_submitted": 39179, + "total_acs": 31187, + "total_submitted": 39953, "frontend_question_id": 1398, "is_new_question": false }, @@ -19358,8 +19726,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": 9871, - "total_submitted": 15404, + "total_acs": 9956, + "total_submitted": 15542, "frontend_question_id": 1420, "is_new_question": false }, @@ -19381,8 +19749,8 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 25912, - "total_submitted": 52058, + "total_acs": 26092, + "total_submitted": 52402, "frontend_question_id": 1419, "is_new_question": false }, @@ -19404,8 +19772,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": 19523, - "total_submitted": 26774, + "total_acs": 19682, + "total_submitted": 26955, "frontend_question_id": 1418, "is_new_question": false }, @@ -19427,8 +19795,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 43737, - "total_submitted": 77898, + "total_acs": 43985, + "total_submitted": 78378, "frontend_question_id": 1417, "is_new_question": false }, @@ -19450,8 +19818,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": 9570, - "total_submitted": 22583, + "total_acs": 9691, + "total_submitted": 22848, "frontend_question_id": 1434, "is_new_question": false }, @@ -19473,8 +19841,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": 30666, - "total_submitted": 44723, + "total_acs": 30909, + "total_submitted": 45072, "frontend_question_id": 1433, "is_new_question": false }, @@ -19496,8 +19864,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": 12653, - "total_submitted": 29346, + "total_acs": 12726, + "total_submitted": 29543, "frontend_question_id": 1432, "is_new_question": false }, @@ -19519,8 +19887,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": 318925, - "total_submitted": 363690, + "total_acs": 322364, + "total_submitted": 367684, "frontend_question_id": 1431, "is_new_question": false }, @@ -19542,8 +19910,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": 25480, - "total_submitted": 41124, + "total_acs": 25725, + "total_submitted": 41483, "frontend_question_id": 1411, "is_new_question": false }, @@ -19565,8 +19933,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 19276, - "total_submitted": 36744, + "total_acs": 19357, + "total_submitted": 36928, "frontend_question_id": 1410, "is_new_question": false }, @@ -19588,8 +19956,8 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 38337, - "total_submitted": 46191, + "total_acs": 38617, + "total_submitted": 46506, "frontend_question_id": 1409, "is_new_question": false }, @@ -19611,8 +19979,8 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 56544, - "total_submitted": 88525, + "total_acs": 57023, + "total_submitted": 89267, "frontend_question_id": 1408, "is_new_question": false }, @@ -19634,8 +20002,8 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 36170, - "total_submitted": 39952, + "total_acs": 38276, + "total_submitted": 42235, "frontend_question_id": 1393, "is_new_question": false }, @@ -19657,8 +20025,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 37266, - "total_submitted": 61989, + "total_acs": 37745, + "total_submitted": 62833, "frontend_question_id": 1406, "is_new_question": false }, @@ -19680,8 +20048,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": 25265, - "total_submitted": 49501, + "total_acs": 25959, + "total_submitted": 50639, "frontend_question_id": 1404, "is_new_question": false }, @@ -19703,8 +20071,8 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 51880, - "total_submitted": 71867, + "total_acs": 52344, + "total_submitted": 72487, "frontend_question_id": 1403, "is_new_question": false }, @@ -19726,8 +20094,8 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 10776, - "total_submitted": 16192, + "total_acs": 11049, + "total_submitted": 16560, "frontend_question_id": 1384, "is_new_question": false }, @@ -19749,8 +20117,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 12514, - "total_submitted": 32886, + "total_acs": 12609, + "total_submitted": 33104, "frontend_question_id": 1416, "is_new_question": false }, @@ -19772,8 +20140,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": 26638, - "total_submitted": 37218, + "total_acs": 26964, + "total_submitted": 37654, "frontend_question_id": 1415, "is_new_question": false }, @@ -19795,8 +20163,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": 31723, - "total_submitted": 48603, + "total_acs": 32026, + "total_submitted": 49071, "frontend_question_id": 1414, "is_new_question": false }, @@ -19818,8 +20186,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": 72692, - "total_submitted": 105911, + "total_acs": 73333, + "total_submitted": 106889, "frontend_question_id": 1413, "is_new_question": false }, @@ -19841,8 +20209,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 4387, - "total_submitted": 10488, + "total_acs": 4462, + "total_submitted": 10627, "frontend_question_id": 1397, "is_new_question": false }, @@ -19864,8 +20232,8 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 137535, - "total_submitted": 186975, + "total_acs": 138607, + "total_submitted": 188409, "frontend_question_id": 1396, "is_new_question": false }, @@ -19887,8 +20255,8 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 88920, - "total_submitted": 128728, + "total_acs": 89835, + "total_submitted": 130209, "frontend_question_id": 1395, "is_new_question": false }, @@ -19910,8 +20278,8 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 72414, - "total_submitted": 113805, + "total_acs": 73116, + "total_submitted": 114898, "frontend_question_id": 1394, "is_new_question": false }, @@ -19933,8 +20301,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": 29939, - "total_submitted": 32819, + "total_acs": 30254, + "total_submitted": 33150, "frontend_question_id": 1378, "is_new_question": false }, @@ -19956,8 +20324,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 21998, - "total_submitted": 49375, + "total_acs": 22376, + "total_submitted": 50087, "frontend_question_id": 1392, "is_new_question": false }, @@ -19979,8 +20347,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": 21344, - "total_submitted": 45617, + "total_acs": 21492, + "total_submitted": 45882, "frontend_question_id": 1391, "is_new_question": false }, @@ -20002,8 +20370,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": 148402, - "total_submitted": 173269, + "total_acs": 150102, + "total_submitted": 175190, "frontend_question_id": 1389, "is_new_question": false }, @@ -20025,8 +20393,8 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 14399, - "total_submitted": 20775, + "total_acs": 14668, + "total_submitted": 21127, "frontend_question_id": 1369, "is_new_question": false }, @@ -20048,8 +20416,8 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 39221, - "total_submitted": 54190, + "total_acs": 39986, + "total_submitted": 55297, "frontend_question_id": 1402, "is_new_question": false }, @@ -20071,8 +20439,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 38403, - "total_submitted": 60343, + "total_acs": 38855, + "total_submitted": 61049, "frontend_question_id": 1400, "is_new_question": false }, @@ -20094,8 +20462,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 10164, - "total_submitted": 23157, + "total_acs": 10231, + "total_submitted": 23268, "frontend_question_id": 1401, "is_new_question": false }, @@ -20117,8 +20485,8 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 31843, - "total_submitted": 47574, + "total_acs": 32050, + "total_submitted": 47859, "frontend_question_id": 1399, "is_new_question": false }, @@ -20140,8 +20508,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 39571, - "total_submitted": 95159, + "total_acs": 39793, + "total_submitted": 95715, "frontend_question_id": 1383, "is_new_question": false }, @@ -20163,8 +20531,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": 155070, - "total_submitted": 177592, + "total_acs": 157089, + "total_submitted": 180006, "frontend_question_id": 1379, "is_new_question": false }, @@ -20186,8 +20554,8 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 72378, - "total_submitted": 93754, + "total_acs": 73246, + "total_submitted": 94848, "frontend_question_id": 1381, "is_new_question": false }, @@ -20209,8 +20577,8 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 66816, - "total_submitted": 94285, + "total_acs": 67565, + "total_submitted": 95361, "frontend_question_id": 1380, "is_new_question": false }, @@ -20232,8 +20600,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": 13820, - "total_submitted": 17523, + "total_acs": 13985, + "total_submitted": 17773, "frontend_question_id": 1364, "is_new_question": false }, @@ -20255,8 +20623,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 21587, - "total_submitted": 28934, + "total_acs": 21775, + "total_submitted": 29223, "frontend_question_id": 1355, "is_new_question": false }, @@ -20278,8 +20646,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 20352, - "total_submitted": 56263, + "total_acs": 20568, + "total_submitted": 56859, "frontend_question_id": 1377, "is_new_question": false }, @@ -20301,8 +20669,8 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 100837, - "total_submitted": 172956, + "total_acs": 103923, + "total_submitted": 178048, "frontend_question_id": 1376, "is_new_question": false }, @@ -20324,8 +20692,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": 40920, - "total_submitted": 62278, + "total_acs": 41152, + "total_submitted": 62640, "frontend_question_id": 1375, "is_new_question": false }, @@ -20347,8 +20715,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": 67645, - "total_submitted": 87365, + "total_acs": 68084, + "total_submitted": 87908, "frontend_question_id": 1374, "is_new_question": false }, @@ -20370,8 +20738,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 8522, - "total_submitted": 17396, + "total_acs": 8664, + "total_submitted": 17714, "frontend_question_id": 1388, "is_new_question": false }, @@ -20393,8 +20761,8 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 54513, - "total_submitted": 78186, + "total_acs": 55946, + "total_submitted": 80335, "frontend_question_id": 1387, "is_new_question": false }, @@ -20416,8 +20784,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 28066, - "total_submitted": 69817, + "total_acs": 28734, + "total_submitted": 71436, "frontend_question_id": 1386, "is_new_question": false }, @@ -20439,8 +20807,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": 55874, - "total_submitted": 85515, + "total_acs": 57175, + "total_submitted": 87430, "frontend_question_id": 1385, "is_new_question": false }, @@ -20462,8 +20830,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": 32832, - "total_submitted": 53819, + "total_acs": 33272, + "total_submitted": 54485, "frontend_question_id": 1368, "is_new_question": false }, @@ -20485,8 +20853,8 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 51443, - "total_submitted": 119588, + "total_acs": 52352, + "total_submitted": 121412, "frontend_question_id": 1367, "is_new_question": false }, @@ -20508,8 +20876,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 40044, - "total_submitted": 68463, + "total_acs": 40632, + "total_submitted": 69419, "frontend_question_id": 1366, "is_new_question": false }, @@ -20531,8 +20899,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": 323046, - "total_submitted": 373749, + "total_acs": 327728, + "total_submitted": 379063, "frontend_question_id": 1365, "is_new_question": false }, @@ -20554,8 +20922,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 41133, - "total_submitted": 45447, + "total_acs": 41492, + "total_submitted": 45820, "frontend_question_id": 1350, "is_new_question": false }, @@ -20577,8 +20945,8 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 20482, - "total_submitted": 35279, + "total_acs": 20897, + "total_submitted": 35945, "frontend_question_id": 1341, "is_new_question": false }, @@ -20600,8 +20968,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 59546, - "total_submitted": 164055, + "total_acs": 60167, + "total_submitted": 165679, "frontend_question_id": 1354, "is_new_question": false }, @@ -20623,8 +20991,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": 57312, - "total_submitted": 171793, + "total_acs": 57938, + "total_submitted": 173910, "frontend_question_id": 1353, "is_new_question": false }, @@ -20646,8 +21014,8 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 51525, - "total_submitted": 106281, + "total_acs": 52473, + "total_submitted": 107990, "frontend_question_id": 1352, "is_new_question": false }, @@ -20669,8 +21037,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": 186297, - "total_submitted": 247824, + "total_acs": 188926, + "total_submitted": 251352, "frontend_question_id": 1351, "is_new_question": false }, @@ -20692,8 +21060,8 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 35916, - "total_submitted": 92331, + "total_acs": 37045, + "total_submitted": 95255, "frontend_question_id": 1373, "is_new_question": false }, @@ -20715,8 +21083,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": 37251, - "total_submitted": 63173, + "total_acs": 37928, + "total_submitted": 64213, "frontend_question_id": 1372, "is_new_question": false }, @@ -20738,8 +21106,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": 19117, - "total_submitted": 30480, + "total_acs": 19305, + "total_submitted": 30764, "frontend_question_id": 1371, "is_new_question": false }, @@ -20761,8 +21129,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 56133, - "total_submitted": 72196, + "total_acs": 56561, + "total_submitted": 72748, "frontend_question_id": 1370, "is_new_question": false }, @@ -20784,8 +21152,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 10514, - "total_submitted": 22270, + "total_acs": 10609, + "total_submitted": 22428, "frontend_question_id": 1349, "is_new_question": false }, @@ -20807,8 +21175,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 27728, - "total_submitted": 64182, + "total_acs": 27885, + "total_submitted": 64456, "frontend_question_id": 1348, "is_new_question": false }, @@ -20830,8 +21198,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": 95297, - "total_submitted": 124482, + "total_acs": 96620, + "total_submitted": 126101, "frontend_question_id": 1347, "is_new_question": false }, @@ -20853,8 +21221,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": 210524, - "total_submitted": 587836, + "total_acs": 214221, + "total_submitted": 597835, "frontend_question_id": 1346, "is_new_question": false }, @@ -20876,8 +21244,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 9188, - "total_submitted": 17890, + "total_acs": 9286, + "total_submitted": 18172, "frontend_question_id": 1336, "is_new_question": false }, @@ -20899,8 +21267,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 19684, - "total_submitted": 31591, + "total_acs": 20139, + "total_submitted": 32244, "frontend_question_id": 1340, "is_new_question": false }, @@ -20922,8 +21290,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 58673, - "total_submitted": 136345, + "total_acs": 59202, + "total_submitted": 137604, "frontend_question_id": 1339, "is_new_question": false }, @@ -20945,8 +21313,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 87469, - "total_submitted": 128037, + "total_acs": 88269, + "total_submitted": 129249, "frontend_question_id": 1338, "is_new_question": false }, @@ -20968,8 +21336,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": 176917, - "total_submitted": 239430, + "total_acs": 180559, + "total_submitted": 244628, "frontend_question_id": 1337, "is_new_question": false }, @@ -20991,8 +21359,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": 29544, - "total_submitted": 38339, + "total_acs": 29864, + "total_submitted": 38741, "frontend_question_id": 1327, "is_new_question": false }, @@ -21014,8 +21382,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": 52795, - "total_submitted": 83527, + "total_acs": 53186, + "total_submitted": 84139, "frontend_question_id": 1359, "is_new_question": false }, @@ -21037,8 +21405,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": 39090, - "total_submitted": 62785, + "total_acs": 39908, + "total_submitted": 63949, "frontend_question_id": 1358, "is_new_question": false }, @@ -21060,8 +21428,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 15076, - "total_submitted": 21757, + "total_acs": 15199, + "total_submitted": 21922, "frontend_question_id": 1357, "is_new_question": false }, @@ -21083,8 +21451,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": 72507, - "total_submitted": 101310, + "total_acs": 73877, + "total_submitted": 103153, "frontend_question_id": 1356, "is_new_question": false }, @@ -21106,8 +21474,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 72997, - "total_submitted": 130018, + "total_acs": 73983, + "total_submitted": 131879, "frontend_question_id": 1335, "is_new_question": false }, @@ -21129,8 +21497,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": 42062, - "total_submitted": 81165, + "total_acs": 43088, + "total_submitted": 82950, "frontend_question_id": 1334, "is_new_question": false }, @@ -21152,8 +21520,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": 23022, - "total_submitted": 39013, + "total_acs": 23229, + "total_submitted": 39333, "frontend_question_id": 1333, "is_new_question": false }, @@ -21175,8 +21543,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 107069, - "total_submitted": 141049, + "total_acs": 107791, + "total_submitted": 141958, "frontend_question_id": 1332, "is_new_question": false }, @@ -21198,8 +21566,8 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 29952, - "total_submitted": 49568, + "total_acs": 30261, + "total_submitted": 49995, "frontend_question_id": 1322, "is_new_question": false }, @@ -21221,8 +21589,8 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 22884, - "total_submitted": 31618, + "total_acs": 23400, + "total_submitted": 32338, "frontend_question_id": 1321, "is_new_question": false }, @@ -21244,8 +21612,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": 57937, - "total_submitted": 120914, + "total_acs": 58615, + "total_submitted": 122354, "frontend_question_id": 1326, "is_new_question": false }, @@ -21267,8 +21635,8 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 70876, - "total_submitted": 94757, + "total_acs": 71899, + "total_submitted": 96116, "frontend_question_id": 1325, "is_new_question": false }, @@ -21290,8 +21658,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 27196, - "total_submitted": 45525, + "total_acs": 27398, + "total_submitted": 45887, "frontend_question_id": 1324, "is_new_question": false }, @@ -21313,8 +21681,8 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 114148, - "total_submitted": 144532, + "total_acs": 115214, + "total_submitted": 145840, "frontend_question_id": 1323, "is_new_question": false }, @@ -21336,8 +21704,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 74626, - "total_submitted": 168598, + "total_acs": 75733, + "total_submitted": 171107, "frontend_question_id": 1345, "is_new_question": false }, @@ -21359,8 +21727,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 94146, - "total_submitted": 148517, + "total_acs": 94852, + "total_submitted": 149650, "frontend_question_id": 1344, "is_new_question": false }, @@ -21382,8 +21750,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": 36250, - "total_submitted": 53388, + "total_acs": 36935, + "total_submitted": 54439, "frontend_question_id": 1343, "is_new_question": false }, @@ -21405,8 +21773,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": 328843, - "total_submitted": 382550, + "total_acs": 337263, + "total_submitted": 392446, "frontend_question_id": 1342, "is_new_question": false }, @@ -21428,8 +21796,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": 24898, - "total_submitted": 41388, + "total_acs": 25098, + "total_submitted": 41876, "frontend_question_id": 1320, "is_new_question": false }, @@ -21451,8 +21819,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": 84777, - "total_submitted": 146141, + "total_acs": 87503, + "total_submitted": 150706, "frontend_question_id": 1319, "is_new_question": false }, @@ -21474,8 +21842,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": 25214, - "total_submitted": 38414, + "total_acs": 25480, + "total_submitted": 38811, "frontend_question_id": 1318, "is_new_question": false }, @@ -21497,8 +21865,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": 31211, - "total_submitted": 55091, + "total_acs": 31422, + "total_submitted": 55468, "frontend_question_id": 1317, "is_new_question": false }, @@ -21520,8 +21888,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 26356, - "total_submitted": 29892, + "total_acs": 26917, + "total_submitted": 30505, "frontend_question_id": 1308, "is_new_question": false }, @@ -21543,8 +21911,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 44762, - "total_submitted": 49259, + "total_acs": 45725, + "total_submitted": 50281, "frontend_question_id": 1303, "is_new_question": false }, @@ -21566,8 +21934,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": 52078, - "total_submitted": 80828, + "total_acs": 53799, + "total_submitted": 83156, "frontend_question_id": 1312, "is_new_question": false }, @@ -21589,8 +21957,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 15452, - "total_submitted": 34039, + "total_acs": 15554, + "total_submitted": 34280, "frontend_question_id": 1311, "is_new_question": false }, @@ -21612,8 +21980,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 38053, - "total_submitted": 53181, + "total_acs": 38516, + "total_submitted": 53765, "frontend_question_id": 1310, "is_new_question": false }, @@ -21635,8 +22003,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": 83300, - "total_submitted": 105467, + "total_acs": 84444, + "total_submitted": 106801, "frontend_question_id": 1309, "is_new_question": false }, @@ -21658,8 +22026,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 7950, - "total_submitted": 20768, + "total_acs": 8054, + "total_submitted": 20965, "frontend_question_id": 2227, "is_new_question": false }, @@ -21681,8 +22049,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": 40305, - "total_submitted": 87853, + "total_acs": 40471, + "total_submitted": 88152, "frontend_question_id": 1430, "is_new_question": false }, @@ -21704,8 +22072,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": 12391, - "total_submitted": 25645, + "total_acs": 12979, + "total_submitted": 26641, "frontend_question_id": 2192, "is_new_question": false }, @@ -21727,8 +22095,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": 18552, - "total_submitted": 32338, + "total_acs": 19441, + "total_submitted": 33884, "frontend_question_id": 2269, "is_new_question": false }, @@ -21750,8 +22118,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 6988, - "total_submitted": 20253, + "total_acs": 7040, + "total_submitted": 20502, "frontend_question_id": 1307, "is_new_question": false }, @@ -21773,8 +22141,8 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 151916, - "total_submitted": 241505, + "total_acs": 154808, + "total_submitted": 246061, "frontend_question_id": 1306, "is_new_question": false }, @@ -21796,8 +22164,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": 166817, - "total_submitted": 209432, + "total_acs": 168043, + "total_submitted": 210952, "frontend_question_id": 1305, "is_new_question": false }, @@ -21819,8 +22187,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": 146959, - "total_submitted": 190696, + "total_acs": 148861, + "total_submitted": 193145, "frontend_question_id": 1304, "is_new_question": false }, @@ -21842,8 +22210,8 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 25739, - "total_submitted": 38059, + "total_acs": 26306, + "total_submitted": 38855, "frontend_question_id": 1294, "is_new_question": false }, @@ -21865,8 +22233,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": 10553, - "total_submitted": 17304, + "total_acs": 10689, + "total_submitted": 17531, "frontend_question_id": 1298, "is_new_question": false }, @@ -21888,8 +22256,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": 34576, - "total_submitted": 66172, + "total_acs": 34901, + "total_submitted": 66794, "frontend_question_id": 1297, "is_new_question": false }, @@ -21911,8 +22279,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": 61687, - "total_submitted": 109208, + "total_acs": 62225, + "total_submitted": 110141, "frontend_question_id": 1296, "is_new_question": false }, @@ -21934,8 +22302,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": 451436, - "total_submitted": 586355, + "total_acs": 456806, + "total_submitted": 593448, "frontend_question_id": 1295, "is_new_question": false }, @@ -21957,8 +22325,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": 23491, - "total_submitted": 26634, + "total_acs": 23951, + "total_submitted": 27127, "frontend_question_id": 1285, "is_new_question": false }, @@ -21980,8 +22348,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": 511, - "total_submitted": 786, + "total_acs": 549, + "total_submitted": 840, "frontend_question_id": 2263, "is_new_question": false }, @@ -22003,8 +22371,8 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 12900, - "total_submitted": 20168, + "total_acs": 13930, + "total_submitted": 21914, "frontend_question_id": 2305, "is_new_question": false }, @@ -22026,8 +22394,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 1899, - "total_submitted": 3061, + "total_acs": 2005, + "total_submitted": 3259, "frontend_question_id": 2229, "is_new_question": false }, @@ -22049,8 +22417,8 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 26078, - "total_submitted": 35053, + "total_acs": 26623, + "total_submitted": 35752, "frontend_question_id": 1280, "is_new_question": false }, @@ -22072,8 +22440,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": 109839, - "total_submitted": 252004, + "total_acs": 113263, + "total_submitted": 259875, "frontend_question_id": 1293, "is_new_question": false }, @@ -22095,8 +22463,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": 25554, - "total_submitted": 48386, + "total_acs": 25812, + "total_submitted": 48810, "frontend_question_id": 1292, "is_new_question": false }, @@ -22118,8 +22486,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": 301865, - "total_submitted": 365342, + "total_acs": 305912, + "total_submitted": 370331, "frontend_question_id": 1290, "is_new_question": false }, @@ -22141,8 +22509,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 9041, - "total_submitted": 12069, + "total_acs": 9119, + "total_submitted": 12203, "frontend_question_id": 1279, "is_new_question": false }, @@ -22164,8 +22532,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": 24666, - "total_submitted": 34232, + "total_acs": 25105, + "total_submitted": 34894, "frontend_question_id": 1284, "is_new_question": false }, @@ -22187,8 +22555,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": 86971, - "total_submitted": 159808, + "total_acs": 87929, + "total_submitted": 161202, "frontend_question_id": 1283, "is_new_question": false }, @@ -22210,8 +22578,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": 82277, - "total_submitted": 96387, + "total_acs": 83035, + "total_submitted": 97241, "frontend_question_id": 1282, "is_new_question": false }, @@ -22233,8 +22601,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": 251153, - "total_submitted": 290231, + "total_acs": 256276, + "total_submitted": 296033, "frontend_question_id": 1281, "is_new_question": false }, @@ -22256,8 +22624,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": 39963, - "total_submitted": 45425, + "total_acs": 40493, + "total_submitted": 46040, "frontend_question_id": 1270, "is_new_question": false }, @@ -22279,8 +22647,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 42392, - "total_submitted": 44953, + "total_acs": 42785, + "total_submitted": 45384, "frontend_question_id": 1265, "is_new_question": false }, @@ -22302,8 +22670,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 19333, - "total_submitted": 31773, + "total_acs": 19642, + "total_submitted": 32314, "frontend_question_id": 1278, "is_new_question": false }, @@ -22325,8 +22693,8 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 169086, - "total_submitted": 227636, + "total_acs": 171019, + "total_submitted": 230119, "frontend_question_id": 1277, "is_new_question": false }, @@ -22348,8 +22716,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": 18632, - "total_submitted": 36828, + "total_acs": 18775, + "total_submitted": 37123, "frontend_question_id": 1276, "is_new_question": false }, @@ -22371,8 +22739,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": 82805, - "total_submitted": 151930, + "total_acs": 84157, + "total_submitted": 154481, "frontend_question_id": 1275, "is_new_question": false }, @@ -22394,8 +22762,8 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 25122, - "total_submitted": 37069, + "total_acs": 25691, + "total_submitted": 37896, "frontend_question_id": 1264, "is_new_question": false }, @@ -22417,8 +22785,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": 28409, - "total_submitted": 65338, + "total_acs": 28567, + "total_submitted": 65717, "frontend_question_id": 1269, "is_new_question": false }, @@ -22440,8 +22808,8 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 207898, - "total_submitted": 310106, + "total_acs": 211239, + "total_submitted": 315120, "frontend_question_id": 1268, "is_new_question": false }, @@ -22463,8 +22831,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 44242, - "total_submitted": 75315, + "total_acs": 44854, + "total_submitted": 76201, "frontend_question_id": 1267, "is_new_question": false }, @@ -22486,8 +22854,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 119261, - "total_submitted": 150689, + "total_acs": 120065, + "total_submitted": 151699, "frontend_question_id": 1266, "is_new_question": false }, @@ -22509,8 +22877,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 12902, - "total_submitted": 20273, + "total_acs": 13808, + "total_submitted": 21557, "frontend_question_id": 2304, "is_new_question": false }, @@ -22532,8 +22900,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": 9763, - "total_submitted": 19870, + "total_acs": 10100, + "total_submitted": 20615, "frontend_question_id": 2218, "is_new_question": false }, @@ -22555,8 +22923,8 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 29390, - "total_submitted": 42395, + "total_acs": 30526, + "total_submitted": 44025, "frontend_question_id": 2215, "is_new_question": false }, @@ -22578,8 +22946,8 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 90120, - "total_submitted": 151458, + "total_acs": 90202, + "total_submitted": 151604, "frontend_question_id": 1426, "is_new_question": false }, @@ -22601,8 +22969,8 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 38020, - "total_submitted": 45614, + "total_acs": 38893, + "total_submitted": 46613, "frontend_question_id": 1251, "is_new_question": false }, @@ -22624,8 +22992,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": 21918, - "total_submitted": 44959, + "total_acs": 22137, + "total_submitted": 45333, "frontend_question_id": 1263, "is_new_question": false }, @@ -22647,8 +23015,8 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 39481, - "total_submitted": 77561, + "total_acs": 39890, + "total_submitted": 78334, "frontend_question_id": 1262, "is_new_question": false }, @@ -22670,8 +23038,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": 45927, - "total_submitted": 60719, + "total_acs": 46464, + "total_submitted": 61377, "frontend_question_id": 1261, "is_new_question": false }, @@ -22693,8 +23061,8 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 85789, - "total_submitted": 126003, + "total_acs": 86245, + "total_submitted": 126707, "frontend_question_id": 1260, "is_new_question": false }, @@ -22716,8 +23084,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": 921, - "total_submitted": 1426, + "total_acs": 955, + "total_submitted": 1475, "frontend_question_id": 2189, "is_new_question": false }, @@ -22739,8 +23107,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": 5278, - "total_submitted": 9012, + "total_acs": 5388, + "total_submitted": 9163, "frontend_question_id": 1618, "is_new_question": false }, @@ -22762,8 +23130,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 542, - "total_submitted": 972, + "total_acs": 548, + "total_submitted": 989, "frontend_question_id": 2198, "is_new_question": false }, @@ -22785,8 +23153,8 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 19911, - "total_submitted": 32100, + "total_acs": 20838, + "total_submitted": 33464, "frontend_question_id": 2303, "is_new_question": false }, @@ -22808,8 +23176,8 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 22518, - "total_submitted": 31133, + "total_acs": 22906, + "total_submitted": 31641, "frontend_question_id": 1255, "is_new_question": false }, @@ -22831,8 +23199,8 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 96731, - "total_submitted": 151977, + "total_acs": 99125, + "total_submitted": 155452, "frontend_question_id": 1254, "is_new_question": false }, @@ -22854,8 +23222,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 19881, - "total_submitted": 45670, + "total_acs": 20057, + "total_submitted": 46032, "frontend_question_id": 1253, "is_new_question": false }, @@ -22877,8 +23245,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": 81664, - "total_submitted": 104051, + "total_acs": 82284, + "total_submitted": 104823, "frontend_question_id": 1252, "is_new_question": false }, @@ -22900,8 +23268,8 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 26779, - "total_submitted": 39458, + "total_acs": 27002, + "total_submitted": 39800, "frontend_question_id": 1241, "is_new_question": false }, @@ -22923,8 +23291,8 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 4889, - "total_submitted": 10607, + "total_acs": 5333, + "total_submitted": 11482, "frontend_question_id": 2312, "is_new_question": false }, @@ -22946,8 +23314,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 11380, - "total_submitted": 33053, + "total_acs": 11634, + "total_submitted": 33703, "frontend_question_id": 2217, "is_new_question": false }, @@ -22969,8 +23337,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": 151065, - "total_submitted": 286599, + "total_acs": 151755, + "total_submitted": 287776, "frontend_question_id": 1428, "is_new_question": false }, @@ -22992,8 +23360,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": 13916, - "total_submitted": 23899, + "total_acs": 14140, + "total_submitted": 24227, "frontend_question_id": 1250, "is_new_question": false }, @@ -23015,8 +23383,8 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 440806, - "total_submitted": 671410, + "total_acs": 444857, + "total_submitted": 677604, "frontend_question_id": 1249, "is_new_question": false }, @@ -23038,8 +23406,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 57402, - "total_submitted": 97489, + "total_acs": 58291, + "total_submitted": 98892, "frontend_question_id": 1248, "is_new_question": false }, @@ -23061,8 +23429,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 28727, - "total_submitted": 45112, + "total_acs": 28921, + "total_submitted": 45387, "frontend_question_id": 1247, "is_new_question": false }, @@ -23084,8 +23452,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 35011, - "total_submitted": 71685, + "total_acs": 35353, + "total_submitted": 72328, "frontend_question_id": 1242, "is_new_question": false }, @@ -23107,8 +23475,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 11899, - "total_submitted": 21992, + "total_acs": 12193, + "total_submitted": 22490, "frontend_question_id": 1691, "is_new_question": false }, @@ -23130,8 +23498,8 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 72844, - "total_submitted": 138842, + "total_acs": 73084, + "total_submitted": 139266, "frontend_question_id": 1429, "is_new_question": false }, @@ -23153,8 +23521,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 19319, - "total_submitted": 31923, + "total_acs": 19465, + "total_submitted": 32172, "frontend_question_id": 1726, "is_new_question": false }, @@ -23176,8 +23544,8 @@ "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, + "total_acs": 25063, + "total_submitted": 35869, "frontend_question_id": 2309, "is_new_question": false }, @@ -23199,8 +23567,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 26373, - "total_submitted": 40937, + "total_acs": 26599, + "total_submitted": 41234, "frontend_question_id": 1227, "is_new_question": false }, @@ -23222,8 +23590,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": 18439, - "total_submitted": 34326, + "total_acs": 18848, + "total_submitted": 35065, "frontend_question_id": 1240, "is_new_question": false }, @@ -23245,8 +23613,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": 109428, - "total_submitted": 216742, + "total_acs": 110509, + "total_submitted": 218750, "frontend_question_id": 1239, "is_new_question": false }, @@ -23268,8 +23636,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 12641, - "total_submitted": 18472, + "total_acs": 12797, + "total_submitted": 18676, "frontend_question_id": 1238, "is_new_question": false }, @@ -23291,8 +23659,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": 50458, - "total_submitted": 72872, + "total_acs": 50918, + "total_submitted": 73502, "frontend_question_id": 1237, "is_new_question": false }, @@ -23314,8 +23682,8 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 14653, - "total_submitted": 23076, + "total_acs": 14884, + "total_submitted": 23412, "frontend_question_id": 1225, "is_new_question": false }, @@ -23337,8 +23705,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": 6344, - "total_submitted": 14455, + "total_acs": 6859, + "total_submitted": 15442, "frontend_question_id": 2193, "is_new_question": false }, @@ -23360,8 +23728,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 19431, - "total_submitted": 42853, + "total_acs": 19894, + "total_submitted": 43721, "frontend_question_id": 2216, "is_new_question": false }, @@ -23383,8 +23751,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": 20735, - "total_submitted": 30330, + "total_acs": 21335, + "total_submitted": 31102, "frontend_question_id": 2225, "is_new_question": false }, @@ -23406,8 +23774,8 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 22318, - "total_submitted": 39270, + "total_acs": 23379, + "total_submitted": 40987, "frontend_question_id": 2273, "is_new_question": false }, @@ -23429,8 +23797,8 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 120190, - "total_submitted": 235943, + "total_acs": 122386, + "total_submitted": 240249, "frontend_question_id": 1235, "is_new_question": false }, @@ -23452,8 +23820,8 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 23687, - "total_submitted": 64819, + "total_acs": 23893, + "total_submitted": 65323, "frontend_question_id": 1234, "is_new_question": false }, @@ -23475,8 +23843,8 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 43567, - "total_submitted": 66789, + "total_acs": 43761, + "total_submitted": 67077, "frontend_question_id": 1233, "is_new_question": false }, @@ -23498,8 +23866,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": 120679, - "total_submitted": 290085, + "total_acs": 122073, + "total_submitted": 293571, "frontend_question_id": 1232, "is_new_question": false }, @@ -23521,8 +23889,8 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 9643, - "total_submitted": 18440, + "total_acs": 11826, + "total_submitted": 22018, "frontend_question_id": 2321, "is_new_question": false }, @@ -23544,8 +23912,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": 935, - "total_submitted": 1301, + "total_acs": 964, + "total_submitted": 1343, "frontend_question_id": 2204, "is_new_question": false }, @@ -23567,8 +23935,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": 16572, - "total_submitted": 74197, + "total_acs": 16907, + "total_submitted": 75588, "frontend_question_id": 2202, "is_new_question": false }, @@ -23590,8 +23958,8 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 70753, - "total_submitted": 130810, + "total_acs": 70889, + "total_submitted": 131044, "frontend_question_id": 1427, "is_new_question": false }, @@ -23613,8 +23981,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 11067, - "total_submitted": 30228, + "total_acs": 11131, + "total_submitted": 30414, "frontend_question_id": 1224, "is_new_question": false }, @@ -23636,8 +24004,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 22422, - "total_submitted": 46698, + "total_acs": 22630, + "total_submitted": 47078, "frontend_question_id": 1223, "is_new_question": false }, @@ -23659,8 +24027,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 33105, - "total_submitted": 46414, + "total_acs": 33331, + "total_submitted": 46699, "frontend_question_id": 1222, "is_new_question": false }, @@ -23682,8 +24050,8 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 204383, - "total_submitted": 241852, + "total_acs": 206025, + "total_submitted": 243880, "frontend_question_id": 1221, "is_new_question": false }, @@ -23705,8 +24073,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 19972, - "total_submitted": 34982, + "total_acs": 20160, + "total_submitted": 35317, "frontend_question_id": 1226, "is_new_question": false }, @@ -23728,8 +24096,8 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 26422, - "total_submitted": 45956, + "total_acs": 26710, + "total_submitted": 46467, "frontend_question_id": 1212, "is_new_question": false }, @@ -23751,8 +24119,8 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 26986, - "total_submitted": 37908, + "total_acs": 27538, + "total_submitted": 38631, "frontend_question_id": 1211, "is_new_question": false }, @@ -23774,8 +24142,8 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 13477, - "total_submitted": 22478, + "total_acs": 13638, + "total_submitted": 22734, "frontend_question_id": 1206, "is_new_question": false }, @@ -23797,8 +24165,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": 2129, - "total_submitted": 7243, + "total_acs": 2166, + "total_submitted": 7335, "frontend_question_id": 1960, "is_new_question": false }, @@ -23820,8 +24188,8 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 17006, - "total_submitted": 48342, + "total_acs": 17531, + "total_submitted": 49623, "frontend_question_id": 2226, "is_new_question": false }, @@ -23843,8 +24211,8 @@ "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, + "total_acs": 16928, + "total_submitted": 68253, "frontend_question_id": 2310, "is_new_question": false }, @@ -23866,8 +24234,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 13181, - "total_submitted": 29851, + "total_acs": 13364, + "total_submitted": 30176, "frontend_question_id": 2191, "is_new_question": false }, @@ -23889,8 +24257,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 48554, - "total_submitted": 86384, + "total_acs": 48992, + "total_submitted": 87184, "frontend_question_id": 1220, "is_new_question": false }, @@ -23912,8 +24280,8 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 85743, - "total_submitted": 131261, + "total_acs": 86792, + "total_submitted": 132998, "frontend_question_id": 1219, "is_new_question": false }, @@ -23935,8 +24303,8 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 51201, - "total_submitted": 98923, + "total_acs": 51909, + "total_submitted": 100159, "frontend_question_id": 1218, "is_new_question": false }, @@ -23958,8 +24326,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": 98088, - "total_submitted": 135270, + "total_acs": 98864, + "total_submitted": 136394, "frontend_question_id": 1217, "is_new_question": false }, @@ -23981,8 +24349,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 16298, - "total_submitted": 36687, + "total_acs": 16542, + "total_submitted": 37260, "frontend_question_id": 1205, "is_new_question": false }, @@ -24004,8 +24372,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": 30490, - "total_submitted": 41307, + "total_acs": 30823, + "total_submitted": 41773, "frontend_question_id": 1204, "is_new_question": false }, @@ -24027,8 +24395,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 6278, - "total_submitted": 22351, + "total_acs": 6346, + "total_submitted": 22522, "frontend_question_id": 1862, "is_new_question": false }, @@ -24050,8 +24418,8 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 47318, - "total_submitted": 100064, + "total_acs": 48367, + "total_submitted": 101946, "frontend_question_id": 1514, "is_new_question": false }, @@ -24073,8 +24441,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 30305, - "total_submitted": 45524, + "total_acs": 33331, + "total_submitted": 50150, "frontend_question_id": 1706, "is_new_question": false }, @@ -24096,8 +24464,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": 7446, - "total_submitted": 15406, + "total_acs": 7487, + "total_submitted": 15481, "frontend_question_id": 1210, "is_new_question": false }, @@ -24119,8 +24487,8 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 30057, - "total_submitted": 64152, + "total_acs": 30299, + "total_submitted": 64558, "frontend_question_id": 1208, "is_new_question": false }, @@ -24142,8 +24510,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": 214536, - "total_submitted": 382394, + "total_acs": 216493, + "total_submitted": 386174, "frontend_question_id": 1209, "is_new_question": false }, @@ -24165,8 +24533,8 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 136739, - "total_submitted": 190418, + "total_acs": 139490, + "total_submitted": 194404, "frontend_question_id": 1207, "is_new_question": false }, @@ -24188,8 +24556,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 13914, - "total_submitted": 26812, + "total_acs": 14109, + "total_submitted": 27172, "frontend_question_id": 1194, "is_new_question": false }, @@ -24211,8 +24579,8 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 25233, - "total_submitted": 37498, + "total_acs": 25881, + "total_submitted": 38423, "frontend_question_id": 1193, "is_new_question": false }, @@ -24234,8 +24602,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 29449, - "total_submitted": 40745, + "total_acs": 29867, + "total_submitted": 41249, "frontend_question_id": 1195, "is_new_question": false }, @@ -24257,8 +24625,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": 3874, - "total_submitted": 8023, + "total_acs": 3923, + "total_submitted": 8138, "frontend_question_id": 1916, "is_new_question": false }, @@ -24280,8 +24648,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 14789, - "total_submitted": 27187, + "total_acs": 14920, + "total_submitted": 27417, "frontend_question_id": 2201, "is_new_question": false }, @@ -24303,8 +24671,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 7882, - "total_submitted": 15230, + "total_acs": 7989, + "total_submitted": 15471, "frontend_question_id": 1895, "is_new_question": false }, @@ -24326,8 +24694,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 22259, - "total_submitted": 27695, + "total_acs": 22972, + "total_submitted": 28553, "frontend_question_id": 2079, "is_new_question": false }, @@ -24349,8 +24717,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 12510, - "total_submitted": 25131, + "total_acs": 12645, + "total_submitted": 25373, "frontend_question_id": 1203, "is_new_question": false }, @@ -24372,8 +24740,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 83516, - "total_submitted": 146002, + "total_acs": 84671, + "total_submitted": 147992, "frontend_question_id": 1202, "is_new_question": false }, @@ -24395,8 +24763,8 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 21375, - "total_submitted": 75441, + "total_acs": 21692, + "total_submitted": 76414, "frontend_question_id": 1201, "is_new_question": false }, @@ -24418,8 +24786,8 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 125671, - "total_submitted": 179822, + "total_acs": 126840, + "total_submitted": 181517, "frontend_question_id": 1200, "is_new_question": false }, @@ -24441,8 +24809,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": 21745, - "total_submitted": 31069, + "total_acs": 22374, + "total_submitted": 32020, "frontend_question_id": 1944, "is_new_question": false }, @@ -24464,8 +24832,8 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 49280, - "total_submitted": 86644, + "total_acs": 50315, + "total_submitted": 88463, "frontend_question_id": 1405, "is_new_question": false }, @@ -24487,8 +24855,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 24964, - "total_submitted": 51490, + "total_acs": 25435, + "total_submitted": 52458, "frontend_question_id": 2139, "is_new_question": false }, @@ -24510,8 +24878,8 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 20393, - "total_submitted": 35890, + "total_acs": 20759, + "total_submitted": 36503, "frontend_question_id": 1957, "is_new_question": false }, @@ -24533,8 +24901,8 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 73190, - "total_submitted": 88751, + "total_acs": 74155, + "total_submitted": 89892, "frontend_question_id": 1179, "is_new_question": false }, @@ -24556,8 +24924,8 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 177340, - "total_submitted": 326444, + "total_acs": 178696, + "total_submitted": 328652, "frontend_question_id": 1192, "is_new_question": false }, @@ -24579,8 +24947,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 25368, - "total_submitted": 105295, + "total_acs": 25702, + "total_submitted": 106697, "frontend_question_id": 1191, "is_new_question": false }, @@ -24602,8 +24970,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": 50869, - "total_submitted": 77309, + "total_acs": 51417, + "total_submitted": 78100, "frontend_question_id": 1190, "is_new_question": false }, @@ -24625,8 +24993,8 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 114286, - "total_submitted": 183070, + "total_acs": 114993, + "total_submitted": 184313, "frontend_question_id": 1189, "is_new_question": false }, @@ -24648,8 +25016,8 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 21353, - "total_submitted": 63747, + "total_acs": 21740, + "total_submitted": 64781, "frontend_question_id": 1483, "is_new_question": false }, @@ -24671,8 +25039,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": 11600, - "total_submitted": 22018, + "total_acs": 11740, + "total_submitted": 22287, "frontend_question_id": 1954, "is_new_question": false }, @@ -24694,8 +25062,8 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 11882, - "total_submitted": 32197, + "total_acs": 12183, + "total_submitted": 32871, "frontend_question_id": 2080, "is_new_question": false }, @@ -24717,8 +25085,8 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 52610, - "total_submitted": 82201, + "total_acs": 53101, + "total_submitted": 83038, "frontend_question_id": 1550, "is_new_question": false }, @@ -24740,8 +25108,8 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 24021, - "total_submitted": 37668, + "total_acs": 24320, + "total_submitted": 38102, "frontend_question_id": 1174, "is_new_question": false }, @@ -24763,8 +25131,8 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 41092, - "total_submitted": 49367, + "total_acs": 41870, + "total_submitted": 50247, "frontend_question_id": 1173, "is_new_question": false }, @@ -24786,8 +25154,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 11903, - "total_submitted": 26521, + "total_acs": 12053, + "total_submitted": 26802, "frontend_question_id": 1187, "is_new_question": false }, @@ -24809,8 +25177,8 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 44959, - "total_submitted": 77253, + "total_acs": 45311, + "total_submitted": 77942, "frontend_question_id": 1185, "is_new_question": false }, @@ -24832,8 +25200,8 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 33078, - "total_submitted": 81157, + "total_acs": 33654, + "total_submitted": 82231, "frontend_question_id": 1186, "is_new_question": false }, @@ -24855,8 +25223,8 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 43054, - "total_submitted": 79483, + "total_acs": 43353, + "total_submitted": 80110, "frontend_question_id": 1184, "is_new_question": false }, @@ -24878,8 +25246,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 19413, - "total_submitted": 41401, + "total_acs": 19737, + "total_submitted": 42064, "frontend_question_id": 1425, "is_new_question": false }, @@ -24901,8 +25269,8 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 97062, - "total_submitted": 120863, + "total_acs": 98337, + "total_submitted": 122387, "frontend_question_id": 1382, "is_new_question": false }, @@ -24924,8 +25292,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 21179, - "total_submitted": 51783, + "total_acs": 21344, + "total_submitted": 52150, "frontend_question_id": 1390, "is_new_question": false }, @@ -24947,8 +25315,8 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 42876, - "total_submitted": 69072, + "total_acs": 43534, + "total_submitted": 70081, "frontend_question_id": 1507, "is_new_question": false }, @@ -24970,8 +25338,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": 27144, - "total_submitted": 58121, + "total_acs": 27217, + "total_submitted": 58316, "frontend_question_id": 1178, "is_new_question": false }, @@ -24993,8 +25361,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 20594, - "total_submitted": 55005, + "total_acs": 20738, + "total_submitted": 55333, "frontend_question_id": 1177, "is_new_question": false }, @@ -25016,8 +25384,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 25467, - "total_submitted": 48483, + "total_acs": 25698, + "total_submitted": 48914, "frontend_question_id": 1176, "is_new_question": false }, @@ -25039,8 +25407,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 20713, - "total_submitted": 39049, + "total_acs": 20945, + "total_submitted": 39401, "frontend_question_id": 1175, "is_new_question": false }, @@ -25062,8 +25430,8 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 32408, - "total_submitted": 47409, + "total_acs": 32986, + "total_submitted": 48199, "frontend_question_id": 1164, "is_new_question": false }, @@ -25085,8 +25453,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 14334, - "total_submitted": 42233, + "total_acs": 14483, + "total_submitted": 42816, "frontend_question_id": 1363, "is_new_question": false }, @@ -25108,8 +25476,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 16080, - "total_submitted": 27101, + "total_acs": 16186, + "total_submitted": 27243, "frontend_question_id": 1362, "is_new_question": false }, @@ -25131,8 +25499,8 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 36228, - "total_submitted": 88330, + "total_acs": 36604, + "total_submitted": 89429, "frontend_question_id": 1361, "is_new_question": false }, @@ -25154,8 +25522,8 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 30499, - "total_submitted": 65047, + "total_acs": 30853, + "total_submitted": 65732, "frontend_question_id": 1360, "is_new_question": false }, @@ -25177,8 +25545,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": 66414, - "total_submitted": 108610, + "total_acs": 66714, + "total_submitted": 109105, "frontend_question_id": 1170, "is_new_question": false }, @@ -25200,8 +25568,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 43213, - "total_submitted": 143401, + "total_acs": 43667, + "total_submitted": 145042, "frontend_question_id": 1169, "is_new_question": false }, @@ -25223,8 +25591,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 23434, - "total_submitted": 35587, + "total_acs": 23583, + "total_submitted": 35817, "frontend_question_id": 1236, "is_new_question": false }, @@ -25246,8 +25614,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 14077, - "total_submitted": 41339, + "total_acs": 14159, + "total_submitted": 41679, "frontend_question_id": 1172, "is_new_question": false }, @@ -25269,8 +25637,8 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 14114, - "total_submitted": 24237, + "total_acs": 14241, + "total_submitted": 24402, "frontend_question_id": 1159, "is_new_question": false }, @@ -25292,8 +25660,8 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 34405, - "total_submitted": 52537, + "total_acs": 36341, + "total_submitted": 55482, "frontend_question_id": 1158, "is_new_question": false }, @@ -25315,8 +25683,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": 37267, - "total_submitted": 87225, + "total_acs": 37649, + "total_submitted": 87992, "frontend_question_id": 1171, "is_new_question": false }, @@ -25338,8 +25706,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": 31469, - "total_submitted": 44171, + "total_acs": 32080, + "total_submitted": 44996, "frontend_question_id": 1935, "is_new_question": false }, @@ -25361,8 +25729,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": 107712, - "total_submitted": 225276, + "total_acs": 109098, + "total_submitted": 227840, "frontend_question_id": 1155, "is_new_question": false }, @@ -25384,8 +25752,8 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 13137, - "total_submitted": 31047, + "total_acs": 13267, + "total_submitted": 31392, "frontend_question_id": 1157, "is_new_question": false }, @@ -25407,8 +25775,8 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 23657, - "total_submitted": 51566, + "total_acs": 23835, + "total_submitted": 52008, "frontend_question_id": 1156, "is_new_question": false }, @@ -25430,8 +25798,8 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 34569, - "total_submitted": 68099, + "total_acs": 34892, + "total_submitted": 68854, "frontend_question_id": 1154, "is_new_question": false }, @@ -25453,8 +25821,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 26417, - "total_submitted": 55416, + "total_acs": 26793, + "total_submitted": 56208, "frontend_question_id": 1149, "is_new_question": false }, @@ -25476,8 +25844,8 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 50901, - "total_submitted": 66269, + "total_acs": 53608, + "total_submitted": 69757, "frontend_question_id": 1148, "is_new_question": false }, @@ -25499,8 +25867,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 17627, - "total_submitted": 43185, + "total_acs": 17782, + "total_submitted": 43603, "frontend_question_id": 1632, "is_new_question": false }, @@ -25522,8 +25890,8 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 62697, - "total_submitted": 107004, + "total_acs": 63670, + "total_submitted": 108633, "frontend_question_id": 1331, "is_new_question": false }, @@ -25545,8 +25913,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 3995, - "total_submitted": 10170, + "total_acs": 4023, + "total_submitted": 10223, "frontend_question_id": 1330, "is_new_question": false }, @@ -25568,8 +25936,8 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 224052, - "total_submitted": 257347, + "total_acs": 226581, + "total_submitted": 260279, "frontend_question_id": 1302, "is_new_question": false }, @@ -25591,8 +25959,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 86739, - "total_submitted": 106578, + "total_acs": 87493, + "total_submitted": 107487, "frontend_question_id": 1329, "is_new_question": false }, @@ -25614,8 +25982,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 69947, - "total_submitted": 133807, + "total_acs": 70373, + "total_submitted": 134722, "frontend_question_id": 1328, "is_new_question": false }, @@ -25637,8 +26005,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 17060, - "total_submitted": 28387, + "total_acs": 17210, + "total_submitted": 28660, "frontend_question_id": 1147, "is_new_question": false }, @@ -25660,8 +26028,8 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 446708, - "total_submitted": 757372, + "total_acs": 458260, + "total_submitted": 776859, "frontend_question_id": 1143, "is_new_question": false }, @@ -25683,8 +26051,8 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 118567, - "total_submitted": 319311, + "total_acs": 120895, + "total_submitted": 325291, "frontend_question_id": 1146, "is_new_question": false }, @@ -25706,8 +26074,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 36357, - "total_submitted": 70849, + "total_acs": 36644, + "total_submitted": 71404, "frontend_question_id": 1145, "is_new_question": false }, @@ -25729,8 +26097,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 15120, - "total_submitted": 32156, + "total_acs": 15231, + "total_submitted": 32408, "frontend_question_id": 1144, "is_new_question": false }, @@ -25752,8 +26120,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": 32029, - "total_submitted": 89108, + "total_acs": 32287, + "total_submitted": 89842, "frontend_question_id": 1142, "is_new_question": false }, @@ -25775,8 +26143,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": 46822, - "total_submitted": 91918, + "total_acs": 49112, + "total_submitted": 96701, "frontend_question_id": 1141, "is_new_question": false }, @@ -25798,8 +26166,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 11903, - "total_submitted": 23943, + "total_acs": 12027, + "total_submitted": 24169, "frontend_question_id": 1316, "is_new_question": false }, @@ -25821,8 +26189,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": 105107, - "total_submitted": 123110, + "total_acs": 106521, + "total_submitted": 124737, "frontend_question_id": 1315, "is_new_question": false }, @@ -25844,8 +26212,8 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 63104, - "total_submitted": 83783, + "total_acs": 63899, + "total_submitted": 84839, "frontend_question_id": 1314, "is_new_question": false }, @@ -25867,8 +26235,8 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 186093, - "total_submitted": 216687, + "total_acs": 187953, + "total_submitted": 218860, "frontend_question_id": 1313, "is_new_question": false }, @@ -25890,8 +26258,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 40482, - "total_submitted": 62455, + "total_acs": 40849, + "total_submitted": 63024, "frontend_question_id": 1140, "is_new_question": false }, @@ -25913,8 +26281,8 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 19049, - "total_submitted": 38342, + "total_acs": 19222, + "total_submitted": 38657, "frontend_question_id": 1139, "is_new_question": false }, @@ -25936,8 +26304,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 41010, - "total_submitted": 78389, + "total_acs": 41294, + "total_submitted": 78954, "frontend_question_id": 1138, "is_new_question": false }, @@ -25959,8 +26327,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 28245, - "total_submitted": 83795, + "total_acs": 28542, + "total_submitted": 84774, "frontend_question_id": 1132, "is_new_question": false }, @@ -25982,8 +26350,8 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 293759, - "total_submitted": 465100, + "total_acs": 301886, + "total_submitted": 477726, "frontend_question_id": 1137, "is_new_question": false }, @@ -26005,8 +26373,8 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 9492, - "total_submitted": 24453, + "total_acs": 9585, + "total_submitted": 24715, "frontend_question_id": 1301, "is_new_question": false }, @@ -26028,8 +26396,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 18540, - "total_submitted": 26925, + "total_acs": 18722, + "total_submitted": 27172, "frontend_question_id": 1274, "is_new_question": false }, @@ -26051,8 +26419,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": 26699, - "total_submitted": 61988, + "total_acs": 27032, + "total_submitted": 62741, "frontend_question_id": 1300, "is_new_question": false }, @@ -26074,8 +26442,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": 216736, - "total_submitted": 290914, + "total_acs": 219702, + "total_submitted": 294802, "frontend_question_id": 1299, "is_new_question": false }, @@ -26097,8 +26465,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 16682, - "total_submitted": 33604, + "total_acs": 16842, + "total_submitted": 33981, "frontend_question_id": 1131, "is_new_question": false }, @@ -26120,8 +26488,8 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 38351, - "total_submitted": 90470, + "total_acs": 39205, + "total_submitted": 92295, "frontend_question_id": 1129, "is_new_question": false }, @@ -26143,8 +26511,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 73731, - "total_submitted": 107686, + "total_acs": 74426, + "total_submitted": 108650, "frontend_question_id": 1130, "is_new_question": false }, @@ -26166,8 +26534,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 48809, - "total_submitted": 105205, + "total_acs": 49354, + "total_submitted": 106213, "frontend_question_id": 1128, "is_new_question": false }, @@ -26189,8 +26557,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 11513, - "total_submitted": 22475, + "total_acs": 11602, + "total_submitted": 22639, "frontend_question_id": 1127, "is_new_question": false }, @@ -26212,8 +26580,8 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 31658, - "total_submitted": 46796, + "total_acs": 32172, + "total_submitted": 47473, "frontend_question_id": 1126, "is_new_question": false }, @@ -26235,8 +26603,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 30163, - "total_submitted": 49817, + "total_acs": 30831, + "total_submitted": 51098, "frontend_question_id": 1289, "is_new_question": false }, @@ -26258,8 +26626,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 11007, - "total_submitted": 24508, + "total_acs": 11229, + "total_submitted": 24989, "frontend_question_id": 1627, "is_new_question": false }, @@ -26281,8 +26649,8 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 98503, - "total_submitted": 171673, + "total_acs": 99029, + "total_submitted": 172640, "frontend_question_id": 1288, "is_new_question": false }, @@ -26304,8 +26672,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": 64881, - "total_submitted": 108948, + "total_acs": 65365, + "total_submitted": 109792, "frontend_question_id": 1287, "is_new_question": false }, @@ -26327,8 +26695,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 16536, - "total_submitted": 34938, + "total_acs": 16684, + "total_submitted": 35295, "frontend_question_id": 1125, "is_new_question": false }, @@ -26350,8 +26718,8 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 22604, - "total_submitted": 65763, + "total_acs": 22819, + "total_submitted": 66384, "frontend_question_id": 1124, "is_new_question": false }, @@ -26373,8 +26741,8 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 78280, - "total_submitted": 111387, + "total_acs": 79025, + "total_submitted": 112397, "frontend_question_id": 1123, "is_new_question": false }, @@ -26396,8 +26764,8 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 129964, - "total_submitted": 190425, + "total_acs": 131205, + "total_submitted": 192144, "frontend_question_id": 1122, "is_new_question": false }, @@ -26419,8 +26787,8 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 32968, - "total_submitted": 55235, + "total_acs": 33242, + "total_submitted": 55702, "frontend_question_id": 1116, "is_new_question": false }, @@ -26442,8 +26810,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 34327, - "total_submitted": 51888, + "total_acs": 34733, + "total_submitted": 52485, "frontend_question_id": 1113, "is_new_question": false }, @@ -26465,8 +26833,8 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 37040, - "total_submitted": 50186, + "total_acs": 37753, + "total_submitted": 51119, "frontend_question_id": 1112, "is_new_question": false }, @@ -26488,8 +26856,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 5331, - "total_submitted": 9503, + "total_acs": 5400, + "total_submitted": 9628, "frontend_question_id": 1259, "is_new_question": false }, @@ -26511,8 +26879,8 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 79067, - "total_submitted": 129661, + "total_acs": 80004, + "total_submitted": 131138, "frontend_question_id": 1291, "is_new_question": false }, @@ -26534,8 +26902,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 63613, - "total_submitted": 86743, + "total_acs": 63843, + "total_submitted": 87021, "frontend_question_id": 1286, "is_new_question": false }, @@ -26557,8 +26925,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": 34384, - "total_submitted": 53345, + "total_acs": 34870, + "total_submitted": 54034, "frontend_question_id": 1619, "is_new_question": false }, @@ -26580,8 +26948,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 37725, - "total_submitted": 51757, + "total_acs": 38042, + "total_submitted": 52196, "frontend_question_id": 1188, "is_new_question": false }, @@ -26603,8 +26971,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": 20475, - "total_submitted": 27939, + "total_acs": 20610, + "total_submitted": 28130, "frontend_question_id": 1111, "is_new_question": false }, @@ -26626,8 +26994,8 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 162632, - "total_submitted": 234623, + "total_acs": 163868, + "total_submitted": 236392, "frontend_question_id": 1110, "is_new_question": false }, @@ -26649,8 +27017,8 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 41047, - "total_submitted": 69267, + "total_acs": 41508, + "total_submitted": 69922, "frontend_question_id": 1109, "is_new_question": false }, @@ -26672,8 +27040,8 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 419535, - "total_submitted": 470713, + "total_acs": 423329, + "total_submitted": 474767, "frontend_question_id": 1108, "is_new_question": false }, @@ -26695,8 +27063,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 26225, - "total_submitted": 57395, + "total_acs": 26527, + "total_submitted": 58060, "frontend_question_id": 1107, "is_new_question": false }, @@ -26718,8 +27086,8 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 108997, - "total_submitted": 159757, + "total_acs": 109881, + "total_submitted": 161091, "frontend_question_id": 1114, "is_new_question": false }, @@ -26741,8 +27109,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 9137, - "total_submitted": 19917, + "total_acs": 9166, + "total_submitted": 20002, "frontend_question_id": 1246, "is_new_question": false }, @@ -26764,8 +27132,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 8545, - "total_submitted": 14002, + "total_acs": 8601, + "total_submitted": 14075, "frontend_question_id": 1273, "is_new_question": false }, @@ -26787,8 +27155,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 20633, - "total_submitted": 33497, + "total_acs": 20760, + "total_submitted": 33685, "frontend_question_id": 1272, "is_new_question": false }, @@ -26810,8 +27178,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 8099, - "total_submitted": 14312, + "total_acs": 8162, + "total_submitted": 14416, "frontend_question_id": 1271, "is_new_question": false }, @@ -26833,8 +27201,8 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 28714, - "total_submitted": 63555, + "total_acs": 29075, + "total_submitted": 64389, "frontend_question_id": 1098, "is_new_question": false }, @@ -26856,8 +27224,8 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 19144, - "total_submitted": 32569, + "total_acs": 19334, + "total_submitted": 32921, "frontend_question_id": 1106, "is_new_question": false }, @@ -26879,8 +27247,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 34412, - "total_submitted": 59067, + "total_acs": 34755, + "total_submitted": 59626, "frontend_question_id": 1105, "is_new_question": false }, @@ -26902,8 +27270,8 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 68392, - "total_submitted": 107194, + "total_acs": 68761, + "total_submitted": 107721, "frontend_question_id": 1103, "is_new_question": false }, @@ -26925,8 +27293,8 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 34026, - "total_submitted": 45590, + "total_acs": 34354, + "total_submitted": 45990, "frontend_question_id": 1104, "is_new_question": false }, @@ -26948,8 +27316,8 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 16036, - "total_submitted": 28995, + "total_acs": 16230, + "total_submitted": 29303, "frontend_question_id": 1097, "is_new_question": false }, @@ -26971,8 +27339,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 38562, - "total_submitted": 68200, + "total_acs": 38905, + "total_submitted": 68734, "frontend_question_id": 1231, "is_new_question": false }, @@ -26994,8 +27362,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 14923, - "total_submitted": 26292, + "total_acs": 15236, + "total_submitted": 26794, "frontend_question_id": 1258, "is_new_question": false }, @@ -27017,8 +27385,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 15679, - "total_submitted": 24639, + "total_acs": 15875, + "total_submitted": 24919, "frontend_question_id": 1257, "is_new_question": false }, @@ -27040,8 +27408,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 6590, - "total_submitted": 9446, + "total_acs": 6626, + "total_submitted": 9491, "frontend_question_id": 1256, "is_new_question": false }, @@ -27063,8 +27431,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 20145, - "total_submitted": 31909, + "total_acs": 20295, + "total_submitted": 32116, "frontend_question_id": 1096, "is_new_question": false }, @@ -27086,8 +27454,8 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 54786, - "total_submitted": 89686, + "total_acs": 55235, + "total_submitted": 90314, "frontend_question_id": 1115, "is_new_question": false }, @@ -27109,8 +27477,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 32111, - "total_submitted": 58547, + "total_acs": 33045, + "total_submitted": 59673, "frontend_question_id": 1117, "is_new_question": false }, @@ -27132,8 +27500,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 46120, - "total_submitted": 128523, + "total_acs": 46915, + "total_submitted": 130817, "frontend_question_id": 1095, "is_new_question": false }, @@ -27155,8 +27523,8 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 160654, - "total_submitted": 277715, + "total_acs": 162529, + "total_submitted": 281403, "frontend_question_id": 1094, "is_new_question": false }, @@ -27178,8 +27546,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 13785, - "total_submitted": 30395, + "total_acs": 13880, + "total_submitted": 30623, "frontend_question_id": 1093, "is_new_question": false }, @@ -27201,8 +27569,8 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 42303, - "total_submitted": 96145, + "total_acs": 43013, + "total_submitted": 97681, "frontend_question_id": 550, "is_new_question": false }, @@ -27224,8 +27592,8 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 50759, - "total_submitted": 61725, + "total_acs": 51520, + "total_submitted": 62602, "frontend_question_id": 534, "is_new_question": false }, @@ -27247,8 +27615,8 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 58185, - "total_submitted": 106965, + "total_acs": 58994, + "total_submitted": 108490, "frontend_question_id": 512, "is_new_question": false }, @@ -27270,8 +27638,8 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 83546, - "total_submitted": 104249, + "total_acs": 87717, + "total_submitted": 109697, "frontend_question_id": 511, "is_new_question": false }, @@ -27293,8 +27661,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 36058, - "total_submitted": 71322, + "total_acs": 36400, + "total_submitted": 72002, "frontend_question_id": 1216, "is_new_question": false }, @@ -27316,8 +27684,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 26735, - "total_submitted": 43160, + "total_acs": 26942, + "total_submitted": 43506, "frontend_question_id": 1245, "is_new_question": false }, @@ -27339,8 +27707,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 43355, - "total_submitted": 63557, + "total_acs": 43933, + "total_submitted": 64410, "frontend_question_id": 1244, "is_new_question": false }, @@ -27362,8 +27730,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 10368, - "total_submitted": 20527, + "total_acs": 10431, + "total_submitted": 20655, "frontend_question_id": 1243, "is_new_question": false }, @@ -27385,8 +27753,8 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 53151, - "total_submitted": 98812, + "total_acs": 55497, + "total_submitted": 103547, "frontend_question_id": 1084, "is_new_question": false }, @@ -27408,8 +27776,8 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 43487, - "total_submitted": 86214, + "total_acs": 44023, + "total_submitted": 87255, "frontend_question_id": 1083, "is_new_question": false }, @@ -27431,8 +27799,8 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 43282, - "total_submitted": 57590, + "total_acs": 43798, + "total_submitted": 58252, "frontend_question_id": 1082, "is_new_question": false }, @@ -27454,8 +27822,8 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 240188, - "total_submitted": 540622, + "total_acs": 244261, + "total_submitted": 549746, "frontend_question_id": 1091, "is_new_question": false }, @@ -27477,8 +27845,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 50315, - "total_submitted": 88652, + "total_acs": 52044, + "total_submitted": 91459, "frontend_question_id": 1092, "is_new_question": false }, @@ -27500,8 +27868,8 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 28807, - "total_submitted": 47508, + "total_acs": 29086, + "total_submitted": 47932, "frontend_question_id": 1090, "is_new_question": false }, @@ -27523,8 +27891,8 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 282465, - "total_submitted": 550853, + "total_acs": 286326, + "total_submitted": 557922, "frontend_question_id": 1089, "is_new_question": false }, @@ -27546,8 +27914,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 3458, - "total_submitted": 8532, + "total_acs": 3466, + "total_submitted": 8549, "frontend_question_id": 1199, "is_new_question": false }, @@ -27569,8 +27937,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 10620, - "total_submitted": 20058, + "total_acs": 10741, + "total_submitted": 20243, "frontend_question_id": 1230, "is_new_question": false }, @@ -27592,8 +27960,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 58615, - "total_submitted": 105963, + "total_acs": 59351, + "total_submitted": 107248, "frontend_question_id": 1229, "is_new_question": false }, @@ -27615,8 +27983,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 21282, - "total_submitted": 41569, + "total_acs": 21380, + "total_submitted": 41753, "frontend_question_id": 1228, "is_new_question": false }, @@ -27638,8 +28006,8 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 37324, - "total_submitted": 47528, + "total_acs": 37895, + "total_submitted": 48239, "frontend_question_id": 1077, "is_new_question": false }, @@ -27661,8 +28029,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 41852, - "total_submitted": 81799, + "total_acs": 42375, + "total_submitted": 82812, "frontend_question_id": 1076, "is_new_question": false }, @@ -27684,8 +28052,8 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 39307, - "total_submitted": 58580, + "total_acs": 39760, + "total_submitted": 59267, "frontend_question_id": 1075, "is_new_question": false }, @@ -27707,8 +28075,8 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 71033, - "total_submitted": 93262, + "total_acs": 71882, + "total_submitted": 94354, "frontend_question_id": 1079, "is_new_question": false }, @@ -27730,8 +28098,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 40717, - "total_submitted": 71360, + "total_acs": 41155, + "total_submitted": 72068, "frontend_question_id": 1081, "is_new_question": false }, @@ -27753,8 +28121,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": 26628, - "total_submitted": 50995, + "total_acs": 26892, + "total_submitted": 51394, "frontend_question_id": 1080, "is_new_question": false }, @@ -27776,8 +28144,8 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 53477, - "total_submitted": 83416, + "total_acs": 53887, + "total_submitted": 84029, "frontend_question_id": 1078, "is_new_question": false }, @@ -27799,8 +28167,8 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 31998, - "total_submitted": 64706, + "total_acs": 32342, + "total_submitted": 65439, "frontend_question_id": 1070, "is_new_question": false }, @@ -27822,8 +28190,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 41066, - "total_submitted": 49933, + "total_acs": 41424, + "total_submitted": 50419, "frontend_question_id": 1069, "is_new_question": false }, @@ -27845,8 +28213,8 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 50670, - "total_submitted": 62730, + "total_acs": 51177, + "total_submitted": 63393, "frontend_question_id": 1068, "is_new_question": false }, @@ -27868,8 +28236,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 2236, - "total_submitted": 3688, + "total_acs": 2253, + "total_submitted": 3715, "frontend_question_id": 1183, "is_new_question": false }, @@ -27891,8 +28259,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 7674, - "total_submitted": 16833, + "total_acs": 7731, + "total_submitted": 16945, "frontend_question_id": 1215, "is_new_question": false }, @@ -27914,8 +28282,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 34276, - "total_submitted": 51587, + "total_acs": 34561, + "total_submitted": 52006, "frontend_question_id": 1214, "is_new_question": false }, @@ -27937,8 +28305,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 68506, - "total_submitted": 85660, + "total_acs": 69059, + "total_submitted": 86380, "frontend_question_id": 1213, "is_new_question": false }, @@ -27960,8 +28328,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 12578, - "total_submitted": 34756, + "total_acs": 12692, + "total_submitted": 35046, "frontend_question_id": 1073, "is_new_question": false }, @@ -27983,8 +28351,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": 17255, - "total_submitted": 27276, + "total_acs": 17373, + "total_submitted": 27455, "frontend_question_id": 1072, "is_new_question": false }, @@ -28006,8 +28374,8 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 75202, - "total_submitted": 146784, + "total_acs": 75982, + "total_submitted": 148244, "frontend_question_id": 1071, "is_new_question": false }, @@ -28029,8 +28397,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": 49412, - "total_submitted": 74448, + "total_acs": 49804, + "total_submitted": 75044, "frontend_question_id": 1074, "is_new_question": false }, @@ -28052,8 +28420,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 32586, - "total_submitted": 50755, + "total_acs": 33071, + "total_submitted": 51505, "frontend_question_id": 1168, "is_new_question": false }, @@ -28075,8 +28443,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": 28580, - "total_submitted": 37572, + "total_acs": 28735, + "total_submitted": 37782, "frontend_question_id": 1198, "is_new_question": false }, @@ -28098,8 +28466,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 119684, - "total_submitted": 299673, + "total_acs": 120742, + "total_submitted": 302316, "frontend_question_id": 1197, "is_new_question": false }, @@ -28121,8 +28489,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": 19866, - "total_submitted": 29546, + "total_acs": 20063, + "total_submitted": 29820, "frontend_question_id": 1196, "is_new_question": false }, @@ -28144,8 +28512,8 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 30937, - "total_submitted": 68302, + "total_acs": 31272, + "total_submitted": 68939, "frontend_question_id": 1054, "is_new_question": false }, @@ -28167,8 +28535,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 31960, - "total_submitted": 62297, + "total_acs": 32198, + "total_submitted": 62830, "frontend_question_id": 1053, "is_new_question": false }, @@ -28190,8 +28558,8 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 54642, - "total_submitted": 96213, + "total_acs": 55067, + "total_submitted": 96905, "frontend_question_id": 1052, "is_new_question": false }, @@ -28213,8 +28581,8 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 209624, - "total_submitted": 281135, + "total_acs": 212495, + "total_submitted": 284722, "frontend_question_id": 1051, "is_new_question": false }, @@ -28236,8 +28604,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": 57776, - "total_submitted": 79301, + "total_acs": 60418, + "total_submitted": 82900, "frontend_question_id": 1050, "is_new_question": false }, @@ -28259,8 +28627,8 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 39262, - "total_submitted": 58213, + "total_acs": 39959, + "total_submitted": 59174, "frontend_question_id": 1045, "is_new_question": false }, @@ -28282,8 +28650,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 24885, - "total_submitted": 45981, + "total_acs": 25173, + "total_submitted": 46529, "frontend_question_id": 1182, "is_new_question": false }, @@ -28305,8 +28673,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 29867, - "total_submitted": 84272, + "total_acs": 29960, + "total_submitted": 84655, "frontend_question_id": 1163, "is_new_question": false }, @@ -28328,8 +28696,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 8989, - "total_submitted": 19966, + "total_acs": 9002, + "total_submitted": 19993, "frontend_question_id": 1181, "is_new_question": false }, @@ -28351,8 +28719,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": 21202, - "total_submitted": 26892, + "total_acs": 21329, + "total_submitted": 27051, "frontend_question_id": 1180, "is_new_question": false }, @@ -28374,8 +28742,8 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 56332, - "total_submitted": 109202, + "total_acs": 57109, + "total_submitted": 110452, "frontend_question_id": 1049, "is_new_question": false }, @@ -28397,8 +28765,8 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 259521, - "total_submitted": 437435, + "total_acs": 263730, + "total_submitted": 444813, "frontend_question_id": 1048, "is_new_question": false }, @@ -28420,8 +28788,8 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 301864, - "total_submitted": 425868, + "total_acs": 305467, + "total_submitted": 431098, "frontend_question_id": 1047, "is_new_question": false }, @@ -28443,8 +28811,8 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 297908, - "total_submitted": 462557, + "total_acs": 304876, + "total_submitted": 472827, "frontend_question_id": 1046, "is_new_question": false }, @@ -28466,8 +28834,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 89546, - "total_submitted": 132925, + "total_acs": 90237, + "total_submitted": 133892, "frontend_question_id": 1167, "is_new_question": false }, @@ -28489,8 +28857,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 29829, - "total_submitted": 48191, + "total_acs": 30587, + "total_submitted": 49399, "frontend_question_id": 1166, "is_new_question": false }, @@ -28512,8 +28880,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 48426, - "total_submitted": 136772, + "total_acs": 48612, + "total_submitted": 137375, "frontend_question_id": 1153, "is_new_question": false }, @@ -28535,8 +28903,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 60341, - "total_submitted": 70415, + "total_acs": 60652, + "total_submitted": 70792, "frontend_question_id": 1165, "is_new_question": false }, @@ -28558,8 +28926,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 54595, - "total_submitted": 176508, + "total_acs": 55024, + "total_submitted": 177965, "frontend_question_id": 1044, "is_new_question": false }, @@ -28581,8 +28949,8 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 51821, - "total_submitted": 73319, + "total_acs": 53070, + "total_submitted": 74968, "frontend_question_id": 1043, "is_new_question": false }, @@ -28604,8 +28972,8 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 57022, - "total_submitted": 113973, + "total_acs": 57589, + "total_submitted": 114999, "frontend_question_id": 1042, "is_new_question": false }, @@ -28627,8 +28995,8 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 190049, - "total_submitted": 343090, + "total_acs": 191417, + "total_submitted": 345531, "frontend_question_id": 1041, "is_new_question": false }, @@ -28650,8 +29018,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 3978, - "total_submitted": 6639, + "total_acs": 3988, + "total_submitted": 6659, "frontend_question_id": 1121, "is_new_question": false }, @@ -28673,8 +29041,8 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 66376, - "total_submitted": 137792, + "total_acs": 67971, + "total_submitted": 140873, "frontend_question_id": 1162, "is_new_question": false }, @@ -28696,8 +29064,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": 107733, - "total_submitted": 162224, + "total_acs": 109024, + "total_submitted": 164199, "frontend_question_id": 1161, "is_new_question": false }, @@ -28719,8 +29087,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 32753, - "total_submitted": 87241, + "total_acs": 33070, + "total_submitted": 88197, "frontend_question_id": 1037, "is_new_question": false }, @@ -28742,8 +29110,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": 125477, - "total_submitted": 147737, + "total_acs": 126804, + "total_submitted": 149203, "frontend_question_id": 1038, "is_new_question": false }, @@ -28765,8 +29133,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 7842, - "total_submitted": 14115, + "total_acs": 7889, + "total_submitted": 14186, "frontend_question_id": 1040, "is_new_question": false }, @@ -28788,8 +29156,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": 119963, - "total_submitted": 177147, + "total_acs": 121349, + "total_submitted": 179180, "frontend_question_id": 1160, "is_new_question": false }, @@ -28811,8 +29179,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 23605, - "total_submitted": 44550, + "total_acs": 24028, + "total_submitted": 45222, "frontend_question_id": 1039, "is_new_question": false }, @@ -28834,8 +29202,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 68189, - "total_submitted": 156913, + "total_acs": 69629, + "total_submitted": 160096, "frontend_question_id": 1152, "is_new_question": false }, @@ -28857,8 +29225,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": 46883, - "total_submitted": 77336, + "total_acs": 47786, + "total_submitted": 78829, "frontend_question_id": 1151, "is_new_question": false }, @@ -28880,8 +29248,8 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 16159, - "total_submitted": 47113, + "total_acs": 16230, + "total_submitted": 47421, "frontend_question_id": 1036, "is_new_question": false }, @@ -28903,8 +29271,8 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 69600, - "total_submitted": 119531, + "total_acs": 70168, + "total_submitted": 120340, "frontend_question_id": 1035, "is_new_question": false }, @@ -28926,8 +29294,8 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 24161, - "total_submitted": 49620, + "total_acs": 24614, + "total_submitted": 50451, "frontend_question_id": 1034, "is_new_question": false }, @@ -28949,8 +29317,8 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 19937, - "total_submitted": 44120, + "total_acs": 20021, + "total_submitted": 44265, "frontend_question_id": 1033, "is_new_question": false }, @@ -28972,8 +29340,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": 33457, - "total_submitted": 58999, + "total_acs": 33772, + "total_submitted": 59517, "frontend_question_id": 1150, "is_new_question": false }, @@ -28995,8 +29363,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 44292, - "total_submitted": 71547, + "total_acs": 45008, + "total_submitted": 72660, "frontend_question_id": 1136, "is_new_question": false }, @@ -29018,8 +29386,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 58375, - "total_submitted": 95923, + "total_acs": 58970, + "total_submitted": 96808, "frontend_question_id": 1135, "is_new_question": false }, @@ -29041,8 +29409,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 48985, - "total_submitted": 92193, + "total_acs": 49569, + "total_submitted": 93192, "frontend_question_id": 1102, "is_new_question": false }, @@ -29064,8 +29432,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 29835, - "total_submitted": 44238, + "total_acs": 29964, + "total_submitted": 44417, "frontend_question_id": 1133, "is_new_question": false }, @@ -29087,8 +29455,8 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 75931, - "total_submitted": 147810, + "total_acs": 76257, + "total_submitted": 148445, "frontend_question_id": 1032, "is_new_question": false }, @@ -29110,8 +29478,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": 51609, - "total_submitted": 87062, + "total_acs": 52209, + "total_submitted": 88028, "frontend_question_id": 1031, "is_new_question": false }, @@ -29133,8 +29501,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 181944, - "total_submitted": 285195, + "total_acs": 182929, + "total_submitted": 286549, "frontend_question_id": 1029, "is_new_question": false }, @@ -29156,8 +29524,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 43325, - "total_submitted": 62608, + "total_acs": 43658, + "total_submitted": 63068, "frontend_question_id": 1030, "is_new_question": false }, @@ -29179,8 +29547,8 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 36094, - "total_submitted": 49679, + "total_acs": 36465, + "total_submitted": 50181, "frontend_question_id": 1028, "is_new_question": false }, @@ -29202,8 +29570,8 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 133707, - "total_submitted": 182416, + "total_acs": 134647, + "total_submitted": 183653, "frontend_question_id": 1026, "is_new_question": false }, @@ -29225,8 +29593,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 55628, - "total_submitted": 85170, + "total_acs": 55877, + "total_submitted": 85566, "frontend_question_id": 1120, "is_new_question": false }, @@ -29248,8 +29616,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 28655, - "total_submitted": 36622, + "total_acs": 28808, + "total_submitted": 36826, "frontend_question_id": 1134, "is_new_question": false }, @@ -29271,8 +29639,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 84525, - "total_submitted": 93133, + "total_acs": 84988, + "total_submitted": 93633, "frontend_question_id": 1119, "is_new_question": false }, @@ -29294,8 +29662,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 6567, - "total_submitted": 11616, + "total_acs": 6612, + "total_submitted": 11693, "frontend_question_id": 1118, "is_new_question": false }, @@ -29317,8 +29685,8 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 88478, - "total_submitted": 184610, + "total_acs": 89369, + "total_submitted": 186872, "frontend_question_id": 1027, "is_new_question": false }, @@ -29340,8 +29708,8 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 161411, - "total_submitted": 241827, + "total_acs": 163701, + "total_submitted": 245144, "frontend_question_id": 1025, "is_new_question": false }, @@ -29363,8 +29731,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": 39181, - "total_submitted": 60955, + "total_acs": 40302, + "total_submitted": 62723, "frontend_question_id": 1101, "is_new_question": false }, @@ -29386,8 +29754,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": 30788, - "total_submitted": 41205, + "total_acs": 31026, + "total_submitted": 41516, "frontend_question_id": 1100, "is_new_question": false }, @@ -29409,8 +29777,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 93576, - "total_submitted": 154637, + "total_acs": 94402, + "total_submitted": 156049, "frontend_question_id": 1099, "is_new_question": false }, @@ -29432,8 +29800,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": 20404, - "total_submitted": 26930, + "total_acs": 20514, + "total_submitted": 27055, "frontend_question_id": 1085, "is_new_question": false }, @@ -29455,8 +29823,8 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 48696, - "total_submitted": 97153, + "total_acs": 49211, + "total_submitted": 98143, "frontend_question_id": 1024, "is_new_question": false }, @@ -29478,8 +29846,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 32902, - "total_submitted": 55181, + "total_acs": 33213, + "total_submitted": 55642, "frontend_question_id": 1023, "is_new_question": false }, @@ -29501,8 +29869,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": 166743, - "total_submitted": 225778, + "total_acs": 167993, + "total_submitted": 227475, "frontend_question_id": 1022, "is_new_question": false }, @@ -29524,8 +29892,8 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 177522, - "total_submitted": 222008, + "total_acs": 178926, + "total_submitted": 223730, "frontend_question_id": 1021, "is_new_question": false }, @@ -29547,8 +29915,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 30540, - "total_submitted": 65672, + "total_acs": 30902, + "total_submitted": 66364, "frontend_question_id": 1088, "is_new_question": false }, @@ -29570,8 +29938,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 44043, - "total_submitted": 66752, + "total_acs": 44267, + "total_submitted": 67102, "frontend_question_id": 1087, "is_new_question": false }, @@ -29593,8 +29961,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 17796, - "total_submitted": 28404, + "total_acs": 18024, + "total_submitted": 28703, "frontend_question_id": 1065, "is_new_question": false }, @@ -29616,8 +29984,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 84881, - "total_submitted": 112596, + "total_acs": 85560, + "total_submitted": 113563, "frontend_question_id": 1086, "is_new_question": false }, @@ -29639,8 +30007,8 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 61719, - "total_submitted": 97034, + "total_acs": 63838, + "total_submitted": 100157, "frontend_question_id": 1020, "is_new_question": false }, @@ -29662,8 +30030,8 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 106336, - "total_submitted": 178150, + "total_acs": 107489, + "total_submitted": 180077, "frontend_question_id": 1019, "is_new_question": false }, @@ -29685,8 +30053,8 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 39967, - "total_submitted": 84082, + "total_acs": 40253, + "total_submitted": 84718, "frontend_question_id": 1018, "is_new_question": false }, @@ -29708,8 +30076,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 19139, - "total_submitted": 31588, + "total_acs": 19397, + "total_submitted": 31949, "frontend_question_id": 1017, "is_new_question": false }, @@ -29731,8 +30099,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 26196, - "total_submitted": 56954, + "total_acs": 26400, + "total_submitted": 57395, "frontend_question_id": 1056, "is_new_question": false }, @@ -29754,8 +30122,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 2815, - "total_submitted": 6482, + "total_acs": 2839, + "total_submitted": 6519, "frontend_question_id": 1067, "is_new_question": false }, @@ -29777,8 +30145,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 38991, - "total_submitted": 71312, + "total_acs": 39162, + "total_submitted": 71637, "frontend_question_id": 1066, "is_new_question": false }, @@ -29800,8 +30168,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 36005, - "total_submitted": 56514, + "total_acs": 36240, + "total_submitted": 56924, "frontend_question_id": 1064, "is_new_question": false }, @@ -29823,8 +30191,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": 29595, - "total_submitted": 51196, + "total_acs": 29819, + "total_submitted": 51635, "frontend_question_id": 1016, "is_new_question": false }, @@ -29846,8 +30214,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 56088, - "total_submitted": 119238, + "total_acs": 56261, + "total_submitted": 119558, "frontend_question_id": 1015, "is_new_question": false }, @@ -29869,8 +30237,8 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 62622, - "total_submitted": 106014, + "total_acs": 64158, + "total_submitted": 108327, "frontend_question_id": 1014, "is_new_question": false }, @@ -29892,8 +30260,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": 66227, - "total_submitted": 149956, + "total_acs": 66879, + "total_submitted": 151721, "frontend_question_id": 1013, "is_new_question": false }, @@ -29915,8 +30283,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 6500, - "total_submitted": 8802, + "total_acs": 6558, + "total_submitted": 8871, "frontend_question_id": 1063, "is_new_question": false }, @@ -29938,8 +30306,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 28015, - "total_submitted": 47405, + "total_acs": 28305, + "total_submitted": 47905, "frontend_question_id": 1062, "is_new_question": false }, @@ -29961,8 +30329,8 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 99733, - "total_submitted": 182003, + "total_acs": 100588, + "total_submitted": 183714, "frontend_question_id": 1060, "is_new_question": false }, @@ -29984,8 +30352,8 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 8778, - "total_submitted": 12620, + "total_acs": 9117, + "total_submitted": 13068, "frontend_question_id": 1061, "is_new_question": false }, @@ -30007,8 +30375,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 9347, - "total_submitted": 24359, + "total_acs": 9416, + "total_submitted": 24586, "frontend_question_id": 1012, "is_new_question": false }, @@ -30030,8 +30398,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": 156895, - "total_submitted": 245639, + "total_acs": 159783, + "total_submitted": 249867, "frontend_question_id": 1011, "is_new_question": false }, @@ -30053,8 +30421,8 @@ "question__title": "Pairs of Songs With Total Durations Divisible by 60", "question__title_slug": "pairs-of-songs-with-total-durations-divisible-by-60", "question__hide": false, - "total_acs": 198841, - "total_submitted": 372213, + "total_acs": 200525, + "total_submitted": 375840, "frontend_question_id": 1010, "is_new_question": false }, @@ -30076,8 +30444,8 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 132630, - "total_submitted": 213328, + "total_acs": 134354, + "total_submitted": 216202, "frontend_question_id": 1009, "is_new_question": false }, @@ -30099,8 +30467,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 7654, - "total_submitted": 17096, + "total_acs": 7694, + "total_submitted": 17176, "frontend_question_id": 1058, "is_new_question": false }, @@ -30122,8 +30490,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 61380, - "total_submitted": 105958, + "total_acs": 61540, + "total_submitted": 106301, "frontend_question_id": 1057, "is_new_question": false }, @@ -30145,8 +30513,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 60221, - "total_submitted": 103050, + "total_acs": 61680, + "total_submitted": 105349, "frontend_question_id": 1055, "is_new_question": false }, @@ -30168,8 +30536,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": 244291, - "total_submitted": 303558, + "total_acs": 247519, + "total_submitted": 307347, "frontend_question_id": 1008, "is_new_question": false }, @@ -30191,8 +30559,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 181823, - "total_submitted": 345992, + "total_acs": 182701, + "total_submitted": 347782, "frontend_question_id": 1007, "is_new_question": false }, @@ -30214,8 +30582,8 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 20610, - "total_submitted": 37680, + "total_acs": 20826, + "total_submitted": 38024, "frontend_question_id": 1006, "is_new_question": false }, @@ -30237,8 +30605,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": 56995, - "total_submitted": 111099, + "total_acs": 57784, + "total_submitted": 112636, "frontend_question_id": 1005, "is_new_question": false }, @@ -30260,8 +30628,8 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 220039, - "total_submitted": 348027, + "total_acs": 223463, + "total_submitted": 353183, "frontend_question_id": 1004, "is_new_question": false }, @@ -30283,8 +30651,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": 42627, - "total_submitted": 73613, + "total_acs": 43128, + "total_submitted": 74346, "frontend_question_id": 1003, "is_new_question": false }, @@ -30306,8 +30674,8 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 148930, - "total_submitted": 217713, + "total_acs": 150343, + "total_submitted": 219717, "frontend_question_id": 1002, "is_new_question": false }, @@ -30329,8 +30697,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 15835, - "total_submitted": 43687, + "total_acs": 15968, + "total_submitted": 44013, "frontend_question_id": 1001, "is_new_question": false }, @@ -30352,8 +30720,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 29029, - "total_submitted": 68934, + "total_acs": 29406, + "total_submitted": 69798, "frontend_question_id": 1000, "is_new_question": false }, @@ -30375,8 +30743,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 51310, - "total_submitted": 75868, + "total_acs": 51591, + "total_submitted": 76304, "frontend_question_id": 999, "is_new_question": false }, @@ -30398,8 +30766,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 27302, - "total_submitted": 41476, + "total_acs": 27488, + "total_submitted": 41719, "frontend_question_id": 998, "is_new_question": false }, @@ -30421,8 +30789,8 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 286035, - "total_submitted": 576075, + "total_acs": 289589, + "total_submitted": 583431, "frontend_question_id": 997, "is_new_question": false }, @@ -30444,8 +30812,8 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 26238, - "total_submitted": 53474, + "total_acs": 26463, + "total_submitted": 53973, "frontend_question_id": 996, "is_new_question": false }, @@ -30467,8 +30835,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": 26765, - "total_submitted": 52474, + "total_acs": 27010, + "total_submitted": 52930, "frontend_question_id": 995, "is_new_question": false }, @@ -30490,8 +30858,8 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 413586, - "total_submitted": 796736, + "total_acs": 423384, + "total_submitted": 814648, "frontend_question_id": 994, "is_new_question": false }, @@ -30513,8 +30881,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 212505, - "total_submitted": 394271, + "total_acs": 213960, + "total_submitted": 396917, "frontend_question_id": 993, "is_new_question": false }, @@ -30536,8 +30904,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 72528, - "total_submitted": 135489, + "total_acs": 73453, + "total_submitted": 137055, "frontend_question_id": 992, "is_new_question": false }, @@ -30559,8 +30927,8 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 87367, - "total_submitted": 161410, + "total_acs": 87752, + "total_submitted": 162057, "frontend_question_id": 991, "is_new_question": false }, @@ -30582,8 +30950,8 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 53598, - "total_submitted": 106462, + "total_acs": 54587, + "total_submitted": 108262, "frontend_question_id": 990, "is_new_question": false }, @@ -30605,8 +30973,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 116659, - "total_submitted": 255950, + "total_acs": 118351, + "total_submitted": 259787, "frontend_question_id": 989, "is_new_question": false }, @@ -30628,8 +30996,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 55333, - "total_submitted": 112875, + "total_acs": 55983, + "total_submitted": 114096, "frontend_question_id": 988, "is_new_question": false }, @@ -30651,8 +31019,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": 233174, - "total_submitted": 556993, + "total_acs": 236506, + "total_submitted": 563979, "frontend_question_id": 987, "is_new_question": false }, @@ -30674,8 +31042,8 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 310792, - "total_submitted": 436036, + "total_acs": 313490, + "total_submitted": 439683, "frontend_question_id": 986, "is_new_question": false }, @@ -30697,8 +31065,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 63914, - "total_submitted": 104674, + "total_acs": 64143, + "total_submitted": 104994, "frontend_question_id": 985, "is_new_question": false }, @@ -30720,8 +31088,8 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 35074, - "total_submitted": 82318, + "total_acs": 35400, + "total_submitted": 82963, "frontend_question_id": 984, "is_new_question": false }, @@ -30743,8 +31111,8 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 159827, - "total_submitted": 248915, + "total_acs": 162016, + "total_submitted": 252269, "frontend_question_id": 983, "is_new_question": false }, @@ -30766,8 +31134,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": 12660, - "total_submitted": 21969, + "total_acs": 12775, + "total_submitted": 22194, "frontend_question_id": 982, "is_new_question": false }, @@ -30789,8 +31157,8 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 192633, - "total_submitted": 366553, + "total_acs": 196653, + "total_submitted": 374541, "frontend_question_id": 981, "is_new_question": false }, @@ -30812,8 +31180,8 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 119332, - "total_submitted": 150109, + "total_acs": 120449, + "total_submitted": 151492, "frontend_question_id": 980, "is_new_question": false }, @@ -30835,8 +31203,8 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 89032, - "total_submitted": 124001, + "total_acs": 89800, + "total_submitted": 125016, "frontend_question_id": 979, "is_new_question": false }, @@ -30858,8 +31226,8 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 73427, - "total_submitted": 154497, + "total_acs": 73875, + "total_submitted": 155427, "frontend_question_id": 978, "is_new_question": false }, @@ -30881,8 +31249,8 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 1055482, - "total_submitted": 1471891, + "total_acs": 1073957, + "total_submitted": 1497282, "frontend_question_id": 977, "is_new_question": false }, @@ -30904,8 +31272,8 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 92538, - "total_submitted": 171808, + "total_acs": 94863, + "total_submitted": 176699, "frontend_question_id": 976, "is_new_question": false }, @@ -30927,8 +31295,8 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 62223, - "total_submitted": 160583, + "total_acs": 63324, + "total_submitted": 163180, "frontend_question_id": 975, "is_new_question": false }, @@ -30950,8 +31318,8 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 102624, - "total_submitted": 192989, + "total_acs": 104321, + "total_submitted": 196166, "frontend_question_id": 974, "is_new_question": false }, @@ -30973,8 +31341,8 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 795729, - "total_submitted": 1206524, + "total_acs": 807546, + "total_submitted": 1224544, "frontend_question_id": 973, "is_new_question": false }, @@ -30996,8 +31364,8 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 826510, - "total_submitted": 1210110, + "total_acs": 921946, + "total_submitted": 1335250, "frontend_question_id": 509, "is_new_question": false }, @@ -31019,8 +31387,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 5543, - "total_submitted": 12951, + "total_acs": 5582, + "total_submitted": 13034, "frontend_question_id": 972, "is_new_question": false }, @@ -31042,8 +31410,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": 35649, - "total_submitted": 71485, + "total_acs": 35779, + "total_submitted": 71715, "frontend_question_id": 971, "is_new_question": false }, @@ -31065,8 +31433,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 46940, - "total_submitted": 107738, + "total_acs": 47100, + "total_submitted": 108103, "frontend_question_id": 970, "is_new_question": false }, @@ -31088,8 +31456,8 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 75498, - "total_submitted": 108144, + "total_acs": 75847, + "total_submitted": 108582, "frontend_question_id": 969, "is_new_question": false }, @@ -31111,8 +31479,8 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 104466, - "total_submitted": 223225, + "total_acs": 105555, + "total_submitted": 225486, "frontend_question_id": 968, "is_new_question": false }, @@ -31134,8 +31502,8 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 51163, - "total_submitted": 107521, + "total_acs": 51441, + "total_submitted": 107920, "frontend_question_id": 967, "is_new_question": false }, @@ -31157,8 +31525,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 36181, - "total_submitted": 70191, + "total_acs": 36297, + "total_submitted": 70428, "frontend_question_id": 966, "is_new_question": false }, @@ -31180,8 +31548,8 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 165225, - "total_submitted": 239467, + "total_acs": 166643, + "total_submitted": 241362, "frontend_question_id": 965, "is_new_question": false }, @@ -31203,8 +31571,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 8138, - "total_submitted": 17121, + "total_acs": 8163, + "total_submitted": 17159, "frontend_question_id": 964, "is_new_question": false }, @@ -31226,8 +31594,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 23517, - "total_submitted": 43085, + "total_acs": 23602, + "total_submitted": 43274, "frontend_question_id": 963, "is_new_question": false }, @@ -31249,8 +31617,8 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 34348, - "total_submitted": 70868, + "total_acs": 34634, + "total_submitted": 71415, "frontend_question_id": 962, "is_new_question": false }, @@ -31272,8 +31640,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": 180755, - "total_submitted": 239167, + "total_acs": 181740, + "total_submitted": 240408, "frontend_question_id": 961, "is_new_question": false }, @@ -31295,8 +31663,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 10638, - "total_submitted": 18756, + "total_acs": 10727, + "total_submitted": 18903, "frontend_question_id": 960, "is_new_question": false }, @@ -31318,8 +31686,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 38279, - "total_submitted": 55610, + "total_acs": 38813, + "total_submitted": 56346, "frontend_question_id": 959, "is_new_question": false }, @@ -31341,8 +31709,8 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 119488, - "total_submitted": 222454, + "total_acs": 120437, + "total_submitted": 224204, "frontend_question_id": 958, "is_new_question": false }, @@ -31364,8 +31732,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 143559, - "total_submitted": 365247, + "total_acs": 144096, + "total_submitted": 366685, "frontend_question_id": 957, "is_new_question": false }, @@ -31387,8 +31755,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 13640, - "total_submitted": 34171, + "total_acs": 13755, + "total_submitted": 34561, "frontend_question_id": 956, "is_new_question": false }, @@ -31410,8 +31778,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 15823, - "total_submitted": 46059, + "total_acs": 15942, + "total_submitted": 46361, "frontend_question_id": 955, "is_new_question": false }, @@ -31433,8 +31801,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 72476, - "total_submitted": 186948, + "total_acs": 72875, + "total_submitted": 187922, "frontend_question_id": 954, "is_new_question": false }, @@ -31456,8 +31824,8 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 357840, - "total_submitted": 680761, + "total_acs": 359643, + "total_submitted": 684065, "frontend_question_id": 953, "is_new_question": false }, @@ -31479,8 +31847,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 44946, - "total_submitted": 111652, + "total_acs": 45111, + "total_submitted": 112115, "frontend_question_id": 952, "is_new_question": false }, @@ -31502,8 +31870,8 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 113512, - "total_submitted": 170048, + "total_acs": 114571, + "total_submitted": 171578, "frontend_question_id": 951, "is_new_question": false }, @@ -31525,8 +31893,8 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 58961, - "total_submitted": 76264, + "total_acs": 59351, + "total_submitted": 76713, "frontend_question_id": 950, "is_new_question": false }, @@ -31548,8 +31916,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 72412, - "total_submitted": 204656, + "total_acs": 72824, + "total_submitted": 205842, "frontend_question_id": 949, "is_new_question": false }, @@ -31571,8 +31939,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 40244, - "total_submitted": 86921, + "total_acs": 40492, + "total_submitted": 87459, "frontend_question_id": 948, "is_new_question": false }, @@ -31594,8 +31962,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": 106498, - "total_submitted": 188853, + "total_acs": 108247, + "total_submitted": 191811, "frontend_question_id": 947, "is_new_question": false }, @@ -31617,8 +31985,8 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 180769, - "total_submitted": 267436, + "total_acs": 181789, + "total_submitted": 268899, "frontend_question_id": 946, "is_new_question": false }, @@ -31640,8 +32008,8 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 55173, - "total_submitted": 111969, + "total_acs": 55672, + "total_submitted": 112870, "frontend_question_id": 945, "is_new_question": false }, @@ -31663,8 +32031,8 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 68319, - "total_submitted": 97734, + "total_acs": 68719, + "total_submitted": 98355, "frontend_question_id": 944, "is_new_question": false }, @@ -31686,8 +32054,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 24010, - "total_submitted": 53053, + "total_acs": 24144, + "total_submitted": 53384, "frontend_question_id": 943, "is_new_question": false }, @@ -31709,8 +32077,8 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 110176, - "total_submitted": 144779, + "total_acs": 111150, + "total_submitted": 145961, "frontend_question_id": 942, "is_new_question": false }, @@ -31732,8 +32100,8 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 303986, - "total_submitted": 902976, + "total_acs": 307052, + "total_submitted": 912813, "frontend_question_id": 941, "is_new_question": false }, @@ -31755,8 +32123,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 28041, - "total_submitted": 63271, + "total_acs": 28376, + "total_submitted": 64075, "frontend_question_id": 940, "is_new_question": false }, @@ -31778,8 +32146,8 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 109606, - "total_submitted": 204866, + "total_acs": 110984, + "total_submitted": 207496, "frontend_question_id": 939, "is_new_question": false }, @@ -31801,8 +32169,8 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 633202, - "total_submitted": 743382, + "total_acs": 638670, + "total_submitted": 749569, "frontend_question_id": 938, "is_new_question": false }, @@ -31824,14 +32192,14 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 307325, - "total_submitted": 547690, + "total_acs": 310568, + "total_submitted": 552877, "frontend_question_id": 937, "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -31847,8 +32215,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 24336, - "total_submitted": 45292, + "total_acs": 24369, + "total_submitted": 45355, "frontend_question_id": 936, "is_new_question": false }, @@ -31870,8 +32238,8 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 82384, - "total_submitted": 167089, + "total_acs": 83478, + "total_submitted": 169013, "frontend_question_id": 935, "is_new_question": false }, @@ -31893,8 +32261,8 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 99051, - "total_submitted": 186095, + "total_acs": 100934, + "total_submitted": 189129, "frontend_question_id": 934, "is_new_question": false }, @@ -31916,8 +32284,8 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 124342, - "total_submitted": 169991, + "total_acs": 125033, + "total_submitted": 170995, "frontend_question_id": 933, "is_new_question": false }, @@ -31939,8 +32307,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 36562, - "total_submitted": 56343, + "total_acs": 36710, + "total_submitted": 56554, "frontend_question_id": 932, "is_new_question": false }, @@ -31962,8 +32330,8 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 135632, - "total_submitted": 200029, + "total_acs": 138955, + "total_submitted": 204651, "frontend_question_id": 931, "is_new_question": false }, @@ -31985,8 +32353,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 48594, - "total_submitted": 98342, + "total_acs": 49484, + "total_submitted": 99791, "frontend_question_id": 930, "is_new_question": false }, @@ -32008,8 +32376,8 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 368353, - "total_submitted": 547678, + "total_acs": 371369, + "total_submitted": 552283, "frontend_question_id": 929, "is_new_question": false }, @@ -32031,8 +32399,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 15925, - "total_submitted": 37618, + "total_acs": 16061, + "total_submitted": 37965, "frontend_question_id": 928, "is_new_question": false }, @@ -32054,8 +32422,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 26076, - "total_submitted": 66126, + "total_acs": 26166, + "total_submitted": 66323, "frontend_question_id": 927, "is_new_question": false }, @@ -32077,8 +32445,8 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 98506, - "total_submitted": 166401, + "total_acs": 100191, + "total_submitted": 169017, "frontend_question_id": 926, "is_new_question": false }, @@ -32100,8 +32468,8 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 97043, - "total_submitted": 282411, + "total_acs": 97986, + "total_submitted": 285626, "frontend_question_id": 925, "is_new_question": false }, @@ -32123,8 +32491,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 38267, - "total_submitted": 91208, + "total_acs": 38727, + "total_submitted": 92237, "frontend_question_id": 924, "is_new_question": false }, @@ -32146,8 +32514,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 88858, - "total_submitted": 195319, + "total_acs": 89372, + "total_submitted": 196470, "frontend_question_id": 923, "is_new_question": false }, @@ -32169,8 +32537,8 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 189584, - "total_submitted": 268205, + "total_acs": 191023, + "total_submitted": 270236, "frontend_question_id": 922, "is_new_question": false }, @@ -32192,8 +32560,8 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 218368, - "total_submitted": 284169, + "total_acs": 220576, + "total_submitted": 287250, "frontend_question_id": 921, "is_new_question": false }, @@ -32215,8 +32583,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 20107, - "total_submitted": 40049, + "total_acs": 20338, + "total_submitted": 40433, "frontend_question_id": 920, "is_new_question": false }, @@ -32238,8 +32606,8 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 39897, - "total_submitted": 61953, + "total_acs": 40158, + "total_submitted": 62310, "frontend_question_id": 919, "is_new_question": false }, @@ -32261,8 +32629,8 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 124203, - "total_submitted": 331308, + "total_acs": 126037, + "total_submitted": 335416, "frontend_question_id": 918, "is_new_question": false }, @@ -32284,8 +32652,8 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 137300, - "total_submitted": 224516, + "total_acs": 138190, + "total_submitted": 225871, "frontend_question_id": 917, "is_new_question": false }, @@ -32307,8 +32675,8 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 51109, - "total_submitted": 97524, + "total_acs": 51334, + "total_submitted": 98019, "frontend_question_id": 916, "is_new_question": false }, @@ -32330,8 +32698,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 67578, - "total_submitted": 139410, + "total_acs": 68000, + "total_submitted": 140304, "frontend_question_id": 915, "is_new_question": false }, @@ -32353,8 +32721,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": 89099, - "total_submitted": 272343, + "total_acs": 89959, + "total_submitted": 275458, "frontend_question_id": 914, "is_new_question": false }, @@ -32376,8 +32744,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 15333, - "total_submitted": 42965, + "total_acs": 15428, + "total_submitted": 43285, "frontend_question_id": 913, "is_new_question": false }, @@ -32399,8 +32767,8 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 283948, - "total_submitted": 463977, + "total_acs": 288945, + "total_submitted": 472323, "frontend_question_id": 912, "is_new_question": false }, @@ -32422,8 +32790,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 41226, - "total_submitted": 79664, + "total_acs": 41646, + "total_submitted": 80447, "frontend_question_id": 911, "is_new_question": false }, @@ -32445,8 +32813,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 35146, - "total_submitted": 105940, + "total_acs": 35552, + "total_submitted": 106911, "frontend_question_id": 910, "is_new_question": false }, @@ -32468,8 +32836,8 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 78274, - "total_submitted": 192610, + "total_acs": 79470, + "total_submitted": 195420, "frontend_question_id": 909, "is_new_question": false }, @@ -32491,8 +32859,8 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 61754, - "total_submitted": 91619, + "total_acs": 62125, + "total_submitted": 92146, "frontend_question_id": 908, "is_new_question": false }, @@ -32514,8 +32882,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 84885, - "total_submitted": 249522, + "total_acs": 87256, + "total_submitted": 255976, "frontend_question_id": 907, "is_new_question": false }, @@ -32537,8 +32905,8 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 21638, - "total_submitted": 55027, + "total_acs": 21667, + "total_submitted": 55093, "frontend_question_id": 906, "is_new_question": false }, @@ -32560,8 +32928,8 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 518566, - "total_submitted": 684830, + "total_acs": 522674, + "total_submitted": 690227, "frontend_question_id": 905, "is_new_question": false }, @@ -32583,8 +32951,8 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 214759, - "total_submitted": 503480, + "total_acs": 218094, + "total_submitted": 512003, "frontend_question_id": 904, "is_new_question": false }, @@ -32606,8 +32974,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 10904, - "total_submitted": 19114, + "total_acs": 11371, + "total_submitted": 19843, "frontend_question_id": 903, "is_new_question": false }, @@ -32629,8 +32997,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": 36148, - "total_submitted": 88226, + "total_acs": 36325, + "total_submitted": 88601, "frontend_question_id": 902, "is_new_question": false }, @@ -32652,8 +33020,8 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 132239, - "total_submitted": 208759, + "total_acs": 134622, + "total_submitted": 212203, "frontend_question_id": 901, "is_new_question": false }, @@ -32675,8 +33043,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 53805, - "total_submitted": 91269, + "total_acs": 54627, + "total_submitted": 92543, "frontend_question_id": 900, "is_new_question": false }, @@ -32698,8 +33066,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 26287, - "total_submitted": 44819, + "total_acs": 26384, + "total_submitted": 44989, "frontend_question_id": 899, "is_new_question": false }, @@ -32721,8 +33089,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 26903, - "total_submitted": 73972, + "total_acs": 27113, + "total_submitted": 74514, "frontend_question_id": 898, "is_new_question": false }, @@ -32744,8 +33112,8 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 219476, - "total_submitted": 280197, + "total_acs": 221161, + "total_submitted": 282233, "frontend_question_id": 897, "is_new_question": false }, @@ -32767,8 +33135,8 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 215571, - "total_submitted": 369557, + "total_acs": 217778, + "total_submitted": 373392, "frontend_question_id": 896, "is_new_question": false }, @@ -32790,8 +33158,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 130572, - "total_submitted": 196128, + "total_acs": 131789, + "total_submitted": 197890, "frontend_question_id": 895, "is_new_question": false }, @@ -32813,8 +33181,8 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 88481, - "total_submitted": 111104, + "total_acs": 89694, + "total_submitted": 112495, "frontend_question_id": 894, "is_new_question": false }, @@ -32836,8 +33204,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 41819, - "total_submitted": 59215, + "total_acs": 41941, + "total_submitted": 59382, "frontend_question_id": 893, "is_new_question": false }, @@ -32859,8 +33227,8 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 29702, - "total_submitted": 47629, + "total_acs": 29857, + "total_submitted": 47821, "frontend_question_id": 892, "is_new_question": false }, @@ -32882,8 +33250,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 16042, - "total_submitted": 44663, + "total_acs": 16179, + "total_submitted": 44958, "frontend_question_id": 891, "is_new_question": false }, @@ -32905,8 +33273,8 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 100044, - "total_submitted": 132357, + "total_acs": 100552, + "total_submitted": 132994, "frontend_question_id": 890, "is_new_question": false }, @@ -32928,8 +33296,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": 74134, - "total_submitted": 105557, + "total_acs": 75102, + "total_submitted": 106844, "frontend_question_id": 889, "is_new_question": false }, @@ -32951,8 +33319,8 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 84586, - "total_submitted": 140071, + "total_acs": 85259, + "total_submitted": 141207, "frontend_question_id": 888, "is_new_question": false }, @@ -32974,8 +33342,8 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 48247, - "total_submitted": 177338, + "total_acs": 49228, + "total_submitted": 180880, "frontend_question_id": 887, "is_new_question": false }, @@ -32997,8 +33365,8 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 112598, - "total_submitted": 235856, + "total_acs": 114323, + "total_submitted": 238943, "frontend_question_id": 886, "is_new_question": false }, @@ -33020,8 +33388,8 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 35417, - "total_submitted": 48832, + "total_acs": 35771, + "total_submitted": 49279, "frontend_question_id": 885, "is_new_question": false }, @@ -33043,8 +33411,8 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 100601, - "total_submitted": 153120, + "total_acs": 101258, + "total_submitted": 154083, "frontend_question_id": 884, "is_new_question": false }, @@ -33066,8 +33434,8 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 41747, - "total_submitted": 59434, + "total_acs": 41993, + "total_submitted": 59735, "frontend_question_id": 883, "is_new_question": false }, @@ -33089,8 +33457,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 20983, - "total_submitted": 41824, + "total_acs": 21127, + "total_submitted": 42075, "frontend_question_id": 882, "is_new_question": false }, @@ -33112,8 +33480,8 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 148542, - "total_submitted": 282743, + "total_acs": 149856, + "total_submitted": 285167, "frontend_question_id": 881, "is_new_question": false }, @@ -33135,8 +33503,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 33909, - "total_submitted": 119745, + "total_acs": 34056, + "total_submitted": 120245, "frontend_question_id": 880, "is_new_question": false }, @@ -33158,8 +33526,8 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 34146, - "total_submitted": 86537, + "total_acs": 34268, + "total_submitted": 86814, "frontend_question_id": 478, "is_new_question": false }, @@ -33181,8 +33549,8 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 34690, - "total_submitted": 88507, + "total_acs": 34790, + "total_submitted": 88718, "frontend_question_id": 497, "is_new_question": false }, @@ -33204,8 +33572,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 13995, - "total_submitted": 35486, + "total_acs": 14086, + "total_submitted": 35740, "frontend_question_id": 519, "is_new_question": false }, @@ -33227,8 +33595,8 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 312542, - "total_submitted": 676868, + "total_acs": 316244, + "total_submitted": 684861, "frontend_question_id": 528, "is_new_question": false }, @@ -33250,8 +33618,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 15354, - "total_submitted": 37811, + "total_acs": 15474, + "total_submitted": 38199, "frontend_question_id": 879, "is_new_question": false }, @@ -33273,8 +33641,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 30175, - "total_submitted": 84037, + "total_acs": 30341, + "total_submitted": 84507, "frontend_question_id": 878, "is_new_question": false }, @@ -33296,8 +33664,8 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 158914, - "total_submitted": 229348, + "total_acs": 160540, + "total_submitted": 231459, "frontend_question_id": 877, "is_new_question": false }, @@ -33319,8 +33687,8 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 727490, - "total_submitted": 995538, + "total_acs": 755946, + "total_submitted": 1032534, "frontend_question_id": 876, "is_new_question": false }, @@ -33342,8 +33710,8 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 191325, - "total_submitted": 353800, + "total_acs": 196433, + "total_submitted": 364822, "frontend_question_id": 875, "is_new_question": false }, @@ -33365,8 +33733,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 32550, - "total_submitted": 85672, + "total_acs": 32709, + "total_submitted": 86060, "frontend_question_id": 874, "is_new_question": false }, @@ -33388,8 +33756,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 49006, - "total_submitted": 100826, + "total_acs": 50164, + "total_submitted": 103122, "frontend_question_id": 873, "is_new_question": false }, @@ -33411,8 +33779,8 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 169800, - "total_submitted": 261122, + "total_acs": 171189, + "total_submitted": 263208, "frontend_question_id": 872, "is_new_question": false }, @@ -33434,8 +33802,8 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 64219, - "total_submitted": 137394, + "total_acs": 64538, + "total_submitted": 138101, "frontend_question_id": 470, "is_new_question": false }, @@ -33457,8 +33825,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 73060, - "total_submitted": 203704, + "total_acs": 73843, + "total_submitted": 205585, "frontend_question_id": 871, "is_new_question": false }, @@ -33480,8 +33848,8 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 54290, - "total_submitted": 105652, + "total_acs": 54591, + "total_submitted": 106166, "frontend_question_id": 870, "is_new_question": false }, @@ -33503,8 +33871,8 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 41677, - "total_submitted": 68123, + "total_acs": 41844, + "total_submitted": 68453, "frontend_question_id": 869, "is_new_question": false }, @@ -33526,8 +33894,8 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 60332, - "total_submitted": 97622, + "total_acs": 60680, + "total_submitted": 98170, "frontend_question_id": 868, "is_new_question": false }, @@ -33549,8 +33917,8 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 203178, - "total_submitted": 317937, + "total_acs": 205036, + "total_submitted": 321082, "frontend_question_id": 867, "is_new_question": false }, @@ -33572,8 +33940,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 26046, - "total_submitted": 100558, + "total_acs": 26149, + "total_submitted": 100907, "frontend_question_id": 866, "is_new_question": false }, @@ -33595,8 +33963,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": 105756, - "total_submitted": 155286, + "total_acs": 106516, + "total_submitted": 156246, "frontend_question_id": 865, "is_new_question": false }, @@ -33618,8 +33986,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 24681, - "total_submitted": 54779, + "total_acs": 24929, + "total_submitted": 55359, "frontend_question_id": 864, "is_new_question": false }, @@ -33641,8 +34009,8 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 30255, - "total_submitted": 90433, + "total_acs": 30745, + "total_submitted": 91545, "frontend_question_id": 710, "is_new_question": false }, @@ -33664,8 +34032,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": 244477, - "total_submitted": 397574, + "total_acs": 248212, + "total_submitted": 403150, "frontend_question_id": 863, "is_new_question": false }, @@ -33687,8 +34055,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": 72884, - "total_submitted": 279091, + "total_acs": 73669, + "total_submitted": 282194, "frontend_question_id": 862, "is_new_question": false }, @@ -33710,8 +34078,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 35927, - "total_submitted": 47992, + "total_acs": 36239, + "total_submitted": 48401, "frontend_question_id": 861, "is_new_question": false }, @@ -33733,8 +34101,8 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 100812, - "total_submitted": 191481, + "total_acs": 102001, + "total_submitted": 193594, "frontend_question_id": 860, "is_new_question": false }, @@ -33756,8 +34124,8 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 123841, - "total_submitted": 429306, + "total_acs": 124949, + "total_submitted": 432762, "frontend_question_id": 859, "is_new_question": false }, @@ -33779,8 +34147,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 26606, - "total_submitted": 44643, + "total_acs": 26665, + "total_submitted": 44752, "frontend_question_id": 858, "is_new_question": false }, @@ -33802,8 +34170,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 52138, - "total_submitted": 100739, + "total_acs": 52571, + "total_submitted": 101485, "frontend_question_id": 857, "is_new_question": false }, @@ -33825,8 +34193,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 141144, - "total_submitted": 216108, + "total_acs": 142075, + "total_submitted": 217577, "frontend_question_id": 856, "is_new_question": false }, @@ -33848,8 +34216,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 48386, - "total_submitted": 111018, + "total_acs": 48659, + "total_submitted": 111714, "frontend_question_id": 855, "is_new_question": false }, @@ -33871,8 +34239,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 34163, - "total_submitted": 86791, + "total_acs": 34673, + "total_submitted": 87876, "frontend_question_id": 854, "is_new_question": false }, @@ -33894,8 +34262,8 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 88267, - "total_submitted": 180856, + "total_acs": 90668, + "total_submitted": 185368, "frontend_question_id": 853, "is_new_question": false }, @@ -33917,14 +34285,14 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 403094, - "total_submitted": 577256, + "total_acs": 411007, + "total_submitted": 589008, "frontend_question_id": 852, "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -33940,8 +34308,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 25414, - "total_submitted": 44468, + "total_acs": 25884, + "total_submitted": 45234, "frontend_question_id": 851, "is_new_question": false }, @@ -33963,8 +34331,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 29885, - "total_submitted": 55946, + "total_acs": 29994, + "total_submitted": 56144, "frontend_question_id": 850, "is_new_question": false }, @@ -33986,8 +34354,8 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 178212, - "total_submitted": 375456, + "total_acs": 179543, + "total_submitted": 378147, "frontend_question_id": 849, "is_new_question": false }, @@ -34009,8 +34377,8 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 74127, - "total_submitted": 163274, + "total_acs": 74837, + "total_submitted": 164757, "frontend_question_id": 848, "is_new_question": false }, @@ -34032,8 +34400,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 59130, - "total_submitted": 96403, + "total_acs": 59864, + "total_submitted": 97659, "frontend_question_id": 847, "is_new_question": false }, @@ -34055,8 +34423,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 91722, - "total_submitted": 162926, + "total_acs": 92976, + "total_submitted": 165123, "frontend_question_id": 846, "is_new_question": false }, @@ -34078,8 +34446,8 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 94043, - "total_submitted": 235268, + "total_acs": 94870, + "total_submitted": 237353, "frontend_question_id": 845, "is_new_question": false }, @@ -34101,8 +34469,8 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 491720, - "total_submitted": 1025243, + "total_acs": 501269, + "total_submitted": 1044290, "frontend_question_id": 844, "is_new_question": false }, @@ -34124,8 +34492,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 120034, - "total_submitted": 281026, + "total_acs": 121235, + "total_submitted": 284185, "frontend_question_id": 843, "is_new_question": false }, @@ -34147,8 +34515,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 31365, - "total_submitted": 82834, + "total_acs": 31904, + "total_submitted": 84080, "frontend_question_id": 842, "is_new_question": false }, @@ -34170,8 +34538,8 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 206849, - "total_submitted": 297834, + "total_acs": 211031, + "total_submitted": 303326, "frontend_question_id": 841, "is_new_question": false }, @@ -34193,8 +34561,8 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 32674, - "total_submitted": 85051, + "total_acs": 32823, + "total_submitted": 85410, "frontend_question_id": 840, "is_new_question": false }, @@ -34216,8 +34584,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 54370, - "total_submitted": 117445, + "total_acs": 55378, + "total_submitted": 118992, "frontend_question_id": 839, "is_new_question": false }, @@ -34239,8 +34607,8 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 59248, - "total_submitted": 112966, + "total_acs": 59599, + "total_submitted": 113587, "frontend_question_id": 838, "is_new_question": false }, @@ -34262,8 +34630,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 32018, - "total_submitted": 88844, + "total_acs": 32212, + "total_submitted": 89339, "frontend_question_id": 837, "is_new_question": false }, @@ -34285,8 +34653,8 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 104690, - "total_submitted": 242287, + "total_acs": 105614, + "total_submitted": 244288, "frontend_question_id": 836, "is_new_question": false }, @@ -34308,8 +34676,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 126788, - "total_submitted": 166407, + "total_acs": 128225, + "total_submitted": 168152, "frontend_question_id": 489, "is_new_question": false }, @@ -34331,8 +34699,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 47861, - "total_submitted": 78260, + "total_acs": 47959, + "total_submitted": 78488, "frontend_question_id": 835, "is_new_question": false }, @@ -34354,8 +34722,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 42890, - "total_submitted": 80318, + "total_acs": 43334, + "total_submitted": 81021, "frontend_question_id": 834, "is_new_question": false }, @@ -34377,8 +34745,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 116998, - "total_submitted": 215527, + "total_acs": 118807, + "total_submitted": 219113, "frontend_question_id": 833, "is_new_question": false }, @@ -34400,8 +34768,8 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 305234, - "total_submitted": 381978, + "total_acs": 307939, + "total_submitted": 385079, "frontend_question_id": 832, "is_new_question": false }, @@ -34423,8 +34791,8 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 182461, - "total_submitted": 373908, + "total_acs": 184763, + "total_submitted": 378460, "frontend_question_id": 622, "is_new_question": false }, @@ -34446,8 +34814,8 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 45017, - "total_submitted": 78381, + "total_acs": 45573, + "total_submitted": 79262, "frontend_question_id": 641, "is_new_question": false }, @@ -34469,8 +34837,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 14672, - "total_submitted": 31706, + "total_acs": 14729, + "total_submitted": 31809, "frontend_question_id": 831, "is_new_question": false }, @@ -34492,8 +34860,8 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 73328, - "total_submitted": 142301, + "total_acs": 73740, + "total_submitted": 143040, "frontend_question_id": 830, "is_new_question": false }, @@ -34515,8 +34883,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 70082, - "total_submitted": 170265, + "total_acs": 70477, + "total_submitted": 171194, "frontend_question_id": 829, "is_new_question": false }, @@ -34538,8 +34906,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": 48718, - "total_submitted": 97037, + "total_acs": 50374, + "total_submitted": 100084, "frontend_question_id": 828, "is_new_question": false }, @@ -34561,8 +34929,8 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 112025, - "total_submitted": 250093, + "total_acs": 113076, + "total_submitted": 252410, "frontend_question_id": 827, "is_new_question": false }, @@ -34584,8 +34952,8 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 40358, - "total_submitted": 94071, + "total_acs": 41335, + "total_submitted": 95852, "frontend_question_id": 826, "is_new_question": false }, @@ -34607,8 +34975,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 65791, - "total_submitted": 142679, + "total_acs": 66114, + "total_submitted": 143416, "frontend_question_id": 825, "is_new_question": false }, @@ -34630,8 +34998,8 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 144845, - "total_submitted": 214060, + "total_acs": 145404, + "total_submitted": 214816, "frontend_question_id": 824, "is_new_question": false }, @@ -34653,8 +35021,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": 117132, - "total_submitted": 339904, + "total_acs": 118077, + "total_submitted": 342675, "frontend_question_id": 708, "is_new_question": false }, @@ -34676,8 +35044,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 37284, - "total_submitted": 85407, + "total_acs": 37464, + "total_submitted": 85790, "frontend_question_id": 823, "is_new_question": false }, @@ -34699,8 +35067,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 13419, - "total_submitted": 29864, + "total_acs": 13548, + "total_submitted": 30091, "frontend_question_id": 822, "is_new_question": false }, @@ -34722,8 +35090,8 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 135640, - "total_submitted": 190839, + "total_acs": 136550, + "total_submitted": 192014, "frontend_question_id": 821, "is_new_question": false }, @@ -34745,8 +35113,8 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 87458, - "total_submitted": 144140, + "total_acs": 87943, + "total_submitted": 144929, "frontend_question_id": 820, "is_new_question": false }, @@ -34768,8 +35136,8 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 200566, - "total_submitted": 739408, + "total_acs": 203813, + "total_submitted": 749985, "frontend_question_id": 707, "is_new_question": false }, @@ -34791,8 +35159,8 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 294070, - "total_submitted": 651183, + "total_acs": 296017, + "total_submitted": 655787, "frontend_question_id": 819, "is_new_question": false }, @@ -34814,8 +35182,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 47696, - "total_submitted": 110446, + "total_acs": 50368, + "total_submitted": 116188, "frontend_question_id": 818, "is_new_question": false }, @@ -34837,8 +35205,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 70928, - "total_submitted": 122128, + "total_acs": 71432, + "total_submitted": 122978, "frontend_question_id": 817, "is_new_question": false }, @@ -34860,8 +35228,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 25899, - "total_submitted": 46255, + "total_acs": 26009, + "total_submitted": 46460, "frontend_question_id": 816, "is_new_question": false }, @@ -34883,8 +35251,8 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 91679, - "total_submitted": 202150, + "total_acs": 93600, + "total_submitted": 206264, "frontend_question_id": 815, "is_new_question": false }, @@ -34906,8 +35274,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 145148, - "total_submitted": 204781, + "total_acs": 146197, + "total_submitted": 206347, "frontend_question_id": 814, "is_new_question": false }, @@ -34929,8 +35297,8 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 41234, - "total_submitted": 78253, + "total_acs": 41511, + "total_submitted": 78744, "frontend_question_id": 813, "is_new_question": false }, @@ -34952,8 +35320,8 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 33719, - "total_submitted": 56531, + "total_acs": 33995, + "total_submitted": 57027, "frontend_question_id": 812, "is_new_question": false }, @@ -34975,8 +35343,8 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 178320, - "total_submitted": 239381, + "total_acs": 179867, + "total_submitted": 241196, "frontend_question_id": 811, "is_new_question": false }, @@ -34998,8 +35366,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 6746, - "total_submitted": 12519, + "total_acs": 6829, + "total_submitted": 12636, "frontend_question_id": 810, "is_new_question": false }, @@ -35021,8 +35389,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 98304, - "total_submitted": 211960, + "total_acs": 98963, + "total_submitted": 213482, "frontend_question_id": 809, "is_new_question": false }, @@ -35044,8 +35412,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 15240, - "total_submitted": 35760, + "total_acs": 15354, + "total_submitted": 35997, "frontend_question_id": 808, "is_new_question": false }, @@ -35067,8 +35435,8 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 127308, - "total_submitted": 148614, + "total_acs": 128222, + "total_submitted": 149625, "frontend_question_id": 807, "is_new_question": false }, @@ -35090,8 +35458,8 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 55576, - "total_submitted": 84121, + "total_acs": 55938, + "total_submitted": 84730, "frontend_question_id": 806, "is_new_question": false }, @@ -35113,8 +35481,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 26267, - "total_submitted": 99978, + "total_acs": 26529, + "total_submitted": 101358, "frontend_question_id": 805, "is_new_question": false }, @@ -35136,8 +35504,8 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 222046, - "total_submitted": 277103, + "total_acs": 223345, + "total_submitted": 278579, "frontend_question_id": 804, "is_new_question": false }, @@ -35159,8 +35527,8 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 25489, - "total_submitted": 74927, + "total_acs": 25711, + "total_submitted": 75509, "frontend_question_id": 803, "is_new_question": false }, @@ -35182,8 +35550,8 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 85335, - "total_submitted": 160420, + "total_acs": 87472, + "total_submitted": 163766, "frontend_question_id": 802, "is_new_question": false }, @@ -35205,8 +35573,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 54236, - "total_submitted": 138553, + "total_acs": 54662, + "total_submitted": 139738, "frontend_question_id": 801, "is_new_question": false }, @@ -35228,8 +35596,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 12732, - "total_submitted": 19941, + "total_acs": 12768, + "total_submitted": 19988, "frontend_question_id": 800, "is_new_question": false }, @@ -35251,8 +35619,8 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 343873, - "total_submitted": 527256, + "total_acs": 347846, + "total_submitted": 533222, "frontend_question_id": 706, "is_new_question": false }, @@ -35274,8 +35642,8 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 237169, - "total_submitted": 358624, + "total_acs": 239612, + "total_submitted": 362493, "frontend_question_id": 705, "is_new_question": false }, @@ -35297,8 +35665,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 78085, - "total_submitted": 152380, + "total_acs": 78607, + "total_submitted": 153425, "frontend_question_id": 799, "is_new_question": false }, @@ -35320,8 +35688,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 9727, - "total_submitted": 19997, + "total_acs": 9881, + "total_submitted": 20247, "frontend_question_id": 798, "is_new_question": false }, @@ -35343,8 +35711,8 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 300808, - "total_submitted": 371096, + "total_acs": 306197, + "total_submitted": 377495, "frontend_question_id": 797, "is_new_question": false }, @@ -35366,8 +35734,8 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 155760, - "total_submitted": 294632, + "total_acs": 157822, + "total_submitted": 297747, "frontend_question_id": 796, "is_new_question": false }, @@ -35389,8 +35757,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 53880, - "total_submitted": 102801, + "total_acs": 54247, + "total_submitted": 103420, "frontend_question_id": 795, "is_new_question": false }, @@ -35412,8 +35780,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 49201, - "total_submitted": 139676, + "total_acs": 49737, + "total_submitted": 141132, "frontend_question_id": 794, "is_new_question": false }, @@ -35435,8 +35803,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 12757, - "total_submitted": 30301, + "total_acs": 12901, + "total_submitted": 30597, "frontend_question_id": 793, "is_new_question": false }, @@ -35458,8 +35826,8 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 136265, - "total_submitted": 268972, + "total_acs": 137915, + "total_submitted": 272056, "frontend_question_id": 792, "is_new_question": false }, @@ -35481,8 +35849,8 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 186607, - "total_submitted": 269254, + "total_acs": 188222, + "total_submitted": 271543, "frontend_question_id": 791, "is_new_question": false }, @@ -35504,8 +35872,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 49361, - "total_submitted": 102659, + "total_acs": 49981, + "total_submitted": 103897, "frontend_question_id": 790, "is_new_question": false }, @@ -35527,8 +35895,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 21768, - "total_submitted": 36114, + "total_acs": 21961, + "total_submitted": 36414, "frontend_question_id": 789, "is_new_question": false }, @@ -35550,8 +35918,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 86882, - "total_submitted": 152251, + "total_acs": 87357, + "total_submitted": 153103, "frontend_question_id": 788, "is_new_question": false }, @@ -35573,8 +35941,8 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 247235, - "total_submitted": 688961, + "total_acs": 251860, + "total_submitted": 701993, "frontend_question_id": 787, "is_new_question": false }, @@ -35596,8 +35964,8 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 27566, - "total_submitted": 55926, + "total_acs": 28021, + "total_submitted": 56661, "frontend_question_id": 786, "is_new_question": false }, @@ -35619,8 +35987,8 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 328391, - "total_submitted": 631305, + "total_acs": 333867, + "total_submitted": 640768, "frontend_question_id": 785, "is_new_question": false }, @@ -35642,8 +36010,8 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 224998, - "total_submitted": 308962, + "total_acs": 227964, + "total_submitted": 312711, "frontend_question_id": 784, "is_new_question": false }, @@ -35665,8 +36033,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 125607, - "total_submitted": 222864, + "total_acs": 126831, + "total_submitted": 224789, "frontend_question_id": 783, "is_new_question": false }, @@ -35688,8 +36056,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 15160, - "total_submitted": 29222, + "total_acs": 15192, + "total_submitted": 29286, "frontend_question_id": 782, "is_new_question": false }, @@ -35711,8 +36079,8 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 38294, - "total_submitted": 68918, + "total_acs": 38710, + "total_submitted": 69770, "frontend_question_id": 781, "is_new_question": false }, @@ -35734,8 +36102,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 43473, - "total_submitted": 136750, + "total_acs": 43815, + "total_submitted": 137616, "frontend_question_id": 780, "is_new_question": false }, @@ -35757,8 +36125,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 90343, - "total_submitted": 225007, + "total_acs": 91718, + "total_submitted": 228174, "frontend_question_id": 779, "is_new_question": false }, @@ -35780,8 +36148,8 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 86170, - "total_submitted": 145461, + "total_acs": 88987, + "total_submitted": 150113, "frontend_question_id": 778, "is_new_question": false }, @@ -35803,8 +36171,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 58523, - "total_submitted": 159820, + "total_acs": 59869, + "total_submitted": 162980, "frontend_question_id": 777, "is_new_question": false }, @@ -35826,8 +36194,8 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 1012908, - "total_submitted": 1835116, + "total_acs": 1049019, + "total_submitted": 1900183, "frontend_question_id": 704, "is_new_question": false }, @@ -35849,8 +36217,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 27400, - "total_submitted": 46817, + "total_acs": 27552, + "total_submitted": 47045, "frontend_question_id": 776, "is_new_question": false }, @@ -35872,8 +36240,8 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 58326, - "total_submitted": 130269, + "total_acs": 58648, + "total_submitted": 131278, "frontend_question_id": 775, "is_new_question": false }, @@ -35895,8 +36263,8 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 266034, - "total_submitted": 483425, + "total_acs": 270846, + "total_submitted": 491628, "frontend_question_id": 703, "is_new_question": false }, @@ -35918,8 +36286,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 25960, - "total_submitted": 51214, + "total_acs": 26105, + "total_submitted": 51424, "frontend_question_id": 774, "is_new_question": false }, @@ -35941,8 +36309,8 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 73763, - "total_submitted": 116361, + "total_acs": 74416, + "total_submitted": 117320, "frontend_question_id": 773, "is_new_question": false }, @@ -35964,8 +36332,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": 74358, - "total_submitted": 104688, + "total_acs": 75143, + "total_submitted": 105743, "frontend_question_id": 702, "is_new_question": false }, @@ -35987,8 +36355,8 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 88806, - "total_submitted": 185495, + "total_acs": 89609, + "total_submitted": 186870, "frontend_question_id": 772, "is_new_question": false }, @@ -36010,8 +36378,8 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 321305, - "total_submitted": 429390, + "total_acs": 325870, + "total_submitted": 435592, "frontend_question_id": 701, "is_new_question": false }, @@ -36033,8 +36401,8 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 507314, - "total_submitted": 661809, + "total_acs": 514728, + "total_submitted": 670872, "frontend_question_id": 700, "is_new_question": false }, @@ -36056,8 +36424,8 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 752892, - "total_submitted": 857468, + "total_acs": 757199, + "total_submitted": 862254, "frontend_question_id": 771, "is_new_question": false }, @@ -36079,8 +36447,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 8307, - "total_submitted": 14873, + "total_acs": 8347, + "total_submitted": 14929, "frontend_question_id": 770, "is_new_question": false }, @@ -36102,8 +36470,8 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 74454, - "total_submitted": 128822, + "total_acs": 75263, + "total_submitted": 130134, "frontend_question_id": 769, "is_new_question": false }, @@ -36125,8 +36493,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 43085, - "total_submitted": 82477, + "total_acs": 43567, + "total_submitted": 83291, "frontend_question_id": 768, "is_new_question": false }, @@ -36148,8 +36516,8 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 220166, - "total_submitted": 420866, + "total_acs": 222922, + "total_submitted": 425564, "frontend_question_id": 767, "is_new_question": false }, @@ -36171,8 +36539,8 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 193464, - "total_submitted": 284075, + "total_acs": 194926, + "total_submitted": 286136, "frontend_question_id": 766, "is_new_question": false }, @@ -36194,8 +36562,8 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 188357, - "total_submitted": 246405, + "total_acs": 190267, + "total_submitted": 248641, "frontend_question_id": 590, "is_new_question": false }, @@ -36217,8 +36585,8 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 246126, - "total_submitted": 322313, + "total_acs": 255177, + "total_submitted": 334144, "frontend_question_id": 589, "is_new_question": false }, @@ -36240,8 +36608,8 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 217109, - "total_submitted": 304696, + "total_acs": 219014, + "total_submitted": 307190, "frontend_question_id": 559, "is_new_question": false }, @@ -36263,8 +36631,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": 11441, - "total_submitted": 24144, + "total_acs": 11512, + "total_submitted": 24253, "frontend_question_id": 558, "is_new_question": false }, @@ -36286,8 +36654,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 45081, - "total_submitted": 68622, + "total_acs": 45582, + "total_submitted": 69293, "frontend_question_id": 427, "is_new_question": false }, @@ -36309,8 +36677,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": 17403, - "total_submitted": 22246, + "total_acs": 17496, + "total_submitted": 22372, "frontend_question_id": 431, "is_new_question": false }, @@ -36332,8 +36700,8 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 45530, - "total_submitted": 80323, + "total_acs": 45976, + "total_submitted": 81061, "frontend_question_id": 765, "is_new_question": false }, @@ -36355,8 +36723,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 49185, - "total_submitted": 101309, + "total_acs": 49377, + "total_submitted": 101749, "frontend_question_id": 764, "is_new_question": false }, @@ -36378,8 +36746,8 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 397108, - "total_submitted": 498555, + "total_acs": 401166, + "total_submitted": 503477, "frontend_question_id": 763, "is_new_question": false }, @@ -36401,8 +36769,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": 71027, - "total_submitted": 105884, + "total_acs": 71475, + "total_submitted": 106461, "frontend_question_id": 762, "is_new_question": false }, @@ -36424,8 +36792,8 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 241104, - "total_submitted": 408295, + "total_acs": 243245, + "total_submitted": 411791, "frontend_question_id": 430, "is_new_question": false }, @@ -36447,8 +36815,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 67819, - "total_submitted": 104870, + "total_acs": 68386, + "total_submitted": 105632, "frontend_question_id": 428, "is_new_question": false }, @@ -36470,8 +36838,8 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 184269, - "total_submitted": 266998, + "total_acs": 186461, + "total_submitted": 269988, "frontend_question_id": 429, "is_new_question": false }, @@ -36493,8 +36861,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 13662, - "total_submitted": 22769, + "total_acs": 13734, + "total_submitted": 22886, "frontend_question_id": 761, "is_new_question": false }, @@ -36516,8 +36884,8 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 82526, - "total_submitted": 99747, + "total_acs": 82912, + "total_submitted": 100206, "frontend_question_id": 760, "is_new_question": false }, @@ -36539,8 +36907,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 112677, - "total_submitted": 157955, + "total_acs": 114386, + "total_submitted": 160262, "frontend_question_id": 759, "is_new_question": false }, @@ -36562,8 +36930,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 16876, - "total_submitted": 33479, + "total_acs": 16926, + "total_submitted": 33564, "frontend_question_id": 758, "is_new_question": false }, @@ -36585,8 +36953,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 15921, - "total_submitted": 36810, + "total_acs": 16032, + "total_submitted": 37034, "frontend_question_id": 757, "is_new_question": false }, @@ -36608,8 +36976,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": 217742, - "total_submitted": 337707, + "total_acs": 219236, + "total_submitted": 339962, "frontend_question_id": 426, "is_new_question": false }, @@ -36631,8 +36999,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 27766, - "total_submitted": 51206, + "total_acs": 27932, + "total_submitted": 51660, "frontend_question_id": 756, "is_new_question": false }, @@ -36654,8 +37022,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 31100, - "total_submitted": 67913, + "total_acs": 31256, + "total_submitted": 68228, "frontend_question_id": 755, "is_new_question": false }, @@ -36677,8 +37045,8 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 39625, - "total_submitted": 94309, + "total_acs": 39952, + "total_submitted": 94943, "frontend_question_id": 754, "is_new_question": false }, @@ -36700,8 +37068,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 47423, - "total_submitted": 86403, + "total_acs": 47894, + "total_submitted": 87112, "frontend_question_id": 753, "is_new_question": false }, @@ -36723,8 +37091,8 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 169336, - "total_submitted": 305666, + "total_acs": 171388, + "total_submitted": 309375, "frontend_question_id": 752, "is_new_question": false }, @@ -36746,8 +37114,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 14670, - "total_submitted": 26812, + "total_acs": 14834, + "total_submitted": 27096, "frontend_question_id": 751, "is_new_question": false }, @@ -36769,8 +37137,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 35958, - "total_submitted": 53233, + "total_acs": 36029, + "total_submitted": 53343, "frontend_question_id": 750, "is_new_question": false }, @@ -36792,8 +37160,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 8542, - "total_submitted": 16965, + "total_acs": 8590, + "total_submitted": 17059, "frontend_question_id": 749, "is_new_question": false }, @@ -36815,8 +37183,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 51687, - "total_submitted": 87564, + "total_acs": 52064, + "total_submitted": 88169, "frontend_question_id": 748, "is_new_question": false }, @@ -36838,8 +37206,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": 164979, - "total_submitted": 362632, + "total_acs": 166856, + "total_submitted": 366131, "frontend_question_id": 747, "is_new_question": false }, @@ -36861,8 +37229,8 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 507326, - "total_submitted": 851375, + "total_acs": 572723, + "total_submitted": 936296, "frontend_question_id": 746, "is_new_question": false }, @@ -36884,8 +37252,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 84445, - "total_submitted": 203994, + "total_acs": 84948, + "total_submitted": 205222, "frontend_question_id": 745, "is_new_question": false }, @@ -36907,8 +37275,8 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 210656, - "total_submitted": 469649, + "total_acs": 214938, + "total_submitted": 479612, "frontend_question_id": 744, "is_new_question": false }, @@ -36930,8 +37298,8 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 292330, - "total_submitted": 578727, + "total_acs": 297577, + "total_submitted": 587617, "frontend_question_id": 743, "is_new_question": false }, @@ -36953,8 +37321,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 38964, - "total_submitted": 85220, + "total_acs": 39148, + "total_submitted": 85537, "frontend_question_id": 742, "is_new_question": false }, @@ -36976,8 +37344,8 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 351693, - "total_submitted": 431329, + "total_acs": 354469, + "total_submitted": 434535, "frontend_question_id": 709, "is_new_question": false }, @@ -36999,8 +37367,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 55000, - "total_submitted": 151779, + "total_acs": 55851, + "total_submitted": 153916, "frontend_question_id": 741, "is_new_question": false }, @@ -37022,8 +37390,8 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 201918, - "total_submitted": 351338, + "total_acs": 206554, + "total_submitted": 359103, "frontend_question_id": 740, "is_new_question": false }, @@ -37045,8 +37413,8 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 413337, - "total_submitted": 613145, + "total_acs": 421332, + "total_submitted": 624333, "frontend_question_id": 739, "is_new_question": false }, @@ -37068,8 +37436,8 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 38924, - "total_submitted": 83039, + "total_acs": 39220, + "total_submitted": 83668, "frontend_question_id": 738, "is_new_question": false }, @@ -37091,8 +37459,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 60602, - "total_submitted": 125293, + "total_acs": 60972, + "total_submitted": 125872, "frontend_question_id": 737, "is_new_question": false }, @@ -37114,8 +37482,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 18817, - "total_submitted": 36680, + "total_acs": 18948, + "total_submitted": 36940, "frontend_question_id": 736, "is_new_question": false }, @@ -37137,8 +37505,8 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 207123, - "total_submitted": 467283, + "total_acs": 210506, + "total_submitted": 474901, "frontend_question_id": 735, "is_new_question": false }, @@ -37160,8 +37528,8 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 51585, - "total_submitted": 119947, + "total_acs": 51767, + "total_submitted": 120400, "frontend_question_id": 734, "is_new_question": false }, @@ -37183,8 +37551,8 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 454227, - "total_submitted": 773680, + "total_acs": 469865, + "total_submitted": 796872, "frontend_question_id": 733, "is_new_question": false }, @@ -37206,8 +37574,8 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 41780, - "total_submitted": 62471, + "total_acs": 42121, + "total_submitted": 62932, "frontend_question_id": 732, "is_new_question": false }, @@ -37229,8 +37597,8 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 75835, - "total_submitted": 141126, + "total_acs": 76410, + "total_submitted": 142150, "frontend_question_id": 731, "is_new_question": false }, @@ -37252,8 +37620,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 28120, - "total_submitted": 63157, + "total_acs": 28442, + "total_submitted": 63903, "frontend_question_id": 730, "is_new_question": false }, @@ -37275,8 +37643,8 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 152171, - "total_submitted": 274981, + "total_acs": 154647, + "total_submitted": 279037, "frontend_question_id": 729, "is_new_question": false }, @@ -37298,8 +37666,8 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 179389, - "total_submitted": 232446, + "total_acs": 180288, + "total_submitted": 233509, "frontend_question_id": 728, "is_new_question": false }, @@ -37321,8 +37689,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 78296, - "total_submitted": 182755, + "total_acs": 78581, + "total_submitted": 183428, "frontend_question_id": 727, "is_new_question": false }, @@ -37344,8 +37712,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 46199, - "total_submitted": 89031, + "total_acs": 46689, + "total_submitted": 89914, "frontend_question_id": 726, "is_new_question": false }, @@ -37367,8 +37735,8 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 98552, - "total_submitted": 173083, + "total_acs": 99163, + "total_submitted": 174035, "frontend_question_id": 725, "is_new_question": false }, @@ -37390,8 +37758,8 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 351466, - "total_submitted": 671690, + "total_acs": 378284, + "total_submitted": 720219, "frontend_question_id": 724, "is_new_question": false }, @@ -37413,8 +37781,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 52205, - "total_submitted": 69149, + "total_acs": 52633, + "total_submitted": 69694, "frontend_question_id": 723, "is_new_question": false }, @@ -37436,8 +37804,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 55922, - "total_submitted": 148984, + "total_acs": 56283, + "total_submitted": 149850, "frontend_question_id": 722, "is_new_question": false }, @@ -37459,8 +37827,8 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 258422, - "total_submitted": 460977, + "total_acs": 261406, + "total_submitted": 465916, "frontend_question_id": 721, "is_new_question": false }, @@ -37482,8 +37850,8 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 119240, - "total_submitted": 232362, + "total_acs": 120605, + "total_submitted": 234618, "frontend_question_id": 720, "is_new_question": false }, @@ -37505,8 +37873,8 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 61271, - "total_submitted": 173021, + "total_acs": 61775, + "total_submitted": 174153, "frontend_question_id": 719, "is_new_question": false }, @@ -37528,8 +37896,8 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 177994, - "total_submitted": 346367, + "total_acs": 180374, + "total_submitted": 350738, "frontend_question_id": 718, "is_new_question": false }, @@ -37551,8 +37919,8 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 105532, - "total_submitted": 228799, + "total_acs": 106011, + "total_submitted": 229960, "frontend_question_id": 717, "is_new_question": false }, @@ -37574,8 +37942,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 126874, - "total_submitted": 280148, + "total_acs": 127862, + "total_submitted": 282018, "frontend_question_id": 716, "is_new_question": false }, @@ -37597,8 +37965,8 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 46932, - "total_submitted": 106553, + "total_acs": 47792, + "total_submitted": 108274, "frontend_question_id": 715, "is_new_question": false }, @@ -37620,8 +37988,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": 175228, - "total_submitted": 278663, + "total_acs": 178168, + "total_submitted": 282578, "frontend_question_id": 714, "is_new_question": false }, @@ -37643,8 +38011,8 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 176557, - "total_submitted": 398955, + "total_acs": 179518, + "total_submitted": 404943, "frontend_question_id": 713, "is_new_question": false }, @@ -37666,8 +38034,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": 65243, - "total_submitted": 105578, + "total_acs": 66006, + "total_submitted": 106707, "frontend_question_id": 712, "is_new_question": false }, @@ -37689,8 +38057,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 8512, - "total_submitted": 16510, + "total_acs": 8562, + "total_submitted": 16584, "frontend_question_id": 711, "is_new_question": false }, @@ -37712,8 +38080,8 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 20322, - "total_submitted": 46052, + "total_acs": 20425, + "total_submitted": 46280, "frontend_question_id": 699, "is_new_question": false }, @@ -37735,8 +38103,8 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 204125, - "total_submitted": 475207, + "total_acs": 206049, + "total_submitted": 482849, "frontend_question_id": 698, "is_new_question": false }, @@ -37758,8 +38126,8 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 154871, - "total_submitted": 277804, + "total_acs": 156249, + "total_submitted": 280162, "frontend_question_id": 697, "is_new_question": false }, @@ -37781,8 +38149,8 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 158722, - "total_submitted": 243637, + "total_acs": 160533, + "total_submitted": 246277, "frontend_question_id": 696, "is_new_question": false }, @@ -37804,8 +38172,8 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 500881, - "total_submitted": 713908, + "total_acs": 510173, + "total_submitted": 726110, "frontend_question_id": 695, "is_new_question": false }, @@ -37827,8 +38195,8 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 129027, - "total_submitted": 214398, + "total_acs": 130046, + "total_submitted": 215962, "frontend_question_id": 694, "is_new_question": false }, @@ -37850,8 +38218,8 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 95556, - "total_submitted": 156651, + "total_acs": 96205, + "total_submitted": 157668, "frontend_question_id": 693, "is_new_question": false }, @@ -37873,8 +38241,8 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 391470, - "total_submitted": 717899, + "total_acs": 397944, + "total_submitted": 727924, "frontend_question_id": 692, "is_new_question": false }, @@ -37896,8 +38264,8 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 31421, - "total_submitted": 67364, + "total_acs": 31606, + "total_submitted": 67849, "frontend_question_id": 691, "is_new_question": false }, @@ -37919,8 +38287,8 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 177869, - "total_submitted": 275900, + "total_acs": 179127, + "total_submitted": 277444, "frontend_question_id": 690, "is_new_question": false }, @@ -37942,8 +38310,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": 63397, - "total_submitted": 130408, + "total_acs": 63615, + "total_submitted": 130839, "frontend_question_id": 689, "is_new_question": false }, @@ -37965,8 +38333,8 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 82594, - "total_submitted": 159863, + "total_acs": 83320, + "total_submitted": 161136, "frontend_question_id": 688, "is_new_question": false }, @@ -37988,8 +38356,8 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 145670, - "total_submitted": 367536, + "total_acs": 146709, + "total_submitted": 369724, "frontend_question_id": 687, "is_new_question": false }, @@ -38011,8 +38379,8 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 124271, - "total_submitted": 368425, + "total_acs": 125252, + "total_submitted": 370895, "frontend_question_id": 686, "is_new_question": false }, @@ -38034,8 +38402,8 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 53782, - "total_submitted": 158703, + "total_acs": 54446, + "total_submitted": 160337, "frontend_question_id": 685, "is_new_question": false }, @@ -38057,8 +38425,8 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 211559, - "total_submitted": 344214, + "total_acs": 215641, + "total_submitted": 350325, "frontend_question_id": 684, "is_new_question": false }, @@ -38080,8 +38448,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 56895, - "total_submitted": 154659, + "total_acs": 57090, + "total_submitted": 155112, "frontend_question_id": 683, "is_new_question": false }, @@ -38103,8 +38471,8 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 201545, - "total_submitted": 274948, + "total_acs": 203053, + "total_submitted": 276841, "frontend_question_id": 682, "is_new_question": false }, @@ -38126,8 +38494,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 96363, - "total_submitted": 207599, + "total_acs": 96794, + "total_submitted": 208588, "frontend_question_id": 681, "is_new_question": false }, @@ -38149,8 +38517,8 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 513685, - "total_submitted": 1303155, + "total_acs": 518105, + "total_submitted": 1314312, "frontend_question_id": 680, "is_new_question": false }, @@ -38172,8 +38540,8 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 64928, - "total_submitted": 132800, + "total_acs": 65355, + "total_submitted": 133540, "frontend_question_id": 679, "is_new_question": false }, @@ -38195,8 +38563,8 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 175671, - "total_submitted": 524286, + "total_acs": 177268, + "total_submitted": 528064, "frontend_question_id": 678, "is_new_question": false }, @@ -38218,8 +38586,8 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 90913, - "total_submitted": 159559, + "total_acs": 91580, + "total_submitted": 160691, "frontend_question_id": 677, "is_new_question": false }, @@ -38241,8 +38609,8 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 64897, - "total_submitted": 114574, + "total_acs": 65390, + "total_submitted": 115354, "frontend_question_id": 676, "is_new_question": false }, @@ -38264,8 +38632,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 56579, - "total_submitted": 161110, + "total_acs": 56911, + "total_submitted": 162481, "frontend_question_id": 675, "is_new_question": false }, @@ -38287,8 +38655,8 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 198439, - "total_submitted": 407774, + "total_acs": 199770, + "total_submitted": 410203, "frontend_question_id": 674, "is_new_question": false }, @@ -38310,8 +38678,8 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 116959, - "total_submitted": 283006, + "total_acs": 118634, + "total_submitted": 286454, "frontend_question_id": 673, "is_new_question": false }, @@ -38333,8 +38701,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 17354, - "total_submitted": 34205, + "total_acs": 17455, + "total_submitted": 34403, "frontend_question_id": 672, "is_new_question": false }, @@ -38356,8 +38724,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": 146783, - "total_submitted": 334795, + "total_acs": 148172, + "total_submitted": 337888, "frontend_question_id": 671, "is_new_question": false }, @@ -38379,8 +38747,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 173759, - "total_submitted": 364363, + "total_acs": 175009, + "total_submitted": 366944, "frontend_question_id": 670, "is_new_question": false }, @@ -38402,8 +38770,8 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 238813, - "total_submitted": 360103, + "total_acs": 240337, + "total_submitted": 362350, "frontend_question_id": 669, "is_new_question": false }, @@ -38425,8 +38793,8 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 49900, - "total_submitted": 97292, + "total_acs": 50199, + "total_submitted": 97833, "frontend_question_id": 668, "is_new_question": false }, @@ -38448,8 +38816,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 47808, - "total_submitted": 80409, + "total_acs": 47965, + "total_submitted": 80651, "frontend_question_id": 667, "is_new_question": false }, @@ -38471,8 +38839,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 19810, - "total_submitted": 33753, + "total_acs": 19911, + "total_submitted": 33898, "frontend_question_id": 666, "is_new_question": false }, @@ -38494,8 +38862,8 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 220377, - "total_submitted": 924946, + "total_acs": 222383, + "total_submitted": 930449, "frontend_question_id": 665, "is_new_question": false }, @@ -38517,8 +38885,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 28663, - "total_submitted": 61601, + "total_acs": 28851, + "total_submitted": 61960, "frontend_question_id": 664, "is_new_question": false }, @@ -38540,8 +38908,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 27928, - "total_submitted": 67627, + "total_acs": 28009, + "total_submitted": 67781, "frontend_question_id": 663, "is_new_question": false }, @@ -38563,8 +38931,8 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 194256, - "total_submitted": 481872, + "total_acs": 197790, + "total_submitted": 490634, "frontend_question_id": 662, "is_new_question": false }, @@ -38586,8 +38954,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 65792, - "total_submitted": 120515, + "total_acs": 66022, + "total_submitted": 120905, "frontend_question_id": 661, "is_new_question": false }, @@ -38609,8 +38977,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 9588, - "total_submitted": 16953, + "total_acs": 9614, + "total_submitted": 16987, "frontend_question_id": 660, "is_new_question": false }, @@ -38632,8 +39000,8 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 71192, - "total_submitted": 155362, + "total_acs": 71636, + "total_submitted": 156292, "frontend_question_id": 659, "is_new_question": false }, @@ -38655,8 +39023,8 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 301275, - "total_submitted": 673964, + "total_acs": 305523, + "total_submitted": 682564, "frontend_question_id": 658, "is_new_question": false }, @@ -38678,8 +39046,8 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 335237, - "total_submitted": 446279, + "total_acs": 336788, + "total_submitted": 448246, "frontend_question_id": 657, "is_new_question": false }, @@ -38701,8 +39069,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 12622, - "total_submitted": 40276, + "total_acs": 12688, + "total_submitted": 40390, "frontend_question_id": 656, "is_new_question": false }, @@ -38724,8 +39092,8 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 52954, - "total_submitted": 87584, + "total_acs": 53356, + "total_submitted": 88058, "frontend_question_id": 655, "is_new_question": false }, @@ -38747,8 +39115,8 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 219726, - "total_submitted": 261971, + "total_acs": 221743, + "total_submitted": 264138, "frontend_question_id": 654, "is_new_question": false }, @@ -38770,8 +39138,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": 326499, - "total_submitted": 553184, + "total_acs": 331213, + "total_submitted": 560699, "frontend_question_id": 653, "is_new_question": false }, @@ -38793,8 +39161,8 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 158839, - "total_submitted": 283055, + "total_acs": 161184, + "total_submitted": 286892, "frontend_question_id": 652, "is_new_question": false }, @@ -38816,8 +39184,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 22115, - "total_submitted": 40838, + "total_acs": 22199, + "total_submitted": 40976, "frontend_question_id": 651, "is_new_question": false }, @@ -38839,8 +39207,8 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 102645, - "total_submitted": 194919, + "total_acs": 103517, + "total_submitted": 196353, "frontend_question_id": 650, "is_new_question": false }, @@ -38862,8 +39230,8 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 19733, - "total_submitted": 49172, + "total_acs": 19884, + "total_submitted": 49497, "frontend_question_id": 649, "is_new_question": false }, @@ -38885,8 +39253,8 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 99998, - "total_submitted": 160468, + "total_acs": 101131, + "total_submitted": 162000, "frontend_question_id": 648, "is_new_question": false }, @@ -38908,8 +39276,8 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 463217, - "total_submitted": 704044, + "total_acs": 468713, + "total_submitted": 711800, "frontend_question_id": 647, "is_new_question": false }, @@ -38931,8 +39299,8 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 112984, - "total_submitted": 201924, + "total_acs": 114251, + "total_submitted": 203945, "frontend_question_id": 646, "is_new_question": false }, @@ -38954,8 +39322,8 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 173638, - "total_submitted": 420902, + "total_acs": 175348, + "total_submitted": 424823, "frontend_question_id": 645, "is_new_question": false }, @@ -38977,8 +39345,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 17597, - "total_submitted": 49659, + "total_acs": 17652, + "total_submitted": 49777, "frontend_question_id": 644, "is_new_question": false }, @@ -39000,8 +39368,8 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 150290, - "total_submitted": 344105, + "total_acs": 152113, + "total_submitted": 347906, "frontend_question_id": 643, "is_new_question": false }, @@ -39023,8 +39391,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 117783, - "total_submitted": 243036, + "total_acs": 118949, + "total_submitted": 245103, "frontend_question_id": 642, "is_new_question": false }, @@ -39046,8 +39414,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 32768, - "total_submitted": 75763, + "total_acs": 32921, + "total_submitted": 76070, "frontend_question_id": 640, "is_new_question": false }, @@ -39069,8 +39437,8 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 61728, - "total_submitted": 203334, + "total_acs": 62038, + "total_submitted": 204426, "frontend_question_id": 639, "is_new_question": false }, @@ -39092,8 +39460,8 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 47123, - "total_submitted": 86059, + "total_acs": 47585, + "total_submitted": 86730, "frontend_question_id": 638, "is_new_question": false }, @@ -39115,8 +39483,8 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 279397, - "total_submitted": 404989, + "total_acs": 282165, + "total_submitted": 408593, "frontend_question_id": 637, "is_new_question": false }, @@ -39138,8 +39506,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 175593, - "total_submitted": 289746, + "total_acs": 176685, + "total_submitted": 291331, "frontend_question_id": 636, "is_new_question": false }, @@ -39161,8 +39529,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 31043, - "total_submitted": 49666, + "total_acs": 31177, + "total_submitted": 49861, "frontend_question_id": 635, "is_new_question": false }, @@ -39184,8 +39552,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 8742, - "total_submitted": 21162, + "total_acs": 8838, + "total_submitted": 21364, "frontend_question_id": 634, "is_new_question": false }, @@ -39207,8 +39575,8 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 142868, - "total_submitted": 411011, + "total_acs": 144330, + "total_submitted": 415253, "frontend_question_id": 633, "is_new_question": false }, @@ -39230,8 +39598,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": 68573, - "total_submitted": 115955, + "total_acs": 69582, + "total_submitted": 117305, "frontend_question_id": 632, "is_new_question": false }, @@ -39253,8 +39621,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 12000, - "total_submitted": 28109, + "total_acs": 12144, + "total_submitted": 28357, "frontend_question_id": 631, "is_new_question": false }, @@ -39276,8 +39644,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 93539, - "total_submitted": 233087, + "total_acs": 94427, + "total_submitted": 235119, "frontend_question_id": 630, "is_new_question": false }, @@ -39299,8 +39667,8 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 25202, - "total_submitted": 67601, + "total_acs": 25280, + "total_submitted": 67807, "frontend_question_id": 629, "is_new_question": false }, @@ -39322,8 +39690,8 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 216672, - "total_submitted": 464315, + "total_acs": 219015, + "total_submitted": 469383, "frontend_question_id": 628, "is_new_question": false }, @@ -39345,8 +39713,8 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 215971, - "total_submitted": 266588, + "total_acs": 221411, + "total_submitted": 272636, "frontend_question_id": 627, "is_new_question": false }, @@ -39368,8 +39736,8 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 106579, - "total_submitted": 152804, + "total_acs": 107889, + "total_submitted": 154408, "frontend_question_id": 626, "is_new_question": false }, @@ -39391,8 +39759,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 10224, - "total_submitted": 30705, + "total_acs": 10240, + "total_submitted": 30732, "frontend_question_id": 625, "is_new_question": false }, @@ -39414,8 +39782,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 35831, - "total_submitted": 86085, + "total_acs": 35887, + "total_submitted": 86197, "frontend_question_id": 624, "is_new_question": false }, @@ -39437,8 +39805,8 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 85400, - "total_submitted": 157966, + "total_acs": 85992, + "total_submitted": 159039, "frontend_question_id": 623, "is_new_question": false }, @@ -39460,8 +39828,8 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 347513, - "total_submitted": 633692, + "total_acs": 352027, + "total_submitted": 640642, "frontend_question_id": 621, "is_new_question": false }, @@ -39483,8 +39851,8 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 191475, - "total_submitted": 263023, + "total_acs": 193243, + "total_submitted": 265171, "frontend_question_id": 620, "is_new_question": false }, @@ -39506,8 +39874,8 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 48653, - "total_submitted": 101525, + "total_acs": 49343, + "total_submitted": 102780, "frontend_question_id": 619, "is_new_question": false }, @@ -39529,8 +39897,8 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 17218, - "total_submitted": 27063, + "total_acs": 17431, + "total_submitted": 27378, "frontend_question_id": 618, "is_new_question": false }, @@ -39552,8 +39920,8 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 583485, - "total_submitted": 746750, + "total_acs": 589411, + "total_submitted": 753796, "frontend_question_id": 617, "is_new_question": false }, @@ -39575,8 +39943,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 77674, - "total_submitted": 160358, + "total_acs": 77972, + "total_submitted": 160970, "frontend_question_id": 616, "is_new_question": false }, @@ -39598,8 +39966,8 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 27491, - "total_submitted": 48485, + "total_acs": 27795, + "total_submitted": 48896, "frontend_question_id": 615, "is_new_question": false }, @@ -39621,8 +39989,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 41052, - "total_submitted": 113904, + "total_acs": 41424, + "total_submitted": 114640, "frontend_question_id": 614, "is_new_question": false }, @@ -39644,8 +40012,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 52954, - "total_submitted": 65136, + "total_acs": 53546, + "total_submitted": 65837, "frontend_question_id": 613, "is_new_question": false }, @@ -39667,8 +40035,8 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 31377, - "total_submitted": 49742, + "total_acs": 31663, + "total_submitted": 50165, "frontend_question_id": 612, "is_new_question": false }, @@ -39690,8 +40058,8 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 142276, - "total_submitted": 285259, + "total_acs": 143479, + "total_submitted": 287458, "frontend_question_id": 611, "is_new_question": false }, @@ -39713,8 +40081,8 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 52283, - "total_submitted": 73714, + "total_acs": 52812, + "total_submitted": 74480, "frontend_question_id": 610, "is_new_question": false }, @@ -39736,8 +40104,8 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 97331, - "total_submitted": 152374, + "total_acs": 97639, + "total_submitted": 152803, "frontend_question_id": 609, "is_new_question": false }, @@ -39759,8 +40127,8 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 62011, - "total_submitted": 84000, + "total_acs": 64977, + "total_submitted": 87726, "frontend_question_id": 608, "is_new_question": false }, @@ -39782,8 +40150,8 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 71007, - "total_submitted": 100565, + "total_acs": 74451, + "total_submitted": 105038, "frontend_question_id": 607, "is_new_question": false }, @@ -39805,8 +40173,8 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 132507, - "total_submitted": 228702, + "total_acs": 133395, + "total_submitted": 229993, "frontend_question_id": 606, "is_new_question": false }, @@ -39828,8 +40196,8 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 304453, - "total_submitted": 919377, + "total_acs": 306997, + "total_submitted": 926893, "frontend_question_id": 605, "is_new_question": false }, @@ -39851,8 +40219,8 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 26921, - "total_submitted": 68591, + "total_acs": 27031, + "total_submitted": 68841, "frontend_question_id": 604, "is_new_question": false }, @@ -39874,8 +40242,8 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 59651, - "total_submitted": 87857, + "total_acs": 60543, + "total_submitted": 89103, "frontend_question_id": 603, "is_new_question": false }, @@ -39897,8 +40265,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": 50707, - "total_submitted": 83170, + "total_acs": 51032, + "total_submitted": 83650, "frontend_question_id": 602, "is_new_question": false }, @@ -39920,8 +40288,8 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 64234, - "total_submitted": 128550, + "total_acs": 64937, + "total_submitted": 129938, "frontend_question_id": 601, "is_new_question": false }, @@ -39943,8 +40311,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 31226, - "total_submitted": 80408, + "total_acs": 31343, + "total_submitted": 80742, "frontend_question_id": 600, "is_new_question": false }, @@ -39966,8 +40334,8 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 157363, - "total_submitted": 298931, + "total_acs": 158887, + "total_submitted": 301842, "frontend_question_id": 599, "is_new_question": false }, @@ -39989,8 +40357,8 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 79508, - "total_submitted": 145085, + "total_acs": 79904, + "total_submitted": 145745, "frontend_question_id": 598, "is_new_question": false }, @@ -40012,8 +40380,8 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 60046, - "total_submitted": 140782, + "total_acs": 60573, + "total_submitted": 141895, "frontend_question_id": 597, "is_new_question": false }, @@ -40035,8 +40403,8 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 175747, - "total_submitted": 398644, + "total_acs": 179194, + "total_submitted": 403891, "frontend_question_id": 596, "is_new_question": false }, @@ -40058,8 +40426,8 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 342989, - "total_submitted": 455462, + "total_acs": 354318, + "total_submitted": 471711, "frontend_question_id": 595, "is_new_question": false }, @@ -40081,8 +40449,8 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 118672, - "total_submitted": 224623, + "total_acs": 119385, + "total_submitted": 225728, "frontend_question_id": 594, "is_new_question": false }, @@ -40104,8 +40472,8 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 85111, - "total_submitted": 193659, + "total_acs": 85874, + "total_submitted": 195161, "frontend_question_id": 593, "is_new_question": false }, @@ -40127,8 +40495,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 29434, - "total_submitted": 56777, + "total_acs": 29572, + "total_submitted": 57020, "frontend_question_id": 592, "is_new_question": false }, @@ -40150,8 +40518,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 11604, - "total_submitted": 31602, + "total_acs": 11677, + "total_submitted": 31720, "frontend_question_id": 591, "is_new_question": false }, @@ -40173,8 +40541,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 70516, - "total_submitted": 145379, + "total_acs": 71725, + "total_submitted": 147856, "frontend_question_id": 588, "is_new_question": false }, @@ -40196,8 +40564,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 24540, - "total_submitted": 56794, + "total_acs": 24637, + "total_submitted": 56962, "frontend_question_id": 587, "is_new_question": false }, @@ -40219,8 +40587,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": 88028, - "total_submitted": 119412, + "total_acs": 91699, + "total_submitted": 124505, "frontend_question_id": 586, "is_new_question": false }, @@ -40242,8 +40610,8 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 33854, - "total_submitted": 62348, + "total_acs": 34144, + "total_submitted": 63007, "frontend_question_id": 585, "is_new_question": false }, @@ -40265,8 +40633,8 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 110894, - "total_submitted": 144405, + "total_acs": 119449, + "total_submitted": 155206, "frontend_question_id": 584, "is_new_question": false }, @@ -40288,8 +40656,8 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 170611, - "total_submitted": 292221, + "total_acs": 172667, + "total_submitted": 295082, "frontend_question_id": 583, "is_new_question": false }, @@ -40311,8 +40679,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 69434, - "total_submitted": 102984, + "total_acs": 69897, + "total_submitted": 103580, "frontend_question_id": 582, "is_new_question": false }, @@ -40334,8 +40702,8 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 273945, - "total_submitted": 759614, + "total_acs": 275474, + "total_submitted": 763396, "frontend_question_id": 581, "is_new_question": false }, @@ -40357,8 +40725,8 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 47731, - "total_submitted": 83229, + "total_acs": 48441, + "total_submitted": 84269, "frontend_question_id": 580, "is_new_question": false }, @@ -40380,8 +40748,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 27009, - "total_submitted": 61630, + "total_acs": 27224, + "total_submitted": 61912, "frontend_question_id": 579, "is_new_question": false }, @@ -40403,8 +40771,8 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 41666, - "total_submitted": 98246, + "total_acs": 42017, + "total_submitted": 99410, "frontend_question_id": 578, "is_new_question": false }, @@ -40426,8 +40794,8 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 61273, - "total_submitted": 81788, + "total_acs": 61884, + "total_submitted": 82584, "frontend_question_id": 577, "is_new_question": false }, @@ -40449,8 +40817,8 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 65467, - "total_submitted": 162608, + "total_acs": 65958, + "total_submitted": 163670, "frontend_question_id": 576, "is_new_question": false }, @@ -40472,8 +40840,8 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 209986, - "total_submitted": 319300, + "total_acs": 211437, + "total_submitted": 321302, "frontend_question_id": 575, "is_new_question": false }, @@ -40495,8 +40863,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 48158, - "total_submitted": 81864, + "total_acs": 48636, + "total_submitted": 82546, "frontend_question_id": 574, "is_new_question": false }, @@ -40518,8 +40886,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 17175, - "total_submitted": 31368, + "total_acs": 17211, + "total_submitted": 31415, "frontend_question_id": 573, "is_new_question": false }, @@ -40541,8 +40909,8 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 497521, - "total_submitted": 1092371, + "total_acs": 507065, + "total_submitted": 1111981, "frontend_question_id": 572, "is_new_question": false }, @@ -40564,8 +40932,8 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 20016, - "total_submitted": 45034, + "total_acs": 20295, + "total_submitted": 45586, "frontend_question_id": 571, "is_new_question": false }, @@ -40587,8 +40955,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": 62219, - "total_submitted": 92732, + "total_acs": 63195, + "total_submitted": 94113, "frontend_question_id": 570, "is_new_question": false }, @@ -40610,8 +40978,8 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 28747, - "total_submitted": 42694, + "total_acs": 29044, + "total_submitted": 43065, "frontend_question_id": 569, "is_new_question": false }, @@ -40633,8 +41001,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 34464, - "total_submitted": 77301, + "total_acs": 34556, + "total_submitted": 77473, "frontend_question_id": 568, "is_new_question": false }, @@ -40656,8 +41024,8 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 417568, - "total_submitted": 941790, + "total_acs": 426474, + "total_submitted": 963776, "frontend_question_id": 567, "is_new_question": false }, @@ -40679,8 +41047,8 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 255513, - "total_submitted": 408479, + "total_acs": 260451, + "total_submitted": 416140, "frontend_question_id": 566, "is_new_question": false }, @@ -40702,8 +41070,8 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 114847, - "total_submitted": 203822, + "total_acs": 115322, + "total_submitted": 204573, "frontend_question_id": 565, "is_new_question": false }, @@ -40725,8 +41093,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 32824, - "total_submitted": 152072, + "total_acs": 33149, + "total_submitted": 153291, "frontend_question_id": 564, "is_new_question": false }, @@ -40748,8 +41116,8 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 170643, - "total_submitted": 290308, + "total_acs": 171640, + "total_submitted": 291690, "frontend_question_id": 563, "is_new_question": false }, @@ -40771,8 +41139,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": 61266, - "total_submitted": 124029, + "total_acs": 62121, + "total_submitted": 125619, "frontend_question_id": 562, "is_new_question": false }, @@ -40791,11 +41159,11 @@ "question__article__live": true, "question__article__slug": "array-partition-i", "question__article__has_video_solution": false, - "question__title": "Array Partition I", - "question__title_slug": "array-partition-i", + "question__title": "Array Partition", + "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 336590, - "total_submitted": 443234, + "total_acs": 339263, + "total_submitted": 446321, "frontend_question_id": 561, "is_new_question": false }, @@ -40817,8 +41185,8 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 804389, - "total_submitted": 1819374, + "total_acs": 812494, + "total_submitted": 1838463, "frontend_question_id": 560, "is_new_question": false }, @@ -40840,8 +41208,8 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 474686, - "total_submitted": 598047, + "total_acs": 481825, + "total_submitted": 606271, "frontend_question_id": 557, "is_new_question": false }, @@ -40863,8 +41231,8 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 103928, - "total_submitted": 306394, + "total_acs": 105395, + "total_submitted": 310302, "frontend_question_id": 556, "is_new_question": false }, @@ -40886,8 +41254,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 6038, - "total_submitted": 13916, + "total_acs": 6045, + "total_submitted": 13931, "frontend_question_id": 555, "is_new_question": false }, @@ -40909,8 +41277,8 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 102746, - "total_submitted": 194751, + "total_acs": 103330, + "total_submitted": 195656, "frontend_question_id": 554, "is_new_question": false }, @@ -40932,8 +41300,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 32391, - "total_submitted": 54610, + "total_acs": 32547, + "total_submitted": 54832, "frontend_question_id": 553, "is_new_question": false }, @@ -40955,8 +41323,8 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 50465, - "total_submitted": 123894, + "total_acs": 51293, + "total_submitted": 125673, "frontend_question_id": 552, "is_new_question": false }, @@ -40978,8 +41346,8 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 149197, - "total_submitted": 311982, + "total_acs": 150763, + "total_submitted": 315088, "frontend_question_id": 551, "is_new_question": false }, @@ -41001,8 +41369,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 36422, - "total_submitted": 67111, + "total_acs": 38015, + "total_submitted": 70029, "frontend_question_id": 1730, "is_new_question": false }, @@ -41024,8 +41392,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 43837, - "total_submitted": 89916, + "total_acs": 44164, + "total_submitted": 90547, "frontend_question_id": 549, "is_new_question": false }, @@ -41047,8 +41415,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 22404, - "total_submitted": 44854, + "total_acs": 22458, + "total_submitted": 44957, "frontend_question_id": 548, "is_new_question": false }, @@ -41070,8 +41438,8 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 484861, - "total_submitted": 773142, + "total_acs": 492102, + "total_submitted": 783907, "frontend_question_id": 547, "is_new_question": false }, @@ -41093,8 +41461,8 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 34772, - "total_submitted": 73316, + "total_acs": 34995, + "total_submitted": 73755, "frontend_question_id": 546, "is_new_question": false }, @@ -41116,8 +41484,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 105229, - "total_submitted": 241258, + "total_acs": 106439, + "total_submitted": 243500, "frontend_question_id": 545, "is_new_question": false }, @@ -41139,8 +41507,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 25071, - "total_submitted": 32740, + "total_acs": 25129, + "total_submitted": 32802, "frontend_question_id": 544, "is_new_question": false }, @@ -41162,8 +41530,8 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 776200, - "total_submitted": 1416369, + "total_acs": 791294, + "total_submitted": 1439917, "frontend_question_id": 543, "is_new_question": false }, @@ -41185,8 +41553,8 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 264594, - "total_submitted": 601833, + "total_acs": 270723, + "total_submitted": 615502, "frontend_question_id": 542, "is_new_question": false }, @@ -41208,8 +41576,8 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 157566, - "total_submitted": 313897, + "total_acs": 159091, + "total_submitted": 316774, "frontend_question_id": 541, "is_new_question": false }, @@ -41231,8 +41599,8 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 304379, - "total_submitted": 519069, + "total_acs": 308518, + "total_submitted": 526268, "frontend_question_id": 540, "is_new_question": false }, @@ -41254,8 +41622,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 97908, - "total_submitted": 175702, + "total_acs": 100290, + "total_submitted": 179567, "frontend_question_id": 539, "is_new_question": false }, @@ -41277,8 +41645,8 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 244543, - "total_submitted": 367046, + "total_acs": 245812, + "total_submitted": 368465, "frontend_question_id": 538, "is_new_question": false }, @@ -41300,8 +41668,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 82104, - "total_submitted": 115353, + "total_acs": 82341, + "total_submitted": 115649, "frontend_question_id": 537, "is_new_question": false }, @@ -41323,8 +41691,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 78139, - "total_submitted": 139723, + "total_acs": 78413, + "total_submitted": 140214, "frontend_question_id": 536, "is_new_question": false }, @@ -41346,8 +41714,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 207569, - "total_submitted": 242711, + "total_acs": 208339, + "total_submitted": 243556, "frontend_question_id": 535, "is_new_question": false }, @@ -41369,8 +41737,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 12103, - "total_submitted": 25041, + "total_acs": 12116, + "total_submitted": 25074, "frontend_question_id": 533, "is_new_question": false }, @@ -41392,8 +41760,8 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 260035, - "total_submitted": 644390, + "total_acs": 261748, + "total_submitted": 648087, "frontend_question_id": 532, "is_new_question": false }, @@ -41415,8 +41783,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 31195, - "total_submitted": 51357, + "total_acs": 31328, + "total_submitted": 51588, "frontend_question_id": 531, "is_new_question": false }, @@ -41438,8 +41806,8 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 163969, - "total_submitted": 290938, + "total_acs": 166097, + "total_submitted": 294429, "frontend_question_id": 530, "is_new_question": false }, @@ -41461,8 +41829,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 120077, - "total_submitted": 184821, + "total_acs": 120909, + "total_submitted": 185961, "frontend_question_id": 529, "is_new_question": false }, @@ -41484,8 +41852,8 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 167953, - "total_submitted": 246525, + "total_acs": 169920, + "total_submitted": 249646, "frontend_question_id": 1721, "is_new_question": false }, @@ -41507,8 +41875,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 24554, - "total_submitted": 40993, + "total_acs": 24626, + "total_submitted": 41079, "frontend_question_id": 527, "is_new_question": false }, @@ -41530,8 +41898,8 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 133240, - "total_submitted": 206716, + "total_acs": 134409, + "total_submitted": 208449, "frontend_question_id": 526, "is_new_question": false }, @@ -41553,8 +41921,8 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 266620, - "total_submitted": 573462, + "total_acs": 268342, + "total_submitted": 576523, "frontend_question_id": 525, "is_new_question": false }, @@ -41576,8 +41944,8 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 129224, - "total_submitted": 253396, + "total_acs": 129984, + "total_submitted": 254737, "frontend_question_id": 524, "is_new_question": false }, @@ -41599,8 +41967,8 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 299307, - "total_submitted": 1092035, + "total_acs": 301498, + "total_submitted": 1098758, "frontend_question_id": 523, "is_new_question": false }, @@ -41622,8 +41990,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 43886, - "total_submitted": 109122, + "total_acs": 44029, + "total_submitted": 109437, "frontend_question_id": 522, "is_new_question": false }, @@ -41645,8 +42013,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 85671, - "total_submitted": 142340, + "total_acs": 86098, + "total_submitted": 143005, "frontend_question_id": 521, "is_new_question": false }, @@ -41668,8 +42036,8 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 267274, - "total_submitted": 479943, + "total_acs": 268410, + "total_submitted": 482038, "frontend_question_id": 520, "is_new_question": false }, @@ -41691,8 +42059,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": 1273, - "total_submitted": 2339, + "total_acs": 1295, + "total_submitted": 2375, "frontend_question_id": 1983, "is_new_question": false }, @@ -41714,8 +42082,8 @@ "question__title": "Coin Change 2", "question__title_slug": "coin-change-2", "question__hide": false, - "total_acs": 311883, - "total_submitted": 535049, + "total_acs": 317510, + "total_submitted": 542982, "frontend_question_id": 518, "is_new_question": false }, @@ -41737,8 +42105,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 22630, - "total_submitted": 57092, + "total_acs": 22751, + "total_submitted": 57364, "frontend_question_id": 517, "is_new_question": false }, @@ -41760,8 +42128,8 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 267829, - "total_submitted": 447558, + "total_acs": 271734, + "total_submitted": 453254, "frontend_question_id": 516, "is_new_question": false }, @@ -41783,8 +42151,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": 197482, - "total_submitted": 305954, + "total_acs": 199214, + "total_submitted": 308602, "frontend_question_id": 515, "is_new_question": false }, @@ -41806,8 +42174,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 28188, - "total_submitted": 60666, + "total_acs": 28412, + "total_submitted": 61153, "frontend_question_id": 514, "is_new_question": false }, @@ -41829,8 +42197,8 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 178552, - "total_submitted": 272209, + "total_acs": 180581, + "total_submitted": 274857, "frontend_question_id": 513, "is_new_question": false }, @@ -41852,8 +42220,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 1346, - "total_submitted": 3319, + "total_acs": 1385, + "total_submitted": 3407, "frontend_question_id": 2036, "is_new_question": false }, @@ -41875,8 +42243,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": 40288, - "total_submitted": 97517, + "total_acs": 40906, + "total_submitted": 99395, "frontend_question_id": 1059, "is_new_question": false }, @@ -41898,8 +42266,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": 1836, - "total_submitted": 3466, + "total_acs": 1880, + "total_submitted": 3571, "frontend_question_id": 2031, "is_new_question": false }, @@ -41921,8 +42289,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 50181, - "total_submitted": 81874, + "total_acs": 53335, + "total_submitted": 86913, "frontend_question_id": 510, "is_new_question": false }, @@ -41944,8 +42312,8 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 111505, - "total_submitted": 176083, + "total_acs": 112486, + "total_submitted": 177314, "frontend_question_id": 508, "is_new_question": false }, @@ -41967,8 +42335,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 106485, - "total_submitted": 282813, + "total_acs": 107318, + "total_submitted": 285045, "frontend_question_id": 507, "is_new_question": false }, @@ -41990,8 +42358,8 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 94358, - "total_submitted": 164297, + "total_acs": 95620, + "total_submitted": 166098, "frontend_question_id": 506, "is_new_question": false }, @@ -42013,8 +42381,8 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 83659, - "total_submitted": 162218, + "total_acs": 84297, + "total_submitted": 163314, "frontend_question_id": 505, "is_new_question": false }, @@ -42036,8 +42404,8 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 88270, - "total_submitted": 185345, + "total_acs": 88943, + "total_submitted": 186609, "frontend_question_id": 504, "is_new_question": false }, @@ -42059,8 +42427,8 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 229744, - "total_submitted": 367892, + "total_acs": 233474, + "total_submitted": 373217, "frontend_question_id": 503, "is_new_question": false }, @@ -42082,8 +42450,8 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 33959, - "total_submitted": 76558, + "total_acs": 34343, + "total_submitted": 77317, "frontend_question_id": 502, "is_new_question": false }, @@ -42105,8 +42473,8 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 157560, - "total_submitted": 330613, + "total_acs": 159339, + "total_submitted": 333584, "frontend_question_id": 501, "is_new_question": false }, @@ -42128,8 +42496,8 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 155875, - "total_submitted": 227997, + "total_acs": 157013, + "total_submitted": 229550, "frontend_question_id": 500, "is_new_question": false }, @@ -42151,8 +42519,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 24040, - "total_submitted": 52199, + "total_acs": 24231, + "total_submitted": 52508, "frontend_question_id": 499, "is_new_question": false }, @@ -42174,8 +42542,8 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 208661, - "total_submitted": 364326, + "total_acs": 210766, + "total_submitted": 367606, "frontend_question_id": 498, "is_new_question": false }, @@ -42197,8 +42565,8 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 383198, - "total_submitted": 542960, + "total_acs": 390151, + "total_submitted": 552021, "frontend_question_id": 496, "is_new_question": false }, @@ -42220,8 +42588,8 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 102503, - "total_submitted": 180110, + "total_acs": 103398, + "total_submitted": 181742, "frontend_question_id": 495, "is_new_question": false }, @@ -42243,8 +42611,8 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 367244, - "total_submitted": 809557, + "total_acs": 373121, + "total_submitted": 822498, "frontend_question_id": 494, "is_new_question": false }, @@ -42266,8 +42634,8 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 90253, - "total_submitted": 298327, + "total_acs": 92426, + "total_submitted": 304502, "frontend_question_id": 493, "is_new_question": false }, @@ -42289,8 +42657,8 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 80557, - "total_submitted": 152063, + "total_acs": 81072, + "total_submitted": 152894, "frontend_question_id": 492, "is_new_question": false }, @@ -42312,8 +42680,8 @@ "question__title": "Increasing Subsequences", "question__title_slug": "increasing-subsequences", "question__hide": false, - "total_acs": 77327, - "total_submitted": 150852, + "total_acs": 78081, + "total_submitted": 152103, "frontend_question_id": 491, "is_new_question": false }, @@ -42335,8 +42703,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 123169, - "total_submitted": 224088, + "total_acs": 124249, + "total_submitted": 225801, "frontend_question_id": 490, "is_new_question": false }, @@ -42358,8 +42726,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 8007, - "total_submitted": 17456, + "total_acs": 8104, + "total_submitted": 17629, "frontend_question_id": 1643, "is_new_question": false }, @@ -42381,8 +42749,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 20149, - "total_submitted": 56512, + "total_acs": 20242, + "total_submitted": 56941, "frontend_question_id": 488, "is_new_question": false }, @@ -42404,8 +42772,8 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 97385, - "total_submitted": 198569, + "total_acs": 98694, + "total_submitted": 201210, "frontend_question_id": 487, "is_new_question": false }, @@ -42427,8 +42795,8 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 116401, - "total_submitted": 230624, + "total_acs": 117610, + "total_submitted": 232851, "frontend_question_id": 486, "is_new_question": false }, @@ -42450,8 +42818,8 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 686537, - "total_submitted": 1240504, + "total_acs": 695423, + "total_submitted": 1254649, "frontend_question_id": 485, "is_new_question": false }, @@ -42473,8 +42841,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 31602, - "total_submitted": 48203, + "total_acs": 31660, + "total_submitted": 48271, "frontend_question_id": 484, "is_new_question": false }, @@ -42496,8 +42864,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 17162, - "total_submitted": 45118, + "total_acs": 17231, + "total_submitted": 45252, "frontend_question_id": 483, "is_new_question": false }, @@ -42519,8 +42887,8 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 219293, - "total_submitted": 509330, + "total_acs": 221070, + "total_submitted": 513557, "frontend_question_id": 482, "is_new_question": false }, @@ -42542,8 +42910,8 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 28341, - "total_submitted": 56861, + "total_acs": 28458, + "total_submitted": 57044, "frontend_question_id": 481, "is_new_question": false }, @@ -42565,8 +42933,8 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 108982, - "total_submitted": 264975, + "total_acs": 110062, + "total_submitted": 267354, "frontend_question_id": 480, "is_new_question": false }, @@ -42588,8 +42956,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 20564, - "total_submitted": 65711, + "total_acs": 20596, + "total_submitted": 65794, "frontend_question_id": 479, "is_new_question": false }, @@ -42611,8 +42979,8 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 89648, - "total_submitted": 172276, + "total_acs": 90079, + "total_submitted": 173036, "frontend_question_id": 477, "is_new_question": false }, @@ -42634,8 +43002,8 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 268503, - "total_submitted": 401427, + "total_acs": 269592, + "total_submitted": 402900, "frontend_question_id": 476, "is_new_question": false }, @@ -42657,8 +43025,8 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 90651, - "total_submitted": 254589, + "total_acs": 91330, + "total_submitted": 256054, "frontend_question_id": 475, "is_new_question": false }, @@ -42680,8 +43048,8 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 146317, - "total_submitted": 313981, + "total_acs": 148140, + "total_submitted": 317732, "frontend_question_id": 474, "is_new_question": false }, @@ -42703,8 +43071,8 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 79086, - "total_submitted": 196559, + "total_acs": 80447, + "total_submitted": 199938, "frontend_question_id": 473, "is_new_question": false }, @@ -42726,8 +43094,8 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 138120, - "total_submitted": 316550, + "total_acs": 139941, + "total_submitted": 319051, "frontend_question_id": 472, "is_new_question": false }, @@ -42749,8 +43117,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 28555, - "total_submitted": 56281, + "total_acs": 28669, + "total_submitted": 56494, "frontend_question_id": 471, "is_new_question": false }, @@ -42772,8 +43140,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 9601, - "total_submitted": 25038, + "total_acs": 9616, + "total_submitted": 25087, "frontend_question_id": 469, "is_new_question": false }, @@ -42795,8 +43163,8 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 128460, - "total_submitted": 488355, + "total_acs": 129006, + "total_submitted": 490254, "frontend_question_id": 468, "is_new_question": false }, @@ -42818,8 +43186,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 35939, - "total_submitted": 95087, + "total_acs": 36178, + "total_submitted": 95575, "frontend_question_id": 467, "is_new_question": false }, @@ -42841,8 +43209,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 14455, - "total_submitted": 49621, + "total_acs": 14513, + "total_submitted": 49824, "frontend_question_id": 466, "is_new_question": false }, @@ -42864,8 +43232,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 72063, - "total_submitted": 146823, + "total_acs": 72589, + "total_submitted": 147834, "frontend_question_id": 465, "is_new_question": false }, @@ -42887,8 +43255,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 76888, - "total_submitted": 257646, + "total_acs": 77325, + "total_submitted": 259157, "frontend_question_id": 464, "is_new_question": false }, @@ -42910,8 +43278,8 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 373974, - "total_submitted": 541036, + "total_acs": 376667, + "total_submitted": 544765, "frontend_question_id": 463, "is_new_question": false }, @@ -42933,8 +43301,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": 92458, - "total_submitted": 161432, + "total_acs": 146234, + "total_submitted": 243885, "frontend_question_id": 462, "is_new_question": false }, @@ -42956,8 +43324,8 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 480592, - "total_submitted": 644125, + "total_acs": 482356, + "total_submitted": 646218, "frontend_question_id": 461, "is_new_question": false }, @@ -42979,8 +43347,8 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 158655, - "total_submitted": 399079, + "total_acs": 160246, + "total_submitted": 402228, "frontend_question_id": 460, "is_new_question": false }, @@ -43002,8 +43370,8 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 249723, - "total_submitted": 572281, + "total_acs": 251981, + "total_submitted": 577241, "frontend_question_id": 459, "is_new_question": false }, @@ -43025,8 +43393,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 33973, - "total_submitted": 60958, + "total_acs": 34118, + "total_submitted": 61157, "frontend_question_id": 458, "is_new_question": false }, @@ -43048,8 +43416,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 60795, - "total_submitted": 190996, + "total_acs": 61275, + "total_submitted": 192233, "frontend_question_id": 457, "is_new_question": false }, @@ -43071,8 +43439,8 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 148727, - "total_submitted": 459080, + "total_acs": 149832, + "total_submitted": 462114, "frontend_question_id": 456, "is_new_question": false }, @@ -43094,8 +43462,8 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 172080, - "total_submitted": 339316, + "total_acs": 174002, + "total_submitted": 343330, "frontend_question_id": 455, "is_new_question": false }, @@ -43117,8 +43485,8 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 258939, - "total_submitted": 453060, + "total_acs": 260804, + "total_submitted": 456104, "frontend_question_id": 454, "is_new_question": false }, @@ -43140,8 +43508,8 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 126714, - "total_submitted": 232690, + "total_acs": 131663, + "total_submitted": 239840, "frontend_question_id": 453, "is_new_question": false }, @@ -43163,8 +43531,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": 194418, - "total_submitted": 366706, + "total_acs": 196136, + "total_submitted": 369828, "frontend_question_id": 452, "is_new_question": false }, @@ -43186,8 +43554,8 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 373093, - "total_submitted": 548298, + "total_acs": 376369, + "total_submitted": 552604, "frontend_question_id": 451, "is_new_question": false }, @@ -43209,8 +43577,8 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 287719, - "total_submitted": 583483, + "total_acs": 291759, + "total_submitted": 590787, "frontend_question_id": 450, "is_new_question": false }, @@ -43232,8 +43600,8 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 198710, - "total_submitted": 352290, + "total_acs": 200098, + "total_submitted": 354374, "frontend_question_id": 449, "is_new_question": false }, @@ -43255,8 +43623,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": 594915, - "total_submitted": 1004164, + "total_acs": 601057, + "total_submitted": 1013808, "frontend_question_id": 448, "is_new_question": false }, @@ -43278,8 +43646,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 86957, - "total_submitted": 159840, + "total_acs": 87311, + "total_submitted": 160362, "frontend_question_id": 447, "is_new_question": false }, @@ -43301,8 +43669,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 44547, - "total_submitted": 112666, + "total_acs": 44808, + "total_submitted": 113267, "frontend_question_id": 446, "is_new_question": false }, @@ -43324,8 +43692,8 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 320665, - "total_submitted": 544297, + "total_acs": 323140, + "total_submitted": 547937, "frontend_question_id": 445, "is_new_question": false }, @@ -43347,8 +43715,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 45786, - "total_submitted": 179361, + "total_acs": 46258, + "total_submitted": 180190, "frontend_question_id": 444, "is_new_question": false }, @@ -43370,8 +43738,8 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 256732, - "total_submitted": 536794, + "total_acs": 259372, + "total_submitted": 541411, "frontend_question_id": 443, "is_new_question": false }, @@ -43393,8 +43761,8 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 416186, - "total_submitted": 572217, + "total_acs": 421228, + "total_submitted": 578480, "frontend_question_id": 442, "is_new_question": false }, @@ -43416,8 +43784,8 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 291131, - "total_submitted": 637776, + "total_acs": 293805, + "total_submitted": 643073, "frontend_question_id": 441, "is_new_question": false }, @@ -43439,8 +43807,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 17808, - "total_submitted": 58209, + "total_acs": 17875, + "total_submitted": 58396, "frontend_question_id": 440, "is_new_question": false }, @@ -43462,8 +43830,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 25018, - "total_submitted": 43152, + "total_acs": 25088, + "total_submitted": 43247, "frontend_question_id": 439, "is_new_question": false }, @@ -43485,8 +43853,8 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 550116, - "total_submitted": 1133789, + "total_acs": 559791, + "total_submitted": 1151787, "frontend_question_id": 438, "is_new_question": false }, @@ -43508,8 +43876,8 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 375796, - "total_submitted": 751332, + "total_acs": 380855, + "total_submitted": 762522, "frontend_question_id": 437, "is_new_question": false }, @@ -43531,8 +43899,8 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 80368, - "total_submitted": 160945, + "total_acs": 81038, + "total_submitted": 162190, "frontend_question_id": 436, "is_new_question": false }, @@ -43554,8 +43922,8 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 264761, - "total_submitted": 542694, + "total_acs": 270066, + "total_submitted": 552138, "frontend_question_id": 435, "is_new_question": false }, @@ -43577,8 +43945,8 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 119168, - "total_submitted": 314774, + "total_acs": 120109, + "total_submitted": 317364, "frontend_question_id": 434, "is_new_question": false }, @@ -43600,8 +43968,8 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 56498, - "total_submitted": 119402, + "total_acs": 57208, + "total_submitted": 120598, "frontend_question_id": 433, "is_new_question": false }, @@ -43623,8 +43991,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 60848, - "total_submitted": 167284, + "total_acs": 61409, + "total_submitted": 168582, "frontend_question_id": 432, "is_new_question": false }, @@ -43646,8 +44014,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 64258, - "total_submitted": 122558, + "total_acs": 64665, + "total_submitted": 123275, "frontend_question_id": 425, "is_new_question": false }, @@ -43669,8 +44037,8 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 250056, - "total_submitted": 490223, + "total_acs": 262307, + "total_submitted": 512728, "frontend_question_id": 424, "is_new_question": false }, @@ -43692,8 +44060,8 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 64846, - "total_submitted": 126407, + "total_acs": 65218, + "total_submitted": 127087, "frontend_question_id": 423, "is_new_question": false }, @@ -43715,8 +44083,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 40947, - "total_submitted": 105855, + "total_acs": 41135, + "total_submitted": 106318, "frontend_question_id": 422, "is_new_question": false }, @@ -43738,8 +44106,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": 125961, - "total_submitted": 231438, + "total_acs": 126921, + "total_submitted": 232961, "frontend_question_id": 421, "is_new_question": false }, @@ -43761,8 +44129,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 25495, - "total_submitted": 178719, + "total_acs": 25755, + "total_submitted": 180893, "frontend_question_id": 420, "is_new_question": false }, @@ -43784,8 +44152,8 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 154987, - "total_submitted": 209319, + "total_acs": 157152, + "total_submitted": 212006, "frontend_question_id": 419, "is_new_question": false }, @@ -43807,8 +44175,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 84362, - "total_submitted": 238033, + "total_acs": 85172, + "total_submitted": 239952, "frontend_question_id": 418, "is_new_question": false }, @@ -43830,8 +44198,8 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 218365, - "total_submitted": 435298, + "total_acs": 224319, + "total_submitted": 444708, "frontend_question_id": 417, "is_new_question": false }, @@ -43853,8 +44221,8 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 466804, - "total_submitted": 1001974, + "total_acs": 475702, + "total_submitted": 1019706, "frontend_question_id": 416, "is_new_question": false }, @@ -43876,8 +44244,8 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 486365, - "total_submitted": 929255, + "total_acs": 490397, + "total_submitted": 936311, "frontend_question_id": 415, "is_new_question": false }, @@ -43899,8 +44267,8 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 341247, - "total_submitted": 1065250, + "total_acs": 345346, + "total_submitted": 1076341, "frontend_question_id": 414, "is_new_question": false }, @@ -43922,8 +44290,8 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 236240, - "total_submitted": 365119, + "total_acs": 238449, + "total_submitted": 368285, "frontend_question_id": 413, "is_new_question": false }, @@ -43945,8 +44313,8 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 654255, - "total_submitted": 973194, + "total_acs": 667001, + "total_submitted": 989653, "frontend_question_id": 412, "is_new_question": false }, @@ -43968,8 +44336,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 13773, - "total_submitted": 35236, + "total_acs": 13814, + "total_submitted": 35322, "frontend_question_id": 411, "is_new_question": false }, @@ -43991,8 +44359,8 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 217025, - "total_submitted": 413538, + "total_acs": 219647, + "total_submitted": 417716, "frontend_question_id": 410, "is_new_question": false }, @@ -44014,8 +44382,8 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 297584, - "total_submitted": 551344, + "total_acs": 310199, + "total_submitted": 573435, "frontend_question_id": 409, "is_new_question": false }, @@ -44037,8 +44405,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 102947, - "total_submitted": 295468, + "total_acs": 104174, + "total_submitted": 298994, "frontend_question_id": 408, "is_new_question": false }, @@ -44060,8 +44428,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 70845, - "total_submitted": 150112, + "total_acs": 71268, + "total_submitted": 150931, "frontend_question_id": 407, "is_new_question": false }, @@ -44083,8 +44451,8 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 243203, - "total_submitted": 340714, + "total_acs": 266423, + "total_submitted": 367467, "frontend_question_id": 406, "is_new_question": false }, @@ -44106,8 +44474,8 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 101206, - "total_submitted": 220716, + "total_acs": 101897, + "total_submitted": 222136, "frontend_question_id": 405, "is_new_question": false }, @@ -44129,8 +44497,8 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 361995, - "total_submitted": 652145, + "total_acs": 365902, + "total_submitted": 658054, "frontend_question_id": 404, "is_new_question": false }, @@ -44152,8 +44520,8 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 158126, - "total_submitted": 367257, + "total_acs": 159654, + "total_submitted": 370555, "frontend_question_id": 403, "is_new_question": false }, @@ -44175,8 +44543,8 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 269670, - "total_submitted": 884464, + "total_acs": 271761, + "total_submitted": 891095, "frontend_question_id": 402, "is_new_question": false }, @@ -44198,8 +44566,8 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 112014, - "total_submitted": 220256, + "total_acs": 112571, + "total_submitted": 221048, "frontend_question_id": 401, "is_new_question": false }, @@ -44221,8 +44589,8 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 77194, - "total_submitted": 229278, + "total_acs": 77662, + "total_submitted": 230321, "frontend_question_id": 400, "is_new_question": false }, @@ -44244,8 +44612,8 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 287498, - "total_submitted": 488055, + "total_acs": 290487, + "total_submitted": 492651, "frontend_question_id": 399, "is_new_question": false }, @@ -44267,8 +44635,8 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 173548, - "total_submitted": 273810, + "total_acs": 174417, + "total_submitted": 275458, "frontend_question_id": 398, "is_new_question": false }, @@ -44290,8 +44658,8 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 84108, - "total_submitted": 241556, + "total_acs": 84784, + "total_submitted": 243258, "frontend_question_id": 397, "is_new_question": false }, @@ -44313,8 +44681,8 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 62794, - "total_submitted": 158384, + "total_acs": 63195, + "total_submitted": 159063, "frontend_question_id": 396, "is_new_question": false }, @@ -44336,8 +44704,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": 161031, - "total_submitted": 360590, + "total_acs": 162545, + "total_submitted": 363665, "frontend_question_id": 395, "is_new_question": false }, @@ -44359,8 +44727,8 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 511041, - "total_submitted": 902652, + "total_acs": 518785, + "total_submitted": 914433, "frontend_question_id": 394, "is_new_question": false }, @@ -44382,8 +44750,8 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 68453, - "total_submitted": 174310, + "total_acs": 68712, + "total_submitted": 174879, "frontend_question_id": 393, "is_new_question": false }, @@ -44405,8 +44773,8 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 491988, - "total_submitted": 967559, + "total_acs": 510675, + "total_submitted": 1008018, "frontend_question_id": 392, "is_new_question": false }, @@ -44428,8 +44796,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 34904, - "total_submitted": 108329, + "total_acs": 35085, + "total_submitted": 108827, "frontend_question_id": 391, "is_new_question": false }, @@ -44451,8 +44819,8 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 46705, - "total_submitted": 100648, + "total_acs": 47140, + "total_submitted": 101562, "frontend_question_id": 390, "is_new_question": false }, @@ -44474,8 +44842,8 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 406362, - "total_submitted": 671259, + "total_acs": 410242, + "total_submitted": 677639, "frontend_question_id": 389, "is_new_question": false }, @@ -44497,8 +44865,8 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 132379, - "total_submitted": 286753, + "total_acs": 133269, + "total_submitted": 288277, "frontend_question_id": 388, "is_new_question": false }, @@ -44520,8 +44888,8 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 1087814, - "total_submitted": 1893553, + "total_acs": 1099511, + "total_submitted": 1911413, "frontend_question_id": 387, "is_new_question": false }, @@ -44543,8 +44911,8 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 86408, - "total_submitted": 145306, + "total_acs": 87083, + "total_submitted": 146123, "frontend_question_id": 386, "is_new_question": false }, @@ -44566,8 +44934,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 48740, - "total_submitted": 135021, + "total_acs": 48863, + "total_submitted": 135295, "frontend_question_id": 385, "is_new_question": false }, @@ -44589,8 +44957,8 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 267848, - "total_submitted": 468096, + "total_acs": 269839, + "total_submitted": 471083, "frontend_question_id": 384, "is_new_question": false }, @@ -44612,8 +44980,8 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 420901, - "total_submitted": 749844, + "total_acs": 434029, + "total_submitted": 772085, "frontend_question_id": 383, "is_new_question": false }, @@ -44635,8 +45003,8 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 154299, - "total_submitted": 260957, + "total_acs": 154927, + "total_submitted": 261826, "frontend_question_id": 382, "is_new_question": false }, @@ -44658,8 +45026,8 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 111569, - "total_submitted": 313736, + "total_acs": 112289, + "total_submitted": 315629, "frontend_question_id": 381, "is_new_question": false }, @@ -44681,8 +45049,8 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 492879, - "total_submitted": 955755, + "total_acs": 497123, + "total_submitted": 963050, "frontend_question_id": 380, "is_new_question": false }, @@ -44704,8 +45072,8 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 56504, - "total_submitted": 111774, + "total_acs": 56835, + "total_submitted": 112340, "frontend_question_id": 379, "is_new_question": false }, @@ -44727,8 +45095,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": 398381, - "total_submitted": 664160, + "total_acs": 402817, + "total_submitted": 670920, "frontend_question_id": 378, "is_new_question": false }, @@ -44750,8 +45118,8 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 253692, - "total_submitted": 509985, + "total_acs": 257327, + "total_submitted": 516504, "frontend_question_id": 377, "is_new_question": false }, @@ -44773,8 +45141,8 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 142656, - "total_submitted": 314970, + "total_acs": 195019, + "total_submitted": 406758, "frontend_question_id": 376, "is_new_question": false }, @@ -44796,8 +45164,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 94773, - "total_submitted": 207420, + "total_acs": 95413, + "total_submitted": 208399, "frontend_question_id": 375, "is_new_question": false }, @@ -44819,8 +45187,8 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 342586, - "total_submitted": 689314, + "total_acs": 346765, + "total_submitted": 696440, "frontend_question_id": 374, "is_new_question": false }, @@ -44842,8 +45210,8 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 175636, - "total_submitted": 455145, + "total_acs": 177066, + "total_submitted": 459137, "frontend_question_id": 373, "is_new_question": false }, @@ -44865,8 +45233,8 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 50507, - "total_submitted": 134754, + "total_acs": 50887, + "total_submitted": 135724, "frontend_question_id": 372, "is_new_question": false }, @@ -44888,8 +45256,8 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 309788, - "total_submitted": 612206, + "total_acs": 313277, + "total_submitted": 619029, "frontend_question_id": 371, "is_new_question": false }, @@ -44911,8 +45279,8 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 73083, - "total_submitted": 104391, + "total_acs": 73880, + "total_submitted": 105360, "frontend_question_id": 370, "is_new_question": false }, @@ -44934,8 +45302,8 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 69044, - "total_submitted": 113860, + "total_acs": 69429, + "total_submitted": 114403, "frontend_question_id": 369, "is_new_question": false }, @@ -44957,8 +45325,8 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 154935, - "total_submitted": 379941, + "total_acs": 156219, + "total_submitted": 382468, "frontend_question_id": 368, "is_new_question": false }, @@ -44980,8 +45348,8 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 385428, - "total_submitted": 893413, + "total_acs": 389713, + "total_submitted": 902776, "frontend_question_id": 367, "is_new_question": false }, @@ -45003,8 +45371,8 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 192361, - "total_submitted": 242941, + "total_acs": 196397, + "total_submitted": 247553, "frontend_question_id": 366, "is_new_question": false }, @@ -45026,8 +45394,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 66066, - "total_submitted": 187317, + "total_acs": 67003, + "total_submitted": 188988, "frontend_question_id": 365, "is_new_question": false }, @@ -45049,8 +45417,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 119633, - "total_submitted": 173636, + "total_acs": 120641, + "total_submitted": 175320, "frontend_question_id": 364, "is_new_question": false }, @@ -45072,8 +45440,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": 80265, - "total_submitted": 199713, + "total_acs": 80629, + "total_submitted": 200684, "frontend_question_id": 363, "is_new_question": false }, @@ -45095,8 +45463,8 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 169980, - "total_submitted": 251151, + "total_acs": 171671, + "total_submitted": 253398, "frontend_question_id": 362, "is_new_question": false }, @@ -45118,8 +45486,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 66989, - "total_submitted": 133123, + "total_acs": 67400, + "total_submitted": 133732, "frontend_question_id": 361, "is_new_question": false }, @@ -45141,8 +45509,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 56815, - "total_submitted": 104824, + "total_acs": 57317, + "total_submitted": 105546, "frontend_question_id": 360, "is_new_question": false }, @@ -45164,8 +45532,8 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 235205, - "total_submitted": 312845, + "total_acs": 238576, + "total_submitted": 316970, "frontend_question_id": 359, "is_new_question": false }, @@ -45187,8 +45555,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 53524, - "total_submitted": 143675, + "total_acs": 53855, + "total_submitted": 144410, "frontend_question_id": 358, "is_new_question": false }, @@ -45210,8 +45578,8 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 104427, - "total_submitted": 205304, + "total_acs": 105042, + "total_submitted": 206293, "frontend_question_id": 357, "is_new_question": false }, @@ -45233,8 +45601,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 32380, - "total_submitted": 93977, + "total_acs": 32457, + "total_submitted": 94143, "frontend_question_id": 356, "is_new_question": false }, @@ -45256,8 +45624,8 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 91667, - "total_submitted": 260216, + "total_acs": 93082, + "total_submitted": 263123, "frontend_question_id": 355, "is_new_question": false }, @@ -45279,8 +45647,8 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 168134, - "total_submitted": 433845, + "total_acs": 169350, + "total_submitted": 437435, "frontend_question_id": 354, "is_new_question": false }, @@ -45302,8 +45670,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 62333, - "total_submitted": 162068, + "total_acs": 62807, + "total_submitted": 163099, "frontend_question_id": 353, "is_new_question": false }, @@ -45325,8 +45693,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 52260, - "total_submitted": 102619, + "total_acs": 52580, + "total_submitted": 103077, "frontend_question_id": 352, "is_new_question": false }, @@ -45348,8 +45716,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 65416, - "total_submitted": 127912, + "total_acs": 65701, + "total_submitted": 128436, "frontend_question_id": 351, "is_new_question": false }, @@ -45371,8 +45739,8 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 837406, - "total_submitted": 1517297, + "total_acs": 848863, + "total_submitted": 1537068, "frontend_question_id": 350, "is_new_question": false }, @@ -45394,8 +45762,8 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 688992, - "total_submitted": 991808, + "total_acs": 696256, + "total_submitted": 1001050, "frontend_question_id": 349, "is_new_question": false }, @@ -45417,8 +45785,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 188343, - "total_submitted": 328308, + "total_acs": 189990, + "total_submitted": 330968, "frontend_question_id": 348, "is_new_question": false }, @@ -45440,8 +45808,8 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 1022051, - "total_submitted": 1572091, + "total_acs": 1041747, + "total_submitted": 1602697, "frontend_question_id": 347, "is_new_question": false }, @@ -45463,8 +45831,8 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 270021, - "total_submitted": 352464, + "total_acs": 272961, + "total_submitted": 356041, "frontend_question_id": 346, "is_new_question": false }, @@ -45486,8 +45854,8 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 360392, - "total_submitted": 764451, + "total_acs": 363206, + "total_submitted": 769495, "frontend_question_id": 345, "is_new_question": false }, @@ -45509,8 +45877,8 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 1665127, - "total_submitted": 2211503, + "total_acs": 1685308, + "total_submitted": 2235500, "frontend_question_id": 344, "is_new_question": false }, @@ -45532,8 +45900,8 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 192947, - "total_submitted": 353772, + "total_acs": 195065, + "total_submitted": 357001, "frontend_question_id": 343, "is_new_question": false }, @@ -45555,8 +45923,8 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 308533, - "total_submitted": 695423, + "total_acs": 311900, + "total_submitted": 701615, "frontend_question_id": 342, "is_new_question": false }, @@ -45578,8 +45946,8 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 329827, - "total_submitted": 541064, + "total_acs": 331898, + "total_submitted": 543913, "frontend_question_id": 341, "is_new_question": false }, @@ -45601,8 +45969,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": 281771, - "total_submitted": 593176, + "total_acs": 283396, + "total_submitted": 596201, "frontend_question_id": 340, "is_new_question": false }, @@ -45624,8 +45992,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 200786, - "total_submitted": 246089, + "total_acs": 202486, + "total_submitted": 248001, "frontend_question_id": 339, "is_new_question": false }, @@ -45647,8 +46015,8 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 606026, - "total_submitted": 812554, + "total_acs": 615365, + "total_submitted": 824270, "frontend_question_id": 338, "is_new_question": false }, @@ -45670,8 +46038,8 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 294070, - "total_submitted": 548325, + "total_acs": 296690, + "total_submitted": 553040, "frontend_question_id": 337, "is_new_question": false }, @@ -45693,8 +46061,8 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 150071, - "total_submitted": 422580, + "total_acs": 150662, + "total_submitted": 424902, "frontend_question_id": 336, "is_new_question": false }, @@ -45716,8 +46084,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 27948, - "total_submitted": 95884, + "total_acs": 28073, + "total_submitted": 96228, "frontend_question_id": 335, "is_new_question": false }, @@ -45739,8 +46107,8 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 279734, - "total_submitted": 672448, + "total_acs": 282258, + "total_submitted": 678210, "frontend_question_id": 334, "is_new_question": false }, @@ -45762,8 +46130,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 84925, - "total_submitted": 204244, + "total_acs": 85501, + "total_submitted": 205331, "frontend_question_id": 333, "is_new_question": false }, @@ -45785,8 +46153,8 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 289210, - "total_submitted": 715699, + "total_acs": 291910, + "total_submitted": 720963, "frontend_question_id": 332, "is_new_question": false }, @@ -45808,8 +46176,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": 115884, - "total_submitted": 264330, + "total_acs": 116507, + "total_submitted": 265634, "frontend_question_id": 331, "is_new_question": false }, @@ -45831,8 +46199,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 56995, - "total_submitted": 143652, + "total_acs": 57195, + "total_submitted": 144031, "frontend_question_id": 330, "is_new_question": false }, @@ -45854,8 +46222,8 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 371910, - "total_submitted": 723237, + "total_acs": 377433, + "total_submitted": 732513, "frontend_question_id": 329, "is_new_question": false }, @@ -45877,8 +46245,8 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 543406, - "total_submitted": 910095, + "total_acs": 549900, + "total_submitted": 919848, "frontend_question_id": 328, "is_new_question": false }, @@ -45900,8 +46268,8 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 61068, - "total_submitted": 169165, + "total_acs": 61532, + "total_submitted": 170332, "frontend_question_id": 327, "is_new_question": false }, @@ -45923,8 +46291,8 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 480834, - "total_submitted": 1100783, + "total_acs": 486023, + "total_submitted": 1111970, "frontend_question_id": 326, "is_new_question": false }, @@ -45946,8 +46314,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 159236, - "total_submitted": 323182, + "total_acs": 160067, + "total_submitted": 324775, "frontend_question_id": 325, "is_new_question": false }, @@ -45969,8 +46337,8 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 124751, - "total_submitted": 384655, + "total_acs": 125889, + "total_submitted": 387207, "frontend_question_id": 324, "is_new_question": false }, @@ -45992,8 +46360,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": 265342, - "total_submitted": 431803, + "total_acs": 268982, + "total_submitted": 437336, "frontend_question_id": 323, "is_new_question": false }, @@ -46015,8 +46383,8 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 1068161, - "total_submitted": 2617090, + "total_acs": 1086239, + "total_submitted": 2655524, "frontend_question_id": 322, "is_new_question": false }, @@ -46038,8 +46406,8 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 50499, - "total_submitted": 176926, + "total_acs": 50706, + "total_submitted": 177514, "frontend_question_id": 321, "is_new_question": false }, @@ -46061,8 +46429,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 61750, - "total_submitted": 108871, + "total_acs": 61986, + "total_submitted": 109177, "frontend_question_id": 320, "is_new_question": false }, @@ -46084,8 +46452,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 117345, - "total_submitted": 246867, + "total_acs": 118040, + "total_submitted": 248122, "frontend_question_id": 319, "is_new_question": false }, @@ -46107,8 +46475,8 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 189620, - "total_submitted": 314845, + "total_acs": 190311, + "total_submitted": 316002, "frontend_question_id": 318, "is_new_question": false }, @@ -46130,8 +46498,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 141596, - "total_submitted": 327726, + "total_acs": 142432, + "total_submitted": 329849, "frontend_question_id": 317, "is_new_question": false }, @@ -46153,8 +46521,8 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 198219, - "total_submitted": 449719, + "total_acs": 199741, + "total_submitted": 452648, "frontend_question_id": 316, "is_new_question": false }, @@ -46176,8 +46544,8 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 231788, - "total_submitted": 551581, + "total_acs": 233754, + "total_submitted": 556312, "frontend_question_id": 315, "is_new_question": false }, @@ -46199,8 +46567,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 282183, - "total_submitted": 548238, + "total_acs": 284755, + "total_submitted": 552714, "frontend_question_id": 314, "is_new_question": false }, @@ -46222,8 +46590,8 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 106796, - "total_submitted": 232844, + "total_acs": 107471, + "total_submitted": 234340, "frontend_question_id": 313, "is_new_question": false }, @@ -46245,8 +46613,8 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 192698, - "total_submitted": 340658, + "total_acs": 194878, + "total_submitted": 344217, "frontend_question_id": 312, "is_new_question": false }, @@ -46268,8 +46636,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 157221, - "total_submitted": 236181, + "total_acs": 157885, + "total_submitted": 237002, "frontend_question_id": 311, "is_new_question": false }, @@ -46291,8 +46659,8 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 204619, - "total_submitted": 535468, + "total_acs": 207696, + "total_submitted": 542640, "frontend_question_id": 310, "is_new_question": false }, @@ -46314,8 +46682,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": 291887, - "total_submitted": 549886, + "total_acs": 296273, + "total_submitted": 556274, "frontend_question_id": 309, "is_new_question": false }, @@ -46337,8 +46705,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 66877, - "total_submitted": 160949, + "total_acs": 67126, + "total_submitted": 161280, "frontend_question_id": 308, "is_new_question": false }, @@ -46360,8 +46728,8 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 186584, - "total_submitted": 480099, + "total_acs": 188062, + "total_submitted": 483165, "frontend_question_id": 307, "is_new_question": false }, @@ -46383,8 +46751,8 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 70728, - "total_submitted": 230724, + "total_acs": 71167, + "total_submitted": 231916, "frontend_question_id": 306, "is_new_question": false }, @@ -46406,8 +46774,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 117011, - "total_submitted": 296394, + "total_acs": 117772, + "total_submitted": 298229, "frontend_question_id": 305, "is_new_question": false }, @@ -46429,8 +46797,8 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 284179, - "total_submitted": 554959, + "total_acs": 286253, + "total_submitted": 557852, "frontend_question_id": 304, "is_new_question": false }, @@ -46452,8 +46820,8 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 367414, - "total_submitted": 651026, + "total_acs": 370476, + "total_submitted": 654477, "frontend_question_id": 303, "is_new_question": false }, @@ -46475,8 +46843,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 43634, - "total_submitted": 75826, + "total_acs": 44041, + "total_submitted": 76389, "frontend_question_id": 302, "is_new_question": false }, @@ -46498,8 +46866,8 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 355070, - "total_submitted": 756663, + "total_acs": 357003, + "total_submitted": 760528, "frontend_question_id": 301, "is_new_question": false }, @@ -46521,8 +46889,8 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 902434, - "total_submitted": 1808775, + "total_acs": 917048, + "total_submitted": 1832969, "frontend_question_id": 300, "is_new_question": false }, @@ -46544,8 +46912,8 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 275981, - "total_submitted": 580772, + "total_acs": 281589, + "total_submitted": 589603, "frontend_question_id": 299, "is_new_question": false }, @@ -46567,8 +46935,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 123344, - "total_submitted": 239669, + "total_acs": 123977, + "total_submitted": 240618, "frontend_question_id": 298, "is_new_question": false }, @@ -46590,8 +46958,8 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 631721, - "total_submitted": 1166757, + "total_acs": 639311, + "total_submitted": 1178373, "frontend_question_id": 297, "is_new_question": false }, @@ -46613,8 +46981,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 59787, - "total_submitted": 100542, + "total_acs": 60124, + "total_submitted": 101048, "frontend_question_id": 296, "is_new_question": false }, @@ -46636,8 +47004,8 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 479660, - "total_submitted": 947919, + "total_acs": 486529, + "total_submitted": 960461, "frontend_question_id": 295, "is_new_question": false }, @@ -46659,8 +47027,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 64412, - "total_submitted": 124827, + "total_acs": 64629, + "total_submitted": 125201, "frontend_question_id": 294, "is_new_question": false }, @@ -46682,8 +47050,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 60099, - "total_submitted": 95860, + "total_acs": 60289, + "total_submitted": 96117, "frontend_question_id": 293, "is_new_question": false }, @@ -46705,8 +47073,8 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 283777, - "total_submitted": 510174, + "total_acs": 285177, + "total_submitted": 512589, "frontend_question_id": 292, "is_new_question": false }, @@ -46728,8 +47096,8 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 62427, - "total_submitted": 134093, + "total_acs": 62816, + "total_submitted": 134783, "frontend_question_id": 291, "is_new_question": false }, @@ -46751,8 +47119,8 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 371555, - "total_submitted": 922993, + "total_acs": 374480, + "total_submitted": 930052, "frontend_question_id": 290, "is_new_question": false }, @@ -46774,8 +47142,8 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 348571, - "total_submitted": 530462, + "total_acs": 351089, + "total_submitted": 533424, "frontend_question_id": 289, "is_new_question": false }, @@ -46797,8 +47165,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 65394, - "total_submitted": 262518, + "total_acs": 65595, + "total_submitted": 262937, "frontend_question_id": 288, "is_new_question": false }, @@ -46820,8 +47188,8 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 894817, - "total_submitted": 1519540, + "total_acs": 910840, + "total_submitted": 1545653, "frontend_question_id": 287, "is_new_question": false }, @@ -46843,8 +47211,8 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 228264, - "total_submitted": 382883, + "total_acs": 230918, + "total_submitted": 386802, "frontend_question_id": 286, "is_new_question": false }, @@ -46866,8 +47234,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 271536, - "total_submitted": 571319, + "total_acs": 273767, + "total_submitted": 574800, "frontend_question_id": 285, "is_new_question": false }, @@ -46889,8 +47257,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 193965, - "total_submitted": 335727, + "total_acs": 194494, + "total_submitted": 336409, "frontend_question_id": 284, "is_new_question": false }, @@ -46912,8 +47280,8 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 1743140, - "total_submitted": 2863155, + "total_acs": 1765902, + "total_submitted": 2897961, "frontend_question_id": 283, "is_new_question": false }, @@ -46935,8 +47303,8 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 184910, - "total_submitted": 471980, + "total_acs": 185615, + "total_submitted": 473847, "frontend_question_id": 282, "is_new_question": false }, @@ -46958,8 +47326,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 81544, - "total_submitted": 131918, + "total_acs": 81831, + "total_submitted": 132267, "frontend_question_id": 281, "is_new_question": false }, @@ -46981,8 +47349,8 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 116105, - "total_submitted": 175612, + "total_acs": 116591, + "total_submitted": 176305, "frontend_question_id": 280, "is_new_question": false }, @@ -47004,8 +47372,8 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 540140, - "total_submitted": 1038357, + "total_acs": 544742, + "total_submitted": 1046368, "frontend_question_id": 279, "is_new_question": false }, @@ -47027,8 +47395,8 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 1071175, - "total_submitted": 2541130, + "total_acs": 1094315, + "total_submitted": 2588605, "frontend_question_id": 278, "is_new_question": false }, @@ -47050,8 +47418,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 229352, - "total_submitted": 489085, + "total_acs": 230743, + "total_submitted": 491960, "frontend_question_id": 277, "is_new_question": false }, @@ -47073,8 +47441,8 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 87873, - "total_submitted": 202888, + "total_acs": 88595, + "total_submitted": 204067, "frontend_question_id": 276, "is_new_question": false }, @@ -47096,8 +47464,8 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 161585, - "total_submitted": 434760, + "total_acs": 162408, + "total_submitted": 436635, "frontend_question_id": 275, "is_new_question": false }, @@ -47119,8 +47487,8 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 239016, - "total_submitted": 631927, + "total_acs": 240293, + "total_submitted": 634507, "frontend_question_id": 274, "is_new_question": false }, @@ -47142,8 +47510,8 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 309633, - "total_submitted": 1043462, + "total_acs": 311463, + "total_submitted": 1049467, "frontend_question_id": 273, "is_new_question": false }, @@ -47165,8 +47533,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 101742, - "total_submitted": 176710, + "total_acs": 102613, + "total_submitted": 177926, "frontend_question_id": 272, "is_new_question": false }, @@ -47188,8 +47556,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 102792, - "total_submitted": 263222, + "total_acs": 104823, + "total_submitted": 266663, "frontend_question_id": 271, "is_new_question": false }, @@ -47211,8 +47579,8 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 259077, - "total_submitted": 478766, + "total_acs": 260693, + "total_submitted": 481139, "frontend_question_id": 270, "is_new_question": false }, @@ -47234,8 +47602,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 298220, - "total_submitted": 851891, + "total_acs": 300724, + "total_submitted": 858568, "frontend_question_id": 269, "is_new_question": false }, @@ -47257,8 +47625,8 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 1115661, - "total_submitted": 1838653, + "total_acs": 1132798, + "total_submitted": 1863773, "frontend_question_id": 268, "is_new_question": false }, @@ -47280,8 +47648,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 56122, - "total_submitted": 140340, + "total_acs": 56454, + "total_submitted": 140966, "frontend_question_id": 267, "is_new_question": false }, @@ -47303,8 +47671,8 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 167747, - "total_submitted": 255749, + "total_acs": 168499, + "total_submitted": 256766, "frontend_question_id": 266, "is_new_question": false }, @@ -47326,8 +47694,8 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 98039, - "total_submitted": 191006, + "total_acs": 99353, + "total_submitted": 192724, "frontend_question_id": 265, "is_new_question": false }, @@ -47349,8 +47717,8 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 265901, - "total_submitted": 583601, + "total_acs": 268237, + "total_submitted": 587626, "frontend_question_id": 264, "is_new_question": false }, @@ -47372,8 +47740,8 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 305566, - "total_submitted": 730450, + "total_acs": 308117, + "total_submitted": 736605, "frontend_question_id": 263, "is_new_question": false }, @@ -47395,8 +47763,8 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 120128, - "total_submitted": 315423, + "total_acs": 121456, + "total_submitted": 318494, "frontend_question_id": 262, "is_new_question": false }, @@ -47418,8 +47786,8 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 276523, - "total_submitted": 598809, + "total_acs": 280550, + "total_submitted": 606433, "frontend_question_id": 261, "is_new_question": false }, @@ -47441,8 +47809,8 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 259229, - "total_submitted": 385614, + "total_acs": 260926, + "total_submitted": 387979, "frontend_question_id": 260, "is_new_question": false }, @@ -47464,8 +47832,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 119453, - "total_submitted": 236785, + "total_acs": 120387, + "total_submitted": 238482, "frontend_question_id": 259, "is_new_question": false }, @@ -47487,8 +47855,8 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 479525, - "total_submitted": 764349, + "total_acs": 482587, + "total_submitted": 768404, "frontend_question_id": 258, "is_new_question": false }, @@ -47510,8 +47878,8 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 526617, - "total_submitted": 888482, + "total_acs": 531592, + "total_submitted": 894748, "frontend_question_id": 257, "is_new_question": false }, @@ -47533,8 +47901,8 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 161300, - "total_submitted": 271913, + "total_acs": 166984, + "total_submitted": 278965, "frontend_question_id": 256, "is_new_question": false }, @@ -47556,8 +47924,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": 65703, - "total_submitted": 137650, + "total_acs": 65990, + "total_submitted": 138167, "frontend_question_id": 255, "is_new_question": false }, @@ -47579,8 +47947,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 110108, - "total_submitted": 225855, + "total_acs": 110699, + "total_submitted": 227049, "frontend_question_id": 254, "is_new_question": false }, @@ -47602,8 +47970,8 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 661093, - "total_submitted": 1323543, + "total_acs": 667880, + "total_submitted": 1335719, "frontend_question_id": 253, "is_new_question": false }, @@ -47625,8 +47993,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 280182, - "total_submitted": 493139, + "total_acs": 283358, + "total_submitted": 498521, "frontend_question_id": 252, "is_new_question": false }, @@ -47648,8 +48016,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 106329, - "total_submitted": 220685, + "total_acs": 106881, + "total_submitted": 221669, "frontend_question_id": 251, "is_new_question": false }, @@ -47671,8 +48039,8 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 124297, - "total_submitted": 226339, + "total_acs": 125359, + "total_submitted": 228102, "frontend_question_id": 250, "is_new_question": false }, @@ -47694,8 +48062,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 173776, - "total_submitted": 272101, + "total_acs": 174885, + "total_submitted": 273752, "frontend_question_id": 249, "is_new_question": false }, @@ -47717,8 +48085,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 34085, - "total_submitted": 82093, + "total_acs": 34185, + "total_submitted": 82260, "frontend_question_id": 248, "is_new_question": false }, @@ -47740,8 +48108,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 121305, - "total_submitted": 237029, + "total_acs": 121913, + "total_submitted": 238126, "frontend_question_id": 247, "is_new_question": false }, @@ -47763,8 +48131,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 142887, - "total_submitted": 300342, + "total_acs": 144008, + "total_submitted": 302619, "frontend_question_id": 246, "is_new_question": false }, @@ -47786,8 +48154,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 69371, - "total_submitted": 120999, + "total_acs": 69778, + "total_submitted": 121671, "frontend_question_id": 245, "is_new_question": false }, @@ -47809,8 +48177,8 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 133131, - "total_submitted": 221525, + "total_acs": 134583, + "total_submitted": 223542, "frontend_question_id": 244, "is_new_question": false }, @@ -47832,8 +48200,8 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 182104, - "total_submitted": 281751, + "total_acs": 183560, + "total_submitted": 283742, "frontend_question_id": 243, "is_new_question": false }, @@ -47855,8 +48223,8 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 1375534, - "total_submitted": 2227647, + "total_acs": 1409245, + "total_submitted": 2279804, "frontend_question_id": 242, "is_new_question": false }, @@ -47878,8 +48246,8 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 168313, - "total_submitted": 270634, + "total_acs": 169859, + "total_submitted": 272578, "frontend_question_id": 241, "is_new_question": false }, @@ -47901,8 +48269,8 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 619629, - "total_submitted": 1268496, + "total_acs": 626104, + "total_submitted": 1279021, "frontend_question_id": 240, "is_new_question": false }, @@ -47924,8 +48292,8 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 597287, - "total_submitted": 1288662, + "total_acs": 607413, + "total_submitted": 1308981, "frontend_question_id": 239, "is_new_question": false }, @@ -47947,8 +48315,8 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 1224059, - "total_submitted": 1906108, + "total_acs": 1245075, + "total_submitted": 1936732, "frontend_question_id": 238, "is_new_question": false }, @@ -47970,8 +48338,8 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 831820, - "total_submitted": 1145880, + "total_acs": 841560, + "total_submitted": 1156562, "frontend_question_id": 237, "is_new_question": false }, @@ -47993,8 +48361,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": 1036776, - "total_submitted": 1851434, + "total_acs": 1050054, + "total_submitted": 1870009, "frontend_question_id": 236, "is_new_question": false }, @@ -48016,8 +48384,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": 808746, - "total_submitted": 1400119, + "total_acs": 829235, + "total_submitted": 1430082, "frontend_question_id": 235, "is_new_question": false }, @@ -48039,8 +48407,8 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 1021845, - "total_submitted": 2163114, + "total_acs": 1040919, + "total_submitted": 2195670, "frontend_question_id": 234, "is_new_question": false }, @@ -48062,8 +48430,8 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 66297, - "total_submitted": 196072, + "total_acs": 66697, + "total_submitted": 197038, "frontend_question_id": 233, "is_new_question": false }, @@ -48085,8 +48453,8 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 440795, - "total_submitted": 743912, + "total_acs": 449777, + "total_submitted": 756077, "frontend_question_id": 232, "is_new_question": false }, @@ -48108,8 +48476,8 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 657034, - "total_submitted": 1455179, + "total_acs": 666213, + "total_submitted": 1474267, "frontend_question_id": 231, "is_new_question": false }, @@ -48131,8 +48499,8 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 840765, - "total_submitted": 1233211, + "total_acs": 854334, + "total_submitted": 1250604, "frontend_question_id": 230, "is_new_question": false }, @@ -48154,8 +48522,8 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 306915, - "total_submitted": 715302, + "total_acs": 312076, + "total_submitted": 725030, "frontend_question_id": 229, "is_new_question": false }, @@ -48177,8 +48545,8 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 300612, - "total_submitted": 646551, + "total_acs": 302448, + "total_submitted": 649990, "frontend_question_id": 228, "is_new_question": false }, @@ -48200,8 +48568,8 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 442403, - "total_submitted": 1058730, + "total_acs": 446276, + "total_submitted": 1067298, "frontend_question_id": 227, "is_new_question": false }, @@ -48223,8 +48591,8 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 1097043, - "total_submitted": 1521089, + "total_acs": 1119171, + "total_submitted": 1548469, "frontend_question_id": 226, "is_new_question": false }, @@ -48246,8 +48614,8 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 353977, - "total_submitted": 632605, + "total_acs": 358710, + "total_submitted": 638874, "frontend_question_id": 225, "is_new_question": false }, @@ -48269,8 +48637,8 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 302690, - "total_submitted": 743400, + "total_acs": 305133, + "total_submitted": 748717, "frontend_question_id": 224, "is_new_question": false }, @@ -48292,8 +48660,8 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 138490, - "total_submitted": 343196, + "total_acs": 139102, + "total_submitted": 344302, "frontend_question_id": 223, "is_new_question": false }, @@ -48315,8 +48683,8 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 418426, - "total_submitted": 747288, + "total_acs": 423034, + "total_submitted": 753063, "frontend_question_id": 222, "is_new_question": false }, @@ -48338,8 +48706,8 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 505968, - "total_submitted": 1156039, + "total_acs": 510570, + "total_submitted": 1164173, "frontend_question_id": 221, "is_new_question": false }, @@ -48361,8 +48729,8 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 206488, - "total_submitted": 950519, + "total_acs": 207695, + "total_submitted": 956765, "frontend_question_id": 220, "is_new_question": false }, @@ -48384,8 +48752,8 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 481906, - "total_submitted": 1182052, + "total_acs": 487741, + "total_submitted": 1195549, "frontend_question_id": 219, "is_new_question": false }, @@ -48407,8 +48775,8 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 211316, - "total_submitted": 542185, + "total_acs": 212552, + "total_submitted": 544568, "frontend_question_id": 218, "is_new_question": false }, @@ -48430,8 +48798,8 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 1742379, - "total_submitted": 2855379, + "total_acs": 1790104, + "total_submitted": 2931732, "frontend_question_id": 217, "is_new_question": false }, @@ -48453,8 +48821,8 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 340268, - "total_submitted": 513095, + "total_acs": 343363, + "total_submitted": 517055, "frontend_question_id": 216, "is_new_question": false }, @@ -48476,8 +48844,8 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 1430859, - "total_submitted": 2208661, + "total_acs": 1448838, + "total_submitted": 2231471, "frontend_question_id": 215, "is_new_question": false }, @@ -48499,8 +48867,8 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 139394, - "total_submitted": 437147, + "total_acs": 140153, + "total_submitted": 438967, "frontend_question_id": 214, "is_new_question": false }, @@ -48522,8 +48890,8 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 423664, - "total_submitted": 1054864, + "total_acs": 432726, + "total_submitted": 1075489, "frontend_question_id": 213, "is_new_question": false }, @@ -48545,8 +48913,8 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 451252, - "total_submitted": 1200510, + "total_acs": 455646, + "total_submitted": 1215114, "frontend_question_id": 212, "is_new_question": false }, @@ -48568,8 +48936,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": 414421, - "total_submitted": 945860, + "total_acs": 418340, + "total_submitted": 955840, "frontend_question_id": 211, "is_new_question": false }, @@ -48591,8 +48959,8 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 651825, - "total_submitted": 1386168, + "total_acs": 661126, + "total_submitted": 1402934, "frontend_question_id": 210, "is_new_question": false }, @@ -48614,8 +48982,8 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 551839, - "total_submitted": 1259383, + "total_acs": 559982, + "total_submitted": 1274955, "frontend_question_id": 209, "is_new_question": false }, @@ -48637,8 +49005,8 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 610872, - "total_submitted": 1034376, + "total_acs": 620006, + "total_submitted": 1046086, "frontend_question_id": 208, "is_new_question": false }, @@ -48660,8 +49028,8 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 912671, - "total_submitted": 2021296, + "total_acs": 926979, + "total_submitted": 2051629, "frontend_question_id": 207, "is_new_question": false }, @@ -48683,8 +49051,8 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 2243331, - "total_submitted": 3161869, + "total_acs": 2287253, + "total_submitted": 3215691, "frontend_question_id": 206, "is_new_question": false }, @@ -48706,8 +49074,8 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 527661, - "total_submitted": 1249195, + "total_acs": 546379, + "total_submitted": 1292286, "frontend_question_id": 205, "is_new_question": false }, @@ -48729,8 +49097,8 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 622398, - "total_submitted": 1884949, + "total_acs": 626933, + "total_submitted": 1898397, "frontend_question_id": 204, "is_new_question": false }, @@ -48752,8 +49120,8 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 735072, - "total_submitted": 1673797, + "total_acs": 744791, + "total_submitted": 1692205, "frontend_question_id": 203, "is_new_question": false }, @@ -48775,8 +49143,8 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 853173, - "total_submitted": 1592082, + "total_acs": 867348, + "total_submitted": 1615130, "frontend_question_id": 202, "is_new_question": false }, @@ -48798,8 +49166,8 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 219041, - "total_submitted": 522107, + "total_acs": 220142, + "total_submitted": 524262, "frontend_question_id": 201, "is_new_question": false }, @@ -48821,8 +49189,8 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 1641668, - "total_submitted": 3011455, + "total_acs": 1668193, + "total_submitted": 3050677, "frontend_question_id": 200, "is_new_question": false }, @@ -48840,12 +49208,12 @@ "question_id": 199, "question__article__live": true, "question__article__slug": "binary-tree-right-side-view", - "question__article__has_video_solution": false, + "question__article__has_video_solution": true, "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 704386, - "total_submitted": 1175056, + "total_acs": 764457, + "total_submitted": 1260771, "frontend_question_id": 199, "is_new_question": false }, @@ -48867,8 +49235,8 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 1194176, - "total_submitted": 2504469, + "total_acs": 1214707, + "total_submitted": 2540216, "frontend_question_id": 198, "is_new_question": false }, @@ -48890,8 +49258,8 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 237233, - "total_submitted": 549563, + "total_acs": 241128, + "total_submitted": 556512, "frontend_question_id": 197, "is_new_question": false }, @@ -48913,8 +49281,8 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 244621, - "total_submitted": 447714, + "total_acs": 250384, + "total_submitted": 454653, "frontend_question_id": 196, "is_new_question": false }, @@ -48936,8 +49304,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 74957, - "total_submitted": 228283, + "total_acs": 75406, + "total_submitted": 229627, "frontend_question_id": 195, "is_new_question": false }, @@ -48959,8 +49327,8 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 18708, - "total_submitted": 74592, + "total_acs": 18847, + "total_submitted": 74955, "frontend_question_id": 194, "is_new_question": false }, @@ -48982,8 +49350,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 57294, - "total_submitted": 222009, + "total_acs": 57682, + "total_submitted": 223409, "frontend_question_id": 193, "is_new_question": false }, @@ -49005,8 +49373,8 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 37966, - "total_submitted": 148135, + "total_acs": 38186, + "total_submitted": 148959, "frontend_question_id": 192, "is_new_question": false }, @@ -49028,8 +49396,8 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 811692, - "total_submitted": 1295615, + "total_acs": 824961, + "total_submitted": 1312137, "frontend_question_id": 191, "is_new_question": false }, @@ -49051,8 +49419,8 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 493311, - "total_submitted": 987042, + "total_acs": 499380, + "total_submitted": 994692, "frontend_question_id": 190, "is_new_question": false }, @@ -49074,8 +49442,8 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 1162208, - "total_submitted": 2997597, + "total_acs": 1177237, + "total_submitted": 3033101, "frontend_question_id": 189, "is_new_question": false }, @@ -49097,8 +49465,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": 255580, - "total_submitted": 745212, + "total_acs": 259196, + "total_submitted": 751611, "frontend_question_id": 188, "is_new_question": false }, @@ -49120,8 +49488,8 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 275291, - "total_submitted": 608766, + "total_acs": 277701, + "total_submitted": 612518, "frontend_question_id": 187, "is_new_question": false }, @@ -49143,8 +49511,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 136415, - "total_submitted": 264939, + "total_acs": 137158, + "total_submitted": 265828, "frontend_question_id": 186, "is_new_question": false }, @@ -49166,8 +49534,8 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 174576, - "total_submitted": 362863, + "total_acs": 176462, + "total_submitted": 365368, "frontend_question_id": 185, "is_new_question": false }, @@ -49189,8 +49557,8 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 232425, - "total_submitted": 486253, + "total_acs": 235306, + "total_submitted": 490416, "frontend_question_id": 184, "is_new_question": false }, @@ -49212,8 +49580,8 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 389949, - "total_submitted": 600230, + "total_acs": 399960, + "total_submitted": 612701, "frontend_question_id": 183, "is_new_question": false }, @@ -49235,8 +49603,8 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 370967, - "total_submitted": 533994, + "total_acs": 376079, + "total_submitted": 540392, "frontend_question_id": 182, "is_new_question": false }, @@ -49258,8 +49626,8 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 374574, - "total_submitted": 558955, + "total_acs": 379207, + "total_submitted": 564648, "frontend_question_id": 181, "is_new_question": false }, @@ -49281,8 +49649,8 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 197086, - "total_submitted": 428837, + "total_acs": 199404, + "total_submitted": 432946, "frontend_question_id": 180, "is_new_question": false }, @@ -49304,8 +49672,8 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 327233, - "total_submitted": 984736, + "total_acs": 330423, + "total_submitted": 991817, "frontend_question_id": 179, "is_new_question": false }, @@ -49327,8 +49695,8 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 234646, - "total_submitted": 403420, + "total_acs": 237453, + "total_submitted": 406952, "frontend_question_id": 178, "is_new_question": false }, @@ -49350,8 +49718,8 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 246809, - "total_submitted": 676913, + "total_acs": 249505, + "total_submitted": 682523, "frontend_question_id": 177, "is_new_question": false }, @@ -49373,8 +49741,8 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 496731, - "total_submitted": 1393545, + "total_acs": 503109, + "total_submitted": 1408281, "frontend_question_id": 176, "is_new_question": false }, @@ -49396,8 +49764,8 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 562049, - "total_submitted": 791271, + "total_acs": 569589, + "total_submitted": 799839, "frontend_question_id": 175, "is_new_question": false }, @@ -49419,8 +49787,8 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 176346, - "total_submitted": 479636, + "total_acs": 177686, + "total_submitted": 482548, "frontend_question_id": 174, "is_new_question": false }, @@ -49442,8 +49810,8 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 589570, - "total_submitted": 869440, + "total_acs": 594442, + "total_submitted": 874738, "frontend_question_id": 173, "is_new_question": false }, @@ -49465,8 +49833,8 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 322971, - "total_submitted": 786614, + "total_acs": 325051, + "total_submitted": 790144, "frontend_question_id": 172, "is_new_question": false }, @@ -49488,8 +49856,8 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 514159, - "total_submitted": 844621, + "total_acs": 517452, + "total_submitted": 849374, "frontend_question_id": 171, "is_new_question": false }, @@ -49511,8 +49879,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 127696, - "total_submitted": 345691, + "total_acs": 128448, + "total_submitted": 347361, "frontend_question_id": 170, "is_new_question": false }, @@ -49534,8 +49902,8 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 1293313, - "total_submitted": 2044202, + "total_acs": 1312782, + "total_submitted": 2072398, "frontend_question_id": 169, "is_new_question": false }, @@ -49557,8 +49925,8 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 322561, - "total_submitted": 942891, + "total_acs": 324961, + "total_submitted": 948336, "frontend_question_id": 168, "is_new_question": false }, @@ -49580,8 +49948,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": 1092924, - "total_submitted": 1831489, + "total_acs": 1111219, + "total_submitted": 1860641, "frontend_question_id": 167, "is_new_question": false }, @@ -49603,8 +49971,8 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 186965, - "total_submitted": 787229, + "total_acs": 187999, + "total_submitted": 790555, "frontend_question_id": 166, "is_new_question": false }, @@ -49626,8 +49994,8 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 321958, - "total_submitted": 924714, + "total_acs": 323743, + "total_submitted": 928148, "frontend_question_id": 165, "is_new_question": false }, @@ -49649,8 +50017,8 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 143248, - "total_submitted": 342977, + "total_acs": 144739, + "total_submitted": 345533, "frontend_question_id": 164, "is_new_question": false }, @@ -49672,8 +50040,8 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 174146, - "total_submitted": 553179, + "total_acs": 175362, + "total_submitted": 556372, "frontend_question_id": 163, "is_new_question": false }, @@ -49695,8 +50063,8 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 820889, - "total_submitted": 1782907, + "total_acs": 830766, + "total_submitted": 1803353, "frontend_question_id": 162, "is_new_question": false }, @@ -49718,8 +50086,8 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 176456, - "total_submitted": 518919, + "total_acs": 177270, + "total_submitted": 520945, "frontend_question_id": 161, "is_new_question": false }, @@ -49741,8 +50109,8 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 1029732, - "total_submitted": 1990063, + "total_acs": 1042314, + "total_submitted": 2007721, "frontend_question_id": 160, "is_new_question": false }, @@ -49764,8 +50132,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": 197966, - "total_submitted": 374177, + "total_acs": 199570, + "total_submitted": 376984, "frontend_question_id": 159, "is_new_question": false }, @@ -49787,8 +50155,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": 168240, - "total_submitted": 409322, + "total_acs": 168753, + "total_submitted": 410162, "frontend_question_id": 158, "is_new_question": false }, @@ -49810,8 +50178,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 171700, - "total_submitted": 424026, + "total_acs": 172158, + "total_submitted": 424796, "frontend_question_id": 157, "is_new_question": false }, @@ -49833,8 +50201,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 90337, - "total_submitted": 148120, + "total_acs": 90995, + "total_submitted": 148913, "frontend_question_id": 156, "is_new_question": false }, @@ -49856,8 +50224,8 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 1026521, - "total_submitted": 2022138, + "total_acs": 1038616, + "total_submitted": 2041549, "frontend_question_id": 155, "is_new_question": false }, @@ -49879,8 +50247,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": 335892, - "total_submitted": 775700, + "total_acs": 338385, + "total_submitted": 781550, "frontend_question_id": 154, "is_new_question": false }, @@ -49902,8 +50270,8 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 981736, - "total_submitted": 2040412, + "total_acs": 997707, + "total_submitted": 2071430, "frontend_question_id": 153, "is_new_question": false }, @@ -49925,8 +50293,8 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 780632, - "total_submitted": 2252261, + "total_acs": 793602, + "total_submitted": 2286991, "frontend_question_id": 152, "is_new_question": false }, @@ -49948,8 +50316,8 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 724936, - "total_submitted": 2493492, + "total_acs": 731415, + "total_submitted": 2504750, "frontend_question_id": 151, "is_new_question": false }, @@ -49971,8 +50339,8 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 444762, - "total_submitted": 1027991, + "total_acs": 454619, + "total_submitted": 1047056, "frontend_question_id": 150, "is_new_question": false }, @@ -49994,8 +50362,8 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 238266, - "total_submitted": 1138943, + "total_acs": 240313, + "total_submitted": 1143606, "frontend_question_id": 149, "is_new_question": false }, @@ -50017,8 +50385,8 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 509228, - "total_submitted": 966876, + "total_acs": 515736, + "total_submitted": 975648, "frontend_question_id": 148, "is_new_question": false }, @@ -50040,8 +50408,8 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 289414, - "total_submitted": 587610, + "total_acs": 290817, + "total_submitted": 589352, "frontend_question_id": 147, "is_new_question": false }, @@ -50063,8 +50431,8 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 1103666, - "total_submitted": 2746182, + "total_acs": 1114690, + "total_submitted": 2769464, "frontend_question_id": 146, "is_new_question": false }, @@ -50086,8 +50454,8 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 753409, - "total_submitted": 1160917, + "total_acs": 764287, + "total_submitted": 1173920, "frontend_question_id": 145, "is_new_question": false }, @@ -50109,8 +50477,8 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 989952, - "total_submitted": 1566483, + "total_acs": 1004231, + "total_submitted": 1584644, "frontend_question_id": 144, "is_new_question": false }, @@ -50132,8 +50500,8 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 510798, - "total_submitted": 1043540, + "total_acs": 519282, + "total_submitted": 1055649, "frontend_question_id": 143, "is_new_question": false }, @@ -50155,8 +50523,8 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 710093, - "total_submitted": 1584278, + "total_acs": 727861, + "total_submitted": 1616818, "frontend_question_id": 142, "is_new_question": false }, @@ -50178,8 +50546,8 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 1530573, - "total_submitted": 3311791, + "total_acs": 1557253, + "total_submitted": 3363383, "frontend_question_id": 141, "is_new_question": false }, @@ -50201,8 +50569,8 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 452581, - "total_submitted": 1057645, + "total_acs": 456531, + "total_submitted": 1062237, "frontend_question_id": 140, "is_new_question": false }, @@ -50224,8 +50592,8 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 1115370, - "total_submitted": 2487989, + "total_acs": 1128288, + "total_submitted": 2512460, "frontend_question_id": 139, "is_new_question": false }, @@ -50247,8 +50615,8 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 814102, - "total_submitted": 1664743, + "total_acs": 821978, + "total_submitted": 1674743, "frontend_question_id": 138, "is_new_question": false }, @@ -50270,8 +50638,8 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 354933, - "total_submitted": 623209, + "total_acs": 357369, + "total_submitted": 626598, "frontend_question_id": 137, "is_new_question": false }, @@ -50293,8 +50661,8 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 1709032, - "total_submitted": 2454689, + "total_acs": 1729171, + "total_submitted": 2481506, "frontend_question_id": 136, "is_new_question": false }, @@ -50316,8 +50684,8 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 219564, - "total_submitted": 586932, + "total_acs": 269191, + "total_submitted": 671303, "frontend_question_id": 135, "is_new_question": false }, @@ -50339,8 +50707,8 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 423663, - "total_submitted": 949819, + "total_acs": 428652, + "total_submitted": 960112, "frontend_question_id": 134, "is_new_question": false }, @@ -50362,8 +50730,8 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 756469, - "total_submitted": 1553576, + "total_acs": 768237, + "total_submitted": 1569650, "frontend_question_id": 133, "is_new_question": false }, @@ -50385,8 +50753,8 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 209613, - "total_submitted": 629206, + "total_acs": 211727, + "total_submitted": 635207, "frontend_question_id": 132, "is_new_question": false }, @@ -50408,8 +50776,8 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 474385, - "total_submitted": 784844, + "total_acs": 481372, + "total_submitted": 793140, "frontend_question_id": 131, "is_new_question": false }, @@ -50431,8 +50799,8 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 429971, - "total_submitted": 1242909, + "total_acs": 435388, + "total_submitted": 1252937, "frontend_question_id": 130, "is_new_question": false }, @@ -50454,8 +50822,8 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 473461, - "total_submitted": 823233, + "total_acs": 477526, + "total_submitted": 828543, "frontend_question_id": 129, "is_new_question": false }, @@ -50477,8 +50845,8 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 725841, - "total_submitted": 1488251, + "total_acs": 806598, + "total_submitted": 1643481, "frontend_question_id": 128, "is_new_question": false }, @@ -50500,8 +50868,8 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 788763, - "total_submitted": 2203758, + "total_acs": 796228, + "total_submitted": 2219011, "frontend_question_id": 127, "is_new_question": false }, @@ -50523,8 +50891,8 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 294515, - "total_submitted": 1083859, + "total_acs": 295289, + "total_submitted": 1089095, "frontend_question_id": 126, "is_new_question": false }, @@ -50546,8 +50914,8 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 1356939, - "total_submitted": 3207791, + "total_acs": 1383421, + "total_submitted": 3259320, "frontend_question_id": 125, "is_new_question": false }, @@ -50569,8 +50937,8 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 764763, - "total_submitted": 2018210, + "total_acs": 775250, + "total_submitted": 2042808, "frontend_question_id": 124, "is_new_question": false }, @@ -50592,8 +50960,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": 394886, - "total_submitted": 905067, + "total_acs": 399507, + "total_submitted": 912701, "frontend_question_id": 123, "is_new_question": false }, @@ -50615,8 +50983,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": 1186143, - "total_submitted": 1900243, + "total_acs": 1198924, + "total_submitted": 1917744, "frontend_question_id": 122, "is_new_question": false }, @@ -50638,8 +51006,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": 2320287, - "total_submitted": 4274808, + "total_acs": 2371133, + "total_submitted": 4365252, "frontend_question_id": 121, "is_new_question": false }, @@ -50661,8 +51029,8 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 488897, - "total_submitted": 924983, + "total_acs": 494447, + "total_submitted": 932974, "frontend_question_id": 120, "is_new_question": false }, @@ -50684,8 +51052,8 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 543674, - "total_submitted": 934288, + "total_acs": 550689, + "total_submitted": 943575, "frontend_question_id": 119, "is_new_question": false }, @@ -50707,8 +51075,8 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 845818, - "total_submitted": 1285265, + "total_acs": 861393, + "total_submitted": 1303468, "frontend_question_id": 118, "is_new_question": false }, @@ -50730,8 +51098,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": 488058, - "total_submitted": 1001081, + "total_acs": 491870, + "total_submitted": 1006667, "frontend_question_id": 117, "is_new_question": false }, @@ -50753,8 +51121,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": 778852, - "total_submitted": 1344625, + "total_acs": 788657, + "total_submitted": 1356831, "frontend_question_id": 116, "is_new_question": false }, @@ -50776,8 +51144,8 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 229343, - "total_submitted": 537060, + "total_acs": 233251, + "total_submitted": 544557, "frontend_question_id": 115, "is_new_question": false }, @@ -50799,8 +51167,8 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 622217, - "total_submitted": 1064333, + "total_acs": 628384, + "total_submitted": 1071938, "frontend_question_id": 114, "is_new_question": false }, @@ -50822,8 +51190,8 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 596569, - "total_submitted": 1094244, + "total_acs": 602469, + "total_submitted": 1102421, "frontend_question_id": 113, "is_new_question": false }, @@ -50845,8 +51213,8 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 912646, - "total_submitted": 1986137, + "total_acs": 923504, + "total_submitted": 2005653, "frontend_question_id": 112, "is_new_question": false }, @@ -50868,8 +51236,8 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 780210, - "total_submitted": 1820941, + "total_acs": 788258, + "total_submitted": 1836407, "frontend_question_id": 111, "is_new_question": false }, @@ -50891,8 +51259,8 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 813886, - "total_submitted": 1723366, + "total_acs": 829943, + "total_submitted": 1752900, "frontend_question_id": 110, "is_new_question": false }, @@ -50914,8 +51282,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": 381355, - "total_submitted": 679780, + "total_acs": 383982, + "total_submitted": 682840, "frontend_question_id": 109, "is_new_question": false }, @@ -50937,8 +51305,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": 763812, - "total_submitted": 1145859, + "total_acs": 772770, + "total_submitted": 1156692, "frontend_question_id": 108, "is_new_question": false }, @@ -50960,8 +51328,8 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 511614, - "total_submitted": 864292, + "total_acs": 515396, + "total_submitted": 868808, "frontend_question_id": 107, "is_new_question": false }, @@ -50983,8 +51351,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": 409949, - "total_submitted": 732159, + "total_acs": 414153, + "total_submitted": 737378, "frontend_question_id": 106, "is_new_question": false }, @@ -51006,8 +51374,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": 738533, - "total_submitted": 1265505, + "total_acs": 749280, + "total_submitted": 1280026, "frontend_question_id": 105, "is_new_question": false }, @@ -51029,8 +51397,8 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 1757314, - "total_submitted": 2431532, + "total_acs": 1784734, + "total_submitted": 2465838, "frontend_question_id": 104, "is_new_question": false }, @@ -51052,8 +51420,8 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 741043, - "total_submitted": 1369946, + "total_acs": 750653, + "total_submitted": 1384355, "frontend_question_id": 103, "is_new_question": false }, @@ -51075,8 +51443,8 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 1306139, - "total_submitted": 2124916, + "total_acs": 1331480, + "total_submitted": 2160328, "frontend_question_id": 102, "is_new_question": false }, @@ -51098,8 +51466,8 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 1285130, - "total_submitted": 2470714, + "total_acs": 1300541, + "total_submitted": 2495639, "frontend_question_id": 101, "is_new_question": false }, @@ -51121,8 +51489,8 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 1096647, - "total_submitted": 1966041, + "total_acs": 1114633, + "total_submitted": 1995633, "frontend_question_id": 100, "is_new_question": false }, @@ -51144,8 +51512,8 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 336394, - "total_submitted": 684059, + "total_acs": 340061, + "total_submitted": 689601, "frontend_question_id": 99, "is_new_question": false }, @@ -51167,8 +51535,8 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 1467566, - "total_submitted": 4767853, + "total_acs": 1491257, + "total_submitted": 4833358, "frontend_question_id": 98, "is_new_question": false }, @@ -51190,8 +51558,8 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 273428, - "total_submitted": 780376, + "total_acs": 326597, + "total_submitted": 890049, "frontend_question_id": 97, "is_new_question": false }, @@ -51213,8 +51581,8 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 495627, - "total_submitted": 845668, + "total_acs": 499843, + "total_submitted": 851582, "frontend_question_id": 96, "is_new_question": false }, @@ -51236,8 +51604,8 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 314113, - "total_submitted": 626417, + "total_acs": 316482, + "total_submitted": 629072, "frontend_question_id": 95, "is_new_question": false }, @@ -51259,8 +51627,8 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1534802, - "total_submitted": 2152309, + "total_acs": 1556175, + "total_submitted": 2177875, "frontend_question_id": 94, "is_new_question": false }, @@ -51282,8 +51650,8 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 306562, - "total_submitted": 723727, + "total_acs": 308787, + "total_submitted": 726796, "frontend_question_id": 93, "is_new_question": false }, @@ -51305,8 +51673,8 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 496304, - "total_submitted": 1136012, + "total_acs": 500859, + "total_submitted": 1144860, "frontend_question_id": 92, "is_new_question": false }, @@ -51328,8 +51696,8 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 808139, - "total_submitted": 2637003, + "total_acs": 817234, + "total_submitted": 2657754, "frontend_question_id": 91, "is_new_question": false }, @@ -51351,8 +51719,8 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 533850, - "total_submitted": 989246, + "total_acs": 543674, + "total_submitted": 1004320, "frontend_question_id": 90, "is_new_question": false }, @@ -51374,8 +51742,8 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 237224, - "total_submitted": 426217, + "total_acs": 238461, + "total_submitted": 427711, "frontend_question_id": 89, "is_new_question": false }, @@ -51397,8 +51765,8 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 1521100, - "total_submitted": 3384427, + "total_acs": 1543948, + "total_submitted": 3428452, "frontend_question_id": 88, "is_new_question": false }, @@ -51420,8 +51788,8 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 148030, - "total_submitted": 413897, + "total_acs": 149142, + "total_submitted": 416426, "frontend_question_id": 87, "is_new_question": false }, @@ -51443,8 +51811,8 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 349934, - "total_submitted": 723772, + "total_acs": 352831, + "total_submitted": 727893, "frontend_question_id": 86, "is_new_question": false }, @@ -51466,8 +51834,8 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 302730, - "total_submitted": 700978, + "total_acs": 305205, + "total_submitted": 704866, "frontend_question_id": 85, "is_new_question": false }, @@ -51489,8 +51857,8 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 531141, - "total_submitted": 1288908, + "total_acs": 539059, + "total_submitted": 1304230, "frontend_question_id": 84, "is_new_question": false }, @@ -51512,8 +51880,8 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 902679, - "total_submitted": 1830362, + "total_acs": 915079, + "total_submitted": 1852703, "frontend_question_id": 83, "is_new_question": false }, @@ -51535,8 +51903,8 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 507132, - "total_submitted": 1133958, + "total_acs": 512183, + "total_submitted": 1143080, "frontend_question_id": 82, "is_new_question": false }, @@ -51558,8 +51926,8 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 437581, - "total_submitted": 1227442, + "total_acs": 441228, + "total_submitted": 1236970, "frontend_question_id": 81, "is_new_question": false }, @@ -51581,8 +51949,8 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 441662, - "total_submitted": 868769, + "total_acs": 444304, + "total_submitted": 872720, "frontend_question_id": 80, "is_new_question": false }, @@ -51604,8 +51972,8 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 1007697, - "total_submitted": 2528797, + "total_acs": 1020563, + "total_submitted": 2558497, "frontend_question_id": 79, "is_new_question": false }, @@ -51627,8 +51995,8 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 1139221, - "total_submitted": 1577823, + "total_acs": 1155065, + "total_submitted": 1595393, "frontend_question_id": 78, "is_new_question": false }, @@ -51650,8 +52018,8 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 546547, - "total_submitted": 844712, + "total_acs": 553101, + "total_submitted": 852652, "frontend_question_id": 77, "is_new_question": false }, @@ -51673,8 +52041,8 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 786975, - "total_submitted": 2001032, + "total_acs": 797326, + "total_submitted": 2022577, "frontend_question_id": 76, "is_new_question": false }, @@ -51696,8 +52064,8 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 1066989, - "total_submitted": 1919138, + "total_acs": 1084775, + "total_submitted": 1944684, "frontend_question_id": 75, "is_new_question": false }, @@ -51719,8 +52087,8 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 851488, - "total_submitted": 1880981, + "total_acs": 870477, + "total_submitted": 1914471, "frontend_question_id": 74, "is_new_question": false }, @@ -51742,8 +52110,8 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 738265, - "total_submitted": 1510422, + "total_acs": 751879, + "total_submitted": 1534149, "frontend_question_id": 73, "is_new_question": false }, @@ -51765,8 +52133,8 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 490582, - "total_submitted": 953986, + "total_acs": 497397, + "total_submitted": 964042, "frontend_question_id": 72, "is_new_question": false }, @@ -51788,8 +52156,8 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 440061, - "total_submitted": 1129073, + "total_acs": 443175, + "total_submitted": 1136282, "frontend_question_id": 71, "is_new_question": false }, @@ -51811,8 +52179,8 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 1652451, - "total_submitted": 3220674, + "total_acs": 1687701, + "total_submitted": 3284031, "frontend_question_id": 70, "is_new_question": false }, @@ -51834,8 +52202,8 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 1095031, - "total_submitted": 2986270, + "total_acs": 1109993, + "total_submitted": 3023458, "frontend_question_id": 69, "is_new_question": false }, @@ -51857,8 +52225,8 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 255336, - "total_submitted": 714825, + "total_acs": 257663, + "total_submitted": 718926, "frontend_question_id": 68, "is_new_question": false }, @@ -51880,8 +52248,8 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 866532, - "total_submitted": 1707316, + "total_acs": 875694, + "total_submitted": 1723297, "frontend_question_id": 67, "is_new_question": false }, @@ -51903,8 +52271,8 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 1250225, - "total_submitted": 2904102, + "total_acs": 1268383, + "total_submitted": 2942624, "frontend_question_id": 66, "is_new_question": false }, @@ -51926,8 +52294,8 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 278562, - "total_submitted": 1519018, + "total_acs": 280038, + "total_submitted": 1524721, "frontend_question_id": 65, "is_new_question": false }, @@ -51949,8 +52317,8 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 731690, - "total_submitted": 1224169, + "total_acs": 739824, + "total_submitted": 1235627, "frontend_question_id": 64, "is_new_question": false }, @@ -51972,8 +52340,8 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 562442, - "total_submitted": 1456427, + "total_acs": 568444, + "total_submitted": 1469906, "frontend_question_id": 63, "is_new_question": false }, @@ -51995,8 +52363,8 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 988333, - "total_submitted": 1633352, + "total_acs": 1007689, + "total_submitted": 1660891, "frontend_question_id": 62, "is_new_question": false }, @@ -52018,8 +52386,8 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 582197, - "total_submitted": 1654538, + "total_acs": 589999, + "total_submitted": 1673455, "frontend_question_id": 61, "is_new_question": false }, @@ -52041,8 +52409,8 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 279322, - "total_submitted": 654876, + "total_acs": 282230, + "total_submitted": 659792, "frontend_question_id": 60, "is_new_question": false }, @@ -52064,8 +52432,8 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 372255, - "total_submitted": 569214, + "total_acs": 376043, + "total_submitted": 573678, "frontend_question_id": 59, "is_new_question": false }, @@ -52087,8 +52455,8 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 776121, - "total_submitted": 2017791, + "total_acs": 788198, + "total_submitted": 2038892, "frontend_question_id": 58, "is_new_question": false }, @@ -52110,8 +52478,8 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 534952, - "total_submitted": 1422669, + "total_acs": 544099, + "total_submitted": 1445482, "frontend_question_id": 57, "is_new_question": false }, @@ -52133,8 +52501,8 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 1502233, - "total_submitted": 3320611, + "total_acs": 1522769, + "total_submitted": 3360683, "frontend_question_id": 56, "is_new_question": false }, @@ -52156,8 +52524,8 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 1050824, - "total_submitted": 2761554, + "total_acs": 1067860, + "total_submitted": 2801657, "frontend_question_id": 55, "is_new_question": false }, @@ -52179,8 +52547,8 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 767981, - "total_submitted": 1825245, + "total_acs": 781635, + "total_submitted": 1848295, "frontend_question_id": 54, "is_new_question": false }, @@ -52202,8 +52570,8 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 2479191, - "total_submitted": 4995033, + "total_acs": 2516171, + "total_submitted": 5063475, "frontend_question_id": 53, "is_new_question": false }, @@ -52225,8 +52593,8 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 267071, - "total_submitted": 382125, + "total_acs": 269289, + "total_submitted": 384640, "frontend_question_id": 52, "is_new_question": false }, @@ -52248,8 +52616,8 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 428242, - "total_submitted": 704085, + "total_acs": 434856, + "total_submitted": 711812, "frontend_question_id": 51, "is_new_question": false }, @@ -52271,8 +52639,8 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 949682, - "total_submitted": 2919587, + "total_acs": 962189, + "total_submitted": 2954768, "frontend_question_id": 50, "is_new_question": false }, @@ -52294,8 +52662,8 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 1427128, - "total_submitted": 2204167, + "total_acs": 1451074, + "total_submitted": 2236378, "frontend_question_id": 49, "is_new_question": false }, @@ -52317,8 +52685,8 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 937099, - "total_submitted": 1389191, + "total_acs": 952375, + "total_submitted": 1407680, "frontend_question_id": 48, "is_new_question": false }, @@ -52340,8 +52708,8 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 667943, - "total_submitted": 1197983, + "total_acs": 674391, + "total_submitted": 1207193, "frontend_question_id": 47, "is_new_question": false }, @@ -52363,8 +52731,8 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 1226817, - "total_submitted": 1678313, + "total_acs": 1245351, + "total_submitted": 1699070, "frontend_question_id": 46, "is_new_question": false }, @@ -52386,8 +52754,8 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 634661, - "total_submitted": 1686185, + "total_acs": 646047, + "total_submitted": 1710166, "frontend_question_id": 45, "is_new_question": false }, @@ -52409,8 +52777,8 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 397897, - "total_submitted": 1492822, + "total_acs": 401927, + "total_submitted": 1506957, "frontend_question_id": 44, "is_new_question": false }, @@ -52432,8 +52800,8 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 530964, - "total_submitted": 1395631, + "total_acs": 537830, + "total_submitted": 1410060, "frontend_question_id": 43, "is_new_question": false }, @@ -52455,8 +52823,8 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 1176571, - "total_submitted": 2059690, + "total_acs": 1193638, + "total_submitted": 2084562, "frontend_question_id": 42, "is_new_question": false }, @@ -52478,8 +52846,8 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 706469, - "total_submitted": 1952764, + "total_acs": 715251, + "total_submitted": 1974020, "frontend_question_id": 41, "is_new_question": false }, @@ -52501,8 +52869,8 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 584114, - "total_submitted": 1108751, + "total_acs": 593051, + "total_submitted": 1123999, "frontend_question_id": 40, "is_new_question": false }, @@ -52524,8 +52892,8 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 1141359, - "total_submitted": 1723427, + "total_acs": 1158674, + "total_submitted": 1745334, "frontend_question_id": 39, "is_new_question": false }, @@ -52547,8 +52915,8 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 639846, - "total_submitted": 1304473, + "total_acs": 644812, + "total_submitted": 1312095, "frontend_question_id": 38, "is_new_question": false }, @@ -52570,8 +52938,8 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 366259, - "total_submitted": 666964, + "total_acs": 371400, + "total_submitted": 673440, "frontend_question_id": 37, "is_new_question": false }, @@ -52593,8 +52961,8 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 778534, - "total_submitted": 1398996, + "total_acs": 792075, + "total_submitted": 1419621, "frontend_question_id": 36, "is_new_question": false }, @@ -52616,8 +52984,8 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 1530501, - "total_submitted": 3622046, + "total_acs": 1556135, + "total_submitted": 3684647, "frontend_question_id": 35, "is_new_question": false }, @@ -52639,8 +53007,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": 1148904, - "total_submitted": 2846338, + "total_acs": 1164321, + "total_submitted": 2879997, "frontend_question_id": 34, "is_new_question": false }, @@ -52662,8 +53030,8 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 1556625, - "total_submitted": 4089101, + "total_acs": 1581294, + "total_submitted": 4146311, "frontend_question_id": 33, "is_new_question": false }, @@ -52685,8 +53053,8 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 532012, - "total_submitted": 1643475, + "total_acs": 536311, + "total_submitted": 1654830, "frontend_question_id": 32, "is_new_question": false }, @@ -52708,8 +53076,8 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 844498, - "total_submitted": 2305696, + "total_acs": 854981, + "total_submitted": 2331359, "frontend_question_id": 31, "is_new_question": false }, @@ -52731,8 +53099,8 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 262207, - "total_submitted": 923966, + "total_acs": 264347, + "total_submitted": 929694, "frontend_question_id": 30, "is_new_question": false }, @@ -52754,8 +53122,8 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 514764, - "total_submitted": 2942840, + "total_acs": 518236, + "total_submitted": 2964992, "frontend_question_id": 29, "is_new_question": false }, @@ -52777,8 +53145,8 @@ "question__title": "Implement strStr()", "question__title_slug": "implement-strstr", "question__hide": false, - "total_acs": 1302555, - "total_submitted": 3576002, + "total_acs": 1319796, + "total_submitted": 3610119, "frontend_question_id": 28, "is_new_question": false }, @@ -52800,8 +53168,8 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 1338723, - "total_submitted": 2599278, + "total_acs": 1356881, + "total_submitted": 2631164, "frontend_question_id": 27, "is_new_question": false }, @@ -52823,8 +53191,8 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 2230258, - "total_submitted": 4518244, + "total_acs": 2259490, + "total_submitted": 4567550, "frontend_question_id": 26, "is_new_question": false }, @@ -52846,8 +53214,8 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 539481, - "total_submitted": 1040441, + "total_acs": 547617, + "total_submitted": 1052301, "frontend_question_id": 25, "is_new_question": false }, @@ -52869,8 +53237,8 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 900875, - "total_submitted": 1520255, + "total_acs": 910671, + "total_submitted": 1533531, "frontend_question_id": 24, "is_new_question": false }, @@ -52892,8 +53260,8 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 1311209, - "total_submitted": 2761233, + "total_acs": 1326287, + "total_submitted": 2786596, "frontend_question_id": 23, "is_new_question": false }, @@ -52915,8 +53283,8 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 1107034, - "total_submitted": 1566451, + "total_acs": 1121728, + "total_submitted": 1584190, "frontend_question_id": 22, "is_new_question": false }, @@ -52938,8 +53306,8 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 2322184, - "total_submitted": 3818653, + "total_acs": 2367833, + "total_submitted": 3884799, "frontend_question_id": 21, "is_new_question": false }, @@ -52961,8 +53329,8 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 2371323, - "total_submitted": 5804145, + "total_acs": 2411188, + "total_submitted": 5902968, "frontend_question_id": 20, "is_new_question": false }, @@ -52984,8 +53352,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": 1471027, - "total_submitted": 3803963, + "total_acs": 1497175, + "total_submitted": 3862609, "frontend_question_id": 19, "is_new_question": false }, @@ -53007,8 +53375,8 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 606468, - "total_submitted": 1625086, + "total_acs": 613141, + "total_submitted": 1648869, "frontend_question_id": 18, "is_new_question": false }, @@ -53030,8 +53398,8 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 1260560, - "total_submitted": 2307628, + "total_acs": 1274725, + "total_submitted": 2329019, "frontend_question_id": 17, "is_new_question": false }, @@ -53053,8 +53421,8 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 826349, - "total_submitted": 1762830, + "total_acs": 834533, + "total_submitted": 1787701, "frontend_question_id": 16, "is_new_question": false }, @@ -53076,8 +53444,8 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 2048032, - "total_submitted": 6511640, + "total_acs": 2078822, + "total_submitted": 6589524, "frontend_question_id": 15, "is_new_question": false }, @@ -53099,8 +53467,8 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 1670842, - "total_submitted": 4194076, + "total_acs": 1700184, + "total_submitted": 4254728, "frontend_question_id": 14, "is_new_question": false }, @@ -53122,8 +53490,8 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 1711926, - "total_submitted": 2957281, + "total_acs": 1751103, + "total_submitted": 3025314, "frontend_question_id": 13, "is_new_question": false }, @@ -53145,8 +53513,8 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 728842, - "total_submitted": 1218374, + "total_acs": 739012, + "total_submitted": 1233865, "frontend_question_id": 12, "is_new_question": false }, @@ -53168,8 +53536,8 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 1572994, - "total_submitted": 2909555, + "total_acs": 1598743, + "total_submitted": 2955575, "frontend_question_id": 11, "is_new_question": false }, @@ -53191,8 +53559,8 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 700411, - "total_submitted": 2476697, + "total_acs": 706225, + "total_submitted": 2497475, "frontend_question_id": 10, "is_new_question": false }, @@ -53214,8 +53582,8 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 2202022, - "total_submitted": 4189233, + "total_acs": 2238870, + "total_submitted": 4256813, "frontend_question_id": 9, "is_new_question": false }, @@ -53237,8 +53605,8 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 1037031, - "total_submitted": 6261821, + "total_acs": 1047189, + "total_submitted": 6318739, "frontend_question_id": 8, "is_new_question": false }, @@ -53260,8 +53628,8 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 2118266, - "total_submitted": 7888856, + "total_acs": 2136848, + "total_submitted": 7946487, "frontend_question_id": 7, "is_new_question": false }, @@ -53283,8 +53651,8 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 789500, - "total_submitted": 1879603, + "total_acs": 797699, + "total_submitted": 1894360, "frontend_question_id": 6, "is_new_question": false }, @@ -53306,8 +53674,8 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1945538, - "total_submitted": 6041710, + "total_acs": 1968824, + "total_submitted": 6108804, "frontend_question_id": 5, "is_new_question": false }, @@ -53329,8 +53697,8 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 1446766, - "total_submitted": 4201728, + "total_acs": 1467758, + "total_submitted": 4252294, "frontend_question_id": 4, "is_new_question": false }, @@ -53352,8 +53720,8 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 3494676, - "total_submitted": 10444065, + "total_acs": 3543736, + "total_submitted": 10578361, "frontend_question_id": 3, "is_new_question": false }, @@ -53375,8 +53743,8 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 2873583, - "total_submitted": 7376239, + "total_acs": 2908331, + "total_submitted": 7448059, "frontend_question_id": 2, "is_new_question": false }, @@ -53398,8 +53766,8 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 7001872, - "total_submitted": 14356547, + "total_acs": 7116861, + "total_submitted": 14577735, "frontend_question_id": 1, "is_new_question": false }, diff --git a/leetcode/originData/[no content]find-minimum-time-to-finish-all-jobs-ii.json b/leetcode/originData/[no content]find-minimum-time-to-finish-all-jobs-ii.json new file mode 100644 index 00000000..a04082ef --- /dev/null +++ b/leetcode/originData/[no content]find-minimum-time-to-finish-all-jobs-ii.json @@ -0,0 +1,65 @@ +{ + "data": { + "question": { + "questionId": "2458", + "questionFrontendId": "2323", + "boundTopicId": null, + "title": "Find Minimum Time to Finish All Jobs II", + "titleSlug": "find-minimum-time-to-finish-all-jobs-ii", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 11, + "dislikes": 4, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Task Scheduler\", \"titleSlug\": \"task-scheduler\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find Minimum Time to Finish All Jobs\", \"titleSlug\": \"find-minimum-time-to-finish-all-jobs\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Work Sessions to Finish the Tasks\", \"titleSlug\": \"minimum-number-of-work-sessions-to-finish-the-tasks\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[5,2,4]\n[1,7,5]\n[3,18,15,9]\n[6,5,1,3]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"565\", \"totalSubmission\": \"726\", \"totalAcceptedRaw\": 565, \"totalSubmissionRaw\": 726, \"acRate\": \"77.8%\"}", + "hints": [ + "It is always optimal to pair the worker with the least amount of time with the job that requires the least amount of time.", + "Sort both arrays." + ], + "solution": null, + "status": null, + "sampleTestCase": "[5,2,4]\n[1,7,5]", + "metaData": "{\n \"name\": \"minimumTime\",\n \"params\": [\n {\n \"name\": \"jobs\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"workers\"\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]product-sales-analysis-iv.json b/leetcode/originData/[no content]product-sales-analysis-iv.json new file mode 100644 index 00000000..0d1b051b --- /dev/null +++ b/leetcode/originData/[no content]product-sales-analysis-iv.json @@ -0,0 +1,64 @@ +{ + "data": { + "question": { + "questionId": "2451", + "questionFrontendId": "2324", + "boundTopicId": null, + "title": "Product Sales Analysis IV", + "titleSlug": "product-sales-analysis-iv", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 3, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Product Sales Analysis I\", \"titleSlug\": \"product-sales-analysis-i\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Product Sales Analysis II\", \"titleSlug\": \"product-sales-analysis-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Product Sales Analysis III\", \"titleSlug\": \"product-sales-analysis-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": null, + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"439\", \"totalSubmission\": \"501\", \"totalAcceptedRaw\": 439, \"totalSubmissionRaw\": 501, \"acRate\": \"87.6%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\": {\"Sales\": [\"sale_id\", \"product_id\", \"user_id\", \"quantity\"], \"Product\": [\"product_id\", \"price\"]}, \"rows\": {\"Sales\": [[1, 1, 101, 10], [2, 3, 101, 7], [3, 1, 102, 9], [4, 2, 102, 6], [5, 3, 102, 10], [6, 1, 102, 6]], \"Product\": [[1, 10], [2, 25], [3, 15]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table If Not Exists Product (product_id int, price int)\"\n ],\n \"mssql\": [\n \"Create table Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table Product (product_id int, price int)\"\n ],\n \"oraclesql\": [\n \"Create table Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table Product (product_id int, price int)\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Sales (sale_id int, product_id int, user_id int, quantity int)", + "Create table If Not Exists Product (product_id int, price int)", + "Truncate table Sales", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('1', '1', '101', '10')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('2', '3', '101', '7')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('3', '1', '102', '9')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('4', '2', '102', '6')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('5', '3', '102', '10')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('6', '1', '102', '6')", + "Truncate table Product", + "insert into Product (product_id, price) values ('1', '10')", + "insert into Product (product_id, price) values ('2', '25')", + "insert into Product (product_id, price) values ('3', '15')" + ], + "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/[no content]product-sales-analysis-v.json b/leetcode/originData/[no content]product-sales-analysis-v.json new file mode 100644 index 00000000..ebdbbbf5 --- /dev/null +++ b/leetcode/originData/[no content]product-sales-analysis-v.json @@ -0,0 +1,56 @@ +{ + "data": { + "question": { + "questionId": "2452", + "questionFrontendId": "2329", + "boundTopicId": null, + "title": "Product Sales Analysis V", + "titleSlug": "product-sales-analysis-v", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 5, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Product Sales Analysis I\", \"titleSlug\": \"product-sales-analysis-i\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Product Sales Analysis II\", \"titleSlug\": \"product-sales-analysis-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Product Sales Analysis III\", \"titleSlug\": \"product-sales-analysis-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "{\"headers\": {\"Sales\": [\"sale_id\", \"product_id\", \"user_id\", \"quantity\"], \"Product\": [\"product_id\", \"price\"]}, \"rows\": {\"Sales\": [[1, 1, 101, 10], [2, 2, 101, 1], [3, 3, 102, 3], [4, 3, 102, 2], [5, 2, 103, 3]], \"Product\": [[1, 10], [2, 25], [3, 15]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"337\", \"totalSubmission\": \"408\", \"totalAcceptedRaw\": 337, \"totalSubmissionRaw\": 408, \"acRate\": \"82.6%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\": {\"Sales\": [\"sale_id\", \"product_id\", \"user_id\", \"quantity\"], \"Product\": [\"product_id\", \"price\"]}, \"rows\": {\"Sales\": [[1, 1, 101, 10], [2, 2, 101, 1], [3, 3, 102, 3], [4, 3, 102, 2], [5, 2, 103, 3]], \"Product\": [[1, 10], [2, 25], [3, 15]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table If Not Exists Product (product_id int, price int)\"\n ],\n \"mssql\": [\n \"Create table Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table Product (product_id int, price int)\"\n ],\n \"oraclesql\": [\n \"Create table Sales (sale_id int, product_id int, user_id int, quantity int)\",\n \"Create table Product (product_id int, price int)\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Sales (sale_id int, product_id int, user_id int, quantity int)", + "Create table If Not Exists Product (product_id int, price int)", + "Truncate table Sales", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('1', '1', '101', '10')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('2', '2', '101', '1')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('3', '3', '102', '3')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('4', '3', '102', '2')", + "insert into Sales (sale_id, product_id, user_id, quantity) values ('5', '2', '103', '3')", + "Truncate table Product", + "insert into Product (product_id, price) values ('1', '10')", + "insert into Product (product_id, price) values ('2', '25')", + "insert into Product (product_id, price) values ('3', '15')" + ], + "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/[no content]valid-palindrome-iv.json b/leetcode/originData/[no content]valid-palindrome-iv.json new file mode 100644 index 00000000..a11a0bfc --- /dev/null +++ b/leetcode/originData/[no content]valid-palindrome-iv.json @@ -0,0 +1,46 @@ +{ + "data": { + "question": { + "questionId": "2468", + "questionFrontendId": "2330", + "boundTopicId": null, + "title": "Valid Palindrome IV", + "titleSlug": "valid-palindrome-iv", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 14, + "dislikes": 5, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Valid Palindrome\", \"titleSlug\": \"valid-palindrome\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Valid Palindrome II\", \"titleSlug\": \"valid-palindrome-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Valid Palindrome III\", \"titleSlug\": \"valid-palindrome-iii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "\"abcdba\"\n\"aa\"\n\"abcdef\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"460\", \"totalSubmission\": \"583\", \"totalAcceptedRaw\": 460, \"totalSubmissionRaw\": 583, \"acRate\": \"78.9%\"}", + "hints": [ + "Count the number of pairs of characters that should be equal if s were a palindrome, but are not equal.", + "If the number of pairs is 0, then s is already palindrome. You can pick any pair of characters and change them both to a different character and s will stay a palindrome." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"abcdba\"", + "metaData": "{\n \"name\": \"makePalindrome\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "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/array-partition.json b/leetcode/originData/array-partition.json new file mode 100644 index 00000000..5f6ea3b6 --- /dev/null +++ b/leetcode/originData/array-partition.json @@ -0,0 +1,189 @@ +{ + "data": { + "question": { + "questionId": "561", + "questionFrontendId": "561", + "boundTopicId": null, + "title": "Array Partition", + "titleSlug": "array-partition", + "content": "

Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,4,3,2]\nOutput: 4\nExplanation: All possible pairings (ignoring the ordering of elements) are:\n1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3\n2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3\n3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4\nSo the maximum possible sum is 4.
\n\n

Example 2:

\n\n
\nInput: nums = [6,2,6,5,1,2]\nOutput: 9\nExplanation: The optimal pairing is (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 104
  • \n\t
  • nums.length == 2 * n
  • \n\t
  • -104 <= nums[i] <= 104
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 943, + "dislikes": 155, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Minimum Difference Between Highest and Lowest of K Scores\", \"titleSlug\": \"minimum-difference-between-highest-and-lowest-of-k-scores\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Cost of Buying Candies With Discount\", \"titleSlug\": \"minimum-cost-of-buying-candies-with-discount\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"All Divisions With the Highest Score of a Binary Array\", \"titleSlug\": \"all-divisions-with-the-highest-score-of-a-binary-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,4,3,2]\n[6,2,6,5,1,2]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Sorting", + "slug": "sorting", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Counting Sort", + "slug": "counting-sort", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int arrayPairSum(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int arrayPairSum(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def arrayPairSum(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def arrayPairSum(self, nums: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint arrayPairSum(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int ArrayPairSum(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar arrayPairSum = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef array_pair_sum(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func arrayPairSum(_ nums: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func arrayPairSum(nums []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def arrayPairSum(nums: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun arrayPairSum(nums: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn array_pair_sum(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 arrayPairSum($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function arrayPairSum(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (array-pair-sum nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec array_pair_sum(Nums :: [integer()]) -> integer().\narray_pair_sum(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec array_pair_sum(nums :: [integer]) :: integer\n def array_pair_sum(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"339.4K\", \"totalSubmission\": \"446.5K\", \"totalAcceptedRaw\": 339399, \"totalSubmissionRaw\": 446478, \"acRate\": \"76.0%\"}", + "hints": [ + "Obviously, brute force won't help here. Think of something else, take some example like 1,2,3,4.", + "How will you make pairs to get the result? There must be some pattern.", + "Did you observe that- Minimum element gets add into the result in sacrifice of maximum element.", + "Still won't able to find pairs? Sort the array and try to find the pattern." + ], + "solution": { + "id": "1449", + "canSeeDetail": true, + "paidOnly": false, + "hasVideoSolution": false, + "paidOnlyVideo": true, + "__typename": "ArticleNode" + }, + "status": null, + "sampleTestCase": "[1,4,3,2]", + "metaData": "{\r\n \"name\": \"arrayPairSum\",\r\n \"params\": [\r\n {\r\n \"name\": \"nums\",\r\n \"type\": \"integer[]\"\r\n }\r\n ],\r\n \"return\": {\r\n \"type\": \"integer\"\r\n }\r\n}\r\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-the-number-of-ideal-arrays.json b/leetcode/originData/count-the-number-of-ideal-arrays.json new file mode 100644 index 00000000..69b803fa --- /dev/null +++ b/leetcode/originData/count-the-number-of-ideal-arrays.json @@ -0,0 +1,156 @@ +{ + "data": { + "question": { + "questionId": "2415", + "questionFrontendId": "2338", + "boundTopicId": null, + "title": "Count the Number of Ideal Arrays", + "titleSlug": "count-the-number-of-ideal-arrays", + "content": "

You are given two integers n and maxValue, which are used to describe an ideal array.

\n\n

A 0-indexed integer array arr of length n is considered ideal if the following conditions hold:

\n\n
    \n\t
  • Every arr[i] is a value from 1 to maxValue, for 0 <= i < n.
  • \n\t
  • Every arr[i] is divisible by arr[i - 1], for 0 < i < n.
  • \n
\n\n

Return the number of distinct ideal arrays of length n. Since the answer may be very large, return it modulo 109 + 7.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 2, maxValue = 5\nOutput: 10\nExplanation: The following are the possible ideal arrays:\n- Arrays starting with the value 1 (5 arrays): [1,1], [1,2], [1,3], [1,4], [1,5]\n- Arrays starting with the value 2 (2 arrays): [2,2], [2,4]\n- Arrays starting with the value 3 (1 array): [3,3]\n- Arrays starting with the value 4 (1 array): [4,4]\n- Arrays starting with the value 5 (1 array): [5,5]\nThere are a total of 5 + 2 + 1 + 1 + 1 = 10 distinct ideal arrays.\n
\n\n

Example 2:

\n\n
\nInput: n = 5, maxValue = 3\nOutput: 11\nExplanation: The following are the possible ideal arrays:\n- Arrays starting with the value 1 (9 arrays): \n   - With no other distinct values (1 array): [1,1,1,1,1] \n   - With 2nd distinct value 2 (4 arrays): [1,1,1,1,2], [1,1,1,2,2], [1,1,2,2,2], [1,2,2,2,2]\n   - With 2nd distinct value 3 (4 arrays): [1,1,1,1,3], [1,1,1,3,3], [1,1,3,3,3], [1,3,3,3,3]\n- Arrays starting with the value 2 (1 array): [2,2,2,2,2]\n- Arrays starting with the value 3 (1 array): [3,3,3,3,3]\nThere are a total of 9 + 1 + 1 = 11 distinct ideal arrays.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 2 <= n <= 104
  • \n\t
  • 1 <= maxValue <= 104
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 149, + "dislikes": 12, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Count Ways to Make Array With Product\", \"titleSlug\": \"count-ways-to-make-array-with-product\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "2\n5\n5\n3", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int idealArrays(int n, int maxValue) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int idealArrays(int n, int maxValue) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def idealArrays(self, n, maxValue):\n \"\"\"\n :type n: int\n :type maxValue: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def idealArrays(self, n: int, maxValue: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint idealArrays(int n, int maxValue){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int IdealArrays(int n, int maxValue) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} maxValue\n * @return {number}\n */\nvar idealArrays = function(n, maxValue) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} max_value\n# @return {Integer}\ndef ideal_arrays(n, max_value)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func idealArrays(_ n: Int, _ maxValue: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func idealArrays(n int, maxValue int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def idealArrays(n: Int, maxValue: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun idealArrays(n: Int, maxValue: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn ideal_arrays(n: i32, max_value: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $maxValue\n * @return Integer\n */\n function idealArrays($n, $maxValue) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function idealArrays(n: number, maxValue: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (ideal-arrays n maxValue)\n (-> exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec ideal_arrays(N :: integer(), MaxValue :: integer()) -> integer().\nideal_arrays(N, MaxValue) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec ideal_arrays(n :: integer, max_value :: integer) :: integer\n def ideal_arrays(n, max_value) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"9.5K\", \"totalAcceptedRaw\": 1835, \"totalSubmissionRaw\": 9478, \"acRate\": \"19.4%\"}", + "hints": [ + "Notice that an ideal array is non-decreasing.", + "Consider an alternative problem: where an ideal array must also be strictly increasing. Can you use DP to solve it?", + "Will combinatorics help to get an answer from the alternative problem to the actual problem?" + ], + "solution": null, + "status": null, + "sampleTestCase": "2\n5", + "metaData": "{\n \"name\": \"idealArrays\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"maxValue\"\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/decode-the-message.json b/leetcode/originData/decode-the-message.json new file mode 100644 index 00000000..8829371e --- /dev/null +++ b/leetcode/originData/decode-the-message.json @@ -0,0 +1,169 @@ +{ + "data": { + "question": { + "questionId": "2406", + "questionFrontendId": "2325", + "boundTopicId": null, + "title": "Decode the Message", + "titleSlug": "decode-the-message", + "content": "

You are given the strings key and message, which represent a cipher key and a secret message, respectively. The steps to decode message are as follows:

\n\n
    \n\t
  1. Use the first appearance of all 26 lowercase English letters in key as the order of the substitution table.
  2. \n\t
  3. Align the substitution table with the regular English alphabet.
  4. \n\t
  5. Each letter in message is then substituted using the table.
  6. \n\t
  7. Spaces ' ' are transformed to themselves.
  8. \n
\n\n
    \n\t
  • For example, given key = "happy boy" (actual key would have at least one instance of each letter in the alphabet), we have the partial substitution table of ('h' -> 'a', 'a' -> 'b', 'p' -> 'c', 'y' -> 'd', 'b' -> 'e', 'o' -> 'f').
  • \n
\n\n

Return the decoded message.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: key = "the quick brown fox jumps over the lazy dog", message = "vkbs bs t suepuv"\nOutput: "this is a secret"\nExplanation: The diagram above shows the substitution table.\nIt is obtained by taking the first appearance of each letter in "the quick brown fox jumps over the lazy dog".\n
\n\n

Example 2:

\n\"\"\n
\nInput: key = "eljuxhpwnyrdgtqkviszcfmabo", message = "zwx hnfx lqantp mnoeius ycgk vcnjrdb"\nOutput: "the five boxing wizards jump quickly"\nExplanation: The diagram above shows the substitution table.\nIt is obtained by taking the first appearance of each letter in "eljuxhpwnyrdgtqkviszcfmabo".\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 26 <= key.length <= 2000
  • \n\t
  • key consists of lowercase English letters and ' '.
  • \n\t
  • key contains every letter in the English alphabet ('a' to 'z') at least once.
  • \n\t
  • 1 <= message.length <= 2000
  • \n\t
  • message consists of lowercase English letters and ' '.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 164, + "dislikes": 24, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "\"the quick brown fox jumps over the lazy dog\"\n\"vkbs bs t suepuv\"\n\"eljuxhpwnyrdgtqkviszcfmabo\"\n\"zwx hnfx lqantp mnoeius ycgk vcnjrdb\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n string decodeMessage(string key, string message) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public String decodeMessage(String key, String message) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def decodeMessage(self, key, message):\n \"\"\"\n :type key: str\n :type message: str\n :rtype: str\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def decodeMessage(self, key: str, message: str) -> str:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nchar * decodeMessage(char * key, char * message){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public string DecodeMessage(string key, string message) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} key\n * @param {string} message\n * @return {string}\n */\nvar decodeMessage = function(key, message) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} key\n# @param {String} message\n# @return {String}\ndef decode_message(key, message)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func decodeMessage(_ key: String, _ message: String) -> String {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func decodeMessage(key string, message string) string {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def decodeMessage(key: String, message: String): String = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun decodeMessage(key: String, message: String): String {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn decode_message(key: String, message: String) -> String {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $key\n * @param String $message\n * @return String\n */\n function decodeMessage($key, $message) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function decodeMessage(key: string, message: string): string {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (decode-message key message)\n (-> string? string? string?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec decode_message(Key :: unicode:unicode_binary(), Message :: unicode:unicode_binary()) -> unicode:unicode_binary().\ndecode_message(Key, Message) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec decode_message(key :: String.t, message :: String.t) :: String.t\n def decode_message(key, message) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"22K\", \"totalSubmission\": \"26.4K\", \"totalAcceptedRaw\": 22030, \"totalSubmissionRaw\": 26401, \"acRate\": \"83.4%\"}", + "hints": [ + "Iterate through the characters in the key to construct a mapping to the English alphabet.", + "Make sure to check that the current character is not already in the mapping (only the first appearance is considered).", + "Map the characters in the message according to the constructed mapping." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"the quick brown fox jumps over the lazy dog\"\n\"vkbs bs t suepuv\"", + "metaData": "{\n \"name\": \"decodeMessage\",\n \"params\": [\n {\n \"name\": \"key\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"message\"\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/evaluate-boolean-binary-tree.json b/leetcode/originData/evaluate-boolean-binary-tree.json new file mode 100644 index 00000000..eecbe6fb --- /dev/null +++ b/leetcode/originData/evaluate-boolean-binary-tree.json @@ -0,0 +1,155 @@ +{ + "data": { + "question": { + "questionId": "2416", + "questionFrontendId": "2331", + "boundTopicId": null, + "title": "Evaluate Boolean Binary Tree", + "titleSlug": "evaluate-boolean-binary-tree", + "content": "

You are given the root of a full binary tree with the following properties:

\n\n
    \n\t
  • Leaf nodes have either the value 0 or 1, where 0 represents False and 1 represents True.
  • \n\t
  • Non-leaf nodes have either the value 2 or 3, where 2 represents the boolean OR and 3 represents the boolean AND.
  • \n
\n\n

The evaluation of a node is as follows:

\n\n
    \n\t
  • If the node is a leaf node, the evaluation is the value of the node, i.e. True or False.
  • \n\t
  • Otherwise, evaluate the node's two children and apply the boolean operation of its value with the children's evaluations.
  • \n
\n\n

Return the boolean result of evaluating the root node.

\n\n

A full binary tree is a binary tree where each node has either 0 or 2 children.

\n\n

A leaf node is a node that has zero children.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: root = [2,1,3,null,null,0,1]\nOutput: true\nExplanation: The above diagram illustrates the evaluation process.\nThe AND node evaluates to False AND True = False.\nThe OR node evaluates to True OR False = True.\nThe root node evaluates to True, so we return true.
\n\n

Example 2:

\n\n
\nInput: root = [0]\nOutput: false\nExplanation: The root node is a leaf node and it evaluates to false, so we return false.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • The number of nodes in the tree is in the range [1, 1000].
  • \n\t
  • 0 <= Node.val <= 3
  • \n\t
  • Every node has either 0 or 2 children.
  • \n\t
  • Leaf nodes have a value of 0 or 1.
  • \n\t
  • Non-leaf nodes have a value of 2 or 3.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 113, + "dislikes": 2, + "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}, {\"title\": \"Minimum Flips in Binary Tree to Get Result\", \"titleSlug\": \"minimum-flips-in-binary-tree-to-get-result\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[2,1,3,null,null,0,1]\n[0]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * TreeNode *left;\n * TreeNode *right;\n * TreeNode() : val(0), left(nullptr), right(nullptr) {}\n * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}\n * };\n */\nclass Solution {\npublic:\n bool evaluateTree(TreeNode* root) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * int val;\n * TreeNode left;\n * TreeNode right;\n * TreeNode() {}\n * TreeNode(int val) { this.val = val; }\n * TreeNode(int val, TreeNode left, TreeNode right) {\n * this.val = val;\n * this.left = left;\n * this.right = right;\n * }\n * }\n */\nclass Solution {\n public boolean evaluateTree(TreeNode root) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "# Definition for a binary tree node.\n# class TreeNode(object):\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution(object):\n def evaluateTree(self, root):\n \"\"\"\n :type root: Optional[TreeNode]\n :rtype: bool\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "# Definition for a binary tree node.\n# class TreeNode:\n# def __init__(self, val=0, left=None, right=None):\n# self.val = val\n# self.left = left\n# self.right = right\nclass Solution:\n def evaluateTree(self, root: Optional[TreeNode]) -> bool:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Definition for a binary tree node.\n * struct TreeNode {\n * int val;\n * struct TreeNode *left;\n * struct TreeNode *right;\n * };\n */\n\n\nbool evaluateTree(struct TreeNode* root){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public int val;\n * public TreeNode left;\n * public TreeNode right;\n * public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {\n * this.val = val;\n * this.left = left;\n * this.right = right;\n * }\n * }\n */\npublic class Solution {\n public bool EvaluateTree(TreeNode root) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * Definition for a binary tree node.\n * function TreeNode(val, left, right) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n */\n/**\n * @param {TreeNode} root\n * @return {boolean}\n */\nvar evaluateTree = function(root) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# Definition for a binary tree node.\n# class TreeNode\n# attr_accessor :val, :left, :right\n# def initialize(val = 0, left = nil, right = nil)\n# @val = val\n# @left = left\n# @right = right\n# end\n# end\n# @param {TreeNode} root\n# @return {Boolean}\ndef evaluate_tree(root)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "/**\n * Definition for a binary tree node.\n * public class TreeNode {\n * public var val: Int\n * public var left: TreeNode?\n * public var right: TreeNode?\n * public init() { self.val = 0; self.left = nil; self.right = nil; }\n * public init(_ val: Int) { self.val = val; self.left = nil; self.right = nil; }\n * public init(_ val: Int, _ left: TreeNode?, _ right: TreeNode?) {\n * self.val = val\n * self.left = left\n * self.right = right\n * }\n * }\n */\nclass Solution {\n func evaluateTree(_ root: TreeNode?) -> Bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "/**\n * Definition for a binary tree node.\n * type TreeNode struct {\n * Val int\n * Left *TreeNode\n * Right *TreeNode\n * }\n */\nfunc evaluateTree(root *TreeNode) bool {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode(_value: Int = 0, _left: TreeNode = null, _right: TreeNode = null) {\n * var value: Int = _value\n * var left: TreeNode = _left\n * var right: TreeNode = _right\n * }\n */\nobject Solution {\n def evaluateTree(root: TreeNode): Boolean = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "/**\n * Example:\n * var ti = TreeNode(5)\n * var v = ti.`val`\n * Definition for a binary tree node.\n * class TreeNode(var `val`: Int) {\n * var left: TreeNode? = null\n * var right: TreeNode? = null\n * }\n */\nclass Solution {\n fun evaluateTree(root: TreeNode?): Boolean {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "// Definition for a binary tree node.\n// #[derive(Debug, PartialEq, Eq)]\n// pub struct TreeNode {\n// pub val: i32,\n// pub left: Option>>,\n// pub right: Option>>,\n// }\n// \n// impl TreeNode {\n// #[inline]\n// pub fn new(val: i32) -> Self {\n// TreeNode {\n// val,\n// left: None,\n// right: None\n// }\n// }\n// }\nuse std::rc::Rc;\nuse std::cell::RefCell;\nimpl Solution {\n pub fn evaluate_tree(root: Option>>) -> bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * public $val = null;\n * public $left = null;\n * public $right = null;\n * function __construct($val = 0, $left = null, $right = null) {\n * $this->val = $val;\n * $this->left = $left;\n * $this->right = $right;\n * }\n * }\n */\nclass Solution {\n\n /**\n * @param TreeNode $root\n * @return Boolean\n */\n function evaluateTree($root) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "/**\n * Definition for a binary tree node.\n * class TreeNode {\n * val: number\n * left: TreeNode | null\n * right: TreeNode | null\n * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {\n * this.val = (val===undefined ? 0 : val)\n * this.left = (left===undefined ? null : left)\n * this.right = (right===undefined ? null : right)\n * }\n * }\n */\n\nfunction evaluateTree(root: TreeNode | null): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "; Definition for a binary tree node.\n#|\n\n; val : integer?\n; left : (or/c tree-node? #f)\n; right : (or/c tree-node? #f)\n(struct tree-node\n (val left right) #:mutable #:transparent)\n\n; constructor\n(define (make-tree-node [val 0])\n (tree-node val #f #f))\n\n|#\n\n(define/contract (evaluate-tree root)\n (-> (or/c tree-node? #f) boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "%% Definition for a binary tree node.\n%%\n%% -record(tree_node, {val = 0 :: integer(),\n%% left = null :: 'null' | #tree_node{},\n%% right = null :: 'null' | #tree_node{}}).\n\n-spec evaluate_tree(Root :: #tree_node{} | null) -> boolean().\nevaluate_tree(Root) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "# Definition for a binary tree node.\n#\n# defmodule TreeNode do\n# @type t :: %__MODULE__{\n# val: integer,\n# left: TreeNode.t() | nil,\n# right: TreeNode.t() | nil\n# }\n# defstruct val: 0, left: nil, right: nil\n# end\n\ndefmodule Solution do\n @spec evaluate_tree(root :: TreeNode.t | nil) :: boolean\n def evaluate_tree(root) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"14.9K\", \"totalSubmission\": \"19.1K\", \"totalAcceptedRaw\": 14948, \"totalSubmissionRaw\": 19100, \"acRate\": \"78.3%\"}", + "hints": [ + "Traverse the tree using depth-first search in post-order.", + "Can you use recursion to solve this easily?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[2,1,3,null,null,0,1]", + "metaData": "{\n \"name\": \"evaluateTree\",\n \"params\": [\n {\n \"name\": \"root\",\n \"type\": \"TreeNode\"\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/minimum-amount-of-time-to-fill-cups.json b/leetcode/originData/minimum-amount-of-time-to-fill-cups.json new file mode 100644 index 00000000..d1fe136c --- /dev/null +++ b/leetcode/originData/minimum-amount-of-time-to-fill-cups.json @@ -0,0 +1,155 @@ +{ + "data": { + "question": { + "questionId": "2412", + "questionFrontendId": "2335", + "boundTopicId": null, + "title": "Minimum Amount of Time to Fill Cups", + "titleSlug": "minimum-amount-of-time-to-fill-cups", + "content": "

You have a water dispenser that can dispense cold, warm, and hot water. Every second, you can either fill up 2 cups with different types of water, or 1 cup of any type of water.

\n\n

You are given a 0-indexed integer array amount of length 3 where amount[0], amount[1], and amount[2] denote the number of cold, warm, and hot water cups you need to fill respectively. Return the minimum number of seconds needed to fill up all the cups.

\n\n

 

\n

Example 1:

\n\n
\nInput: amount = [1,4,2]\nOutput: 4\nExplanation: One way to fill up the cups is:\nSecond 1: Fill up a cold cup and a warm cup.\nSecond 2: Fill up a warm cup and a hot cup.\nSecond 3: Fill up a warm cup and a hot cup.\nSecond 4: Fill up a warm cup.\nIt can be proven that 4 is the minimum number of seconds needed.\n
\n\n

Example 2:

\n\n
\nInput: amount = [5,4,4]\nOutput: 7\nExplanation: One way to fill up the cups is:\nSecond 1: Fill up a cold cup, and a hot cup.\nSecond 2: Fill up a cold cup, and a warm cup.\nSecond 3: Fill up a cold cup, and a warm cup.\nSecond 4: Fill up a warm cup, and a hot cup.\nSecond 5: Fill up a cold cup, and a hot cup.\nSecond 6: Fill up a cold cup, and a warm cup.\nSecond 7: Fill up a hot cup.\n
\n\n

Example 3:

\n\n
\nInput: amount = [5,0,0]\nOutput: 5\nExplanation: Every second, we fill up a cold cup.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • amount.length == 3
  • \n\t
  • 0 <= amount[i] <= 100
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 155, + "dislikes": 31, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Construct Target Array With Multiple Sums\", \"titleSlug\": \"construct-target-array-with-multiple-sums\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Maximum Score From Removing Stones\", \"titleSlug\": \"maximum-score-from-removing-stones\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Running Time of N Computers\", \"titleSlug\": \"maximum-running-time-of-n-computers\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,4,2]\n[5,4,4]\n[5,0,0]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int fillCups(vector& amount) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int fillCups(int[] amount) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def fillCups(self, amount):\n \"\"\"\n :type amount: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def fillCups(self, amount: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint fillCups(int* amount, int amountSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int FillCups(int[] amount) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} amount\n * @return {number}\n */\nvar fillCups = function(amount) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} amount\n# @return {Integer}\ndef fill_cups(amount)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func fillCups(_ amount: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func fillCups(amount []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def fillCups(amount: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun fillCups(amount: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn fill_cups(amount: Vec) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $amount\n * @return Integer\n */\n function fillCups($amount) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function fillCups(amount: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (fill-cups amount)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec fill_cups(Amount :: [integer()]) -> integer().\nfill_cups(Amount) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec fill_cups(amount :: [integer]) :: integer\n def fill_cups(amount) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"16.2K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 16220, \"totalSubmissionRaw\": 30221, \"acRate\": \"53.7%\"}", + "hints": [ + "To minimize the amount of time needed, you want to fill up as many cups as possible in each second. This means that you want to maximize the number of seconds where you are filling up two cups.", + "You always want to fill up the two types of water with the most unfilled cups." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,4,2]", + "metaData": "{\n \"name\": \"fillCups\",\n \"params\": [\n {\n \"name\": \"amount\",\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-sum-of-squared-difference.json b/leetcode/originData/minimum-sum-of-squared-difference.json new file mode 100644 index 00000000..8147c3c8 --- /dev/null +++ b/leetcode/originData/minimum-sum-of-squared-difference.json @@ -0,0 +1,156 @@ +{ + "data": { + "question": { + "questionId": "2418", + "questionFrontendId": "2333", + "boundTopicId": null, + "title": "Minimum Sum of Squared Difference", + "titleSlug": "minimum-sum-of-squared-difference", + "content": "

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

\n\n

The sum of squared difference of arrays nums1 and nums2 is defined as the sum of (nums1[i] - nums2[i])2 for each 0 <= i < n.

\n\n

You are also given two positive integers k1 and k2. You can modify any of the elements of nums1 by +1 or -1 at most k1 times. Similarly, you can modify any of the elements of nums2 by +1 or -1 at most k2 times.

\n\n

Return the minimum sum of squared difference after modifying array nums1 at most k1 times and modifying array nums2 at most k2 times.

\n\n

Note: You are allowed to modify the array elements to become negative integers.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [1,2,3,4], nums2 = [2,10,20,19], k1 = 0, k2 = 0\nOutput: 579\nExplanation: The elements in nums1 and nums2 cannot be modified because k1 = 0 and k2 = 0. \nThe sum of square difference will be: (1 - 2)2 + (2 - 10)2 + (3 - 20)2 + (4 - 19)2 = 579.\n
\n\n

Example 2:

\n\n
\nInput: nums1 = [1,4,10,12], nums2 = [5,8,6,9], k1 = 1, k2 = 1\nOutput: 43\nExplanation: One way to obtain the minimum sum of square difference is: \n- Increase nums1[0] once.\n- Increase nums2[2] once.\nThe minimum of the sum of square difference will be: \n(2 - 5)2 + (4 - 8)2 + (10 - 7)2 + (12 - 9)2 = 43.\nNote that, there are other ways to obtain the minimum of the sum of square difference, but there is no way to obtain a sum smaller than 43.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 0 <= nums1[i], nums2[i] <= 105
  • \n\t
  • 0 <= k1, k2 <= 109
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 255, + "dislikes": 20, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Minimum Absolute Sum Difference\", \"titleSlug\": \"minimum-absolute-sum-difference\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Partition Array Into Two Arrays to Minimize Sum Difference\", \"titleSlug\": \"partition-array-into-two-arrays-to-minimize-sum-difference\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,2,3,4]\n[2,10,20,19]\n0\n0\n[1,4,10,12]\n[5,8,6,9]\n1\n1", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long minSumSquareDiff(vector& nums1, vector& nums2, int k1, int k2) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long minSumSquareDiff(int[] nums1, int[] nums2, int k1, int k2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minSumSquareDiff(self, nums1, nums2, k1, k2):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :type k1: int\n :type k2: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minSumSquareDiff(self, nums1: List[int], nums2: List[int], k1: int, k2: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nlong long minSumSquareDiff(int* nums1, int nums1Size, int* nums2, int nums2Size, int k1, int k2){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MinSumSquareDiff(int[] nums1, int[] nums2, int k1, int k2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @param {number} k1\n * @param {number} k2\n * @return {number}\n */\nvar minSumSquareDiff = function(nums1, nums2, k1, k2) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @param {Integer} k1\n# @param {Integer} k2\n# @return {Integer}\ndef min_sum_square_diff(nums1, nums2, k1, k2)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minSumSquareDiff(_ nums1: [Int], _ nums2: [Int], _ k1: Int, _ k2: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minSumSquareDiff(nums1 []int, nums2 []int, k1 int, k2 int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minSumSquareDiff(nums1: Array[Int], nums2: Array[Int], k1: Int, k2: Int): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minSumSquareDiff(nums1: IntArray, nums2: IntArray, k1: Int, k2: Int): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_sum_square_diff(nums1: Vec, nums2: Vec, k1: i32, k2: i32) -> i64 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums1\n * @param Integer[] $nums2\n * @param Integer $k1\n * @param Integer $k2\n * @return Integer\n */\n function minSumSquareDiff($nums1, $nums2, $k1, $k2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minSumSquareDiff(nums1: number[], nums2: number[], k1: number, k2: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-sum-square-diff nums1 nums2 k1 k2)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_sum_square_diff(Nums1 :: [integer()], Nums2 :: [integer()], K1 :: integer(), K2 :: integer()) -> integer().\nmin_sum_square_diff(Nums1, Nums2, K1, K2) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_sum_square_diff(nums1 :: [integer], nums2 :: [integer], k1 :: integer, k2 :: integer) :: integer\n def min_sum_square_diff(nums1, nums2, k1, k2) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"24.2K\", \"totalAcceptedRaw\": 5512, \"totalSubmissionRaw\": 24219, \"acRate\": \"22.8%\"}", + "hints": [ + "There is no difference between the purpose of k1 and k2. Adding +1 to one element in nums1 is same as performing -1 to one element in nums2, and vice versa.", + "Reduce the sum of squared difference greedily. One operation of k should use the index that has the current maximum difference.", + "Binary search the maximum difference for the final result." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,3,4]\n[2,10,20,19]\n0\n0", + "metaData": "{\n \"name\": \"minSumSquareDiff\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k1\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k2\"\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/move-pieces-to-obtain-a-string.json b/leetcode/originData/move-pieces-to-obtain-a-string.json new file mode 100644 index 00000000..15d71fac --- /dev/null +++ b/leetcode/originData/move-pieces-to-obtain-a-string.json @@ -0,0 +1,155 @@ +{ + "data": { + "question": { + "questionId": "2414", + "questionFrontendId": "2337", + "boundTopicId": null, + "title": "Move Pieces to Obtain a String", + "titleSlug": "move-pieces-to-obtain-a-string", + "content": "

You are given two strings start and target, both of length n. Each string consists only of the characters 'L', 'R', and '_' where:

\n\n
    \n\t
  • The characters 'L' and 'R' represent pieces, where a piece 'L' can move to the left only if there is a blank space directly to its left, and a piece 'R' can move to the right only if there is a blank space directly to its right.
  • \n\t
  • The character '_' represents a blank space that can be occupied by any of the 'L' or 'R' pieces.
  • \n
\n\n

Return true if it is possible to obtain the string target by moving the pieces of the string start any number of times. Otherwise, return false.

\n\n

 

\n

Example 1:

\n\n
\nInput: start = "_L__R__R_", target = "L______RR"\nOutput: true\nExplanation: We can obtain the string target from start by doing the following moves:\n- Move the first piece one step to the left, start becomes equal to "L___R__R_".\n- Move the last piece one step to the right, start becomes equal to "L___R___R".\n- Move the second piece three steps to the right, start becomes equal to "L______RR".\nSince it is possible to get the string target from start, we return true.\n
\n\n

Example 2:

\n\n
\nInput: start = "R_L_", target = "__LR"\nOutput: false\nExplanation: The 'R' piece in the string start can move one step to the right to obtain "_RL_".\nAfter that, no pieces can move anymore, so it is impossible to obtain the string target from start.\n
\n\n

Example 3:

\n\n
\nInput: start = "_R", target = "R_"\nOutput: false\nExplanation: The piece in the string start can move only to the right, so it is impossible to obtain the string target from start.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == start.length == target.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • start and target consist of the characters 'L', 'R', and '_'.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 253, + "dislikes": 24, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Valid Parentheses\", \"titleSlug\": \"valid-parentheses\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Swap Adjacent in LR String\", \"titleSlug\": \"swap-adjacent-in-lr-string\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "\"_L__R__R_\"\n\"L______RR\"\n\"R_L_\"\n\"__LR\"\n\"_R\"\n\"R_\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool canChange(string start, string target) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean canChange(String start, String target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def canChange(self, start, target):\n \"\"\"\n :type start: str\n :type target: str\n :rtype: bool\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def canChange(self, start: str, target: str) -> bool:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nbool canChange(char * start, char * target){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool CanChange(string start, string target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} start\n * @param {string} target\n * @return {boolean}\n */\nvar canChange = function(start, target) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} start\n# @param {String} target\n# @return {Boolean}\ndef can_change(start, target)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func canChange(_ start: String, _ target: String) -> Bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func canChange(start string, target string) bool {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def canChange(start: String, target: String): Boolean = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun canChange(start: String, target: String): Boolean {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn can_change(start: String, target: String) -> bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $start\n * @param String $target\n * @return Boolean\n */\n function canChange($start, $target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function canChange(start: string, target: string): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (can-change start target)\n (-> string? string? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec can_change(Start :: unicode:unicode_binary(), Target :: unicode:unicode_binary()) -> boolean().\ncan_change(Start, Target) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec can_change(start :: String.t, target :: String.t) :: boolean\n def can_change(start, target) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"10.8K\", \"totalSubmission\": \"23.2K\", \"totalAcceptedRaw\": 10777, \"totalSubmissionRaw\": 23183, \"acRate\": \"46.5%\"}", + "hints": [ + "After some sequence of moves, can the order of the pieces change?", + "Try to match each piece in s with a piece in e." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"_L__R__R_\"\n\"L______RR\"", + "metaData": "{\n \"name\": \"canChange\",\n \"params\": [\n {\n \"name\": \"start\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"target\"\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/number-of-increasing-paths-in-a-grid.json b/leetcode/originData/number-of-increasing-paths-in-a-grid.json new file mode 100644 index 00000000..b80282d1 --- /dev/null +++ b/leetcode/originData/number-of-increasing-paths-in-a-grid.json @@ -0,0 +1,204 @@ +{ + "data": { + "question": { + "questionId": "2409", + "questionFrontendId": "2328", + "boundTopicId": null, + "title": "Number of Increasing Paths in a Grid", + "titleSlug": "number-of-increasing-paths-in-a-grid", + "content": "

You are given an m x n integer matrix grid, where you can move from a cell to any adjacent cell in all 4 directions.

\n\n

Return the number of strictly increasing paths in the grid such that you can start from any cell and end at any cell. Since the answer may be very large, return it modulo 109 + 7.

\n\n

Two paths are considered different if they do not have exactly the same sequence of visited cells.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: grid = [[1,1],[3,4]]\nOutput: 8\nExplanation: The strictly increasing paths are:\n- Paths with length 1: [1], [1], [3], [4].\n- Paths with length 2: [1 -> 3], [1 -> 4], [3 -> 4].\n- Paths with length 3: [1 -> 3 -> 4].\nThe total number of paths is 4 + 3 + 1 = 8.\n
\n\n

Example 2:

\n\n
\nInput: grid = [[1],[2]]\nOutput: 3\nExplanation: The strictly increasing paths are:\n- Paths with length 1: [1], [2].\n- Paths with length 2: [1 -> 2].\nThe total number of paths is 2 + 1 = 3.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • m == grid.length
  • \n\t
  • n == grid[i].length
  • \n\t
  • 1 <= m, n <= 1000
  • \n\t
  • 1 <= m * n <= 105
  • \n\t
  • 1 <= grid[i][j] <= 105
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 338, + "dislikes": 10, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Longest Increasing Path in a Matrix\", \"titleSlug\": \"longest-increasing-path-in-a-matrix\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"All Paths From Source to Target\", \"titleSlug\": \"all-paths-from-source-to-target\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[[1,1],[3,4]]\n[[1],[2]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "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": "Graph", + "slug": "graph", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Topological Sort", + "slug": "topological-sort", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Memoization", + "slug": "memoization", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Matrix", + "slug": "matrix", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countPaths(vector>& grid) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countPaths(int[][] grid) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countPaths(self, grid):\n \"\"\"\n :type grid: List[List[int]]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countPaths(self, grid: List[List[int]]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint countPaths(int** grid, int gridSize, int* gridColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountPaths(int[][] grid) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} grid\n * @return {number}\n */\nvar countPaths = function(grid) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} grid\n# @return {Integer}\ndef count_paths(grid)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countPaths(_ grid: [[Int]]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countPaths(grid [][]int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countPaths(grid: Array[Array[Int]]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countPaths(grid: Array): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_paths(grid: Vec>) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $grid\n * @return Integer\n */\n function countPaths($grid) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countPaths(grid: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-paths grid)\n (-> (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_paths(Grid :: [[integer()]]) -> integer().\ncount_paths(Grid) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_paths(grid :: [[integer]]) :: integer\n def count_paths(grid) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"20.1K\", \"totalAcceptedRaw\": 9434, \"totalSubmissionRaw\": 20131, \"acRate\": \"46.9%\"}", + "hints": [ + "How can you calculate the number of increasing paths that start from a cell (i, j)? Think about dynamic programming.", + "Define f(i, j) as the number of increasing paths starting from cell (i, j). Try to find how f(i, j) is related to each of f(i, j+1), f(i, j-1), f(i+1, j) and f(i-1, j)." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[1,1],[3,4]]", + "metaData": "{\n \"name\": \"countPaths\",\n \"params\": [\n {\n \"name\": \"grid\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "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-people-aware-of-a-secret.json b/leetcode/originData/number-of-people-aware-of-a-secret.json new file mode 100644 index 00000000..e421b97d --- /dev/null +++ b/leetcode/originData/number-of-people-aware-of-a-secret.json @@ -0,0 +1,175 @@ +{ + "data": { + "question": { + "questionId": "2408", + "questionFrontendId": "2327", + "boundTopicId": null, + "title": "Number of People Aware of a Secret", + "titleSlug": "number-of-people-aware-of-a-secret", + "content": "

On day 1, one person discovers a secret.

\n\n

You are given an integer delay, which means that each person will share the secret with a new person every day, starting from delay days after discovering the secret. You are also given an integer forget, which means that each person will forget the secret forget days after discovering it. A person cannot share the secret on the same day they forgot it, or on any day afterwards.

\n\n

Given an integer n, return the number of people who know the secret at the end of day n. Since the answer may be very large, return it modulo 109 + 7.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 6, delay = 2, forget = 4\nOutput: 5\nExplanation:\nDay 1: Suppose the first person is named A. (1 person)\nDay 2: A is the only person who knows the secret. (1 person)\nDay 3: A shares the secret with a new person, B. (2 people)\nDay 4: A shares the secret with a new person, C. (3 people)\nDay 5: A forgets the secret, and B shares the secret with a new person, D. (3 people)\nDay 6: B shares the secret with E, and C shares the secret with F. (5 people)\n
\n\n

Example 2:

\n\n
\nInput: n = 4, delay = 1, forget = 3\nOutput: 6\nExplanation:\nDay 1: The first person is named A. (1 person)\nDay 2: A shares the secret with B. (2 people)\nDay 3: A and B share the secret with 2 new people, C and D. (4 people)\nDay 4: A forgets the secret. B, C, and D share the secret with 3 new people. (6 people)\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 2 <= n <= 1000
  • \n\t
  • 1 <= delay < forget <= n
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 368, + "dislikes": 83, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "6\n2\n4\n4\n1\n3", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Queue", + "slug": "queue", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int peopleAwareOfSecret(int n, int delay, int forget) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int peopleAwareOfSecret(int n, int delay, int forget) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def peopleAwareOfSecret(self, n, delay, forget):\n \"\"\"\n :type n: int\n :type delay: int\n :type forget: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def peopleAwareOfSecret(self, n: int, delay: int, forget: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint peopleAwareOfSecret(int n, int delay, int forget){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int PeopleAwareOfSecret(int n, int delay, int forget) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} delay\n * @param {number} forget\n * @return {number}\n */\nvar peopleAwareOfSecret = function(n, delay, forget) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} delay\n# @param {Integer} forget\n# @return {Integer}\ndef people_aware_of_secret(n, delay, forget)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func peopleAwareOfSecret(_ n: Int, _ delay: Int, _ forget: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func peopleAwareOfSecret(n int, delay int, forget int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def peopleAwareOfSecret(n: Int, delay: Int, forget: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun peopleAwareOfSecret(n: Int, delay: Int, forget: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn people_aware_of_secret(n: i32, delay: i32, forget: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $delay\n * @param Integer $forget\n * @return Integer\n */\n function peopleAwareOfSecret($n, $delay, $forget) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function peopleAwareOfSecret(n: number, delay: number, forget: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (people-aware-of-secret n delay forget)\n (-> exact-integer? exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec people_aware_of_secret(N :: integer(), Delay :: integer(), Forget :: integer()) -> integer().\npeople_aware_of_secret(N, Delay, Forget) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec people_aware_of_secret(n :: integer, delay :: integer, forget :: integer) :: integer\n def people_aware_of_secret(n, delay, forget) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"10.7K\", \"totalSubmission\": \"24.7K\", \"totalAcceptedRaw\": 10703, \"totalSubmissionRaw\": 24702, \"acRate\": \"43.3%\"}", + "hints": [ + "Let dp[i][j] be the number of people who have known the secret for exactly j + 1 days, at day i.", + "If j > 0, dp[i][j] = dp[i – 1][j – 1].", + "dp[i][0] = sum(dp[i – 1][j]) for j in [delay – 1, forget – 2]." + ], + "solution": null, + "status": null, + "sampleTestCase": "6\n2\n4", + "metaData": "{\n \"name\": \"peopleAwareOfSecret\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"delay\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"forget\"\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/smallest-number-in-infinite-set.json b/leetcode/originData/smallest-number-in-infinite-set.json new file mode 100644 index 00000000..769b6299 --- /dev/null +++ b/leetcode/originData/smallest-number-in-infinite-set.json @@ -0,0 +1,155 @@ +{ + "data": { + "question": { + "questionId": "2413", + "questionFrontendId": "2336", + "boundTopicId": null, + "title": "Smallest Number in Infinite Set", + "titleSlug": "smallest-number-in-infinite-set", + "content": "

You have a set which contains all positive integers [1, 2, 3, 4, 5, ...].

\n\n

Implement the SmallestInfiniteSet class:

\n\n
    \n\t
  • SmallestInfiniteSet() Initializes the SmallestInfiniteSet object to contain all positive integers.
  • \n\t
  • int popSmallest() Removes and returns the smallest integer contained in the infinite set.
  • \n\t
  • void addBack(int num) Adds a positive integer num back into the infinite set, if it is not already in the infinite set.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput\n["SmallestInfiniteSet", "addBack", "popSmallest", "popSmallest", "popSmallest", "addBack", "popSmallest", "popSmallest", "popSmallest"]\n[[], [2], [], [], [], [1], [], [], []]\nOutput\n[null, null, 1, 2, 3, null, 1, 4, 5]\n\nExplanation\nSmallestInfiniteSet smallestInfiniteSet = new SmallestInfiniteSet();\nsmallestInfiniteSet.addBack(2);    // 2 is already in the set, so no change is made.\nsmallestInfiniteSet.popSmallest(); // return 1, since 1 is the smallest number, and remove it from the set.\nsmallestInfiniteSet.popSmallest(); // return 2, and remove it from the set.\nsmallestInfiniteSet.popSmallest(); // return 3, and remove it from the set.\nsmallestInfiniteSet.addBack(1);    // 1 is added back to the set.\nsmallestInfiniteSet.popSmallest(); // return 1, since 1 was added back to the set and\n                                   // is the smallest number, and remove it from the set.\nsmallestInfiniteSet.popSmallest(); // return 4, and remove it from the set.\nsmallestInfiniteSet.popSmallest(); // return 5, and remove it from the set.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= num <= 1000
  • \n\t
  • At most 1000 calls will be made in total to popSmallest and addBack.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 97, + "dislikes": 9, + "isLiked": null, + "similarQuestions": "[{\"title\": \"First Missing Positive\", \"titleSlug\": \"first-missing-positive\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[\"SmallestInfiniteSet\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\"]\n[[],[2],[],[],[],[1],[],[],[]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class SmallestInfiniteSet {\npublic:\n SmallestInfiniteSet() {\n \n }\n \n int popSmallest() {\n \n }\n \n void addBack(int num) {\n \n }\n};\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * SmallestInfiniteSet* obj = new SmallestInfiniteSet();\n * int param_1 = obj->popSmallest();\n * obj->addBack(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class SmallestInfiniteSet {\n\n public SmallestInfiniteSet() {\n \n }\n \n public int popSmallest() {\n \n }\n \n public void addBack(int num) {\n \n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * SmallestInfiniteSet obj = new SmallestInfiniteSet();\n * int param_1 = obj.popSmallest();\n * obj.addBack(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class SmallestInfiniteSet(object):\n\n def __init__(self):\n \n\n def popSmallest(self):\n \"\"\"\n :rtype: int\n \"\"\"\n \n\n def addBack(self, num):\n \"\"\"\n :type num: int\n :rtype: None\n \"\"\"\n \n\n\n# Your SmallestInfiniteSet object will be instantiated and called as such:\n# obj = SmallestInfiniteSet()\n# param_1 = obj.popSmallest()\n# obj.addBack(num)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class SmallestInfiniteSet:\n\n def __init__(self):\n \n\n def popSmallest(self) -> int:\n \n\n def addBack(self, num: int) -> None:\n \n\n\n# Your SmallestInfiniteSet object will be instantiated and called as such:\n# obj = SmallestInfiniteSet()\n# param_1 = obj.popSmallest()\n# obj.addBack(num)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\n\ntypedef struct {\n \n} SmallestInfiniteSet;\n\n\nSmallestInfiniteSet* smallestInfiniteSetCreate() {\n \n}\n\nint smallestInfiniteSetPopSmallest(SmallestInfiniteSet* obj) {\n \n}\n\nvoid smallestInfiniteSetAddBack(SmallestInfiniteSet* obj, int num) {\n \n}\n\nvoid smallestInfiniteSetFree(SmallestInfiniteSet* obj) {\n \n}\n\n/**\n * Your SmallestInfiniteSet struct will be instantiated and called as such:\n * SmallestInfiniteSet* obj = smallestInfiniteSetCreate();\n * int param_1 = smallestInfiniteSetPopSmallest(obj);\n \n * smallestInfiniteSetAddBack(obj, num);\n \n * smallestInfiniteSetFree(obj);\n*/", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class SmallestInfiniteSet {\n\n public SmallestInfiniteSet() {\n \n }\n \n public int PopSmallest() {\n \n }\n \n public void AddBack(int num) {\n \n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * SmallestInfiniteSet obj = new SmallestInfiniteSet();\n * int param_1 = obj.PopSmallest();\n * obj.AddBack(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "\nvar SmallestInfiniteSet = function() {\n \n};\n\n/**\n * @return {number}\n */\nSmallestInfiniteSet.prototype.popSmallest = function() {\n \n};\n\n/** \n * @param {number} num\n * @return {void}\n */\nSmallestInfiniteSet.prototype.addBack = function(num) {\n \n};\n\n/** \n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * var obj = new SmallestInfiniteSet()\n * var param_1 = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "class SmallestInfiniteSet\n def initialize()\n \n end\n\n\n=begin\n :rtype: Integer\n=end\n def pop_smallest()\n \n end\n\n\n=begin\n :type num: Integer\n :rtype: Void\n=end\n def add_back(num)\n \n end\n\n\nend\n\n# Your SmallestInfiniteSet object will be instantiated and called as such:\n# obj = SmallestInfiniteSet.new()\n# param_1 = obj.pop_smallest()\n# obj.add_back(num)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "\nclass SmallestInfiniteSet {\n\n init() {\n \n }\n \n func popSmallest() -> Int {\n \n }\n \n func addBack(_ num: Int) {\n \n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * let obj = SmallestInfiniteSet()\n * let ret_1: Int = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "type SmallestInfiniteSet struct {\n \n}\n\n\nfunc Constructor() SmallestInfiniteSet {\n \n}\n\n\nfunc (this *SmallestInfiniteSet) PopSmallest() int {\n \n}\n\n\nfunc (this *SmallestInfiniteSet) AddBack(num int) {\n \n}\n\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * obj := Constructor();\n * param_1 := obj.PopSmallest();\n * obj.AddBack(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "class SmallestInfiniteSet() {\n\n def popSmallest(): Int = {\n \n }\n\n def addBack(num: Int) {\n \n }\n\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * var obj = new SmallestInfiniteSet()\n * var param_1 = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class SmallestInfiniteSet() {\n\n fun popSmallest(): Int {\n \n }\n\n fun addBack(num: Int) {\n \n }\n\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * var obj = SmallestInfiniteSet()\n * var param_1 = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "struct SmallestInfiniteSet {\n\n}\n\n\n/** \n * `&self` means the method takes an immutable reference.\n * If you need a mutable reference, change it to `&mut self` instead.\n */\nimpl SmallestInfiniteSet {\n\n fn new() -> Self {\n \n }\n \n fn pop_smallest(&self) -> i32 {\n \n }\n \n fn add_back(&self, num: i32) {\n \n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * let obj = SmallestInfiniteSet::new();\n * let ret_1: i32 = obj.pop_smallest();\n * obj.add_back(num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class SmallestInfiniteSet {\n /**\n */\n function __construct() {\n \n }\n \n /**\n * @return Integer\n */\n function popSmallest() {\n \n }\n \n /**\n * @param Integer $num\n * @return NULL\n */\n function addBack($num) {\n \n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * $obj = SmallestInfiniteSet();\n * $ret_1 = $obj->popSmallest();\n * $obj->addBack($num);\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "class SmallestInfiniteSet {\n constructor() {\n\n }\n\n popSmallest(): number {\n\n }\n\n addBack(num: number): void {\n\n }\n}\n\n/**\n * Your SmallestInfiniteSet object will be instantiated and called as such:\n * var obj = new SmallestInfiniteSet()\n * var param_1 = obj.popSmallest()\n * obj.addBack(num)\n */", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define smallest-infinite-set%\n (class object%\n (super-new)\n \n (init-field)\n \n ; pop-smallest : -> exact-integer?\n (define/public (pop-smallest)\n\n )\n ; add-back : exact-integer? -> void?\n (define/public (add-back num)\n\n )))\n\n;; Your smallest-infinite-set% object will be instantiated and called as such:\n;; (define obj (new smallest-infinite-set%))\n;; (define param_1 (send obj pop-smallest))\n;; (send obj add-back num)", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec smallest_infinite_set_init_() -> any().\nsmallest_infinite_set_init_() ->\n .\n\n-spec smallest_infinite_set_pop_smallest() -> integer().\nsmallest_infinite_set_pop_smallest() ->\n .\n\n-spec smallest_infinite_set_add_back(Num :: integer()) -> any().\nsmallest_infinite_set_add_back(Num) ->\n .\n\n\n%% Your functions will be called as such:\n%% smallest_infinite_set_init_(),\n%% Param_1 = smallest_infinite_set_pop_smallest(),\n%% smallest_infinite_set_add_back(Num),\n\n%% smallest_infinite_set_init_ will be called before every test case, in which you can do some necessary initializations.", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule SmallestInfiniteSet do\n @spec init_() :: any\n def init_() do\n\n end\n\n @spec pop_smallest() :: integer\n def pop_smallest() do\n\n end\n\n @spec add_back(num :: integer) :: any\n def add_back(num) do\n\n end\nend\n\n# Your functions will be called as such:\n# SmallestInfiniteSet.init_()\n# param_1 = SmallestInfiniteSet.pop_smallest()\n# SmallestInfiniteSet.add_back(num)\n\n# SmallestInfiniteSet.init_ will be called before every test case, in which you can do some necessary initializations.", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"20.3K\", \"totalAcceptedRaw\": 14423, \"totalSubmissionRaw\": 20339, \"acRate\": \"70.9%\"}", + "hints": [ + "Based on the constraints, what is the maximum element that can possibly be popped?", + "Maintain whether elements are in or not in the set. How many elements do we consider?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"SmallestInfiniteSet\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\",\"addBack\",\"popSmallest\",\"popSmallest\",\"popSmallest\"]\n[[],[2],[],[],[],[1],[],[],[]]", + "metaData": "{\n \"classname\": \"SmallestInfiniteSet\",\n \"constructor\": {\n \"params\": []\n },\n \"methods\": [\n {\n \"params\": [],\n \"name\": \"popSmallest\",\n \"return\": {\n \"type\": \"integer\"\n }\n },\n {\n \"params\": [\n {\n \"type\": \"integer\",\n \"name\": \"num\"\n }\n ],\n \"name\": \"addBack\",\n \"return\": {\n \"type\": \"void\"\n }\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n },\n \"systemdesign\": true\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/spiral-matrix-iv.json b/leetcode/originData/spiral-matrix-iv.json new file mode 100644 index 00000000..02782d83 --- /dev/null +++ b/leetcode/originData/spiral-matrix-iv.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "2411", + "questionFrontendId": "2326", + "boundTopicId": null, + "title": "Spiral Matrix IV", + "titleSlug": "spiral-matrix-iv", + "content": "

You are given two integers m and n, which represent the dimensions of a matrix.

\n\n

You are also given the head of a linked list of integers.

\n\n

Generate an m x n matrix that contains the integers in the linked list presented in spiral order (clockwise), starting from the top-left of the matrix. If there are remaining empty spaces, fill them with -1.

\n\n

Return the generated matrix.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: m = 3, n = 5, head = [3,0,2,6,8,1,7,9,4,2,5,5,0]\nOutput: [[3,0,2,6,8],[5,0,-1,-1,1],[5,2,4,9,7]]\nExplanation: The diagram above shows how the values are printed in the matrix.\nNote that the remaining spaces in the matrix are filled with -1.\n
\n\n

Example 2:

\n\"\"\n
\nInput: m = 1, n = 4, head = [0,1,2]\nOutput: [[0,1,2,-1]]\nExplanation: The diagram above shows how the values are printed from left to right in the matrix.\nThe last space in the matrix is set to -1.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= m, n <= 105
  • \n\t
  • 1 <= m * n <= 105
  • \n\t
  • The number of nodes in the list is in the range [1, m * n].
  • \n\t
  • 0 <= Node.val <= 1000
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 181, + "dislikes": 9, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Spiral Matrix\", \"titleSlug\": \"spiral-matrix\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Spiral Matrix II\", \"titleSlug\": \"spiral-matrix-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Spiral Matrix III\", \"titleSlug\": \"spiral-matrix-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "3\n5\n[3,0,2,6,8,1,7,9,4,2,5,5,0]\n1\n4\n[0,1,2]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Linked List", + "slug": "linked-list", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Matrix", + "slug": "matrix", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "/**\n * Definition for singly-linked list.\n * struct ListNode {\n * int val;\n * ListNode *next;\n * ListNode() : val(0), next(nullptr) {}\n * ListNode(int x) : val(x), next(nullptr) {}\n * ListNode(int x, ListNode *next) : val(x), next(next) {}\n * };\n */\nclass Solution {\npublic:\n vector> spiralMatrix(int m, int n, ListNode* head) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * int val;\n * ListNode next;\n * ListNode() {}\n * ListNode(int val) { this.val = val; }\n * ListNode(int val, ListNode next) { this.val = val; this.next = next; }\n * }\n */\nclass Solution {\n public int[][] spiralMatrix(int m, int n, ListNode head) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "# Definition for singly-linked list.\n# class ListNode(object):\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution(object):\n def spiralMatrix(self, m, n, head):\n \"\"\"\n :type m: int\n :type n: int\n :type head: Optional[ListNode]\n :rtype: List[List[int]]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def spiralMatrix(self, m: int, n: int, head: Optional[ListNode]) -> List[List[int]]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Definition for singly-linked list.\n * struct ListNode {\n * int val;\n * struct ListNode *next;\n * };\n */\n\n\n/**\n * Return an array of arrays of size *returnSize.\n * The sizes of the arrays are returned as *returnColumnSizes array.\n * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().\n */\nint** spiralMatrix(int m, int n, struct ListNode* head, int* returnSize, int** returnColumnSizes){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * public int val;\n * public ListNode next;\n * public ListNode(int val=0, ListNode next=null) {\n * this.val = val;\n * this.next = next;\n * }\n * }\n */\npublic class Solution {\n public int[][] SpiralMatrix(int m, int n, ListNode head) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * Definition for singly-linked list.\n * function ListNode(val, next) {\n * this.val = (val===undefined ? 0 : val)\n * this.next = (next===undefined ? null : next)\n * }\n */\n/**\n * @param {number} m\n * @param {number} n\n * @param {ListNode} head\n * @return {number[][]}\n */\nvar spiralMatrix = function(m, n, head) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# Definition for singly-linked list.\n# class ListNode\n# attr_accessor :val, :next\n# def initialize(val = 0, _next = nil)\n# @val = val\n# @next = _next\n# end\n# end\n# @param {Integer} m\n# @param {Integer} n\n# @param {ListNode} head\n# @return {Integer[][]}\ndef spiral_matrix(m, n, head)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * public var val: Int\n * public var next: ListNode?\n * public init() { self.val = 0; self.next = nil; }\n * public init(_ val: Int) { self.val = val; self.next = nil; }\n * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }\n * }\n */\nclass Solution {\n func spiralMatrix(_ m: Int, _ n: Int, _ head: ListNode?) -> [[Int]] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "/**\n * Definition for singly-linked list.\n * type ListNode struct {\n * Val int\n * Next *ListNode\n * }\n */\nfunc spiralMatrix(m int, n int, head *ListNode) [][]int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode(_x: Int = 0, _next: ListNode = null) {\n * var next: ListNode = _next\n * var x: Int = _x\n * }\n */\nobject Solution {\n def spiralMatrix(m: Int, n: Int, head: ListNode): Array[Array[Int]] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "/**\n * Example:\n * var li = ListNode(5)\n * var v = li.`val`\n * Definition for singly-linked list.\n * class ListNode(var `val`: Int) {\n * var next: ListNode? = null\n * }\n */\nclass Solution {\n fun spiralMatrix(m: Int, n: Int, head: ListNode?): Array {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "// Definition for singly-linked list.\n// #[derive(PartialEq, Eq, Clone, Debug)]\n// pub struct ListNode {\n// pub val: i32,\n// pub next: Option>\n// }\n// \n// impl ListNode {\n// #[inline]\n// fn new(val: i32) -> Self {\n// ListNode {\n// next: None,\n// val\n// }\n// }\n// }\nimpl Solution {\n pub fn spiral_matrix(m: i32, n: i32, head: Option>) -> Vec> {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "/**\n * Definition for a singly-linked list.\n * class ListNode {\n * public $val = 0;\n * public $next = null;\n * function __construct($val = 0, $next = null) {\n * $this->val = $val;\n * $this->next = $next;\n * }\n * }\n */\nclass Solution {\n\n /**\n * @param Integer $m\n * @param Integer $n\n * @param ListNode $head\n * @return Integer[][]\n */\n function spiralMatrix($m, $n, $head) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode {\n * val: number\n * next: ListNode | null\n * constructor(val?: number, next?: ListNode | null) {\n * this.val = (val===undefined ? 0 : val)\n * this.next = (next===undefined ? null : next)\n * }\n * }\n */\n\nfunction spiralMatrix(m: number, n: number, head: ListNode | null): number[][] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "; Definition for singly-linked list:\n#|\n\n; val : integer?\n; next : (or/c list-node? #f)\n(struct list-node\n (val next) #:mutable #:transparent)\n\n; constructor\n(define (make-list-node [val 0])\n (list-node val #f))\n\n|#\n\n(define/contract (spiral-matrix m n head)\n (-> exact-integer? exact-integer? (or/c list-node? #f) (listof (listof exact-integer?)))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "%% Definition for singly-linked list.\n%%\n%% -record(list_node, {val = 0 :: integer(),\n%% next = null :: 'null' | #list_node{}}).\n\n-spec spiral_matrix(M :: integer(), N :: integer(), Head :: #list_node{} | null) -> [[integer()]].\nspiral_matrix(M, N, Head) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "# Definition for singly-linked list.\n#\n# defmodule ListNode do\n# @type t :: %__MODULE__{\n# val: integer,\n# next: ListNode.t() | nil\n# }\n# defstruct val: 0, next: nil\n# end\n\ndefmodule Solution do\n @spec spiral_matrix(m :: integer, n :: integer, head :: ListNode.t | nil) :: [[integer]]\n def spiral_matrix(m, n, head) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"16.3K\", \"totalSubmission\": \"22K\", \"totalAcceptedRaw\": 16310, \"totalSubmissionRaw\": 22011, \"acRate\": \"74.1%\"}", + "hints": [ + "First, generate an m x n matrix filled with -1s.", + "Navigate within the matrix at (i, j) with the help of a direction vector ⟨di, dj⟩. At (i, j), you need to decide if you can keep going in the current direction.", + "If you cannot keep going, rotate the direction vector clockwise by 90 degrees." + ], + "solution": null, + "status": null, + "sampleTestCase": "3\n5\n[3,0,2,6,8,1,7,9,4,2,5,5,0]", + "metaData": "{\n \"name\": \"spiralMatrix\",\n \"params\": [\n {\n \"name\": \"m\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"n\"\n },\n {\n \"type\": \"ListNode\",\n \"name\": \"head\"\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/subarray-with-elements-greater-than-varying-threshold.json b/leetcode/originData/subarray-with-elements-greater-than-varying-threshold.json new file mode 100644 index 00000000..8f4876a7 --- /dev/null +++ b/leetcode/originData/subarray-with-elements-greater-than-varying-threshold.json @@ -0,0 +1,156 @@ +{ + "data": { + "question": { + "questionId": "2419", + "questionFrontendId": "2334", + "boundTopicId": null, + "title": "Subarray With Elements Greater Than Varying Threshold", + "titleSlug": "subarray-with-elements-greater-than-varying-threshold", + "content": "

You are given an integer array nums and an integer threshold.

\n\n

Find any subarray of nums of length k such that every element in the subarray is greater than threshold / k.

\n\n

Return the size of any such subarray. If there is no such subarray, return -1.

\n\n

A subarray is a contiguous non-empty sequence of elements within an array.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,3,4,3,1], threshold = 6\nOutput: 3\nExplanation: The subarray [3,4,3] has a size of 3, and every element is greater than 6 / 3 = 2.\nNote that this is the only valid subarray.\n
\n\n

Example 2:

\n\n
\nInput: nums = [6,5,6,5,8], threshold = 7\nOutput: 1\nExplanation: The subarray [8] has a size of 1, and 8 > 7 / 1 = 7. So 1 is returned.\nNote that the subarray [6,5] has a size of 2, and every element is greater than 7 / 2 = 3.5. \nSimilarly, the subarrays [6,5,6], [6,5,6,5], [6,5,6,5,8] also satisfy the given conditions.\nTherefore, 2, 3, 4, or 5 may also be returned.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i], threshold <= 109
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 203, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Maximum Subarray Min-Product\", \"titleSlug\": \"maximum-subarray-min-product\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Smallest K-Length Subsequence With Occurrences of a Letter\", \"titleSlug\": \"smallest-k-length-subsequence-with-occurrences-of-a-letter\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"K Divisible Elements Subarrays\", \"titleSlug\": \"k-divisible-elements-subarrays\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,3,4,3,1]\n6\n[6,5,6,5,8]\n7", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int validSubarraySize(vector& nums, int threshold) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int validSubarraySize(int[] nums, int threshold) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def validSubarraySize(self, nums, threshold):\n \"\"\"\n :type nums: List[int]\n :type threshold: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def validSubarraySize(self, nums: List[int], threshold: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint validSubarraySize(int* nums, int numsSize, int threshold){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int ValidSubarraySize(int[] nums, int threshold) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} threshold\n * @return {number}\n */\nvar validSubarraySize = function(nums, threshold) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} threshold\n# @return {Integer}\ndef valid_subarray_size(nums, threshold)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func validSubarraySize(_ nums: [Int], _ threshold: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func validSubarraySize(nums []int, threshold int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def validSubarraySize(nums: Array[Int], threshold: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun validSubarraySize(nums: IntArray, threshold: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn valid_subarray_size(nums: Vec, threshold: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $threshold\n * @return Integer\n */\n function validSubarraySize($nums, $threshold) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function validSubarraySize(nums: number[], threshold: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (valid-subarray-size nums threshold)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec valid_subarray_size(Nums :: [integer()], Threshold :: integer()) -> integer().\nvalid_subarray_size(Nums, Threshold) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec valid_subarray_size(nums :: [integer], threshold :: integer) :: integer\n def valid_subarray_size(nums, threshold) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"6.9K\", \"totalAcceptedRaw\": 2489, \"totalSubmissionRaw\": 6883, \"acRate\": \"36.2%\"}", + "hints": [ + "For all elements to be greater than the threshold/length, the minimum element in the subarray must be greater than the threshold/length.", + "For a given index, could you find the largest subarray such that the given index is the minimum element?", + "Could you use a monotonic stack to get the next and previous smallest element for every index?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,4,3,1]\n6", + "metaData": "{\n \"name\": \"validSubarraySize\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"threshold\"\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/the-latest-time-to-catch-a-bus.json b/leetcode/originData/the-latest-time-to-catch-a-bus.json new file mode 100644 index 00000000..cec24212 --- /dev/null +++ b/leetcode/originData/the-latest-time-to-catch-a-bus.json @@ -0,0 +1,155 @@ +{ + "data": { + "question": { + "questionId": "2417", + "questionFrontendId": "2332", + "boundTopicId": null, + "title": "The Latest Time to Catch a Bus", + "titleSlug": "the-latest-time-to-catch-a-bus", + "content": "

You are given a 0-indexed integer array buses of length n, where buses[i] represents the departure time of the ith bus. You are also given a 0-indexed integer array passengers of length m, where passengers[j] represents the arrival time of the jth passenger. All bus departure times are unique. All passenger arrival times are unique.

\n\n

You are given an integer capacity, which represents the maximum number of passengers that can get on each bus.

\n\n

The passengers will get on the next available bus. You can get on a bus that will depart at x minutes if you arrive at y minutes where y <= x, and the bus is not full. Passengers with the earliest arrival times get on the bus first.

\n\n

Return the latest time you may arrive at the bus station to catch a bus. You cannot arrive at the same time as another passenger.

\n\n

Note: The arrays buses and passengers are not necessarily sorted.

\n\n

 

\n

Example 1:

\n\n
\nInput: buses = [10,20], passengers = [2,17,18,19], capacity = 2\nOutput: 16\nExplanation: \nThe 1st bus departs with the 1st passenger. \nThe 2nd bus departs with you and the 2nd passenger.\nNote that you must not arrive at the same time as the passengers, which is why you must arrive before the 2nd passenger to catch the bus.
\n\n

Example 2:

\n\n
\nInput: buses = [20,30,10], passengers = [19,13,26,4,25,11,21], capacity = 2\nOutput: 20\nExplanation: \nThe 1st bus departs with the 4th passenger. \nThe 2nd bus departs with the 6th and 2nd passengers.\nThe 3rd bus departs with the 1st passenger and you.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == buses.length
  • \n\t
  • m == passengers.length
  • \n\t
  • 1 <= n, m, capacity <= 105
  • \n\t
  • 2 <= buses[i], passengers[i] <= 109
  • \n\t
  • Each element in buses is unique.
  • \n\t
  • Each element in passengers is unique.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 138, + "dislikes": 454, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Minimum Speed to Arrive on Time\", \"titleSlug\": \"minimum-speed-to-arrive-on-time\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[10,20]\n[2,17,18,19]\n2\n[20,30,10]\n[19,13,26,4,25,11,21]\n2", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int latestTimeCatchTheBus(vector& buses, vector& passengers, int capacity) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int latestTimeCatchTheBus(int[] buses, int[] passengers, int capacity) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def latestTimeCatchTheBus(self, buses, passengers, capacity):\n \"\"\"\n :type buses: List[int]\n :type passengers: List[int]\n :type capacity: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def latestTimeCatchTheBus(self, buses: List[int], passengers: List[int], capacity: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint latestTimeCatchTheBus(int* buses, int busesSize, int* passengers, int passengersSize, int capacity){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int LatestTimeCatchTheBus(int[] buses, int[] passengers, int capacity) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} buses\n * @param {number[]} passengers\n * @param {number} capacity\n * @return {number}\n */\nvar latestTimeCatchTheBus = function(buses, passengers, capacity) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} buses\n# @param {Integer[]} passengers\n# @param {Integer} capacity\n# @return {Integer}\ndef latest_time_catch_the_bus(buses, passengers, capacity)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func latestTimeCatchTheBus(_ buses: [Int], _ passengers: [Int], _ capacity: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func latestTimeCatchTheBus(buses []int, passengers []int, capacity int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def latestTimeCatchTheBus(buses: Array[Int], passengers: Array[Int], capacity: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun latestTimeCatchTheBus(buses: IntArray, passengers: IntArray, capacity: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn latest_time_catch_the_bus(buses: Vec, passengers: Vec, capacity: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $buses\n * @param Integer[] $passengers\n * @param Integer $capacity\n * @return Integer\n */\n function latestTimeCatchTheBus($buses, $passengers, $capacity) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function latestTimeCatchTheBus(buses: number[], passengers: number[], capacity: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (latest-time-catch-the-bus buses passengers capacity)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec latest_time_catch_the_bus(Buses :: [integer()], Passengers :: [integer()], Capacity :: integer()) -> integer().\nlatest_time_catch_the_bus(Buses, Passengers, Capacity) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec latest_time_catch_the_bus(buses :: [integer], passengers :: [integer], capacity :: integer) :: integer\n def latest_time_catch_the_bus(buses, passengers, capacity) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"7.4K\", \"totalSubmission\": \"36.7K\", \"totalAcceptedRaw\": 7369, \"totalSubmissionRaw\": 36736, \"acRate\": \"20.1%\"}", + "hints": [ + "Sort the buses and passengers arrays.", + "Use 2 pointers to traverse buses and passengers with a simulation of passengers getting on a particular bus." + ], + "solution": null, + "status": null, + "sampleTestCase": "[10,20]\n[2,17,18,19]\n2", + "metaData": "{\n \"name\": \"latestTimeCatchTheBus\",\n \"params\": [\n {\n \"name\": \"buses\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"passengers\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"capacity\"\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/array-partition.html b/leetcode/problem/array-partition.html new file mode 100644 index 00000000..a1780f7c --- /dev/null +++ b/leetcode/problem/array-partition.html @@ -0,0 +1,30 @@ +

Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,4,3,2]
+Output: 4
+Explanation: All possible pairings (ignoring the ordering of elements) are:
+1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3
+2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3
+3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4
+So the maximum possible sum is 4.
+ +

Example 2:

+ +
+Input: nums = [6,2,6,5,1,2]
+Output: 9
+Explanation: The optimal pairing is (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
  • +
  • nums.length == 2 * n
  • +
  • -104 <= nums[i] <= 104
  • +
diff --git a/leetcode/problem/count-the-number-of-ideal-arrays.html b/leetcode/problem/count-the-number-of-ideal-arrays.html new file mode 100644 index 00000000..44f2ebe0 --- /dev/null +++ b/leetcode/problem/count-the-number-of-ideal-arrays.html @@ -0,0 +1,48 @@ +

You are given two integers n and maxValue, which are used to describe an ideal array.

+ +

A 0-indexed integer array arr of length n is considered ideal if the following conditions hold:

+ +
    +
  • Every arr[i] is a value from 1 to maxValue, for 0 <= i < n.
  • +
  • Every arr[i] is divisible by arr[i - 1], for 0 < i < n.
  • +
+ +

Return the number of distinct ideal arrays of length n. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 2, maxValue = 5
+Output: 10
+Explanation: The following are the possible ideal arrays:
+- Arrays starting with the value 1 (5 arrays): [1,1], [1,2], [1,3], [1,4], [1,5]
+- Arrays starting with the value 2 (2 arrays): [2,2], [2,4]
+- Arrays starting with the value 3 (1 array): [3,3]
+- Arrays starting with the value 4 (1 array): [4,4]
+- Arrays starting with the value 5 (1 array): [5,5]
+There are a total of 5 + 2 + 1 + 1 + 1 = 10 distinct ideal arrays.
+
+ +

Example 2:

+ +
+Input: n = 5, maxValue = 3
+Output: 11
+Explanation: The following are the possible ideal arrays:
+- Arrays starting with the value 1 (9 arrays): 
+   - With no other distinct values (1 array): [1,1,1,1,1] 
+   - With 2nd distinct value 2 (4 arrays): [1,1,1,1,2], [1,1,1,2,2], [1,1,2,2,2], [1,2,2,2,2]
+   - With 2nd distinct value 3 (4 arrays): [1,1,1,1,3], [1,1,1,3,3], [1,1,3,3,3], [1,3,3,3,3]
+- Arrays starting with the value 2 (1 array): [2,2,2,2,2]
+- Arrays starting with the value 3 (1 array): [3,3,3,3,3]
+There are a total of 9 + 1 + 1 = 11 distinct ideal arrays.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 104
  • +
  • 1 <= maxValue <= 104
  • +
diff --git a/leetcode/problem/decode-the-message.html b/leetcode/problem/decode-the-message.html new file mode 100644 index 00000000..3889cd80 --- /dev/null +++ b/leetcode/problem/decode-the-message.html @@ -0,0 +1,44 @@ +

You are given the strings key and message, which represent a cipher key and a secret message, respectively. The steps to decode message are as follows:

+ +
    +
  1. Use the first appearance of all 26 lowercase English letters in key as the order of the substitution table.
  2. +
  3. Align the substitution table with the regular English alphabet.
  4. +
  5. Each letter in message is then substituted using the table.
  6. +
  7. Spaces ' ' are transformed to themselves.
  8. +
+ +
    +
  • For example, given key = "happy boy" (actual key would have at least one instance of each letter in the alphabet), we have the partial substitution table of ('h' -> 'a', 'a' -> 'b', 'p' -> 'c', 'y' -> 'd', 'b' -> 'e', 'o' -> 'f').
  • +
+ +

Return the decoded message.

+ +

 

+

Example 1:

+ +
+Input: key = "the quick brown fox jumps over the lazy dog", message = "vkbs bs t suepuv"
+Output: "this is a secret"
+Explanation: The diagram above shows the substitution table.
+It is obtained by taking the first appearance of each letter in "the quick brown fox jumps over the lazy dog".
+
+ +

Example 2:

+ +
+Input: key = "eljuxhpwnyrdgtqkviszcfmabo", message = "zwx hnfx lqantp mnoeius ycgk vcnjrdb"
+Output: "the five boxing wizards jump quickly"
+Explanation: The diagram above shows the substitution table.
+It is obtained by taking the first appearance of each letter in "eljuxhpwnyrdgtqkviszcfmabo".
+
+ +

 

+

Constraints:

+ +
    +
  • 26 <= key.length <= 2000
  • +
  • key consists of lowercase English letters and ' '.
  • +
  • key contains every letter in the English alphabet ('a' to 'z') at least once.
  • +
  • 1 <= message.length <= 2000
  • +
  • message consists of lowercase English letters and ' '.
  • +
diff --git a/leetcode/problem/evaluate-boolean-binary-tree.html b/leetcode/problem/evaluate-boolean-binary-tree.html new file mode 100644 index 00000000..6a7844aa --- /dev/null +++ b/leetcode/problem/evaluate-boolean-binary-tree.html @@ -0,0 +1,49 @@ +

You are given the root of a full binary tree with the following properties:

+ +
    +
  • Leaf nodes have either the value 0 or 1, where 0 represents False and 1 represents True.
  • +
  • Non-leaf nodes have either the value 2 or 3, where 2 represents the boolean OR and 3 represents the boolean AND.
  • +
+ +

The evaluation of a node is as follows:

+ +
    +
  • If the node is a leaf node, the evaluation is the value of the node, i.e. True or False.
  • +
  • Otherwise, evaluate the node's two children and apply the boolean operation of its value with the children's evaluations.
  • +
+ +

Return the boolean result of evaluating the root node.

+ +

A full binary tree is a binary tree where each node has either 0 or 2 children.

+ +

A leaf node is a node that has zero children.

+ +

 

+

Example 1:

+ +
+Input: root = [2,1,3,null,null,0,1]
+Output: true
+Explanation: The above diagram illustrates the evaluation process.
+The AND node evaluates to False AND True = False.
+The OR node evaluates to True OR False = True.
+The root node evaluates to True, so we return true.
+ +

Example 2:

+ +
+Input: root = [0]
+Output: false
+Explanation: The root node is a leaf node and it evaluates to false, so we return false.
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the tree is in the range [1, 1000].
  • +
  • 0 <= Node.val <= 3
  • +
  • Every node has either 0 or 2 children.
  • +
  • Leaf nodes have a value of 0 or 1.
  • +
  • Non-leaf nodes have a value of 2 or 3.
  • +
diff --git a/leetcode/problem/minimum-amount-of-time-to-fill-cups.html b/leetcode/problem/minimum-amount-of-time-to-fill-cups.html new file mode 100644 index 00000000..c11fb2a7 --- /dev/null +++ b/leetcode/problem/minimum-amount-of-time-to-fill-cups.html @@ -0,0 +1,48 @@ +

You have a water dispenser that can dispense cold, warm, and hot water. Every second, you can either fill up 2 cups with different types of water, or 1 cup of any type of water.

+ +

You are given a 0-indexed integer array amount of length 3 where amount[0], amount[1], and amount[2] denote the number of cold, warm, and hot water cups you need to fill respectively. Return the minimum number of seconds needed to fill up all the cups.

+ +

 

+

Example 1:

+ +
+Input: amount = [1,4,2]
+Output: 4
+Explanation: One way to fill up the cups is:
+Second 1: Fill up a cold cup and a warm cup.
+Second 2: Fill up a warm cup and a hot cup.
+Second 3: Fill up a warm cup and a hot cup.
+Second 4: Fill up a warm cup.
+It can be proven that 4 is the minimum number of seconds needed.
+
+ +

Example 2:

+ +
+Input: amount = [5,4,4]
+Output: 7
+Explanation: One way to fill up the cups is:
+Second 1: Fill up a cold cup, and a hot cup.
+Second 2: Fill up a cold cup, and a warm cup.
+Second 3: Fill up a cold cup, and a warm cup.
+Second 4: Fill up a warm cup, and a hot cup.
+Second 5: Fill up a cold cup, and a hot cup.
+Second 6: Fill up a cold cup, and a warm cup.
+Second 7: Fill up a hot cup.
+
+ +

Example 3:

+ +
+Input: amount = [5,0,0]
+Output: 5
+Explanation: Every second, we fill up a cold cup.
+
+ +

 

+

Constraints:

+ +
    +
  • amount.length == 3
  • +
  • 0 <= amount[i] <= 100
  • +
diff --git a/leetcode/problem/minimum-sum-of-squared-difference.html b/leetcode/problem/minimum-sum-of-squared-difference.html new file mode 100644 index 00000000..826e374b --- /dev/null +++ b/leetcode/problem/minimum-sum-of-squared-difference.html @@ -0,0 +1,41 @@ +

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

+ +

The sum of squared difference of arrays nums1 and nums2 is defined as the sum of (nums1[i] - nums2[i])2 for each 0 <= i < n.

+ +

You are also given two positive integers k1 and k2. You can modify any of the elements of nums1 by +1 or -1 at most k1 times. Similarly, you can modify any of the elements of nums2 by +1 or -1 at most k2 times.

+ +

Return the minimum sum of squared difference after modifying array nums1 at most k1 times and modifying array nums2 at most k2 times.

+ +

Note: You are allowed to modify the array elements to become negative integers.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3,4], nums2 = [2,10,20,19], k1 = 0, k2 = 0
+Output: 579
+Explanation: The elements in nums1 and nums2 cannot be modified because k1 = 0 and k2 = 0. 
+The sum of square difference will be: (1 - 2)2 + (2 - 10)2 + (3 - 20)2 + (4 - 19)2 = 579.
+
+ +

Example 2:

+ +
+Input: nums1 = [1,4,10,12], nums2 = [5,8,6,9], k1 = 1, k2 = 1
+Output: 43
+Explanation: One way to obtain the minimum sum of square difference is: 
+- Increase nums1[0] once.
+- Increase nums2[2] once.
+The minimum of the sum of square difference will be: 
+(2 - 5)2 + (4 - 8)2 + (10 - 7)2 + (12 - 9)2 = 43.
+Note that, there are other ways to obtain the minimum of the sum of square difference, but there is no way to obtain a sum smaller than 43.
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 1 <= n <= 105
  • +
  • 0 <= nums1[i], nums2[i] <= 105
  • +
  • 0 <= k1, k2 <= 109
  • +
diff --git a/leetcode/problem/move-pieces-to-obtain-a-string.html b/leetcode/problem/move-pieces-to-obtain-a-string.html new file mode 100644 index 00000000..815eb798 --- /dev/null +++ b/leetcode/problem/move-pieces-to-obtain-a-string.html @@ -0,0 +1,46 @@ +

You are given two strings start and target, both of length n. Each string consists only of the characters 'L', 'R', and '_' where:

+ +
    +
  • The characters 'L' and 'R' represent pieces, where a piece 'L' can move to the left only if there is a blank space directly to its left, and a piece 'R' can move to the right only if there is a blank space directly to its right.
  • +
  • The character '_' represents a blank space that can be occupied by any of the 'L' or 'R' pieces.
  • +
+ +

Return true if it is possible to obtain the string target by moving the pieces of the string start any number of times. Otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: start = "_L__R__R_", target = "L______RR"
+Output: true
+Explanation: We can obtain the string target from start by doing the following moves:
+- Move the first piece one step to the left, start becomes equal to "L___R__R_".
+- Move the last piece one step to the right, start becomes equal to "L___R___R".
+- Move the second piece three steps to the right, start becomes equal to "L______RR".
+Since it is possible to get the string target from start, we return true.
+
+ +

Example 2:

+ +
+Input: start = "R_L_", target = "__LR"
+Output: false
+Explanation: The 'R' piece in the string start can move one step to the right to obtain "_RL_".
+After that, no pieces can move anymore, so it is impossible to obtain the string target from start.
+
+ +

Example 3:

+ +
+Input: start = "_R", target = "R_"
+Output: false
+Explanation: The piece in the string start can move only to the right, so it is impossible to obtain the string target from start.
+ +

 

+

Constraints:

+ +
    +
  • n == start.length == target.length
  • +
  • 1 <= n <= 105
  • +
  • start and target consist of the characters 'L', 'R', and '_'.
  • +
diff --git a/leetcode/problem/number-of-increasing-paths-in-a-grid.html b/leetcode/problem/number-of-increasing-paths-in-a-grid.html new file mode 100644 index 00000000..3afd0789 --- /dev/null +++ b/leetcode/problem/number-of-increasing-paths-in-a-grid.html @@ -0,0 +1,40 @@ +

You are given an m x n integer matrix grid, where you can move from a cell to any adjacent cell in all 4 directions.

+ +

Return the number of strictly increasing paths in the grid such that you can start from any cell and end at any cell. Since the answer may be very large, return it modulo 109 + 7.

+ +

Two paths are considered different if they do not have exactly the same sequence of visited cells.

+ +

 

+

Example 1:

+ +
+Input: grid = [[1,1],[3,4]]
+Output: 8
+Explanation: The strictly increasing paths are:
+- Paths with length 1: [1], [1], [3], [4].
+- Paths with length 2: [1 -> 3], [1 -> 4], [3 -> 4].
+- Paths with length 3: [1 -> 3 -> 4].
+The total number of paths is 4 + 3 + 1 = 8.
+
+ +

Example 2:

+ +
+Input: grid = [[1],[2]]
+Output: 3
+Explanation: The strictly increasing paths are:
+- Paths with length 1: [1], [2].
+- Paths with length 2: [1 -> 2].
+The total number of paths is 2 + 1 = 3.
+
+ +

 

+

Constraints:

+ +
    +
  • m == grid.length
  • +
  • n == grid[i].length
  • +
  • 1 <= m, n <= 1000
  • +
  • 1 <= m * n <= 105
  • +
  • 1 <= grid[i][j] <= 105
  • +
diff --git a/leetcode/problem/number-of-people-aware-of-a-secret.html b/leetcode/problem/number-of-people-aware-of-a-secret.html new file mode 100644 index 00000000..663381d0 --- /dev/null +++ b/leetcode/problem/number-of-people-aware-of-a-secret.html @@ -0,0 +1,40 @@ +

On day 1, one person discovers a secret.

+ +

You are given an integer delay, which means that each person will share the secret with a new person every day, starting from delay days after discovering the secret. You are also given an integer forget, which means that each person will forget the secret forget days after discovering it. A person cannot share the secret on the same day they forgot it, or on any day afterwards.

+ +

Given an integer n, return the number of people who know the secret at the end of day n. Since the answer may be very large, return it modulo 109 + 7.

+ +

 

+

Example 1:

+ +
+Input: n = 6, delay = 2, forget = 4
+Output: 5
+Explanation:
+Day 1: Suppose the first person is named A. (1 person)
+Day 2: A is the only person who knows the secret. (1 person)
+Day 3: A shares the secret with a new person, B. (2 people)
+Day 4: A shares the secret with a new person, C. (3 people)
+Day 5: A forgets the secret, and B shares the secret with a new person, D. (3 people)
+Day 6: B shares the secret with E, and C shares the secret with F. (5 people)
+
+ +

Example 2:

+ +
+Input: n = 4, delay = 1, forget = 3
+Output: 6
+Explanation:
+Day 1: The first person is named A. (1 person)
+Day 2: A shares the secret with B. (2 people)
+Day 3: A and B share the secret with 2 new people, C and D. (4 people)
+Day 4: A forgets the secret. B, C, and D share the secret with 3 new people. (6 people)
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= n <= 1000
  • +
  • 1 <= delay < forget <= n
  • +
diff --git a/leetcode/problem/smallest-number-in-infinite-set.html b/leetcode/problem/smallest-number-in-infinite-set.html new file mode 100644 index 00000000..2d99f9ad --- /dev/null +++ b/leetcode/problem/smallest-number-in-infinite-set.html @@ -0,0 +1,40 @@ +

You have a set which contains all positive integers [1, 2, 3, 4, 5, ...].

+ +

Implement the SmallestInfiniteSet class:

+ +
    +
  • SmallestInfiniteSet() Initializes the SmallestInfiniteSet object to contain all positive integers.
  • +
  • int popSmallest() Removes and returns the smallest integer contained in the infinite set.
  • +
  • void addBack(int num) Adds a positive integer num back into the infinite set, if it is not already in the infinite set.
  • +
+ +

 

+

Example 1:

+ +
+Input
+["SmallestInfiniteSet", "addBack", "popSmallest", "popSmallest", "popSmallest", "addBack", "popSmallest", "popSmallest", "popSmallest"]
+[[], [2], [], [], [], [1], [], [], []]
+Output
+[null, null, 1, 2, 3, null, 1, 4, 5]
+
+Explanation
+SmallestInfiniteSet smallestInfiniteSet = new SmallestInfiniteSet();
+smallestInfiniteSet.addBack(2);    // 2 is already in the set, so no change is made.
+smallestInfiniteSet.popSmallest(); // return 1, since 1 is the smallest number, and remove it from the set.
+smallestInfiniteSet.popSmallest(); // return 2, and remove it from the set.
+smallestInfiniteSet.popSmallest(); // return 3, and remove it from the set.
+smallestInfiniteSet.addBack(1);    // 1 is added back to the set.
+smallestInfiniteSet.popSmallest(); // return 1, since 1 was added back to the set and
+                                   // is the smallest number, and remove it from the set.
+smallestInfiniteSet.popSmallest(); // return 4, and remove it from the set.
+smallestInfiniteSet.popSmallest(); // return 5, and remove it from the set.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= num <= 1000
  • +
  • At most 1000 calls will be made in total to popSmallest and addBack.
  • +
diff --git a/leetcode/problem/spiral-matrix-iv.html b/leetcode/problem/spiral-matrix-iv.html new file mode 100644 index 00000000..97f87499 --- /dev/null +++ b/leetcode/problem/spiral-matrix-iv.html @@ -0,0 +1,35 @@ +

You are given two integers m and n, which represent the dimensions of a matrix.

+ +

You are also given the head of a linked list of integers.

+ +

Generate an m x n matrix that contains the integers in the linked list presented in spiral order (clockwise), starting from the top-left of the matrix. If there are remaining empty spaces, fill them with -1.

+ +

Return the generated matrix.

+ +

 

+

Example 1:

+ +
+Input: m = 3, n = 5, head = [3,0,2,6,8,1,7,9,4,2,5,5,0]
+Output: [[3,0,2,6,8],[5,0,-1,-1,1],[5,2,4,9,7]]
+Explanation: The diagram above shows how the values are printed in the matrix.
+Note that the remaining spaces in the matrix are filled with -1.
+
+ +

Example 2:

+ +
+Input: m = 1, n = 4, head = [0,1,2]
+Output: [[0,1,2,-1]]
+Explanation: The diagram above shows how the values are printed from left to right in the matrix.
+The last space in the matrix is set to -1.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 105
  • +
  • 1 <= m * n <= 105
  • +
  • The number of nodes in the list is in the range [1, m * n].
  • +
  • 0 <= Node.val <= 1000
  • +
diff --git a/leetcode/problem/subarray-with-elements-greater-than-varying-threshold.html b/leetcode/problem/subarray-with-elements-greater-than-varying-threshold.html new file mode 100644 index 00000000..740b0b4c --- /dev/null +++ b/leetcode/problem/subarray-with-elements-greater-than-varying-threshold.html @@ -0,0 +1,35 @@ +

You are given an integer array nums and an integer threshold.

+ +

Find any subarray of nums of length k such that every element in the subarray is greater than threshold / k.

+ +

Return the size of any such subarray. If there is no such subarray, return -1.

+ +

A subarray is a contiguous non-empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,4,3,1], threshold = 6
+Output: 3
+Explanation: The subarray [3,4,3] has a size of 3, and every element is greater than 6 / 3 = 2.
+Note that this is the only valid subarray.
+
+ +

Example 2:

+ +
+Input: nums = [6,5,6,5,8], threshold = 7
+Output: 1
+Explanation: The subarray [8] has a size of 1, and 8 > 7 / 1 = 7. So 1 is returned.
+Note that the subarray [6,5] has a size of 2, and every element is greater than 7 / 2 = 3.5. 
+Similarly, the subarrays [6,5,6], [6,5,6,5], [6,5,6,5,8] also satisfy the given conditions.
+Therefore, 2, 3, 4, or 5 may also be returned.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i], threshold <= 109
  • +
diff --git a/leetcode/problem/the-latest-time-to-catch-a-bus.html b/leetcode/problem/the-latest-time-to-catch-a-bus.html new file mode 100644 index 00000000..2c48a021 --- /dev/null +++ b/leetcode/problem/the-latest-time-to-catch-a-bus.html @@ -0,0 +1,43 @@ +

You are given a 0-indexed integer array buses of length n, where buses[i] represents the departure time of the ith bus. You are also given a 0-indexed integer array passengers of length m, where passengers[j] represents the arrival time of the jth passenger. All bus departure times are unique. All passenger arrival times are unique.

+ +

You are given an integer capacity, which represents the maximum number of passengers that can get on each bus.

+ +

The passengers will get on the next available bus. You can get on a bus that will depart at x minutes if you arrive at y minutes where y <= x, and the bus is not full. Passengers with the earliest arrival times get on the bus first.

+ +

Return the latest time you may arrive at the bus station to catch a bus. You cannot arrive at the same time as another passenger.

+ +

Note: The arrays buses and passengers are not necessarily sorted.

+ +

 

+

Example 1:

+ +
+Input: buses = [10,20], passengers = [2,17,18,19], capacity = 2
+Output: 16
+Explanation: 
+The 1st bus departs with the 1st passenger. 
+The 2nd bus departs with you and the 2nd passenger.
+Note that you must not arrive at the same time as the passengers, which is why you must arrive before the 2nd passenger to catch the bus.
+ +

Example 2:

+ +
+Input: buses = [20,30,10], passengers = [19,13,26,4,25,11,21], capacity = 2
+Output: 20
+Explanation: 
+The 1st bus departs with the 4th passenger. 
+The 2nd bus departs with the 6th and 2nd passengers.
+The 3rd bus departs with the 1st passenger and you.
+
+ +

 

+

Constraints:

+ +
    +
  • n == buses.length
  • +
  • m == passengers.length
  • +
  • 1 <= n, m, capacity <= 105
  • +
  • 2 <= buses[i], passengers[i] <= 109
  • +
  • Each element in buses is unique.
  • +
  • Each element in passengers is unique.
  • +