From 9d367dc01ffd6068de42075ca338130387233c3c 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: Mon, 23 Jan 2023 20:16:24 +0800 Subject: [PATCH] update --- README.md | 2 +- leetcode-cn/origin-data.json | 14922 ++++++++-------- ...count-the-number-of-good-subsequences.json | 50 + ... content]time-taken-to-cross-the-door.json | 68 + .../originData/alternating-digit-sum.json | 165 + ...wise-operations-to-make-strings-equal.json | 164 + .../check-if-point-is-reachable.json | 166 + .../count-the-number-of-good-subarrays.json | 185 + ...element-sum-and-digit-sum-of-an-array.json | 177 + ...between-maximum-and-minimum-price-sum.json | 186 + .../increment-submatrices-by-one.json | 184 + .../originData/maximum-subsequence-score.json | 165 + .../originData/minimum-common-value.json | 164 + .../minimum-cost-to-split-an-array.json | 166 + ...mum-operations-to-make-array-equal-ii.json | 164 + .../sort-the-students-by-their-kth-score.json | 164 + .../交替数字和 [alternating-digit-sum].html | 43 + ...作数 II [minimum-operations-to-make-array-equal-ii].html | 38 + ...是否可以到达 [check-if-point-is-reachable].html | 36 + ...元素加 1 [increment-submatrices-by-one].html | 44 + ... [apply-bitwise-operations-to-make-strings-equal].html | 39 + ...最小代价 [minimum-cost-to-split-an-array].html | 65 + ...nce-between-element-sum-and-digit-sum-of-an-array].html | 43 + ... [difference-between-maximum-and-minimum-price-sum].html | 50 + ...序列的分数 [maximum-subsequence-score].html | 46 + .../最小公共值 [minimum-common-value].html | 29 + ...数排序 [sort-the-students-by-their-kth-score].html | 45 + ...的数目 [count-the-number-of-good-subarrays].html | 34 + ...数字和(English) [alternating-digit-sum].html | 49 + ...(English) [minimum-operations-to-make-array-equal-ii].html | 38 + ...以到达(English) [check-if-point-is-reachable].html | 36 + ... 1(English) [increment-submatrices-by-one].html | 39 + ... [apply-bitwise-operations-to-make-strings-equal].html | 39 + ...价(English) [minimum-cost-to-split-an-array].html | 70 + ...nce-between-element-sum-and-digit-sum-of-an-array].html | 41 + ... [difference-between-maximum-and-minimum-price-sum].html | 44 + ...分数(English) [maximum-subsequence-score].html | 46 + ...公共值(English) [minimum-common-value].html | 29 + ...(English) [sort-the-students-by-their-kth-score].html | 39 + ...(English) [count-the-number-of-good-subarrays].html | 34 + leetcode/origin-data.json | 10502 +++++------ ...count-the-number-of-good-subsequences.json | 47 + ... content]time-taken-to-cross-the-door.json | 65 + .../originData/alternating-digit-sum.json | 162 + ...wise-operations-to-make-strings-equal.json | 161 + .../check-if-point-is-reachable.json | 163 + .../count-the-number-of-good-subarrays.json | 182 + ...element-sum-and-digit-sum-of-an-array.json | 174 + ...between-maximum-and-minimum-price-sum.json | 183 + .../increment-submatrices-by-one.json | 181 + .../originData/maximum-subsequence-score.json | 162 + leetcode/originData/minimum-common-value.json | 161 + .../minimum-cost-to-split-an-array.json | 163 + ...mum-operations-to-make-array-equal-ii.json | 161 + .../sort-the-students-by-their-kth-score.json | 161 + leetcode/problem/alternating-digit-sum.html | 49 + ...wise-operations-to-make-strings-equal.html | 39 + .../problem/check-if-point-is-reachable.html | 36 + .../count-the-number-of-good-subarrays.html | 34 + ...element-sum-and-digit-sum-of-an-array.html | 41 + ...between-maximum-and-minimum-price-sum.html | 44 + .../problem/increment-submatrices-by-one.html | 39 + .../problem/maximum-subsequence-score.html | 46 + leetcode/problem/minimum-common-value.html | 29 + .../minimum-cost-to-split-an-array.html | 70 + ...mum-operations-to-make-array-equal-ii.html | 38 + .../sort-the-students-by-their-kth-score.html | 39 + 67 files changed, 18835 insertions(+), 12405 deletions(-) create mode 100644 leetcode-cn/originData/[no content]count-the-number-of-good-subsequences.json create mode 100644 leetcode-cn/originData/[no content]time-taken-to-cross-the-door.json create mode 100644 leetcode-cn/originData/alternating-digit-sum.json create mode 100644 leetcode-cn/originData/apply-bitwise-operations-to-make-strings-equal.json create mode 100644 leetcode-cn/originData/check-if-point-is-reachable.json create mode 100644 leetcode-cn/originData/count-the-number-of-good-subarrays.json create mode 100644 leetcode-cn/originData/difference-between-element-sum-and-digit-sum-of-an-array.json create mode 100644 leetcode-cn/originData/difference-between-maximum-and-minimum-price-sum.json create mode 100644 leetcode-cn/originData/increment-submatrices-by-one.json create mode 100644 leetcode-cn/originData/maximum-subsequence-score.json create mode 100644 leetcode-cn/originData/minimum-common-value.json create mode 100644 leetcode-cn/originData/minimum-cost-to-split-an-array.json create mode 100644 leetcode-cn/originData/minimum-operations-to-make-array-equal-ii.json create mode 100644 leetcode-cn/originData/sort-the-students-by-their-kth-score.json create mode 100644 leetcode-cn/problem (Chinese)/交替数字和 [alternating-digit-sum].html create mode 100644 leetcode-cn/problem (Chinese)/使数组中所有元素相等的最小操作数 II [minimum-operations-to-make-array-equal-ii].html create mode 100644 leetcode-cn/problem (Chinese)/判断一个点是否可以到达 [check-if-point-is-reachable].html create mode 100644 leetcode-cn/problem (Chinese)/子矩阵元素加 1 [increment-submatrices-by-one].html create mode 100644 leetcode-cn/problem (Chinese)/执行逐位运算使字符串相等 [apply-bitwise-operations-to-make-strings-equal].html create mode 100644 leetcode-cn/problem (Chinese)/拆分数组的最小代价 [minimum-cost-to-split-an-array].html create mode 100644 leetcode-cn/problem (Chinese)/数组元素和与数字和的绝对差 [difference-between-element-sum-and-digit-sum-of-an-array].html create mode 100644 leetcode-cn/problem (Chinese)/最大价值和与最小价值和的差值 [difference-between-maximum-and-minimum-price-sum].html create mode 100644 leetcode-cn/problem (Chinese)/最大子序列的分数 [maximum-subsequence-score].html create mode 100644 leetcode-cn/problem (Chinese)/最小公共值 [minimum-common-value].html create mode 100644 leetcode-cn/problem (Chinese)/根据第 K 场考试的分数排序 [sort-the-students-by-their-kth-score].html create mode 100644 leetcode-cn/problem (Chinese)/统计好子数组的数目 [count-the-number-of-good-subarrays].html create mode 100644 leetcode-cn/problem (English)/交替数字和(English) [alternating-digit-sum].html create mode 100644 leetcode-cn/problem (English)/使数组中所有元素相等的最小操作数 II(English) [minimum-operations-to-make-array-equal-ii].html create mode 100644 leetcode-cn/problem (English)/判断一个点是否可以到达(English) [check-if-point-is-reachable].html create mode 100644 leetcode-cn/problem (English)/子矩阵元素加 1(English) [increment-submatrices-by-one].html create mode 100644 leetcode-cn/problem (English)/执行逐位运算使字符串相等(English) [apply-bitwise-operations-to-make-strings-equal].html create mode 100644 leetcode-cn/problem (English)/拆分数组的最小代价(English) [minimum-cost-to-split-an-array].html create mode 100644 leetcode-cn/problem (English)/数组元素和与数字和的绝对差(English) [difference-between-element-sum-and-digit-sum-of-an-array].html create mode 100644 leetcode-cn/problem (English)/最大价值和与最小价值和的差值(English) [difference-between-maximum-and-minimum-price-sum].html create mode 100644 leetcode-cn/problem (English)/最大子序列的分数(English) [maximum-subsequence-score].html create mode 100644 leetcode-cn/problem (English)/最小公共值(English) [minimum-common-value].html create mode 100644 leetcode-cn/problem (English)/根据第 K 场考试的分数排序(English) [sort-the-students-by-their-kth-score].html create mode 100644 leetcode-cn/problem (English)/统计好子数组的数目(English) [count-the-number-of-good-subarrays].html create mode 100644 leetcode/originData/[no content]count-the-number-of-good-subsequences.json create mode 100644 leetcode/originData/[no content]time-taken-to-cross-the-door.json create mode 100644 leetcode/originData/alternating-digit-sum.json create mode 100644 leetcode/originData/apply-bitwise-operations-to-make-strings-equal.json create mode 100644 leetcode/originData/check-if-point-is-reachable.json create mode 100644 leetcode/originData/count-the-number-of-good-subarrays.json create mode 100644 leetcode/originData/difference-between-element-sum-and-digit-sum-of-an-array.json create mode 100644 leetcode/originData/difference-between-maximum-and-minimum-price-sum.json create mode 100644 leetcode/originData/increment-submatrices-by-one.json create mode 100644 leetcode/originData/maximum-subsequence-score.json create mode 100644 leetcode/originData/minimum-common-value.json create mode 100644 leetcode/originData/minimum-cost-to-split-an-array.json create mode 100644 leetcode/originData/minimum-operations-to-make-array-equal-ii.json create mode 100644 leetcode/originData/sort-the-students-by-their-kth-score.json create mode 100644 leetcode/problem/alternating-digit-sum.html create mode 100644 leetcode/problem/apply-bitwise-operations-to-make-strings-equal.html create mode 100644 leetcode/problem/check-if-point-is-reachable.html create mode 100644 leetcode/problem/count-the-number-of-good-subarrays.html create mode 100644 leetcode/problem/difference-between-element-sum-and-digit-sum-of-an-array.html create mode 100644 leetcode/problem/difference-between-maximum-and-minimum-price-sum.html create mode 100644 leetcode/problem/increment-submatrices-by-one.html create mode 100644 leetcode/problem/maximum-subsequence-score.html create mode 100644 leetcode/problem/minimum-common-value.html create mode 100644 leetcode/problem/minimum-cost-to-split-an-array.html create mode 100644 leetcode/problem/minimum-operations-to-make-array-equal-ii.html create mode 100644 leetcode/problem/sort-the-students-by-their-kth-score.html diff --git a/README.md b/README.md index d31d6d13..a9dd5d94 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # 力扣题库(完整版) -> 最后更新日期: **2023.01.14** +> 最后更新日期: **2023.01.23** > > 使用脚本前请务必仔细完整阅读本 `README.md` 文件 diff --git a/leetcode-cn/origin-data.json b/leetcode-cn/origin-data.json index 2576b926..4f1824b4 100644 --- a/leetcode-cn/origin-data.json +++ b/leetcode-cn/origin-data.json @@ -1,7 +1,7 @@ { "user_name": "", "num_solved": 0, - "num_total": 2910, + "num_total": 2924, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, @@ -12,8 +12,8 @@ "question__title": "集水器", "question__title_slug": "kskhHQ", "question__hide": false, - "total_acs": 351, - "total_submitted": 714, + "total_acs": 356, + "total_submitted": 719, "total_column_articles": 9, "frontend_question_id": "LCP 71", "is_new_question": false @@ -33,8 +33,8 @@ "question__title": "沙地治理", "question__title_slug": "XxZZjK", "question__hide": false, - "total_acs": 412, - "total_submitted": 1933, + "total_acs": 419, + "total_submitted": 1942, "total_column_articles": 13, "frontend_question_id": "LCP 70", "is_new_question": false @@ -54,8 +54,8 @@ "question__title": "Hello LeetCode!", "question__title_slug": "rMeRt2", "question__hide": false, - "total_acs": 936, - "total_submitted": 3099, + "total_acs": 943, + "total_submitted": 3127, "total_column_articles": 17, "frontend_question_id": "LCP 69", "is_new_question": false @@ -75,9 +75,9 @@ "question__title": "美观的花束", "question__title_slug": "1GxJYY", "question__hide": false, - "total_acs": 2500, - "total_submitted": 5327, - "total_column_articles": 41, + "total_acs": 2540, + "total_submitted": 5373, + "total_column_articles": 42, "frontend_question_id": "LCP 68", "is_new_question": false }, @@ -96,9 +96,9 @@ "question__title": "装饰树", "question__title_slug": "KnLfVT", "question__hide": false, - "total_acs": 3506, - "total_submitted": 3970, - "total_column_articles": 58, + "total_acs": 3623, + "total_submitted": 4095, + "total_column_articles": 59, "frontend_question_id": "LCP 67", "is_new_question": false }, @@ -117,9 +117,9 @@ "question__title": "最小展台数量", "question__title_slug": "600YaG", "question__hide": false, - "total_acs": 3609, - "total_submitted": 4724, - "total_column_articles": 58, + "total_acs": 3666, + "total_submitted": 4806, + "total_column_articles": 60, "frontend_question_id": "LCP 66", "is_new_question": false }, @@ -138,9 +138,9 @@ "question__title": "弹珠游戏", "question__title_slug": "EXvqDp", "question__hide": false, - "total_acs": 3327, - "total_submitted": 13680, - "total_column_articles": 102, + "total_acs": 3358, + "total_submitted": 13739, + "total_column_articles": 103, "frontend_question_id": "LCP 63", "is_new_question": false }, @@ -159,8 +159,8 @@ "question__title": "二叉树灯饰", "question__title_slug": "U7WvvU", "question__hide": false, - "total_acs": 1535, - "total_submitted": 4851, + "total_acs": 1556, + "total_submitted": 4891, "total_column_articles": 46, "frontend_question_id": "LCP 64", "is_new_question": false @@ -180,8 +180,8 @@ "question__title": "舒适的湿度", "question__title_slug": "3aqs1c", "question__hide": false, - "total_acs": 771, - "total_submitted": 1862, + "total_acs": 773, + "total_submitted": 1865, "total_column_articles": 14, "frontend_question_id": "LCP 65", "is_new_question": false @@ -201,8 +201,8 @@ "question__title": "交通枢纽", "question__title_slug": "D9PW8w", "question__hide": false, - "total_acs": 4923, - "total_submitted": 8125, + "total_acs": 4957, + "total_submitted": 8185, "total_column_articles": 50, "frontend_question_id": "LCP 62", "is_new_question": false @@ -222,8 +222,8 @@ "question__title": "气温变化趋势", "question__title_slug": "6CE719", "question__hide": false, - "total_acs": 6127, - "total_submitted": 10117, + "total_acs": 6210, + "total_submitted": 10253, "total_column_articles": 66, "frontend_question_id": "LCP 61", "is_new_question": false @@ -243,8 +243,8 @@ "question__title": "积木拼接", "question__title_slug": "De4qBB", "question__hide": false, - "total_acs": 335, - "total_submitted": 1025, + "total_acs": 342, + "total_submitted": 1032, "total_column_articles": 15, "frontend_question_id": "LCP 58", "is_new_question": false @@ -264,8 +264,8 @@ "question__title": "力扣泡泡龙", "question__title_slug": "WInSav", "question__hide": false, - "total_acs": 747, - "total_submitted": 3486, + "total_acs": 759, + "total_submitted": 3524, "total_column_articles": 26, "frontend_question_id": "LCP 60", "is_new_question": false @@ -285,8 +285,8 @@ "question__title": "搭桥过河", "question__title_slug": "NfY1m5", "question__hide": false, - "total_acs": 200, - "total_submitted": 661, + "total_acs": 205, + "total_submitted": 672, "total_column_articles": 9, "frontend_question_id": "LCP 59", "is_new_question": false @@ -306,8 +306,8 @@ "question__title": "打地鼠", "question__title_slug": "ZbAuEH", "question__hide": false, - "total_acs": 1744, - "total_submitted": 6630, + "total_acs": 1757, + "total_submitted": 6648, "total_column_articles": 37, "frontend_question_id": "LCP 57", "is_new_question": false @@ -327,8 +327,8 @@ "question__title": "信物传送", "question__title_slug": "6UEx57", "question__hide": false, - "total_acs": 2196, - "total_submitted": 5315, + "total_acs": 2212, + "total_submitted": 5337, "total_column_articles": 62, "frontend_question_id": "LCP 56", "is_new_question": false @@ -348,8 +348,8 @@ "question__title": "采集果实", "question__title_slug": "PTXy4P", "question__hide": false, - "total_acs": 4444, - "total_submitted": 6064, + "total_acs": 4488, + "total_submitted": 6116, "total_column_articles": 69, "frontend_question_id": "LCP 55", "is_new_question": false @@ -369,8 +369,8 @@ "question__title": "夺回据点", "question__title_slug": "s5kipK", "question__hide": false, - "total_acs": 443, - "total_submitted": 1160, + "total_acs": 447, + "total_submitted": 1164, "total_column_articles": 9, "frontend_question_id": "LCP 54", "is_new_question": false @@ -390,8 +390,8 @@ "question__title": "守护太空城", "question__title_slug": "EJvmW4", "question__hide": false, - "total_acs": 856, - "total_submitted": 2010, + "total_acs": 860, + "total_submitted": 2014, "total_column_articles": 16, "frontend_question_id": "LCP 53", "is_new_question": false @@ -411,9 +411,9 @@ "question__title": "二叉搜索树染色", "question__title_slug": "QO5KpG", "question__hide": false, - "total_acs": 3623, - "total_submitted": 13159, - "total_column_articles": 86, + "total_acs": 3644, + "total_submitted": 13189, + "total_column_articles": 88, "frontend_question_id": "LCP 52", "is_new_question": false }, @@ -432,9 +432,9 @@ "question__title": "烹饪料理", "question__title_slug": "UEcfPD", "question__hide": false, - "total_acs": 4706, - "total_submitted": 9920, - "total_column_articles": 93, + "total_acs": 4764, + "total_submitted": 10012, + "total_column_articles": 95, "frontend_question_id": "LCP 51", "is_new_question": false }, @@ -453,8 +453,8 @@ "question__title": "宝石补给", "question__title_slug": "WHnhjV", "question__hide": false, - "total_acs": 6780, - "total_submitted": 9938, + "total_acs": 6817, + "total_submitted": 9987, "total_column_articles": 66, "frontend_question_id": "LCP 50", "is_new_question": false @@ -474,8 +474,8 @@ "question__title": "自行车炫技赛场", "question__title_slug": "kplEvH", "question__hide": false, - "total_acs": 2402, - "total_submitted": 8436, + "total_acs": 2409, + "total_submitted": 8445, "total_column_articles": 55, "frontend_question_id": "LCP 45", "is_new_question": false @@ -495,8 +495,8 @@ "question__title": "无限棋局", "question__title_slug": "fsa7oZ", "question__hide": false, - "total_acs": 874, - "total_submitted": 3198, + "total_acs": 914, + "total_submitted": 3258, "total_column_articles": 16, "frontend_question_id": "LCP 48", "is_new_question": false @@ -516,8 +516,8 @@ "question__title": "志愿者调配", "question__title_slug": "05ZEDJ", "question__hide": false, - "total_acs": 1803, - "total_submitted": 3753, + "total_acs": 1808, + "total_submitted": 3761, "total_column_articles": 43, "frontend_question_id": "LCP 46", "is_new_question": false @@ -537,8 +537,8 @@ "question__title": "玩具套圈", "question__title_slug": "vFjcfV", "question__hide": false, - "total_acs": 2464, - "total_submitted": 8629, + "total_acs": 2466, + "total_submitted": 8631, "total_column_articles": 46, "frontend_question_id": "LCP 42", "is_new_question": false @@ -558,8 +558,8 @@ "question__title": "黑白翻转棋", "question__title_slug": "fHi6rV", "question__hide": false, - "total_acs": 2627, - "total_submitted": 5164, + "total_acs": 2635, + "total_submitted": 5175, "total_column_articles": 67, "frontend_question_id": "LCP 41", "is_new_question": false @@ -579,8 +579,8 @@ "question__title": "无人机方阵", "question__title_slug": "0jQkd0", "question__hide": false, - "total_acs": 8213, - "total_submitted": 14853, + "total_acs": 8240, + "total_submitted": 14884, "total_column_articles": 89, "frontend_question_id": "LCP 39", "is_new_question": false @@ -600,8 +600,8 @@ "question__title": "心算挑战", "question__title_slug": "uOAnQW", "question__hide": false, - "total_acs": 7978, - "total_submitted": 25677, + "total_acs": 8015, + "total_submitted": 25760, "total_column_articles": 169, "frontend_question_id": "LCP 40", "is_new_question": false @@ -621,8 +621,8 @@ "question__title": "十字路口的交通", "question__title_slug": "Y1VbOX", "question__hide": false, - "total_acs": 1189, - "total_submitted": 2296, + "total_acs": 1195, + "total_submitted": 2303, "total_column_articles": 29, "frontend_question_id": "LCP 43", "is_new_question": false @@ -642,8 +642,8 @@ "question__title": "开幕式焰火", "question__title_slug": "sZ59z6", "question__hide": false, - "total_acs": 12491, - "total_submitted": 15634, + "total_acs": 12583, + "total_submitted": 15764, "total_column_articles": 180, "frontend_question_id": "LCP 44", "is_new_question": false @@ -663,9 +663,9 @@ "question__title": "入场安检", "question__title_slug": "oPs9Bm", "question__hide": false, - "total_acs": 1632, - "total_submitted": 3699, - "total_column_articles": 31, + "total_acs": 1641, + "total_submitted": 3710, + "total_column_articles": 32, "frontend_question_id": "LCP 47", "is_new_question": false }, @@ -684,8 +684,8 @@ "question__title": "环形闯关游戏", "question__title_slug": "K8GULz", "question__hide": false, - "total_acs": 917, - "total_submitted": 2514, + "total_acs": 923, + "total_submitted": 2526, "total_column_articles": 19, "frontend_question_id": "LCP 49", "is_new_question": false @@ -705,9 +705,9 @@ "question__title": "省份数量", "question__title_slug": "bLyHh0", "question__hide": false, - "total_acs": 18674, - "total_submitted": 27691, - "total_column_articles": 198, + "total_acs": 18792, + "total_submitted": 27838, + "total_column_articles": 199, "frontend_question_id": "剑指 Offer II 116", "is_new_question": false }, @@ -726,9 +726,9 @@ "question__title": "路径的数目", "question__title_slug": "2AoeFn", "question__hide": false, - "total_acs": 17201, - "total_submitted": 22519, - "total_column_articles": 183, + "total_acs": 17327, + "total_submitted": 22703, + "total_column_articles": 185, "frontend_question_id": "剑指 Offer II 098", "is_new_question": false }, @@ -747,8 +747,8 @@ "question__title": "含有 k 个元素的组合", "question__title_slug": "uUsW3B", "question__hide": false, - "total_acs": 22709, - "total_submitted": 27232, + "total_acs": 22894, + "total_submitted": 27464, "total_column_articles": 183, "frontend_question_id": "剑指 Offer II 080", "is_new_question": false @@ -768,9 +768,9 @@ "question__title": "所有子集", "question__title_slug": "TVdhkn", "question__hide": false, - "total_acs": 24967, - "total_submitted": 29081, - "total_column_articles": 267, + "total_acs": 25166, + "total_submitted": 29294, + "total_column_articles": 270, "frontend_question_id": "剑指 Offer II 079", "is_new_question": false }, @@ -789,9 +789,9 @@ "question__title": "合并排序链表", "question__title_slug": "vvXgSW", "question__hide": false, - "total_acs": 24090, - "total_submitted": 37631, - "total_column_articles": 237, + "total_acs": 24245, + "total_submitted": 37862, + "total_column_articles": 241, "frontend_question_id": "剑指 Offer II 078", "is_new_question": false }, @@ -810,9 +810,9 @@ "question__title": "链表排序", "question__title_slug": "7WHec2", "question__hide": false, - "total_acs": 31572, - "total_submitted": 50172, - "total_column_articles": 316, + "total_acs": 31751, + "total_submitted": 50428, + "total_column_articles": 318, "frontend_question_id": "剑指 Offer II 077", "is_new_question": false }, @@ -831,9 +831,9 @@ "question__title": "数组中的第 k 大的数字", "question__title_slug": "xx4gT2", "question__hide": false, - "total_acs": 37349, - "total_submitted": 55259, - "total_column_articles": 261, + "total_acs": 37608, + "total_submitted": 55635, + "total_column_articles": 264, "frontend_question_id": "剑指 Offer II 076", "is_new_question": false }, @@ -852,9 +852,9 @@ "question__title": "数组相对排序", "question__title_slug": "0H97ZC", "question__hide": false, - "total_acs": 21863, - "total_submitted": 30880, - "total_column_articles": 291, + "total_acs": 22021, + "total_submitted": 31097, + "total_column_articles": 293, "frontend_question_id": "剑指 Offer II 075", "is_new_question": false }, @@ -873,9 +873,9 @@ "question__title": "合并区间", "question__title_slug": "SsGoHC", "question__hide": false, - "total_acs": 21755, - "total_submitted": 37988, - "total_column_articles": 204, + "total_acs": 21905, + "total_submitted": 38247, + "total_column_articles": 206, "frontend_question_id": "剑指 Offer II 074", "is_new_question": false }, @@ -894,8 +894,8 @@ "question__title": "狒狒吃香蕉", "question__title_slug": "nZZqjQ", "question__hide": false, - "total_acs": 18921, - "total_submitted": 35623, + "total_acs": 19067, + "total_submitted": 35898, "total_column_articles": 170, "frontend_question_id": "剑指 Offer II 073", "is_new_question": false @@ -915,9 +915,9 @@ "question__title": "求平方根", "question__title_slug": "jJ0w9p", "question__hide": false, - "total_acs": 30658, - "total_submitted": 70053, - "total_column_articles": 222, + "total_acs": 30895, + "total_submitted": 70561, + "total_column_articles": 223, "frontend_question_id": "剑指 Offer II 072", "is_new_question": false }, @@ -936,9 +936,9 @@ "question__title": "按权重生成随机数", "question__title_slug": "cuyjEf", "question__hide": false, - "total_acs": 13344, - "total_submitted": 26863, - "total_column_articles": 96, + "total_acs": 13468, + "total_submitted": 27108, + "total_column_articles": 97, "frontend_question_id": "剑指 Offer II 071", "is_new_question": false }, @@ -957,9 +957,9 @@ "question__title": "排序数组中只出现一次的数字", "question__title_slug": "skFtm2", "question__hide": false, - "total_acs": 23689, - "total_submitted": 37946, - "total_column_articles": 220, + "total_acs": 23917, + "total_submitted": 38304, + "total_column_articles": 221, "frontend_question_id": "剑指 Offer II 070", "is_new_question": false }, @@ -978,9 +978,9 @@ "question__title": "山峰数组的顶部", "question__title_slug": "B1IidL", "question__hide": false, - "total_acs": 59280, - "total_submitted": 83872, - "total_column_articles": 567, + "total_acs": 59529, + "total_submitted": 84231, + "total_column_articles": 570, "frontend_question_id": "剑指 Offer II 069", "is_new_question": false }, @@ -999,9 +999,9 @@ "question__title": "查找插入位置", "question__title_slug": "N6YdxV", "question__hide": false, - "total_acs": 24850, - "total_submitted": 50125, - "total_column_articles": 240, + "total_acs": 25031, + "total_submitted": 50491, + "total_column_articles": 241, "frontend_question_id": "剑指 Offer II 068", "is_new_question": false }, @@ -1020,8 +1020,8 @@ "question__title": "最大的异或", "question__title_slug": "ms70jA", "question__hide": false, - "total_acs": 11786, - "total_submitted": 17905, + "total_acs": 11886, + "total_submitted": 18055, "total_column_articles": 124, "frontend_question_id": "剑指 Offer II 067", "is_new_question": false @@ -1041,8 +1041,8 @@ "question__title": "单词之和", "question__title_slug": "z1R5dt", "question__hide": false, - "total_acs": 13008, - "total_submitted": 20155, + "total_acs": 13131, + "total_submitted": 20351, "total_column_articles": 196, "frontend_question_id": "剑指 Offer II 066", "is_new_question": false @@ -1062,8 +1062,8 @@ "question__title": "最短的单词编码", "question__title_slug": "iSwD2y", "question__hide": false, - "total_acs": 12856, - "total_submitted": 20231, + "total_acs": 12977, + "total_submitted": 20432, "total_column_articles": 152, "frontend_question_id": "剑指 Offer II 065", "is_new_question": false @@ -1083,9 +1083,9 @@ "question__title": "神奇的字典", "question__title_slug": "US1pGT", "question__hide": false, - "total_acs": 12968, - "total_submitted": 21299, - "total_column_articles": 155, + "total_acs": 13073, + "total_submitted": 21460, + "total_column_articles": 156, "frontend_question_id": "剑指 Offer II 064", "is_new_question": false }, @@ -1104,9 +1104,9 @@ "question__title": "替换单词", "question__title_slug": "UhWRSj", "question__hide": false, - "total_acs": 16449, - "total_submitted": 23271, - "total_column_articles": 229, + "total_acs": 16572, + "total_submitted": 23454, + "total_column_articles": 230, "frontend_question_id": "剑指 Offer II 063", "is_new_question": false }, @@ -1125,9 +1125,9 @@ "question__title": "和最小的 k 个数对", "question__title_slug": "qn8gGX", "question__hide": false, - "total_acs": 16595, - "total_submitted": 30805, - "total_column_articles": 162, + "total_acs": 16779, + "total_submitted": 31124, + "total_column_articles": 164, "frontend_question_id": "剑指 Offer II 061", "is_new_question": false }, @@ -1146,9 +1146,9 @@ "question__title": "实现前缀树", "question__title_slug": "QC3q1f", "question__hide": false, - "total_acs": 18089, - "total_submitted": 23891, - "total_column_articles": 170, + "total_acs": 18220, + "total_submitted": 24056, + "total_column_articles": 171, "frontend_question_id": "剑指 Offer II 062", "is_new_question": false }, @@ -1167,9 +1167,9 @@ "question__title": "出现频率最高的 k 个数字", "question__title_slug": "g5c51o", "question__hide": false, - "total_acs": 21549, - "total_submitted": 31283, - "total_column_articles": 242, + "total_acs": 21753, + "total_submitted": 31577, + "total_column_articles": 244, "frontend_question_id": "剑指 Offer II 060", "is_new_question": false }, @@ -1188,9 +1188,9 @@ "question__title": "数据流的第 K 大数值", "question__title_slug": "jBjn9C", "question__hide": false, - "total_acs": 19235, - "total_submitted": 30494, - "total_column_articles": 171, + "total_acs": 19411, + "total_submitted": 30760, + "total_column_articles": 172, "frontend_question_id": "剑指 Offer II 059", "is_new_question": false }, @@ -1209,9 +1209,9 @@ "question__title": "日程表", "question__title_slug": "fi9suh", "question__hide": false, - "total_acs": 15160, - "total_submitted": 24774, - "total_column_articles": 152, + "total_acs": 15296, + "total_submitted": 24988, + "total_column_articles": 153, "frontend_question_id": "剑指 Offer II 058", "is_new_question": false }, @@ -1230,8 +1230,8 @@ "question__title": "值和下标之差都在给定的范围内", "question__title_slug": "7WqeDu", "question__hide": false, - "total_acs": 16364, - "total_submitted": 46578, + "total_acs": 16532, + "total_submitted": 47010, "total_column_articles": 125, "frontend_question_id": "剑指 Offer II 057", "is_new_question": false @@ -1251,8 +1251,8 @@ "question__title": "最长连续序列", "question__title_slug": "WhsWhI", "question__hide": false, - "total_acs": 21340, - "total_submitted": 43309, + "total_acs": 21465, + "total_submitted": 43604, "total_column_articles": 197, "frontend_question_id": "剑指 Offer II 119", "is_new_question": false @@ -1272,9 +1272,9 @@ "question__title": "二叉搜索树中两个节点之和", "question__title_slug": "opLdQZ", "question__hide": false, - "total_acs": 25201, - "total_submitted": 34318, - "total_column_articles": 265, + "total_acs": 25453, + "total_submitted": 34660, + "total_column_articles": 266, "frontend_question_id": "剑指 Offer II 056", "is_new_question": false }, @@ -1293,8 +1293,8 @@ "question__title": "多余的边", "question__title_slug": "7LpjUW", "question__hide": false, - "total_acs": 9406, - "total_submitted": 13466, + "total_acs": 9474, + "total_submitted": 13550, "total_column_articles": 117, "frontend_question_id": "剑指 Offer II 118", "is_new_question": false @@ -1314,9 +1314,9 @@ "question__title": "相似的字符串", "question__title_slug": "H6lPxb", "question__hide": false, - "total_acs": 7861, - "total_submitted": 12608, - "total_column_articles": 82, + "total_acs": 7914, + "total_submitted": 12704, + "total_column_articles": 83, "frontend_question_id": "剑指 Offer II 117", "is_new_question": false }, @@ -1335,8 +1335,8 @@ "question__title": "二叉搜索树迭代器", "question__title_slug": "kTOapQ", "question__hide": false, - "total_acs": 17902, - "total_submitted": 20981, + "total_acs": 18087, + "total_submitted": 21190, "total_column_articles": 174, "frontend_question_id": "剑指 Offer II 055", "is_new_question": false @@ -1356,9 +1356,9 @@ "question__title": "所有大于等于节点的值之和", "question__title_slug": "w6cpku", "question__hide": false, - "total_acs": 21296, - "total_submitted": 24887, - "total_column_articles": 244, + "total_acs": 21527, + "total_submitted": 25167, + "total_column_articles": 246, "frontend_question_id": "剑指 Offer II 054", "is_new_question": false }, @@ -1377,9 +1377,9 @@ "question__title": "重建序列", "question__title_slug": "ur2n8P", "question__hide": false, - "total_acs": 23277, - "total_submitted": 45811, - "total_column_articles": 268, + "total_acs": 23354, + "total_submitted": 45956, + "total_column_articles": 269, "frontend_question_id": "剑指 Offer II 115", "is_new_question": false }, @@ -1398,9 +1398,9 @@ "question__title": "二叉搜索树中的中序后继", "question__title_slug": "P5rCT8", "question__hide": false, - "total_acs": 26684, - "total_submitted": 41923, - "total_column_articles": 247, + "total_acs": 26954, + "total_submitted": 42405, + "total_column_articles": 250, "frontend_question_id": "剑指 Offer II 053", "is_new_question": false }, @@ -1419,8 +1419,8 @@ "question__title": "外星文字典", "question__title_slug": "Jf1JuT", "question__hide": false, - "total_acs": 19738, - "total_submitted": 37412, + "total_acs": 19791, + "total_submitted": 37554, "total_column_articles": 206, "frontend_question_id": "剑指 Offer II 114", "is_new_question": false @@ -1440,9 +1440,9 @@ "question__title": "展平二叉搜索树", "question__title_slug": "NYBBNL", "question__hide": false, - "total_acs": 25583, - "total_submitted": 34470, - "total_column_articles": 233, + "total_acs": 25835, + "total_submitted": 34825, + "total_column_articles": 235, "frontend_question_id": "剑指 Offer II 052", "is_new_question": false }, @@ -1461,8 +1461,8 @@ "question__title": "课程顺序", "question__title_slug": "QA2IGt", "question__hide": false, - "total_acs": 11879, - "total_submitted": 20951, + "total_acs": 11982, + "total_submitted": 21108, "total_column_articles": 140, "frontend_question_id": "剑指 Offer II 113", "is_new_question": false @@ -1482,8 +1482,8 @@ "question__title": "节点之和最大的路径", "question__title_slug": "jC7MId", "question__hide": false, - "total_acs": 16560, - "total_submitted": 34023, + "total_acs": 16724, + "total_submitted": 34338, "total_column_articles": 149, "frontend_question_id": "剑指 Offer II 051", "is_new_question": false @@ -1503,8 +1503,8 @@ "question__title": "最长递增路径", "question__title_slug": "fpTFWP", "question__hide": false, - "total_acs": 11517, - "total_submitted": 19802, + "total_acs": 11577, + "total_submitted": 19907, "total_column_articles": 110, "frontend_question_id": "剑指 Offer II 112", "is_new_question": false @@ -1524,8 +1524,8 @@ "question__title": "向下的路径节点之和", "question__title_slug": "6eUYwP", "question__hide": false, - "total_acs": 21929, - "total_submitted": 39735, + "total_acs": 22141, + "total_submitted": 40313, "total_column_articles": 185, "frontend_question_id": "剑指 Offer II 050", "is_new_question": false @@ -1545,9 +1545,9 @@ "question__title": "从根节点到叶节点的路径数字之和", "question__title_slug": "3Etpl5", "question__hide": false, - "total_acs": 24628, - "total_submitted": 33368, - "total_column_articles": 253, + "total_acs": 24830, + "total_submitted": 33662, + "total_column_articles": 254, "frontend_question_id": "剑指 Offer II 049", "is_new_question": false }, @@ -1566,9 +1566,9 @@ "question__title": "计算除法", "question__title_slug": "vlzXQL", "question__hide": false, - "total_acs": 7467, - "total_submitted": 11491, - "total_column_articles": 99, + "total_acs": 7535, + "total_submitted": 11596, + "total_column_articles": 100, "frontend_question_id": "剑指 Offer II 111", "is_new_question": false }, @@ -1587,8 +1587,8 @@ "question__title": "序列化与反序列化二叉树", "question__title_slug": "h54YBf", "question__hide": false, - "total_acs": 18208, - "total_submitted": 27118, + "total_acs": 18367, + "total_submitted": 27324, "total_column_articles": 152, "frontend_question_id": "剑指 Offer II 048", "is_new_question": false @@ -1608,9 +1608,9 @@ "question__title": "所有路径", "question__title_slug": "bP4bmD", "question__hide": false, - "total_acs": 15201, - "total_submitted": 18799, - "total_column_articles": 192, + "total_acs": 15338, + "total_submitted": 18975, + "total_column_articles": 193, "frontend_question_id": "剑指 Offer II 110", "is_new_question": false }, @@ -1629,8 +1629,8 @@ "question__title": "开密码锁", "question__title_slug": "zlDJc7", "question__hide": false, - "total_acs": 11361, - "total_submitted": 19487, + "total_acs": 11448, + "total_submitted": 19650, "total_column_articles": 119, "frontend_question_id": "剑指 Offer II 109", "is_new_question": false @@ -1650,9 +1650,9 @@ "question__title": "二叉树剪枝", "question__title_slug": "pOCWxh", "question__hide": false, - "total_acs": 24878, - "total_submitted": 36220, - "total_column_articles": 295, + "total_acs": 25094, + "total_submitted": 36530, + "total_column_articles": 297, "frontend_question_id": "剑指 Offer II 047", "is_new_question": false }, @@ -1671,8 +1671,8 @@ "question__title": "单词演变", "question__title_slug": "om3reC", "question__hide": false, - "total_acs": 8677, - "total_submitted": 14506, + "total_acs": 8753, + "total_submitted": 14623, "total_column_articles": 79, "frontend_question_id": "剑指 Offer II 108", "is_new_question": false @@ -1692,9 +1692,9 @@ "question__title": "二叉树的右侧视图", "question__title_slug": "WNC0Lk", "question__hide": false, - "total_acs": 22760, - "total_submitted": 32103, - "total_column_articles": 284, + "total_acs": 22963, + "total_submitted": 32383, + "total_column_articles": 285, "frontend_question_id": "剑指 Offer II 046", "is_new_question": false }, @@ -1713,9 +1713,9 @@ "question__title": "二叉树最底层最左边的值", "question__title_slug": "LwUNpT", "question__hide": false, - "total_acs": 25726, - "total_submitted": 32327, - "total_column_articles": 297, + "total_acs": 25974, + "total_submitted": 32631, + "total_column_articles": 301, "frontend_question_id": "剑指 Offer II 045", "is_new_question": false }, @@ -1734,9 +1734,9 @@ "question__title": "二叉树每层的最大值", "question__title_slug": "hPov7L", "question__hide": false, - "total_acs": 25370, - "total_submitted": 39899, - "total_column_articles": 260, + "total_acs": 25597, + "total_submitted": 40212, + "total_column_articles": 262, "frontend_question_id": "剑指 Offer II 044", "is_new_question": false }, @@ -1755,8 +1755,8 @@ "question__title": "矩阵中的距离", "question__title_slug": "2bCMpM", "question__hide": false, - "total_acs": 12202, - "total_submitted": 23549, + "total_acs": 12301, + "total_submitted": 23756, "total_column_articles": 101, "frontend_question_id": "剑指 Offer II 107", "is_new_question": false @@ -1776,9 +1776,9 @@ "question__title": "往完全二叉树添加节点", "question__title_slug": "NaqhDT", "question__hide": false, - "total_acs": 18618, - "total_submitted": 30085, - "total_column_articles": 227, + "total_acs": 18791, + "total_submitted": 30342, + "total_column_articles": 229, "frontend_question_id": "剑指 Offer II 043", "is_new_question": false }, @@ -1797,8 +1797,8 @@ "question__title": "二分图", "question__title_slug": "vEAB3K", "question__hide": false, - "total_acs": 12905, - "total_submitted": 23420, + "total_acs": 12999, + "total_submitted": 23569, "total_column_articles": 124, "frontend_question_id": "剑指 Offer II 106", "is_new_question": false @@ -1818,9 +1818,9 @@ "question__title": "最近请求次数", "question__title_slug": "H8086Q", "question__hide": false, - "total_acs": 22628, - "total_submitted": 27520, - "total_column_articles": 195, + "total_acs": 22826, + "total_submitted": 27753, + "total_column_articles": 196, "frontend_question_id": "剑指 Offer II 042", "is_new_question": false }, @@ -1839,9 +1839,9 @@ "question__title": "滑动窗口的平均值", "question__title_slug": "qIsx9U", "question__hide": false, - "total_acs": 50486, - "total_submitted": 64351, - "total_column_articles": 437, + "total_acs": 50753, + "total_submitted": 64735, + "total_column_articles": 438, "frontend_question_id": "剑指 Offer II 041", "is_new_question": false }, @@ -1860,9 +1860,9 @@ "question__title": "岛屿的最大面积", "question__title_slug": "ZL6zAn", "question__hide": false, - "total_acs": 24525, - "total_submitted": 34862, - "total_column_articles": 250, + "total_acs": 24702, + "total_submitted": 35195, + "total_column_articles": 252, "frontend_question_id": "剑指 Offer II 105", "is_new_question": false }, @@ -1881,8 +1881,8 @@ "question__title": "排列的数目", "question__title_slug": "D0F0SV", "question__hide": false, - "total_acs": 11872, - "total_submitted": 20425, + "total_acs": 11967, + "total_submitted": 20582, "total_column_articles": 97, "frontend_question_id": "剑指 Offer II 104", "is_new_question": false @@ -1902,9 +1902,9 @@ "question__title": "最少的硬币数目", "question__title_slug": "gaM7Ch", "question__hide": false, - "total_acs": 23189, - "total_submitted": 45872, - "total_column_articles": 159, + "total_acs": 23349, + "total_submitted": 46157, + "total_column_articles": 160, "frontend_question_id": "剑指 Offer II 103", "is_new_question": false }, @@ -1923,8 +1923,8 @@ "question__title": "加减的目标值", "question__title_slug": "YaVDxD", "question__hide": false, - "total_acs": 16446, - "total_submitted": 28982, + "total_acs": 16602, + "total_submitted": 29286, "total_column_articles": 120, "frontend_question_id": "剑指 Offer II 102", "is_new_question": false @@ -1944,8 +1944,8 @@ "question__title": "分割等和子集", "question__title_slug": "NUPfPr", "question__hide": false, - "total_acs": 20497, - "total_submitted": 41204, + "total_acs": 20657, + "total_submitted": 41526, "total_column_articles": 144, "frontend_question_id": "剑指 Offer II 101", "is_new_question": false @@ -1965,9 +1965,9 @@ "question__title": "三角形中最小路径之和", "question__title_slug": "IlPe0q", "question__hide": false, - "total_acs": 17197, - "total_submitted": 22935, - "total_column_articles": 187, + "total_acs": 17358, + "total_submitted": 23151, + "total_column_articles": 189, "frontend_question_id": "剑指 Offer II 100", "is_new_question": false }, @@ -1986,9 +1986,9 @@ "question__title": "最小路径之和", "question__title_slug": "0i0mDW", "question__hide": false, - "total_acs": 19985, - "total_submitted": 27200, - "total_column_articles": 194, + "total_acs": 20140, + "total_submitted": 27425, + "total_column_articles": 195, "frontend_question_id": "剑指 Offer II 099", "is_new_question": false }, @@ -2007,9 +2007,9 @@ "question__title": "矩阵中最大的矩形", "question__title_slug": "PLYXKQ", "question__hide": false, - "total_acs": 14266, - "total_submitted": 24626, - "total_column_articles": 163, + "total_acs": 14404, + "total_submitted": 24862, + "total_column_articles": 164, "frontend_question_id": "剑指 Offer II 040", "is_new_question": false }, @@ -2028,9 +2028,9 @@ "question__title": "直方图最大矩形面积", "question__title_slug": "0ynMMM", "question__hide": false, - "total_acs": 21526, - "total_submitted": 42429, - "total_column_articles": 170, + "total_acs": 21702, + "total_submitted": 42759, + "total_column_articles": 171, "frontend_question_id": "剑指 Offer II 039", "is_new_question": false }, @@ -2049,8 +2049,8 @@ "question__title": "每日温度", "question__title_slug": "iIQa4I", "question__hide": false, - "total_acs": 30592, - "total_submitted": 39970, + "total_acs": 30837, + "total_submitted": 40278, "total_column_articles": 285, "frontend_question_id": "剑指 Offer II 038", "is_new_question": false @@ -2070,8 +2070,8 @@ "question__title": "小行星碰撞", "question__title_slug": "XagZNi", "question__hide": false, - "total_acs": 25112, - "total_submitted": 56432, + "total_acs": 25289, + "total_submitted": 56831, "total_column_articles": 294, "frontend_question_id": "剑指 Offer II 037", "is_new_question": false @@ -2091,8 +2091,8 @@ "question__title": "子序列的数目", "question__title_slug": "21dk04", "question__hide": false, - "total_acs": 11740, - "total_submitted": 21087, + "total_acs": 11834, + "total_submitted": 21244, "total_column_articles": 106, "frontend_question_id": "剑指 Offer II 097", "is_new_question": false @@ -2112,9 +2112,9 @@ "question__title": "后缀表达式", "question__title_slug": "8Zf90G", "question__hide": false, - "total_acs": 23194, - "total_submitted": 41396, - "total_column_articles": 247, + "total_acs": 23404, + "total_submitted": 41773, + "total_column_articles": 249, "frontend_question_id": "剑指 Offer II 036", "is_new_question": false }, @@ -2133,9 +2133,9 @@ "question__title": "最小时间差", "question__title_slug": "569nqc", "question__hide": false, - "total_acs": 24256, - "total_submitted": 36670, - "total_column_articles": 189, + "total_acs": 24504, + "total_submitted": 37053, + "total_column_articles": 191, "frontend_question_id": "剑指 Offer II 035", "is_new_question": false }, @@ -2154,8 +2154,8 @@ "question__title": "字符串交织", "question__title_slug": "IY6buf", "question__hide": false, - "total_acs": 13099, - "total_submitted": 27342, + "total_acs": 13200, + "total_submitted": 27545, "total_column_articles": 108, "frontend_question_id": "剑指 Offer II 096", "is_new_question": false @@ -2175,9 +2175,9 @@ "question__title": "外星语言是否排序", "question__title_slug": "lwyVBB", "question__hide": false, - "total_acs": 20722, - "total_submitted": 37273, - "total_column_articles": 261, + "total_acs": 20905, + "total_submitted": 37559, + "total_column_articles": 266, "frontend_question_id": "剑指 Offer II 034", "is_new_question": false }, @@ -2196,9 +2196,9 @@ "question__title": "变位词组", "question__title_slug": "sfvd7V", "question__hide": false, - "total_acs": 24234, - "total_submitted": 32134, - "total_column_articles": 207, + "total_acs": 24476, + "total_submitted": 32469, + "total_column_articles": 208, "frontend_question_id": "剑指 Offer II 033", "is_new_question": false }, @@ -2217,9 +2217,9 @@ "question__title": "最长公共子序列", "question__title_slug": "qJnOS7", "question__hide": false, - "total_acs": 34888, - "total_submitted": 52954, - "total_column_articles": 228, + "total_acs": 35076, + "total_submitted": 53225, + "total_column_articles": 229, "frontend_question_id": "剑指 Offer II 095", "is_new_question": false }, @@ -2238,9 +2238,9 @@ "question__title": "有效的变位词", "question__title_slug": "dKk3P7", "question__hide": false, - "total_acs": 28367, - "total_submitted": 47364, - "total_column_articles": 239, + "total_acs": 28613, + "total_submitted": 47774, + "total_column_articles": 240, "frontend_question_id": "剑指 Offer II 032", "is_new_question": false }, @@ -2259,9 +2259,9 @@ "question__title": "最少回文分割", "question__title_slug": "omKAoA", "question__hide": false, - "total_acs": 11487, - "total_submitted": 19819, - "total_column_articles": 96, + "total_acs": 11569, + "total_submitted": 19930, + "total_column_articles": 97, "frontend_question_id": "剑指 Offer II 094", "is_new_question": false }, @@ -2280,8 +2280,8 @@ "question__title": "最长斐波那契数列", "question__title_slug": "Q91FMA", "question__hide": false, - "total_acs": 16004, - "total_submitted": 27135, + "total_acs": 16123, + "total_submitted": 27328, "total_column_articles": 108, "frontend_question_id": "剑指 Offer II 093", "is_new_question": false @@ -2301,9 +2301,9 @@ "question__title": "最近最少使用缓存", "question__title_slug": "OrIXps", "question__hide": false, - "total_acs": 21865, - "total_submitted": 39489, - "total_column_articles": 217, + "total_acs": 22046, + "total_submitted": 39868, + "total_column_articles": 222, "frontend_question_id": "剑指 Offer II 031", "is_new_question": false }, @@ -2322,8 +2322,8 @@ "question__title": "翻转字符", "question__title_slug": "cyJERH", "question__hide": false, - "total_acs": 17281, - "total_submitted": 25389, + "total_acs": 17411, + "total_submitted": 25579, "total_column_articles": 209, "frontend_question_id": "剑指 Offer II 092", "is_new_question": false @@ -2343,9 +2343,9 @@ "question__title": "粉刷房子", "question__title_slug": "JEj789", "question__hide": false, - "total_acs": 41352, - "total_submitted": 53221, - "total_column_articles": 521, + "total_acs": 41499, + "total_submitted": 53393, + "total_column_articles": 522, "frontend_question_id": "剑指 Offer II 091", "is_new_question": false }, @@ -2364,9 +2364,9 @@ "question__title": "插入、删除和随机访问都是 O(1) 的容器", "question__title_slug": "FortPu", "question__hide": false, - "total_acs": 20467, - "total_submitted": 37881, - "total_column_articles": 143, + "total_acs": 20640, + "total_submitted": 38196, + "total_column_articles": 146, "frontend_question_id": "剑指 Offer II 030", "is_new_question": false }, @@ -2385,9 +2385,9 @@ "question__title": "环形房屋偷盗", "question__title_slug": "PzWKhm", "question__hide": false, - "total_acs": 14901, - "total_submitted": 30554, - "total_column_articles": 132, + "total_acs": 15002, + "total_submitted": 30731, + "total_column_articles": 133, "frontend_question_id": "剑指 Offer II 090", "is_new_question": false }, @@ -2406,9 +2406,9 @@ "question__title": "排序的循环链表", "question__title_slug": "4ueAj6", "question__hide": false, - "total_acs": 40972, - "total_submitted": 121639, - "total_column_articles": 587, + "total_acs": 41161, + "total_submitted": 122250, + "total_column_articles": 589, "frontend_question_id": "剑指 Offer II 029", "is_new_question": false }, @@ -2427,9 +2427,9 @@ "question__title": "展平多级双向链表", "question__title_slug": "Qv1Da2", "question__hide": false, - "total_acs": 21072, - "total_submitted": 34811, - "total_column_articles": 289, + "total_acs": 21254, + "total_submitted": 35143, + "total_column_articles": 291, "frontend_question_id": "剑指 Offer II 028", "is_new_question": false }, @@ -2448,9 +2448,9 @@ "question__title": "回文链表", "question__title_slug": "aMhZSa", "question__hide": false, - "total_acs": 51199, - "total_submitted": 83440, - "total_column_articles": 432, + "total_acs": 51547, + "total_submitted": 83954, + "total_column_articles": 435, "frontend_question_id": "剑指 Offer II 027", "is_new_question": false }, @@ -2469,9 +2469,9 @@ "question__title": "重排链表", "question__title_slug": "LGjMqU", "question__hide": false, - "total_acs": 33986, - "total_submitted": 50836, - "total_column_articles": 333, + "total_acs": 34226, + "total_submitted": 51200, + "total_column_articles": 334, "frontend_question_id": "剑指 Offer II 026", "is_new_question": false }, @@ -2490,9 +2490,9 @@ "question__title": "链表中的两数相加", "question__title_slug": "lMSNwu", "question__hide": false, - "total_acs": 32088, - "total_submitted": 54536, - "total_column_articles": 351, + "total_acs": 32317, + "total_submitted": 54935, + "total_column_articles": 355, "frontend_question_id": "剑指 Offer II 025", "is_new_question": false }, @@ -2511,9 +2511,9 @@ "question__title": "反转链表", "question__title_slug": "UHnkqh", "question__hide": false, - "total_acs": 79296, - "total_submitted": 104788, - "total_column_articles": 492, + "total_acs": 79825, + "total_submitted": 105467, + "total_column_articles": 495, "frontend_question_id": "剑指 Offer II 024", "is_new_question": false }, @@ -2532,9 +2532,9 @@ "question__title": "两个链表的第一个重合节点", "question__title_slug": "3u1WK4", "question__hide": false, - "total_acs": 36435, - "total_submitted": 51959, - "total_column_articles": 257, + "total_acs": 36732, + "total_submitted": 52400, + "total_column_articles": 258, "frontend_question_id": "剑指 Offer II 023", "is_new_question": false }, @@ -2553,9 +2553,9 @@ "question__title": "链表中环的入口节点", "question__title_slug": "c32eOV", "question__hide": false, - "total_acs": 46173, - "total_submitted": 82930, - "total_column_articles": 312, + "total_acs": 46514, + "total_submitted": 83494, + "total_column_articles": 314, "frontend_question_id": "剑指 Offer II 022", "is_new_question": false }, @@ -2574,9 +2574,9 @@ "question__title": "删除链表的倒数第 n 个结点", "question__title_slug": "SLwz0R", "question__hide": false, - "total_acs": 42269, - "total_submitted": 78793, - "total_column_articles": 419, + "total_acs": 42590, + "total_submitted": 79321, + "total_column_articles": 423, "frontend_question_id": "剑指 Offer II 021", "is_new_question": false }, @@ -2595,9 +2595,9 @@ "question__title": "回文子字符串的个数", "question__title_slug": "a7VOhD", "question__hide": false, - "total_acs": 31073, - "total_submitted": 43187, - "total_column_articles": 258, + "total_acs": 31299, + "total_submitted": 43498, + "total_column_articles": 259, "frontend_question_id": "剑指 Offer II 020", "is_new_question": false }, @@ -2616,9 +2616,9 @@ "question__title": "最多删除一个字符得到回文", "question__title_slug": "RQku0D", "question__hide": false, - "total_acs": 31093, - "total_submitted": 67556, - "total_column_articles": 286, + "total_acs": 31353, + "total_submitted": 68102, + "total_column_articles": 294, "frontend_question_id": "剑指 Offer II 019", "is_new_question": false }, @@ -2637,9 +2637,9 @@ "question__title": "有效的回文", "question__title_slug": "XltzEq", "question__hide": false, - "total_acs": 35525, - "total_submitted": 68661, - "total_column_articles": 304, + "total_acs": 35805, + "total_submitted": 69153, + "total_column_articles": 309, "frontend_question_id": "剑指 Offer II 018", "is_new_question": false }, @@ -2658,9 +2658,9 @@ "question__title": "含有所有字符的最短字符串", "question__title_slug": "M1oyTv", "question__hide": false, - "total_acs": 25397, - "total_submitted": 50209, - "total_column_articles": 258, + "total_acs": 25626, + "total_submitted": 50645, + "total_column_articles": 260, "frontend_question_id": "剑指 Offer II 017", "is_new_question": false }, @@ -2679,9 +2679,9 @@ "question__title": "不含重复字符的最长子字符串", "question__title_slug": "wtcaE1", "question__hide": false, - "total_acs": 38483, - "total_submitted": 80686, - "total_column_articles": 382, + "total_acs": 38778, + "total_submitted": 81289, + "total_column_articles": 388, "frontend_question_id": "剑指 Offer II 016", "is_new_question": false }, @@ -2700,9 +2700,9 @@ "question__title": "字符串中的所有变位词", "question__title_slug": "VabMRr", "question__hide": false, - "total_acs": 28434, - "total_submitted": 45707, - "total_column_articles": 255, + "total_acs": 28677, + "total_submitted": 46093, + "total_column_articles": 257, "frontend_question_id": "剑指 Offer II 015", "is_new_question": false }, @@ -2721,9 +2721,9 @@ "question__title": "字符串中的变位词", "question__title_slug": "MPnaiL", "question__hide": false, - "total_acs": 35480, - "total_submitted": 68763, - "total_column_articles": 285, + "total_acs": 35776, + "total_submitted": 69333, + "total_column_articles": 289, "frontend_question_id": "剑指 Offer II 014", "is_new_question": false }, @@ -2742,9 +2742,9 @@ "question__title": "二维子矩阵的和", "question__title_slug": "O4NDxx", "question__hide": false, - "total_acs": 28303, - "total_submitted": 41392, - "total_column_articles": 253, + "total_acs": 28596, + "total_submitted": 41796, + "total_column_articles": 254, "frontend_question_id": "剑指 Offer II 013", "is_new_question": false }, @@ -2763,9 +2763,9 @@ "question__title": "左右两边子数组的和相等", "question__title_slug": "tvdfij", "question__hide": false, - "total_acs": 37687, - "total_submitted": 56344, - "total_column_articles": 354, + "total_acs": 37989, + "total_submitted": 56795, + "total_column_articles": 358, "frontend_question_id": "剑指 Offer II 012", "is_new_question": false }, @@ -2784,9 +2784,9 @@ "question__title": "0 和 1 个数相同的子数组", "question__title_slug": "A1NYOS", "question__hide": false, - "total_acs": 33294, - "total_submitted": 60238, - "total_column_articles": 295, + "total_acs": 33564, + "total_submitted": 60716, + "total_column_articles": 297, "frontend_question_id": "剑指 Offer II 011", "is_new_question": false }, @@ -2805,9 +2805,9 @@ "question__title": "和为 k 的子数组", "question__title_slug": "QTMn0o", "question__hide": false, - "total_acs": 43188, - "total_submitted": 99796, - "total_column_articles": 312, + "total_acs": 43550, + "total_submitted": 100594, + "total_column_articles": 314, "frontend_question_id": "剑指 Offer II 010", "is_new_question": false }, @@ -2826,9 +2826,9 @@ "question__title": "房屋偷盗", "question__title_slug": "Gu0c2T", "question__hide": false, - "total_acs": 21259, - "total_submitted": 35094, - "total_column_articles": 176, + "total_acs": 21393, + "total_submitted": 35306, + "total_column_articles": 177, "frontend_question_id": "剑指 Offer II 089", "is_new_question": false }, @@ -2847,9 +2847,9 @@ "question__title": "乘积小于 K 的子数组", "question__title_slug": "ZVAVXX", "question__hide": false, - "total_acs": 39663, - "total_submitted": 73725, - "total_column_articles": 335, + "total_acs": 39962, + "total_submitted": 74270, + "total_column_articles": 337, "frontend_question_id": "剑指 Offer II 009", "is_new_question": false }, @@ -2868,9 +2868,9 @@ "question__title": "爬楼梯的最少成本", "question__title_slug": "GzCJIP", "question__hide": false, - "total_acs": 29730, - "total_submitted": 40792, - "total_column_articles": 252, + "total_acs": 29993, + "total_submitted": 41128, + "total_column_articles": 253, "frontend_question_id": "剑指 Offer II 088", "is_new_question": false }, @@ -2889,9 +2889,9 @@ "question__title": "和大于等于 target 的最短子数组", "question__title_slug": "2VG8Kg", "question__hide": false, - "total_acs": 47731, - "total_submitted": 96397, - "total_column_articles": 397, + "total_acs": 48053, + "total_submitted": 97010, + "total_column_articles": 401, "frontend_question_id": "剑指 Offer II 008", "is_new_question": false }, @@ -2910,8 +2910,8 @@ "question__title": "复原 IP ", "question__title_slug": "0on3uN", "question__hide": false, - "total_acs": 17567, - "total_submitted": 28012, + "total_acs": 17662, + "total_submitted": 28160, "total_column_articles": 193, "frontend_question_id": "剑指 Offer II 087", "is_new_question": false @@ -2931,8 +2931,8 @@ "question__title": "分割回文子字符串", "question__title_slug": "M99OJA", "question__hide": false, - "total_acs": 16857, - "total_submitted": 22331, + "total_acs": 16960, + "total_submitted": 22453, "total_column_articles": 144, "frontend_question_id": "剑指 Offer II 086", "is_new_question": false @@ -2952,9 +2952,9 @@ "question__title": "数组中和为 0 的三个数", "question__title_slug": "1fGaJU", "question__hide": false, - "total_acs": 45677, - "total_submitted": 103535, - "total_column_articles": 303, + "total_acs": 45970, + "total_submitted": 104230, + "total_column_articles": 305, "frontend_question_id": "剑指 Offer II 007", "is_new_question": false }, @@ -2973,9 +2973,9 @@ "question__title": "生成匹配的括号", "question__title_slug": "IDBivT", "question__hide": false, - "total_acs": 23451, - "total_submitted": 27590, - "total_column_articles": 255, + "total_acs": 23647, + "total_submitted": 27811, + "total_column_articles": 257, "frontend_question_id": "剑指 Offer II 085", "is_new_question": false }, @@ -2994,9 +2994,9 @@ "question__title": "排序数组中两个数字之和", "question__title_slug": "kLl5u1", "question__hide": false, - "total_acs": 52279, - "total_submitted": 77855, - "total_column_articles": 398, + "total_acs": 52677, + "total_submitted": 78400, + "total_column_articles": 400, "frontend_question_id": "剑指 Offer II 006", "is_new_question": false }, @@ -3015,9 +3015,9 @@ "question__title": "单词长度的最大乘积", "question__title_slug": "aseY1I", "question__hide": false, - "total_acs": 43487, - "total_submitted": 60828, - "total_column_articles": 355, + "total_acs": 43774, + "total_submitted": 61202, + "total_column_articles": 357, "frontend_question_id": "剑指 Offer II 005", "is_new_question": false }, @@ -3036,9 +3036,9 @@ "question__title": "含有重复元素集合的全排列 ", "question__title_slug": "7p8L0Z", "question__hide": false, - "total_acs": 19475, - "total_submitted": 28089, - "total_column_articles": 175, + "total_acs": 19600, + "total_submitted": 28261, + "total_column_articles": 176, "frontend_question_id": "剑指 Offer II 084", "is_new_question": false }, @@ -3057,8 +3057,8 @@ "question__title": "没有重复元素集合的全排列", "question__title_slug": "VvJkup", "question__hide": false, - "total_acs": 22699, - "total_submitted": 26410, + "total_acs": 22869, + "total_submitted": 26591, "total_column_articles": 253, "frontend_question_id": "剑指 Offer II 083", "is_new_question": false @@ -3078,9 +3078,9 @@ "question__title": "只出现一次的数字 ", "question__title_slug": "WGki4K", "question__hide": false, - "total_acs": 53582, - "total_submitted": 75288, - "total_column_articles": 419, + "total_acs": 53895, + "total_submitted": 75701, + "total_column_articles": 424, "frontend_question_id": "剑指 Offer II 004", "is_new_question": false }, @@ -3099,8 +3099,8 @@ "question__title": "含有重复元素集合的组合", "question__title_slug": "4sjJUc", "question__hide": false, - "total_acs": 19954, - "total_submitted": 30274, + "total_acs": 20089, + "total_submitted": 30471, "total_column_articles": 176, "frontend_question_id": "剑指 Offer II 082", "is_new_question": false @@ -3120,9 +3120,9 @@ "question__title": "二进制加法", "question__title_slug": "JFETK5", "question__hide": false, - "total_acs": 48204, - "total_submitted": 88511, - "total_column_articles": 488, + "total_acs": 48522, + "total_submitted": 89115, + "total_column_articles": 490, "frontend_question_id": "剑指 Offer II 002", "is_new_question": false }, @@ -3141,9 +3141,9 @@ "question__title": "前 n 个数字二进制中 1 的个数", "question__title_slug": "w3tCBm", "question__hide": false, - "total_acs": 61639, - "total_submitted": 78427, - "total_column_articles": 542, + "total_acs": 62047, + "total_submitted": 78985, + "total_column_articles": 544, "frontend_question_id": "剑指 Offer II 003", "is_new_question": false }, @@ -3162,8 +3162,8 @@ "question__title": "允许重复选择元素的组合", "question__title_slug": "Ygoe9J", "question__hide": false, - "total_acs": 23271, - "total_submitted": 28820, + "total_acs": 23412, + "total_submitted": 28983, "total_column_articles": 213, "frontend_question_id": "剑指 Offer II 081", "is_new_question": false @@ -3183,9 +3183,9 @@ "question__title": "整数除法", "question__title_slug": "xoh6Oh", "question__hide": false, - "total_acs": 52502, - "total_submitted": 247832, - "total_column_articles": 435, + "total_acs": 52813, + "total_submitted": 249454, + "total_column_articles": 439, "frontend_question_id": "剑指 Offer II 001", "is_new_question": false }, @@ -3204,8 +3204,8 @@ "question__title": "主题空间", "question__title_slug": "YesdPw", "question__hide": false, - "total_acs": 3263, - "total_submitted": 7903, + "total_acs": 3279, + "total_submitted": 7939, "total_column_articles": 93, "frontend_question_id": "LCS 03", "is_new_question": false @@ -3225,8 +3225,8 @@ "question__title": "完成一半题目", "question__title_slug": "WqXACV", "question__hide": false, - "total_acs": 8038, - "total_submitted": 12225, + "total_acs": 8072, + "total_submitted": 12274, "total_column_articles": 154, "frontend_question_id": "LCS 02", "is_new_question": false @@ -3246,9 +3246,9 @@ "question__title": "下载插件", "question__title_slug": "Ju9Xwi", "question__hide": false, - "total_acs": 11514, - "total_submitted": 21236, - "total_column_articles": 238, + "total_acs": 11602, + "total_submitted": 21398, + "total_column_articles": 240, "frontend_question_id": "LCS 01", "is_new_question": false }, @@ -3267,8 +3267,8 @@ "question__title": "魔塔游戏", "question__title_slug": "p0NxJO", "question__hide": false, - "total_acs": 8961, - "total_submitted": 23886, + "total_acs": 8973, + "total_submitted": 23915, "total_column_articles": 140, "frontend_question_id": "LCP 30", "is_new_question": false @@ -3309,8 +3309,8 @@ "question__title": "最多牌组数", "question__title_slug": "Up5XYM", "question__hide": false, - "total_acs": 1504, - "total_submitted": 4450, + "total_acs": 1508, + "total_submitted": 4455, "total_column_articles": 25, "frontend_question_id": "LCP 36", "is_new_question": false @@ -3330,8 +3330,8 @@ "question__title": "蓄水", "question__title_slug": "o8SXZn", "question__hide": false, - "total_acs": 8374, - "total_submitted": 31960, + "total_acs": 8408, + "total_submitted": 32064, "total_column_articles": 135, "frontend_question_id": "LCP 33", "is_new_question": false @@ -3351,8 +3351,8 @@ "question__title": "电动车游城市", "question__title_slug": "DFPeFJ", "question__hide": false, - "total_acs": 2245, - "total_submitted": 4700, + "total_acs": 2247, + "total_submitted": 4702, "total_column_articles": 36, "frontend_question_id": "LCP 35", "is_new_question": false @@ -3372,8 +3372,8 @@ "question__title": "批量处理任务", "question__title_slug": "t3fKg1", "question__hide": false, - "total_acs": 1882, - "total_submitted": 4197, + "total_acs": 1884, + "total_submitted": 4210, "total_column_articles": 29, "frontend_question_id": "LCP 32", "is_new_question": false @@ -3393,9 +3393,9 @@ "question__title": "变换的迷宫", "question__title_slug": "Db3wC1", "question__hide": false, - "total_acs": 2661, - "total_submitted": 9180, - "total_column_articles": 41, + "total_acs": 2671, + "total_submitted": 9217, + "total_column_articles": 42, "frontend_question_id": "LCP 31", "is_new_question": false }, @@ -3414,8 +3414,8 @@ "question__title": "乐团站位", "question__title_slug": "SNJvJP", "question__hide": false, - "total_acs": 7916, - "total_submitted": 37507, + "total_acs": 7923, + "total_submitted": 37529, "total_column_articles": 165, "frontend_question_id": "LCP 29", "is_new_question": false @@ -3435,8 +3435,8 @@ "question__title": "采购方案", "question__title_slug": "4xy4Wx", "question__hide": false, - "total_acs": 17564, - "total_submitted": 55663, + "total_acs": 17591, + "total_submitted": 55729, "total_column_articles": 283, "frontend_question_id": "LCP 28", "is_new_question": false @@ -3456,8 +3456,8 @@ "question__title": "黑盒光线反射", "question__title_slug": "IQvJ9i", "question__hide": false, - "total_acs": 1592, - "total_submitted": 4672, + "total_acs": 1594, + "total_submitted": 4686, "total_column_articles": 31, "frontend_question_id": "LCP 27", "is_new_question": false @@ -3477,9 +3477,9 @@ "question__title": "早餐组合", "question__title_slug": "2vYnGI", "question__hide": false, - "total_acs": 23749, - "total_submitted": 79032, - "total_column_articles": 339, + "total_acs": 23792, + "total_submitted": 79186, + "total_column_articles": 341, "frontend_question_id": "LCP 18", "is_new_question": false }, @@ -3498,8 +3498,8 @@ "question__title": "黑白方格画", "question__title_slug": "ccw6C7", "question__hide": false, - "total_acs": 10875, - "total_submitted": 31341, + "total_acs": 10900, + "total_submitted": 31399, "total_column_articles": 214, "frontend_question_id": "LCP 22", "is_new_question": false @@ -3519,9 +3519,9 @@ "question__title": "速算机器人", "question__title_slug": "nGK0Fy", "question__hide": false, - "total_acs": 31153, - "total_submitted": 38856, - "total_column_articles": 344, + "total_acs": 31225, + "total_submitted": 38934, + "total_column_articles": 345, "frontend_question_id": "LCP 17", "is_new_question": false }, @@ -3540,8 +3540,8 @@ "question__title": "古董键盘", "question__title_slug": "Uh984O", "question__hide": false, - "total_acs": 1767, - "total_submitted": 4837, + "total_acs": 1772, + "total_submitted": 4844, "total_column_articles": 35, "frontend_question_id": "LCP 25", "is_new_question": false @@ -3561,8 +3561,8 @@ "question__title": "追逐游戏", "question__title_slug": "Za25hA", "question__hide": false, - "total_acs": 1434, - "total_submitted": 3759, + "total_acs": 1435, + "total_submitted": 3760, "total_column_articles": 34, "frontend_question_id": "LCP 21", "is_new_question": false @@ -3582,9 +3582,9 @@ "question__title": "快速公交", "question__title_slug": "meChtZ", "question__hide": false, - "total_acs": 2426, - "total_submitted": 6899, - "total_column_articles": 35, + "total_acs": 2432, + "total_submitted": 6915, + "total_column_articles": 36, "frontend_question_id": "LCP 20", "is_new_question": false }, @@ -3603,8 +3603,8 @@ "question__title": "导航装置", "question__title_slug": "hSRGyL", "question__hide": false, - "total_acs": 890, - "total_submitted": 2387, + "total_acs": 891, + "total_submitted": 2390, "total_column_articles": 24, "frontend_question_id": "LCP 26", "is_new_question": false @@ -3624,8 +3624,8 @@ "question__title": "数字游戏", "question__title_slug": "5TxKeK", "question__hide": false, - "total_acs": 1392, - "total_submitted": 4410, + "total_acs": 1397, + "total_submitted": 4419, "total_column_articles": 30, "frontend_question_id": "LCP 24", "is_new_question": false @@ -3645,8 +3645,8 @@ "question__title": "秋叶收藏集", "question__title_slug": "UlBDOe", "question__hide": false, - "total_acs": 21617, - "total_submitted": 41707, + "total_acs": 21632, + "total_submitted": 41729, "total_column_articles": 232, "frontend_question_id": "LCP 19", "is_new_question": false @@ -3666,8 +3666,8 @@ "question__title": "寻宝", "question__title_slug": "xun-bao", "question__hide": false, - "total_acs": 10091, - "total_submitted": 16799, + "total_acs": 10102, + "total_submitted": 16843, "total_column_articles": 97, "frontend_question_id": "LCP 13", "is_new_question": false @@ -3687,8 +3687,8 @@ "question__title": "最小矩形面积", "question__title_slug": "zui-xiao-ju-xing-mian-ji", "question__hide": false, - "total_acs": 1514, - "total_submitted": 6078, + "total_acs": 1516, + "total_submitted": 6085, "total_column_articles": 27, "frontend_question_id": "LCP 37", "is_new_question": false @@ -3708,8 +3708,8 @@ "question__title": "最小跳跃次数", "question__title_slug": "zui-xiao-tiao-yue-ci-shu", "question__hide": false, - "total_acs": 10267, - "total_submitted": 32582, + "total_acs": 10288, + "total_submitted": 32631, "total_column_articles": 130, "frontend_question_id": "LCP 09", "is_new_question": false @@ -3729,9 +3729,9 @@ "question__title": "二叉树染色", "question__title_slug": "er-cha-shu-ran-se-UGC", "question__hide": false, - "total_acs": 4727, - "total_submitted": 8513, - "total_column_articles": 94, + "total_acs": 4739, + "total_submitted": 8550, + "total_column_articles": 95, "frontend_question_id": "LCP 34", "is_new_question": false }, @@ -3750,8 +3750,8 @@ "question__title": "游乐园的迷宫", "question__title_slug": "you-le-yuan-de-mi-gong", "question__hide": false, - "total_acs": 1264, - "total_submitted": 2073, + "total_acs": 1267, + "total_submitted": 2076, "total_column_articles": 29, "frontend_question_id": "LCP 15", "is_new_question": false @@ -3771,8 +3771,8 @@ "question__title": "小张刷题计划", "question__title_slug": "xiao-zhang-shua-ti-ji-hua", "question__hide": false, - "total_acs": 10213, - "total_submitted": 23457, + "total_acs": 10239, + "total_submitted": 23525, "total_column_articles": 147, "frontend_question_id": "LCP 12", "is_new_question": false @@ -3792,8 +3792,8 @@ "question__title": "期望个数统计", "question__title_slug": "qi-wang-ge-shu-tong-ji", "question__hide": false, - "total_acs": 9545, - "total_submitted": 13272, + "total_acs": 9569, + "total_submitted": 13300, "total_column_articles": 97, "frontend_question_id": "LCP 11", "is_new_question": false @@ -3813,8 +3813,8 @@ "question__title": "游乐园的游览计划", "question__title_slug": "you-le-yuan-de-you-lan-ji-hua", "question__hide": false, - "total_acs": 976, - "total_submitted": 2850, + "total_acs": 979, + "total_submitted": 2857, "total_column_articles": 20, "frontend_question_id": "LCP 16", "is_new_question": false @@ -3834,8 +3834,8 @@ "question__title": "传递信息", "question__title_slug": "chuan-di-xin-xi", "question__hide": false, - "total_acs": 50675, - "total_submitted": 66635, + "total_acs": 50794, + "total_submitted": 66816, "total_column_articles": 597, "frontend_question_id": "LCP 07", "is_new_question": false @@ -3855,8 +3855,8 @@ "question__title": "二叉树任务调度", "question__title_slug": "er-cha-shu-ren-wu-diao-du", "question__hide": false, - "total_acs": 2777, - "total_submitted": 4562, + "total_acs": 2780, + "total_submitted": 4565, "total_column_articles": 51, "frontend_question_id": "LCP 10", "is_new_question": false @@ -3876,9 +3876,9 @@ "question__title": "切分数组", "question__title_slug": "qie-fen-shu-zu", "question__hide": false, - "total_acs": 3698, - "total_submitted": 15684, - "total_column_articles": 58, + "total_acs": 3726, + "total_submitted": 15739, + "total_column_articles": 57, "frontend_question_id": "LCP 14", "is_new_question": false }, @@ -3897,8 +3897,8 @@ "question__title": "魔术排列", "question__title_slug": "er94lq", "question__hide": false, - "total_acs": 3587, - "total_submitted": 9819, + "total_acs": 3593, + "total_submitted": 9829, "total_column_articles": 67, "frontend_question_id": "LCP 23", "is_new_question": false @@ -3918,8 +3918,8 @@ "question__title": "剧情触发时间", "question__title_slug": "ju-qing-hong-fa-shi-jian", "question__hide": false, - "total_acs": 7034, - "total_submitted": 21816, + "total_acs": 7052, + "total_submitted": 21851, "total_column_articles": 126, "frontend_question_id": "LCP 08", "is_new_question": false @@ -3939,9 +3939,9 @@ "question__title": "拿硬币", "question__title_slug": "na-ying-bi", "question__hide": false, - "total_acs": 55430, - "total_submitted": 65946, - "total_column_articles": 839, + "total_acs": 55546, + "total_submitted": 66085, + "total_column_articles": 842, "frontend_question_id": "LCP 06", "is_new_question": false }, @@ -3960,8 +3960,8 @@ "question__title": "Sparse Similarity LCCI", "question__title_slug": "sparse-similarity-lcci", "question__hide": false, - "total_acs": 5390, - "total_submitted": 15244, + "total_acs": 5427, + "total_submitted": 15334, "total_column_articles": 87, "frontend_question_id": "面试题 17.26", "is_new_question": false @@ -3981,8 +3981,8 @@ "question__title": "Langtons Ant LCCI", "question__title_slug": "langtons-ant-lcci", "question__hide": false, - "total_acs": 4288, - "total_submitted": 7450, + "total_acs": 4300, + "total_submitted": 7482, "total_column_articles": 80, "frontend_question_id": "面试题 16.22", "is_new_question": false @@ -4002,8 +4002,8 @@ "question__title": "Word Rectangle LCCI", "question__title_slug": "word-rectangle-lcci", "question__hide": false, - "total_acs": 2716, - "total_submitted": 5403, + "total_acs": 2774, + "total_submitted": 5496, "total_column_articles": 54, "frontend_question_id": "面试题 17.25", "is_new_question": false @@ -4023,8 +4023,8 @@ "question__title": "Sum Swap LCCI", "question__title_slug": "sum-swap-lcci", "question__hide": false, - "total_acs": 14594, - "total_submitted": 30647, + "total_acs": 14634, + "total_submitted": 30730, "total_column_articles": 257, "frontend_question_id": "面试题 16.21", "is_new_question": false @@ -4044,8 +4044,8 @@ "question__title": "T9 LCCI", "question__title_slug": "t9-lcci", "question__hide": false, - "total_acs": 13823, - "total_submitted": 19407, + "total_acs": 13846, + "total_submitted": 19444, "total_column_articles": 245, "frontend_question_id": "面试题 16.20", "is_new_question": false @@ -4065,9 +4065,9 @@ "question__title": "Max Submatrix LCCI", "question__title_slug": "max-submatrix-lcci", "question__hide": false, - "total_acs": 21243, - "total_submitted": 39616, - "total_column_articles": 192, + "total_acs": 21297, + "total_submitted": 39708, + "total_column_articles": 193, "frontend_question_id": "面试题 17.24", "is_new_question": false }, @@ -4086,8 +4086,8 @@ "question__title": "Max Black Square LCCI", "question__title_slug": "max-black-square-lcci", "question__hide": false, - "total_acs": 7348, - "total_submitted": 19616, + "total_acs": 7368, + "total_submitted": 19661, "total_column_articles": 151, "frontend_question_id": "面试题 17.23", "is_new_question": false @@ -4107,8 +4107,8 @@ "question__title": "Missing Two LCCI", "question__title_slug": "missing-two-lcci", "question__hide": false, - "total_acs": 39164, - "total_submitted": 64551, + "total_acs": 39213, + "total_submitted": 64618, "total_column_articles": 567, "frontend_question_id": "面试题 17.19", "is_new_question": false @@ -4128,9 +4128,9 @@ "question__title": "Shortest Supersequence LCCI", "question__title_slug": "shortest-supersequence-lcci", "question__hide": false, - "total_acs": 12804, - "total_submitted": 28850, - "total_column_articles": 169, + "total_acs": 12857, + "total_submitted": 28952, + "total_column_articles": 170, "frontend_question_id": "面试题 17.18", "is_new_question": false }, @@ -4149,9 +4149,9 @@ "question__title": "Pairs With Sum LCCI", "question__title_slug": "pairs-with-sum-lcci", "question__hide": false, - "total_acs": 16283, - "total_submitted": 33794, - "total_column_articles": 236, + "total_acs": 16330, + "total_submitted": 33884, + "total_column_articles": 237, "frontend_question_id": "面试题 16.24", "is_new_question": false }, @@ -4170,9 +4170,9 @@ "question__title": "Rank from Stream LCCI", "question__title_slug": "rank-from-stream-lcci", "question__hide": false, - "total_acs": 8690, - "total_submitted": 14035, - "total_column_articles": 140, + "total_acs": 8730, + "total_submitted": 14098, + "total_column_articles": 141, "frontend_question_id": "面试题 10.10", "is_new_question": false }, @@ -4191,9 +4191,9 @@ "question__title": "Group Anagrams LCCI", "question__title_slug": "group-anagrams-lcci", "question__hide": false, - "total_acs": 40506, - "total_submitted": 54585, - "total_column_articles": 479, + "total_acs": 40566, + "total_submitted": 54661, + "total_column_articles": 480, "frontend_question_id": "面试题 10.02", "is_new_question": false }, @@ -4212,8 +4212,8 @@ "question__title": "Find Closest LCCI", "question__title_slug": "find-closest-lcci", "question__hide": false, - "total_acs": 49363, - "total_submitted": 67514, + "total_acs": 49390, + "total_submitted": 67550, "total_column_articles": 658, "frontend_question_id": "面试题 17.11", "is_new_question": false @@ -4233,8 +4233,8 @@ "question__title": "Find Majority Element LCCI", "question__title_slug": "find-majority-element-lcci", "question__hide": false, - "total_acs": 75603, - "total_submitted": 134102, + "total_acs": 75654, + "total_submitted": 134199, "total_column_articles": 1040, "frontend_question_id": "面试题 17.10", "is_new_question": false @@ -4254,8 +4254,8 @@ "question__title": "Get Kth Magic Number LCCI", "question__title_slug": "get-kth-magic-number-lcci", "question__hide": false, - "total_acs": 45375, - "total_submitted": 80401, + "total_acs": 45451, + "total_submitted": 80539, "total_column_articles": 411, "frontend_question_id": "面试题 17.09", "is_new_question": false @@ -4275,8 +4275,8 @@ "question__title": "Circus Tower LCCI", "question__title_slug": "circus-tower-lcci", "question__hide": false, - "total_acs": 11907, - "total_submitted": 41949, + "total_acs": 11936, + "total_submitted": 42085, "total_column_articles": 159, "frontend_question_id": "面试题 17.08", "is_new_question": false @@ -4296,8 +4296,8 @@ "question__title": "Baby Names LCCI", "question__title_slug": "baby-names-lcci", "question__hide": false, - "total_acs": 12013, - "total_submitted": 29031, + "total_acs": 12036, + "total_submitted": 29076, "total_column_articles": 272, "frontend_question_id": "面试题 17.07", "is_new_question": false @@ -4317,8 +4317,8 @@ "question__title": "Number Of 2s In Range LCCI", "question__title_slug": "number-of-2s-in-range-lcci", "question__hide": false, - "total_acs": 8298, - "total_submitted": 17108, + "total_acs": 8333, + "total_submitted": 17157, "total_column_articles": 169, "frontend_question_id": "面试题 17.06", "is_new_question": false @@ -4338,8 +4338,8 @@ "question__title": "Find Longest Subarray LCCI", "question__title_slug": "find-longest-subarray-lcci", "question__hide": false, - "total_acs": 9349, - "total_submitted": 23343, + "total_acs": 9385, + "total_submitted": 23450, "total_column_articles": 134, "frontend_question_id": "面试题 17.05", "is_new_question": false @@ -4359,8 +4359,8 @@ "question__title": "Missing Number LCCI", "question__title_slug": "missing-number-lcci", "question__hide": false, - "total_acs": 46172, - "total_submitted": 76055, + "total_acs": 46328, + "total_submitted": 76321, "total_column_articles": 674, "frontend_question_id": "面试题 17.04", "is_new_question": false @@ -4380,8 +4380,8 @@ "question__title": "Boolean Evaluation LCCI", "question__title_slug": "boolean-evaluation-lcci", "question__hide": false, - "total_acs": 7255, - "total_submitted": 13749, + "total_acs": 7314, + "total_submitted": 13846, "total_column_articles": 107, "frontend_question_id": "面试题 08.14", "is_new_question": false @@ -4401,8 +4401,8 @@ "question__title": "Word Transformer LCCI", "question__title_slug": "word-transformer-lcci", "question__hide": false, - "total_acs": 13458, - "total_submitted": 33806, + "total_acs": 13482, + "total_submitted": 33869, "total_column_articles": 204, "frontend_question_id": "面试题 17.22", "is_new_question": false @@ -4422,8 +4422,8 @@ "question__title": "Volume of Histogram LCCI", "question__title_slug": "volume-of-histogram-lcci", "question__hide": false, - "total_acs": 49823, - "total_submitted": 78174, + "total_acs": 49864, + "total_submitted": 78243, "total_column_articles": 588, "frontend_question_id": "面试题 17.21", "is_new_question": false @@ -4443,8 +4443,8 @@ "question__title": "Continuous Median LCCI", "question__title_slug": "continuous-median-lcci", "question__hide": false, - "total_acs": 6384, - "total_submitted": 11027, + "total_acs": 6409, + "total_submitted": 11068, "total_column_articles": 107, "frontend_question_id": "面试题 17.20", "is_new_question": false @@ -4464,8 +4464,8 @@ "question__title": "Calculator LCCI", "question__title_slug": "calculator-lcci", "question__hide": false, - "total_acs": 22645, - "total_submitted": 56899, + "total_acs": 22702, + "total_submitted": 57043, "total_column_articles": 284, "frontend_question_id": "面试题 16.26", "is_new_question": false @@ -4485,8 +4485,8 @@ "question__title": "LRU Cache LCCI", "question__title_slug": "lru-cache-lcci", "question__hide": false, - "total_acs": 44496, - "total_submitted": 80357, + "total_acs": 44552, + "total_submitted": 80465, "total_column_articles": 343, "frontend_question_id": "面试题 16.25", "is_new_question": false @@ -4506,8 +4506,8 @@ "question__title": "Add Without Plus LCCI", "question__title_slug": "add-without-plus-lcci", "question__hide": false, - "total_acs": 19621, - "total_submitted": 32091, + "total_acs": 19680, + "total_submitted": 32201, "total_column_articles": 231, "frontend_question_id": "面试题 17.01", "is_new_question": false @@ -4527,8 +4527,8 @@ "question__title": "Multi Search LCCI", "question__title_slug": "multi-search-lcci", "question__hide": false, - "total_acs": 12333, - "total_submitted": 27426, + "total_acs": 12381, + "total_submitted": 27562, "total_column_articles": 244, "frontend_question_id": "面试题 17.17", "is_new_question": false @@ -4548,9 +4548,9 @@ "question__title": "The Masseuse LCCI", "question__title_slug": "the-masseuse-lcci", "question__hide": false, - "total_acs": 74246, - "total_submitted": 145054, - "total_column_articles": 1286, + "total_acs": 74375, + "total_submitted": 145321, + "total_column_articles": 1287, "frontend_question_id": "面试题 17.16", "is_new_question": false }, @@ -4569,9 +4569,9 @@ "question__title": "Longest Word LCCI", "question__title_slug": "longest-word-lcci", "question__hide": false, - "total_acs": 10759, - "total_submitted": 26264, - "total_column_articles": 177, + "total_acs": 10785, + "total_submitted": 26396, + "total_column_articles": 178, "frontend_question_id": "面试题 17.15", "is_new_question": false }, @@ -4590,9 +4590,9 @@ "question__title": "Smallest K LCCI", "question__title_slug": "smallest-k-lcci", "question__hide": false, - "total_acs": 98563, - "total_submitted": 166554, - "total_column_articles": 899, + "total_acs": 98703, + "total_submitted": 166784, + "total_column_articles": 900, "frontend_question_id": "面试题 17.14", "is_new_question": false }, @@ -4611,8 +4611,8 @@ "question__title": "Re-Space LCCI", "question__title_slug": "re-space-lcci", "question__hide": false, - "total_acs": 28013, - "total_submitted": 50599, + "total_acs": 28067, + "total_submitted": 50683, "total_column_articles": 300, "frontend_question_id": "面试题 17.13", "is_new_question": false @@ -4632,9 +4632,9 @@ "question__title": "BiNode LCCI", "question__title_slug": "binode-lcci", "question__hide": false, - "total_acs": 29485, - "total_submitted": 46171, - "total_column_articles": 379, + "total_acs": 29548, + "total_submitted": 46260, + "total_column_articles": 380, "frontend_question_id": "面试题 17.12", "is_new_question": false }, @@ -4653,8 +4653,8 @@ "question__title": "English Int LCCI", "question__title_slug": "english-int-lcci", "question__hide": false, - "total_acs": 3588, - "total_submitted": 9330, + "total_acs": 3615, + "total_submitted": 9364, "total_column_articles": 78, "frontend_question_id": "面试题 16.08", "is_new_question": false @@ -4674,8 +4674,8 @@ "question__title": "Factorial Zeros LCCI", "question__title_slug": "factorial-zeros-lcci", "question__hide": false, - "total_acs": 16397, - "total_submitted": 36918, + "total_acs": 16460, + "total_submitted": 37160, "total_column_articles": 172, "frontend_question_id": "面试题 16.05", "is_new_question": false @@ -4695,8 +4695,8 @@ "question__title": "Sorted Matrix Search LCCI", "question__title_slug": "sorted-matrix-search-lcci", "question__hide": false, - "total_acs": 19391, - "total_submitted": 43358, + "total_acs": 19452, + "total_submitted": 43496, "total_column_articles": 223, "frontend_question_id": "面试题 10.09", "is_new_question": false @@ -4716,9 +4716,9 @@ "question__title": "Hanota LCCI", "question__title_slug": "hanota-lcci", "question__hide": false, - "total_acs": 39397, - "total_submitted": 60408, - "total_column_articles": 396, + "total_acs": 39525, + "total_submitted": 60603, + "total_column_articles": 397, "frontend_question_id": "面试题 08.06", "is_new_question": false }, @@ -4737,8 +4737,8 @@ "question__title": "Peaks and Valleys LCCI", "question__title_slug": "peaks-and-valleys-lcci", "question__hide": false, - "total_acs": 12942, - "total_submitted": 19618, + "total_acs": 12994, + "total_submitted": 19692, "total_column_articles": 159, "frontend_question_id": "面试题 10.11", "is_new_question": false @@ -4758,9 +4758,9 @@ "question__title": "Sorted Merge LCCI", "question__title_slug": "sorted-merge-lcci", "question__hide": false, - "total_acs": 73540, - "total_submitted": 130956, - "total_column_articles": 2517, + "total_acs": 73660, + "total_submitted": 131189, + "total_column_articles": 2519, "frontend_question_id": "面试题 10.01", "is_new_question": false }, @@ -4779,8 +4779,8 @@ "question__title": "Robot in a Grid LCCI", "question__title_slug": "robot-in-a-grid-lcci", "question__hide": false, - "total_acs": 20192, - "total_submitted": 55654, + "total_acs": 20237, + "total_submitted": 55789, "total_column_articles": 297, "frontend_question_id": "面试题 08.02", "is_new_question": false @@ -4800,9 +4800,9 @@ "question__title": "BST Sequences LCCI", "question__title_slug": "bst-sequences-lcci", "question__hide": false, - "total_acs": 10270, - "total_submitted": 21074, - "total_column_articles": 150, + "total_acs": 10312, + "total_submitted": 21148, + "total_column_articles": 151, "frontend_question_id": "面试题 04.09", "is_new_question": false }, @@ -4821,9 +4821,9 @@ "question__title": "Paths with Sum LCCI", "question__title_slug": "paths-with-sum-lcci", "question__hide": false, - "total_acs": 27483, - "total_submitted": 56152, - "total_column_articles": 337, + "total_acs": 27568, + "total_submitted": 56327, + "total_column_articles": 339, "frontend_question_id": "面试题 04.12", "is_new_question": false }, @@ -4842,8 +4842,8 @@ "question__title": "Partition List LCCI", "question__title_slug": "partition-list-lcci", "question__hide": false, - "total_acs": 40303, - "total_submitted": 64580, + "total_acs": 40448, + "total_submitted": 64841, "total_column_articles": 532, "frontend_question_id": "面试题 02.04", "is_new_question": false @@ -4863,9 +4863,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": 85911, - "total_submitted": 109924, - "total_column_articles": 1172, + "total_acs": 86084, + "total_submitted": 110138, + "total_column_articles": 1175, "frontend_question_id": "面试题 02.02", "is_new_question": false }, @@ -4884,9 +4884,9 @@ "question__title": "One Away LCCI", "question__title_slug": "one-away-lcci", "question__hide": false, - "total_acs": 83708, - "total_submitted": 236021, - "total_column_articles": 1305, + "total_acs": 83916, + "total_submitted": 236684, + "total_column_articles": 1306, "frontend_question_id": "面试题 01.05", "is_new_question": false }, @@ -4905,8 +4905,8 @@ "question__title": "Pond Sizes LCCI", "question__title_slug": "pond-sizes-lcci", "question__hide": false, - "total_acs": 26543, - "total_submitted": 42323, + "total_acs": 26586, + "total_submitted": 42395, "total_column_articles": 462, "frontend_question_id": "面试题 16.19", "is_new_question": false @@ -4926,8 +4926,8 @@ "question__title": "Pattern Matching LCCI", "question__title_slug": "pattern-matching-lcci", "question__hide": false, - "total_acs": 17345, - "total_submitted": 51153, + "total_acs": 17355, + "total_submitted": 51182, "total_column_articles": 343, "frontend_question_id": "面试题 16.18", "is_new_question": false @@ -4947,8 +4947,8 @@ "question__title": "Contiguous Sequence LCCI", "question__title_slug": "contiguous-sequence-lcci", "question__hide": false, - "total_acs": 45805, - "total_submitted": 77436, + "total_acs": 45930, + "total_submitted": 77645, "total_column_articles": 499, "frontend_question_id": "面试题 16.17", "is_new_question": false @@ -4968,8 +4968,8 @@ "question__title": "Sub Sort LCCI", "question__title_slug": "sub-sort-lcci", "question__hide": false, - "total_acs": 24003, - "total_submitted": 51213, + "total_acs": 24100, + "total_submitted": 51412, "total_column_articles": 309, "frontend_question_id": "面试题 16.16", "is_new_question": false @@ -4989,9 +4989,9 @@ "question__title": "Master Mind LCCI", "question__title_slug": "master-mind-lcci", "question__hide": false, - "total_acs": 14731, - "total_submitted": 31268, - "total_column_articles": 327, + "total_acs": 14798, + "total_submitted": 31494, + "total_column_articles": 328, "frontend_question_id": "面试题 16.15", "is_new_question": false }, @@ -5010,8 +5010,8 @@ "question__title": "Best Line LCCI", "question__title_slug": "best-line-lcci", "question__hide": false, - "total_acs": 5603, - "total_submitted": 10007, + "total_acs": 5623, + "total_submitted": 10056, "total_column_articles": 87, "frontend_question_id": "面试题 16.14", "is_new_question": false @@ -5031,8 +5031,8 @@ "question__title": "Bisect Squares LCCI", "question__title_slug": "bisect-squares-lcci", "question__hide": false, - "total_acs": 3260, - "total_submitted": 7498, + "total_acs": 3280, + "total_submitted": 7543, "total_column_articles": 79, "frontend_question_id": "面试题 16.13", "is_new_question": false @@ -5052,8 +5052,8 @@ "question__title": "Diving Board LCCI", "question__title_slug": "diving-board-lcci", "question__hide": false, - "total_acs": 58072, - "total_submitted": 132224, + "total_acs": 58120, + "total_submitted": 132325, "total_column_articles": 664, "frontend_question_id": "面试题 16.11", "is_new_question": false @@ -5073,9 +5073,9 @@ "question__title": "Living People LCCI", "question__title_slug": "living-people-lcci", "question__hide": false, - "total_acs": 15596, - "total_submitted": 22809, - "total_column_articles": 257, + "total_acs": 15628, + "total_submitted": 22866, + "total_column_articles": 259, "frontend_question_id": "面试题 16.10", "is_new_question": false }, @@ -5094,9 +5094,9 @@ "question__title": "Operations LCCI", "question__title_slug": "operations-lcci", "question__hide": false, - "total_acs": 3550, - "total_submitted": 6331, - "total_column_articles": 59, + "total_acs": 3564, + "total_submitted": 6350, + "total_column_articles": 60, "frontend_question_id": "面试题 16.09", "is_new_question": false }, @@ -5115,9 +5115,9 @@ "question__title": "Maximum LCCI", "question__title_slug": "maximum-lcci", "question__hide": false, - "total_acs": 30332, - "total_submitted": 41117, - "total_column_articles": 404, + "total_acs": 30453, + "total_submitted": 41268, + "total_column_articles": 406, "frontend_question_id": "面试题 16.07", "is_new_question": false }, @@ -5136,8 +5136,8 @@ "question__title": "Permutation II LCCI", "question__title_slug": "permutation-ii-lcci", "question__hide": false, - "total_acs": 26887, - "total_submitted": 38186, + "total_acs": 26967, + "total_submitted": 38283, "total_column_articles": 348, "frontend_question_id": "面试题 08.08", "is_new_question": false @@ -5157,9 +5157,9 @@ "question__title": "二叉树的最近公共祖先 LCOF", "question__title_slug": "er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 196068, - "total_submitted": 278425, - "total_column_articles": 1051, + "total_acs": 196775, + "total_submitted": 279404, + "total_column_articles": 1053, "frontend_question_id": "剑指 Offer 68 - II", "is_new_question": false }, @@ -5178,9 +5178,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": 202028, - "total_submitted": 290628, - "total_column_articles": 1049, + "total_acs": 202831, + "total_submitted": 291770, + "total_column_articles": 1054, "frontend_question_id": "剑指 Offer 68 - I", "is_new_question": false }, @@ -5199,9 +5199,9 @@ "question__title": "求1+2+…+n LCOF", "question__title_slug": "qiu-12n-lcof", "question__hide": false, - "total_acs": 218458, - "total_submitted": 253942, - "total_column_articles": 1713, + "total_acs": 219320, + "total_submitted": 254932, + "total_column_articles": 1717, "frontend_question_id": "剑指 Offer 64", "is_new_question": false }, @@ -5220,9 +5220,9 @@ "question__title": "股票的最大利润 LCOF", "question__title_slug": "gu-piao-de-zui-da-li-run-lcof", "question__hide": false, - "total_acs": 243207, - "total_submitted": 384085, - "total_column_articles": 1500, + "total_acs": 244279, + "total_submitted": 385885, + "total_column_articles": 1515, "frontend_question_id": "剑指 Offer 63", "is_new_question": false }, @@ -5241,9 +5241,9 @@ "question__title": "圆圈中最后剩下的数字 LCOF", "question__title_slug": "yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof", "question__hide": false, - "total_acs": 177271, - "total_submitted": 269296, - "total_column_articles": 1047, + "total_acs": 177809, + "total_submitted": 270110, + "total_column_articles": 1049, "frontend_question_id": "剑指 Offer 62", "is_new_question": false }, @@ -5262,9 +5262,9 @@ "question__title": "平衡二叉树 LCOF", "question__title_slug": "ping-heng-er-cha-shu-lcof", "question__hide": false, - "total_acs": 230035, - "total_submitted": 385118, - "total_column_articles": 1381, + "total_acs": 230893, + "total_submitted": 386530, + "total_column_articles": 1385, "frontend_question_id": "剑指 Offer 55 - II", "is_new_question": false }, @@ -5283,9 +5283,9 @@ "question__title": "扑克牌中的顺子 LCOF", "question__title_slug": "bu-ke-pai-zhong-de-shun-zi-lcof", "question__hide": false, - "total_acs": 193083, - "total_submitted": 421219, - "total_column_articles": 1602, + "total_acs": 193961, + "total_submitted": 423247, + "total_column_articles": 1609, "frontend_question_id": "面试题61", "is_new_question": false }, @@ -5304,9 +5304,9 @@ "question__title": "把字符串转换成整数 LCOF", "question__title_slug": "ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof", "question__hide": false, - "total_acs": 119532, - "total_submitted": 410918, - "total_column_articles": 912, + "total_acs": 119896, + "total_submitted": 412182, + "total_column_articles": 915, "frontend_question_id": "面试题67", "is_new_question": false }, @@ -5325,9 +5325,9 @@ "question__title": "n个骰子的点数 LCOF", "question__title_slug": "nge-tou-zi-de-dian-shu-lcof", "question__hide": false, - "total_acs": 113157, - "total_submitted": 196400, - "total_column_articles": 933, + "total_acs": 113528, + "total_submitted": 197040, + "total_column_articles": 936, "frontend_question_id": "剑指 Offer 60", "is_new_question": false }, @@ -5346,9 +5346,9 @@ "question__title": "构建乘积数组 LCOF", "question__title_slug": "gou-jian-cheng-ji-shu-zu-lcof", "question__hide": false, - "total_acs": 132523, - "total_submitted": 224154, - "total_column_articles": 891, + "total_acs": 132993, + "total_submitted": 225055, + "total_column_articles": 893, "frontend_question_id": "剑指 Offer 66", "is_new_question": false }, @@ -5367,9 +5367,9 @@ "question__title": "队列的最大值 LCOF", "question__title_slug": "dui-lie-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 151545, - "total_submitted": 315547, - "total_column_articles": 1381, + "total_acs": 151948, + "total_submitted": 316267, + "total_column_articles": 1386, "frontend_question_id": "面试题59 - II", "is_new_question": false }, @@ -5388,9 +5388,9 @@ "question__title": "滑动窗口的最大值 LCOF", "question__title_slug": "hua-dong-chuang-kou-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 207332, - "total_submitted": 460197, - "total_column_articles": 1642, + "total_acs": 207784, + "total_submitted": 461081, + "total_column_articles": 1650, "frontend_question_id": "剑指 Offer 59 - I", "is_new_question": false }, @@ -5409,9 +5409,9 @@ "question__title": "不用加减乘除做加法 LCOF", "question__title_slug": "bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof", "question__hide": false, - "total_acs": 129026, - "total_submitted": 216612, - "total_column_articles": 785, + "total_acs": 129567, + "total_submitted": 217501, + "total_column_articles": 786, "frontend_question_id": "剑指 Offer 65", "is_new_question": false }, @@ -5430,9 +5430,9 @@ "question__title": "丑数 LCOF", "question__title_slug": "chou-shu-lcof", "question__hide": false, - "total_acs": 150292, - "total_submitted": 230566, - "total_column_articles": 817, + "total_acs": 150756, + "total_submitted": 231289, + "total_column_articles": 824, "frontend_question_id": "剑指 Offer 49", "is_new_question": false }, @@ -5451,9 +5451,9 @@ "question__title": "二叉搜索树的第k大节点 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof", "question__hide": false, - "total_acs": 276211, - "total_submitted": 361006, - "total_column_articles": 1741, + "total_acs": 277219, + "total_submitted": 362305, + "total_column_articles": 1749, "frontend_question_id": "剑指 Offer 54", "is_new_question": false }, @@ -5472,9 +5472,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": 274202, - "total_submitted": 590785, - "total_column_articles": 1709, + "total_acs": 275318, + "total_submitted": 593263, + "total_column_articles": 1718, "frontend_question_id": "剑指 Offer 48", "is_new_question": false }, @@ -5493,9 +5493,9 @@ "question__title": "缺失的数字 LCOF", "question__title_slug": "que-shi-de-shu-zi-lcof", "question__hide": false, - "total_acs": 313158, - "total_submitted": 696505, - "total_column_articles": 2357, + "total_acs": 314687, + "total_submitted": 699801, + "total_column_articles": 2369, "frontend_question_id": "剑指 Offer 53 - II", "is_new_question": false }, @@ -5514,9 +5514,9 @@ "question__title": "左旋转字符串 LCOF", "question__title_slug": "zuo-xuan-zhuan-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 412253, - "total_submitted": 479026, - "total_column_articles": 2873, + "total_acs": 414618, + "total_submitted": 481776, + "total_column_articles": 2891, "frontend_question_id": "剑指 Offer 58 - II", "is_new_question": false }, @@ -5535,9 +5535,9 @@ "question__title": "在排序数组中查找数字 LCOF", "question__title_slug": "zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof", "question__hide": false, - "total_acs": 344927, - "total_submitted": 650391, - "total_column_articles": 2469, + "total_acs": 346465, + "total_submitted": 653247, + "total_column_articles": 2479, "frontend_question_id": "剑指 Offer 53 - I", "is_new_question": false }, @@ -5556,9 +5556,9 @@ "question__title": "翻转单词顺序 LCOF", "question__title_slug": "fan-zhuan-dan-ci-shun-xu-lcof", "question__hide": false, - "total_acs": 228061, - "total_submitted": 510405, - "total_column_articles": 1516, + "total_acs": 229090, + "total_submitted": 512492, + "total_column_articles": 1524, "frontend_question_id": "剑指 Offer 58 - I", "is_new_question": false }, @@ -5577,9 +5577,9 @@ "question__title": "礼物的最大价值 LCOF", "question__title_slug": "li-wu-de-zui-da-jie-zhi-lcof", "question__hide": false, - "total_acs": 221253, - "total_submitted": 320040, - "total_column_articles": 1602, + "total_acs": 222301, + "total_submitted": 321522, + "total_column_articles": 1608, "frontend_question_id": "剑指 Offer 47", "is_new_question": false }, @@ -5598,9 +5598,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": 284019, - "total_submitted": 432062, - "total_column_articles": 1485, + "total_acs": 285093, + "total_submitted": 433700, + "total_column_articles": 1488, "frontend_question_id": "剑指 Offer 52", "is_new_question": false }, @@ -5619,9 +5619,9 @@ "question__title": "把数字翻译成字符串 LCOF", "question__title_slug": "ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 224667, - "total_submitted": 432983, - "total_column_articles": 2179, + "total_acs": 225640, + "total_submitted": 435002, + "total_column_articles": 2186, "frontend_question_id": "剑指 Offer 46", "is_new_question": false }, @@ -5640,9 +5640,9 @@ "question__title": "和为s的连续正数序列 LCOF", "question__title_slug": "he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof", "question__hide": false, - "total_acs": 221133, - "total_submitted": 309905, - "total_column_articles": 2362, + "total_acs": 221819, + "total_submitted": 310824, + "total_column_articles": 2370, "frontend_question_id": "剑指 Offer 57 - II", "is_new_question": false }, @@ -5661,9 +5661,9 @@ "question__title": "把数组排成最小的数 LCOF", "question__title_slug": "ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof", "question__hide": false, - "total_acs": 203628, - "total_submitted": 367180, - "total_column_articles": 1380, + "total_acs": 204379, + "total_submitted": 368547, + "total_column_articles": 1385, "frontend_question_id": "面试题45", "is_new_question": false }, @@ -5682,9 +5682,9 @@ "question__title": "和为s的两个数字 LCOF", "question__title_slug": "he-wei-sde-liang-ge-shu-zi-lcof", "question__hide": false, - "total_acs": 239125, - "total_submitted": 351361, - "total_column_articles": 1346, + "total_acs": 240249, + "total_submitted": 352992, + "total_column_articles": 1351, "frontend_question_id": "剑指 Offer 57", "is_new_question": false }, @@ -5703,9 +5703,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": 153618, - "total_submitted": 190368, - "total_column_articles": 1034, + "total_acs": 154105, + "total_submitted": 190974, + "total_column_articles": 1035, "frontend_question_id": "剑指 Offer 56 - II", "is_new_question": false }, @@ -5724,9 +5724,9 @@ "question__title": "数组中数字出现的次数 LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 185881, - "total_submitted": 268893, - "total_column_articles": 1480, + "total_acs": 186421, + "total_submitted": 269687, + "total_column_articles": 1485, "frontend_question_id": "剑指 Offer 56 - I", "is_new_question": false }, @@ -5745,9 +5745,9 @@ "question__title": "二叉树的深度 LCOF", "question__title_slug": "er-cha-shu-de-shen-du-lcof", "question__hide": false, - "total_acs": 282532, - "total_submitted": 355790, - "total_column_articles": 1736, + "total_acs": 283495, + "total_submitted": 356925, + "total_column_articles": 1745, "frontend_question_id": "剑指 Offer 55 - I", "is_new_question": false }, @@ -5766,9 +5766,9 @@ "question__title": "数组中的逆序对 LCOF", "question__title_slug": "shu-zu-zhong-de-ni-xu-dui-lcof", "question__hide": false, - "total_acs": 181015, - "total_submitted": 364655, - "total_column_articles": 1389, + "total_acs": 181643, + "total_submitted": 365839, + "total_column_articles": 1395, "frontend_question_id": "剑指 Offer 51", "is_new_question": false }, @@ -5787,9 +5787,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": 237338, - "total_submitted": 402339, - "total_column_articles": 1411, + "total_acs": 238299, + "total_submitted": 403842, + "total_column_articles": 1414, "frontend_question_id": "剑指 Offer 34", "is_new_question": false }, @@ -5808,9 +5808,9 @@ "question__title": "第一个只出现一次的字符 LCOF", "question__title_slug": "di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof", "question__hide": false, - "total_acs": 287420, - "total_submitted": 463029, - "total_column_articles": 1722, + "total_acs": 288785, + "total_submitted": 465239, + "total_column_articles": 1731, "frontend_question_id": "剑指 Offer 50", "is_new_question": false }, @@ -5829,9 +5829,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": 201001, - "total_submitted": 354408, - "total_column_articles": 1537, + "total_acs": 201710, + "total_submitted": 355611, + "total_column_articles": 1543, "frontend_question_id": "剑指 Offer 33", "is_new_question": false }, @@ -5850,9 +5850,9 @@ "question__title": "从上到下打印二叉树 III LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof", "question__hide": false, - "total_acs": 229191, - "total_submitted": 392064, - "total_column_articles": 1956, + "total_acs": 230249, + "total_submitted": 393872, + "total_column_articles": 1964, "frontend_question_id": "剑指 Offer 32 - III", "is_new_question": false }, @@ -5871,9 +5871,9 @@ "question__title": "数字序列中某一位的数字 LCOF", "question__title_slug": "shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof", "question__hide": false, - "total_acs": 96857, - "total_submitted": 224915, - "total_column_articles": 749, + "total_acs": 97150, + "total_submitted": 225604, + "total_column_articles": 751, "frontend_question_id": "剑指 Offer 44", "is_new_question": false }, @@ -5892,9 +5892,9 @@ "question__title": "从上到下打印二叉树 II LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof", "question__hide": false, - "total_acs": 248406, - "total_submitted": 359882, - "total_column_articles": 1748, + "total_acs": 249539, + "total_submitted": 361399, + "total_column_articles": 1759, "frontend_question_id": "剑指 Offer 32 - II", "is_new_question": false }, @@ -5913,9 +5913,9 @@ "question__title": "从上到下打印二叉树 LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-lcof", "question__hide": false, - "total_acs": 251578, - "total_submitted": 395932, - "total_column_articles": 1597, + "total_acs": 252732, + "total_submitted": 397845, + "total_column_articles": 1604, "frontend_question_id": "剑指 Offer 32 - I", "is_new_question": false }, @@ -5934,9 +5934,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": 276768, - "total_submitted": 394585, - "total_column_articles": 1496, + "total_acs": 277673, + "total_submitted": 395873, + "total_column_articles": 1506, "frontend_question_id": "剑指 Offer 39", "is_new_question": false }, @@ -5955,9 +5955,9 @@ "question__title": "1~n整数中1出现的次数 LCOF", "question__title_slug": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 81384, - "total_submitted": 161111, - "total_column_articles": 737, + "total_acs": 81596, + "total_submitted": 161510, + "total_column_articles": 740, "frontend_question_id": "剑指 Offer 43", "is_new_question": false }, @@ -5976,9 +5976,9 @@ "question__title": "字符串的排列 LCOF", "question__title_slug": "zi-fu-chuan-de-pai-lie-lcof", "question__hide": false, - "total_acs": 250912, - "total_submitted": 434681, - "total_column_articles": 1560, + "total_acs": 251458, + "total_submitted": 435568, + "total_column_articles": 1564, "frontend_question_id": "剑指 Offer 38", "is_new_question": false }, @@ -5997,9 +5997,9 @@ "question__title": "序列化二叉树 LCOF", "question__title_slug": "xu-lie-hua-er-cha-shu-lcof", "question__hide": false, - "total_acs": 125335, - "total_submitted": 217756, - "total_column_articles": 814, + "total_acs": 125651, + "total_submitted": 218290, + "total_column_articles": 819, "frontend_question_id": "剑指 Offer 37", "is_new_question": false }, @@ -6018,9 +6018,9 @@ "question__title": "栈的压入、弹出序列 LCOF", "question__title_slug": "zhan-de-ya-ru-dan-chu-xu-lie-lcof", "question__hide": false, - "total_acs": 195491, - "total_submitted": 320592, - "total_column_articles": 1469, + "total_acs": 196130, + "total_submitted": 321553, + "total_column_articles": 1473, "frontend_question_id": "剑指 Offer 31", "is_new_question": false }, @@ -6039,9 +6039,9 @@ "question__title": "二叉搜索树与双向链表 LCOF", "question__title_slug": "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof", "question__hide": false, - "total_acs": 193102, - "total_submitted": 296362, - "total_column_articles": 1519, + "total_acs": 193867, + "total_submitted": 297504, + "total_column_articles": 1522, "frontend_question_id": "剑指 Offer 36", "is_new_question": false }, @@ -6060,9 +6060,9 @@ "question__title": "连续子数组的最大和 LCOF", "question__title_slug": "lian-xu-zi-shu-zu-de-zui-da-he-lcof", "question__hide": false, - "total_acs": 367325, - "total_submitted": 606028, - "total_column_articles": 2149, + "total_acs": 368677, + "total_submitted": 608264, + "total_column_articles": 2159, "frontend_question_id": "剑指 Offer 42", "is_new_question": false }, @@ -6081,9 +6081,9 @@ "question__title": "数据流中的中位数 LCOF", "question__title_slug": "shu-ju-liu-zhong-de-zhong-wei-shu-lcof", "question__hide": false, - "total_acs": 120901, - "total_submitted": 206674, - "total_column_articles": 822, + "total_acs": 121476, + "total_submitted": 207641, + "total_column_articles": 828, "frontend_question_id": "剑指 Offer 41", "is_new_question": false }, @@ -6102,9 +6102,9 @@ "question__title": "包含min函数的栈 LCOF", "question__title_slug": "bao-han-minhan-shu-de-zhan-lcof", "question__hide": false, - "total_acs": 307838, - "total_submitted": 553956, - "total_column_articles": 1860, + "total_acs": 309574, + "total_submitted": 557160, + "total_column_articles": 1869, "frontend_question_id": "剑指 Offer 30", "is_new_question": false }, @@ -6123,9 +6123,9 @@ "question__title": "最小的k个数 LCOF", "question__title_slug": "zui-xiao-de-kge-shu-lcof", "question__hide": false, - "total_acs": 402854, - "total_submitted": 700972, - "total_column_articles": 2442, + "total_acs": 404211, + "total_submitted": 703162, + "total_column_articles": 2449, "frontend_question_id": "剑指 Offer 40", "is_new_question": false }, @@ -6144,9 +6144,9 @@ "question__title": "复杂链表的复制 LCOF", "question__title_slug": "fu-za-lian-biao-de-fu-zhi-lcof", "question__hide": false, - "total_acs": 250610, - "total_submitted": 349708, - "total_column_articles": 1626, + "total_acs": 251853, + "total_submitted": 351406, + "total_column_articles": 1631, "frontend_question_id": "剑指 Offer 35", "is_new_question": false }, @@ -6165,9 +6165,9 @@ "question__title": "删除链表的节点 LCOF", "question__title_slug": "shan-chu-lian-biao-de-jie-dian-lcof", "question__hide": false, - "total_acs": 321300, - "total_submitted": 534754, - "total_column_articles": 2157, + "total_acs": 322506, + "total_submitted": 536720, + "total_column_articles": 2161, "frontend_question_id": "剑指 Offer 18", "is_new_question": false }, @@ -6186,9 +6186,9 @@ "question__title": "反转链表 LCOF", "question__title_slug": "fan-zhuan-lian-biao-lcof", "question__hide": false, - "total_acs": 509547, - "total_submitted": 684533, - "total_column_articles": 2728, + "total_acs": 511441, + "total_submitted": 687036, + "total_column_articles": 2733, "frontend_question_id": "剑指 Offer 24", "is_new_question": false }, @@ -6207,9 +6207,9 @@ "question__title": "正则表达式匹配 LCOF", "question__title_slug": "zheng-ze-biao-da-shi-pi-pei-lcof", "question__hide": false, - "total_acs": 109697, - "total_submitted": 283780, - "total_column_articles": 670, + "total_acs": 110048, + "total_submitted": 284671, + "total_column_articles": 672, "frontend_question_id": "剑指 Offer 19", "is_new_question": false }, @@ -6228,9 +6228,9 @@ "question__title": "打印从1到最大的n位数 LCOF", "question__title_slug": "da-yin-cong-1dao-zui-da-de-nwei-shu-lcof", "question__hide": false, - "total_acs": 237704, - "total_submitted": 305497, - "total_column_articles": 1512, + "total_acs": 238350, + "total_submitted": 306290, + "total_column_articles": 1520, "frontend_question_id": "剑指 Offer 17", "is_new_question": false }, @@ -6249,9 +6249,9 @@ "question__title": "数值的整数次方 LCOF", "question__title_slug": "shu-zhi-de-zheng-shu-ci-fang-lcof", "question__hide": false, - "total_acs": 215679, - "total_submitted": 619029, - "total_column_articles": 1198, + "total_acs": 216448, + "total_submitted": 621157, + "total_column_articles": 1199, "frontend_question_id": "剑指 Offer 16", "is_new_question": false }, @@ -6270,9 +6270,9 @@ "question__title": "链表中倒数第k个节点 LCOF", "question__title_slug": "lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof", "question__hide": false, - "total_acs": 421840, - "total_submitted": 526124, - "total_column_articles": 3403, + "total_acs": 423276, + "total_submitted": 527883, + "total_column_articles": 3414, "frontend_question_id": "剑指 Offer 22", "is_new_question": false }, @@ -6291,9 +6291,9 @@ "question__title": "顺时针打印矩阵 LCOF", "question__title_slug": "shun-shi-zhen-da-yin-ju-zhen-lcof", "question__hide": false, - "total_acs": 235092, - "total_submitted": 542084, - "total_column_articles": 2072, + "total_acs": 235859, + "total_submitted": 543966, + "total_column_articles": 2075, "frontend_question_id": "剑指 Offer 29", "is_new_question": false }, @@ -6312,9 +6312,9 @@ "question__title": "二进制中1的个数 LCOF", "question__title_slug": "er-jin-zhi-zhong-1de-ge-shu-lcof", "question__hide": false, - "total_acs": 307559, - "total_submitted": 407832, - "total_column_articles": 1736, + "total_acs": 308504, + "total_submitted": 409003, + "total_column_articles": 1740, "frontend_question_id": "剑指 Offer 15", "is_new_question": false }, @@ -6333,9 +6333,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": 337434, - "total_submitted": 519279, - "total_column_articles": 2466, + "total_acs": 338739, + "total_submitted": 521246, + "total_column_articles": 2471, "frontend_question_id": "剑指 Offer 21", "is_new_question": false }, @@ -6354,9 +6354,9 @@ "question__title": "表示数值的字符串 LCOF", "question__title_slug": "biao-shi-shu-zhi-de-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 126649, - "total_submitted": 499125, - "total_column_articles": 1392, + "total_acs": 127030, + "total_submitted": 500432, + "total_column_articles": 1399, "frontend_question_id": "剑指 Offer 20", "is_new_question": false }, @@ -6375,9 +6375,9 @@ "question__title": "对称的二叉树 LCOF", "question__title_slug": "dui-cheng-de-er-cha-shu-lcof", "question__hide": false, - "total_acs": 265957, - "total_submitted": 460825, - "total_column_articles": 1733, + "total_acs": 267084, + "total_submitted": 462725, + "total_column_articles": 1738, "frontend_question_id": "剑指 Offer 28", "is_new_question": false }, @@ -6396,9 +6396,9 @@ "question__title": "二叉树的镜像 LCOF", "question__title_slug": "er-cha-shu-de-jing-xiang-lcof", "question__hide": false, - "total_acs": 326910, - "total_submitted": 410471, - "total_column_articles": 2102, + "total_acs": 328147, + "total_submitted": 412022, + "total_column_articles": 2112, "frontend_question_id": "剑指 Offer 27", "is_new_question": false }, @@ -6417,9 +6417,9 @@ "question__title": "树的子结构 LCOF", "question__title_slug": "shu-de-zi-jie-gou-lcof", "question__hide": false, - "total_acs": 275116, - "total_submitted": 589689, - "total_column_articles": 1961, + "total_acs": 276296, + "total_submitted": 592200, + "total_column_articles": 1965, "frontend_question_id": "剑指 Offer 26", "is_new_question": false }, @@ -6438,9 +6438,9 @@ "question__title": "合并两个排序的链表 LCOF", "question__title_slug": "he-bing-liang-ge-pai-xu-de-lian-biao-lcof", "question__hide": false, - "total_acs": 320792, - "total_submitted": 441561, - "total_column_articles": 1806, + "total_acs": 322027, + "total_submitted": 443324, + "total_column_articles": 1812, "frontend_question_id": "剑指 Offer 25", "is_new_question": false }, @@ -6459,9 +6459,9 @@ "question__title": "剪绳子 II LCOF", "question__title_slug": "jian-sheng-zi-ii-lcof", "question__hide": false, - "total_acs": 137488, - "total_submitted": 433985, - "total_column_articles": 734, + "total_acs": 137821, + "total_submitted": 434983, + "total_column_articles": 737, "frontend_question_id": "剑指 Offer 14- II", "is_new_question": false }, @@ -6480,9 +6480,9 @@ "question__title": "剪绳子 LCOF", "question__title_slug": "jian-sheng-zi-lcof", "question__hide": false, - "total_acs": 262437, - "total_submitted": 456579, - "total_column_articles": 1938, + "total_acs": 263196, + "total_submitted": 457811, + "total_column_articles": 1941, "frontend_question_id": "剑指 Offer 14- I", "is_new_question": false }, @@ -6501,9 +6501,9 @@ "question__title": "重建二叉树 LCOF", "question__title_slug": "zhong-jian-er-cha-shu-lcof", "question__hide": false, - "total_acs": 307007, - "total_submitted": 435858, - "total_column_articles": 2052, + "total_acs": 307869, + "total_submitted": 437047, + "total_column_articles": 2053, "frontend_question_id": "剑指 Offer 07", "is_new_question": false }, @@ -6522,9 +6522,9 @@ "question__title": "从尾到头打印链表 LCOF", "question__title_slug": "cong-wei-dao-tou-da-yin-lian-biao-lcof", "question__hide": false, - "total_acs": 553956, - "total_submitted": 741365, - "total_column_articles": 3340, + "total_acs": 556148, + "total_submitted": 744336, + "total_column_articles": 3349, "frontend_question_id": "剑指 Offer 06", "is_new_question": false }, @@ -6543,9 +6543,9 @@ "question__title": "机器人的运动范围 LCOF", "question__title_slug": "ji-qi-ren-de-yun-dong-fan-wei-lcof", "question__hide": false, - "total_acs": 293026, - "total_submitted": 546705, - "total_column_articles": 2409, + "total_acs": 293930, + "total_submitted": 548228, + "total_column_articles": 2413, "frontend_question_id": "面试题13", "is_new_question": false }, @@ -6564,9 +6564,9 @@ "question__title": "替换空格 LCOF", "question__title_slug": "ti-huan-kong-ge-lcof", "question__hide": false, - "total_acs": 577543, - "total_submitted": 764264, - "total_column_articles": 3195, + "total_acs": 580473, + "total_submitted": 768174, + "total_column_articles": 3210, "frontend_question_id": "剑指 Offer 05", "is_new_question": false }, @@ -6585,9 +6585,9 @@ "question__title": "矩阵中的路径 LCOF", "question__title_slug": "ju-zhen-zhong-de-lu-jing-lcof", "question__hide": false, - "total_acs": 304380, - "total_submitted": 666829, - "total_column_articles": 1746, + "total_acs": 305549, + "total_submitted": 669221, + "total_column_articles": 1749, "frontend_question_id": "剑指 Offer 12", "is_new_question": false }, @@ -6606,9 +6606,9 @@ "question__title": "旋转数组的最小数字 LCOF", "question__title_slug": "xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof", "question__hide": false, - "total_acs": 445709, - "total_submitted": 901804, - "total_column_articles": 2455, + "total_acs": 447311, + "total_submitted": 904802, + "total_column_articles": 2461, "frontend_question_id": "剑指 Offer 11", "is_new_question": false }, @@ -6627,9 +6627,9 @@ "question__title": "青蛙跳台阶问题 LCOF", "question__title_slug": "qing-wa-tiao-tai-jie-wen-ti-lcof", "question__hide": false, - "total_acs": 343817, - "total_submitted": 752427, - "total_column_articles": 1952, + "total_acs": 345159, + "total_submitted": 755176, + "total_column_articles": 1962, "frontend_question_id": "剑指 Offer 10- II", "is_new_question": false }, @@ -6648,9 +6648,9 @@ "question__title": "二维数组中的查找 LCOF", "question__title_slug": "er-wei-shu-zu-zhong-de-cha-zhao-lcof", "question__hide": false, - "total_acs": 463468, - "total_submitted": 1163777, - "total_column_articles": 3281, + "total_acs": 465290, + "total_submitted": 1168574, + "total_column_articles": 3288, "frontend_question_id": "剑指 Offer 04", "is_new_question": false }, @@ -6669,9 +6669,9 @@ "question__title": "数组中重复的数字 LCOF", "question__title_slug": "shu-zu-zhong-zhong-fu-de-shu-zi-lcof", "question__hide": false, - "total_acs": 680646, - "total_submitted": 1008894, - "total_column_articles": 4102, + "total_acs": 683071, + "total_submitted": 1012662, + "total_column_articles": 4112, "frontend_question_id": "剑指 Offer 03", "is_new_question": false }, @@ -6690,9 +6690,9 @@ "question__title": "斐波那契数列 LCOF", "question__title_slug": "fei-bo-na-qi-shu-lie-lcof", "question__hide": false, - "total_acs": 445057, - "total_submitted": 1234629, - "total_column_articles": 2671, + "total_acs": 446708, + "total_submitted": 1239266, + "total_column_articles": 2682, "frontend_question_id": "剑指 Offer 10- I", "is_new_question": false }, @@ -6711,9 +6711,9 @@ "question__title": "用两个栈实现队列 LCOF", "question__title_slug": "yong-liang-ge-zhan-shi-xian-dui-lie-lcof", "question__hide": false, - "total_acs": 506059, - "total_submitted": 716471, - "total_column_articles": 2765, + "total_acs": 508267, + "total_submitted": 719623, + "total_column_articles": 2781, "frontend_question_id": "剑指 Offer 09", "is_new_question": false }, @@ -6732,8 +6732,8 @@ "question__title": "Smallest Difference LCCI", "question__title_slug": "smallest-difference-lcci", "question__hide": false, - "total_acs": 20517, - "total_submitted": 47847, + "total_acs": 20556, + "total_submitted": 47942, "total_column_articles": 274, "frontend_question_id": "面试题 16.06", "is_new_question": false @@ -6753,9 +6753,9 @@ "question__title": "Tic-Tac-Toe LCCI", "question__title_slug": "tic-tac-toe-lcci", "question__hide": false, - "total_acs": 10871, - "total_submitted": 23256, - "total_column_articles": 210, + "total_acs": 10896, + "total_submitted": 23316, + "total_column_articles": 211, "frontend_question_id": "面试题 16.04", "is_new_question": false }, @@ -6774,8 +6774,8 @@ "question__title": "Intersection LCCI", "question__title_slug": "intersection-lcci", "question__hide": false, - "total_acs": 10804, - "total_submitted": 24605, + "total_acs": 10824, + "total_submitted": 24660, "total_column_articles": 249, "frontend_question_id": "面试题 16.03", "is_new_question": false @@ -6795,9 +6795,9 @@ "question__title": "Words Frequency LCCI", "question__title_slug": "words-frequency-lcci", "question__hide": false, - "total_acs": 22207, - "total_submitted": 28973, - "total_column_articles": 264, + "total_acs": 22272, + "total_submitted": 29046, + "total_column_articles": 265, "frontend_question_id": "面试题 16.02", "is_new_question": false }, @@ -6816,8 +6816,8 @@ "question__title": "Swap Numbers LCCI", "question__title_slug": "swap-numbers-lcci", "question__hide": false, - "total_acs": 36642, - "total_submitted": 44772, + "total_acs": 36768, + "total_submitted": 44932, "total_column_articles": 537, "frontend_question_id": "面试题 16.01", "is_new_question": false @@ -6837,9 +6837,9 @@ "question__title": "Sparse Array Search LCCI", "question__title_slug": "sparse-array-search-lcci", "question__hide": false, - "total_acs": 28294, - "total_submitted": 49836, - "total_column_articles": 346, + "total_acs": 28390, + "total_submitted": 49980, + "total_column_articles": 349, "frontend_question_id": "面试题 10.05", "is_new_question": false }, @@ -6858,8 +6858,8 @@ "question__title": "Permutation I LCCI", "question__title_slug": "permutation-i-lcci", "question__hide": false, - "total_acs": 30465, - "total_submitted": 37592, + "total_acs": 30536, + "total_submitted": 37686, "total_column_articles": 439, "frontend_question_id": "面试题 08.07", "is_new_question": false @@ -6879,8 +6879,8 @@ "question__title": "Magic Index LCCI", "question__title_slug": "magic-index-lcci", "question__hide": false, - "total_acs": 60207, - "total_submitted": 89262, + "total_acs": 60279, + "total_submitted": 89366, "total_column_articles": 485, "frontend_question_id": "面试题 08.03", "is_new_question": false @@ -6900,8 +6900,8 @@ "question__title": "Eight Queens LCCI", "question__title_slug": "eight-queens-lcci", "question__hide": false, - "total_acs": 26919, - "total_submitted": 35119, + "total_acs": 26981, + "total_submitted": 35194, "total_column_articles": 401, "frontend_question_id": "面试题 08.12", "is_new_question": false @@ -6921,9 +6921,9 @@ "question__title": "Search Rotate Array LCCI", "question__title_slug": "search-rotate-array-lcci", "question__hide": false, - "total_acs": 23738, - "total_submitted": 61496, - "total_column_articles": 285, + "total_acs": 23832, + "total_submitted": 61702, + "total_column_articles": 287, "frontend_question_id": "面试题 10.03", "is_new_question": false }, @@ -6942,8 +6942,8 @@ "question__title": "Coin LCCI", "question__title_slug": "coin-lcci", "question__hide": false, - "total_acs": 41903, - "total_submitted": 84220, + "total_acs": 41955, + "total_submitted": 84309, "total_column_articles": 372, "frontend_question_id": "面试题 08.11", "is_new_question": false @@ -6963,9 +6963,9 @@ "question__title": "Reverse Bits LCCI", "question__title_slug": "reverse-bits-lcci", "question__hide": false, - "total_acs": 19439, - "total_submitted": 51258, - "total_column_articles": 331, + "total_acs": 19525, + "total_submitted": 51503, + "total_column_articles": 333, "frontend_question_id": "面试题 05.03", "is_new_question": false }, @@ -6984,8 +6984,8 @@ "question__title": "Check SubTree LCCI", "question__title_slug": "check-subtree-lcci", "question__hide": false, - "total_acs": 25151, - "total_submitted": 36236, + "total_acs": 25218, + "total_submitted": 36366, "total_column_articles": 369, "frontend_question_id": "面试题 04.10", "is_new_question": false @@ -7005,9 +7005,9 @@ "question__title": "Animal Shelter LCCI", "question__title_slug": "animal-shelter-lcci", "question__hide": false, - "total_acs": 17585, - "total_submitted": 30052, - "total_column_articles": 245, + "total_acs": 17646, + "total_submitted": 30156, + "total_column_articles": 247, "frontend_question_id": "面试题 03.06", "is_new_question": false }, @@ -7026,8 +7026,8 @@ "question__title": "Binary Number to String LCCI", "question__title_slug": "bianry-number-to-string-lcci", "question__hide": false, - "total_acs": 12318, - "total_submitted": 17152, + "total_acs": 12356, + "total_submitted": 17203, "total_column_articles": 193, "frontend_question_id": "面试题 05.02", "is_new_question": false @@ -7047,8 +7047,8 @@ "question__title": "Pile Box LCCI", "question__title_slug": "pile-box-lcci", "question__hide": false, - "total_acs": 11014, - "total_submitted": 21597, + "total_acs": 11046, + "total_submitted": 21654, "total_column_articles": 129, "frontend_question_id": "面试题 08.13", "is_new_question": false @@ -7068,8 +7068,8 @@ "question__title": "Color Fill LCCI", "question__title_slug": "color-fill-lcci", "question__hide": false, - "total_acs": 20940, - "total_submitted": 37407, + "total_acs": 20992, + "total_submitted": 37501, "total_column_articles": 318, "frontend_question_id": "面试题 08.10", "is_new_question": false @@ -7089,9 +7089,9 @@ "question__title": "Bracket LCCI", "question__title_slug": "bracket-lcci", "question__hide": false, - "total_acs": 31187, - "total_submitted": 38039, - "total_column_articles": 481, + "total_acs": 31243, + "total_submitted": 38108, + "total_column_articles": 483, "frontend_question_id": "面试题 08.09", "is_new_question": false }, @@ -7110,9 +7110,9 @@ "question__title": "Recursive Mulitply LCCI", "question__title_slug": "recursive-mulitply-lcci", "question__hide": false, - "total_acs": 40210, - "total_submitted": 60847, - "total_column_articles": 707, + "total_acs": 40402, + "total_submitted": 61173, + "total_column_articles": 708, "frontend_question_id": "面试题 08.05", "is_new_question": false }, @@ -7131,9 +7131,9 @@ "question__title": "Power Set LCCI", "question__title_slug": "power-set-lcci", "question__hide": false, - "total_acs": 29436, - "total_submitted": 35924, - "total_column_articles": 441, + "total_acs": 29509, + "total_submitted": 36007, + "total_column_articles": 442, "frontend_question_id": "面试题 08.04", "is_new_question": false }, @@ -7152,9 +7152,9 @@ "question__title": "Three Steps Problem LCCI", "question__title_slug": "three-steps-problem-lcci", "question__hide": false, - "total_acs": 58789, - "total_submitted": 160001, - "total_column_articles": 631, + "total_acs": 58942, + "total_submitted": 160449, + "total_column_articles": 632, "frontend_question_id": "面试题 08.01", "is_new_question": false }, @@ -7173,8 +7173,8 @@ "question__title": "Draw Line LCCI", "question__title_slug": "draw-line-lcci", "question__hide": false, - "total_acs": 6026, - "total_submitted": 11184, + "total_acs": 6050, + "total_submitted": 11234, "total_column_articles": 129, "frontend_question_id": "面试题 05.08", "is_new_question": false @@ -7194,8 +7194,8 @@ "question__title": "Stack of Plates LCCI", "question__title_slug": "stack-of-plates-lcci", "question__hide": false, - "total_acs": 14477, - "total_submitted": 37493, + "total_acs": 14538, + "total_submitted": 37639, "total_column_articles": 203, "frontend_question_id": "面试题 03.03", "is_new_question": false @@ -7215,9 +7215,9 @@ "question__title": "Sum Lists LCCI", "question__title_slug": "sum-lists-lcci", "question__hide": false, - "total_acs": 58562, - "total_submitted": 124497, - "total_column_articles": 731, + "total_acs": 58733, + "total_submitted": 124871, + "total_column_articles": 732, "frontend_question_id": "面试题 02.05", "is_new_question": false }, @@ -7236,9 +7236,9 @@ "question__title": "Delete Middle Node LCCI", "question__title_slug": "delete-middle-node-lcci", "question__hide": false, - "total_acs": 89709, - "total_submitted": 104268, - "total_column_articles": 837, + "total_acs": 89870, + "total_submitted": 104458, + "total_column_articles": 838, "frontend_question_id": "面试题 02.03", "is_new_question": false }, @@ -7257,9 +7257,9 @@ "question__title": "Zero Matrix LCCI", "question__title_slug": "zero-matrix-lcci", "question__hide": false, - "total_acs": 105210, - "total_submitted": 162653, - "total_column_articles": 972, + "total_acs": 105544, + "total_submitted": 163234, + "total_column_articles": 975, "frontend_question_id": "面试题 01.08", "is_new_question": false }, @@ -7278,9 +7278,9 @@ "question__title": "Rotate Matrix LCCI", "question__title_slug": "rotate-matrix-lcci", "question__hide": false, - "total_acs": 102410, - "total_submitted": 139162, - "total_column_articles": 1181, + "total_acs": 102762, + "total_submitted": 139658, + "total_column_articles": 1183, "frontend_question_id": "面试题 01.07", "is_new_question": false }, @@ -7299,9 +7299,9 @@ "question__title": "Palindrome Permutation LCCI", "question__title_slug": "palindrome-permutation-lcci", "question__hide": false, - "total_acs": 63287, - "total_submitted": 117408, - "total_column_articles": 1083, + "total_acs": 63535, + "total_submitted": 117966, + "total_column_articles": 1085, "frontend_question_id": "面试题 01.04", "is_new_question": false }, @@ -7320,9 +7320,9 @@ "question__title": "Closed Number LCCI", "question__title_slug": "closed-number-lcci", "question__hide": false, - "total_acs": 8237, - "total_submitted": 22923, - "total_column_articles": 187, + "total_acs": 8266, + "total_submitted": 22980, + "total_column_articles": 188, "frontend_question_id": "面试题 05.04", "is_new_question": false }, @@ -7341,9 +7341,9 @@ "question__title": "Exchange LCCI", "question__title_slug": "exchange-lcci", "question__hide": false, - "total_acs": 17239, - "total_submitted": 24290, - "total_column_articles": 284, + "total_acs": 17313, + "total_submitted": 24404, + "total_column_articles": 285, "frontend_question_id": "面试题 05.07", "is_new_question": false }, @@ -7362,8 +7362,8 @@ "question__title": "Convert Integer LCCI", "question__title_slug": "convert-integer-lcci", "question__hide": false, - "total_acs": 18997, - "total_submitted": 36817, + "total_acs": 19097, + "total_submitted": 37037, "total_column_articles": 321, "frontend_question_id": "面试题 05.06", "is_new_question": false @@ -7383,9 +7383,9 @@ "question__title": "Insert Into Bits LCCI", "question__title_slug": "insert-into-bits-lcci", "question__hide": false, - "total_acs": 15466, - "total_submitted": 30138, - "total_column_articles": 285, + "total_acs": 15518, + "total_submitted": 30234, + "total_column_articles": 286, "frontend_question_id": "面试题 05.01", "is_new_question": false }, @@ -7404,9 +7404,9 @@ "question__title": "First Common Ancestor LCCI", "question__title_slug": "first-common-ancestor-lcci", "question__hide": false, - "total_acs": 25854, - "total_submitted": 36074, - "total_column_articles": 262, + "total_acs": 25945, + "total_submitted": 36209, + "total_column_articles": 264, "frontend_question_id": "面试题 04.08", "is_new_question": false }, @@ -7425,9 +7425,9 @@ "question__title": "Successor LCCI", "question__title_slug": "successor-lcci", "question__hide": false, - "total_acs": 62866, - "total_submitted": 100392, - "total_column_articles": 654, + "total_acs": 62963, + "total_submitted": 100576, + "total_column_articles": 655, "frontend_question_id": "面试题 04.06", "is_new_question": false }, @@ -7446,8 +7446,8 @@ "question__title": "Legal Binary Search Tree LCCI", "question__title_slug": "legal-binary-search-tree-lcci", "question__hide": false, - "total_acs": 36647, - "total_submitted": 103065, + "total_acs": 36750, + "total_submitted": 103321, "total_column_articles": 434, "frontend_question_id": "面试题 04.05", "is_new_question": false @@ -7467,8 +7467,8 @@ "question__title": "Check Balance LCCI", "question__title_slug": "check-balance-lcci", "question__hide": false, - "total_acs": 43391, - "total_submitted": 72754, + "total_acs": 43473, + "total_submitted": 72868, "total_column_articles": 458, "frontend_question_id": "面试题 04.04", "is_new_question": false @@ -7488,9 +7488,9 @@ "question__title": "List of Depth LCCI", "question__title_slug": "list-of-depth-lcci", "question__hide": false, - "total_acs": 33164, - "total_submitted": 41104, - "total_column_articles": 690, + "total_acs": 33246, + "total_submitted": 41195, + "total_column_articles": 691, "frontend_question_id": "面试题 04.03", "is_new_question": false }, @@ -7509,9 +7509,9 @@ "question__title": "Minimum Height Tree LCCI", "question__title_slug": "minimum-height-tree-lcci", "question__hide": false, - "total_acs": 45871, - "total_submitted": 58163, - "total_column_articles": 546, + "total_acs": 45969, + "total_submitted": 58276, + "total_column_articles": 548, "frontend_question_id": "面试题 04.02", "is_new_question": false }, @@ -7530,9 +7530,9 @@ "question__title": "Sort of Stacks LCCI", "question__title_slug": "sort-of-stacks-lcci", "question__hide": false, - "total_acs": 24748, - "total_submitted": 45852, - "total_column_articles": 331, + "total_acs": 24853, + "total_submitted": 46154, + "total_column_articles": 332, "frontend_question_id": "面试题 03.05", "is_new_question": false }, @@ -7551,9 +7551,9 @@ "question__title": "Three in One LCCI", "question__title_slug": "three-in-one-lcci", "question__hide": false, - "total_acs": 18848, - "total_submitted": 35249, - "total_column_articles": 270, + "total_acs": 18903, + "total_submitted": 35352, + "total_column_articles": 271, "frontend_question_id": "面试题 03.01", "is_new_question": false }, @@ -7572,8 +7572,8 @@ "question__title": "Route Between Nodes LCCI ", "question__title_slug": "route-between-nodes-lcci", "question__hide": false, - "total_acs": 28402, - "total_submitted": 52895, + "total_acs": 28504, + "total_submitted": 53096, "total_column_articles": 370, "frontend_question_id": "面试题 04.01", "is_new_question": false @@ -7593,9 +7593,9 @@ "question__title": "Implement Queue using Stacks LCCI", "question__title_slug": "implement-queue-using-stacks-lcci", "question__hide": false, - "total_acs": 32235, - "total_submitted": 44934, - "total_column_articles": 430, + "total_acs": 32319, + "total_submitted": 45033, + "total_column_articles": 431, "frontend_question_id": "面试题 03.04", "is_new_question": false }, @@ -7614,9 +7614,9 @@ "question__title": "Min Stack LCCI", "question__title_slug": "min-stack-lcci", "question__hide": false, - "total_acs": 36746, - "total_submitted": 59324, - "total_column_articles": 400, + "total_acs": 36880, + "total_submitted": 59504, + "total_column_articles": 402, "frontend_question_id": "面试题 03.02", "is_new_question": false }, @@ -7635,8 +7635,8 @@ "question__title": "Linked List Cycle LCCI", "question__title_slug": "linked-list-cycle-lcci", "question__hide": false, - "total_acs": 40009, - "total_submitted": 73093, + "total_acs": 40115, + "total_submitted": 73258, "total_column_articles": 393, "frontend_question_id": "面试题 02.08", "is_new_question": false @@ -7656,9 +7656,9 @@ "question__title": "Intersection of Two Linked Lists LCCI", "question__title_slug": "intersection-of-two-linked-lists-lcci", "question__hide": false, - "total_acs": 140024, - "total_submitted": 209588, - "total_column_articles": 978, + "total_acs": 141067, + "total_submitted": 211211, + "total_column_articles": 984, "frontend_question_id": "面试题 02.07", "is_new_question": false }, @@ -7677,9 +7677,9 @@ "question__title": "Palindrome Linked List LCCI", "question__title_slug": "palindrome-linked-list-lcci", "question__hide": false, - "total_acs": 57532, - "total_submitted": 118076, - "total_column_articles": 657, + "total_acs": 57671, + "total_submitted": 118387, + "total_column_articles": 658, "frontend_question_id": "面试题 02.06", "is_new_question": false }, @@ -7698,9 +7698,9 @@ "question__title": "Remove Duplicate Node LCCI", "question__title_slug": "remove-duplicate-node-lcci", "question__hide": false, - "total_acs": 86381, - "total_submitted": 128869, - "total_column_articles": 855, + "total_acs": 86582, + "total_submitted": 129180, + "total_column_articles": 856, "frontend_question_id": "面试题 02.01", "is_new_question": false }, @@ -7719,9 +7719,9 @@ "question__title": "String Rotation LCCI", "question__title_slug": "string-rotation-lcci", "question__hide": false, - "total_acs": 82139, - "total_submitted": 150819, - "total_column_articles": 826, + "total_acs": 82321, + "total_submitted": 151161, + "total_column_articles": 828, "frontend_question_id": "面试题 01.09", "is_new_question": false }, @@ -7740,9 +7740,9 @@ "question__title": "Compress String LCCI", "question__title_slug": "compress-string-lcci", "question__hide": false, - "total_acs": 101319, - "total_submitted": 217934, - "total_column_articles": 1417, + "total_acs": 101707, + "total_submitted": 219081, + "total_column_articles": 1420, "frontend_question_id": "面试题 01.06", "is_new_question": false }, @@ -7761,9 +7761,9 @@ "question__title": "String to URL LCCI", "question__title_slug": "string-to-url-lcci", "question__hide": false, - "total_acs": 70177, - "total_submitted": 122069, - "total_column_articles": 707, + "total_acs": 70474, + "total_submitted": 122651, + "total_column_articles": 710, "frontend_question_id": "面试题 01.03", "is_new_question": false }, @@ -7782,9 +7782,9 @@ "question__title": "Check Permutation LCCI", "question__title_slug": "check-permutation-lcci", "question__hide": false, - "total_acs": 121486, - "total_submitted": 184081, - "total_column_articles": 1809, + "total_acs": 121817, + "total_submitted": 184615, + "total_column_articles": 1812, "frontend_question_id": "面试题 01.02", "is_new_question": false }, @@ -7803,9 +7803,9 @@ "question__title": "Is Unique LCCI", "question__title_slug": "is-unique-lcci", "question__hide": false, - "total_acs": 141382, - "total_submitted": 198475, - "total_column_articles": 2084, + "total_acs": 141857, + "total_submitted": 199100, + "total_column_articles": 2088, "frontend_question_id": "面试题 01.01", "is_new_question": false }, @@ -7824,9 +7824,9 @@ "question__title": "Guess Numbers", "question__title_slug": "guess-numbers", "question__hide": false, - "total_acs": 95430, - "total_submitted": 112745, - "total_column_articles": 781, + "total_acs": 95580, + "total_submitted": 112921, + "total_column_articles": 783, "frontend_question_id": "LCP 01", "is_new_question": false }, @@ -7845,8 +7845,8 @@ "question__title": "Programmable Robot", "question__title_slug": "programmable-robot", "question__hide": false, - "total_acs": 14942, - "total_submitted": 64950, + "total_acs": 15026, + "total_submitted": 65208, "total_column_articles": 233, "frontend_question_id": "LCP 03", "is_new_question": false @@ -7866,8 +7866,8 @@ "question__title": "Coin Bonus", "question__title_slug": "coin-bonus", "question__hide": false, - "total_acs": 2856, - "total_submitted": 12911, + "total_acs": 2863, + "total_submitted": 12929, "total_column_articles": 65, "frontend_question_id": "LCP 05", "is_new_question": false @@ -7887,8 +7887,8 @@ "question__title": "Broken Board Dominoes", "question__title_slug": "broken-board-dominoes", "question__hide": false, - "total_acs": 3854, - "total_submitted": 9467, + "total_acs": 3870, + "total_submitted": 9504, "total_column_articles": 85, "frontend_question_id": "LCP 04", "is_new_question": false @@ -7908,8 +7908,8 @@ "question__title": "Deep Dark Fraction", "question__title_slug": "deep-dark-fraction", "question__hide": false, - "total_acs": 18624, - "total_submitted": 26599, + "total_acs": 18664, + "total_submitted": 26672, "total_column_articles": 318, "frontend_question_id": "LCP 02", "is_new_question": false @@ -7923,17 +7923,38 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2683, + "question__title": "Count the Number of Good Subsequences", + "question__title_slug": "count-the-number-of-good-subsequences", + "question__hide": false, + "total_acs": 33, + "total_submitted": 48, + "total_column_articles": 3, + "frontend_question_id": "2539", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2672, "question__title": "Number of Good Binary Strings", "question__title_slug": "number-of-good-binary-strings", "question__hide": false, - "total_acs": 26, - "total_submitted": 33, - "total_column_articles": 2, + "total_acs": 40, + "total_submitted": 48, + "total_column_articles": 3, "frontend_question_id": "2533", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -7950,8 +7971,8 @@ "question__title": "Maximum Frequency Score of a Subarray", "question__title_slug": "maximum-frequency-score-of-a-subarray", "question__hide": false, - "total_acs": 34, - "total_submitted": 101, + "total_acs": 49, + "total_submitted": 121, "total_column_articles": 1, "frontend_question_id": "2524", "is_new_question": false @@ -7971,9 +7992,9 @@ "question__title": "Count the Number of K-Big Indices", "question__title_slug": "count-the-number-of-k-big-indices", "question__hide": false, - "total_acs": 55, - "total_submitted": 68, - "total_column_articles": 4, + "total_acs": 67, + "total_submitted": 82, + "total_column_articles": 7, "frontend_question_id": "2519", "is_new_question": false }, @@ -8013,8 +8034,8 @@ "question__title": "Bitwise OR of All Subsequence Sums", "question__title_slug": "bitwise-or-of-all-subsequence-sums", "question__hide": false, - "total_acs": 68, - "total_submitted": 105, + "total_acs": 71, + "total_submitted": 110, "total_column_articles": 3, "frontend_question_id": "2505", "is_new_question": false @@ -8034,8 +8055,8 @@ "question__title": "Concatenate the Name and the Profession", "question__title_slug": "concatenate-the-name-and-the-profession", "question__hide": false, - "total_acs": 153, - "total_submitted": 174, + "total_acs": 176, + "total_submitted": 201, "total_column_articles": 5, "frontend_question_id": "2504", "is_new_question": false @@ -8055,9 +8076,9 @@ "question__title": "Time to Cross a Bridge", "question__title_slug": "time-to-cross-a-bridge", "question__hide": false, - "total_acs": 1388, - "total_submitted": 2744, - "total_column_articles": 45, + "total_acs": 1505, + "total_submitted": 2939, + "total_column_articles": 48, "frontend_question_id": "2532", "is_new_question": false }, @@ -8076,9 +8097,9 @@ "question__title": "Number of Subarrays Having Even Product", "question__title_slug": "number-of-subarrays-having-even-product", "question__hide": false, - "total_acs": 101, - "total_submitted": 139, - "total_column_articles": 6, + "total_acs": 105, + "total_submitted": 147, + "total_column_articles": 7, "frontend_question_id": "2495", "is_new_question": false }, @@ -8097,9 +8118,9 @@ "question__title": "Merge Overlapping Events in the Same Hall", "question__title_slug": "merge-overlapping-events-in-the-same-hall", "question__hide": false, - "total_acs": 70, - "total_submitted": 120, - "total_column_articles": 4, + "total_acs": 75, + "total_submitted": 132, + "total_column_articles": 5, "frontend_question_id": "2494", "is_new_question": false }, @@ -8112,14 +8133,161 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2636, + "question__title": "Maximum Subsequence Score", + "question__title_slug": "maximum-subsequence-score", + "question__hide": false, + "total_acs": 1159, + "total_submitted": 2623, + "total_column_articles": 16, + "frontend_question_id": "2542", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2635, + "question__title": "Check if Point Is Reachable", + "question__title_slug": "check-if-point-is-reachable", + "question__hide": false, + "total_acs": 947, + "total_submitted": 2451, + "total_column_articles": 9, + "frontend_question_id": "2543", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2634, + "question__title": "Minimum Common Value", + "question__title_slug": "minimum-common-value", + "question__hide": false, + "total_acs": 2154, + "total_submitted": 3236, + "total_column_articles": 22, + "frontend_question_id": "2540", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2633, + "question__title": "Minimum Cost to Split an Array", + "question__title_slug": "minimum-cost-to-split-an-array", + "question__hide": false, + "total_acs": 1660, + "total_submitted": 3032, + "total_column_articles": 21, + "frontend_question_id": "2547", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2632, + "question__title": "Apply Bitwise Operations to Make Strings Equal", + "question__title_slug": "apply-bitwise-operations-to-make-strings-equal", + "question__hide": false, + "total_acs": 2348, + "total_submitted": 6267, + "total_column_articles": 29, + "frontend_question_id": "2546", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2631, + "question__title": "Sort the Students by Their Kth Score", + "question__title_slug": "sort-the-students-by-their-kth-score", + "question__hide": false, + "total_acs": 2820, + "total_submitted": 3229, + "total_column_articles": 35, + "frontend_question_id": "2545", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2630, + "question__title": "Alternating Digit Sum", + "question__title_slug": "alternating-digit-sum", + "question__hide": false, + "total_acs": 2880, + "total_submitted": 3555, + "total_column_articles": 28, + "frontend_question_id": "2544", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2629, "question__title": "Number of Substrings With Fixed Ratio", "question__title_slug": "number-of-substrings-with-fixed-ratio", "question__hide": false, - "total_acs": 71, - "total_submitted": 102, + "total_acs": 72, + "total_submitted": 104, "total_column_articles": 3, "frontend_question_id": "2489", "is_new_question": false @@ -8139,9 +8307,9 @@ "question__title": "Minimize the Maximum of Two Arrays", "question__title_slug": "minimize-the-maximum-of-two-arrays", "question__hide": false, - "total_acs": 1687, - "total_submitted": 4861, - "total_column_articles": 23, + "total_acs": 1779, + "total_submitted": 5109, + "total_column_articles": 26, "frontend_question_id": "2513", "is_new_question": false }, @@ -8154,14 +8322,98 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2627, + "question__title": "Difference Between Maximum and Minimum Price Sum", + "question__title_slug": "difference-between-maximum-and-minimum-price-sum", + "question__hide": false, + "total_acs": 2259, + "total_submitted": 4862, + "total_column_articles": 37, + "frontend_question_id": "2538", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2626, + "question__title": "Count the Number of Good Subarrays", + "question__title_slug": "count-the-number-of-good-subarrays", + "question__hide": false, + "total_acs": 4180, + "total_submitted": 8881, + "total_column_articles": 69, + "frontend_question_id": "2537", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2625, + "question__title": "Increment Submatrices by One", + "question__title_slug": "increment-submatrices-by-one", + "question__hide": false, + "total_acs": 5552, + "total_submitted": 9456, + "total_column_articles": 65, + "frontend_question_id": "2536", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2624, + "question__title": "Difference Between Element Sum and Digit Sum of an Array", + "question__title_slug": "difference-between-element-sum-and-digit-sum-of-an-array", + "question__hide": false, + "total_acs": 6522, + "total_submitted": 7262, + "total_column_articles": 53, + "frontend_question_id": "2535", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2623, "question__title": "Maximum XOR of Two Non-Overlapping Subtrees", "question__title_slug": "maximum-xor-of-two-non-overlapping-subtrees", "question__hide": false, - "total_acs": 87, - "total_submitted": 136, + "total_acs": 90, + "total_submitted": 142, "total_column_articles": 6, "frontend_question_id": "2479", "is_new_question": false @@ -8181,8 +8433,8 @@ "question__title": "Form a Chemical Bond", "question__title_slug": "form-a-chemical-bond", "question__hide": false, - "total_acs": 182, - "total_submitted": 202, + "total_acs": 202, + "total_submitted": 225, "total_column_articles": 4, "frontend_question_id": "2480", "is_new_question": false @@ -8202,9 +8454,9 @@ "question__title": "Find Xor-Beauty of Array", "question__title_slug": "find-xor-beauty-of-array", "question__hide": false, - "total_acs": 2659, - "total_submitted": 3967, - "total_column_articles": 32, + "total_acs": 2867, + "total_submitted": 4211, + "total_column_articles": 35, "frontend_question_id": "2527", "is_new_question": false }, @@ -8223,9 +8475,9 @@ "question__title": "Find Consecutive Integers from a Data Stream", "question__title_slug": "find-consecutive-integers-from-a-data-stream", "question__hide": false, - "total_acs": 3296, - "total_submitted": 6389, - "total_column_articles": 33, + "total_acs": 3571, + "total_submitted": 6841, + "total_column_articles": 38, "frontend_question_id": "2526", "is_new_question": false }, @@ -8244,9 +8496,9 @@ "question__title": "Categorize Box According to Criteria", "question__title_slug": "categorize-box-according-to-criteria", "question__hide": false, - "total_acs": 3214, - "total_submitted": 6677, - "total_column_articles": 27, + "total_acs": 3471, + "total_submitted": 7189, + "total_column_articles": 31, "frontend_question_id": "2525", "is_new_question": false }, @@ -8265,8 +8517,8 @@ "question__title": "Maximize the Minimum Powered City", "question__title_slug": "maximize-the-minimum-powered-city", "question__hide": false, - "total_acs": 2237, - "total_submitted": 5570, + "total_acs": 2440, + "total_submitted": 6034, "total_column_articles": 31, "frontend_question_id": "2528", "is_new_question": false @@ -8280,15 +8532,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2617, + "question__title": "Time Taken to Cross the Door", + "question__title_slug": "time-taken-to-cross-the-door", + "question__hide": false, + "total_acs": 38, + "total_submitted": 63, + "total_column_articles": 6, + "frontend_question_id": "2534", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2616, "question__title": "Maximal Score After Applying K Operations", "question__title_slug": "maximal-score-after-applying-k-operations", "question__hide": false, - "total_acs": 5091, - "total_submitted": 11522, - "total_column_articles": 55, + "total_acs": 5452, + "total_submitted": 12263, + "total_column_articles": 59, "frontend_question_id": "2530", "is_new_question": false }, @@ -8307,9 +8580,9 @@ "question__title": "Make Number of Distinct Characters Equal", "question__title_slug": "make-number-of-distinct-characters-equal", "question__hide": false, - "total_acs": 4403, - "total_submitted": 15460, - "total_column_articles": 76, + "total_acs": 4724, + "total_submitted": 16266, + "total_column_articles": 77, "frontend_question_id": "2531", "is_new_question": false }, @@ -8328,9 +8601,9 @@ "question__title": "Maximum Count of Positive Integer and Negative Integer", "question__title_slug": "maximum-count-of-positive-integer-and-negative-integer", "question__hide": false, - "total_acs": 6088, - "total_submitted": 7419, - "total_column_articles": 44, + "total_acs": 6635, + "total_submitted": 8180, + "total_column_articles": 47, "frontend_question_id": "2529", "is_new_question": false }, @@ -8349,9 +8622,9 @@ "question__title": "Customers With Strictly Increasing Purchases", "question__title_slug": "customers-with-strictly-increasing-purchases", "question__hide": false, - "total_acs": 93, - "total_submitted": 198, - "total_column_articles": 7, + "total_acs": 101, + "total_submitted": 215, + "total_column_articles": 8, "frontend_question_id": "2474", "is_new_question": false }, @@ -8370,8 +8643,8 @@ "question__title": "Minimum Cost to Buy Apples", "question__title_slug": "minimum-cost-to-buy-apples", "question__hide": false, - "total_acs": 82, - "total_submitted": 129, + "total_acs": 84, + "total_submitted": 132, "total_column_articles": 4, "frontend_question_id": "2473", "is_new_question": false @@ -8391,9 +8664,9 @@ "question__title": "Closest Prime Numbers in Range", "question__title_slug": "closest-prime-numbers-in-range", "question__hide": false, - "total_acs": 5335, - "total_submitted": 13004, - "total_column_articles": 54, + "total_acs": 5518, + "total_submitted": 13403, + "total_column_articles": 55, "frontend_question_id": "2523", "is_new_question": false }, @@ -8412,9 +8685,9 @@ "question__title": "Distinct Prime Factors of Product of Array", "question__title_slug": "distinct-prime-factors-of-product-of-array", "question__hide": false, - "total_acs": 5482, - "total_submitted": 8852, - "total_column_articles": 53, + "total_acs": 5643, + "total_submitted": 9088, + "total_column_articles": 55, "frontend_question_id": "2521", "is_new_question": false }, @@ -8433,9 +8706,9 @@ "question__title": "Count the Digits That Divide a Number", "question__title_slug": "count-the-digits-that-divide-a-number", "question__hide": false, - "total_acs": 6222, - "total_submitted": 7195, - "total_column_articles": 51, + "total_acs": 6493, + "total_submitted": 7516, + "total_column_articles": 55, "frontend_question_id": "2520", "is_new_question": false }, @@ -8454,8 +8727,8 @@ "question__title": "Minimum Subarrays in a Valid Split", "question__title_slug": "minimum-subarrays-in-a-valid-split", "question__hide": false, - "total_acs": 74, - "total_submitted": 121, + "total_acs": 78, + "total_submitted": 129, "total_column_articles": 5, "frontend_question_id": "2464", "is_new_question": false @@ -8475,9 +8748,9 @@ "question__title": "Difference Between Ones and Zeros in Row and Column", "question__title_slug": "difference-between-ones-and-zeros-in-row-and-column", "question__hide": false, - "total_acs": 4117, - "total_submitted": 4909, - "total_column_articles": 55, + "total_acs": 4162, + "total_submitted": 4957, + "total_column_articles": 56, "frontend_question_id": "2482", "is_new_question": false }, @@ -8496,9 +8769,9 @@ "question__title": "Count Anagrams", "question__title_slug": "count-anagrams", "question__hide": false, - "total_acs": 1777, - "total_submitted": 3864, - "total_column_articles": 30, + "total_acs": 1834, + "total_submitted": 3965, + "total_column_articles": 32, "frontend_question_id": "2514", "is_new_question": false }, @@ -8511,15 +8784,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2604, + "question__title": "Minimum Operations to Make Array Equal II", + "question__title_slug": "minimum-operations-to-make-array-equal-ii", + "question__hide": false, + "total_acs": 1851, + "total_submitted": 6320, + "total_column_articles": 20, + "frontend_question_id": "2541", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2603, "question__title": "Reward Top K Students", "question__title_slug": "reward-top-k-students", "question__hide": false, - "total_acs": 2605, - "total_submitted": 5593, - "total_column_articles": 38, + "total_acs": 2697, + "total_submitted": 5770, + "total_column_articles": 41, "frontend_question_id": "2512", "is_new_question": false }, @@ -8538,9 +8832,9 @@ "question__title": "Maximum Enemy Forts That Can Be Captured", "question__title_slug": "maximum-enemy-forts-that-can-be-captured", "question__hide": false, - "total_acs": 2925, - "total_submitted": 5832, - "total_column_articles": 46, + "total_acs": 3011, + "total_submitted": 6004, + "total_column_articles": 47, "frontend_question_id": "2511", "is_new_question": false }, @@ -8559,8 +8853,8 @@ "question__title": "Number of Great Partitions", "question__title_slug": "number-of-great-partitions", "question__hide": false, - "total_acs": 2084, - "total_submitted": 4833, + "total_acs": 2133, + "total_submitted": 4947, "total_column_articles": 27, "frontend_question_id": "2518", "is_new_question": false @@ -8580,9 +8874,9 @@ "question__title": "Maximum Tastiness of Candy Basket", "question__title_slug": "maximum-tastiness-of-candy-basket", "question__hide": false, - "total_acs": 3083, - "total_submitted": 4461, - "total_column_articles": 37, + "total_acs": 3279, + "total_submitted": 4701, + "total_column_articles": 38, "frontend_question_id": "2517", "is_new_question": false }, @@ -8601,8 +8895,8 @@ "question__title": "Take K of Each Character From Left and Right", "question__title_slug": "take-k-of-each-character-from-left-and-right", "question__hide": false, - "total_acs": 4225, - "total_submitted": 11944, + "total_acs": 4373, + "total_submitted": 12266, "total_column_articles": 59, "frontend_question_id": "2516", "is_new_question": false @@ -8622,9 +8916,9 @@ "question__title": "Shortest Distance to Target String in a Circular Array", "question__title_slug": "shortest-distance-to-target-string-in-a-circular-array", "question__hide": false, - "total_acs": 5235, - "total_submitted": 9409, - "total_column_articles": 51, + "total_acs": 5382, + "total_submitted": 9648, + "total_column_articles": 56, "frontend_question_id": "2515", "is_new_question": false }, @@ -8643,9 +8937,9 @@ "question__title": "Cycle Length Queries in a Tree", "question__title_slug": "cycle-length-queries-in-a-tree", "question__hide": false, - "total_acs": 3375, - "total_submitted": 5231, - "total_column_articles": 56, + "total_acs": 3453, + "total_submitted": 5337, + "total_column_articles": 57, "frontend_question_id": "2509", "is_new_question": false }, @@ -8664,9 +8958,9 @@ "question__title": "Add Edges to Make Degrees of All Nodes Even", "question__title_slug": "add-edges-to-make-degrees-of-all-nodes-even", "question__hide": false, - "total_acs": 3022, - "total_submitted": 10539, - "total_column_articles": 52, + "total_acs": 3059, + "total_submitted": 10633, + "total_column_articles": 53, "frontend_question_id": "2508", "is_new_question": false }, @@ -8685,9 +8979,9 @@ "question__title": "Smallest Value After Replacing With Sum of Prime Factors", "question__title_slug": "smallest-value-after-replacing-with-sum-of-prime-factors", "question__hide": false, - "total_acs": 5133, - "total_submitted": 10381, - "total_column_articles": 55, + "total_acs": 5216, + "total_submitted": 10520, + "total_column_articles": 58, "frontend_question_id": "2507", "is_new_question": false }, @@ -8706,9 +9000,9 @@ "question__title": "Count Pairs Of Similar Strings", "question__title_slug": "count-pairs-of-similar-strings", "question__hide": false, - "total_acs": 5978, - "total_submitted": 7523, - "total_column_articles": 60, + "total_acs": 6098, + "total_submitted": 7673, + "total_column_articles": 63, "frontend_question_id": "2506", "is_new_question": false }, @@ -8727,8 +9021,8 @@ "question__title": "Number of Distinct Binary Strings After Applying Operations", "question__title_slug": "number-of-distinct-binary-strings-after-applying-operations", "question__hide": false, - "total_acs": 96, - "total_submitted": 124, + "total_acs": 101, + "total_submitted": 132, "total_column_articles": 7, "frontend_question_id": "2450", "is_new_question": false @@ -8748,9 +9042,9 @@ "question__title": "Minimum Total Cost to Make Arrays Unequal", "question__title_slug": "minimum-total-cost-to-make-arrays-unequal", "question__hide": false, - "total_acs": 1321, - "total_submitted": 3127, - "total_column_articles": 25, + "total_acs": 1342, + "total_submitted": 3176, + "total_column_articles": 26, "frontend_question_id": "2499", "is_new_question": false }, @@ -8769,9 +9063,9 @@ "question__title": "Frog Jump II", "question__title_slug": "frog-jump-ii", "question__hide": false, - "total_acs": 2773, - "total_submitted": 4362, - "total_column_articles": 39, + "total_acs": 2842, + "total_submitted": 4450, + "total_column_articles": 40, "frontend_question_id": "2498", "is_new_question": false }, @@ -8790,9 +9084,9 @@ "question__title": "Maximum Star Sum of a Graph", "question__title_slug": "maximum-star-sum-of-a-graph", "question__hide": false, - "total_acs": 3170, - "total_submitted": 8359, - "total_column_articles": 45, + "total_acs": 3220, + "total_submitted": 8503, + "total_column_articles": 46, "frontend_question_id": "2497", "is_new_question": false }, @@ -8811,9 +9105,9 @@ "question__title": "Maximum Value of a String in an Array", "question__title_slug": "maximum-value-of-a-string-in-an-array", "question__hide": false, - "total_acs": 4474, - "total_submitted": 5521, - "total_column_articles": 49, + "total_acs": 4598, + "total_submitted": 5699, + "total_column_articles": 53, "frontend_question_id": "2496", "is_new_question": false }, @@ -8832,8 +9126,8 @@ "question__title": "Maximum Number of Points From Grid Queries", "question__title_slug": "maximum-number-of-points-from-grid-queries", "question__hide": false, - "total_acs": 3521, - "total_submitted": 8411, + "total_acs": 3560, + "total_submitted": 8496, "total_column_articles": 58, "frontend_question_id": "2503", "is_new_question": false @@ -8853,9 +9147,9 @@ "question__title": "Design Memory Allocator", "question__title_slug": "design-memory-allocator", "question__hide": false, - "total_acs": 4444, - "total_submitted": 8607, - "total_column_articles": 63, + "total_acs": 4490, + "total_submitted": 8706, + "total_column_articles": 66, "frontend_question_id": "2502", "is_new_question": false }, @@ -8874,9 +9168,9 @@ "question__title": "Longest Square Streak in an Array", "question__title_slug": "longest-square-streak-in-an-array", "question__hide": false, - "total_acs": 6277, - "total_submitted": 15151, - "total_column_articles": 72, + "total_acs": 6362, + "total_submitted": 15357, + "total_column_articles": 73, "frontend_question_id": "2501", "is_new_question": false }, @@ -8895,9 +9189,9 @@ "question__title": "Delete Greatest Value in Each Row", "question__title_slug": "delete-greatest-value-in-each-row", "question__hide": false, - "total_acs": 6852, - "total_submitted": 7881, - "total_column_articles": 67, + "total_acs": 7005, + "total_submitted": 8116, + "total_column_articles": 69, "frontend_question_id": "2500", "is_new_question": false }, @@ -8916,9 +9210,9 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 173, - "total_submitted": 210, - "total_column_articles": 10, + "total_acs": 177, + "total_submitted": 217, + "total_column_articles": 11, "frontend_question_id": "2445", "is_new_question": false }, @@ -8937,8 +9231,8 @@ "question__title": "Divide Nodes Into the Maximum Number of Groups", "question__title_slug": "divide-nodes-into-the-maximum-number-of-groups", "question__hide": false, - "total_acs": 2496, - "total_submitted": 5908, + "total_acs": 2534, + "total_submitted": 5987, "total_column_articles": 42, "frontend_question_id": "2493", "is_new_question": false @@ -8958,9 +9252,9 @@ "question__title": "Minimum Score of a Path Between Two Cities", "question__title_slug": "minimum-score-of-a-path-between-two-cities", "question__hide": false, - "total_acs": 6016, - "total_submitted": 14966, - "total_column_articles": 112, + "total_acs": 6122, + "total_submitted": 15157, + "total_column_articles": 113, "frontend_question_id": "2492", "is_new_question": false }, @@ -8979,8 +9273,8 @@ "question__title": "Divide Players Into Teams of Equal Skill", "question__title_slug": "divide-players-into-teams-of-equal-skill", "question__hide": false, - "total_acs": 7212, - "total_submitted": 13147, + "total_acs": 7313, + "total_submitted": 13329, "total_column_articles": 93, "frontend_question_id": "2491", "is_new_question": false @@ -9000,9 +9294,9 @@ "question__title": "Circular Sentence", "question__title_slug": "circular-sentence", "question__hide": false, - "total_acs": 7592, - "total_submitted": 10801, - "total_column_articles": 75, + "total_acs": 7727, + "total_submitted": 10993, + "total_column_articles": 78, "frontend_question_id": "2490", "is_new_question": false }, @@ -9021,8 +9315,8 @@ "question__title": "Minimum Split Into Subarrays With GCD Greater Than One", "question__title_slug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "question__hide": false, - "total_acs": 105, - "total_submitted": 139, + "total_acs": 114, + "total_submitted": 151, "total_column_articles": 8, "frontend_question_id": "2436", "is_new_question": false @@ -9042,8 +9336,8 @@ "question__title": "Count Palindromic Subsequences", "question__title_slug": "count-palindromic-subsequences", "question__hide": false, - "total_acs": 2337, - "total_submitted": 5019, + "total_acs": 2348, + "total_submitted": 5042, "total_column_articles": 46, "frontend_question_id": "2484", "is_new_question": false @@ -9063,9 +9357,9 @@ "question__title": "Minimum Penalty for a Shop", "question__title_slug": "minimum-penalty-for-a-shop", "question__hide": false, - "total_acs": 4296, - "total_submitted": 6752, - "total_column_articles": 67, + "total_acs": 4356, + "total_submitted": 6832, + "total_column_articles": 69, "frontend_question_id": "2483", "is_new_question": false }, @@ -9084,9 +9378,9 @@ "question__title": "Minimum Cuts to Divide a Circle", "question__title_slug": "minimum-cuts-to-divide-a-circle", "question__hide": false, - "total_acs": 4419, - "total_submitted": 8614, - "total_column_articles": 45, + "total_acs": 4493, + "total_submitted": 8744, + "total_column_articles": 46, "frontend_question_id": "2481", "is_new_question": false }, @@ -9105,8 +9399,8 @@ "question__title": "Count Subarrays With Median K", "question__title_slug": "count-subarrays-with-median-k", "question__hide": false, - "total_acs": 4247, - "total_submitted": 10443, + "total_acs": 4285, + "total_submitted": 10510, "total_column_articles": 72, "frontend_question_id": "2488", "is_new_question": false @@ -9126,9 +9420,9 @@ "question__title": "Remove Nodes From Linked List", "question__title_slug": "remove-nodes-from-linked-list", "question__hide": false, - "total_acs": 7076, - "total_submitted": 10270, - "total_column_articles": 100, + "total_acs": 7185, + "total_submitted": 10437, + "total_column_articles": 101, "frontend_question_id": "2487", "is_new_question": false }, @@ -9147,8 +9441,8 @@ "question__title": "Append Characters to String to Make Subsequence", "question__title_slug": "append-characters-to-string-to-make-subsequence", "question__hide": false, - "total_acs": 6746, - "total_submitted": 10367, + "total_acs": 6788, + "total_submitted": 10423, "total_column_articles": 78, "frontend_question_id": "2486", "is_new_question": false @@ -9168,8 +9462,8 @@ "question__title": "Find the Pivot Integer", "question__title_slug": "find-the-pivot-integer", "question__hide": false, - "total_acs": 8491, - "total_submitted": 10440, + "total_acs": 8623, + "total_submitted": 10597, "total_column_articles": 89, "frontend_question_id": "2485", "is_new_question": false @@ -9210,8 +9504,8 @@ "question__title": "Number of Beautiful Partitions", "question__title_slug": "number-of-beautiful-partitions", "question__hide": false, - "total_acs": 3610, - "total_submitted": 9050, + "total_acs": 3625, + "total_submitted": 9084, "total_column_articles": 46, "frontend_question_id": "2478", "is_new_question": false @@ -9231,8 +9525,8 @@ "question__title": "Minimum Fuel Cost to Report to the Capital", "question__title_slug": "minimum-fuel-cost-to-report-to-the-capital", "question__hide": false, - "total_acs": 4192, - "total_submitted": 8030, + "total_acs": 4215, + "total_submitted": 8075, "total_column_articles": 67, "frontend_question_id": "2477", "is_new_question": false @@ -9252,8 +9546,8 @@ "question__title": "Closest Nodes Queries in a Binary Search Tree", "question__title_slug": "closest-nodes-queries-in-a-binary-search-tree", "question__hide": false, - "total_acs": 6239, - "total_submitted": 15227, + "total_acs": 6283, + "total_submitted": 15323, "total_column_articles": 93, "frontend_question_id": "2476", "is_new_question": false @@ -9273,8 +9567,8 @@ "question__title": "Number of Unequal Triplets in Array", "question__title_slug": "number-of-unequal-triplets-in-array", "question__hide": false, - "total_acs": 8029, - "total_submitted": 10648, + "total_acs": 8092, + "total_submitted": 10738, "total_column_articles": 55, "frontend_question_id": "2475", "is_new_question": false @@ -9294,8 +9588,8 @@ "question__title": "Merge Operations to Turn Array Into a Palindrome", "question__title_slug": "merge-operations-to-turn-array-into-a-palindrome", "question__hide": false, - "total_acs": 155, - "total_submitted": 208, + "total_acs": 160, + "total_submitted": 215, "total_column_articles": 8, "frontend_question_id": "2422", "is_new_question": false @@ -9315,9 +9609,9 @@ "question__title": "Most Profitable Path in a Tree", "question__title_slug": "most-profitable-path-in-a-tree", "question__hide": false, - "total_acs": 2357, - "total_submitted": 4883, - "total_column_articles": 39, + "total_acs": 2413, + "total_submitted": 4969, + "total_column_articles": 41, "frontend_question_id": "2467", "is_new_question": false }, @@ -9336,8 +9630,8 @@ "question__title": "Split Message Based on Limit", "question__title_slug": "split-message-based-on-limit", "question__hide": false, - "total_acs": 1963, - "total_submitted": 4499, + "total_acs": 1975, + "total_submitted": 4521, "total_column_articles": 53, "frontend_question_id": "2468", "is_new_question": false @@ -9357,9 +9651,9 @@ "question__title": "Count Ways To Build Good Strings", "question__title_slug": "count-ways-to-build-good-strings", "question__hide": false, - "total_acs": 3802, - "total_submitted": 8569, - "total_column_articles": 54, + "total_acs": 3832, + "total_submitted": 8613, + "total_column_articles": 56, "frontend_question_id": "2466", "is_new_question": false }, @@ -9378,9 +9672,9 @@ "question__title": "Number of Distinct Averages", "question__title_slug": "number-of-distinct-averages", "question__hide": false, - "total_acs": 5122, - "total_submitted": 7459, - "total_column_articles": 60, + "total_acs": 5190, + "total_submitted": 7564, + "total_column_articles": 61, "frontend_question_id": "2465", "is_new_question": false }, @@ -9399,8 +9693,8 @@ "question__title": "Closest Fair Integer", "question__title_slug": "closest-fair-integer", "question__hide": false, - "total_acs": 106, - "total_submitted": 216, + "total_acs": 108, + "total_submitted": 221, "total_column_articles": 9, "frontend_question_id": "2417", "is_new_question": false @@ -9420,8 +9714,8 @@ "question__title": "Maximum Number of Non-overlapping Palindrome Substrings", "question__title_slug": "maximum-number-of-non-overlapping-palindrome-substrings", "question__hide": false, - "total_acs": 4600, - "total_submitted": 10679, + "total_acs": 4637, + "total_submitted": 10728, "total_column_articles": 81, "frontend_question_id": "2472", "is_new_question": false @@ -9441,9 +9735,9 @@ "question__title": "Minimum Number of Operations to Sort a Binary Tree by Level", "question__title_slug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "question__hide": false, - "total_acs": 6102, - "total_submitted": 11072, - "total_column_articles": 87, + "total_acs": 6131, + "total_submitted": 11120, + "total_column_articles": 88, "frontend_question_id": "2471", "is_new_question": false }, @@ -9462,8 +9756,8 @@ "question__title": "Number of Subarrays With LCM Equal to K", "question__title_slug": "number-of-subarrays-with-lcm-equal-to-k", "question__hide": false, - "total_acs": 7144, - "total_submitted": 17672, + "total_acs": 7182, + "total_submitted": 17743, "total_column_articles": 84, "frontend_question_id": "2470", "is_new_question": false @@ -9483,9 +9777,9 @@ "question__title": "Convert the Temperature", "question__title_slug": "convert-the-temperature", "question__hide": false, - "total_acs": 11644, - "total_submitted": 13151, - "total_column_articles": 49, + "total_acs": 11848, + "total_submitted": 13369, + "total_column_articles": 51, "frontend_question_id": "2469", "is_new_question": false }, @@ -9504,8 +9798,8 @@ "question__title": "Design SQL", "question__title_slug": "design-sql", "question__hide": false, - "total_acs": 102, - "total_submitted": 168, + "total_acs": 103, + "total_submitted": 170, "total_column_articles": 6, "frontend_question_id": "2408", "is_new_question": false @@ -9525,8 +9819,8 @@ "question__title": "Minimum Total Distance Traveled", "question__title_slug": "minimum-total-distance-traveled", "question__hide": false, - "total_acs": 3300, - "total_submitted": 7227, + "total_acs": 3316, + "total_submitted": 7260, "total_column_articles": 55, "frontend_question_id": "2463", "is_new_question": false @@ -9546,8 +9840,8 @@ "question__title": "Total Cost to Hire K Workers", "question__title_slug": "total-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 5339, - "total_submitted": 14475, + "total_acs": 5372, + "total_submitted": 14539, "total_column_articles": 110, "frontend_question_id": "2462", "is_new_question": false @@ -9567,9 +9861,9 @@ "question__title": "Maximum Sum of Distinct Subarrays With Length K", "question__title_slug": "maximum-sum-of-distinct-subarrays-with-length-k", "question__hide": false, - "total_acs": 7098, - "total_submitted": 23792, - "total_column_articles": 133, + "total_acs": 7155, + "total_submitted": 23936, + "total_column_articles": 135, "frontend_question_id": "2461", "is_new_question": false }, @@ -9588,9 +9882,9 @@ "question__title": "Apply Operations to an Array", "question__title_slug": "apply-operations-to-an-array", "question__hide": false, - "total_acs": 8307, - "total_submitted": 12160, - "total_column_articles": 78, + "total_acs": 8381, + "total_submitted": 12246, + "total_column_articles": 79, "frontend_question_id": "2460", "is_new_question": false }, @@ -9609,8 +9903,8 @@ "question__title": "Words Within Two Edits of Dictionary", "question__title_slug": "words-within-two-edits-of-dictionary", "question__hide": false, - "total_acs": 4078, - "total_submitted": 6205, + "total_acs": 4109, + "total_submitted": 6258, "total_column_articles": 38, "frontend_question_id": "2452", "is_new_question": false @@ -9630,8 +9924,8 @@ "question__title": "Next Greater Element IV", "question__title_slug": "next-greater-element-iv", "question__hide": false, - "total_acs": 3336, - "total_submitted": 6843, + "total_acs": 3363, + "total_submitted": 6885, "total_column_articles": 76, "frontend_question_id": "2454", "is_new_question": false @@ -9651,9 +9945,9 @@ "question__title": "Destroy Sequential Targets", "question__title_slug": "destroy-sequential-targets", "question__hide": false, - "total_acs": 3758, - "total_submitted": 10908, - "total_column_articles": 61, + "total_acs": 3788, + "total_submitted": 10969, + "total_column_articles": 62, "frontend_question_id": "2453", "is_new_question": false }, @@ -9672,8 +9966,8 @@ "question__title": "Odd String Difference", "question__title_slug": "odd-string-difference", "question__hide": false, - "total_acs": 4586, - "total_submitted": 7736, + "total_acs": 4642, + "total_submitted": 7829, "total_column_articles": 57, "frontend_question_id": "2451", "is_new_question": false @@ -9693,8 +9987,8 @@ "question__title": "Number of Subarrays With GCD Equal to K", "question__title_slug": "number-of-subarrays-with-gcd-equal-to-k", "question__hide": false, - "total_acs": 6989, - "total_submitted": 17601, + "total_acs": 7039, + "total_submitted": 17674, "total_column_articles": 61, "frontend_question_id": "2447", "is_new_question": false @@ -9714,9 +10008,9 @@ "question__title": "Height of Binary Tree After Subtree Removal Queries", "question__title_slug": "height-of-binary-tree-after-subtree-removal-queries", "question__hide": false, - "total_acs": 3981, - "total_submitted": 9878, - "total_column_articles": 76, + "total_acs": 4042, + "total_submitted": 9976, + "total_column_articles": 77, "frontend_question_id": "2458", "is_new_question": false }, @@ -9735,9 +10029,9 @@ "question__title": "Minimum Addition to Make Integer Beautiful", "question__title_slug": "minimum-addition-to-make-integer-beautiful", "question__hide": false, - "total_acs": 6204, - "total_submitted": 15835, - "total_column_articles": 114, + "total_acs": 6225, + "total_submitted": 15867, + "total_column_articles": 115, "frontend_question_id": "2457", "is_new_question": false }, @@ -9756,9 +10050,9 @@ "question__title": "Most Popular Video Creator", "question__title_slug": "most-popular-video-creator", "question__hide": false, - "total_acs": 7512, - "total_submitted": 19720, - "total_column_articles": 114, + "total_acs": 7546, + "total_submitted": 19786, + "total_column_articles": 115, "frontend_question_id": "2456", "is_new_question": false }, @@ -9777,9 +10071,9 @@ "question__title": "Average Value of Even Numbers That Are Divisible by Three", "question__title_slug": "average-value-of-even-numbers-that-are-divisible-by-three", "question__hide": false, - "total_acs": 9002, - "total_submitted": 14438, - "total_column_articles": 61, + "total_acs": 9063, + "total_submitted": 14533, + "total_column_articles": 62, "frontend_question_id": "2455", "is_new_question": false }, @@ -9798,8 +10092,8 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 8702, - "total_submitted": 18703, + "total_acs": 8745, + "total_submitted": 18774, "total_column_articles": 69, "frontend_question_id": "2443", "is_new_question": false @@ -9819,8 +10113,8 @@ "question__title": "Minimum Number of Operations to Make Arrays Similar", "question__title_slug": "minimum-number-of-operations-to-make-arrays-similar", "question__hide": false, - "total_acs": 3481, - "total_submitted": 5338, + "total_acs": 3508, + "total_submitted": 5377, "total_column_articles": 43, "frontend_question_id": "2449", "is_new_question": false @@ -9840,8 +10134,8 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 4955, - "total_submitted": 14052, + "total_acs": 4981, + "total_submitted": 14089, "total_column_articles": 76, "frontend_question_id": "2448", "is_new_question": false @@ -9861,9 +10155,9 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 180, - "total_submitted": 239, - "total_column_articles": 9, + "total_acs": 183, + "total_submitted": 243, + "total_column_articles": 10, "frontend_question_id": "2403", "is_new_question": false }, @@ -9882,8 +10176,8 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 9102, - "total_submitted": 15937, + "total_acs": 9143, + "total_submitted": 15997, "total_column_articles": 73, "frontend_question_id": "2446", "is_new_question": false @@ -9903,9 +10197,9 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 211, - "total_submitted": 263, - "total_column_articles": 10, + "total_acs": 222, + "total_submitted": 279, + "total_column_articles": 11, "frontend_question_id": "2393", "is_new_question": false }, @@ -9924,8 +10218,8 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 351, - "total_submitted": 636, + "total_acs": 368, + "total_submitted": 697, "total_column_articles": 9, "frontend_question_id": "2394", "is_new_question": false @@ -9945,9 +10239,9 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 4246, - "total_submitted": 6584, - "total_column_articles": 63, + "total_acs": 4277, + "total_submitted": 6623, + "total_column_articles": 64, "frontend_question_id": "2425", "is_new_question": false }, @@ -9966,9 +10260,9 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 5975, - "total_submitted": 30879, - "total_column_articles": 116, + "total_acs": 6045, + "total_submitted": 31213, + "total_column_articles": 117, "frontend_question_id": "2423", "is_new_question": false }, @@ -9987,8 +10281,8 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 1995, - "total_submitted": 3266, + "total_acs": 2012, + "total_submitted": 3294, "total_column_articles": 30, "frontend_question_id": "2440", "is_new_question": false @@ -10008,8 +10302,8 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 4312, - "total_submitted": 11865, + "total_acs": 4397, + "total_submitted": 12027, "total_column_articles": 90, "frontend_question_id": "2439", "is_new_question": false @@ -10029,9 +10323,9 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 4315, - "total_submitted": 10587, - "total_column_articles": 79, + "total_acs": 4333, + "total_submitted": 10627, + "total_column_articles": 80, "frontend_question_id": "2438", "is_new_question": false }, @@ -10050,9 +10344,9 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 5430, - "total_submitted": 12315, - "total_column_articles": 70, + "total_acs": 5502, + "total_submitted": 12463, + "total_column_articles": 72, "frontend_question_id": "2437", "is_new_question": false }, @@ -10071,8 +10365,8 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 5961, - "total_submitted": 13948, + "total_acs": 6000, + "total_submitted": 14005, "total_column_articles": 89, "frontend_question_id": "2444", "is_new_question": false @@ -10092,8 +10386,8 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 4387, - "total_submitted": 15334, + "total_acs": 4446, + "total_submitted": 15413, "total_column_articles": 75, "frontend_question_id": "2407", "is_new_question": false @@ -10113,9 +10407,9 @@ "question__title": "Count Number of Distinct Integers After Reverse Operations", "question__title_slug": "count-number-of-distinct-integers-after-reverse-operations", "question__hide": false, - "total_acs": 9237, - "total_submitted": 12353, - "total_column_articles": 77, + "total_acs": 9278, + "total_submitted": 12404, + "total_column_articles": 78, "frontend_question_id": "2442", "is_new_question": false }, @@ -10134,9 +10428,9 @@ "question__title": "Largest Positive Integer That Exists With Its Negative", "question__title_slug": "largest-positive-integer-that-exists-with-its-negative", "question__hide": false, - "total_acs": 10536, - "total_submitted": 15000, - "total_column_articles": 105, + "total_acs": 10597, + "total_submitted": 15090, + "total_column_articles": 106, "frontend_question_id": "2441", "is_new_question": false }, @@ -10155,8 +10449,8 @@ "question__title": "Change Null Values in a Table to the Previous Value", "question__title_slug": "change-null-values-in-a-table-to-the-previous-value", "question__hide": false, - "total_acs": 329, - "total_submitted": 461, + "total_acs": 354, + "total_submitted": 504, "total_column_articles": 7, "frontend_question_id": "2388", "is_new_question": false @@ -10176,8 +10470,8 @@ "question__title": "Median of a Row Wise Sorted Matrix", "question__title_slug": "median-of-a-row-wise-sorted-matrix", "question__hide": false, - "total_acs": 144, - "total_submitted": 184, + "total_acs": 154, + "total_submitted": 202, "total_column_articles": 2, "frontend_question_id": "2387", "is_new_question": false @@ -10197,8 +10491,8 @@ "question__title": "Paths in Matrix Whose Sum Is Divisible by K", "question__title_slug": "paths-in-matrix-whose-sum-is-divisible-by-k", "question__hide": false, - "total_acs": 5403, - "total_submitted": 10617, + "total_acs": 5428, + "total_submitted": 10656, "total_column_articles": 91, "frontend_question_id": "2435", "is_new_question": false @@ -10218,8 +10512,8 @@ "question__title": "Using a Robot to Print the Lexicographically Smallest String", "question__title_slug": "using-a-robot-to-print-the-lexicographically-smallest-string", "question__hide": false, - "total_acs": 6027, - "total_submitted": 14558, + "total_acs": 6043, + "total_submitted": 14595, "total_column_articles": 111, "frontend_question_id": "2434", "is_new_question": false @@ -10239,8 +10533,8 @@ "question__title": "Find The Original Array of Prefix Xor", "question__title_slug": "find-the-original-array-of-prefix-xor", "question__hide": false, - "total_acs": 7221, - "total_submitted": 8493, + "total_acs": 7264, + "total_submitted": 8543, "total_column_articles": 77, "frontend_question_id": "2433", "is_new_question": false @@ -10260,9 +10554,9 @@ "question__title": "The Employee That Worked on the Longest Task", "question__title_slug": "the-employee-that-worked-on-the-longest-task", "question__hide": false, - "total_acs": 7929, - "total_submitted": 16353, - "total_column_articles": 84, + "total_acs": 7973, + "total_submitted": 16439, + "total_column_articles": 86, "frontend_question_id": "2432", "is_new_question": false }, @@ -10281,8 +10575,8 @@ "question__title": "Choose Edges to Maximize Score in a Tree", "question__title_slug": "choose-edges-to-maximize-score-in-a-tree", "question__hide": false, - "total_acs": 149, - "total_submitted": 219, + "total_acs": 152, + "total_submitted": 227, "total_column_articles": 8, "frontend_question_id": "2378", "is_new_question": false @@ -10302,8 +10596,8 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 385, - "total_submitted": 489, + "total_acs": 406, + "total_submitted": 513, "total_column_articles": 8, "frontend_question_id": "2377", "is_new_question": false @@ -10323,8 +10617,8 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 425, - "total_submitted": 553, + "total_acs": 439, + "total_submitted": 578, "total_column_articles": 5, "frontend_question_id": "2372", "is_new_question": false @@ -10344,8 +10638,8 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 3567, - "total_submitted": 7897, + "total_acs": 3597, + "total_submitted": 7946, "total_column_articles": 74, "frontend_question_id": "2426", "is_new_question": false @@ -10365,8 +10659,8 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 4907, - "total_submitted": 8807, + "total_acs": 4931, + "total_submitted": 8850, "total_column_articles": 72, "frontend_question_id": "2424", "is_new_question": false @@ -10386,9 +10680,9 @@ "question__title": "Partition String Into Substrings With Values at Most K", "question__title_slug": "partition-string-into-substrings-with-values-at-most-k", "question__hide": false, - "total_acs": 4860, - "total_submitted": 9752, - "total_column_articles": 48, + "total_acs": 4998, + "total_submitted": 10061, + "total_column_articles": 49, "frontend_question_id": "2522", "is_new_question": false }, @@ -10407,8 +10701,8 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 6283, - "total_submitted": 13229, + "total_acs": 6356, + "total_submitted": 13339, "total_column_articles": 102, "frontend_question_id": "2430", "is_new_question": false @@ -10428,8 +10722,8 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 6813, - "total_submitted": 15577, + "total_acs": 6841, + "total_submitted": 15622, "total_column_articles": 107, "frontend_question_id": "2429", "is_new_question": false @@ -10449,9 +10743,9 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 7483, - "total_submitted": 9955, - "total_column_articles": 89, + "total_acs": 7516, + "total_submitted": 9999, + "total_column_articles": 90, "frontend_question_id": "2428", "is_new_question": false }, @@ -10470,9 +10764,9 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 9522, - "total_submitted": 11659, - "total_column_articles": 89, + "total_acs": 9625, + "total_submitted": 11776, + "total_column_articles": 90, "frontend_question_id": "2427", "is_new_question": false }, @@ -10491,8 +10785,8 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 163, - "total_submitted": 206, + "total_acs": 177, + "total_submitted": 235, "total_column_articles": 9, "frontend_question_id": "2371", "is_new_question": false @@ -10512,9 +10806,9 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 3510, - "total_submitted": 8520, - "total_column_articles": 49, + "total_acs": 3612, + "total_submitted": 8678, + "total_column_articles": 50, "frontend_question_id": "2421", "is_new_question": false }, @@ -10533,9 +10827,9 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 6855, - "total_submitted": 22718, - "total_column_articles": 130, + "total_acs": 6894, + "total_submitted": 22801, + "total_column_articles": 133, "frontend_question_id": "2420", "is_new_question": false }, @@ -10554,9 +10848,9 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 7660, - "total_submitted": 18364, - "total_column_articles": 90, + "total_acs": 7687, + "total_submitted": 18408, + "total_column_articles": 91, "frontend_question_id": "2419", "is_new_question": false }, @@ -10575,9 +10869,9 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 11301, - "total_submitted": 14437, - "total_column_articles": 137, + "total_acs": 11419, + "total_submitted": 14592, + "total_column_articles": 139, "frontend_question_id": "2418", "is_new_question": false }, @@ -10596,8 +10890,8 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 271, - "total_submitted": 358, + "total_acs": 276, + "total_submitted": 363, "total_column_articles": 9, "frontend_question_id": "2362", "is_new_question": false @@ -10617,8 +10911,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 258, - "total_submitted": 323, + "total_acs": 264, + "total_submitted": 331, "total_column_articles": 12, "frontend_question_id": "2361", "is_new_question": false @@ -10638,8 +10932,8 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 3090, - "total_submitted": 6434, + "total_acs": 3106, + "total_submitted": 6458, "total_column_articles": 60, "frontend_question_id": "2412", "is_new_question": false @@ -10659,8 +10953,8 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 4128, - "total_submitted": 9950, + "total_acs": 4162, + "total_submitted": 10014, "total_column_articles": 56, "frontend_question_id": "2411", "is_new_question": false @@ -10680,9 +10974,9 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 5992, - "total_submitted": 9262, - "total_column_articles": 70, + "total_acs": 6027, + "total_submitted": 9302, + "total_column_articles": 71, "frontend_question_id": "2410", "is_new_question": false }, @@ -10701,8 +10995,8 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 5427, - "total_submitted": 11337, + "total_acs": 5471, + "total_submitted": 11418, "total_column_articles": 87, "frontend_question_id": "2409", "is_new_question": false @@ -10722,8 +11016,8 @@ "question__title": "Number of Unique Subjects Taught by Each Teacher", "question__title_slug": "number-of-unique-subjects-taught-by-each-teacher", "question__hide": false, - "total_acs": 549, - "total_submitted": 619, + "total_acs": 568, + "total_submitted": 639, "total_column_articles": 9, "frontend_question_id": "2356", "is_new_question": false @@ -10743,9 +11037,9 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 8376, - "total_submitted": 20874, - "total_column_articles": 117, + "total_acs": 8391, + "total_submitted": 20904, + "total_column_articles": 119, "frontend_question_id": "2416", "is_new_question": false }, @@ -10764,9 +11058,9 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 9399, - "total_submitted": 13454, - "total_column_articles": 124, + "total_acs": 9455, + "total_submitted": 13527, + "total_column_articles": 125, "frontend_question_id": "2415", "is_new_question": false }, @@ -10785,8 +11079,8 @@ "question__title": "Length of the Longest Alphabetical Continuous Substring", "question__title_slug": "length-of-the-longest-alphabetical-continuous-substring", "question__hide": false, - "total_acs": 10832, - "total_submitted": 17871, + "total_acs": 10868, + "total_submitted": 17921, "total_column_articles": 113, "frontend_question_id": "2414", "is_new_question": false @@ -10806,9 +11100,9 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 16171, - "total_submitted": 18487, - "total_column_articles": 129, + "total_acs": 16342, + "total_submitted": 18677, + "total_column_articles": 130, "frontend_question_id": "2413", "is_new_question": false }, @@ -10827,8 +11121,8 @@ "question__title": "Maximum Number of Books You Can Take", "question__title_slug": "maximum-number-of-books-you-can-take", "question__hide": false, - "total_acs": 249, - "total_submitted": 405, + "total_acs": 254, + "total_submitted": 411, "total_column_articles": 8, "frontend_question_id": "2355", "is_new_question": false @@ -10848,8 +11142,8 @@ "question__title": "Sort Array by Moving Items to Empty Space", "question__title_slug": "sort-array-by-moving-items-to-empty-space", "question__hide": false, - "total_acs": 103, - "total_submitted": 170, + "total_acs": 108, + "total_submitted": 177, "total_column_articles": 3, "frontend_question_id": "2459", "is_new_question": false @@ -10869,8 +11163,8 @@ "question__title": "Divide Intervals Into Minimum Number of Groups", "question__title_slug": "divide-intervals-into-minimum-number-of-groups", "question__hide": false, - "total_acs": 7853, - "total_submitted": 17912, + "total_acs": 7893, + "total_submitted": 17976, "total_column_articles": 122, "frontend_question_id": "2406", "is_new_question": false @@ -10890,8 +11184,8 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 9316, - "total_submitted": 12544, + "total_acs": 9362, + "total_submitted": 12598, "total_column_articles": 117, "frontend_question_id": "2405", "is_new_question": false @@ -10911,8 +11205,8 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 10057, - "total_submitted": 18304, + "total_acs": 10125, + "total_submitted": 18448, "total_column_articles": 119, "frontend_question_id": "2404", "is_new_question": false @@ -10932,8 +11226,8 @@ "question__title": "Finding the Number of Visible Mountains", "question__title_slug": "finding-the-number-of-visible-mountains", "question__hide": false, - "total_acs": 154, - "total_submitted": 269, + "total_acs": 157, + "total_submitted": 279, "total_column_articles": 6, "frontend_question_id": "2345", "is_new_question": false @@ -10953,8 +11247,8 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 418, - "total_submitted": 1068, + "total_acs": 440, + "total_submitted": 1175, "total_column_articles": 8, "frontend_question_id": "2346", "is_new_question": false @@ -10974,8 +11268,8 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 5643, - "total_submitted": 11778, + "total_acs": 5665, + "total_submitted": 11809, "total_column_articles": 73, "frontend_question_id": "2365", "is_new_question": false @@ -10995,9 +11289,9 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 4708, - "total_submitted": 9057, - "total_column_articles": 82, + "total_acs": 4751, + "total_submitted": 9116, + "total_column_articles": 84, "frontend_question_id": "2397", "is_new_question": false }, @@ -11016,9 +11310,9 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 8547, - "total_submitted": 9653, - "total_column_articles": 86, + "total_acs": 8653, + "total_submitted": 9768, + "total_column_articles": 87, "frontend_question_id": "2396", "is_new_question": false }, @@ -11037,9 +11331,9 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 6913, - "total_submitted": 9644, - "total_column_articles": 69, + "total_acs": 6964, + "total_submitted": 9728, + "total_column_articles": 71, "frontend_question_id": "2395", "is_new_question": false }, @@ -11058,8 +11352,8 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 5527, - "total_submitted": 17109, + "total_acs": 5580, + "total_submitted": 17245, "total_column_articles": 111, "frontend_question_id": "2402", "is_new_question": false @@ -11079,9 +11373,9 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 8946, - "total_submitted": 18493, - "total_column_articles": 152, + "total_acs": 9006, + "total_submitted": 18585, + "total_column_articles": 154, "frontend_question_id": "2401", "is_new_question": false }, @@ -11100,8 +11394,8 @@ "question__title": "Number of Ways to Reach a Position After Exactly k Steps", "question__title_slug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "question__hide": false, - "total_acs": 9846, - "total_submitted": 30882, + "total_acs": 9920, + "total_submitted": 31011, "total_column_articles": 142, "frontend_question_id": "2400", "is_new_question": false @@ -11121,9 +11415,9 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 12031, - "total_submitted": 16644, - "total_column_articles": 141, + "total_acs": 12087, + "total_submitted": 16713, + "total_column_articles": 142, "frontend_question_id": "2399", "is_new_question": false }, @@ -11142,8 +11436,8 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 8998, - "total_submitted": 29149, + "total_acs": 9019, + "total_submitted": 29233, "total_column_articles": 140, "frontend_question_id": "2384", "is_new_question": false @@ -11163,8 +11457,8 @@ "question__title": "Minimum Adjacent Swaps to Make a Valid Array", "question__title_slug": "minimum-adjacent-swaps-to-make-a-valid-array", "question__hide": false, - "total_acs": 214, - "total_submitted": 289, + "total_acs": 216, + "total_submitted": 294, "total_column_articles": 7, "frontend_question_id": "2340", "is_new_question": false @@ -11184,9 +11478,9 @@ "question__title": "Max Sum of a Pair With Equal Sum of Digits", "question__title_slug": "max-sum-of-a-pair-with-equal-sum-of-digits", "question__hide": false, - "total_acs": 10479, - "total_submitted": 19714, - "total_column_articles": 134, + "total_acs": 10520, + "total_submitted": 19770, + "total_column_articles": 135, "frontend_question_id": "2342", "is_new_question": false }, @@ -11205,8 +11499,8 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 5099, - "total_submitted": 9313, + "total_acs": 5116, + "total_submitted": 9334, "total_column_articles": 93, "frontend_question_id": "2392", "is_new_question": false @@ -11226,8 +11520,8 @@ "question__title": "Minimum Amount of Time to Collect Garbage", "question__title_slug": "minimum-amount-of-time-to-collect-garbage", "question__hide": false, - "total_acs": 8963, - "total_submitted": 10334, + "total_acs": 9023, + "total_submitted": 10402, "total_column_articles": 141, "frontend_question_id": "2391", "is_new_question": false @@ -11247,8 +11541,8 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 10076, - "total_submitted": 15247, + "total_acs": 10120, + "total_submitted": 15295, "total_column_articles": 127, "frontend_question_id": "2390", "is_new_question": false @@ -11268,8 +11562,8 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 10115, - "total_submitted": 15208, + "total_acs": 10182, + "total_submitted": 15298, "total_column_articles": 116, "frontend_question_id": "2389", "is_new_question": false @@ -11289,8 +11583,8 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 270, - "total_submitted": 326, + "total_acs": 274, + "total_submitted": 331, "total_column_articles": 14, "frontend_question_id": "2330", "is_new_question": false @@ -11310,8 +11604,8 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 3429, - "total_submitted": 6194, + "total_acs": 3451, + "total_submitted": 6229, "total_column_articles": 84, "frontend_question_id": "2382", "is_new_question": false @@ -11331,9 +11625,9 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 4859, - "total_submitted": 13550, - "total_column_articles": 89, + "total_acs": 4907, + "total_submitted": 13647, + "total_column_articles": 91, "frontend_question_id": "2381", "is_new_question": false }, @@ -11352,9 +11646,9 @@ "question__title": "Time Needed to Rearrange a Binary String", "question__title_slug": "time-needed-to-rearrange-a-binary-string", "question__hide": false, - "total_acs": 5777, - "total_submitted": 10312, - "total_column_articles": 64, + "total_acs": 5796, + "total_submitted": 10341, + "total_column_articles": 65, "frontend_question_id": "2380", "is_new_question": false }, @@ -11373,9 +11667,9 @@ "question__title": "Minimum Recolors to Get K Consecutive Black Blocks", "question__title_slug": "minimum-recolors-to-get-k-consecutive-black-blocks", "question__hide": false, - "total_acs": 6898, - "total_submitted": 11671, - "total_column_articles": 103, + "total_acs": 6971, + "total_submitted": 11774, + "total_column_articles": 106, "frontend_question_id": "2379", "is_new_question": false }, @@ -11394,8 +11688,8 @@ "question__title": "Find the K-Sum of an Array", "question__title_slug": "find-the-k-sum-of-an-array", "question__hide": false, - "total_acs": 3420, - "total_submitted": 8248, + "total_acs": 3437, + "total_submitted": 8283, "total_column_articles": 48, "frontend_question_id": "2386", "is_new_question": false @@ -11415,9 +11709,9 @@ "question__title": "Amount of Time for Binary Tree to Be Infected", "question__title_slug": "amount-of-time-for-binary-tree-to-be-infected", "question__hide": false, - "total_acs": 7636, - "total_submitted": 16582, - "total_column_articles": 143, + "total_acs": 7677, + "total_submitted": 16668, + "total_column_articles": 144, "frontend_question_id": "2385", "is_new_question": false }, @@ -11436,8 +11730,8 @@ "question__title": "Minimum Hours of Training to Win a Competition", "question__title_slug": "minimum-hours-of-training-to-win-a-competition", "question__hide": false, - "total_acs": 9982, - "total_submitted": 23979, + "total_acs": 10025, + "total_submitted": 24080, "total_column_articles": 140, "frontend_question_id": "2383", "is_new_question": false @@ -11458,7 +11752,7 @@ "question__title_slug": "find-minimum-time-to-finish-all-jobs-ii", "question__hide": false, "total_acs": 197, - "total_submitted": 283, + "total_submitted": 284, "total_column_articles": 9, "frontend_question_id": "2323", "is_new_question": false @@ -11478,8 +11772,8 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 6957, - "total_submitted": 14014, + "total_acs": 6992, + "total_submitted": 14074, "total_column_articles": 107, "frontend_question_id": "2376", "is_new_question": false @@ -11499,9 +11793,9 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 9106, - "total_submitted": 13074, - "total_column_articles": 201, + "total_acs": 9139, + "total_submitted": 13111, + "total_column_articles": 202, "frontend_question_id": "2375", "is_new_question": false }, @@ -11520,8 +11814,8 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 9149, - "total_submitted": 21819, + "total_acs": 9167, + "total_submitted": 21849, "total_column_articles": 99, "frontend_question_id": "2374", "is_new_question": false @@ -11541,8 +11835,8 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 10741, - "total_submitted": 12678, + "total_acs": 10794, + "total_submitted": 12737, "total_column_articles": 106, "frontend_question_id": "2373", "is_new_question": false @@ -11562,8 +11856,8 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 568, - "total_submitted": 756, + "total_acs": 591, + "total_submitted": 786, "total_column_articles": 11, "frontend_question_id": "2339", "is_new_question": false @@ -11583,8 +11877,8 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 663, - "total_submitted": 913, + "total_acs": 682, + "total_submitted": 938, "total_column_articles": 8, "frontend_question_id": "2329", "is_new_question": false @@ -11604,9 +11898,9 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 494, - "total_submitted": 641, - "total_column_articles": 7, + "total_acs": 515, + "total_submitted": 726, + "total_column_articles": 8, "frontend_question_id": "2324", "is_new_question": false }, @@ -11625,8 +11919,8 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 3812, - "total_submitted": 9108, + "total_acs": 3825, + "total_submitted": 9139, "total_column_articles": 46, "frontend_question_id": "2366", "is_new_question": false @@ -11646,9 +11940,9 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 3764, - "total_submitted": 11276, - "total_column_articles": 76, + "total_acs": 3789, + "total_submitted": 11321, + "total_column_articles": 77, "frontend_question_id": "2398", "is_new_question": false }, @@ -11667,8 +11961,8 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 5638, - "total_submitted": 13536, + "total_acs": 5671, + "total_submitted": 13583, "total_column_articles": 82, "frontend_question_id": "2364", "is_new_question": false @@ -11688,8 +11982,8 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 7661, - "total_submitted": 9993, + "total_acs": 7725, + "total_submitted": 10069, "total_column_articles": 89, "frontend_question_id": "2363", "is_new_question": false @@ -11709,8 +12003,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": 492, - "total_submitted": 669, + "total_acs": 511, + "total_submitted": 703, "total_column_articles": 9, "frontend_question_id": "2314", "is_new_question": false @@ -11730,8 +12024,8 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 9159, - "total_submitted": 20086, + "total_acs": 9194, + "total_submitted": 20127, "total_column_articles": 132, "frontend_question_id": "2368", "is_new_question": false @@ -11751,9 +12045,9 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 7551, - "total_submitted": 17785, - "total_column_articles": 109, + "total_acs": 7584, + "total_submitted": 17863, + "total_column_articles": 110, "frontend_question_id": "2370", "is_new_question": false }, @@ -11772,9 +12066,9 @@ "question__title": "Check if There is a Valid Partition For The Array", "question__title_slug": "check-if-there-is-a-valid-partition-for-the-array", "question__hide": false, - "total_acs": 7822, - "total_submitted": 21001, - "total_column_articles": 108, + "total_acs": 7856, + "total_submitted": 21069, + "total_column_articles": 109, "frontend_question_id": "2369", "is_new_question": false }, @@ -11793,9 +12087,9 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 13967, - "total_submitted": 16604, - "total_column_articles": 148, + "total_acs": 14076, + "total_submitted": 16732, + "total_column_articles": 152, "frontend_question_id": "2367", "is_new_question": false }, @@ -11814,9 +12108,9 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 541, - "total_submitted": 688, - "total_column_articles": 11, + "total_acs": 562, + "total_submitted": 719, + "total_column_articles": 12, "frontend_question_id": "2308", "is_new_question": false }, @@ -11835,8 +12129,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 579, - "total_submitted": 690, + "total_acs": 605, + "total_submitted": 728, "total_column_articles": 9, "frontend_question_id": "2298", "is_new_question": false @@ -11856,8 +12150,8 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 7301, - "total_submitted": 19670, + "total_acs": 7341, + "total_submitted": 19737, "total_column_articles": 134, "frontend_question_id": "2360", "is_new_question": false @@ -11877,8 +12171,8 @@ "question__title": "Find Closest Node to Given Two Nodes", "question__title_slug": "find-closest-node-to-given-two-nodes", "question__hide": false, - "total_acs": 7331, - "total_submitted": 24838, + "total_acs": 7354, + "total_submitted": 24892, "total_column_articles": 105, "frontend_question_id": "2359", "is_new_question": false @@ -11898,9 +12192,9 @@ "question__title": "Maximum Number of Groups Entering a Competition", "question__title_slug": "maximum-number-of-groups-entering-a-competition", "question__hide": false, - "total_acs": 9738, - "total_submitted": 15165, - "total_column_articles": 158, + "total_acs": 9794, + "total_submitted": 15239, + "total_column_articles": 159, "frontend_question_id": "2358", "is_new_question": false }, @@ -11919,9 +12213,9 @@ "question__title": "Make Array Zero by Subtracting Equal Amounts", "question__title_slug": "make-array-zero-by-subtracting-equal-amounts", "question__hide": false, - "total_acs": 13420, - "total_submitted": 18111, - "total_column_articles": 158, + "total_acs": 13532, + "total_submitted": 18244, + "total_column_articles": 161, "frontend_question_id": "2357", "is_new_question": false }, @@ -11940,8 +12234,8 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 3716, - "total_submitted": 5819, + "total_acs": 3723, + "total_submitted": 5827, "total_column_articles": 70, "frontend_question_id": "2350", "is_new_question": false @@ -11961,9 +12255,9 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 5627, - "total_submitted": 15247, - "total_column_articles": 88, + "total_acs": 5659, + "total_submitted": 15326, + "total_column_articles": 91, "frontend_question_id": "2349", "is_new_question": false }, @@ -11982,8 +12276,8 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 7015, - "total_submitted": 12930, + "total_acs": 7065, + "total_submitted": 13035, "total_column_articles": 81, "frontend_question_id": "2347", "is_new_question": false @@ -12003,9 +12297,9 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 6836, - "total_submitted": 12345, - "total_column_articles": 106, + "total_acs": 7058, + "total_submitted": 12703, + "total_column_articles": 108, "frontend_question_id": "2348", "is_new_question": false }, @@ -12024,8 +12318,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": 608, - "total_submitted": 1359, + "total_acs": 629, + "total_submitted": 1440, "total_column_articles": 10, "frontend_question_id": "2292", "is_new_question": false @@ -12045,8 +12339,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 5936, - "total_submitted": 13517, + "total_acs": 5946, + "total_submitted": 13534, "total_column_articles": 74, "frontend_question_id": "2354", "is_new_question": false @@ -12066,9 +12360,9 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 7136, - "total_submitted": 23457, - "total_column_articles": 111, + "total_acs": 7150, + "total_submitted": 23486, + "total_column_articles": 112, "frontend_question_id": "2353", "is_new_question": false }, @@ -12087,9 +12381,9 @@ "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 10560, - "total_submitted": 14612, - "total_column_articles": 109, + "total_acs": 10613, + "total_submitted": 14681, + "total_column_articles": 110, "frontend_question_id": "2352", "is_new_question": false }, @@ -12108,9 +12402,9 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 36171, - "total_submitted": 42048, - "total_column_articles": 368, + "total_acs": 36656, + "total_submitted": 42640, + "total_column_articles": 371, "frontend_question_id": "2351", "is_new_question": false }, @@ -12129,8 +12423,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 235, - "total_submitted": 362, + "total_acs": 258, + "total_submitted": 388, "total_column_articles": 11, "frontend_question_id": "2291", "is_new_question": false @@ -12150,8 +12444,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": 172, - "total_submitted": 334, + "total_acs": 173, + "total_submitted": 340, "total_column_articles": 10, "frontend_question_id": "2282", "is_new_question": false @@ -12171,8 +12465,8 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 7890, - "total_submitted": 14964, + "total_acs": 7919, + "total_submitted": 15008, "total_column_articles": 114, "frontend_question_id": "2344", "is_new_question": false @@ -12192,9 +12486,9 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 8794, - "total_submitted": 21447, - "total_column_articles": 130, + "total_acs": 8827, + "total_submitted": 21539, + "total_column_articles": 131, "frontend_question_id": "2343", "is_new_question": false }, @@ -12213,8 +12507,8 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 12064, - "total_submitted": 15103, + "total_acs": 12127, + "total_submitted": 15188, "total_column_articles": 172, "frontend_question_id": "2341", "is_new_question": false @@ -12234,8 +12528,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 253, - "total_submitted": 366, + "total_acs": 254, + "total_submitted": 373, "total_column_articles": 12, "frontend_question_id": "2277", "is_new_question": false @@ -12255,9 +12549,9 @@ "question__title": "Subarray With Elements Greater Than Varying Threshold", "question__title_slug": "subarray-with-elements-greater-than-varying-threshold", "question__hide": false, - "total_acs": 2897, - "total_submitted": 6182, - "total_column_articles": 51, + "total_acs": 2921, + "total_submitted": 6229, + "total_column_articles": 52, "frontend_question_id": "2334", "is_new_question": false }, @@ -12276,9 +12570,9 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 4326, - "total_submitted": 16533, - "total_column_articles": 68, + "total_acs": 4352, + "total_submitted": 16615, + "total_column_articles": 69, "frontend_question_id": "2333", "is_new_question": false }, @@ -12297,9 +12591,9 @@ "question__title": "The Latest Time to Catch a Bus", "question__title_slug": "the-latest-time-to-catch-a-bus", "question__hide": false, - "total_acs": 4742, - "total_submitted": 20124, - "total_column_articles": 86, + "total_acs": 4773, + "total_submitted": 20215, + "total_column_articles": 87, "frontend_question_id": "2332", "is_new_question": false }, @@ -12318,9 +12612,9 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 7537, - "total_submitted": 9174, - "total_column_articles": 106, + "total_acs": 7620, + "total_submitted": 9284, + "total_column_articles": 107, "frontend_question_id": "2331", "is_new_question": false }, @@ -12339,8 +12633,8 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 2610, - "total_submitted": 8670, + "total_acs": 2623, + "total_submitted": 8706, "total_column_articles": 44, "frontend_question_id": "2338", "is_new_question": false @@ -12360,9 +12654,9 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 7649, - "total_submitted": 19739, - "total_column_articles": 117, + "total_acs": 7691, + "total_submitted": 19831, + "total_column_articles": 119, "frontend_question_id": "2337", "is_new_question": false }, @@ -12381,9 +12675,9 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 9036, - "total_submitted": 12874, - "total_column_articles": 118, + "total_acs": 9055, + "total_submitted": 12897, + "total_column_articles": 119, "frontend_question_id": "2336", "is_new_question": false }, @@ -12402,8 +12696,8 @@ "question__title": "Minimum Amount of Time to Fill Cups", "question__title_slug": "minimum-amount-of-time-to-fill-cups", "question__hide": false, - "total_acs": 11959, - "total_submitted": 20965, + "total_acs": 12013, + "total_submitted": 21041, "total_column_articles": 152, "frontend_question_id": "2335", "is_new_question": false @@ -12423,9 +12717,9 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 9259, - "total_submitted": 13843, - "total_column_articles": 125, + "total_acs": 9293, + "total_submitted": 13908, + "total_column_articles": 127, "frontend_question_id": "2326", "is_new_question": false }, @@ -12444,9 +12738,9 @@ "question__title": "Number of Increasing Paths in a Grid", "question__title_slug": "number-of-increasing-paths-in-a-grid", "question__hide": false, - "total_acs": 5694, - "total_submitted": 11403, - "total_column_articles": 107, + "total_acs": 5723, + "total_submitted": 11457, + "total_column_articles": 109, "frontend_question_id": "2328", "is_new_question": false }, @@ -12465,9 +12759,9 @@ "question__title": "Number of People Aware of a Secret", "question__title_slug": "number-of-people-aware-of-a-secret", "question__hide": false, - "total_acs": 8883, - "total_submitted": 19436, - "total_column_articles": 184, + "total_acs": 8922, + "total_submitted": 19541, + "total_column_articles": 188, "frontend_question_id": "2327", "is_new_question": false }, @@ -12486,9 +12780,9 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 11576, - "total_submitted": 14106, - "total_column_articles": 115, + "total_acs": 11626, + "total_submitted": 14166, + "total_column_articles": 116, "frontend_question_id": "2325", "is_new_question": false }, @@ -12507,8 +12801,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 368, - "total_submitted": 544, + "total_acs": 371, + "total_submitted": 549, "total_column_articles": 16, "frontend_question_id": "2268", "is_new_question": false @@ -12528,8 +12822,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 3252, - "total_submitted": 5732, + "total_acs": 3286, + "total_submitted": 5793, "total_column_articles": 66, "frontend_question_id": "2318", "is_new_question": false @@ -12549,8 +12843,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": 6039, - "total_submitted": 15775, + "total_acs": 6079, + "total_submitted": 15861, "total_column_articles": 108, "frontend_question_id": "2316", "is_new_question": false @@ -12570,8 +12864,8 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 4592, - "total_submitted": 5385, + "total_acs": 4630, + "total_submitted": 5425, "total_column_articles": 62, "frontend_question_id": "2317", "is_new_question": false @@ -12591,8 +12885,8 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 8794, - "total_submitted": 10480, + "total_acs": 8912, + "total_submitted": 10622, "total_column_articles": 148, "frontend_question_id": "2315", "is_new_question": false @@ -12612,8 +12906,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": 3284, - "total_submitted": 5564, + "total_acs": 3293, + "total_submitted": 5573, "total_column_articles": 55, "frontend_question_id": "2322", "is_new_question": false @@ -12633,8 +12927,8 @@ "question__title": "Minimum Flips in Binary Tree to Get Result", "question__title_slug": "minimum-flips-in-binary-tree-to-get-result", "question__hide": false, - "total_acs": 170, - "total_submitted": 247, + "total_acs": 171, + "total_submitted": 251, "total_column_articles": 12, "frontend_question_id": "2313", "is_new_question": false @@ -12654,9 +12948,9 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 10378, - "total_submitted": 14173, - "total_column_articles": 85, + "total_acs": 10435, + "total_submitted": 14246, + "total_column_articles": 86, "frontend_question_id": "2319", "is_new_question": false }, @@ -12675,8 +12969,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": 7893, - "total_submitted": 19832, + "total_acs": 7915, + "total_submitted": 19871, "total_column_articles": 89, "frontend_question_id": "2320", "is_new_question": false @@ -12696,8 +12990,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 103, - "total_submitted": 167, + "total_acs": 104, + "total_submitted": 169, "total_column_articles": 6, "frontend_question_id": "2254", "is_new_question": false @@ -12717,8 +13011,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": 6805, - "total_submitted": 18629, + "total_acs": 6834, + "total_submitted": 18690, "total_column_articles": 127, "frontend_question_id": "2311", "is_new_question": false @@ -12738,9 +13032,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": 4760, - "total_submitted": 9491, - "total_column_articles": 77, + "total_acs": 4819, + "total_submitted": 9580, + "total_column_articles": 78, "frontend_question_id": "2302", "is_new_question": false }, @@ -12759,8 +13053,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 4039, - "total_submitted": 9012, + "total_acs": 4075, + "total_submitted": 9067, "total_column_articles": 68, "frontend_question_id": "2301", "is_new_question": false @@ -12780,9 +13074,9 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 6236, - "total_submitted": 16383, - "total_column_articles": 93, + "total_acs": 6336, + "total_submitted": 16620, + "total_column_articles": 95, "frontend_question_id": "2300", "is_new_question": false }, @@ -12801,9 +13095,9 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 6775, - "total_submitted": 11031, - "total_column_articles": 99, + "total_acs": 23891, + "total_submitted": 36271, + "total_column_articles": 284, "frontend_question_id": "2299", "is_new_question": false }, @@ -12822,8 +13116,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 4234, - "total_submitted": 9632, + "total_acs": 4247, + "total_submitted": 9671, "total_column_articles": 64, "frontend_question_id": "2306", "is_new_question": false @@ -12843,8 +13137,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 6431, - "total_submitted": 14838, + "total_acs": 6502, + "total_submitted": 14923, "total_column_articles": 119, "frontend_question_id": "2296", "is_new_question": false @@ -12864,8 +13158,8 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 8145, - "total_submitted": 14209, + "total_acs": 8195, + "total_submitted": 14280, "total_column_articles": 113, "frontend_question_id": "2295", "is_new_question": false @@ -12885,8 +13179,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": 7892, - "total_submitted": 11607, + "total_acs": 7981, + "total_submitted": 11765, "total_column_articles": 109, "frontend_question_id": "2294", "is_new_question": false @@ -12906,9 +13200,9 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 9474, - "total_submitted": 13750, - "total_column_articles": 120, + "total_acs": 27898, + "total_submitted": 38014, + "total_column_articles": 306, "frontend_question_id": "2293", "is_new_question": false }, @@ -12928,7 +13222,7 @@ "question__title_slug": "count-positions-on-street-with-required-brightness", "question__hide": false, "total_acs": 247, - "total_submitted": 329, + "total_submitted": 330, "total_column_articles": 15, "frontend_question_id": "2237", "is_new_question": false @@ -12948,9 +13242,9 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 16379, - "total_submitted": 18909, - "total_column_articles": 130, + "total_acs": 16712, + "total_submitted": 19272, + "total_column_articles": 131, "frontend_question_id": "2236", "is_new_question": false }, @@ -12969,9 +13263,9 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 24637, - "total_submitted": 28483, - "total_column_articles": 119, + "total_acs": 24907, + "total_submitted": 28804, + "total_column_articles": 120, "frontend_question_id": "2235", "is_new_question": false }, @@ -12990,8 +13284,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 181, - "total_submitted": 268, + "total_acs": 186, + "total_submitted": 274, "total_column_articles": 3, "frontend_question_id": "2253", "is_new_question": false @@ -13011,8 +13305,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 186, - "total_submitted": 329, + "total_acs": 189, + "total_submitted": 332, "total_column_articles": 3, "frontend_question_id": "2252", "is_new_question": false @@ -13032,8 +13326,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 2806, - "total_submitted": 12464, + "total_acs": 2825, + "total_submitted": 12511, "total_column_articles": 48, "frontend_question_id": "2286", "is_new_question": false @@ -13053,8 +13347,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 5668, - "total_submitted": 9890, + "total_acs": 5688, + "total_submitted": 9918, "total_column_articles": 82, "frontend_question_id": "2285", "is_new_question": false @@ -13074,8 +13368,8 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 6023, - "total_submitted": 10574, + "total_acs": 6047, + "total_submitted": 10607, "total_column_articles": 87, "frontend_question_id": "2284", "is_new_question": false @@ -13095,9 +13389,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": 29705, - "total_submitted": 37337, - "total_column_articles": 365, + "total_acs": 30093, + "total_submitted": 37823, + "total_column_articles": 369, "frontend_question_id": "2283", "is_new_question": false }, @@ -13116,8 +13410,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": 724, - "total_submitted": 1024, + "total_acs": 746, + "total_submitted": 1067, "total_column_articles": 12, "frontend_question_id": "2238", "is_new_question": false @@ -13137,8 +13431,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 5448, - "total_submitted": 9883, + "total_acs": 5545, + "total_submitted": 10003, "total_column_articles": 90, "frontend_question_id": "2290", "is_new_question": false @@ -13158,8 +13452,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 5172, - "total_submitted": 24381, + "total_acs": 5203, + "total_submitted": 24518, "total_column_articles": 91, "frontend_question_id": "2289", "is_new_question": false @@ -13179,8 +13473,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 7766, - "total_submitted": 24924, + "total_acs": 7796, + "total_submitted": 24994, "total_column_articles": 109, "frontend_question_id": "2288", "is_new_question": false @@ -13200,9 +13494,9 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 29545, - "total_submitted": 45106, - "total_column_articles": 397, + "total_acs": 30984, + "total_submitted": 47371, + "total_column_articles": 421, "frontend_question_id": "2287", "is_new_question": false }, @@ -13221,8 +13515,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": 768, - "total_submitted": 1552, + "total_acs": 778, + "total_submitted": 1574, "total_column_articles": 7, "frontend_question_id": "2230", "is_new_question": false @@ -13242,8 +13536,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": 793, - "total_submitted": 1675, + "total_acs": 815, + "total_submitted": 1715, "total_column_articles": 14, "frontend_question_id": "2228", "is_new_question": false @@ -13263,8 +13557,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 262, - "total_submitted": 417, + "total_acs": 266, + "total_submitted": 423, "total_column_articles": 14, "frontend_question_id": "2219", "is_new_question": false @@ -13284,8 +13578,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 3671, - "total_submitted": 14038, + "total_acs": 3688, + "total_submitted": 14069, "total_column_articles": 67, "frontend_question_id": "2281", "is_new_question": false @@ -13305,9 +13599,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": 8984, - "total_submitted": 41064, - "total_column_articles": 150, + "total_acs": 9025, + "total_submitted": 41189, + "total_column_articles": 151, "frontend_question_id": "2280", "is_new_question": false }, @@ -13326,9 +13620,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": 11822, - "total_submitted": 18284, - "total_column_articles": 122, + "total_acs": 11882, + "total_submitted": 18364, + "total_column_articles": 123, "frontend_question_id": "2279", "is_new_question": false }, @@ -13347,8 +13641,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 13132, - "total_submitted": 16163, + "total_acs": 13248, + "total_submitted": 16325, "total_column_articles": 118, "frontend_question_id": "2278", "is_new_question": false @@ -13368,9 +13662,9 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 4424, - "total_submitted": 9815, - "total_column_articles": 58, + "total_acs": 4563, + "total_submitted": 10057, + "total_column_articles": 59, "frontend_question_id": "2246", "is_new_question": false }, @@ -13389,8 +13683,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": 4385, - "total_submitted": 12427, + "total_acs": 4394, + "total_submitted": 12440, "total_column_articles": 95, "frontend_question_id": "2245", "is_new_question": false @@ -13410,8 +13704,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 10281, - "total_submitted": 18147, + "total_acs": 10299, + "total_submitted": 18172, "total_column_articles": 153, "frontend_question_id": "2244", "is_new_question": false @@ -13431,9 +13725,9 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 11036, - "total_submitted": 17429, - "total_column_articles": 153, + "total_acs": 11108, + "total_submitted": 17527, + "total_column_articles": 155, "frontend_question_id": "2243", "is_new_question": false }, @@ -13452,8 +13746,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 3481, - "total_submitted": 9056, + "total_acs": 3503, + "total_submitted": 9086, "total_column_articles": 41, "frontend_question_id": "2272", "is_new_question": false @@ -13473,8 +13767,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": 5400, - "total_submitted": 17020, + "total_acs": 5431, + "total_submitted": 17071, "total_column_articles": 94, "frontend_question_id": "2271", "is_new_question": false @@ -13494,8 +13788,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 6266, - "total_submitted": 13462, + "total_acs": 6289, + "total_submitted": 13496, "total_column_articles": 73, "frontend_question_id": "2270", "is_new_question": false @@ -13515,8 +13809,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 5819, - "total_submitted": 16129, + "total_acs": 5834, + "total_submitted": 16153, "total_column_articles": 98, "frontend_question_id": "2276", "is_new_question": false @@ -13536,8 +13830,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": 7698, - "total_submitted": 12965, + "total_acs": 7713, + "total_submitted": 12986, "total_column_articles": 101, "frontend_question_id": "2275", "is_new_question": false @@ -13557,8 +13851,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 9333, - "total_submitted": 17658, + "total_acs": 9355, + "total_submitted": 17686, "total_column_articles": 107, "frontend_question_id": "2274", "is_new_question": false @@ -13578,8 +13872,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 578, - "total_submitted": 1061, + "total_acs": 585, + "total_submitted": 1074, "total_column_articles": 10, "frontend_question_id": "2214", "is_new_question": false @@ -13599,8 +13893,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 2835, - "total_submitted": 8656, + "total_acs": 2858, + "total_submitted": 8686, "total_column_articles": 43, "frontend_question_id": "2242", "is_new_question": false @@ -13620,8 +13914,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 6217, - "total_submitted": 17233, + "total_acs": 6242, + "total_submitted": 17289, "total_column_articles": 74, "frontend_question_id": "2241", "is_new_question": false @@ -13641,9 +13935,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": 6334, - "total_submitted": 10991, - "total_column_articles": 76, + "total_acs": 6360, + "total_submitted": 11033, + "total_column_articles": 77, "frontend_question_id": "2240", "is_new_question": false }, @@ -13662,9 +13956,9 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 9803, - "total_submitted": 17983, - "total_column_articles": 125, + "total_acs": 9872, + "total_submitted": 18100, + "total_column_articles": 127, "frontend_question_id": "2239", "is_new_question": false }, @@ -13683,8 +13977,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": 7607, - "total_submitted": 20346, + "total_acs": 7629, + "total_submitted": 20377, "total_column_articles": 129, "frontend_question_id": "2267", "is_new_question": false @@ -13704,8 +13998,8 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 7303, - "total_submitted": 16926, + "total_acs": 7317, + "total_submitted": 16954, "total_column_articles": 134, "frontend_question_id": "2266", "is_new_question": false @@ -13725,9 +14019,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": 9930, - "total_submitted": 12025, - "total_column_articles": 182, + "total_acs": 9971, + "total_submitted": 12077, + "total_column_articles": 183, "frontend_question_id": "2265", "is_new_question": false }, @@ -13746,9 +14040,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": 11975, - "total_submitted": 19249, - "total_column_articles": 160, + "total_acs": 12027, + "total_submitted": 19331, + "total_column_articles": 161, "frontend_question_id": "2264", "is_new_question": false }, @@ -13767,8 +14061,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": 11312, - "total_submitted": 16351, + "total_acs": 11391, + "total_submitted": 16456, "total_column_articles": 151, "frontend_question_id": "2224", "is_new_question": false @@ -13788,9 +14082,9 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 2693, - "total_submitted": 7602, - "total_column_articles": 82, + "total_acs": 2705, + "total_submitted": 7632, + "total_column_articles": 81, "frontend_question_id": "2258", "is_new_question": false }, @@ -13809,8 +14103,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 4713, - "total_submitted": 9013, + "total_acs": 4733, + "total_submitted": 9052, "total_column_articles": 100, "frontend_question_id": "2257", "is_new_question": false @@ -13830,8 +14124,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 5954, - "total_submitted": 16347, + "total_acs": 5984, + "total_submitted": 16429, "total_column_articles": 77, "frontend_question_id": "2256", "is_new_question": false @@ -13851,8 +14145,8 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 8755, - "total_submitted": 11094, + "total_acs": 8824, + "total_submitted": 11186, "total_column_articles": 134, "frontend_question_id": "2255", "is_new_question": false @@ -13872,9 +14166,9 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 6301, - "total_submitted": 11116, - "total_column_articles": 116, + "total_acs": 6319, + "total_submitted": 11147, + "total_column_articles": 118, "frontend_question_id": "2262", "is_new_question": false }, @@ -13893,8 +14187,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 7998, - "total_submitted": 15226, + "total_acs": 8009, + "total_submitted": 15254, "total_column_articles": 129, "frontend_question_id": "2261", "is_new_question": false @@ -13914,9 +14208,9 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 9778, - "total_submitted": 19470, - "total_column_articles": 149, + "total_acs": 9814, + "total_submitted": 19519, + "total_column_articles": 150, "frontend_question_id": "2260", "is_new_question": false }, @@ -13935,8 +14229,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": 11404, - "total_submitted": 22828, + "total_acs": 11477, + "total_submitted": 22988, "total_column_articles": 147, "frontend_question_id": "2259", "is_new_question": false @@ -13956,8 +14250,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": 851, - "total_submitted": 1820, + "total_acs": 860, + "total_submitted": 1836, "total_column_articles": 12, "frontend_question_id": "2205", "is_new_question": false @@ -13977,8 +14271,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 521, - "total_submitted": 894, + "total_acs": 532, + "total_submitted": 905, "total_column_articles": 11, "frontend_question_id": "2199", "is_new_question": false @@ -13998,8 +14292,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 5794, - "total_submitted": 11839, + "total_acs": 5815, + "total_submitted": 11870, "total_column_articles": 121, "frontend_question_id": "2251", "is_new_question": false @@ -14019,8 +14313,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": 6218, - "total_submitted": 18250, + "total_acs": 6239, + "total_submitted": 18285, "total_column_articles": 119, "frontend_question_id": "2250", "is_new_question": false @@ -14040,8 +14334,8 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 9117, - "total_submitted": 17261, + "total_acs": 9139, + "total_submitted": 17299, "total_column_articles": 125, "frontend_question_id": "2249", "is_new_question": false @@ -14061,8 +14355,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 13686, - "total_submitted": 20387, + "total_acs": 13788, + "total_submitted": 20516, "total_column_articles": 180, "frontend_question_id": "2248", "is_new_question": false @@ -14082,8 +14376,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 2942, - "total_submitted": 10526, + "total_acs": 2953, + "total_submitted": 10553, "total_column_articles": 73, "frontend_question_id": "2234", "is_new_question": false @@ -14103,9 +14397,9 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 8179, - "total_submitted": 22389, - "total_column_articles": 163, + "total_acs": 8215, + "total_submitted": 22480, + "total_column_articles": 165, "frontend_question_id": "2233", "is_new_question": false }, @@ -14124,8 +14418,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": 7021, - "total_submitted": 11491, + "total_acs": 7039, + "total_submitted": 11517, "total_column_articles": 128, "frontend_question_id": "2232", "is_new_question": false @@ -14145,8 +14439,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": 10761, - "total_submitted": 16807, + "total_acs": 10812, + "total_submitted": 16878, "total_column_articles": 179, "frontend_question_id": "2231", "is_new_question": false @@ -14166,8 +14460,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 3382, - "total_submitted": 9224, + "total_acs": 3396, + "total_submitted": 9242, "total_column_articles": 56, "frontend_question_id": "2223", "is_new_question": false @@ -14187,9 +14481,9 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 5991, - "total_submitted": 12114, - "total_column_articles": 130, + "total_acs": 6023, + "total_submitted": 12164, + "total_column_articles": 131, "frontend_question_id": "2222", "is_new_question": false }, @@ -14208,9 +14502,9 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 8523, - "total_submitted": 10603, - "total_column_articles": 111, + "total_acs": 8578, + "total_submitted": 10676, + "total_column_articles": 113, "frontend_question_id": "2221", "is_new_question": false }, @@ -14229,9 +14523,9 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 9067, - "total_submitted": 10962, - "total_column_articles": 140, + "total_acs": 9125, + "total_submitted": 11025, + "total_column_articles": 141, "frontend_question_id": "2220", "is_new_question": false }, @@ -14250,8 +14544,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": 320, - "total_submitted": 591, + "total_acs": 321, + "total_submitted": 595, "total_column_articles": 16, "frontend_question_id": "2184", "is_new_question": false @@ -14271,8 +14565,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": 4032, - "total_submitted": 10818, + "total_acs": 4042, + "total_submitted": 10860, "total_column_articles": 69, "frontend_question_id": "2203", "is_new_question": false @@ -14292,8 +14586,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": 11589, - "total_submitted": 21763, + "total_acs": 11630, + "total_submitted": 21824, "total_column_articles": 143, "frontend_question_id": "2200", "is_new_question": false @@ -14313,9 +14607,9 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 2732, - "total_submitted": 7056, - "total_column_articles": 81, + "total_acs": 2764, + "total_submitted": 7099, + "total_column_articles": 82, "frontend_question_id": "2213", "is_new_question": false }, @@ -14334,8 +14628,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 7012, - "total_submitted": 14819, + "total_acs": 7053, + "total_submitted": 14884, "total_column_articles": 165, "frontend_question_id": "2212", "is_new_question": false @@ -14355,9 +14649,9 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 9218, - "total_submitted": 22807, - "total_column_articles": 137, + "total_acs": 9247, + "total_submitted": 22878, + "total_column_articles": 138, "frontend_question_id": "2211", "is_new_question": false }, @@ -14376,9 +14670,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": 11479, - "total_submitted": 19619, - "total_column_articles": 143, + "total_acs": 11536, + "total_submitted": 19701, + "total_column_articles": 144, "frontend_question_id": "2210", "is_new_question": false }, @@ -14397,8 +14691,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 821, - "total_submitted": 1502, + "total_acs": 840, + "total_submitted": 1536, "total_column_articles": 12, "frontend_question_id": "2175", "is_new_question": false @@ -14419,7 +14713,7 @@ "question__title_slug": "remove-all-ones-with-row-and-column-flips-ii", "question__hide": false, "total_acs": 194, - "total_submitted": 284, + "total_submitted": 285, "total_column_articles": 9, "frontend_question_id": "2174", "is_new_question": false @@ -14439,9 +14733,9 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 900, - "total_submitted": 1667, - "total_column_articles": 24, + "total_acs": 908, + "total_submitted": 1692, + "total_column_articles": 25, "frontend_question_id": "2173", "is_new_question": false }, @@ -14460,9 +14754,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": 8306, - "total_submitted": 14177, - "total_column_articles": 99, + "total_acs": 8368, + "total_submitted": 14290, + "total_column_articles": 100, "frontend_question_id": "2190", "is_new_question": false }, @@ -14481,9 +14775,9 @@ "question__title": "Minimum White Tiles After Covering With Carpets", "question__title_slug": "minimum-white-tiles-after-covering-with-carpets", "question__hide": false, - "total_acs": 4256, - "total_submitted": 11103, - "total_column_articles": 49, + "total_acs": 4287, + "total_submitted": 11156, + "total_column_articles": 50, "frontend_question_id": "2209", "is_new_question": false }, @@ -14502,8 +14796,8 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 6048, - "total_submitted": 15034, + "total_acs": 6079, + "total_submitted": 15103, "total_column_articles": 95, "frontend_question_id": "2208", "is_new_question": false @@ -14523,8 +14817,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": 6327, - "total_submitted": 20563, + "total_acs": 6341, + "total_submitted": 20587, "total_column_articles": 104, "frontend_question_id": "2207", "is_new_question": false @@ -14544,8 +14838,8 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 11500, - "total_submitted": 15430, + "total_acs": 11612, + "total_submitted": 15588, "total_column_articles": 135, "frontend_question_id": "2206", "is_new_question": false @@ -14565,8 +14859,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 5379, - "total_submitted": 15765, + "total_acs": 5389, + "total_submitted": 15781, "total_column_articles": 90, "frontend_question_id": "2197", "is_new_question": false @@ -14586,8 +14880,8 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 8575, - "total_submitted": 11765, + "total_acs": 8603, + "total_submitted": 11801, "total_column_articles": 148, "frontend_question_id": "2196", "is_new_question": false @@ -14607,8 +14901,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 10933, - "total_submitted": 46052, + "total_acs": 10965, + "total_submitted": 46175, "total_column_articles": 217, "frontend_question_id": "2195", "is_new_question": false @@ -14628,9 +14922,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": 12778, - "total_submitted": 15119, - "total_column_articles": 137, + "total_acs": 12835, + "total_submitted": 15176, + "total_column_articles": 138, "frontend_question_id": "2194", "is_new_question": false }, @@ -14649,8 +14943,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 372, - "total_submitted": 589, + "total_acs": 382, + "total_submitted": 618, "total_column_articles": 13, "frontend_question_id": "2168", "is_new_question": false @@ -14670,8 +14964,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 946, - "total_submitted": 1549, + "total_acs": 963, + "total_submitted": 1589, "total_column_articles": 9, "frontend_question_id": "2159", "is_new_question": false @@ -14691,8 +14985,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 4558, - "total_submitted": 16383, + "total_acs": 4586, + "total_submitted": 16433, "total_column_articles": 58, "frontend_question_id": "2183", "is_new_question": false @@ -14712,8 +15006,8 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 6698, - "total_submitted": 13826, + "total_acs": 6720, + "total_submitted": 13859, "total_column_articles": 140, "frontend_question_id": "2182", "is_new_question": false @@ -14733,9 +15027,9 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 13063, - "total_submitted": 15208, - "total_column_articles": 190, + "total_acs": 13145, + "total_submitted": 15308, + "total_column_articles": 191, "frontend_question_id": "2181", "is_new_question": false }, @@ -14754,9 +15048,9 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 32968, - "total_submitted": 48290, - "total_column_articles": 367, + "total_acs": 33151, + "total_submitted": 48554, + "total_column_articles": 368, "frontend_question_id": "2180", "is_new_question": false }, @@ -14775,9 +15069,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": 473, - "total_submitted": 879, - "total_column_articles": 16, + "total_acs": 477, + "total_submitted": 886, + "total_column_articles": 17, "frontend_question_id": "2158", "is_new_question": false }, @@ -14796,9 +15090,9 @@ "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": 450, - "total_submitted": 1011, - "total_column_articles": 6, + "total_acs": 453, + "total_submitted": 1022, + "total_column_articles": 7, "frontend_question_id": "2153", "is_new_question": false }, @@ -14817,8 +15111,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 4185, - "total_submitted": 9510, + "total_acs": 4201, + "total_submitted": 9533, "total_column_articles": 69, "frontend_question_id": "2188", "is_new_question": false @@ -14838,9 +15132,9 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 11315, - "total_submitted": 41282, - "total_column_articles": 149, + "total_acs": 11358, + "total_submitted": 41375, + "total_column_articles": 150, "frontend_question_id": "2187", "is_new_question": false }, @@ -14859,8 +15153,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": 10108, - "total_submitted": 13978, + "total_acs": 10131, + "total_submitted": 14015, "total_column_articles": 119, "frontend_question_id": "2186", "is_new_question": false @@ -14880,9 +15174,9 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 34668, - "total_submitted": 42299, - "total_column_articles": 367, + "total_acs": 34936, + "total_submitted": 42634, + "total_column_articles": 369, "frontend_question_id": "2185", "is_new_question": false }, @@ -14901,8 +15195,8 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 3995, - "total_submitted": 8091, + "total_acs": 4011, + "total_submitted": 8111, "total_column_articles": 74, "frontend_question_id": "2172", "is_new_question": false @@ -14922,8 +15216,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 8721, - "total_submitted": 21860, + "total_acs": 8741, + "total_submitted": 21892, "total_column_articles": 179, "frontend_question_id": "2171", "is_new_question": false @@ -14943,9 +15237,9 @@ "question__title": "Minimum Operations to Make the Array Alternating", "question__title_slug": "minimum-operations-to-make-the-array-alternating", "question__hide": false, - "total_acs": 8779, - "total_submitted": 28623, - "total_column_articles": 154, + "total_acs": 8804, + "total_submitted": 28683, + "total_column_articles": 155, "frontend_question_id": "2170", "is_new_question": false }, @@ -14964,8 +15258,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 15197, - "total_submitted": 20300, + "total_acs": 15254, + "total_submitted": 20389, "total_column_articles": 132, "frontend_question_id": "2169", "is_new_question": false @@ -14985,8 +15279,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": 298, - "total_submitted": 567, + "total_acs": 299, + "total_submitted": 569, "total_column_articles": 15, "frontend_question_id": "2152", "is_new_question": false @@ -15006,8 +15300,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": 4245, - "total_submitted": 8777, + "total_acs": 4274, + "total_submitted": 8813, "total_column_articles": 77, "frontend_question_id": "2167", "is_new_question": false @@ -15027,8 +15321,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 5800, - "total_submitted": 19204, + "total_acs": 5823, + "total_submitted": 19244, "total_column_articles": 153, "frontend_question_id": "2166", "is_new_question": false @@ -15048,9 +15342,9 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 7673, - "total_submitted": 13855, - "total_column_articles": 136, + "total_acs": 7696, + "total_submitted": 13893, + "total_column_articles": 137, "frontend_question_id": "2165", "is_new_question": false }, @@ -15069,8 +15363,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 10052, - "total_submitted": 14685, + "total_acs": 10127, + "total_submitted": 14807, "total_column_articles": 132, "frontend_question_id": "2164", "is_new_question": false @@ -15090,8 +15384,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": 169, - "total_submitted": 303, + "total_acs": 170, + "total_submitted": 305, "total_column_articles": 9, "frontend_question_id": "2143", "is_new_question": false @@ -15111,9 +15405,9 @@ "question__title": "The Number of Passengers in Each Bus I", "question__title_slug": "the-number-of-passengers-in-each-bus-i", "question__hide": false, - "total_acs": 1026, - "total_submitted": 2070, - "total_column_articles": 16, + "total_acs": 1039, + "total_submitted": 2095, + "total_column_articles": 17, "frontend_question_id": "2142", "is_new_question": false }, @@ -15132,8 +15426,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 3023, - "total_submitted": 8450, + "total_acs": 3039, + "total_submitted": 8475, "total_column_articles": 74, "frontend_question_id": "2179", "is_new_question": false @@ -15153,8 +15447,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 6664, - "total_submitted": 11823, + "total_acs": 6679, + "total_submitted": 11846, "total_column_articles": 106, "frontend_question_id": "2178", "is_new_question": false @@ -15174,9 +15468,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": 8103, - "total_submitted": 11648, - "total_column_articles": 85, + "total_acs": 8149, + "total_submitted": 11708, + "total_column_articles": 86, "frontend_question_id": "2177", "is_new_question": false }, @@ -15195,8 +15489,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": 9322, - "total_submitted": 11724, + "total_acs": 9353, + "total_submitted": 11765, "total_column_articles": 115, "frontend_question_id": "2176", "is_new_question": false @@ -15216,8 +15510,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 3372, - "total_submitted": 10896, + "total_acs": 3391, + "total_submitted": 10933, "total_column_articles": 78, "frontend_question_id": "2157", "is_new_question": false @@ -15237,8 +15531,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 5412, - "total_submitted": 22004, + "total_acs": 5428, + "total_submitted": 22044, "total_column_articles": 91, "frontend_question_id": "2156", "is_new_question": false @@ -15258,9 +15552,9 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 14411, - "total_submitted": 19534, - "total_column_articles": 179, + "total_acs": 14491, + "total_submitted": 19655, + "total_column_articles": 180, "frontend_question_id": "2154", "is_new_question": false }, @@ -15280,7 +15574,7 @@ "question__title_slug": "pour-water-between-buckets-to-make-water-levels-equal", "question__hide": false, "total_acs": 292, - "total_submitted": 501, + "total_submitted": 502, "total_column_articles": 11, "frontend_question_id": "2137", "is_new_question": false @@ -15300,8 +15594,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 5057, - "total_submitted": 10170, + "total_acs": 5067, + "total_submitted": 10186, "total_column_articles": 89, "frontend_question_id": "2151", "is_new_question": false @@ -15321,8 +15615,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 10612, - "total_submitted": 13213, + "total_acs": 10675, + "total_submitted": 13294, "total_column_articles": 120, "frontend_question_id": "2149", "is_new_question": false @@ -15342,9 +15636,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": 8859, - "total_submitted": 14855, - "total_column_articles": 107, + "total_acs": 8899, + "total_submitted": 14931, + "total_column_articles": 109, "frontend_question_id": "2150", "is_new_question": false }, @@ -15363,9 +15657,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": 11315, - "total_submitted": 19595, - "total_column_articles": 154, + "total_acs": 11394, + "total_submitted": 19701, + "total_column_articles": 155, "frontend_question_id": "2148", "is_new_question": false }, @@ -15384,8 +15678,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": 501, - "total_submitted": 655, + "total_acs": 506, + "total_submitted": 661, "total_column_articles": 14, "frontend_question_id": "2128", "is_new_question": false @@ -15405,9 +15699,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": 2888, - "total_submitted": 5950, - "total_column_articles": 59, + "total_acs": 2904, + "total_submitted": 5977, + "total_column_articles": 60, "frontend_question_id": "2163", "is_new_question": false }, @@ -15426,8 +15720,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 3191, - "total_submitted": 9563, + "total_acs": 3210, + "total_submitted": 9588, "total_column_articles": 80, "frontend_question_id": "2162", "is_new_question": false @@ -15447,8 +15741,8 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 7538, - "total_submitted": 9073, + "total_acs": 7582, + "total_submitted": 9135, "total_column_articles": 114, "frontend_question_id": "2161", "is_new_question": false @@ -15468,9 +15762,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": 11883, - "total_submitted": 13956, - "total_column_articles": 183, + "total_acs": 11965, + "total_submitted": 14046, + "total_column_articles": 185, "frontend_question_id": "2160", "is_new_question": false }, @@ -15489,8 +15783,8 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 5287, - "total_submitted": 13145, + "total_acs": 5316, + "total_submitted": 13208, "total_column_articles": 81, "frontend_question_id": "2141", "is_new_question": false @@ -15510,8 +15804,8 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 8138, - "total_submitted": 18911, + "total_acs": 8185, + "total_submitted": 18999, "total_column_articles": 157, "frontend_question_id": "2140", "is_new_question": false @@ -15531,8 +15825,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": 7669, - "total_submitted": 11907, + "total_acs": 7684, + "total_submitted": 11923, "total_column_articles": 113, "frontend_question_id": "2155", "is_new_question": false @@ -15552,9 +15846,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": 9738, - "total_submitted": 14626, - "total_column_articles": 147, + "total_acs": 9766, + "total_submitted": 14667, + "total_column_articles": 148, "frontend_question_id": "2138", "is_new_question": false }, @@ -15594,8 +15888,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": 249, - "total_submitted": 410, + "total_acs": 258, + "total_submitted": 431, "total_column_articles": 11, "frontend_question_id": "2113", "is_new_question": false @@ -15615,8 +15909,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 4192, - "total_submitted": 6361, + "total_acs": 4205, + "total_submitted": 6382, "total_column_articles": 72, "frontend_question_id": "2136", "is_new_question": false @@ -15636,9 +15930,9 @@ "question__title": "Count Words Obtained After Adding a Letter", "question__title_slug": "count-words-obtained-after-adding-a-letter", "question__hide": false, - "total_acs": 5152, - "total_submitted": 14477, - "total_column_articles": 103, + "total_acs": 5172, + "total_submitted": 14510, + "total_column_articles": 104, "frontend_question_id": "2135", "is_new_question": false }, @@ -15657,8 +15951,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": 7167, - "total_submitted": 14821, + "total_acs": 7208, + "total_submitted": 14879, "total_column_articles": 171, "frontend_question_id": "2134", "is_new_question": false @@ -15678,8 +15972,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": 9851, - "total_submitted": 17719, + "total_acs": 9890, + "total_submitted": 17792, "total_column_articles": 146, "frontend_question_id": "2133", "is_new_question": false @@ -15699,9 +15993,9 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 587, - "total_submitted": 1056, - "total_column_articles": 15, + "total_acs": 593, + "total_submitted": 1068, + "total_column_articles": 16, "frontend_question_id": "2118", "is_new_question": false }, @@ -15720,8 +16014,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 1058, - "total_submitted": 1539, + "total_acs": 1073, + "total_submitted": 1560, "total_column_articles": 19, "frontend_question_id": "2112", "is_new_question": false @@ -15741,8 +16035,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": 3451, - "total_submitted": 8515, + "total_acs": 3467, + "total_submitted": 8544, "total_column_articles": 82, "frontend_question_id": "2147", "is_new_question": false @@ -15762,8 +16056,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": 3874, - "total_submitted": 9709, + "total_acs": 3900, + "total_submitted": 9755, "total_column_articles": 91, "frontend_question_id": "2146", "is_new_question": false @@ -15783,8 +16077,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 5073, - "total_submitted": 14430, + "total_acs": 5087, + "total_submitted": 14465, "total_column_articles": 111, "frontend_question_id": "2145", "is_new_question": false @@ -15804,8 +16098,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": 9111, - "total_submitted": 13504, + "total_acs": 9155, + "total_submitted": 13560, "total_column_articles": 162, "frontend_question_id": "2144", "is_new_question": false @@ -15825,9 +16119,9 @@ "question__title": "Number of Unique Flavors After Sharing K Candies", "question__title_slug": "number-of-unique-flavors-after-sharing-k-candies", "question__hide": false, - "total_acs": 392, - "total_submitted": 1085, - "total_column_articles": 13, + "total_acs": 397, + "total_submitted": 1091, + "total_column_articles": 14, "frontend_question_id": "2107", "is_new_question": false }, @@ -15846,8 +16140,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": 3293, - "total_submitted": 9946, + "total_acs": 3305, + "total_submitted": 9965, "total_column_articles": 66, "frontend_question_id": "2127", "is_new_question": false @@ -15867,8 +16161,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 8205, - "total_submitted": 16753, + "total_acs": 8228, + "total_submitted": 16791, "total_column_articles": 106, "frontend_question_id": "2126", "is_new_question": false @@ -15888,9 +16182,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": 9248, - "total_submitted": 11087, - "total_column_articles": 122, + "total_acs": 9274, + "total_submitted": 11117, + "total_column_articles": 123, "frontend_question_id": "2125", "is_new_question": false }, @@ -15909,9 +16203,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": 11336, - "total_submitted": 16242, - "total_column_articles": 191, + "total_acs": 11415, + "total_submitted": 16360, + "total_column_articles": 194, "frontend_question_id": "2124", "is_new_question": false }, @@ -15930,8 +16224,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": 294, - "total_submitted": 790, + "total_acs": 295, + "total_submitted": 792, "total_column_articles": 11, "frontend_question_id": "2098", "is_new_question": false @@ -15951,8 +16245,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 3799, - "total_submitted": 9134, + "total_acs": 3807, + "total_submitted": 9154, "total_column_articles": 66, "frontend_question_id": "2122", "is_new_question": false @@ -15972,8 +16266,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 6231, - "total_submitted": 16354, + "total_acs": 6254, + "total_submitted": 16398, "total_column_articles": 156, "frontend_question_id": "2121", "is_new_question": false @@ -15993,9 +16287,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": 7477, - "total_submitted": 9073, - "total_column_articles": 113, + "total_acs": 7514, + "total_submitted": 9122, + "total_column_articles": 114, "frontend_question_id": "2120", "is_new_question": false }, @@ -16014,9 +16308,9 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 15442, - "total_submitted": 20743, - "total_column_articles": 171, + "total_acs": 15569, + "total_submitted": 20896, + "total_column_articles": 172, "frontend_question_id": "2119", "is_new_question": false }, @@ -16035,8 +16329,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": 8738, - "total_submitted": 20499, + "total_acs": 8785, + "total_submitted": 20591, "total_column_articles": 137, "frontend_question_id": "2131", "is_new_question": false @@ -16056,8 +16350,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": 8561, - "total_submitted": 10548, + "total_acs": 8615, + "total_submitted": 10612, "total_column_articles": 137, "frontend_question_id": "2130", "is_new_question": false @@ -16077,8 +16371,8 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 8010, - "total_submitted": 13087, + "total_acs": 8068, + "total_submitted": 13190, "total_column_articles": 144, "frontend_question_id": "2129", "is_new_question": false @@ -16098,8 +16392,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": 4377, - "total_submitted": 12715, + "total_acs": 4383, + "total_submitted": 12729, "total_column_articles": 97, "frontend_question_id": "2111", "is_new_question": false @@ -16119,8 +16413,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": 8993, - "total_submitted": 17112, + "total_acs": 9012, + "total_submitted": 17138, "total_column_articles": 154, "frontend_question_id": "2110", "is_new_question": false @@ -16140,8 +16434,8 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 9185, - "total_submitted": 14942, + "total_acs": 9225, + "total_submitted": 15004, "total_column_articles": 115, "frontend_question_id": "2109", "is_new_question": false @@ -16161,9 +16455,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": 12629, - "total_submitted": 16175, - "total_column_articles": 193, + "total_acs": 12685, + "total_submitted": 16236, + "total_column_articles": 194, "frontend_question_id": "2108", "is_new_question": false }, @@ -16182,8 +16476,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": 359, - "total_submitted": 603, + "total_acs": 362, + "total_submitted": 608, "total_column_articles": 20, "frontend_question_id": "2093", "is_new_question": false @@ -16203,9 +16497,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": 4798, - "total_submitted": 13948, - "total_column_articles": 97, + "total_acs": 4822, + "total_submitted": 14018, + "total_column_articles": 98, "frontend_question_id": "2106", "is_new_question": false }, @@ -16224,9 +16518,9 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 8280, - "total_submitted": 15499, - "total_column_articles": 134, + "total_acs": 8322, + "total_submitted": 15567, + "total_column_articles": 135, "frontend_question_id": "2105", "is_new_question": false }, @@ -16245,8 +16539,8 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 40308, - "total_submitted": 64161, + "total_acs": 40351, + "total_submitted": 64235, "total_column_articles": 392, "frontend_question_id": "2104", "is_new_question": false @@ -16266,8 +16560,8 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 10280, - "total_submitted": 12825, + "total_acs": 10316, + "total_submitted": 12870, "total_column_articles": 186, "frontend_question_id": "2103", "is_new_question": false @@ -16287,8 +16581,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": 422, - "total_submitted": 706, + "total_acs": 425, + "total_submitted": 710, "total_column_articles": 15, "frontend_question_id": "2083", "is_new_question": false @@ -16308,8 +16602,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": 1714, - "total_submitted": 2065, + "total_acs": 1727, + "total_submitted": 2083, "total_column_articles": 35, "frontend_question_id": "2084", "is_new_question": false @@ -16329,8 +16623,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 2155, - "total_submitted": 2880, + "total_acs": 2171, + "total_submitted": 2902, "total_column_articles": 25, "frontend_question_id": "2082", "is_new_question": false @@ -16350,8 +16644,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 1426, - "total_submitted": 4527, + "total_acs": 1431, + "total_submitted": 4538, "total_column_articles": 25, "frontend_question_id": "2117", "is_new_question": false @@ -16371,8 +16665,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": 3748, - "total_submitted": 11762, + "total_acs": 3761, + "total_submitted": 11785, "total_column_articles": 68, "frontend_question_id": "2116", "is_new_question": false @@ -16392,8 +16686,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": 5486, - "total_submitted": 13225, + "total_acs": 5526, + "total_submitted": 13297, "total_column_articles": 114, "frontend_question_id": "2115", "is_new_question": false @@ -16413,9 +16707,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": 16504, - "total_submitted": 19257, - "total_column_articles": 225, + "total_acs": 16624, + "total_submitted": 19388, + "total_column_articles": 227, "frontend_question_id": "2114", "is_new_question": false }, @@ -16434,8 +16728,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": 199, - "total_submitted": 308, + "total_acs": 200, + "total_submitted": 314, "total_column_articles": 9, "frontend_question_id": "2077", "is_new_question": false @@ -16455,9 +16749,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": 7047, - "total_submitted": 15964, - "total_column_articles": 197, + "total_acs": 7192, + "total_submitted": 16236, + "total_column_articles": 200, "frontend_question_id": "2096", "is_new_question": false }, @@ -16476,8 +16770,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": 13060, - "total_submitted": 22564, + "total_acs": 13134, + "total_submitted": 22675, "total_column_articles": 181, "frontend_question_id": "2095", "is_new_question": false @@ -16497,9 +16791,9 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 10572, - "total_submitted": 18918, - "total_column_articles": 169, + "total_acs": 10617, + "total_submitted": 19089, + "total_column_articles": 170, "frontend_question_id": "2094", "is_new_question": false }, @@ -16518,8 +16812,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 2033, - "total_submitted": 2951, + "total_acs": 2054, + "total_submitted": 2985, "total_column_articles": 30, "frontend_question_id": "2072", "is_new_question": false @@ -16539,8 +16833,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 5657, - "total_submitted": 19606, + "total_acs": 5671, + "total_submitted": 19635, "total_column_articles": 128, "frontend_question_id": "2092", "is_new_question": false @@ -16560,8 +16854,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 7799, - "total_submitted": 13704, + "total_acs": 7822, + "total_submitted": 13752, "total_column_articles": 143, "frontend_question_id": "2091", "is_new_question": false @@ -16581,8 +16875,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 7443, - "total_submitted": 20154, + "total_acs": 7480, + "total_submitted": 20214, "total_column_articles": 112, "frontend_question_id": "2090", "is_new_question": false @@ -16602,9 +16896,9 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 15936, - "total_submitted": 20057, - "total_column_articles": 216, + "total_acs": 16023, + "total_submitted": 20162, + "total_column_articles": 218, "frontend_question_id": "2089", "is_new_question": false }, @@ -16623,8 +16917,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 185, - "total_submitted": 352, + "total_acs": 186, + "total_submitted": 355, "total_column_articles": 11, "frontend_question_id": "2067", "is_new_question": false @@ -16644,8 +16938,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 1638, - "total_submitted": 2075, + "total_acs": 1660, + "total_submitted": 2102, "total_column_articles": 27, "frontend_question_id": "2066", "is_new_question": false @@ -16665,8 +16959,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 3084, - "total_submitted": 5602, + "total_acs": 3092, + "total_submitted": 5613, "total_column_articles": 85, "frontend_question_id": "2102", "is_new_question": false @@ -16686,8 +16980,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 5019, - "total_submitted": 12647, + "total_acs": 5049, + "total_submitted": 12703, "total_column_articles": 98, "frontend_question_id": "2101", "is_new_question": false @@ -16707,9 +17001,9 @@ "question__title": "Find Good Days to Rob the Bank", "question__title_slug": "find-good-days-to-rob-the-bank", "question__hide": false, - "total_acs": 33795, - "total_submitted": 69382, - "total_column_articles": 428, + "total_acs": 33821, + "total_submitted": 69436, + "total_column_articles": 429, "frontend_question_id": "2100", "is_new_question": false }, @@ -16728,9 +17022,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": 8277, - "total_submitted": 16968, - "total_column_articles": 169, + "total_acs": 8342, + "total_submitted": 17077, + "total_column_articles": 172, "frontend_question_id": "2099", "is_new_question": false }, @@ -16749,8 +17043,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 600, - "total_submitted": 1221, + "total_acs": 602, + "total_submitted": 1224, "total_column_articles": 25, "frontend_question_id": "2061", "is_new_question": false @@ -16770,9 +17064,9 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 3111, - "total_submitted": 7242, - "total_column_articles": 81, + "total_acs": 3131, + "total_submitted": 7266, + "total_column_articles": 82, "frontend_question_id": "2081", "is_new_question": false }, @@ -16791,8 +17085,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 2700, - "total_submitted": 7222, + "total_acs": 2715, + "total_submitted": 7259, "total_column_articles": 54, "frontend_question_id": "2097", "is_new_question": false @@ -16812,9 +17106,9 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 2314, - "total_submitted": 8209, - "total_column_articles": 57, + "total_acs": 2432, + "total_submitted": 8393, + "total_column_articles": 62, "frontend_question_id": "2132", "is_new_question": false }, @@ -16833,8 +17127,8 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 11581, - "total_submitted": 15932, + "total_acs": 11632, + "total_submitted": 15996, "total_column_articles": 189, "frontend_question_id": "2078", "is_new_question": false @@ -16854,9 +17148,9 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 3506, - "total_submitted": 6916, - "total_column_articles": 84, + "total_acs": 3518, + "total_submitted": 6945, + "total_column_articles": 85, "frontend_question_id": "2076", "is_new_question": false }, @@ -16875,8 +17169,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 4355, - "total_submitted": 9312, + "total_acs": 4378, + "total_submitted": 9344, "total_column_articles": 81, "frontend_question_id": "2075", "is_new_question": false @@ -16896,9 +17190,9 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 6025, - "total_submitted": 13437, - "total_column_articles": 148, + "total_acs": 6064, + "total_submitted": 13523, + "total_column_articles": 149, "frontend_question_id": "2074", "is_new_question": false }, @@ -16917,9 +17211,9 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 11905, - "total_submitted": 19224, - "total_column_articles": 191, + "total_acs": 11993, + "total_submitted": 19348, + "total_column_articles": 196, "frontend_question_id": "2073", "is_new_question": false }, @@ -16938,8 +17232,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": 1181, - "total_submitted": 1789, + "total_acs": 1196, + "total_submitted": 1821, "total_column_articles": 19, "frontend_question_id": "2051", "is_new_question": false @@ -16959,8 +17253,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 2304, - "total_submitted": 3598, + "total_acs": 2314, + "total_submitted": 3611, "total_column_articles": 52, "frontend_question_id": "2088", "is_new_question": false @@ -16980,8 +17274,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": 3706, - "total_submitted": 7457, + "total_acs": 3729, + "total_submitted": 7491, "total_column_articles": 82, "frontend_question_id": "2087", "is_new_question": false @@ -17001,9 +17295,9 @@ "question__title": "Minimum Number of Food Buckets to Feed the Hamsters", "question__title_slug": "minimum-number-of-food-buckets-to-feed-the-hamsters", "question__hide": false, - "total_acs": 5020, - "total_submitted": 10834, - "total_column_articles": 97, + "total_acs": 5054, + "total_submitted": 10906, + "total_column_articles": 98, "frontend_question_id": "2086", "is_new_question": false }, @@ -17022,9 +17316,9 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 7915, - "total_submitted": 10982, - "total_column_articles": 135, + "total_acs": 7971, + "total_submitted": 11046, + "total_column_articles": 136, "frontend_question_id": "2085", "is_new_question": false }, @@ -17043,8 +17337,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 2849, - "total_submitted": 5293, + "total_acs": 2868, + "total_submitted": 5319, "total_column_articles": 67, "frontend_question_id": "2065", "is_new_question": false @@ -17064,9 +17358,9 @@ "question__title": "Minimized Maximum of Products Distributed to Any Store", "question__title_slug": "minimized-maximum-of-products-distributed-to-any-store", "question__hide": false, - "total_acs": 5436, - "total_submitted": 12313, - "total_column_articles": 95, + "total_acs": 5461, + "total_submitted": 12357, + "total_column_articles": 96, "frontend_question_id": "2064", "is_new_question": false }, @@ -17085,9 +17379,9 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 6227, - "total_submitted": 12143, - "total_column_articles": 129, + "total_acs": 6252, + "total_submitted": 12181, + "total_column_articles": 130, "frontend_question_id": "2063", "is_new_question": false }, @@ -17106,9 +17400,9 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 8069, - "total_submitted": 12965, - "total_column_articles": 143, + "total_acs": 8168, + "total_submitted": 13103, + "total_column_articles": 146, "frontend_question_id": "2062", "is_new_question": false }, @@ -17127,8 +17421,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 1699, - "total_submitted": 2217, + "total_acs": 1715, + "total_submitted": 2236, "total_column_articles": 28, "frontend_question_id": "2041", "is_new_question": false @@ -17148,8 +17442,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": 1450, - "total_submitted": 3681, + "total_acs": 1488, + "total_submitted": 3731, "total_column_articles": 25, "frontend_question_id": "2060", "is_new_question": false @@ -17169,8 +17463,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 6462, - "total_submitted": 13727, + "total_acs": 6490, + "total_submitted": 13766, "total_column_articles": 116, "frontend_question_id": "2059", "is_new_question": false @@ -17190,9 +17484,9 @@ "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": 7441, - "total_submitted": 13190, - "total_column_articles": 114, + "total_acs": 7478, + "total_submitted": 13245, + "total_column_articles": 115, "frontend_question_id": "2058", "is_new_question": false }, @@ -17211,8 +17505,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 11231, - "total_submitted": 14808, + "total_acs": 11273, + "total_submitted": 14858, "total_column_articles": 112, "frontend_question_id": "2057", "is_new_question": false @@ -17232,8 +17526,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": 2277, - "total_submitted": 6796, + "total_acs": 2307, + "total_submitted": 6903, "total_column_articles": 46, "frontend_question_id": "2071", "is_new_question": false @@ -17253,9 +17547,9 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 3957, - "total_submitted": 8899, - "total_column_articles": 111, + "total_acs": 3981, + "total_submitted": 8929, + "total_column_articles": 112, "frontend_question_id": "2070", "is_new_question": false }, @@ -17274,8 +17568,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 4374, - "total_submitted": 20180, + "total_acs": 4396, + "total_submitted": 20250, "total_column_articles": 108, "frontend_question_id": "2069", "is_new_question": false @@ -17295,9 +17589,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": 8344, - "total_submitted": 11839, - "total_column_articles": 142, + "total_acs": 8444, + "total_submitted": 11996, + "total_column_articles": 144, "frontend_question_id": "2068", "is_new_question": false }, @@ -17316,8 +17610,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 3587, - "total_submitted": 6101, + "total_acs": 3599, + "total_submitted": 6117, "total_column_articles": 104, "frontend_question_id": "2050", "is_new_question": false @@ -17337,9 +17631,9 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 26965, - "total_submitted": 52174, - "total_column_articles": 311, + "total_acs": 27036, + "total_submitted": 52274, + "total_column_articles": 312, "frontend_question_id": "2049", "is_new_question": false }, @@ -17358,8 +17652,8 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 5666, - "total_submitted": 12703, + "total_acs": 5694, + "total_submitted": 12744, "total_column_articles": 116, "frontend_question_id": "2048", "is_new_question": false @@ -17379,9 +17673,9 @@ "question__title": "Number of Valid Words in a Sentence", "question__title_slug": "number-of-valid-words-in-a-sentence", "question__hide": false, - "total_acs": 27606, - "total_submitted": 71048, - "total_column_articles": 423, + "total_acs": 27693, + "total_submitted": 71270, + "total_column_articles": 424, "frontend_question_id": "2047", "is_new_question": false }, @@ -17400,8 +17694,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 3165, - "total_submitted": 3956, + "total_acs": 3183, + "total_submitted": 3975, "total_column_articles": 33, "frontend_question_id": "2026", "is_new_question": false @@ -17421,8 +17715,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 16536, - "total_submitted": 30981, + "total_acs": 16550, + "total_submitted": 31014, "total_column_articles": 165, "frontend_question_id": "2045", "is_new_question": false @@ -17442,8 +17736,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": 35477, - "total_submitted": 43365, + "total_acs": 35495, + "total_submitted": 43390, "total_column_articles": 398, "frontend_question_id": "2044", "is_new_question": false @@ -17463,8 +17757,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 35045, - "total_submitted": 52837, + "total_acs": 35064, + "total_submitted": 52889, "total_column_articles": 307, "frontend_question_id": "2043", "is_new_question": false @@ -17484,9 +17778,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": 35052, - "total_submitted": 48452, - "total_column_articles": 486, + "total_acs": 35254, + "total_submitted": 48766, + "total_column_articles": 492, "frontend_question_id": "2042", "is_new_question": false }, @@ -17505,8 +17799,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": 1579, - "total_submitted": 2229, + "total_acs": 1594, + "total_submitted": 2252, "total_column_articles": 29, "frontend_question_id": "2020", "is_new_question": false @@ -17526,8 +17820,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": 987, - "total_submitted": 1657, + "total_acs": 996, + "total_submitted": 1672, "total_column_articles": 22, "frontend_question_id": "2056", "is_new_question": false @@ -17547,8 +17841,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 33730, - "total_submitted": 77628, + "total_acs": 33751, + "total_submitted": 77679, "total_column_articles": 435, "frontend_question_id": "2055", "is_new_question": false @@ -17568,8 +17862,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 4163, - "total_submitted": 11063, + "total_acs": 4185, + "total_submitted": 11105, "total_column_articles": 81, "frontend_question_id": "2054", "is_new_question": false @@ -17589,9 +17883,9 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 8886, - "total_submitted": 12421, - "total_column_articles": 158, + "total_acs": 8951, + "total_submitted": 12516, + "total_column_articles": 161, "frontend_question_id": "2053", "is_new_question": false }, @@ -17610,8 +17904,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": 3536, - "total_submitted": 10446, + "total_acs": 3557, + "total_submitted": 10487, "total_column_articles": 68, "frontend_question_id": "2035", "is_new_question": false @@ -17631,8 +17925,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 23535, - "total_submitted": 51261, + "total_acs": 23575, + "total_submitted": 51329, "total_column_articles": 238, "frontend_question_id": "2034", "is_new_question": false @@ -17652,8 +17946,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": 6198, - "total_submitted": 14511, + "total_acs": 6213, + "total_submitted": 14532, "total_column_articles": 120, "frontend_question_id": "2033", "is_new_question": false @@ -17673,8 +17967,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 31138, - "total_submitted": 42550, + "total_acs": 31191, + "total_submitted": 42616, "total_column_articles": 406, "frontend_question_id": "2032", "is_new_question": false @@ -17694,8 +17988,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": 1541, - "total_submitted": 2484, + "total_acs": 1561, + "total_submitted": 2554, "total_column_articles": 42, "frontend_question_id": "2010", "is_new_question": false @@ -17715,8 +18009,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": 1990, - "total_submitted": 5566, + "total_acs": 1996, + "total_submitted": 5578, "total_column_articles": 52, "frontend_question_id": "2030", "is_new_question": false @@ -17736,8 +18030,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 19870, - "total_submitted": 42377, + "total_acs": 19895, + "total_submitted": 42415, "total_column_articles": 197, "frontend_question_id": "2029", "is_new_question": false @@ -17757,8 +18051,8 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 34378, - "total_submitted": 67812, + "total_acs": 34391, + "total_submitted": 67845, "total_column_articles": 398, "frontend_question_id": "2028", "is_new_question": false @@ -17778,8 +18072,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 26812, - "total_submitted": 39883, + "total_acs": 26888, + "total_submitted": 40002, "total_column_articles": 300, "frontend_question_id": "2027", "is_new_question": false @@ -17799,8 +18093,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 135, - "total_submitted": 282, + "total_acs": 136, + "total_submitted": 286, "total_column_articles": 8, "frontend_question_id": "2005", "is_new_question": false @@ -17820,8 +18114,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": 1115, - "total_submitted": 2629, + "total_acs": 1133, + "total_submitted": 2652, "total_column_articles": 29, "frontend_question_id": "2004", "is_new_question": false @@ -17841,9 +18135,9 @@ "question__title": "The Time When the Network Becomes Idle", "question__title_slug": "the-time-when-the-network-becomes-idle", "question__hide": false, - "total_acs": 20005, - "total_submitted": 35921, - "total_column_articles": 179, + "total_acs": 20012, + "total_submitted": 35935, + "total_column_articles": 180, "frontend_question_id": "2039", "is_new_question": false }, @@ -17862,8 +18156,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": 1818, - "total_submitted": 5365, + "total_acs": 1825, + "total_submitted": 5383, "total_column_articles": 33, "frontend_question_id": "2040", "is_new_question": false @@ -17883,8 +18177,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": 34437, - "total_submitted": 54256, + "total_acs": 34462, + "total_submitted": 54292, "total_column_articles": 450, "frontend_question_id": "2038", "is_new_question": false @@ -17904,8 +18198,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": 21364, - "total_submitted": 24839, + "total_acs": 21461, + "total_submitted": 24944, "total_column_articles": 244, "frontend_question_id": "2037", "is_new_question": false @@ -17925,8 +18219,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": 1714, - "total_submitted": 4597, + "total_acs": 1727, + "total_submitted": 4618, "total_column_articles": 43, "frontend_question_id": "2019", "is_new_question": false @@ -17946,8 +18240,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": 2975, - "total_submitted": 7086, + "total_acs": 2989, + "total_submitted": 7115, "total_column_articles": 65, "frontend_question_id": "2018", "is_new_question": false @@ -17967,8 +18261,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 5402, - "total_submitted": 14202, + "total_acs": 5422, + "total_submitted": 14243, "total_column_articles": 124, "frontend_question_id": "2017", "is_new_question": false @@ -17988,9 +18282,9 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 43666, - "total_submitted": 73045, - "total_column_articles": 500, + "total_acs": 43713, + "total_submitted": 73121, + "total_column_articles": 501, "frontend_question_id": "2016", "is_new_question": false }, @@ -18009,8 +18303,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 2117, - "total_submitted": 4482, + "total_acs": 2132, + "total_submitted": 4506, "total_column_articles": 26, "frontend_question_id": "1990", "is_new_question": false @@ -18051,8 +18345,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": 249, - "total_submitted": 564, + "total_acs": 250, + "total_submitted": 567, "total_column_articles": 14, "frontend_question_id": "1999", "is_new_question": false @@ -18072,8 +18366,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 2146, - "total_submitted": 3938, + "total_acs": 2159, + "total_submitted": 3975, "total_column_articles": 31, "frontend_question_id": "2014", "is_new_question": false @@ -18093,8 +18387,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 21302, - "total_submitted": 37643, + "total_acs": 21334, + "total_submitted": 37691, "total_column_articles": 243, "frontend_question_id": "2013", "is_new_question": false @@ -18114,8 +18408,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 5690, - "total_submitted": 14710, + "total_acs": 5708, + "total_submitted": 14737, "total_column_articles": 102, "frontend_question_id": "2012", "is_new_question": false @@ -18135,9 +18429,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": 38925, - "total_submitted": 43422, - "total_column_articles": 362, + "total_acs": 39176, + "total_submitted": 43702, + "total_column_articles": 363, "frontend_question_id": "2011", "is_new_question": false }, @@ -18156,8 +18450,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 3922, - "total_submitted": 6019, + "total_acs": 3959, + "total_submitted": 6069, "total_column_articles": 55, "frontend_question_id": "1988", "is_new_question": false @@ -18177,9 +18471,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": 2223, - "total_submitted": 7539, - "total_column_articles": 57, + "total_acs": 2241, + "total_submitted": 7570, + "total_column_articles": 58, "frontend_question_id": "2025", "is_new_question": false }, @@ -18198,9 +18492,9 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 37569, - "total_submitted": 65535, - "total_column_articles": 438, + "total_acs": 37616, + "total_submitted": 65602, + "total_column_articles": 439, "frontend_question_id": "2024", "is_new_question": false }, @@ -18219,9 +18513,9 @@ "question__title": "Number of Pairs of Strings With Concatenation Equal to Target", "question__title_slug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "question__hide": false, - "total_acs": 5839, - "total_submitted": 7871, - "total_column_articles": 97, + "total_acs": 5884, + "total_submitted": 7925, + "total_column_articles": 98, "frontend_question_id": "2023", "is_new_question": false }, @@ -18240,9 +18534,9 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 38853, - "total_submitted": 58878, - "total_column_articles": 472, + "total_acs": 38907, + "total_submitted": 58966, + "total_column_articles": 473, "frontend_question_id": "2022", "is_new_question": false }, @@ -18261,8 +18555,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": 2732, - "total_submitted": 6525, + "total_acs": 2745, + "total_submitted": 6541, "total_column_articles": 57, "frontend_question_id": "2003", "is_new_question": false @@ -18282,8 +18576,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": 5435, - "total_submitted": 9085, + "total_acs": 5459, + "total_submitted": 9114, "total_column_articles": 119, "frontend_question_id": "2002", "is_new_question": false @@ -18303,9 +18597,9 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 7852, - "total_submitted": 20506, - "total_column_articles": 160, + "total_acs": 7884, + "total_submitted": 20580, + "total_column_articles": 162, "frontend_question_id": "2001", "is_new_question": false }, @@ -18324,9 +18618,9 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 36176, - "total_submitted": 46444, - "total_column_articles": 461, + "total_acs": 36259, + "total_submitted": 46542, + "total_column_articles": 463, "frontend_question_id": "2000", "is_new_question": false }, @@ -18345,8 +18639,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 2496, - "total_submitted": 4804, + "total_acs": 2510, + "total_submitted": 4840, "total_column_articles": 26, "frontend_question_id": "1978", "is_new_question": false @@ -18366,8 +18660,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": 428, - "total_submitted": 715, + "total_acs": 435, + "total_submitted": 726, "total_column_articles": 20, "frontend_question_id": "1973", "is_new_question": false @@ -18387,9 +18681,9 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 2677, - "total_submitted": 5966, - "total_column_articles": 53, + "total_acs": 2693, + "total_submitted": 5997, + "total_column_articles": 54, "frontend_question_id": "1998", "is_new_question": false }, @@ -18408,8 +18702,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": 3270, - "total_submitted": 9341, + "total_acs": 3285, + "total_submitted": 9388, "total_column_articles": 53, "frontend_question_id": "1997", "is_new_question": false @@ -18429,9 +18723,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": 28713, - "total_submitted": 69308, - "total_column_articles": 301, + "total_acs": 28751, + "total_submitted": 69385, + "total_column_articles": 302, "frontend_question_id": "1996", "is_new_question": false }, @@ -18450,8 +18744,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 36356, - "total_submitted": 54889, + "total_acs": 36407, + "total_submitted": 54962, "total_column_articles": 281, "frontend_question_id": "1995", "is_new_question": false @@ -18471,9 +18765,9 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 25036, - "total_submitted": 45265, - "total_column_articles": 285, + "total_acs": 25158, + "total_submitted": 45492, + "total_column_articles": 286, "frontend_question_id": "1971", "is_new_question": false }, @@ -18492,8 +18786,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": 2194, - "total_submitted": 5050, + "total_acs": 2217, + "total_submitted": 5106, "total_column_articles": 40, "frontend_question_id": "1972", "is_new_question": false @@ -18513,9 +18807,9 @@ "question__title": "Minimum Number of Operations to Make Array Continuous", "question__title_slug": "minimum-number-of-operations-to-make-array-continuous", "question__hide": false, - "total_acs": 2728, - "total_submitted": 6393, - "total_column_articles": 70, + "total_acs": 2745, + "total_submitted": 6429, + "total_column_articles": 71, "frontend_question_id": "2009", "is_new_question": false }, @@ -18534,9 +18828,9 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 5518, - "total_submitted": 12017, - "total_column_articles": 94, + "total_acs": 5562, + "total_submitted": 12083, + "total_column_articles": 96, "frontend_question_id": "2008", "is_new_question": false }, @@ -18555,8 +18849,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 6058, - "total_submitted": 18155, + "total_acs": 6090, + "total_submitted": 18231, "total_column_articles": 122, "frontend_question_id": "2007", "is_new_question": false @@ -18576,8 +18870,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": 50740, - "total_submitted": 60125, + "total_acs": 50877, + "total_submitted": 60303, "total_column_articles": 513, "frontend_question_id": "2006", "is_new_question": false @@ -18597,8 +18891,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 2260, - "total_submitted": 4535, + "total_acs": 2270, + "total_submitted": 4547, "total_column_articles": 39, "frontend_question_id": "1987", "is_new_question": false @@ -18618,8 +18912,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": 5861, - "total_submitted": 18620, + "total_acs": 5901, + "total_submitted": 18698, "total_column_articles": 103, "frontend_question_id": "1986", "is_new_question": false @@ -18639,8 +18933,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": 10282, - "total_submitted": 24368, + "total_acs": 10314, + "total_submitted": 24486, "total_column_articles": 143, "frontend_question_id": "1985", "is_new_question": false @@ -18660,9 +18954,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": 44058, - "total_submitted": 70835, - "total_column_articles": 540, + "total_acs": 44196, + "total_submitted": 71061, + "total_column_articles": 542, "frontend_question_id": "1984", "is_new_question": false }, @@ -18681,8 +18975,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": 206, - "total_submitted": 326, + "total_acs": 210, + "total_submitted": 334, "total_column_articles": 10, "frontend_question_id": "1966", "is_new_question": false @@ -18702,9 +18996,9 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 35273, - "total_submitted": 49125, - "total_column_articles": 240, + "total_acs": 35812, + "total_submitted": 49872, + "total_column_articles": 244, "frontend_question_id": "1965", "is_new_question": false }, @@ -18723,8 +19017,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 1352, - "total_submitted": 2882, + "total_acs": 1361, + "total_submitted": 2894, "total_column_articles": 27, "frontend_question_id": "1982", "is_new_question": false @@ -18744,8 +19038,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": 6553, - "total_submitted": 20084, + "total_acs": 6585, + "total_submitted": 20152, "total_column_articles": 103, "frontend_question_id": "1981", "is_new_question": false @@ -18765,9 +19059,9 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 8157, - "total_submitted": 13624, - "total_column_articles": 140, + "total_acs": 8206, + "total_submitted": 13704, + "total_column_articles": 141, "frontend_question_id": "1980", "is_new_question": false }, @@ -18786,8 +19080,8 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 18612, - "total_submitted": 23972, + "total_acs": 18774, + "total_submitted": 24195, "total_column_articles": 250, "frontend_question_id": "1979", "is_new_question": false @@ -18807,8 +19101,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 15954, - "total_submitted": 28175, + "total_acs": 15972, + "total_submitted": 28220, "total_column_articles": 181, "frontend_question_id": "1994", "is_new_question": false @@ -18828,8 +19122,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 3060, - "total_submitted": 7697, + "total_acs": 3070, + "total_submitted": 7712, "total_column_articles": 67, "frontend_question_id": "1993", "is_new_question": false @@ -18849,8 +19143,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 5285, - "total_submitted": 8727, + "total_acs": 5313, + "total_submitted": 8768, "total_column_articles": 114, "frontend_question_id": "1992", "is_new_question": false @@ -18870,8 +19164,8 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 17650, - "total_submitted": 27481, + "total_acs": 17779, + "total_submitted": 27684, "total_column_articles": 265, "frontend_question_id": "1991", "is_new_question": false @@ -18891,8 +19185,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": 3306, - "total_submitted": 6629, + "total_acs": 3323, + "total_submitted": 6654, "total_column_articles": 69, "frontend_question_id": "1970", "is_new_question": false @@ -18912,8 +19206,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": 3672, - "total_submitted": 12490, + "total_acs": 3679, + "total_submitted": 12525, "total_column_articles": 56, "frontend_question_id": "1969", "is_new_question": false @@ -18933,9 +19227,9 @@ "question__title": "Number of Strings That Appear as Substrings in Word", "question__title_slug": "number-of-strings-that-appear-as-substrings-in-word", "question__hide": false, - "total_acs": 10833, - "total_submitted": 13666, - "total_column_articles": 147, + "total_acs": 10881, + "total_submitted": 13720, + "total_column_articles": 148, "frontend_question_id": "1967", "is_new_question": false }, @@ -18954,8 +19248,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": 3263, - "total_submitted": 4898, + "total_acs": 3299, + "total_submitted": 4970, "total_column_articles": 49, "frontend_question_id": "1951", "is_new_question": false @@ -18975,8 +19269,8 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 2950, - "total_submitted": 5464, + "total_acs": 2983, + "total_submitted": 5563, "total_column_articles": 44, "frontend_question_id": "1949", "is_new_question": false @@ -18996,9 +19290,9 @@ "question__title": "Find the Longest Valid Obstacle Course at Each Position", "question__title_slug": "find-the-longest-valid-obstacle-course-at-each-position", "question__hide": false, - "total_acs": 4219, - "total_submitted": 10183, - "total_column_articles": 63, + "total_acs": 4240, + "total_submitted": 10211, + "total_column_articles": 64, "frontend_question_id": "1964", "is_new_question": false }, @@ -19017,8 +19311,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": 6445, - "total_submitted": 10050, + "total_acs": 6473, + "total_submitted": 10081, "total_column_articles": 83, "frontend_question_id": "1963", "is_new_question": false @@ -19038,8 +19332,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 7860, - "total_submitted": 16935, + "total_acs": 7887, + "total_submitted": 16970, "total_column_articles": 103, "frontend_question_id": "1962", "is_new_question": false @@ -19059,9 +19353,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": 11668, - "total_submitted": 21982, - "total_column_articles": 142, + "total_acs": 11731, + "total_submitted": 22080, + "total_column_articles": 143, "frontend_question_id": "1961", "is_new_question": false }, @@ -19080,8 +19374,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 2355, - "total_submitted": 3951, + "total_acs": 2372, + "total_submitted": 3978, "total_column_articles": 24, "frontend_question_id": "1939", "is_new_question": false @@ -19101,9 +19395,9 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 1457, - "total_submitted": 4968, - "total_column_articles": 26, + "total_acs": 1468, + "total_submitted": 4997, + "total_column_articles": 27, "frontend_question_id": "1977", "is_new_question": false }, @@ -19122,8 +19416,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": 5245, - "total_submitted": 14667, + "total_acs": 5276, + "total_submitted": 14747, "total_column_articles": 97, "frontend_question_id": "1976", "is_new_question": false @@ -19143,9 +19437,9 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 4727, - "total_submitted": 11529, - "total_column_articles": 69, + "total_acs": 4751, + "total_submitted": 11579, + "total_column_articles": 71, "frontend_question_id": "1975", "is_new_question": false }, @@ -19164,8 +19458,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": 8490, - "total_submitted": 11843, + "total_acs": 8530, + "total_submitted": 11899, "total_column_articles": 130, "frontend_question_id": "1974", "is_new_question": false @@ -19185,8 +19479,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 1719, - "total_submitted": 2353, + "total_acs": 1735, + "total_submitted": 2369, "total_column_articles": 30, "frontend_question_id": "1934", "is_new_question": false @@ -19206,8 +19500,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 3583, - "total_submitted": 6869, + "total_acs": 3603, + "total_submitted": 6904, "total_column_articles": 58, "frontend_question_id": "1955", "is_new_question": false @@ -19227,8 +19521,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": 6157, - "total_submitted": 15901, + "total_acs": 6175, + "total_submitted": 15933, "total_column_articles": 94, "frontend_question_id": "1968", "is_new_question": false @@ -19248,8 +19542,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": 6084, - "total_submitted": 16728, + "total_acs": 6105, + "total_submitted": 16758, "total_column_articles": 107, "frontend_question_id": "1953", "is_new_question": false @@ -19269,9 +19563,9 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 12879, - "total_submitted": 23513, - "total_column_articles": 155, + "total_acs": 12941, + "total_submitted": 23621, + "total_column_articles": 157, "frontend_question_id": "1952", "is_new_question": false }, @@ -19290,8 +19584,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": 260, - "total_submitted": 552, + "total_acs": 265, + "total_submitted": 562, "total_column_articles": 19, "frontend_question_id": "2052", "is_new_question": false @@ -19311,8 +19605,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": 2277, - "total_submitted": 5053, + "total_acs": 2292, + "total_submitted": 5074, "total_column_articles": 51, "frontend_question_id": "1959", "is_new_question": false @@ -19332,8 +19626,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 3313, - "total_submitted": 7517, + "total_acs": 3327, + "total_submitted": 7539, "total_column_articles": 59, "frontend_question_id": "1958", "is_new_question": false @@ -19353,8 +19647,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 1534, - "total_submitted": 2857, + "total_acs": 1541, + "total_submitted": 2866, "total_column_articles": 27, "frontend_question_id": "1948", "is_new_question": false @@ -19374,9 +19668,9 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 5926, - "total_submitted": 10296, - "total_column_articles": 116, + "total_acs": 6015, + "total_submitted": 10440, + "total_column_articles": 117, "frontend_question_id": "1947", "is_new_question": false }, @@ -19395,8 +19689,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 7002, - "total_submitted": 21954, + "total_acs": 7038, + "total_submitted": 22016, "total_column_articles": 101, "frontend_question_id": "1946", "is_new_question": false @@ -19416,8 +19710,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": 30251, - "total_submitted": 42775, + "total_acs": 30285, + "total_submitted": 42824, "total_column_articles": 372, "frontend_question_id": "1945", "is_new_question": false @@ -19438,7 +19732,7 @@ "question__title_slug": "brightest-position-on-street", "question__hide": false, "total_acs": 550, - "total_submitted": 874, + "total_submitted": 875, "total_column_articles": 20, "frontend_question_id": "2021", "is_new_question": false @@ -19479,8 +19773,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": 274, - "total_submitted": 734, + "total_acs": 277, + "total_submitted": 742, "total_column_articles": 14, "frontend_question_id": "1956", "is_new_question": false @@ -19501,7 +19795,7 @@ "question__title_slug": "maximum-of-minimum-values-in-all-subarrays", "question__hide": false, "total_acs": 393, - "total_submitted": 758, + "total_submitted": 759, "total_column_articles": 15, "frontend_question_id": "1950", "is_new_question": false @@ -19521,8 +19815,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 783, - "total_submitted": 1058, + "total_acs": 789, + "total_submitted": 1067, "total_column_articles": 38, "frontend_question_id": "1940", "is_new_question": false @@ -19542,8 +19836,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": 976, - "total_submitted": 1969, + "total_acs": 980, + "total_submitted": 1977, "total_column_articles": 40, "frontend_question_id": "1933", "is_new_question": false @@ -19563,8 +19857,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 666, - "total_submitted": 1402, + "total_acs": 677, + "total_submitted": 1416, "total_column_articles": 10, "frontend_question_id": "1918", "is_new_question": false @@ -19584,8 +19878,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 1630, - "total_submitted": 4236, + "total_acs": 1649, + "total_submitted": 4259, "total_column_articles": 49, "frontend_question_id": "1938", "is_new_question": false @@ -19605,8 +19899,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 4750, - "total_submitted": 16860, + "total_acs": 4771, + "total_submitted": 16899, "total_column_articles": 82, "frontend_question_id": "1937", "is_new_question": false @@ -19626,9 +19920,9 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 7918, - "total_submitted": 17236, - "total_column_articles": 105, + "total_acs": 7963, + "total_submitted": 17312, + "total_column_articles": 109, "frontend_question_id": "1936", "is_new_question": false }, @@ -19647,8 +19941,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 141, - "total_submitted": 328, + "total_acs": 143, + "total_submitted": 331, "total_column_articles": 4, "frontend_question_id": "2307", "is_new_question": false @@ -19668,8 +19962,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 1639, - "total_submitted": 3785, + "total_acs": 1655, + "total_submitted": 3817, "total_column_articles": 37, "frontend_question_id": "1919", "is_new_question": false @@ -19689,9 +19983,9 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 1760, - "total_submitted": 5530, - "total_column_articles": 24, + "total_acs": 1773, + "total_submitted": 5565, + "total_column_articles": 25, "frontend_question_id": "1917", "is_new_question": false }, @@ -19710,8 +20004,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 513, - "total_submitted": 830, + "total_acs": 517, + "total_submitted": 835, "total_column_articles": 18, "frontend_question_id": "1908", "is_new_question": false @@ -19731,8 +20025,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": 2928, - "total_submitted": 4983, + "total_acs": 2942, + "total_submitted": 5004, "total_column_articles": 85, "frontend_question_id": "1931", "is_new_question": false @@ -19752,8 +20046,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 1868, - "total_submitted": 5616, + "total_acs": 1876, + "total_submitted": 5639, "total_column_articles": 51, "frontend_question_id": "1932", "is_new_question": false @@ -19773,9 +20067,9 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 7937, - "total_submitted": 15717, - "total_column_articles": 149, + "total_acs": 7970, + "total_submitted": 15769, + "total_column_articles": 150, "frontend_question_id": "1930", "is_new_question": false }, @@ -19794,9 +20088,9 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 33847, - "total_submitted": 39134, - "total_column_articles": 311, + "total_acs": 33983, + "total_submitted": 39281, + "total_column_articles": 313, "frontend_question_id": "1929", "is_new_question": false }, @@ -19815,8 +20109,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 2214, - "total_submitted": 3576, + "total_acs": 2227, + "total_submitted": 3592, "total_column_articles": 38, "frontend_question_id": "1907", "is_new_question": false @@ -19836,8 +20130,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 151, - "total_submitted": 239, + "total_acs": 152, + "total_submitted": 241, "total_column_articles": 11, "frontend_question_id": "2297", "is_new_question": false @@ -19857,8 +20151,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 2906, - "total_submitted": 6664, + "total_acs": 2919, + "total_submitted": 6701, "total_column_articles": 74, "frontend_question_id": "1943", "is_new_question": false @@ -19878,8 +20172,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": 4653, - "total_submitted": 11250, + "total_acs": 4694, + "total_submitted": 11345, "total_column_articles": 101, "frontend_question_id": "1942", "is_new_question": false @@ -19899,8 +20193,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": 11294, - "total_submitted": 15323, + "total_acs": 11361, + "total_submitted": 15420, "total_column_articles": 172, "frontend_question_id": "1941", "is_new_question": false @@ -19921,7 +20215,7 @@ "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, "total_acs": 380, - "total_submitted": 762, + "total_submitted": 763, "total_column_articles": 13, "frontend_question_id": "1902", "is_new_question": false @@ -19941,9 +20235,9 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 2421, - "total_submitted": 9196, - "total_column_articles": 45, + "total_acs": 2431, + "total_submitted": 9226, + "total_column_articles": 46, "frontend_question_id": "1923", "is_new_question": false }, @@ -19962,8 +20256,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 6469, - "total_submitted": 18034, + "total_acs": 6482, + "total_submitted": 18062, "total_column_articles": 96, "frontend_question_id": "1922", "is_new_question": false @@ -19983,9 +20277,9 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 7710, - "total_submitted": 21105, - "total_column_articles": 120, + "total_acs": 7728, + "total_submitted": 21134, + "total_column_articles": 122, "frontend_question_id": "1921", "is_new_question": false }, @@ -20004,9 +20298,9 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 30226, - "total_submitted": 34605, - "total_column_articles": 288, + "total_acs": 30367, + "total_submitted": 34769, + "total_column_articles": 289, "frontend_question_id": "1920", "is_new_question": false }, @@ -20025,8 +20319,8 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 6389, - "total_submitted": 10823, + "total_acs": 6436, + "total_submitted": 10901, "total_column_articles": 120, "frontend_question_id": "1901", "is_new_question": false @@ -20046,8 +20340,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 1845, - "total_submitted": 5020, + "total_acs": 1853, + "total_submitted": 5037, "total_column_articles": 31, "frontend_question_id": "1892", "is_new_question": false @@ -20067,8 +20361,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 4143, - "total_submitted": 9891, + "total_acs": 4153, + "total_submitted": 9914, "total_column_articles": 47, "frontend_question_id": "1891", "is_new_question": false @@ -20088,9 +20382,9 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 4259, - "total_submitted": 9821, - "total_column_articles": 80, + "total_acs": 4283, + "total_submitted": 9849, + "total_column_articles": 81, "frontend_question_id": "1915", "is_new_question": false }, @@ -20109,9 +20403,9 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 4068, - "total_submitted": 8808, - "total_column_articles": 96, + "total_acs": 4081, + "total_submitted": 8826, + "total_column_articles": 97, "frontend_question_id": "1914", "is_new_question": false }, @@ -20130,9 +20424,9 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 17370, - "total_submitted": 21296, - "total_column_articles": 210, + "total_acs": 17447, + "total_submitted": 21409, + "total_column_articles": 211, "frontend_question_id": "1913", "is_new_question": false }, @@ -20151,9 +20445,9 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 22025, - "total_submitted": 31262, - "total_column_articles": 160, + "total_acs": 22353, + "total_submitted": 31732, + "total_column_articles": 164, "frontend_question_id": "1890", "is_new_question": false }, @@ -20172,8 +20466,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": 4879, - "total_submitted": 10754, + "total_acs": 4914, + "total_submitted": 10812, "total_column_articles": 74, "frontend_question_id": "1928", "is_new_question": false @@ -20193,9 +20487,9 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 2780, - "total_submitted": 6458, - "total_column_articles": 64, + "total_acs": 2790, + "total_submitted": 6473, + "total_column_articles": 65, "frontend_question_id": "1927", "is_new_question": false }, @@ -20214,8 +20508,8 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 9845, - "total_submitted": 24649, + "total_acs": 9894, + "total_submitted": 24759, "total_column_articles": 155, "frontend_question_id": "1926", "is_new_question": false @@ -20235,8 +20529,8 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 10645, - "total_submitted": 15259, + "total_acs": 10731, + "total_submitted": 15378, "total_column_articles": 137, "frontend_question_id": "1925", "is_new_question": false @@ -20256,8 +20550,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 1116, - "total_submitted": 1920, + "total_acs": 1118, + "total_submitted": 1924, "total_column_articles": 29, "frontend_question_id": "1885", "is_new_question": false @@ -20277,9 +20571,9 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 21952, - "total_submitted": 32727, - "total_column_articles": 374, + "total_acs": 22084, + "total_submitted": 32937, + "total_column_articles": 376, "frontend_question_id": "1905", "is_new_question": false }, @@ -20298,8 +20592,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 3632, - "total_submitted": 8221, + "total_acs": 3652, + "total_submitted": 8250, "total_column_articles": 71, "frontend_question_id": "1906", "is_new_question": false @@ -20319,9 +20613,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": 5327, - "total_submitted": 17264, - "total_column_articles": 102, + "total_acs": 5362, + "total_submitted": 17325, + "total_column_articles": 103, "frontend_question_id": "1904", "is_new_question": false }, @@ -20340,8 +20634,8 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 14769, - "total_submitted": 24200, + "total_acs": 14851, + "total_submitted": 24340, "total_column_articles": 189, "frontend_question_id": "1903", "is_new_question": false @@ -20361,9 +20655,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": 6883, - "total_submitted": 9864, - "total_column_articles": 96, + "total_acs": 6924, + "total_submitted": 9920, + "total_column_articles": 97, "frontend_question_id": "1884", "is_new_question": false }, @@ -20382,8 +20676,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 1967, - "total_submitted": 3049, + "total_acs": 1981, + "total_submitted": 3069, "total_column_articles": 42, "frontend_question_id": "1875", "is_new_question": false @@ -20403,8 +20697,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 965, - "total_submitted": 1121, + "total_acs": 969, + "total_submitted": 1127, "total_column_articles": 36, "frontend_question_id": "1874", "is_new_question": false @@ -20424,8 +20718,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": 1711, - "total_submitted": 3773, + "total_acs": 1721, + "total_submitted": 3791, "total_column_articles": 45, "frontend_question_id": "1900", "is_new_question": false @@ -20445,8 +20739,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 7764, - "total_submitted": 21067, + "total_acs": 7827, + "total_submitted": 21173, "total_column_articles": 114, "frontend_question_id": "1898", "is_new_question": false @@ -20466,8 +20760,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 5125, - "total_submitted": 7903, + "total_acs": 5141, + "total_submitted": 7920, "total_column_articles": 69, "frontend_question_id": "1899", "is_new_question": false @@ -20487,8 +20781,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": 9998, - "total_submitted": 18059, + "total_acs": 10042, + "total_submitted": 18142, "total_column_articles": 137, "frontend_question_id": "1897", "is_new_question": false @@ -20508,9 +20802,9 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 62572, - "total_submitted": 97928, - "total_column_articles": 313, + "total_acs": 63440, + "total_submitted": 99301, + "total_column_articles": 320, "frontend_question_id": "1873", "is_new_question": false }, @@ -20529,8 +20823,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 3948, - "total_submitted": 16768, + "total_acs": 3970, + "total_submitted": 16810, "total_column_articles": 78, "frontend_question_id": "1912", "is_new_question": false @@ -20550,9 +20844,9 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 5828, - "total_submitted": 9996, - "total_column_articles": 109, + "total_acs": 5858, + "total_submitted": 10035, + "total_column_articles": 111, "frontend_question_id": "1911", "is_new_question": false }, @@ -20571,8 +20865,8 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 6023, - "total_submitted": 9094, + "total_acs": 6064, + "total_submitted": 9147, "total_column_articles": 117, "frontend_question_id": "1910", "is_new_question": false @@ -20592,8 +20886,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": 9246, - "total_submitted": 30511, + "total_acs": 9322, + "total_submitted": 30703, "total_column_articles": 157, "frontend_question_id": "1909", "is_new_question": false @@ -20613,9 +20907,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": 2102, - "total_submitted": 4384, - "total_column_articles": 49, + "total_acs": 2118, + "total_submitted": 4411, + "total_column_articles": 50, "frontend_question_id": "1868", "is_new_question": false }, @@ -20634,8 +20928,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 3468, - "total_submitted": 11936, + "total_acs": 3478, + "total_submitted": 11955, "total_column_articles": 65, "frontend_question_id": "1889", "is_new_question": false @@ -20655,8 +20949,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": 3924, - "total_submitted": 11008, + "total_acs": 3943, + "total_submitted": 11037, "total_column_articles": 89, "frontend_question_id": "1888", "is_new_question": false @@ -20676,8 +20970,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": 7481, - "total_submitted": 11393, + "total_acs": 7511, + "total_submitted": 11433, "total_column_articles": 108, "frontend_question_id": "1887", "is_new_question": false @@ -20697,9 +20991,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": 9989, - "total_submitted": 16864, - "total_column_articles": 162, + "total_acs": 10070, + "total_submitted": 16977, + "total_column_articles": 164, "frontend_question_id": "1886", "is_new_question": false }, @@ -20718,8 +21012,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 4064, - "total_submitted": 5817, + "total_acs": 4096, + "total_submitted": 5877, "total_column_articles": 48, "frontend_question_id": "1867", "is_new_question": false @@ -20739,8 +21033,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": 2326, - "total_submitted": 5803, + "total_acs": 2329, + "total_submitted": 5811, "total_column_articles": 38, "frontend_question_id": "1883", "is_new_question": false @@ -20760,8 +21054,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 5248, - "total_submitted": 17351, + "total_acs": 5277, + "total_submitted": 17396, "total_column_articles": 145, "frontend_question_id": "1882", "is_new_question": false @@ -20781,8 +21075,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 8407, - "total_submitted": 22484, + "total_acs": 8437, + "total_submitted": 22544, "total_column_articles": 92, "frontend_question_id": "1881", "is_new_question": false @@ -20802,8 +21096,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": 11781, - "total_submitted": 15412, + "total_acs": 11825, + "total_submitted": 15470, "total_column_articles": 195, "frontend_question_id": "1880", "is_new_question": false @@ -20823,8 +21117,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 1001, - "total_submitted": 1529, + "total_acs": 1010, + "total_submitted": 1543, "total_column_articles": 38, "frontend_question_id": "1858", "is_new_question": false @@ -20844,8 +21138,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": 1232, - "total_submitted": 2322, + "total_acs": 1237, + "total_submitted": 2327, "total_column_articles": 37, "frontend_question_id": "1896", "is_new_question": false @@ -20865,9 +21159,9 @@ "question__title": "Maximum Cost of Trip With K Highways", "question__title_slug": "maximum-cost-of-trip-with-k-highways", "question__hide": false, - "total_acs": 192, - "total_submitted": 320, - "total_column_articles": 11, + "total_acs": 207, + "total_submitted": 342, + "total_column_articles": 12, "frontend_question_id": "2247", "is_new_question": false }, @@ -20886,9 +21180,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": 46675, - "total_submitted": 101763, - "total_column_articles": 608, + "total_acs": 46777, + "total_submitted": 101955, + "total_column_articles": 610, "frontend_question_id": "1894", "is_new_question": false }, @@ -20907,9 +21201,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": 38076, - "total_submitted": 64529, - "total_column_articles": 516, + "total_acs": 38189, + "total_submitted": 64713, + "total_column_articles": 517, "frontend_question_id": "1893", "is_new_question": false }, @@ -20928,8 +21222,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 2988, - "total_submitted": 4752, + "total_acs": 3006, + "total_submitted": 4776, "total_column_articles": 30, "frontend_question_id": "1853", "is_new_question": false @@ -20949,8 +21243,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 765, - "total_submitted": 1309, + "total_acs": 775, + "total_submitted": 1321, "total_column_articles": 21, "frontend_question_id": "1852", "is_new_question": false @@ -20970,8 +21264,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 3139, - "total_submitted": 5041, + "total_acs": 3149, + "total_submitted": 5082, "total_column_articles": 44, "frontend_question_id": "1872", "is_new_question": false @@ -20991,8 +21285,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 8611, - "total_submitted": 30421, + "total_acs": 8643, + "total_submitted": 30485, "total_column_articles": 173, "frontend_question_id": "1871", "is_new_question": false @@ -21012,9 +21306,9 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 12027, - "total_submitted": 28298, - "total_column_articles": 125, + "total_acs": 12098, + "total_submitted": 28450, + "total_column_articles": 130, "frontend_question_id": "1870", "is_new_question": false }, @@ -21033,8 +21327,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": 17294, - "total_submitted": 23985, + "total_acs": 17349, + "total_submitted": 24101, "total_column_articles": 241, "frontend_question_id": "1869", "is_new_question": false @@ -21054,8 +21348,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 2346, - "total_submitted": 5175, + "total_acs": 2363, + "total_submitted": 5212, "total_column_articles": 42, "frontend_question_id": "1843", "is_new_question": false @@ -21075,8 +21369,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 328, - "total_submitted": 593, + "total_acs": 329, + "total_submitted": 600, "total_column_articles": 18, "frontend_question_id": "1842", "is_new_question": false @@ -21096,9 +21390,9 @@ "question__title": "Number of Ways to Rearrange Sticks With K Sticks Visible", "question__title_slug": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible", "question__hide": false, - "total_acs": 3453, - "total_submitted": 5572, - "total_column_articles": 70, + "total_acs": 3464, + "total_submitted": 5591, + "total_column_articles": 71, "frontend_question_id": "1866", "is_new_question": false }, @@ -21117,8 +21411,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 6929, - "total_submitted": 13622, + "total_acs": 6949, + "total_submitted": 13650, "total_column_articles": 85, "frontend_question_id": "1865", "is_new_question": false @@ -21138,8 +21432,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": 6549, - "total_submitted": 16160, + "total_acs": 6566, + "total_submitted": 16195, "total_column_articles": 146, "frontend_question_id": "1864", "is_new_question": false @@ -21159,9 +21453,9 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 20272, - "total_submitted": 23934, - "total_column_articles": 255, + "total_acs": 20342, + "total_submitted": 24026, + "total_column_articles": 256, "frontend_question_id": "1863", "is_new_question": false }, @@ -21180,8 +21474,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": 678, - "total_submitted": 1071, + "total_acs": 690, + "total_submitted": 1085, "total_column_articles": 31, "frontend_question_id": "2046", "is_new_question": false @@ -21201,8 +21495,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 2494, - "total_submitted": 4693, + "total_acs": 2507, + "total_submitted": 4715, "total_column_articles": 62, "frontend_question_id": "1841", "is_new_question": false @@ -21222,8 +21516,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": 2898, - "total_submitted": 6451, + "total_acs": 2921, + "total_submitted": 6495, "total_column_articles": 72, "frontend_question_id": "1878", "is_new_question": false @@ -21243,9 +21537,9 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 3336, - "total_submitted": 6997, - "total_column_articles": 60, + "total_acs": 3349, + "total_submitted": 7015, + "total_column_articles": 61, "frontend_question_id": "1879", "is_new_question": false }, @@ -21264,8 +21558,8 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 36602, - "total_submitted": 45055, + "total_acs": 36641, + "total_submitted": 45101, "total_column_articles": 470, "frontend_question_id": "1877", "is_new_question": false @@ -21285,9 +21579,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": 14253, - "total_submitted": 20105, - "total_column_articles": 235, + "total_acs": 14364, + "total_submitted": 20261, + "total_column_articles": 236, "frontend_question_id": "1876", "is_new_question": false }, @@ -21306,9 +21600,9 @@ "question__title": "Largest Color Value in a Directed Graph", "question__title_slug": "largest-color-value-in-a-directed-graph", "question__hide": false, - "total_acs": 3556, - "total_submitted": 7409, - "total_column_articles": 58, + "total_acs": 3598, + "total_submitted": 7479, + "total_column_articles": 59, "frontend_question_id": "1857", "is_new_question": false }, @@ -21327,9 +21621,9 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 8423, - "total_submitted": 22794, - "total_column_articles": 136, + "total_acs": 8465, + "total_submitted": 22908, + "total_column_articles": 138, "frontend_question_id": "1856", "is_new_question": false }, @@ -21348,8 +21642,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": 19717, - "total_submitted": 32731, + "total_acs": 19826, + "total_submitted": 32924, "total_column_articles": 224, "frontend_question_id": "1855", "is_new_question": false @@ -21369,9 +21663,9 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 16635, - "total_submitted": 22790, - "total_column_articles": 206, + "total_acs": 16689, + "total_submitted": 22874, + "total_column_articles": 209, "frontend_question_id": "1854", "is_new_question": false }, @@ -21390,8 +21684,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": 1766, - "total_submitted": 2427, + "total_acs": 1782, + "total_submitted": 2447, "total_column_articles": 60, "frontend_question_id": "1836", "is_new_question": false @@ -21411,9 +21705,9 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 3848, - "total_submitted": 4943, - "total_column_articles": 58, + "total_acs": 3887, + "total_submitted": 4990, + "total_column_articles": 59, "frontend_question_id": "1831", "is_new_question": false }, @@ -21432,8 +21726,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 726, - "total_submitted": 1769, + "total_acs": 734, + "total_submitted": 1779, "total_column_articles": 38, "frontend_question_id": "1826", "is_new_question": false @@ -21453,8 +21747,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": 241, - "total_submitted": 435, + "total_acs": 243, + "total_submitted": 438, "total_column_articles": 12, "frontend_question_id": "1989", "is_new_question": false @@ -21474,8 +21768,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": 3301, - "total_submitted": 5310, + "total_acs": 3315, + "total_submitted": 5334, "total_column_articles": 66, "frontend_question_id": "1850", "is_new_question": false @@ -21495,9 +21789,9 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 3131, - "total_submitted": 7267, - "total_column_articles": 72, + "total_acs": 3160, + "total_submitted": 7315, + "total_column_articles": 73, "frontend_question_id": "1851", "is_new_question": false }, @@ -21516,9 +21810,9 @@ "question__title": "Splitting a String Into Descending Consecutive Values", "question__title_slug": "splitting-a-string-into-descending-consecutive-values", "question__hide": false, - "total_acs": 7132, - "total_submitted": 21648, - "total_column_articles": 134, + "total_acs": 7151, + "total_submitted": 21688, + "total_column_articles": 135, "frontend_question_id": "1849", "is_new_question": false }, @@ -21537,9 +21831,9 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 12591, - "total_submitted": 18879, - "total_column_articles": 170, + "total_acs": 12636, + "total_submitted": 18944, + "total_column_articles": 171, "frontend_question_id": "1848", "is_new_question": false }, @@ -21558,8 +21852,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": 5161, - "total_submitted": 5738, + "total_acs": 5189, + "total_submitted": 5769, "total_column_articles": 37, "frontend_question_id": "1821", "is_new_question": false @@ -21579,8 +21873,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 5357, - "total_submitted": 8494, + "total_acs": 5368, + "total_submitted": 8510, "total_column_articles": 107, "frontend_question_id": "1861", "is_new_question": false @@ -21600,8 +21894,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 6149, - "total_submitted": 8085, + "total_acs": 6169, + "total_submitted": 8109, "total_column_articles": 118, "frontend_question_id": "1860", "is_new_question": false @@ -21621,9 +21915,9 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 13776, - "total_submitted": 18766, - "total_column_articles": 302, + "total_acs": 13907, + "total_submitted": 18959, + "total_column_articles": 303, "frontend_question_id": "1859", "is_new_question": false }, @@ -21642,8 +21936,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 349, - "total_submitted": 744, + "total_acs": 352, + "total_submitted": 750, "total_column_articles": 17, "frontend_question_id": "1820", "is_new_question": false @@ -21663,8 +21957,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 2685, - "total_submitted": 6781, + "total_acs": 2697, + "total_submitted": 6809, "total_column_articles": 62, "frontend_question_id": "1840", "is_new_question": false @@ -21684,9 +21978,9 @@ "question__title": "Longest Substring Of All Vowels in Order", "question__title_slug": "longest-substring-of-all-vowels-in-order", "question__hide": false, - "total_acs": 10598, - "total_submitted": 20712, - "total_column_articles": 182, + "total_acs": 10635, + "total_submitted": 20797, + "total_column_articles": 183, "frontend_question_id": "1839", "is_new_question": false }, @@ -21705,8 +21999,8 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 35587, - "total_submitted": 82752, + "total_acs": 35660, + "total_submitted": 82904, "total_column_articles": 374, "frontend_question_id": "1838", "is_new_question": false @@ -21726,8 +22020,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 13743, - "total_submitted": 17302, + "total_acs": 13834, + "total_submitted": 17403, "total_column_articles": 158, "frontend_question_id": "1837", "is_new_question": false @@ -21747,8 +22041,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 2814, - "total_submitted": 4386, + "total_acs": 2837, + "total_submitted": 4421, "total_column_articles": 50, "frontend_question_id": "1811", "is_new_question": false @@ -21768,8 +22062,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": 4741, - "total_submitted": 8659, + "total_acs": 4759, + "total_submitted": 8682, "total_column_articles": 73, "frontend_question_id": "1835", "is_new_question": false @@ -21789,8 +22083,8 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 9396, - "total_submitted": 25246, + "total_acs": 9439, + "total_submitted": 25364, "total_column_articles": 166, "frontend_question_id": "1834", "is_new_question": false @@ -21810,9 +22104,9 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 48161, - "total_submitted": 70807, - "total_column_articles": 456, + "total_acs": 48228, + "total_submitted": 70911, + "total_column_articles": 457, "frontend_question_id": "1833", "is_new_question": false }, @@ -21831,9 +22125,9 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 48173, - "total_submitted": 56366, - "total_column_articles": 583, + "total_acs": 48325, + "total_submitted": 56537, + "total_column_articles": 586, "frontend_question_id": "1832", "is_new_question": false }, @@ -21852,8 +22146,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": 361, - "total_submitted": 576, + "total_acs": 363, + "total_submitted": 579, "total_column_articles": 10, "frontend_question_id": "1810", "is_new_question": false @@ -21873,8 +22167,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 4123, - "total_submitted": 6728, + "total_acs": 4146, + "total_submitted": 6783, "total_column_articles": 49, "frontend_question_id": "1809", "is_new_question": false @@ -21894,8 +22188,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 3642, - "total_submitted": 9214, + "total_acs": 3655, + "total_submitted": 9236, "total_column_articles": 68, "frontend_question_id": "1847", "is_new_question": false @@ -21915,9 +22209,9 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 30219, - "total_submitted": 47894, - "total_column_articles": 408, + "total_acs": 30251, + "total_submitted": 47939, + "total_column_articles": 409, "frontend_question_id": "1846", "is_new_question": false }, @@ -21936,9 +22230,9 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 14163, - "total_submitted": 29610, - "total_column_articles": 150, + "total_acs": 14219, + "total_submitted": 29724, + "total_column_articles": 152, "frontend_question_id": "1845", "is_new_question": false }, @@ -21957,9 +22251,9 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 12098, - "total_submitted": 15402, - "total_column_articles": 199, + "total_acs": 12187, + "total_submitted": 15497, + "total_column_articles": 203, "frontend_question_id": "1844", "is_new_question": false }, @@ -21978,9 +22272,9 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 3374, - "total_submitted": 11322, - "total_column_articles": 74, + "total_acs": 13219, + "total_submitted": 30425, + "total_column_articles": 187, "frontend_question_id": "1825", "is_new_question": false }, @@ -21999,9 +22293,9 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 9744, - "total_submitted": 15240, - "total_column_articles": 184, + "total_acs": 21496, + "total_submitted": 31274, + "total_column_articles": 316, "frontend_question_id": "1824", "is_new_question": false }, @@ -22020,9 +22314,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": 50789, - "total_submitted": 64435, - "total_column_articles": 553, + "total_acs": 51049, + "total_submitted": 64759, + "total_column_articles": 555, "frontend_question_id": "1823", "is_new_question": false }, @@ -22041,9 +22335,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": 70430, - "total_submitted": 97203, - "total_column_articles": 695, + "total_acs": 70712, + "total_submitted": 97641, + "total_column_articles": 701, "frontend_question_id": "1822", "is_new_question": false }, @@ -22062,8 +22356,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 2018, - "total_submitted": 3481, + "total_acs": 2031, + "total_submitted": 3502, "total_column_articles": 57, "frontend_question_id": "1804", "is_new_question": false @@ -22083,9 +22377,9 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 31260, - "total_submitted": 39795, - "total_column_articles": 151, + "total_acs": 31746, + "total_submitted": 40410, + "total_column_articles": 152, "frontend_question_id": "1795", "is_new_question": false }, @@ -22104,9 +22398,9 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 3620, - "total_submitted": 8481, - "total_column_articles": 43, + "total_acs": 15510, + "total_submitted": 24472, + "total_column_articles": 107, "frontend_question_id": "1819", "is_new_question": false }, @@ -22125,8 +22419,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 30600, - "total_submitted": 81477, + "total_acs": 30747, + "total_submitted": 81820, "total_column_articles": 387, "frontend_question_id": "1818", "is_new_question": false @@ -22146,9 +22440,9 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 7990, - "total_submitted": 11378, - "total_column_articles": 135, + "total_acs": 23257, + "total_submitted": 29199, + "total_column_articles": 308, "frontend_question_id": "1817", "is_new_question": false }, @@ -22167,9 +22461,9 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 53378, - "total_submitted": 73556, - "total_column_articles": 721, + "total_acs": 53556, + "total_submitted": 73791, + "total_column_articles": 723, "frontend_question_id": "1816", "is_new_question": false }, @@ -22188,8 +22482,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": 336, - "total_submitted": 620, + "total_acs": 337, + "total_submitted": 624, "total_column_articles": 13, "frontend_question_id": "1794", "is_new_question": false @@ -22209,8 +22503,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 3889, - "total_submitted": 5450, + "total_acs": 3910, + "total_submitted": 5479, "total_column_articles": 45, "frontend_question_id": "1789", "is_new_question": false @@ -22230,9 +22524,9 @@ "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": 1287, - "total_submitted": 2482, - "total_column_articles": 29, + "total_acs": 1300, + "total_submitted": 2497, + "total_column_articles": 30, "frontend_question_id": "1830", "is_new_question": false }, @@ -22251,8 +22545,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 5821, - "total_submitted": 8166, + "total_acs": 5852, + "total_submitted": 8201, "total_column_articles": 113, "frontend_question_id": "1829", "is_new_question": false @@ -22272,9 +22566,9 @@ "question__title": "Queries on Number of Points Inside a Circle", "question__title_slug": "queries-on-number-of-points-inside-a-circle", "question__hide": false, - "total_acs": 13014, - "total_submitted": 14999, - "total_column_articles": 180, + "total_acs": 13177, + "total_submitted": 15177, + "total_column_articles": 182, "frontend_question_id": "1828", "is_new_question": false }, @@ -22293,9 +22587,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": 36674, - "total_submitted": 44739, - "total_column_articles": 399, + "total_acs": 36793, + "total_submitted": 44893, + "total_column_articles": 400, "frontend_question_id": "1827", "is_new_question": false }, @@ -22314,8 +22608,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 608, - "total_submitted": 939, + "total_acs": 610, + "total_submitted": 942, "total_column_articles": 31, "frontend_question_id": "1788", "is_new_question": false @@ -22335,8 +22629,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 3137, - "total_submitted": 11112, + "total_acs": 3149, + "total_submitted": 11137, "total_column_articles": 58, "frontend_question_id": "1808", "is_new_question": false @@ -22356,9 +22650,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": 25162, - "total_submitted": 32806, - "total_column_articles": 299, + "total_acs": 25359, + "total_submitted": 33052, + "total_column_articles": 300, "frontend_question_id": "1806", "is_new_question": false }, @@ -22377,9 +22671,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": 29799, - "total_submitted": 44106, - "total_column_articles": 429, + "total_acs": 30500, + "total_submitted": 45167, + "total_column_articles": 433, "frontend_question_id": "1807", "is_new_question": false }, @@ -22398,9 +22692,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": 38195, - "total_submitted": 87705, - "total_column_articles": 533, + "total_acs": 38271, + "total_submitted": 87907, + "total_column_articles": 536, "frontend_question_id": "1805", "is_new_question": false }, @@ -22419,8 +22713,8 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 5026, - "total_submitted": 6191, + "total_acs": 5080, + "total_submitted": 6253, "total_column_articles": 74, "frontend_question_id": "1783", "is_new_question": false @@ -22440,8 +22734,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 409, - "total_submitted": 860, + "total_acs": 412, + "total_submitted": 863, "total_column_articles": 16, "frontend_question_id": "1778", "is_new_question": false @@ -22461,8 +22755,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": 4832, - "total_submitted": 8585, + "total_acs": 4843, + "total_submitted": 8605, "total_column_articles": 74, "frontend_question_id": "1798", "is_new_question": false @@ -22482,9 +22776,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": 24000, - "total_submitted": 63238, - "total_column_articles": 379, + "total_acs": 24146, + "total_submitted": 63638, + "total_column_articles": 380, "frontend_question_id": "1802", "is_new_question": false }, @@ -22503,9 +22797,9 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 20028, - "total_submitted": 37614, - "total_column_articles": 295, + "total_acs": 20170, + "total_submitted": 37898, + "total_column_articles": 297, "frontend_question_id": "1801", "is_new_question": false }, @@ -22524,8 +22818,8 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 42570, - "total_submitted": 61746, + "total_acs": 42639, + "total_submitted": 61877, "total_column_articles": 622, "frontend_question_id": "1800", "is_new_question": false @@ -22545,9 +22839,9 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 8134, - "total_submitted": 10330, - "total_column_articles": 80, + "total_acs": 8168, + "total_submitted": 10368, + "total_column_articles": 81, "frontend_question_id": "1777", "is_new_question": false }, @@ -22566,9 +22860,9 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 5287, - "total_submitted": 14271, - "total_column_articles": 104, + "total_acs": 24728, + "total_submitted": 52318, + "total_column_articles": 311, "frontend_question_id": "1814", "is_new_question": false }, @@ -22587,9 +22881,9 @@ "question__title": "Maximum Number of Groups Getting Fresh Donuts", "question__title_slug": "maximum-number-of-groups-getting-fresh-donuts", "question__hide": false, - "total_acs": 2613, - "total_submitted": 8113, - "total_column_articles": 57, + "total_acs": 10066, + "total_submitted": 18713, + "total_column_articles": 91, "frontend_question_id": "1815", "is_new_question": false }, @@ -22608,9 +22902,9 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 6957, - "total_submitted": 15145, - "total_column_articles": 107, + "total_acs": 24516, + "total_submitted": 58453, + "total_column_articles": 326, "frontend_question_id": "1813", "is_new_question": false }, @@ -22629,9 +22923,9 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 39893, - "total_submitted": 48535, - "total_column_articles": 682, + "total_acs": 40078, + "total_submitted": 48765, + "total_column_articles": 683, "frontend_question_id": "1812", "is_new_question": false }, @@ -22650,8 +22944,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 746, - "total_submitted": 1588, + "total_acs": 761, + "total_submitted": 1605, "total_column_articles": 19, "frontend_question_id": "1772", "is_new_question": false @@ -22671,9 +22965,9 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 5454, - "total_submitted": 12156, - "total_column_articles": 125, + "total_acs": 5481, + "total_submitted": 12187, + "total_column_articles": 126, "frontend_question_id": "1793", "is_new_question": false }, @@ -22692,8 +22986,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 8403, - "total_submitted": 16359, + "total_acs": 8422, + "total_submitted": 16393, "total_column_articles": 129, "frontend_question_id": "1792", "is_new_question": false @@ -22713,8 +23007,8 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 53804, - "total_submitted": 64559, + "total_acs": 53948, + "total_submitted": 64748, "total_column_articles": 496, "frontend_question_id": "1791", "is_new_question": false @@ -22734,9 +23028,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": 61599, - "total_submitted": 116224, - "total_column_articles": 831, + "total_acs": 61829, + "total_submitted": 116735, + "total_column_articles": 834, "frontend_question_id": "1790", "is_new_question": false }, @@ -22755,8 +23049,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": 2936, - "total_submitted": 3657, + "total_acs": 2969, + "total_submitted": 3697, "total_column_articles": 53, "frontend_question_id": "1767", "is_new_question": false @@ -22776,8 +23070,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": 12571, - "total_submitted": 19441, + "total_acs": 12586, + "total_submitted": 19466, "total_column_articles": 66, "frontend_question_id": "1787", "is_new_question": false @@ -22797,8 +23091,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": 5195, - "total_submitted": 14618, + "total_acs": 5202, + "total_submitted": 14640, "total_column_articles": 124, "frontend_question_id": "1786", "is_new_question": false @@ -22818,8 +23112,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": 26663, - "total_submitted": 61264, + "total_acs": 26679, + "total_submitted": 61298, "total_column_articles": 291, "frontend_question_id": "1785", "is_new_question": false @@ -22839,8 +23133,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": 38711, - "total_submitted": 65026, + "total_acs": 38746, + "total_submitted": 65092, "total_column_articles": 532, "frontend_question_id": "1784", "is_new_question": false @@ -22860,8 +23154,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 2570, - "total_submitted": 3599, + "total_acs": 2576, + "total_submitted": 3611, "total_column_articles": 43, "frontend_question_id": "1762", "is_new_question": false @@ -22881,9 +23175,9 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 88138, - "total_submitted": 100091, - "total_column_articles": 217, + "total_acs": 89326, + "total_submitted": 101399, + "total_column_articles": 223, "frontend_question_id": "1757", "is_new_question": false }, @@ -22902,8 +23196,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": 15370, - "total_submitted": 27479, + "total_acs": 15571, + "total_submitted": 27759, "total_column_articles": 153, "frontend_question_id": "1803", "is_new_question": false @@ -22923,9 +23217,9 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 13250, - "total_submitted": 20185, - "total_column_articles": 153, + "total_acs": 13290, + "total_submitted": 20235, + "total_column_articles": 155, "frontend_question_id": "1799", "is_new_question": false }, @@ -22944,8 +23238,8 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 10772, - "total_submitted": 18587, + "total_acs": 10822, + "total_submitted": 18671, "total_column_articles": 152, "frontend_question_id": "1797", "is_new_question": false @@ -22965,8 +23259,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 35380, - "total_submitted": 64144, + "total_acs": 35445, + "total_submitted": 64244, "total_column_articles": 454, "frontend_question_id": "1796", "is_new_question": false @@ -22986,8 +23280,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 1289, - "total_submitted": 1582, + "total_acs": 1294, + "total_submitted": 1587, "total_column_articles": 31, "frontend_question_id": "1756", "is_new_question": false @@ -23007,8 +23301,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 2841, - "total_submitted": 5904, + "total_acs": 2848, + "total_submitted": 5922, "total_column_articles": 63, "frontend_question_id": "1776", "is_new_question": false @@ -23028,9 +23322,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": 23998, - "total_submitted": 42410, - "total_column_articles": 352, + "total_acs": 24050, + "total_submitted": 42495, + "total_column_articles": 353, "frontend_question_id": "1775", "is_new_question": false }, @@ -23049,9 +23343,9 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 26026, - "total_submitted": 44958, - "total_column_articles": 301, + "total_acs": 26057, + "total_submitted": 45013, + "total_column_articles": 302, "frontend_question_id": "1774", "is_new_question": false }, @@ -23070,9 +23364,9 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 47064, - "total_submitted": 53928, - "total_column_articles": 482, + "total_acs": 47146, + "total_submitted": 54029, + "total_column_articles": 485, "frontend_question_id": "1773", "is_new_question": false }, @@ -23091,8 +23385,8 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 4931, - "total_submitted": 7323, + "total_acs": 4983, + "total_submitted": 7389, "total_column_articles": 76, "frontend_question_id": "1747", "is_new_question": false @@ -23112,8 +23406,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 3119, - "total_submitted": 8240, + "total_acs": 3131, + "total_submitted": 8268, "total_column_articles": 60, "frontend_question_id": "1771", "is_new_question": false @@ -23133,8 +23427,8 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 5785, - "total_submitted": 14706, + "total_acs": 5804, + "total_submitted": 14750, "total_column_articles": 127, "frontend_question_id": "1770", "is_new_question": false @@ -23154,8 +23448,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": 38557, - "total_submitted": 43553, + "total_acs": 38640, + "total_submitted": 43643, "total_column_articles": 545, "frontend_question_id": "1769", "is_new_question": false @@ -23175,9 +23469,9 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 49035, - "total_submitted": 62409, - "total_column_articles": 707, + "total_acs": 49195, + "total_submitted": 62611, + "total_column_articles": 709, "frontend_question_id": "1768", "is_new_question": false }, @@ -23196,8 +23490,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 2533, - "total_submitted": 4207, + "total_acs": 2553, + "total_submitted": 4233, "total_column_articles": 74, "frontend_question_id": "1746", "is_new_question": false @@ -23217,9 +23511,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": 22859, - "total_submitted": 26790, - "total_column_articles": 143, + "total_acs": 23196, + "total_submitted": 27176, + "total_column_articles": 146, "frontend_question_id": "1741", "is_new_question": false }, @@ -23238,8 +23532,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 1880, - "total_submitted": 5346, + "total_acs": 1887, + "total_submitted": 5368, "total_column_articles": 51, "frontend_question_id": "1782", "is_new_question": false @@ -23259,8 +23553,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 24095, - "total_submitted": 36177, + "total_acs": 24148, + "total_submitted": 36266, "total_column_articles": 223, "frontend_question_id": "1781", "is_new_question": false @@ -23280,8 +23574,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": 30509, - "total_submitted": 40720, + "total_acs": 30541, + "total_submitted": 40761, "total_column_articles": 496, "frontend_question_id": "1780", "is_new_question": false @@ -23301,9 +23595,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": 43048, - "total_submitted": 61810, - "total_column_articles": 517, + "total_acs": 43243, + "total_submitted": 62071, + "total_column_articles": 522, "frontend_question_id": "1779", "is_new_question": false }, @@ -23322,8 +23616,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": 3685, - "total_submitted": 8039, + "total_acs": 3689, + "total_submitted": 8053, "total_column_articles": 52, "frontend_question_id": "1761", "is_new_question": false @@ -23343,8 +23637,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": 23538, - "total_submitted": 36705, + "total_acs": 23635, + "total_submitted": 36848, "total_column_articles": 269, "frontend_question_id": "1760", "is_new_question": false @@ -23364,9 +23658,9 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 23359, - "total_submitted": 45576, - "total_column_articles": 272, + "total_acs": 23379, + "total_submitted": 45628, + "total_column_articles": 273, "frontend_question_id": "1759", "is_new_question": false }, @@ -23385,9 +23679,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": 35437, - "total_submitted": 50613, - "total_column_articles": 441, + "total_acs": 35524, + "total_submitted": 50759, + "total_column_articles": 442, "frontend_question_id": "1758", "is_new_question": false }, @@ -23406,9 +23700,9 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 1483, - "total_submitted": 2233, - "total_column_articles": 52, + "total_acs": 1509, + "total_submitted": 2267, + "total_column_articles": 53, "frontend_question_id": "1740", "is_new_question": false }, @@ -23427,8 +23721,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": 6104, - "total_submitted": 12986, + "total_acs": 6152, + "total_submitted": 13082, "total_column_articles": 73, "frontend_question_id": "1731", "is_new_question": false @@ -23448,9 +23742,9 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 5451, - "total_submitted": 12259, - "total_column_articles": 85, + "total_acs": 5476, + "total_submitted": 12310, + "total_column_articles": 86, "frontend_question_id": "1755", "is_new_question": false }, @@ -23469,8 +23763,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 18428, - "total_submitted": 32680, + "total_acs": 18450, + "total_submitted": 32730, "total_column_articles": 208, "frontend_question_id": "1754", "is_new_question": false @@ -23490,8 +23784,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 25863, - "total_submitted": 36502, + "total_acs": 25889, + "total_submitted": 36539, "total_column_articles": 332, "frontend_question_id": "1753", "is_new_question": false @@ -23511,9 +23805,9 @@ "question__title": "Check if Array Is Sorted and Rotated", "question__title_slug": "check-if-array-is-sorted-and-rotated", "question__hide": false, - "total_acs": 31665, - "total_submitted": 54195, - "total_column_articles": 401, + "total_acs": 31713, + "total_submitted": 54269, + "total_column_articles": 402, "frontend_question_id": "1752", "is_new_question": false }, @@ -23532,9 +23826,9 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 23446, - "total_submitted": 37772, - "total_column_articles": 111, + "total_acs": 23766, + "total_submitted": 38271, + "total_column_articles": 114, "frontend_question_id": "1729", "is_new_question": false }, @@ -23553,9 +23847,9 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 23668, - "total_submitted": 35658, - "total_column_articles": 320, + "total_acs": 23688, + "total_submitted": 35690, + "total_column_articles": 321, "frontend_question_id": "1765", "is_new_question": false }, @@ -23574,9 +23868,9 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 2173, - "total_submitted": 5429, - "total_column_articles": 45, + "total_acs": 2203, + "total_submitted": 5478, + "total_column_articles": 46, "frontend_question_id": "1766", "is_new_question": false }, @@ -23595,9 +23889,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": 17786, - "total_submitted": 31683, - "total_column_articles": 254, + "total_acs": 17814, + "total_submitted": 31766, + "total_column_articles": 255, "frontend_question_id": "1764", "is_new_question": false }, @@ -23616,9 +23910,9 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 27301, - "total_submitted": 40101, - "total_column_articles": 295, + "total_acs": 27375, + "total_submitted": 40234, + "total_column_articles": 296, "frontend_question_id": "1763", "is_new_question": false }, @@ -23637,8 +23931,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": 30033, - "total_submitted": 82791, + "total_acs": 30054, + "total_submitted": 82849, "total_column_articles": 388, "frontend_question_id": "1744", "is_new_question": false @@ -23658,8 +23952,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 4940, - "total_submitted": 9812, + "total_acs": 4950, + "total_submitted": 9832, "total_column_articles": 104, "frontend_question_id": "1745", "is_new_question": false @@ -23679,9 +23973,9 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 24152, - "total_submitted": 34715, - "total_column_articles": 357, + "total_acs": 24165, + "total_submitted": 34731, + "total_column_articles": 358, "frontend_question_id": "1743", "is_new_question": false }, @@ -23700,8 +23994,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": 626, - "total_submitted": 1068, + "total_acs": 630, + "total_submitted": 1074, "total_column_articles": 21, "frontend_question_id": "1724", "is_new_question": false @@ -23721,8 +24015,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 3653, - "total_submitted": 5112, + "total_acs": 3682, + "total_submitted": 5147, "total_column_articles": 54, "frontend_question_id": "1715", "is_new_question": false @@ -23742,8 +24036,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 12501, - "total_submitted": 19302, + "total_acs": 12518, + "total_submitted": 19329, "total_column_articles": 132, "frontend_question_id": "1739", "is_new_question": false @@ -23763,8 +24057,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 31114, - "total_submitted": 47779, + "total_acs": 31140, + "total_submitted": 47823, "total_column_articles": 428, "frontend_question_id": "1738", "is_new_question": false @@ -23784,8 +24078,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": 5417, - "total_submitted": 15321, + "total_acs": 5429, + "total_submitted": 15342, "total_column_articles": 126, "frontend_question_id": "1737", "is_new_question": false @@ -23805,8 +24099,8 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 32390, - "total_submitted": 72878, + "total_acs": 32456, + "total_submitted": 73037, "total_column_articles": 414, "frontend_question_id": "1736", "is_new_question": false @@ -23826,9 +24120,9 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 4784, - "total_submitted": 6662, - "total_column_articles": 75, + "total_acs": 4826, + "total_submitted": 6722, + "total_column_articles": 76, "frontend_question_id": "1709", "is_new_question": false }, @@ -23847,8 +24141,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": 5861, - "total_submitted": 11018, + "total_acs": 5888, + "total_submitted": 11055, "total_column_articles": 82, "frontend_question_id": "1751", "is_new_question": false @@ -23868,8 +24162,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": 23431, - "total_submitted": 46085, + "total_acs": 23465, + "total_submitted": 46153, "total_column_articles": 282, "frontend_question_id": "1750", "is_new_question": false @@ -23889,9 +24183,9 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 6470, - "total_submitted": 11986, - "total_column_articles": 138, + "total_acs": 6500, + "total_submitted": 12038, + "total_column_articles": 139, "frontend_question_id": "1749", "is_new_question": false }, @@ -23910,9 +24204,9 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 45679, - "total_submitted": 58948, - "total_column_articles": 630, + "total_acs": 45770, + "total_submitted": 59061, + "total_column_articles": 631, "frontend_question_id": "1748", "is_new_question": false }, @@ -23931,8 +24225,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 1651, - "total_submitted": 2432, + "total_acs": 1658, + "total_submitted": 2443, "total_column_articles": 48, "frontend_question_id": "1708", "is_new_question": false @@ -23952,8 +24246,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 4509, - "total_submitted": 7673, + "total_acs": 4522, + "total_submitted": 7689, "total_column_articles": 93, "frontend_question_id": "1727", "is_new_question": false @@ -23973,8 +24267,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": 37981, - "total_submitted": 50105, + "total_acs": 38051, + "total_submitted": 50192, "total_column_articles": 387, "frontend_question_id": "1742", "is_new_question": false @@ -23994,9 +24288,9 @@ "question__title": "Number Of Rectangles That Can Form The Largest Square", "question__title_slug": "number-of-rectangles-that-can-form-the-largest-square", "question__hide": false, - "total_acs": 37779, - "total_submitted": 45519, - "total_column_articles": 471, + "total_acs": 37828, + "total_submitted": 45579, + "total_column_articles": 472, "frontend_question_id": "1725", "is_new_question": false }, @@ -24015,9 +24309,9 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 9432, - "total_submitted": 12247, - "total_column_articles": 107, + "total_acs": 9554, + "total_submitted": 12421, + "total_column_articles": 108, "frontend_question_id": "1699", "is_new_question": false }, @@ -24036,9 +24330,9 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 5906, - "total_submitted": 11598, - "total_column_articles": 144, + "total_acs": 5931, + "total_submitted": 11664, + "total_column_articles": 145, "frontend_question_id": "1722", "is_new_question": false }, @@ -24057,8 +24351,8 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 53907, - "total_submitted": 62476, + "total_acs": 53965, + "total_submitted": 62545, "total_column_articles": 583, "frontend_question_id": "1720", "is_new_question": false @@ -24078,8 +24372,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": 935, - "total_submitted": 1708, + "total_acs": 937, + "total_submitted": 1710, "total_column_articles": 27, "frontend_question_id": "1698", "is_new_question": false @@ -24099,9 +24393,9 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 22552, - "total_submitted": 27396, - "total_column_articles": 135, + "total_acs": 22856, + "total_submitted": 27757, + "total_column_articles": 137, "frontend_question_id": "1693", "is_new_question": false }, @@ -24120,9 +24414,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": 1716, - "total_submitted": 3278, - "total_column_articles": 47, + "total_acs": 1721, + "total_submitted": 3283, + "total_column_articles": 48, "frontend_question_id": "1735", "is_new_question": false }, @@ -24141,8 +24435,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 29403, - "total_submitted": 40583, + "total_acs": 29420, + "total_submitted": 40615, "total_column_articles": 382, "frontend_question_id": "1734", "is_new_question": false @@ -24162,8 +24456,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 3253, - "total_submitted": 6778, + "total_acs": 3267, + "total_submitted": 6803, "total_column_articles": 73, "frontend_question_id": "1733", "is_new_question": false @@ -24183,8 +24477,8 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 41969, - "total_submitted": 51376, + "total_acs": 42055, + "total_submitted": 51488, "total_column_articles": 514, "frontend_question_id": "1732", "is_new_question": false @@ -24204,9 +24498,9 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 18207, - "total_submitted": 36581, - "total_column_articles": 194, + "total_acs": 18235, + "total_submitted": 36620, + "total_column_articles": 195, "frontend_question_id": "1713", "is_new_question": false }, @@ -24225,8 +24519,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": 12015, - "total_submitted": 42647, + "total_acs": 12108, + "total_submitted": 42838, "total_column_articles": 169, "frontend_question_id": "1712", "is_new_question": false @@ -24246,8 +24540,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 32493, - "total_submitted": 90399, + "total_acs": 32511, + "total_submitted": 90442, "total_column_articles": 387, "frontend_question_id": "1711", "is_new_question": false @@ -24267,8 +24561,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 47468, - "total_submitted": 64511, + "total_acs": 47598, + "total_submitted": 64678, "total_column_articles": 569, "frontend_question_id": "1710", "is_new_question": false @@ -24288,9 +24582,9 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 636, - "total_submitted": 924, - "total_column_articles": 21, + "total_acs": 639, + "total_submitted": 928, + "total_column_articles": 22, "frontend_question_id": "1692", "is_new_question": false }, @@ -24309,8 +24603,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 6252, - "total_submitted": 6939, + "total_acs": 6280, + "total_submitted": 6970, "total_column_articles": 49, "frontend_question_id": "1683", "is_new_question": false @@ -24330,8 +24624,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": 16187, - "total_submitted": 31880, + "total_acs": 16197, + "total_submitted": 31901, "total_column_articles": 168, "frontend_question_id": "1707", "is_new_question": false @@ -24351,8 +24645,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": 29800, - "total_submitted": 58562, + "total_acs": 29838, + "total_submitted": 58620, "total_column_articles": 212, "frontend_question_id": "1723", "is_new_question": false @@ -24372,8 +24666,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 28911, - "total_submitted": 63824, + "total_acs": 28946, + "total_submitted": 63890, "total_column_articles": 389, "frontend_question_id": "1705", "is_new_question": false @@ -24393,9 +24687,9 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 47060, - "total_submitted": 59871, - "total_column_articles": 560, + "total_acs": 47140, + "total_submitted": 59976, + "total_column_articles": 563, "frontend_question_id": "1704", "is_new_question": false }, @@ -24414,8 +24708,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 1025, - "total_submitted": 1800, + "total_acs": 1026, + "total_submitted": 1802, "total_column_articles": 39, "frontend_question_id": "1682", "is_new_question": false @@ -24435,8 +24729,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 4113, - "total_submitted": 11715, + "total_acs": 4125, + "total_submitted": 11741, "total_column_articles": 52, "frontend_question_id": "1677", "is_new_question": false @@ -24456,8 +24750,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": 12905, - "total_submitted": 18630, + "total_acs": 12910, + "total_submitted": 18642, "total_column_articles": 94, "frontend_question_id": "1719", "is_new_question": false @@ -24477,8 +24771,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 3131, - "total_submitted": 6229, + "total_acs": 3146, + "total_submitted": 6257, "total_column_articles": 73, "frontend_question_id": "1718", "is_new_question": false @@ -24498,9 +24792,9 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 3476, - "total_submitted": 7557, - "total_column_articles": 78, + "total_acs": 3493, + "total_submitted": 7585, + "total_column_articles": 79, "frontend_question_id": "1717", "is_new_question": false }, @@ -24519,8 +24813,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 40963, - "total_submitted": 59016, + "total_acs": 41016, + "total_submitted": 59086, "total_column_articles": 733, "frontend_question_id": "1716", "is_new_question": false @@ -24540,8 +24834,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": 2857, - "total_submitted": 3498, + "total_acs": 2882, + "total_submitted": 3532, "total_column_articles": 50, "frontend_question_id": "1676", "is_new_question": false @@ -24561,8 +24855,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": 14380, - "total_submitted": 22087, + "total_acs": 14399, + "total_submitted": 22149, "total_column_articles": 159, "frontend_question_id": "1697", "is_new_question": false @@ -24582,8 +24876,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 11456, - "total_submitted": 28430, + "total_acs": 11494, + "total_submitted": 28524, "total_column_articles": 178, "frontend_question_id": "1696", "is_new_question": false @@ -24603,9 +24897,9 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 12646, - "total_submitted": 24635, - "total_column_articles": 213, + "total_acs": 12705, + "total_submitted": 24705, + "total_column_articles": 215, "frontend_question_id": "1695", "is_new_question": false }, @@ -24624,8 +24918,8 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 36576, - "total_submitted": 55091, + "total_acs": 36631, + "total_submitted": 55170, "total_column_articles": 553, "frontend_question_id": "1694", "is_new_question": false @@ -24645,9 +24939,9 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 41512, - "total_submitted": 64902, - "total_column_articles": 239, + "total_acs": 42111, + "total_submitted": 65861, + "total_column_articles": 242, "frontend_question_id": "1667", "is_new_question": false }, @@ -24666,8 +24960,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": 465, - "total_submitted": 707, + "total_acs": 466, + "total_submitted": 710, "total_column_articles": 21, "frontend_question_id": "1666", "is_new_question": false @@ -24687,8 +24981,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": 430, - "total_submitted": 730, + "total_acs": 431, + "total_submitted": 732, "total_column_articles": 12, "frontend_question_id": "1714", "is_new_question": false @@ -24708,8 +25002,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 6085, - "total_submitted": 11018, + "total_acs": 6090, + "total_submitted": 11026, "total_column_articles": 127, "frontend_question_id": "1690", "is_new_question": false @@ -24729,8 +25023,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": 20605, - "total_submitted": 23747, + "total_acs": 20667, + "total_submitted": 23811, "total_column_articles": 285, "frontend_question_id": "1689", "is_new_question": false @@ -24750,9 +25044,9 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 58459, - "total_submitted": 69590, - "total_column_articles": 632, + "total_acs": 58528, + "total_submitted": 69665, + "total_column_articles": 634, "frontend_question_id": "1688", "is_new_question": false }, @@ -24771,9 +25065,9 @@ "question__title": "Minimum Adjacent Swaps for K Consecutive Ones", "question__title_slug": "minimum-adjacent-swaps-for-k-consecutive-ones", "question__hide": false, - "total_acs": 11337, - "total_submitted": 19821, - "total_column_articles": 87, + "total_acs": 11366, + "total_submitted": 19893, + "total_column_articles": 88, "frontend_question_id": "1703", "is_new_question": false }, @@ -24792,8 +25086,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 4576, - "total_submitted": 9414, + "total_acs": 4584, + "total_submitted": 9428, "total_column_articles": 96, "frontend_question_id": "1702", "is_new_question": false @@ -24813,8 +25107,8 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 6663, - "total_submitted": 10975, + "total_acs": 6694, + "total_submitted": 11018, "total_column_articles": 133, "frontend_question_id": "1701", "is_new_question": false @@ -24834,9 +25128,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": 47629, - "total_submitted": 64429, - "total_column_articles": 730, + "total_acs": 47778, + "total_submitted": 64622, + "total_column_articles": 733, "frontend_question_id": "1700", "is_new_question": false }, @@ -24855,8 +25149,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 5501, - "total_submitted": 7363, + "total_acs": 5521, + "total_submitted": 7389, "total_column_articles": 82, "frontend_question_id": "1661", "is_new_question": false @@ -24876,8 +25170,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 7427, - "total_submitted": 15137, + "total_acs": 7441, + "total_submitted": 15161, "total_column_articles": 91, "frontend_question_id": "1680", "is_new_question": false @@ -24897,8 +25191,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 3638, - "total_submitted": 8587, + "total_acs": 3639, + "total_submitted": 8588, "total_column_articles": 71, "frontend_question_id": "1681", "is_new_question": false @@ -24918,9 +25212,9 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 10067, - "total_submitted": 19357, - "total_column_articles": 167, + "total_acs": 10092, + "total_submitted": 19390, + "total_column_articles": 168, "frontend_question_id": "1679", "is_new_question": false }, @@ -24939,9 +25233,9 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 53077, - "total_submitted": 61225, - "total_column_articles": 732, + "total_acs": 53242, + "total_submitted": 61407, + "total_column_articles": 736, "frontend_question_id": "1678", "is_new_question": false }, @@ -24960,8 +25254,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 811, - "total_submitted": 1075, + "total_acs": 817, + "total_submitted": 1082, "total_column_articles": 34, "frontend_question_id": "1660", "is_new_question": false @@ -24981,8 +25275,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 1708, - "total_submitted": 2634, + "total_acs": 1722, + "total_submitted": 2654, "total_column_articles": 36, "frontend_question_id": "1651", "is_new_question": false @@ -25002,9 +25296,9 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 5804, - "total_submitted": 12783, - "total_column_articles": 72, + "total_acs": 5844, + "total_submitted": 12887, + "total_column_articles": 73, "frontend_question_id": "1675", "is_new_question": false }, @@ -25023,8 +25317,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 3864, - "total_submitted": 9383, + "total_acs": 3881, + "total_submitted": 9410, "total_column_articles": 79, "frontend_question_id": "1674", "is_new_question": false @@ -25044,9 +25338,9 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 10958, - "total_submitted": 28152, - "total_column_articles": 218, + "total_acs": 10988, + "total_submitted": 28220, + "total_column_articles": 220, "frontend_question_id": "1673", "is_new_question": false }, @@ -25065,9 +25359,9 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 118816, - "total_submitted": 138148, - "total_column_articles": 1171, + "total_acs": 119835, + "total_submitted": 139454, + "total_column_articles": 1181, "frontend_question_id": "1672", "is_new_question": false }, @@ -25086,8 +25380,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": 4493, - "total_submitted": 5638, + "total_acs": 4525, + "total_submitted": 5676, "total_column_articles": 62, "frontend_question_id": "1650", "is_new_question": false @@ -25107,9 +25401,9 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 12397, - "total_submitted": 20867, - "total_column_articles": 96, + "total_acs": 12405, + "total_submitted": 20880, + "total_column_articles": 97, "frontend_question_id": "1687", "is_new_question": false }, @@ -25128,9 +25422,9 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 4335, - "total_submitted": 8819, - "total_column_articles": 71, + "total_acs": 4348, + "total_submitted": 8837, + "total_column_articles": 72, "frontend_question_id": "1686", "is_new_question": false }, @@ -25149,8 +25443,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": 6789, - "total_submitted": 10690, + "total_acs": 6830, + "total_submitted": 10744, "total_column_articles": 153, "frontend_question_id": "1685", "is_new_question": false @@ -25170,9 +25464,9 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 58683, - "total_submitted": 68513, - "total_column_articles": 820, + "total_acs": 58842, + "total_submitted": 68696, + "total_column_articles": 819, "frontend_question_id": "1684", "is_new_question": false }, @@ -25191,8 +25485,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 1644, - "total_submitted": 3980, + "total_acs": 1654, + "total_submitted": 4002, "total_column_articles": 36, "frontend_question_id": "1645", "is_new_question": false @@ -25212,8 +25506,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 7186, - "total_submitted": 11026, + "total_acs": 7212, + "total_submitted": 11064, "total_column_articles": 116, "frontend_question_id": "1665", "is_new_question": false @@ -25233,8 +25527,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 7186, - "total_submitted": 12862, + "total_acs": 7209, + "total_submitted": 12904, "total_column_articles": 137, "frontend_question_id": "1664", "is_new_question": false @@ -25254,8 +25548,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": 10313, - "total_submitted": 17908, + "total_acs": 10326, + "total_submitted": 17939, "total_column_articles": 171, "frontend_question_id": "1663", "is_new_question": false @@ -25275,9 +25569,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": 66873, - "total_submitted": 82454, - "total_column_articles": 695, + "total_acs": 66932, + "total_submitted": 82526, + "total_column_articles": 696, "frontend_question_id": "1662", "is_new_question": false }, @@ -25296,8 +25590,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": 3821, - "total_submitted": 6882, + "total_acs": 3843, + "total_submitted": 6915, "total_column_articles": 54, "frontend_question_id": "1644", "is_new_question": false @@ -25317,9 +25611,9 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 2396, - "total_submitted": 4616, - "total_column_articles": 51, + "total_acs": 2405, + "total_submitted": 4631, + "total_column_articles": 52, "frontend_question_id": "1635", "is_new_question": false }, @@ -25339,7 +25633,7 @@ "question__title_slug": "maximize-grid-happiness", "question__hide": false, "total_acs": 1990, - "total_submitted": 4513, + "total_submitted": 4514, "total_column_articles": 35, "frontend_question_id": "1659", "is_new_question": false @@ -25359,9 +25653,9 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 7677, - "total_submitted": 16299, - "total_column_articles": 119, + "total_acs": 7716, + "total_submitted": 16366, + "total_column_articles": 120, "frontend_question_id": "1657", "is_new_question": false }, @@ -25380,9 +25674,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": 34595, - "total_submitted": 88532, - "total_column_articles": 418, + "total_acs": 34880, + "total_submitted": 89252, + "total_column_articles": 420, "frontend_question_id": "1658", "is_new_question": false }, @@ -25401,8 +25695,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 38562, - "total_submitted": 45750, + "total_acs": 38615, + "total_submitted": 45818, "total_column_articles": 364, "frontend_question_id": "1656", "is_new_question": false @@ -25422,8 +25716,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": 1715, - "total_submitted": 2883, + "total_acs": 1731, + "total_submitted": 2906, "total_column_articles": 53, "frontend_question_id": "1634", "is_new_question": false @@ -25443,9 +25737,9 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 8150, - "total_submitted": 12580, - "total_column_articles": 62, + "total_acs": 8248, + "total_submitted": 12731, + "total_column_articles": 63, "frontend_question_id": "1633", "is_new_question": false }, @@ -25464,8 +25758,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 3895, - "total_submitted": 7971, + "total_acs": 3911, + "total_submitted": 7993, "total_column_articles": 96, "frontend_question_id": "1649", "is_new_question": false @@ -25485,8 +25779,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 6641, - "total_submitted": 21195, + "total_acs": 6699, + "total_submitted": 21356, "total_column_articles": 144, "frontend_question_id": "1648", "is_new_question": false @@ -25506,8 +25800,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": 11458, - "total_submitted": 21208, + "total_acs": 11495, + "total_submitted": 21267, "total_column_articles": 173, "frontend_question_id": "1647", "is_new_question": false @@ -25527,8 +25821,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 46141, - "total_submitted": 88012, + "total_acs": 46285, + "total_submitted": 88257, "total_column_articles": 484, "frontend_question_id": "1646", "is_new_question": false @@ -25548,8 +25842,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": 872, - "total_submitted": 1069, + "total_acs": 879, + "total_submitted": 1079, "total_column_articles": 30, "frontend_question_id": "1628", "is_new_question": false @@ -25569,9 +25863,9 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 7135, - "total_submitted": 13653, - "total_column_articles": 135, + "total_acs": 7159, + "total_submitted": 13738, + "total_column_articles": 136, "frontend_question_id": "1670", "is_new_question": false }, @@ -25590,8 +25884,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": 3343, - "total_submitted": 7091, + "total_acs": 3367, + "total_submitted": 7149, "total_column_articles": 65, "frontend_question_id": "1671", "is_new_question": false @@ -25611,9 +25905,9 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 21414, - "total_submitted": 28571, - "total_column_articles": 376, + "total_acs": 21524, + "total_submitted": 28752, + "total_column_articles": 379, "frontend_question_id": "1669", "is_new_question": false }, @@ -25632,8 +25926,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 42039, - "total_submitted": 88939, + "total_acs": 42079, + "total_submitted": 89033, "total_column_articles": 568, "frontend_question_id": "1668", "is_new_question": false @@ -25653,8 +25947,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": 5704, - "total_submitted": 7297, + "total_acs": 5739, + "total_submitted": 7341, "total_column_articles": 59, "frontend_question_id": "1623", "is_new_question": false @@ -25674,9 +25968,9 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 9798, - "total_submitted": 21616, - "total_column_articles": 159, + "total_acs": 9843, + "total_submitted": 21717, + "total_column_articles": 161, "frontend_question_id": "1642", "is_new_question": false }, @@ -25695,9 +25989,9 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 15273, - "total_submitted": 19603, - "total_column_articles": 344, + "total_acs": 15320, + "total_submitted": 19662, + "total_column_articles": 346, "frontend_question_id": "1641", "is_new_question": false }, @@ -25716,8 +26010,8 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 43586, - "total_submitted": 71365, + "total_acs": 43642, + "total_submitted": 71442, "total_column_articles": 648, "frontend_question_id": "1640", "is_new_question": false @@ -25737,8 +26031,8 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 4682, - "total_submitted": 6350, + "total_acs": 4727, + "total_submitted": 6415, "total_column_articles": 62, "frontend_question_id": "1613", "is_new_question": false @@ -25758,9 +26052,9 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 3575, - "total_submitted": 9098, - "total_column_articles": 56, + "total_acs": 3592, + "total_submitted": 9130, + "total_column_articles": 57, "frontend_question_id": "1655", "is_new_question": false }, @@ -25779,8 +26073,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 8038, - "total_submitted": 25916, + "total_acs": 8086, + "total_submitted": 26056, "total_column_articles": 109, "frontend_question_id": "1654", "is_new_question": false @@ -25800,8 +26094,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 6400, - "total_submitted": 11689, + "total_acs": 6446, + "total_submitted": 11774, "total_column_articles": 140, "frontend_question_id": "1653", "is_new_question": false @@ -25821,9 +26115,9 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 36311, - "total_submitted": 54471, - "total_column_articles": 595, + "total_acs": 36364, + "total_submitted": 54568, + "total_column_articles": 597, "frontend_question_id": "1652", "is_new_question": false }, @@ -25842,9 +26136,9 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 38594, - "total_submitted": 75907, - "total_column_articles": 415, + "total_acs": 38720, + "total_submitted": 76126, + "total_column_articles": 416, "frontend_question_id": "1631", "is_new_question": false }, @@ -25863,8 +26157,8 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 11446, - "total_submitted": 15053, + "total_acs": 11497, + "total_submitted": 15121, "total_column_articles": 216, "frontend_question_id": "1630", "is_new_question": false @@ -25884,8 +26178,8 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 36179, - "total_submitted": 64833, + "total_acs": 36225, + "total_submitted": 64902, "total_column_articles": 438, "frontend_question_id": "1629", "is_new_question": false @@ -25905,8 +26199,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": 799, - "total_submitted": 1079, + "total_acs": 805, + "total_submitted": 1087, "total_column_articles": 35, "frontend_question_id": "1612", "is_new_question": false @@ -25926,9 +26220,9 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 8305, - "total_submitted": 15300, - "total_column_articles": 81, + "total_acs": 8407, + "total_submitted": 15482, + "total_column_articles": 82, "frontend_question_id": "1607", "is_new_question": false }, @@ -25947,8 +26241,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 5591, - "total_submitted": 13560, + "total_acs": 5604, + "total_submitted": 13591, "total_column_articles": 116, "frontend_question_id": "1626", "is_new_question": false @@ -25968,8 +26262,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 3894, - "total_submitted": 7062, + "total_acs": 3902, + "total_submitted": 7077, "total_column_articles": 79, "frontend_question_id": "1625", "is_new_question": false @@ -25989,9 +26283,9 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 45035, - "total_submitted": 69815, - "total_column_articles": 674, + "total_acs": 45088, + "total_submitted": 69889, + "total_column_articles": 675, "frontend_question_id": "1624", "is_new_question": false }, @@ -26010,8 +26304,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": 1744, - "total_submitted": 2350, + "total_acs": 1763, + "total_submitted": 2378, "total_column_articles": 59, "frontend_question_id": "1602", "is_new_question": false @@ -26031,9 +26325,9 @@ "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": 2149, - "total_submitted": 4731, - "total_column_articles": 51, + "total_acs": 2170, + "total_submitted": 4790, + "total_column_articles": 52, "frontend_question_id": "1639", "is_new_question": false }, @@ -26052,9 +26346,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": 4340, - "total_submitted": 6021, - "total_column_articles": 73, + "total_acs": 4365, + "total_submitted": 6051, + "total_column_articles": 74, "frontend_question_id": "1638", "is_new_question": false }, @@ -26073,8 +26367,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": 8200, - "total_submitted": 10148, + "total_acs": 8224, + "total_submitted": 10174, "total_column_articles": 121, "frontend_question_id": "1637", "is_new_question": false @@ -26094,9 +26388,9 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 46157, - "total_submitted": 61663, - "total_column_articles": 589, + "total_acs": 46275, + "total_submitted": 61810, + "total_column_articles": 590, "frontend_question_id": "1636", "is_new_question": false }, @@ -26115,8 +26409,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": 2562, - "total_submitted": 3953, + "total_acs": 2571, + "total_submitted": 3963, "total_column_articles": 55, "frontend_question_id": "1617", "is_new_question": false @@ -26136,8 +26430,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 6366, - "total_submitted": 22472, + "total_acs": 6381, + "total_submitted": 22524, "total_column_articles": 122, "frontend_question_id": "1616", "is_new_question": false @@ -26157,8 +26451,8 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 9871, - "total_submitted": 17446, + "total_acs": 9927, + "total_submitted": 17524, "total_column_articles": 119, "frontend_question_id": "1615", "is_new_question": false @@ -26178,9 +26472,9 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 58874, - "total_submitted": 70775, - "total_column_articles": 802, + "total_acs": 59003, + "total_submitted": 70964, + "total_column_articles": 803, "frontend_question_id": "1614", "is_new_question": false }, @@ -26220,9 +26514,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": 6224, - "total_submitted": 8385, - "total_column_articles": 85, + "total_acs": 6272, + "total_submitted": 8450, + "total_column_articles": 86, "frontend_question_id": "1596", "is_new_question": false }, @@ -26241,9 +26535,9 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 22225, - "total_submitted": 27116, - "total_column_articles": 136, + "total_acs": 22503, + "total_submitted": 27477, + "total_column_articles": 137, "frontend_question_id": "1587", "is_new_question": false }, @@ -26262,8 +26556,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 17304, - "total_submitted": 38972, + "total_acs": 17322, + "total_submitted": 39007, "total_column_articles": 160, "frontend_question_id": "1610", "is_new_question": false @@ -26283,8 +26577,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": 3032, - "total_submitted": 4919, + "total_acs": 3040, + "total_submitted": 4934, "total_column_articles": 71, "frontend_question_id": "1611", "is_new_question": false @@ -26304,9 +26598,9 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 31918, - "total_submitted": 54684, - "total_column_articles": 494, + "total_acs": 31988, + "total_submitted": 54818, + "total_column_articles": 495, "frontend_question_id": "1609", "is_new_question": false }, @@ -26325,9 +26619,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": 51524, - "total_submitted": 83582, - "total_column_articles": 771, + "total_acs": 51696, + "total_submitted": 83860, + "total_column_articles": 774, "frontend_question_id": "1608", "is_new_question": false }, @@ -26346,8 +26640,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 782, - "total_submitted": 1250, + "total_acs": 786, + "total_submitted": 1261, "total_column_articles": 37, "frontend_question_id": "1586", "is_new_question": false @@ -26367,8 +26661,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 4292, - "total_submitted": 25861, + "total_acs": 4323, + "total_submitted": 25996, "total_column_articles": 95, "frontend_question_id": "1622", "is_new_question": false @@ -26388,8 +26682,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 13623, - "total_submitted": 21172, + "total_acs": 13630, + "total_submitted": 21183, "total_column_articles": 82, "frontend_question_id": "1728", "is_new_question": false @@ -26409,8 +26703,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 28630, - "total_submitted": 62008, + "total_acs": 28643, + "total_submitted": 62030, "total_column_articles": 280, "frontend_question_id": "1620", "is_new_question": false @@ -26430,8 +26724,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": 2680, - "total_submitted": 5704, + "total_acs": 2700, + "total_submitted": 5733, "total_column_articles": 53, "frontend_question_id": "1621", "is_new_question": false @@ -26451,9 +26745,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": 32915, - "total_submitted": 40507, - "total_column_articles": 233, + "total_acs": 33352, + "total_submitted": 41019, + "total_column_articles": 239, "frontend_question_id": "1581", "is_new_question": false }, @@ -26472,8 +26766,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 21342, - "total_submitted": 34562, + "total_acs": 21354, + "total_submitted": 34577, "total_column_articles": 234, "frontend_question_id": "1601", "is_new_question": false @@ -26493,8 +26787,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 18850, - "total_submitted": 28693, + "total_acs": 18864, + "total_submitted": 28709, "total_column_articles": 230, "frontend_question_id": "1600", "is_new_question": false @@ -26514,8 +26808,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": 5039, - "total_submitted": 11786, + "total_acs": 5050, + "total_submitted": 11811, "total_column_articles": 86, "frontend_question_id": "1599", "is_new_question": false @@ -26535,9 +26829,9 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 43146, - "total_submitted": 61920, - "total_column_articles": 546, + "total_acs": 43183, + "total_submitted": 61964, + "total_column_articles": 548, "frontend_question_id": "1598", "is_new_question": false }, @@ -26557,7 +26851,7 @@ "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, "total_acs": 546, - "total_submitted": 918, + "total_submitted": 919, "total_column_articles": 30, "frontend_question_id": "1580", "is_new_question": false @@ -26577,9 +26871,9 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 9540, - "total_submitted": 12306, - "total_column_articles": 79, + "total_acs": 9631, + "total_submitted": 12435, + "total_column_articles": 80, "frontend_question_id": "1571", "is_new_question": false }, @@ -26598,8 +26892,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": 2808, - "total_submitted": 5618, + "total_acs": 2823, + "total_submitted": 5651, "total_column_articles": 50, "frontend_question_id": "1595", "is_new_question": false @@ -26619,9 +26913,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": 5831, - "total_submitted": 17526, - "total_column_articles": 122, + "total_acs": 5847, + "total_submitted": 17570, + "total_column_articles": 124, "frontend_question_id": "1594", "is_new_question": false }, @@ -26640,9 +26934,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": 8383, - "total_submitted": 14699, - "total_column_articles": 137, + "total_acs": 8421, + "total_submitted": 14771, + "total_column_articles": 139, "frontend_question_id": "1593", "is_new_question": false }, @@ -26661,8 +26955,8 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 39640, - "total_submitted": 84250, + "total_acs": 39710, + "total_submitted": 84399, "total_column_articles": 569, "frontend_question_id": "1592", "is_new_question": false @@ -26682,8 +26976,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 3951, - "total_submitted": 4432, + "total_acs": 3961, + "total_submitted": 4444, "total_column_articles": 59, "frontend_question_id": "1570", "is_new_question": false @@ -26703,8 +26997,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 5675, - "total_submitted": 7694, + "total_acs": 5699, + "total_submitted": 7722, "total_column_articles": 54, "frontend_question_id": "1565", "is_new_question": false @@ -26724,8 +27018,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": 5624, - "total_submitted": 7390, + "total_acs": 5643, + "total_submitted": 7414, "total_column_articles": 104, "frontend_question_id": "1605", "is_new_question": false @@ -26745,8 +27039,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": 20673, - "total_submitted": 42610, + "total_acs": 20692, + "total_submitted": 42640, "total_column_articles": 199, "frontend_question_id": "1606", "is_new_question": false @@ -26766,8 +27060,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": 6016, - "total_submitted": 14173, + "total_acs": 6032, + "total_submitted": 14208, "total_column_articles": 102, "frontend_question_id": "1604", "is_new_question": false @@ -26787,9 +27081,9 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 72099, - "total_submitted": 85794, - "total_column_articles": 566, + "total_acs": 72245, + "total_submitted": 85972, + "total_column_articles": 567, "frontend_question_id": "1603", "is_new_question": false }, @@ -26808,8 +27102,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": 3100, - "total_submitted": 7167, + "total_acs": 3123, + "total_submitted": 7200, "total_column_articles": 52, "frontend_question_id": "1585", "is_new_question": false @@ -26829,9 +27123,9 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 45508, - "total_submitted": 68842, - "total_column_articles": 567, + "total_acs": 45672, + "total_submitted": 69061, + "total_column_articles": 568, "frontend_question_id": "1584", "is_new_question": false }, @@ -26850,9 +27144,9 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 20264, - "total_submitted": 29778, - "total_column_articles": 255, + "total_acs": 20283, + "total_submitted": 29805, + "total_column_articles": 256, "frontend_question_id": "1583", "is_new_question": false }, @@ -26871,9 +27165,9 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 40312, - "total_submitted": 57843, - "total_column_articles": 458, + "total_acs": 40360, + "total_submitted": 57946, + "total_column_articles": 461, "frontend_question_id": "1582", "is_new_question": false }, @@ -26892,8 +27186,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 1050, - "total_submitted": 1824, + "total_acs": 1051, + "total_submitted": 1826, "total_column_articles": 39, "frontend_question_id": "1564", "is_new_question": false @@ -26913,8 +27207,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 4908, - "total_submitted": 11026, + "total_acs": 4933, + "total_submitted": 11087, "total_column_articles": 73, "frontend_question_id": "1555", "is_new_question": false @@ -26934,9 +27228,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": 18105, - "total_submitted": 29234, - "total_column_articles": 323, + "total_acs": 18139, + "total_submitted": 29286, + "total_column_articles": 324, "frontend_question_id": "1579", "is_new_question": false }, @@ -26955,8 +27249,8 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 14492, - "total_submitted": 24285, + "total_acs": 14542, + "total_submitted": 24357, "total_column_articles": 256, "frontend_question_id": "1578", "is_new_question": false @@ -26976,8 +27270,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": 6452, - "total_submitted": 18902, + "total_acs": 6472, + "total_submitted": 18943, "total_column_articles": 106, "frontend_question_id": "1577", "is_new_question": false @@ -26997,8 +27291,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": 51552, - "total_submitted": 100851, + "total_acs": 51603, + "total_submitted": 100988, "total_column_articles": 637, "frontend_question_id": "1576", "is_new_question": false @@ -27019,7 +27313,7 @@ "question__title_slug": "strings-differ-by-one-character", "question__hide": false, "total_acs": 1159, - "total_submitted": 2241, + "total_submitted": 2242, "total_column_articles": 30, "frontend_question_id": "1554", "is_new_question": false @@ -27039,8 +27333,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 2110, - "total_submitted": 3322, + "total_acs": 2129, + "total_submitted": 3350, "total_column_articles": 62, "frontend_question_id": "1591", "is_new_question": false @@ -27060,9 +27354,9 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 5893, - "total_submitted": 18569, - "total_column_articles": 91, + "total_acs": 5918, + "total_submitted": 18616, + "total_column_articles": 92, "frontend_question_id": "1589", "is_new_question": false }, @@ -27081,8 +27375,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 5910, - "total_submitted": 20477, + "total_acs": 5942, + "total_submitted": 20606, "total_column_articles": 79, "frontend_question_id": "1590", "is_new_question": false @@ -27102,9 +27396,9 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 61534, - "total_submitted": 73653, - "total_column_articles": 938, + "total_acs": 61740, + "total_submitted": 73878, + "total_column_articles": 942, "frontend_question_id": "1588", "is_new_question": false }, @@ -27123,9 +27417,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": 2918, - "total_submitted": 6022, - "total_column_articles": 63, + "total_acs": 2947, + "total_submitted": 6057, + "total_column_articles": 64, "frontend_question_id": "1569", "is_new_question": false }, @@ -27144,8 +27438,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": 3672, - "total_submitted": 8079, + "total_acs": 3683, + "total_submitted": 8101, "total_column_articles": 75, "frontend_question_id": "1568", "is_new_question": false @@ -27165,9 +27459,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": 31750, - "total_submitted": 74645, - "total_column_articles": 433, + "total_acs": 31883, + "total_submitted": 74939, + "total_column_articles": 435, "frontend_question_id": "1567", "is_new_question": false }, @@ -27186,8 +27480,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": 11484, - "total_submitted": 25759, + "total_acs": 11584, + "total_submitted": 25975, "total_column_articles": 177, "frontend_question_id": "1566", "is_new_question": false @@ -27207,8 +27501,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": 7631, - "total_submitted": 11322, + "total_acs": 7699, + "total_submitted": 11433, "total_column_articles": 112, "frontend_question_id": "1549", "is_new_question": false @@ -27228,8 +27522,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": 574, - "total_submitted": 848, + "total_acs": 582, + "total_submitted": 857, "total_column_articles": 22, "frontend_question_id": "1548", "is_new_question": false @@ -27249,8 +27543,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 5265, - "total_submitted": 9544, + "total_acs": 5287, + "total_submitted": 9574, "total_column_articles": 54, "frontend_question_id": "1543", "is_new_question": false @@ -27270,8 +27564,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 5324, - "total_submitted": 13433, + "total_acs": 5339, + "total_submitted": 13479, "total_column_articles": 75, "frontend_question_id": "1563", "is_new_question": false @@ -27291,8 +27585,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 6369, - "total_submitted": 17889, + "total_acs": 6395, + "total_submitted": 17947, "total_column_articles": 124, "frontend_question_id": "1562", "is_new_question": false @@ -27312,8 +27606,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": 15708, - "total_submitted": 20204, + "total_acs": 15744, + "total_submitted": 20250, "total_column_articles": 239, "frontend_question_id": "1561", "is_new_question": false @@ -27333,9 +27627,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": 11230, - "total_submitted": 19559, - "total_column_articles": 126, + "total_acs": 11272, + "total_submitted": 19632, + "total_column_articles": 127, "frontend_question_id": "1560", "is_new_question": false }, @@ -27375,9 +27669,9 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 10278, - "total_submitted": 17669, - "total_column_articles": 109, + "total_acs": 10328, + "total_submitted": 17798, + "total_column_articles": 112, "frontend_question_id": "1575", "is_new_question": false }, @@ -27396,8 +27690,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": 9766, - "total_submitted": 26498, + "total_acs": 9819, + "total_submitted": 26619, "total_column_articles": 161, "frontend_question_id": "1574", "is_new_question": false @@ -27417,8 +27711,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": 6114, - "total_submitted": 19869, + "total_acs": 6126, + "total_submitted": 19913, "total_column_articles": 86, "frontend_question_id": "1573", "is_new_question": false @@ -27438,9 +27732,9 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 32571, - "total_submitted": 40403, - "total_column_articles": 533, + "total_acs": 32748, + "total_submitted": 40626, + "total_column_articles": 536, "frontend_question_id": "1572", "is_new_question": false }, @@ -27459,9 +27753,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": 10176, - "total_submitted": 31814, - "total_column_articles": 145, + "total_acs": 10234, + "total_submitted": 31967, + "total_column_articles": 147, "frontend_question_id": "1553", "is_new_question": false }, @@ -27480,9 +27774,9 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 15750, - "total_submitted": 28306, - "total_column_articles": 204, + "total_acs": 15874, + "total_submitted": 28481, + "total_column_articles": 205, "frontend_question_id": "1552", "is_new_question": false }, @@ -27501,9 +27795,9 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 14290, - "total_submitted": 17418, - "total_column_articles": 208, + "total_acs": 14363, + "total_submitted": 17500, + "total_column_articles": 210, "frontend_question_id": "1551", "is_new_question": false }, @@ -27522,8 +27816,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": 855, - "total_submitted": 1462, + "total_acs": 860, + "total_submitted": 1471, "total_column_articles": 39, "frontend_question_id": "1533", "is_new_question": false @@ -27543,9 +27837,9 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 6625, - "total_submitted": 10531, - "total_column_articles": 88, + "total_acs": 6675, + "total_submitted": 10624, + "total_column_articles": 89, "frontend_question_id": "1532", "is_new_question": false }, @@ -27564,9 +27858,9 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 42535, - "total_submitted": 89877, - "total_column_articles": 226, + "total_acs": 43099, + "total_submitted": 91095, + "total_column_articles": 228, "frontend_question_id": "1527", "is_new_question": false }, @@ -27585,9 +27879,9 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 5660, - "total_submitted": 10052, - "total_column_articles": 91, + "total_acs": 5680, + "total_submitted": 10079, + "total_column_articles": 92, "frontend_question_id": "1547", "is_new_question": false }, @@ -27606,8 +27900,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 3866, - "total_submitted": 9039, + "total_acs": 3874, + "total_submitted": 9051, "total_column_articles": 72, "frontend_question_id": "1542", "is_new_question": false @@ -27627,8 +27921,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": 13670, - "total_submitted": 23380, + "total_acs": 13715, + "total_submitted": 23446, "total_column_articles": 178, "frontend_question_id": "1545", "is_new_question": false @@ -27648,9 +27942,9 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 26937, - "total_submitted": 48288, - "total_column_articles": 434, + "total_acs": 27053, + "total_submitted": 48483, + "total_column_articles": 436, "frontend_question_id": "1544", "is_new_question": false }, @@ -27669,9 +27963,9 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 2084, - "total_submitted": 2919, - "total_column_articles": 57, + "total_acs": 2112, + "total_submitted": 2956, + "total_column_articles": 59, "frontend_question_id": "1522", "is_new_question": false }, @@ -27690,8 +27984,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 5848, - "total_submitted": 10911, + "total_acs": 5866, + "total_submitted": 10953, "total_column_articles": 48, "frontend_question_id": "1517", "is_new_question": false @@ -27711,9 +28005,9 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 6160, - "total_submitted": 15563, - "total_column_articles": 104, + "total_acs": 6198, + "total_submitted": 15654, + "total_column_articles": 107, "frontend_question_id": "1559", "is_new_question": false }, @@ -27732,8 +28026,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": 5968, - "total_submitted": 9494, + "total_acs": 5983, + "total_submitted": 9526, "total_column_articles": 95, "frontend_question_id": "1558", "is_new_question": false @@ -27753,8 +28047,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": 16148, - "total_submitted": 19957, + "total_acs": 16286, + "total_submitted": 20114, "total_column_articles": 219, "frontend_question_id": "1557", "is_new_question": false @@ -27774,9 +28068,9 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 17938, - "total_submitted": 31681, - "total_column_articles": 285, + "total_acs": 17990, + "total_submitted": 31769, + "total_column_articles": 286, "frontend_question_id": "1556", "is_new_question": false }, @@ -27795,8 +28089,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 6297, - "total_submitted": 16049, + "total_acs": 6318, + "total_submitted": 16090, "total_column_articles": 124, "frontend_question_id": "1537", "is_new_question": false @@ -27816,8 +28110,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": 5056, - "total_submitted": 11075, + "total_acs": 5072, + "total_submitted": 11098, "total_column_articles": 96, "frontend_question_id": "1536", "is_new_question": false @@ -27837,9 +28131,9 @@ "question__title": "Find the Winner of an Array Game", "question__title_slug": "find-the-winner-of-an-array-game", "question__hide": false, - "total_acs": 16136, - "total_submitted": 34985, - "total_column_articles": 217, + "total_acs": 16155, + "total_submitted": 35104, + "total_column_articles": 218, "frontend_question_id": "1535", "is_new_question": false }, @@ -27858,8 +28152,8 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 23861, - "total_submitted": 30624, + "total_acs": 23960, + "total_submitted": 30824, "total_column_articles": 228, "frontend_question_id": "1534", "is_new_question": false @@ -27900,8 +28194,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 7517, - "total_submitted": 10938, + "total_acs": 7544, + "total_submitted": 10974, "total_column_articles": 92, "frontend_question_id": "1511", "is_new_question": false @@ -27921,9 +28215,9 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 10892, - "total_submitted": 18724, - "total_column_articles": 194, + "total_acs": 10909, + "total_submitted": 18753, + "total_column_articles": 195, "frontend_question_id": "1530", "is_new_question": false }, @@ -27942,8 +28236,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 11011, - "total_submitted": 15680, + "total_acs": 11031, + "total_submitted": 15706, "total_column_articles": 177, "frontend_question_id": "1529", "is_new_question": false @@ -27963,9 +28257,9 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 37160, - "total_submitted": 47370, - "total_column_articles": 466, + "total_acs": 37238, + "total_submitted": 47469, + "total_column_articles": 467, "frontend_question_id": "1528", "is_new_question": false }, @@ -27984,9 +28278,9 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 987, - "total_submitted": 1209, - "total_column_articles": 28, + "total_acs": 995, + "total_submitted": 1222, + "total_column_articles": 29, "frontend_question_id": "1506", "is_new_question": false }, @@ -28005,9 +28299,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": 6868, - "total_submitted": 15605, - "total_column_articles": 106, + "total_acs": 6898, + "total_submitted": 15653, + "total_column_articles": 107, "frontend_question_id": "1546", "is_new_question": false }, @@ -28026,8 +28320,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": 16342, - "total_submitted": 33599, + "total_acs": 16419, + "total_submitted": 33771, "total_column_articles": 207, "frontend_question_id": "1541", "is_new_question": false @@ -28047,8 +28341,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 6290, - "total_submitted": 19037, + "total_acs": 6302, + "total_submitted": 19069, "total_column_articles": 106, "frontend_question_id": "1540", "is_new_question": false @@ -28068,9 +28362,9 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 36905, - "total_submitted": 68284, - "total_column_articles": 515, + "total_acs": 37122, + "total_submitted": 68651, + "total_column_articles": 517, "frontend_question_id": "1539", "is_new_question": false }, @@ -28089,8 +28383,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": 3763, - "total_submitted": 8810, + "total_acs": 3773, + "total_submitted": 8835, "total_column_articles": 76, "frontend_question_id": "1521", "is_new_question": false @@ -28110,8 +28404,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 3152, - "total_submitted": 8971, + "total_acs": 3159, + "total_submitted": 8982, "total_column_articles": 84, "frontend_question_id": "1520", "is_new_question": false @@ -28131,9 +28425,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": 6994, - "total_submitted": 21480, - "total_column_articles": 146, + "total_acs": 7021, + "total_submitted": 21533, + "total_column_articles": 147, "frontend_question_id": "1519", "is_new_question": false }, @@ -28152,8 +28446,8 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 59984, - "total_submitted": 86075, + "total_acs": 60042, + "total_submitted": 86158, "total_column_articles": 896, "frontend_question_id": "1518", "is_new_question": false @@ -28173,8 +28467,8 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 11077, - "total_submitted": 18246, + "total_acs": 11169, + "total_submitted": 18419, "total_column_articles": 133, "frontend_question_id": "1501", "is_new_question": false @@ -28194,8 +28488,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 1840, - "total_submitted": 6231, + "total_acs": 1841, + "total_submitted": 6235, "total_column_articles": 49, "frontend_question_id": "1500", "is_new_question": false @@ -28215,8 +28509,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 6590, - "total_submitted": 12379, + "total_acs": 6609, + "total_submitted": 12409, "total_column_articles": 47, "frontend_question_id": "1495", "is_new_question": false @@ -28236,8 +28530,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 4249, - "total_submitted": 12047, + "total_acs": 4256, + "total_submitted": 12057, "total_column_articles": 71, "frontend_question_id": "1515", "is_new_question": false @@ -28257,8 +28551,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 2705, - "total_submitted": 7196, + "total_acs": 2719, + "total_submitted": 7228, "total_column_articles": 47, "frontend_question_id": "1531", "is_new_question": false @@ -28278,9 +28572,9 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 13648, - "total_submitted": 34781, - "total_column_articles": 193, + "total_acs": 13687, + "total_submitted": 34845, + "total_column_articles": 195, "frontend_question_id": "1513", "is_new_question": false }, @@ -28299,9 +28593,9 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 71601, - "total_submitted": 84662, - "total_column_articles": 922, + "total_acs": 71784, + "total_submitted": 84902, + "total_column_articles": 924, "frontend_question_id": "1512", "is_new_question": false }, @@ -28320,8 +28614,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 1800, - "total_submitted": 2147, + "total_acs": 1805, + "total_submitted": 2155, "total_column_articles": 46, "frontend_question_id": "1490", "is_new_question": false @@ -28341,8 +28635,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": 4649, - "total_submitted": 7258, + "total_acs": 4665, + "total_submitted": 7276, "total_column_articles": 83, "frontend_question_id": "1526", "is_new_question": false @@ -28362,8 +28656,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": 7871, - "total_submitted": 11906, + "total_acs": 7899, + "total_submitted": 11942, "total_column_articles": 147, "frontend_question_id": "1525", "is_new_question": false @@ -28383,8 +28677,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": 8670, - "total_submitted": 19120, + "total_acs": 8710, + "total_submitted": 19182, "total_column_articles": 153, "frontend_question_id": "1524", "is_new_question": false @@ -28404,9 +28698,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": 41119, - "total_submitted": 82803, - "total_column_articles": 622, + "total_acs": 41576, + "total_submitted": 83673, + "total_column_articles": 631, "frontend_question_id": "1523", "is_new_question": false }, @@ -28425,8 +28719,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": 4286, - "total_submitted": 11079, + "total_acs": 4307, + "total_submitted": 11120, "total_column_articles": 88, "frontend_question_id": "1505", "is_new_question": false @@ -28446,8 +28740,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 10826, - "total_submitted": 17483, + "total_acs": 10860, + "total_submitted": 17523, "total_column_articles": 170, "frontend_question_id": "1504", "is_new_question": false @@ -28467,8 +28761,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": 11060, - "total_submitted": 20813, + "total_acs": 11085, + "total_submitted": 20864, "total_column_articles": 113, "frontend_question_id": "1503", "is_new_question": false @@ -28488,9 +28782,9 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 41794, - "total_submitted": 59816, - "total_column_articles": 545, + "total_acs": 42048, + "total_submitted": 60158, + "total_column_articles": 551, "frontend_question_id": "1502", "is_new_question": false }, @@ -28509,9 +28803,9 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 42677, - "total_submitted": 62749, - "total_column_articles": 247, + "total_acs": 43238, + "total_submitted": 63556, + "total_column_articles": 251, "frontend_question_id": "1484", "is_new_question": false }, @@ -28530,8 +28824,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 1340, - "total_submitted": 1715, + "total_acs": 1346, + "total_submitted": 1722, "total_column_articles": 39, "frontend_question_id": "1485", "is_new_question": false @@ -28551,8 +28845,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 3532, - "total_submitted": 6343, + "total_acs": 3549, + "total_submitted": 6385, "total_column_articles": 59, "frontend_question_id": "1479", "is_new_question": false @@ -28572,9 +28866,9 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 4394, - "total_submitted": 10869, - "total_column_articles": 88, + "total_acs": 4410, + "total_submitted": 10905, + "total_column_articles": 89, "frontend_question_id": "1499", "is_new_question": false }, @@ -28593,8 +28887,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": 9117, - "total_submitted": 24296, + "total_acs": 9168, + "total_submitted": 24407, "total_column_articles": 124, "frontend_question_id": "1498", "is_new_question": false @@ -28614,8 +28908,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": 12083, - "total_submitted": 30135, + "total_acs": 12118, + "total_submitted": 30219, "total_column_articles": 145, "frontend_question_id": "1497", "is_new_question": false @@ -28635,9 +28929,9 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 15393, - "total_submitted": 28787, - "total_column_articles": 238, + "total_acs": 15465, + "total_submitted": 28920, + "total_column_articles": 240, "frontend_question_id": "1496", "is_new_question": false }, @@ -28656,8 +28950,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": 3014, - "total_submitted": 4307, + "total_acs": 3022, + "total_submitted": 4317, "total_column_articles": 98, "frontend_question_id": "1474", "is_new_question": false @@ -28677,9 +28971,9 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 7658, - "total_submitted": 12828, - "total_column_articles": 98, + "total_acs": 7696, + "total_submitted": 12887, + "total_column_articles": 100, "frontend_question_id": "1510", "is_new_question": false }, @@ -28698,8 +28992,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": 7458, - "total_submitted": 13510, + "total_acs": 7472, + "total_submitted": 13532, "total_column_articles": 129, "frontend_question_id": "1509", "is_new_question": false @@ -28719,8 +29013,8 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 9968, - "total_submitted": 17384, + "total_acs": 10051, + "total_submitted": 17500, "total_column_articles": 107, "frontend_question_id": "1508", "is_new_question": false @@ -28740,8 +29034,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": 13059, - "total_submitted": 19450, + "total_acs": 13084, + "total_submitted": 19484, "total_column_articles": 147, "frontend_question_id": "1489", "is_new_question": false @@ -28761,8 +29055,8 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 11560, - "total_submitted": 44308, + "total_acs": 11620, + "total_submitted": 44450, "total_column_articles": 166, "frontend_question_id": "1488", "is_new_question": false @@ -28782,8 +29076,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 10601, - "total_submitted": 32291, + "total_acs": 10622, + "total_submitted": 32335, "total_column_articles": 134, "frontend_question_id": "1487", "is_new_question": false @@ -28803,9 +29097,9 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 80141, - "total_submitted": 93509, - "total_column_articles": 777, + "total_acs": 80228, + "total_submitted": 93602, + "total_column_articles": 778, "frontend_question_id": "1486", "is_new_question": false }, @@ -28824,8 +29118,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 4660, - "total_submitted": 5694, + "total_acs": 4690, + "total_submitted": 5728, "total_column_articles": 133, "frontend_question_id": "1469", "is_new_question": false @@ -28845,8 +29139,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 5048, - "total_submitted": 7209, + "total_acs": 5074, + "total_submitted": 7245, "total_column_articles": 64, "frontend_question_id": "1468", "is_new_question": false @@ -28866,8 +29160,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 5418, - "total_submitted": 8598, + "total_acs": 5464, + "total_submitted": 8677, "total_column_articles": 89, "frontend_question_id": "1459", "is_new_question": false @@ -28887,8 +29181,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": 39393, - "total_submitted": 68088, + "total_acs": 39499, + "total_submitted": 68320, "total_column_articles": 494, "frontend_question_id": "1482", "is_new_question": false @@ -28908,9 +29202,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": 17449, - "total_submitted": 37742, - "total_column_articles": 230, + "total_acs": 17528, + "total_submitted": 37940, + "total_column_articles": 231, "frontend_question_id": "1481", "is_new_question": false }, @@ -28929,9 +29223,9 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 264653, - "total_submitted": 335873, - "total_column_articles": 2170, + "total_acs": 266857, + "total_submitted": 339189, + "total_column_articles": 2183, "frontend_question_id": "1480", "is_new_question": false }, @@ -28950,8 +29244,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 4074, - "total_submitted": 10086, + "total_acs": 4095, + "total_submitted": 10127, "total_column_articles": 57, "frontend_question_id": "1494", "is_new_question": false @@ -28971,9 +29265,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": 14866, - "total_submitted": 25242, - "total_column_articles": 260, + "total_acs": 14951, + "total_submitted": 25385, + "total_column_articles": 261, "frontend_question_id": "1493", "is_new_question": false }, @@ -28992,9 +29286,9 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 13683, - "total_submitted": 22352, - "total_column_articles": 144, + "total_acs": 13739, + "total_submitted": 22468, + "total_column_articles": 146, "frontend_question_id": "1492", "is_new_question": false }, @@ -29013,9 +29307,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": 46177, - "total_submitted": 72821, - "total_column_articles": 642, + "total_acs": 46616, + "total_submitted": 73507, + "total_column_articles": 647, "frontend_question_id": "1491", "is_new_question": false }, @@ -29034,9 +29328,9 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 17083, - "total_submitted": 25705, - "total_column_articles": 183, + "total_acs": 17090, + "total_submitted": 25714, + "total_column_articles": 184, "frontend_question_id": "1473", "is_new_question": false }, @@ -29055,8 +29349,8 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 15167, - "total_submitted": 24756, + "total_acs": 15230, + "total_submitted": 24865, "total_column_articles": 240, "frontend_question_id": "1472", "is_new_question": false @@ -29076,8 +29370,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": 9341, - "total_submitted": 16937, + "total_acs": 9361, + "total_submitted": 16971, "total_column_articles": 138, "frontend_question_id": "1471", "is_new_question": false @@ -29097,9 +29391,9 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 97046, - "total_submitted": 113883, - "total_column_articles": 1121, + "total_acs": 97160, + "total_submitted": 114021, + "total_column_articles": 1123, "frontend_question_id": "1470", "is_new_question": false }, @@ -29118,8 +29412,8 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 9484, - "total_submitted": 24162, + "total_acs": 9528, + "total_submitted": 24285, "total_column_articles": 122, "frontend_question_id": "1454", "is_new_question": false @@ -29139,9 +29433,9 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 10793, - "total_submitted": 12711, - "total_column_articles": 109, + "total_acs": 10902, + "total_submitted": 12852, + "total_column_articles": 111, "frontend_question_id": "1445", "is_new_question": false }, @@ -29160,8 +29454,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": 2303, - "total_submitted": 3655, + "total_acs": 2321, + "total_submitted": 3685, "total_column_articles": 63, "frontend_question_id": "1467", "is_new_question": false @@ -29181,9 +29475,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": 10370, - "total_submitted": 20509, - "total_column_articles": 206, + "total_acs": 10426, + "total_submitted": 20604, + "total_column_articles": 207, "frontend_question_id": "1466", "is_new_question": false }, @@ -29202,8 +29496,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": 8557, - "total_submitted": 26352, + "total_acs": 8577, + "total_submitted": 26399, "total_column_articles": 104, "frontend_question_id": "1465", "is_new_question": false @@ -29223,9 +29517,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": 72097, - "total_submitted": 91425, - "total_column_articles": 831, + "total_acs": 72233, + "total_submitted": 91585, + "total_column_articles": 834, "frontend_question_id": "1464", "is_new_question": false }, @@ -29244,8 +29538,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": 8094, - "total_submitted": 26388, + "total_acs": 8118, + "total_submitted": 26433, "total_column_articles": 137, "frontend_question_id": "1477", "is_new_question": false @@ -29265,8 +29559,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 15305, - "total_submitted": 17682, + "total_acs": 15335, + "total_submitted": 17714, "total_column_articles": 143, "frontend_question_id": "1476", "is_new_question": false @@ -29286,9 +29580,9 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 5054, - "total_submitted": 8122, - "total_column_articles": 89, + "total_acs": 5082, + "total_submitted": 8158, + "total_column_articles": 91, "frontend_question_id": "1478", "is_new_question": false }, @@ -29307,9 +29601,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": 64555, - "total_submitted": 87950, - "total_column_articles": 827, + "total_acs": 64684, + "total_submitted": 88108, + "total_column_articles": 831, "frontend_question_id": "1475", "is_new_question": false }, @@ -29328,9 +29622,9 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 7052, - "total_submitted": 15352, - "total_column_articles": 113, + "total_acs": 7074, + "total_submitted": 15389, + "total_column_articles": 114, "frontend_question_id": "1458", "is_new_question": false }, @@ -29349,9 +29643,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": 10817, - "total_submitted": 17319, - "total_column_articles": 181, + "total_acs": 10851, + "total_submitted": 17372, + "total_column_articles": 182, "frontend_question_id": "1457", "is_new_question": false }, @@ -29370,9 +29664,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": 23502, - "total_submitted": 44092, - "total_column_articles": 323, + "total_acs": 23567, + "total_submitted": 44200, + "total_column_articles": 325, "frontend_question_id": "1456", "is_new_question": false }, @@ -29391,9 +29685,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": 40299, - "total_submitted": 61904, - "total_column_articles": 678, + "total_acs": 40369, + "total_submitted": 62037, + "total_column_articles": 679, "frontend_question_id": "1455", "is_new_question": false }, @@ -29412,8 +29706,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 6987, - "total_submitted": 9929, + "total_acs": 7059, + "total_submitted": 10048, "total_column_articles": 77, "frontend_question_id": "1440", "is_new_question": false @@ -29433,8 +29727,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 6615, - "total_submitted": 10447, + "total_acs": 6636, + "total_submitted": 10480, "total_column_articles": 57, "frontend_question_id": "1435", "is_new_question": false @@ -29454,8 +29748,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": 2120, - "total_submitted": 5653, + "total_acs": 2125, + "total_submitted": 5664, "total_column_articles": 38, "frontend_question_id": "1453", "is_new_question": false @@ -29475,9 +29769,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": 7590, - "total_submitted": 14939, - "total_column_articles": 117, + "total_acs": 7604, + "total_submitted": 14960, + "total_column_articles": 118, "frontend_question_id": "1452", "is_new_question": false }, @@ -29496,9 +29790,9 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 13266, - "total_submitted": 24710, - "total_column_articles": 203, + "total_acs": 13301, + "total_submitted": 24772, + "total_column_articles": 204, "frontend_question_id": "1451", "is_new_question": false }, @@ -29517,9 +29811,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": 58790, - "total_submitted": 71302, - "total_column_articles": 672, + "total_acs": 58864, + "total_submitted": 71400, + "total_column_articles": 675, "frontend_question_id": "1450", "is_new_question": false }, @@ -29538,8 +29832,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 4237, - "total_submitted": 6877, + "total_acs": 4259, + "total_submitted": 6902, "total_column_articles": 96, "frontend_question_id": "1463", "is_new_question": false @@ -29559,8 +29853,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 11264, - "total_submitted": 24796, + "total_acs": 11290, + "total_submitted": 24837, "total_column_articles": 207, "frontend_question_id": "1462", "is_new_question": false @@ -29580,9 +29874,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": 8938, - "total_submitted": 17120, - "total_column_articles": 125, + "total_acs": 8965, + "total_submitted": 17169, + "total_column_articles": 126, "frontend_question_id": "1461", "is_new_question": false }, @@ -29601,9 +29895,9 @@ "question__title": "Make Two Arrays Equal by Reversing Subarrays", "question__title_slug": "make-two-arrays-equal-by-reversing-subarrays", "question__hide": false, - "total_acs": 52256, - "total_submitted": 67588, - "total_column_articles": 738, + "total_acs": 52330, + "total_submitted": 67676, + "total_column_articles": 739, "frontend_question_id": "1460", "is_new_question": false }, @@ -29622,8 +29916,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": 4826, - "total_submitted": 8692, + "total_acs": 4871, + "total_submitted": 8765, "total_column_articles": 90, "frontend_question_id": "1444", "is_new_question": false @@ -29643,8 +29937,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": 7477, - "total_submitted": 17465, + "total_acs": 7499, + "total_submitted": 17502, "total_column_articles": 178, "frontend_question_id": "1443", "is_new_question": false @@ -29664,8 +29958,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": 38192, - "total_submitted": 48161, + "total_acs": 38233, + "total_submitted": 48207, "total_column_articles": 411, "frontend_question_id": "1442", "is_new_question": false @@ -29685,9 +29979,9 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 47708, - "total_submitted": 66688, - "total_column_articles": 888, + "total_acs": 47779, + "total_submitted": 66783, + "total_column_articles": 889, "frontend_question_id": "1441", "is_new_question": false }, @@ -29706,8 +30000,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 5511, - "total_submitted": 7763, + "total_acs": 5535, + "total_submitted": 7792, "total_column_articles": 47, "frontend_question_id": "1421", "is_new_question": false @@ -29727,8 +30021,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": 7136, - "total_submitted": 12586, + "total_acs": 7150, + "total_submitted": 12602, "total_column_articles": 96, "frontend_question_id": "1439", "is_new_question": false @@ -29748,9 +30042,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": 42970, - "total_submitted": 86940, - "total_column_articles": 565, + "total_acs": 43088, + "total_submitted": 87164, + "total_column_articles": 566, "frontend_question_id": "1438", "is_new_question": false }, @@ -29769,9 +30063,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": 15417, - "total_submitted": 27506, - "total_column_articles": 246, + "total_acs": 15466, + "total_submitted": 27596, + "total_column_articles": 250, "frontend_question_id": "1437", "is_new_question": false }, @@ -29790,9 +30084,9 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 51752, - "total_submitted": 63178, - "total_column_articles": 753, + "total_acs": 51826, + "total_submitted": 63267, + "total_column_articles": 754, "frontend_question_id": "1436", "is_new_question": false }, @@ -29811,9 +30105,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": 5766, - "total_submitted": 10464, - "total_column_articles": 110, + "total_acs": 5810, + "total_submitted": 10567, + "total_column_articles": 112, "frontend_question_id": "1412", "is_new_question": false }, @@ -29832,8 +30126,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": 18594, - "total_submitted": 29774, + "total_acs": 18609, + "total_submitted": 29797, "total_column_articles": 226, "frontend_question_id": "1449", "is_new_question": false @@ -29853,9 +30147,9 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 17565, - "total_submitted": 24416, - "total_column_articles": 284, + "total_acs": 17606, + "total_submitted": 24466, + "total_column_articles": 286, "frontend_question_id": "1448", "is_new_question": false }, @@ -29874,8 +30168,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 40936, - "total_submitted": 60568, + "total_acs": 40983, + "total_submitted": 60636, "total_column_articles": 526, "frontend_question_id": "1447", "is_new_question": false @@ -29895,9 +30189,9 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 57597, - "total_submitted": 95053, - "total_column_articles": 778, + "total_acs": 57705, + "total_submitted": 95345, + "total_column_articles": 780, "frontend_question_id": "1446", "is_new_question": false }, @@ -29916,9 +30210,9 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 27993, - "total_submitted": 47808, - "total_column_articles": 230, + "total_acs": 28299, + "total_submitted": 48347, + "total_column_articles": 234, "frontend_question_id": "1407", "is_new_question": false }, @@ -29937,8 +30231,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 9766, - "total_submitted": 23197, + "total_acs": 9790, + "total_submitted": 23238, "total_column_articles": 204, "frontend_question_id": "1424", "is_new_question": false @@ -29958,8 +30252,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": 45317, - "total_submitted": 82153, + "total_acs": 45404, + "total_submitted": 82293, "total_column_articles": 638, "frontend_question_id": "1423", "is_new_question": false @@ -29979,8 +30273,8 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 40235, - "total_submitted": 70827, + "total_acs": 40318, + "total_submitted": 70966, "total_column_articles": 674, "frontend_question_id": "1422", "is_new_question": false @@ -30000,9 +30294,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": 10008, - "total_submitted": 13658, - "total_column_articles": 126, + "total_acs": 10108, + "total_submitted": 13800, + "total_column_articles": 127, "frontend_question_id": "1398", "is_new_question": false }, @@ -30021,9 +30315,9 @@ "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": 3471, - "total_submitted": 5525, - "total_column_articles": 63, + "total_acs": 3492, + "total_submitted": 5549, + "total_column_articles": 64, "frontend_question_id": "1420", "is_new_question": false }, @@ -30042,8 +30336,8 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 10962, - "total_submitted": 25328, + "total_acs": 11015, + "total_submitted": 25424, "total_column_articles": 205, "frontend_question_id": "1419", "is_new_question": false @@ -30063,8 +30357,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": 28556, - "total_submitted": 39057, + "total_acs": 28566, + "total_submitted": 39067, "total_column_articles": 452, "frontend_question_id": "1418", "is_new_question": false @@ -30084,8 +30378,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 45757, - "total_submitted": 82524, + "total_acs": 45829, + "total_submitted": 82670, "total_column_articles": 612, "frontend_question_id": "1417", "is_new_question": false @@ -30105,9 +30399,9 @@ "question__title": "Number of Ways to Wear Different Hats to Each Other", "question__title_slug": "number-of-ways-to-wear-different-hats-to-each-other", "question__hide": false, - "total_acs": 3763, - "total_submitted": 7429, - "total_column_articles": 63, + "total_acs": 3784, + "total_submitted": 7464, + "total_column_articles": 65, "frontend_question_id": "1434", "is_new_question": false }, @@ -30126,8 +30420,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": 7959, - "total_submitted": 12326, + "total_acs": 7977, + "total_submitted": 12347, "total_column_articles": 145, "frontend_question_id": "1433", "is_new_question": false @@ -30147,8 +30441,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": 5961, - "total_submitted": 14965, + "total_acs": 5975, + "total_submitted": 15003, "total_column_articles": 133, "frontend_question_id": "1432", "is_new_question": false @@ -30168,9 +30462,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": 87215, - "total_submitted": 103266, - "total_column_articles": 1154, + "total_acs": 87299, + "total_submitted": 103365, + "total_column_articles": 1153, "frontend_question_id": "1431", "is_new_question": false }, @@ -30189,8 +30483,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": 9475, - "total_submitted": 16718, + "total_acs": 9496, + "total_submitted": 16743, "total_column_articles": 164, "frontend_question_id": "1411", "is_new_question": false @@ -30210,8 +30504,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 9021, - "total_submitted": 19112, + "total_acs": 9041, + "total_submitted": 19165, "total_column_articles": 138, "frontend_question_id": "1410", "is_new_question": false @@ -30231,8 +30525,8 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 10616, - "total_submitted": 13049, + "total_acs": 10650, + "total_submitted": 13084, "total_column_articles": 187, "frontend_question_id": "1409", "is_new_question": false @@ -30252,8 +30546,8 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 43591, - "total_submitted": 67530, + "total_acs": 43648, + "total_submitted": 67614, "total_column_articles": 549, "frontend_question_id": "1408", "is_new_question": false @@ -30273,9 +30567,9 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 23996, - "total_submitted": 28467, - "total_column_articles": 220, + "total_acs": 24303, + "total_submitted": 28845, + "total_column_articles": 225, "frontend_question_id": "1393", "is_new_question": false }, @@ -30294,9 +30588,9 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 7150, - "total_submitted": 12113, - "total_column_articles": 106, + "total_acs": 7191, + "total_submitted": 12185, + "total_column_articles": 109, "frontend_question_id": "1406", "is_new_question": false }, @@ -30315,8 +30609,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": 9377, - "total_submitted": 18528, + "total_acs": 9397, + "total_submitted": 18558, "total_column_articles": 187, "frontend_question_id": "1404", "is_new_question": false @@ -30336,8 +30630,8 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 54646, - "total_submitted": 74344, + "total_acs": 54717, + "total_submitted": 74440, "total_column_articles": 744, "frontend_question_id": "1403", "is_new_question": false @@ -30357,8 +30651,8 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 4389, - "total_submitted": 7541, + "total_acs": 4420, + "total_submitted": 7584, "total_column_articles": 91, "frontend_question_id": "1384", "is_new_question": false @@ -30378,8 +30672,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 3830, - "total_submitted": 9058, + "total_acs": 3843, + "total_submitted": 9087, "total_column_articles": 73, "frontend_question_id": "1416", "is_new_question": false @@ -30399,8 +30693,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": 8548, - "total_submitted": 12496, + "total_acs": 8568, + "total_submitted": 12521, "total_column_articles": 229, "frontend_question_id": "1415", "is_new_question": false @@ -30420,8 +30714,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": 29778, - "total_submitted": 42262, + "total_acs": 29800, + "total_submitted": 42289, "total_column_articles": 452, "frontend_question_id": "1414", "is_new_question": false @@ -30441,8 +30735,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": 45409, - "total_submitted": 61998, + "total_acs": 45480, + "total_submitted": 62092, "total_column_articles": 685, "frontend_question_id": "1413", "is_new_question": false @@ -30462,8 +30756,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 1784, - "total_submitted": 4125, + "total_acs": 1794, + "total_submitted": 4147, "total_column_articles": 58, "frontend_question_id": "1397", "is_new_question": false @@ -30483,8 +30777,8 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 19609, - "total_submitted": 47133, + "total_acs": 19642, + "total_submitted": 47198, "total_column_articles": 252, "frontend_question_id": "1396", "is_new_question": false @@ -30504,8 +30798,8 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 18750, - "total_submitted": 26051, + "total_acs": 18804, + "total_submitted": 26132, "total_column_articles": 277, "frontend_question_id": "1395", "is_new_question": false @@ -30525,9 +30819,9 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 24182, - "total_submitted": 36935, - "total_column_articles": 406, + "total_acs": 24322, + "total_submitted": 37107, + "total_column_articles": 407, "frontend_question_id": "1394", "is_new_question": false }, @@ -30546,8 +30840,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": 10258, - "total_submitted": 11802, + "total_acs": 10278, + "total_submitted": 11822, "total_column_articles": 76, "frontend_question_id": "1378", "is_new_question": false @@ -30567,9 +30861,9 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 13076, - "total_submitted": 29689, - "total_column_articles": 214, + "total_acs": 13108, + "total_submitted": 29745, + "total_column_articles": 218, "frontend_question_id": "1392", "is_new_question": false }, @@ -30588,8 +30882,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": 8358, - "total_submitted": 20129, + "total_acs": 8385, + "total_submitted": 20161, "total_column_articles": 262, "frontend_question_id": "1391", "is_new_question": false @@ -30609,8 +30903,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": 33949, - "total_submitted": 40830, + "total_acs": 34022, + "total_submitted": 40910, "total_column_articles": 564, "frontend_question_id": "1389", "is_new_question": false @@ -30630,8 +30924,8 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 5770, - "total_submitted": 9274, + "total_acs": 5819, + "total_submitted": 9382, "total_column_articles": 78, "frontend_question_id": "1369", "is_new_question": false @@ -30651,9 +30945,9 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 13610, - "total_submitted": 17862, - "total_column_articles": 232, + "total_acs": 13649, + "total_submitted": 17915, + "total_column_articles": 233, "frontend_question_id": "1402", "is_new_question": false }, @@ -30672,8 +30966,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 8920, - "total_submitted": 14559, + "total_acs": 8941, + "total_submitted": 14592, "total_column_articles": 151, "frontend_question_id": "1400", "is_new_question": false @@ -30693,8 +30987,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 5734, - "total_submitted": 13325, + "total_acs": 5755, + "total_submitted": 13358, "total_column_articles": 124, "frontend_question_id": "1401", "is_new_question": false @@ -30714,8 +31008,8 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 13076, - "total_submitted": 19418, + "total_acs": 13116, + "total_submitted": 19476, "total_column_articles": 206, "frontend_question_id": "1399", "is_new_question": false @@ -30735,9 +31029,9 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 6122, - "total_submitted": 17664, - "total_column_articles": 120, + "total_acs": 6176, + "total_submitted": 17770, + "total_column_articles": 123, "frontend_question_id": "1383", "is_new_question": false }, @@ -30756,8 +31050,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": 15781, - "total_submitted": 18819, + "total_acs": 15861, + "total_submitted": 18926, "total_column_articles": 226, "frontend_question_id": "1379", "is_new_question": false @@ -30777,8 +31071,8 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 16990, - "total_submitted": 23412, + "total_acs": 17047, + "total_submitted": 23494, "total_column_articles": 222, "frontend_question_id": "1381", "is_new_question": false @@ -30798,8 +31092,8 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 54826, - "total_submitted": 71483, + "total_acs": 54888, + "total_submitted": 71575, "total_column_articles": 741, "frontend_question_id": "1380", "is_new_question": false @@ -30819,9 +31113,9 @@ "question__title": "Number of Trusted Contacts of a Customer", "question__title_slug": "number-of-trusted-contacts-of-a-customer", "question__hide": false, - "total_acs": 5638, - "total_submitted": 8244, - "total_column_articles": 84, + "total_acs": 5663, + "total_submitted": 8276, + "total_column_articles": 85, "frontend_question_id": "1364", "is_new_question": false }, @@ -30840,9 +31134,9 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 6546, - "total_submitted": 9820, - "total_column_articles": 82, + "total_acs": 6572, + "total_submitted": 9860, + "total_column_articles": 83, "frontend_question_id": "1355", "is_new_question": false }, @@ -30861,8 +31155,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 5696, - "total_submitted": 16904, + "total_acs": 5713, + "total_submitted": 16939, "total_column_articles": 159, "frontend_question_id": "1377", "is_new_question": false @@ -30882,8 +31176,8 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 14806, - "total_submitted": 27169, + "total_acs": 14908, + "total_submitted": 27335, "total_column_articles": 288, "frontend_question_id": "1376", "is_new_question": false @@ -30903,8 +31197,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": 10461, - "total_submitted": 17658, + "total_acs": 10479, + "total_submitted": 17678, "total_column_articles": 206, "frontend_question_id": "1375", "is_new_question": false @@ -30924,8 +31218,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": 52531, - "total_submitted": 67601, + "total_acs": 52591, + "total_submitted": 67679, "total_column_articles": 541, "frontend_question_id": "1374", "is_new_question": false @@ -30945,8 +31239,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 6578, - "total_submitted": 11623, + "total_acs": 6597, + "total_submitted": 11649, "total_column_articles": 72, "frontend_question_id": "1388", "is_new_question": false @@ -30966,9 +31260,9 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 14335, - "total_submitted": 20614, - "total_column_articles": 255, + "total_acs": 14375, + "total_submitted": 20663, + "total_column_articles": 256, "frontend_question_id": "1387", "is_new_question": false }, @@ -30987,8 +31281,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 9363, - "total_submitted": 27000, + "total_acs": 9382, + "total_submitted": 27036, "total_column_articles": 167, "frontend_question_id": "1386", "is_new_question": false @@ -31008,9 +31302,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": 36030, - "total_submitted": 55930, - "total_column_articles": 475, + "total_acs": 36249, + "total_submitted": 56263, + "total_column_articles": 478, "frontend_question_id": "1385", "is_new_question": false }, @@ -31029,9 +31323,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": 7041, - "total_submitted": 11958, - "total_column_articles": 141, + "total_acs": 7093, + "total_submitted": 12025, + "total_column_articles": 142, "frontend_question_id": "1368", "is_new_question": false }, @@ -31050,9 +31344,9 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 22378, - "total_submitted": 51561, - "total_column_articles": 340, + "total_acs": 22497, + "total_submitted": 51797, + "total_column_articles": 341, "frontend_question_id": "1367", "is_new_question": false }, @@ -31071,8 +31365,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 11370, - "total_submitted": 22246, + "total_acs": 11393, + "total_submitted": 22307, "total_column_articles": 205, "frontend_question_id": "1366", "is_new_question": false @@ -31092,8 +31386,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": 107661, - "total_submitted": 130636, + "total_acs": 107917, + "total_submitted": 130947, "total_column_articles": 1277, "frontend_question_id": "1365", "is_new_question": false @@ -31113,8 +31407,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 11813, - "total_submitted": 13943, + "total_acs": 11843, + "total_submitted": 13975, "total_column_articles": 103, "frontend_question_id": "1350", "is_new_question": false @@ -31134,8 +31428,8 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 6983, - "total_submitted": 16900, + "total_acs": 7032, + "total_submitted": 17011, "total_column_articles": 93, "frontend_question_id": "1341", "is_new_question": false @@ -31155,8 +31449,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 3992, - "total_submitted": 13813, + "total_acs": 4003, + "total_submitted": 13850, "total_column_articles": 90, "frontend_question_id": "1354", "is_new_question": false @@ -31176,8 +31470,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": 17425, - "total_submitted": 59110, + "total_acs": 17486, + "total_submitted": 59274, "total_column_articles": 207, "frontend_question_id": "1353", "is_new_question": false @@ -31197,9 +31491,9 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 10867, - "total_submitted": 22880, - "total_column_articles": 120, + "total_acs": 10921, + "total_submitted": 22977, + "total_column_articles": 121, "frontend_question_id": "1352", "is_new_question": false }, @@ -31218,9 +31512,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": 46828, - "total_submitted": 62768, - "total_column_articles": 742, + "total_acs": 47005, + "total_submitted": 62997, + "total_column_articles": 743, "frontend_question_id": "1351", "is_new_question": false }, @@ -31239,9 +31533,9 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 17777, - "total_submitted": 41437, - "total_column_articles": 315, + "total_acs": 17850, + "total_submitted": 41569, + "total_column_articles": 316, "frontend_question_id": "1373", "is_new_question": false }, @@ -31260,8 +31554,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": 13459, - "total_submitted": 24670, + "total_acs": 13521, + "total_submitted": 24795, "total_column_articles": 232, "frontend_question_id": "1372", "is_new_question": false @@ -31281,8 +31575,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": 25720, - "total_submitted": 43699, + "total_acs": 25756, + "total_submitted": 43749, "total_column_articles": 320, "frontend_question_id": "1371", "is_new_question": false @@ -31302,8 +31596,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 53417, - "total_submitted": 67618, + "total_acs": 53487, + "total_submitted": 67707, "total_column_articles": 656, "frontend_question_id": "1370", "is_new_question": false @@ -31323,9 +31617,9 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 5364, - "total_submitted": 10031, - "total_column_articles": 127, + "total_acs": 5390, + "total_submitted": 10071, + "total_column_articles": 128, "frontend_question_id": "1349", "is_new_question": false }, @@ -31344,8 +31638,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 5109, - "total_submitted": 14857, + "total_acs": 5116, + "total_submitted": 14868, "total_column_articles": 77, "frontend_question_id": "1348", "is_new_question": false @@ -31365,8 +31659,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": 11262, - "total_submitted": 14873, + "total_acs": 11301, + "total_submitted": 14917, "total_column_articles": 170, "frontend_question_id": "1347", "is_new_question": false @@ -31386,9 +31680,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": 32032, - "total_submitted": 75479, - "total_column_articles": 510, + "total_acs": 32221, + "total_submitted": 75951, + "total_column_articles": 512, "frontend_question_id": "1346", "is_new_question": false }, @@ -31407,9 +31701,9 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 3333, - "total_submitted": 7382, - "total_column_articles": 76, + "total_acs": 3349, + "total_submitted": 7418, + "total_column_articles": 77, "frontend_question_id": "1336", "is_new_question": false }, @@ -31428,8 +31722,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 6514, - "total_submitted": 11105, + "total_acs": 6531, + "total_submitted": 11138, "total_column_articles": 129, "frontend_question_id": "1340", "is_new_question": false @@ -31449,8 +31743,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 12337, - "total_submitted": 29750, + "total_acs": 12361, + "total_submitted": 29797, "total_column_articles": 185, "frontend_question_id": "1339", "is_new_question": false @@ -31470,8 +31764,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 12267, - "total_submitted": 18919, + "total_acs": 12335, + "total_submitted": 19012, "total_column_articles": 180, "frontend_question_id": "1338", "is_new_question": false @@ -31491,9 +31785,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": 54729, - "total_submitted": 79401, - "total_column_articles": 870, + "total_acs": 54903, + "total_submitted": 79667, + "total_column_articles": 873, "frontend_question_id": "1337", "is_new_question": false }, @@ -31512,8 +31806,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": 8589, - "total_submitted": 12406, + "total_acs": 8614, + "total_submitted": 12431, "total_column_articles": 73, "frontend_question_id": "1327", "is_new_question": false @@ -31533,8 +31827,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": 5278, - "total_submitted": 9108, + "total_acs": 5290, + "total_submitted": 9124, "total_column_articles": 113, "frontend_question_id": "1359", "is_new_question": false @@ -31554,8 +31848,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": 10084, - "total_submitted": 19197, + "total_acs": 10113, + "total_submitted": 19252, "total_column_articles": 175, "frontend_question_id": "1358", "is_new_question": false @@ -31575,8 +31869,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 6441, - "total_submitted": 11851, + "total_acs": 6460, + "total_submitted": 11886, "total_column_articles": 70, "frontend_question_id": "1357", "is_new_question": false @@ -31596,9 +31890,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": 58578, - "total_submitted": 79909, - "total_column_articles": 652, + "total_acs": 58802, + "total_submitted": 80172, + "total_column_articles": 654, "frontend_question_id": "1356", "is_new_question": false }, @@ -31617,9 +31911,9 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 5448, - "total_submitted": 9098, - "total_column_articles": 89, + "total_acs": 5459, + "total_submitted": 9112, + "total_column_articles": 90, "frontend_question_id": "1335", "is_new_question": false }, @@ -31638,9 +31932,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": 10067, - "total_submitted": 19325, - "total_column_articles": 150, + "total_acs": 10133, + "total_submitted": 19419, + "total_column_articles": 151, "frontend_question_id": "1334", "is_new_question": false }, @@ -31659,8 +31953,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": 7595, - "total_submitted": 13502, + "total_acs": 7624, + "total_submitted": 13553, "total_column_articles": 162, "frontend_question_id": "1333", "is_new_question": false @@ -31680,9 +31974,9 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 34508, - "total_submitted": 44343, - "total_column_articles": 371, + "total_acs": 34597, + "total_submitted": 44457, + "total_column_articles": 373, "frontend_question_id": "1332", "is_new_question": false }, @@ -31701,8 +31995,8 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 8591, - "total_submitted": 14409, + "total_acs": 8622, + "total_submitted": 14459, "total_column_articles": 83, "frontend_question_id": "1322", "is_new_question": false @@ -31722,8 +32016,8 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 9382, - "total_submitted": 14895, + "total_acs": 9447, + "total_submitted": 15018, "total_column_articles": 133, "frontend_question_id": "1321", "is_new_question": false @@ -31743,9 +32037,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": 7891, - "total_submitted": 16403, - "total_column_articles": 118, + "total_acs": 7935, + "total_submitted": 16472, + "total_column_articles": 119, "frontend_question_id": "1326", "is_new_question": false }, @@ -31764,8 +32058,8 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 15801, - "total_submitted": 21611, + "total_acs": 15866, + "total_submitted": 21688, "total_column_articles": 255, "frontend_question_id": "1325", "is_new_question": false @@ -31785,8 +32079,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 8588, - "total_submitted": 14456, + "total_acs": 8623, + "total_submitted": 14497, "total_column_articles": 173, "frontend_question_id": "1324", "is_new_question": false @@ -31806,9 +32100,9 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 34201, - "total_submitted": 45580, - "total_column_articles": 611, + "total_acs": 34328, + "total_submitted": 45730, + "total_column_articles": 612, "frontend_question_id": "1323", "is_new_question": false }, @@ -31827,8 +32121,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 28111, - "total_submitted": 61254, + "total_acs": 28148, + "total_submitted": 61335, "total_column_articles": 305, "frontend_question_id": "1345", "is_new_question": false @@ -31848,8 +32142,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 10559, - "total_submitted": 17503, + "total_acs": 10607, + "total_submitted": 17589, "total_column_articles": 171, "frontend_question_id": "1344", "is_new_question": false @@ -31869,8 +32163,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": 18195, - "total_submitted": 31601, + "total_acs": 18238, + "total_submitted": 31696, "total_column_articles": 295, "frontend_question_id": "1343", "is_new_question": false @@ -31890,9 +32184,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": 104041, - "total_submitted": 130007, - "total_column_articles": 1287, + "total_acs": 105446, + "total_submitted": 132050, + "total_column_articles": 1302, "frontend_question_id": "1342", "is_new_question": false }, @@ -31911,8 +32205,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": 3460, - "total_submitted": 5722, + "total_acs": 3478, + "total_submitted": 5745, "total_column_articles": 74, "frontend_question_id": "1320", "is_new_question": false @@ -31932,8 +32226,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": 42382, - "total_submitted": 68015, + "total_acs": 42487, + "total_submitted": 68170, "total_column_articles": 660, "frontend_question_id": "1319", "is_new_question": false @@ -31953,9 +32247,9 @@ "question__title": "Minimum Flips to Make a OR b Equal to c", "question__title_slug": "minimum-flips-to-make-a-or-b-equal-to-c", "question__hide": false, - "total_acs": 8420, - "total_submitted": 12735, - "total_column_articles": 152, + "total_acs": 8453, + "total_submitted": 12774, + "total_column_articles": 153, "frontend_question_id": "1318", "is_new_question": false }, @@ -31974,8 +32268,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": 13855, - "total_submitted": 22367, + "total_acs": 13897, + "total_submitted": 22441, "total_column_articles": 254, "frontend_question_id": "1317", "is_new_question": false @@ -31995,8 +32289,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 11475, - "total_submitted": 15508, + "total_acs": 11548, + "total_submitted": 15620, "total_column_articles": 97, "frontend_question_id": "1308", "is_new_question": false @@ -32016,9 +32310,9 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 19116, - "total_submitted": 23213, - "total_column_articles": 152, + "total_acs": 19245, + "total_submitted": 23369, + "total_column_articles": 153, "frontend_question_id": "1303", "is_new_question": false }, @@ -32037,9 +32331,9 @@ "question__title": "Minimum Insertion Steps to Make a String Palindrome", "question__title_slug": "minimum-insertion-steps-to-make-a-string-palindrome", "question__hide": false, - "total_acs": 21018, - "total_submitted": 30512, - "total_column_articles": 229, + "total_acs": 21128, + "total_submitted": 30656, + "total_column_articles": 230, "frontend_question_id": "1312", "is_new_question": false }, @@ -32058,9 +32352,9 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 7319, - "total_submitted": 18536, - "total_column_articles": 112, + "total_acs": 7354, + "total_submitted": 18590, + "total_column_articles": 113, "frontend_question_id": "1311", "is_new_question": false }, @@ -32079,8 +32373,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 41444, - "total_submitted": 57692, + "total_acs": 41496, + "total_submitted": 57753, "total_column_articles": 552, "frontend_question_id": "1310", "is_new_question": false @@ -32100,9 +32394,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": 25564, - "total_submitted": 33281, - "total_column_articles": 452, + "total_acs": 25712, + "total_submitted": 33468, + "total_column_articles": 453, "frontend_question_id": "1309", "is_new_question": false }, @@ -32121,8 +32415,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 5217, - "total_submitted": 13306, + "total_acs": 5227, + "total_submitted": 13336, "total_column_articles": 82, "frontend_question_id": "2227", "is_new_question": false @@ -32142,9 +32436,9 @@ "question__title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "question__title_slug": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree", "question__hide": false, - "total_acs": 1269, - "total_submitted": 2311, - "total_column_articles": 49, + "total_acs": 1273, + "total_submitted": 2317, + "total_column_articles": 50, "frontend_question_id": "1430", "is_new_question": false }, @@ -32163,8 +32457,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": 5700, - "total_submitted": 12902, + "total_acs": 5724, + "total_submitted": 12947, "total_column_articles": 106, "frontend_question_id": "2192", "is_new_question": false @@ -32184,9 +32478,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": 8534, - "total_submitted": 13530, - "total_column_articles": 107, + "total_acs": 8624, + "total_submitted": 13675, + "total_column_articles": 108, "frontend_question_id": "2269", "is_new_question": false }, @@ -32205,8 +32499,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 2425, - "total_submitted": 7135, + "total_acs": 2439, + "total_submitted": 7161, "total_column_articles": 70, "frontend_question_id": "1307", "is_new_question": false @@ -32226,9 +32520,9 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 28680, - "total_submitted": 49030, - "total_column_articles": 424, + "total_acs": 28769, + "total_submitted": 49179, + "total_column_articles": 425, "frontend_question_id": "1306", "is_new_question": false }, @@ -32247,8 +32541,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": 49584, - "total_submitted": 63509, + "total_acs": 49639, + "total_submitted": 63573, "total_column_articles": 681, "frontend_question_id": "1305", "is_new_question": false @@ -32268,9 +32562,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": 27652, - "total_submitted": 39076, - "total_column_articles": 472, + "total_acs": 27710, + "total_submitted": 39171, + "total_column_articles": 473, "frontend_question_id": "1304", "is_new_question": false }, @@ -32289,8 +32583,8 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 13391, - "total_submitted": 20394, + "total_acs": 13467, + "total_submitted": 20499, "total_column_articles": 123, "frontend_question_id": "1294", "is_new_question": false @@ -32310,8 +32604,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": 3513, - "total_submitted": 5835, + "total_acs": 3530, + "total_submitted": 5862, "total_column_articles": 116, "frontend_question_id": "1298", "is_new_question": false @@ -32331,9 +32625,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": 9517, - "total_submitted": 19989, - "total_column_articles": 121, + "total_acs": 9547, + "total_submitted": 20039, + "total_column_articles": 122, "frontend_question_id": "1297", "is_new_question": false }, @@ -32352,8 +32646,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": 11858, - "total_submitted": 24306, + "total_acs": 11893, + "total_submitted": 24371, "total_column_articles": 165, "frontend_question_id": "1296", "is_new_question": false @@ -32373,9 +32667,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": 56672, - "total_submitted": 70598, - "total_column_articles": 745, + "total_acs": 56776, + "total_submitted": 70717, + "total_column_articles": 746, "frontend_question_id": "1295", "is_new_question": false }, @@ -32394,8 +32688,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": 9526, - "total_submitted": 11648, + "total_acs": 9615, + "total_submitted": 11763, "total_column_articles": 105, "frontend_question_id": "1285", "is_new_question": false @@ -32415,8 +32709,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": 211, - "total_submitted": 283, + "total_acs": 213, + "total_submitted": 290, "total_column_articles": 14, "frontend_question_id": "2263", "is_new_question": false @@ -32436,8 +32730,8 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 10320, - "total_submitted": 14359, + "total_acs": 10415, + "total_submitted": 14489, "total_column_articles": 124, "frontend_question_id": "2305", "is_new_question": false @@ -32457,8 +32751,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 518, - "total_submitted": 735, + "total_acs": 526, + "total_submitted": 744, "total_column_articles": 26, "frontend_question_id": "2229", "is_new_question": false @@ -32478,8 +32772,8 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 13271, - "total_submitted": 26459, + "total_acs": 13355, + "total_submitted": 26597, "total_column_articles": 114, "frontend_question_id": "1280", "is_new_question": false @@ -32499,9 +32793,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": 20829, - "total_submitted": 54638, - "total_column_articles": 183, + "total_acs": 20905, + "total_submitted": 54768, + "total_column_articles": 184, "frontend_question_id": "1293", "is_new_question": false }, @@ -32520,8 +32814,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": 10294, - "total_submitted": 20625, + "total_acs": 10342, + "total_submitted": 20696, "total_column_articles": 151, "frontend_question_id": "1292", "is_new_question": false @@ -32541,9 +32835,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": 74702, - "total_submitted": 92642, - "total_column_articles": 944, + "total_acs": 74957, + "total_submitted": 92944, + "total_column_articles": 947, "frontend_question_id": "1290", "is_new_question": false }, @@ -32562,8 +32856,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 2310, - "total_submitted": 3837, + "total_acs": 2313, + "total_submitted": 3849, "total_column_articles": 26, "frontend_question_id": "1279", "is_new_question": false @@ -32583,8 +32877,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": 3637, - "total_submitted": 5365, + "total_acs": 3645, + "total_submitted": 5374, "total_column_articles": 94, "frontend_question_id": "1284", "is_new_question": false @@ -32604,8 +32898,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": 12959, - "total_submitted": 27036, + "total_acs": 13034, + "total_submitted": 27186, "total_column_articles": 173, "frontend_question_id": "1283", "is_new_question": false @@ -32625,9 +32919,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": 48344, - "total_submitted": 55808, - "total_column_articles": 791, + "total_acs": 48403, + "total_submitted": 55878, + "total_column_articles": 792, "frontend_question_id": "1282", "is_new_question": false }, @@ -32646,9 +32940,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": 66439, - "total_submitted": 79778, - "total_column_articles": 866, + "total_acs": 66703, + "total_submitted": 80084, + "total_column_articles": 871, "frontend_question_id": "1281", "is_new_question": false }, @@ -32667,8 +32961,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": 10763, - "total_submitted": 13299, + "total_acs": 10850, + "total_submitted": 13432, "total_column_articles": 124, "frontend_question_id": "1270", "is_new_question": false @@ -32688,9 +32982,9 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 4416, - "total_submitted": 4853, - "total_column_articles": 93, + "total_acs": 4429, + "total_submitted": 4866, + "total_column_articles": 94, "frontend_question_id": "1265", "is_new_question": false }, @@ -32709,9 +33003,9 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 5713, - "total_submitted": 9217, - "total_column_articles": 89, + "total_acs": 5738, + "total_submitted": 9256, + "total_column_articles": 90, "frontend_question_id": "1278", "is_new_question": false }, @@ -32730,9 +33024,9 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 28490, - "total_submitted": 38774, - "total_column_articles": 326, + "total_acs": 28563, + "total_submitted": 38869, + "total_column_articles": 327, "frontend_question_id": "1277", "is_new_question": false }, @@ -32751,8 +33045,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": 8372, - "total_submitted": 16659, + "total_acs": 8384, + "total_submitted": 16679, "total_column_articles": 127, "frontend_question_id": "1276", "is_new_question": false @@ -32772,9 +33066,9 @@ "question__title": "Find Winner on a Tic Tac Toe Game", "question__title_slug": "find-winner-on-a-tic-tac-toe-game", "question__hide": false, - "total_acs": 11410, - "total_submitted": 20648, - "total_column_articles": 226, + "total_acs": 11487, + "total_submitted": 20767, + "total_column_articles": 227, "frontend_question_id": "1275", "is_new_question": false }, @@ -32793,9 +33087,9 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 10948, - "total_submitted": 19027, - "total_column_articles": 144, + "total_acs": 11052, + "total_submitted": 19205, + "total_column_articles": 145, "frontend_question_id": "1264", "is_new_question": false }, @@ -32814,9 +33108,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": 32100, - "total_submitted": 65549, - "total_column_articles": 344, + "total_acs": 32132, + "total_submitted": 65615, + "total_column_articles": 346, "frontend_question_id": "1269", "is_new_question": false }, @@ -32835,9 +33129,9 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 13457, - "total_submitted": 22618, - "total_column_articles": 221, + "total_acs": 13504, + "total_submitted": 22697, + "total_column_articles": 222, "frontend_question_id": "1268", "is_new_question": false }, @@ -32856,9 +33150,9 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 12822, - "total_submitted": 20792, - "total_column_articles": 200, + "total_acs": 12854, + "total_submitted": 20834, + "total_column_articles": 201, "frontend_question_id": "1267", "is_new_question": false }, @@ -32877,9 +33171,9 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 34571, - "total_submitted": 41735, - "total_column_articles": 519, + "total_acs": 34623, + "total_submitted": 41794, + "total_column_articles": 520, "frontend_question_id": "1266", "is_new_question": false }, @@ -32898,8 +33192,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 6640, - "total_submitted": 10421, + "total_acs": 6672, + "total_submitted": 10467, "total_column_articles": 121, "frontend_question_id": "2304", "is_new_question": false @@ -32919,9 +33213,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": 5566, - "total_submitted": 10251, - "total_column_articles": 86, + "total_acs": 5579, + "total_submitted": 10268, + "total_column_articles": 87, "frontend_question_id": "2218", "is_new_question": false }, @@ -32940,9 +33234,9 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 12756, - "total_submitted": 19177, - "total_column_articles": 142, + "total_acs": 12817, + "total_submitted": 19255, + "total_column_articles": 143, "frontend_question_id": "2215", "is_new_question": false }, @@ -32961,8 +33255,8 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 2245, - "total_submitted": 3212, + "total_acs": 2259, + "total_submitted": 3231, "total_column_articles": 76, "frontend_question_id": "1426", "is_new_question": false @@ -32982,9 +33276,9 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 16875, - "total_submitted": 22060, - "total_column_articles": 159, + "total_acs": 16994, + "total_submitted": 22237, + "total_column_articles": 160, "frontend_question_id": "1251", "is_new_question": false }, @@ -33003,8 +33297,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": 4988, - "total_submitted": 11449, + "total_acs": 5007, + "total_submitted": 11484, "total_column_articles": 88, "frontend_question_id": "1263", "is_new_question": false @@ -33024,9 +33318,9 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 19940, - "total_submitted": 37607, - "total_column_articles": 269, + "total_acs": 19981, + "total_submitted": 37677, + "total_column_articles": 270, "frontend_question_id": "1262", "is_new_question": false }, @@ -33045,9 +33339,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": 11119, - "total_submitted": 15145, - "total_column_articles": 160, + "total_acs": 11157, + "total_submitted": 15192, + "total_column_articles": 161, "frontend_question_id": "1261", "is_new_question": false }, @@ -33066,9 +33360,9 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 41825, - "total_submitted": 63928, - "total_column_articles": 654, + "total_acs": 41887, + "total_submitted": 64022, + "total_column_articles": 655, "frontend_question_id": "1260", "is_new_question": false }, @@ -33087,8 +33381,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": 180, - "total_submitted": 295, + "total_acs": 181, + "total_submitted": 297, "total_column_articles": 14, "frontend_question_id": "2189", "is_new_question": false @@ -33108,8 +33402,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": 754, - "total_submitted": 1235, + "total_acs": 756, + "total_submitted": 1237, "total_column_articles": 27, "frontend_question_id": "1618", "is_new_question": false @@ -33129,8 +33423,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 140, - "total_submitted": 247, + "total_acs": 142, + "total_submitted": 253, "total_column_articles": 7, "frontend_question_id": "2198", "is_new_question": false @@ -33150,9 +33444,9 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 9216, - "total_submitted": 14493, - "total_column_articles": 91, + "total_acs": 18526, + "total_submitted": 26630, + "total_column_articles": 178, "frontend_question_id": "2303", "is_new_question": false }, @@ -33171,9 +33465,9 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 4528, - "total_submitted": 6326, - "total_column_articles": 105, + "total_acs": 4551, + "total_submitted": 6353, + "total_column_articles": 106, "frontend_question_id": "1255", "is_new_question": false }, @@ -33192,9 +33486,9 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 38693, - "total_submitted": 62093, - "total_column_articles": 648, + "total_acs": 38884, + "total_submitted": 62393, + "total_column_articles": 652, "frontend_question_id": "1254", "is_new_question": false }, @@ -33213,8 +33507,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 6918, - "total_submitted": 17146, + "total_acs": 6944, + "total_submitted": 17184, "total_column_articles": 117, "frontend_question_id": "1253", "is_new_question": false @@ -33234,9 +33528,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": 49108, - "total_submitted": 61702, - "total_column_articles": 644, + "total_acs": 49167, + "total_submitted": 61769, + "total_column_articles": 645, "frontend_question_id": "1252", "is_new_question": false }, @@ -33255,9 +33549,9 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 10466, - "total_submitted": 17564, - "total_column_articles": 88, + "total_acs": 10508, + "total_submitted": 17624, + "total_column_articles": 89, "frontend_question_id": "1241", "is_new_question": false }, @@ -33276,8 +33570,8 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 4218, - "total_submitted": 7958, + "total_acs": 4240, + "total_submitted": 7987, "total_column_articles": 56, "frontend_question_id": "2312", "is_new_question": false @@ -33297,8 +33591,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 6909, - "total_submitted": 20730, + "total_acs": 6922, + "total_submitted": 20751, "total_column_articles": 151, "frontend_question_id": "2217", "is_new_question": false @@ -33318,8 +33612,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": 2186, - "total_submitted": 3585, + "total_acs": 2192, + "total_submitted": 3593, "total_column_articles": 38, "frontend_question_id": "1428", "is_new_question": false @@ -33339,8 +33633,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": 4298, - "total_submitted": 7218, + "total_acs": 4319, + "total_submitted": 7249, "total_column_articles": 59, "frontend_question_id": "1250", "is_new_question": false @@ -33360,9 +33654,9 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 39665, - "total_submitted": 67030, - "total_column_articles": 519, + "total_acs": 39826, + "total_submitted": 67294, + "total_column_articles": 522, "frontend_question_id": "1249", "is_new_question": false }, @@ -33381,8 +33675,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 47909, - "total_submitted": 82980, + "total_acs": 48003, + "total_submitted": 83128, "total_column_articles": 612, "frontend_question_id": "1248", "is_new_question": false @@ -33402,9 +33696,9 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 12656, - "total_submitted": 20158, - "total_column_articles": 221, + "total_acs": 12682, + "total_submitted": 20196, + "total_column_articles": 222, "frontend_question_id": "1247", "is_new_question": false }, @@ -33423,8 +33717,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 2060, - "total_submitted": 4249, + "total_acs": 2065, + "total_submitted": 4274, "total_column_articles": 26, "frontend_question_id": "1242", "is_new_question": false @@ -33444,8 +33738,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 14523, - "total_submitted": 22290, + "total_acs": 14555, + "total_submitted": 22339, "total_column_articles": 174, "frontend_question_id": "1691", "is_new_question": false @@ -33465,8 +33759,8 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 2507, - "total_submitted": 4813, + "total_acs": 2514, + "total_submitted": 4824, "total_column_articles": 74, "frontend_question_id": "1429", "is_new_question": false @@ -33486,8 +33780,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 7593, - "total_submitted": 14704, + "total_acs": 7610, + "total_submitted": 14726, "total_column_articles": 139, "frontend_question_id": "1726", "is_new_question": false @@ -33507,9 +33801,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": 10422, - "total_submitted": 15492, - "total_column_articles": 142, + "total_acs": 10523, + "total_submitted": 15666, + "total_column_articles": 143, "frontend_question_id": "2309", "is_new_question": false }, @@ -33528,8 +33822,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 13499, - "total_submitted": 20113, + "total_acs": 13524, + "total_submitted": 20146, "total_column_articles": 186, "frontend_question_id": "1227", "is_new_question": false @@ -33549,9 +33843,9 @@ "question__title": "Tiling a Rectangle with the Fewest Squares", "question__title_slug": "tiling-a-rectangle-with-the-fewest-squares", "question__hide": false, - "total_acs": 3686, - "total_submitted": 7139, - "total_column_articles": 54, + "total_acs": 3699, + "total_submitted": 7155, + "total_column_articles": 56, "frontend_question_id": "1240", "is_new_question": false }, @@ -33570,9 +33864,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": 39718, - "total_submitted": 80939, - "total_column_articles": 441, + "total_acs": 39775, + "total_submitted": 81033, + "total_column_articles": 443, "frontend_question_id": "1239", "is_new_question": false }, @@ -33591,8 +33885,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 4543, - "total_submitted": 6748, + "total_acs": 4568, + "total_submitted": 6780, "total_column_articles": 102, "frontend_question_id": "1238", "is_new_question": false @@ -33612,8 +33906,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": 12331, - "total_submitted": 17188, + "total_acs": 12360, + "total_submitted": 17223, "total_column_articles": 181, "frontend_question_id": "1237", "is_new_question": false @@ -33633,9 +33927,9 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 6592, - "total_submitted": 12135, - "total_column_articles": 125, + "total_acs": 6646, + "total_submitted": 12238, + "total_column_articles": 126, "frontend_question_id": "1225", "is_new_question": false }, @@ -33654,8 +33948,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": 2979, - "total_submitted": 6152, + "total_acs": 2997, + "total_submitted": 6191, "total_column_articles": 60, "frontend_question_id": "2193", "is_new_question": false @@ -33675,8 +33969,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 8971, - "total_submitted": 18660, + "total_acs": 9000, + "total_submitted": 18709, "total_column_articles": 167, "frontend_question_id": "2216", "is_new_question": false @@ -33696,8 +33990,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": 9901, - "total_submitted": 15683, + "total_acs": 9926, + "total_submitted": 15714, "total_column_articles": 112, "frontend_question_id": "2225", "is_new_question": false @@ -33717,9 +34011,9 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 10962, - "total_submitted": 18422, - "total_column_articles": 145, + "total_acs": 11009, + "total_submitted": 18485, + "total_column_articles": 146, "frontend_question_id": "2273", "is_new_question": false }, @@ -33738,9 +34032,9 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 29967, - "total_submitted": 51821, - "total_column_articles": 366, + "total_acs": 30037, + "total_submitted": 51919, + "total_column_articles": 367, "frontend_question_id": "1235", "is_new_question": false }, @@ -33759,8 +34053,8 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 8633, - "total_submitted": 24010, + "total_acs": 8668, + "total_submitted": 24083, "total_column_articles": 125, "frontend_question_id": "1234", "is_new_question": false @@ -33780,8 +34074,8 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 11962, - "total_submitted": 23327, + "total_acs": 12002, + "total_submitted": 23376, "total_column_articles": 175, "frontend_question_id": "1233", "is_new_question": false @@ -33801,9 +34095,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": 45262, - "total_submitted": 98689, - "total_column_articles": 573, + "total_acs": 45447, + "total_submitted": 99096, + "total_column_articles": 576, "frontend_question_id": "1232", "is_new_question": false }, @@ -33822,8 +34116,8 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 6087, - "total_submitted": 12011, + "total_acs": 6111, + "total_submitted": 12058, "total_column_articles": 102, "frontend_question_id": "2321", "is_new_question": false @@ -33843,8 +34137,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": 255, - "total_submitted": 337, + "total_acs": 266, + "total_submitted": 350, "total_column_articles": 17, "frontend_question_id": "2204", "is_new_question": false @@ -33864,8 +34158,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": 8652, - "total_submitted": 40609, + "total_acs": 8676, + "total_submitted": 40664, "total_column_articles": 145, "frontend_question_id": "2202", "is_new_question": false @@ -33885,8 +34179,8 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 2839, - "total_submitted": 4642, + "total_acs": 2865, + "total_submitted": 4687, "total_column_articles": 97, "frontend_question_id": "1427", "is_new_question": false @@ -33906,8 +34200,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 26468, - "total_submitted": 60624, + "total_acs": 26495, + "total_submitted": 60683, "total_column_articles": 287, "frontend_question_id": "1224", "is_new_question": false @@ -33927,9 +34221,9 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 4468, - "total_submitted": 9022, - "total_column_articles": 77, + "total_acs": 4478, + "total_submitted": 9035, + "total_column_articles": 78, "frontend_question_id": "1223", "is_new_question": false }, @@ -33948,8 +34242,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 8394, - "total_submitted": 12133, + "total_acs": 8419, + "total_submitted": 12164, "total_column_articles": 189, "frontend_question_id": "1222", "is_new_question": false @@ -33969,9 +34263,9 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 94931, - "total_submitted": 111958, - "total_column_articles": 1326, + "total_acs": 95162, + "total_submitted": 112209, + "total_column_articles": 1328, "frontend_question_id": "1221", "is_new_question": false }, @@ -33990,8 +34284,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 16991, - "total_submitted": 28608, + "total_acs": 17032, + "total_submitted": 28664, "total_column_articles": 172, "frontend_question_id": "1226", "is_new_question": false @@ -34011,9 +34305,9 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 8941, - "total_submitted": 17426, - "total_column_articles": 150, + "total_acs": 8980, + "total_submitted": 17488, + "total_column_articles": 151, "frontend_question_id": "1212", "is_new_question": false }, @@ -34032,9 +34326,9 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 14901, - "total_submitted": 22055, - "total_column_articles": 104, + "total_acs": 15009, + "total_submitted": 22207, + "total_column_articles": 106, "frontend_question_id": "1211", "is_new_question": false }, @@ -34053,9 +34347,9 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 27557, - "total_submitted": 39915, - "total_column_articles": 236, + "total_acs": 27627, + "total_submitted": 40041, + "total_column_articles": 238, "frontend_question_id": "1206", "is_new_question": false }, @@ -34074,8 +34368,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": 1084, - "total_submitted": 3407, + "total_acs": 1091, + "total_submitted": 3417, "total_column_articles": 37, "frontend_question_id": "1960", "is_new_question": false @@ -34095,8 +34389,8 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 10118, - "total_submitted": 30285, + "total_acs": 10150, + "total_submitted": 30345, "total_column_articles": 163, "frontend_question_id": "2226", "is_new_question": false @@ -34116,9 +34410,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": 8188, - "total_submitted": 30235, - "total_column_articles": 124, + "total_acs": 8213, + "total_submitted": 30302, + "total_column_articles": 126, "frontend_question_id": "2310", "is_new_question": false }, @@ -34137,8 +34431,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 6526, - "total_submitted": 15176, + "total_acs": 6532, + "total_submitted": 15183, "total_column_articles": 109, "frontend_question_id": "2191", "is_new_question": false @@ -34158,9 +34452,9 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 26154, - "total_submitted": 43079, - "total_column_articles": 368, + "total_acs": 26188, + "total_submitted": 43146, + "total_column_articles": 369, "frontend_question_id": "1220", "is_new_question": false }, @@ -34179,9 +34473,9 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 39038, - "total_submitted": 56398, - "total_column_articles": 513, + "total_acs": 39070, + "total_submitted": 56442, + "total_column_articles": 514, "frontend_question_id": "1219", "is_new_question": false }, @@ -34200,8 +34494,8 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 42178, - "total_submitted": 81563, + "total_acs": 42219, + "total_submitted": 81647, "total_column_articles": 409, "frontend_question_id": "1218", "is_new_question": false @@ -34221,9 +34515,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": 55473, - "total_submitted": 74279, - "total_column_articles": 725, + "total_acs": 55558, + "total_submitted": 74380, + "total_column_articles": 727, "frontend_question_id": "1217", "is_new_question": false }, @@ -34242,8 +34536,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 8433, - "total_submitted": 18358, + "total_acs": 8467, + "total_submitted": 18441, "total_column_articles": 103, "frontend_question_id": "1205", "is_new_question": false @@ -34263,8 +34557,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": 9348, - "total_submitted": 12671, + "total_acs": 9399, + "total_submitted": 12734, "total_column_articles": 112, "frontend_question_id": "1204", "is_new_question": false @@ -34284,8 +34578,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 3462, - "total_submitted": 10268, + "total_acs": 3481, + "total_submitted": 10303, "total_column_articles": 63, "frontend_question_id": "1862", "is_new_question": false @@ -34305,8 +34599,8 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 16880, - "total_submitted": 42791, + "total_acs": 16954, + "total_submitted": 42923, "total_column_articles": 243, "frontend_question_id": "1514", "is_new_question": false @@ -34326,9 +34620,9 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 38348, - "total_submitted": 55428, - "total_column_articles": 676, + "total_acs": 38408, + "total_submitted": 55520, + "total_column_articles": 678, "frontend_question_id": "1706", "is_new_question": false }, @@ -34347,8 +34641,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": 3486, - "total_submitted": 7406, + "total_acs": 3495, + "total_submitted": 7419, "total_column_articles": 74, "frontend_question_id": "1210", "is_new_question": false @@ -34368,9 +34662,9 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 65114, - "total_submitted": 130053, - "total_column_articles": 756, + "total_acs": 65229, + "total_submitted": 130310, + "total_column_articles": 758, "frontend_question_id": "1208", "is_new_question": false }, @@ -34389,9 +34683,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": 18326, - "total_submitted": 36073, - "total_column_articles": 217, + "total_acs": 18374, + "total_submitted": 36153, + "total_column_articles": 218, "frontend_question_id": "1209", "is_new_question": false }, @@ -34410,8 +34704,8 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 74797, - "total_submitted": 102674, + "total_acs": 75029, + "total_submitted": 103001, "total_column_articles": 998, "frontend_question_id": "1207", "is_new_question": false @@ -34431,8 +34725,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 6191, - "total_submitted": 12112, + "total_acs": 6223, + "total_submitted": 12161, "total_column_articles": 97, "frontend_question_id": "1194", "is_new_question": false @@ -34452,9 +34746,9 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 12874, - "total_submitted": 21123, - "total_column_articles": 124, + "total_acs": 12977, + "total_submitted": 21324, + "total_column_articles": 125, "frontend_question_id": "1193", "is_new_question": false }, @@ -34473,8 +34767,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 19564, - "total_submitted": 30137, + "total_acs": 19599, + "total_submitted": 30175, "total_column_articles": 341, "frontend_question_id": "1195", "is_new_question": false @@ -34494,9 +34788,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": 1804, - "total_submitted": 3210, - "total_column_articles": 27, + "total_acs": 1815, + "total_submitted": 3226, + "total_column_articles": 28, "frontend_question_id": "1916", "is_new_question": false }, @@ -34515,9 +34809,9 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 8161, - "total_submitted": 16643, - "total_column_articles": 125, + "total_acs": 8175, + "total_submitted": 16663, + "total_column_articles": 126, "frontend_question_id": "2201", "is_new_question": false }, @@ -34536,9 +34830,9 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 2927, - "total_submitted": 5272, - "total_column_articles": 57, + "total_acs": 2955, + "total_submitted": 5307, + "total_column_articles": 58, "frontend_question_id": "1895", "is_new_question": false }, @@ -34557,9 +34851,9 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 8143, - "total_submitted": 10444, - "total_column_articles": 151, + "total_acs": 8170, + "total_submitted": 10474, + "total_column_articles": 152, "frontend_question_id": "2079", "is_new_question": false }, @@ -34578,9 +34872,9 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 13718, - "total_submitted": 22399, - "total_column_articles": 171, + "total_acs": 13733, + "total_submitted": 22422, + "total_column_articles": 172, "frontend_question_id": "1203", "is_new_question": false }, @@ -34599,9 +34893,9 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 31125, - "total_submitted": 60887, - "total_column_articles": 360, + "total_acs": 31184, + "total_submitted": 60985, + "total_column_articles": 363, "frontend_question_id": "1202", "is_new_question": false }, @@ -34620,8 +34914,8 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 10604, - "total_submitted": 37984, + "total_acs": 10654, + "total_submitted": 38109, "total_column_articles": 149, "frontend_question_id": "1201", "is_new_question": false @@ -34641,9 +34935,9 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 55688, - "total_submitted": 76729, - "total_column_articles": 605, + "total_acs": 55799, + "total_submitted": 76901, + "total_column_articles": 608, "frontend_question_id": "1200", "is_new_question": false }, @@ -34662,8 +34956,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": 5019, - "total_submitted": 8002, + "total_acs": 5042, + "total_submitted": 8036, "total_column_articles": 106, "frontend_question_id": "1944", "is_new_question": false @@ -34683,9 +34977,9 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 29047, - "total_submitted": 45707, - "total_column_articles": 509, + "total_acs": 29077, + "total_submitted": 45758, + "total_column_articles": 514, "frontend_question_id": "1405", "is_new_question": false }, @@ -34704,8 +34998,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 8586, - "total_submitted": 16719, + "total_acs": 8605, + "total_submitted": 16763, "total_column_articles": 161, "frontend_question_id": "2139", "is_new_question": false @@ -34725,8 +35019,8 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 9618, - "total_submitted": 15920, + "total_acs": 9676, + "total_submitted": 16016, "total_column_articles": 129, "frontend_question_id": "1957", "is_new_question": false @@ -34746,9 +35040,9 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 43803, - "total_submitted": 67958, - "total_column_articles": 257, + "total_acs": 43884, + "total_submitted": 68071, + "total_column_articles": 258, "frontend_question_id": "1179", "is_new_question": false }, @@ -34767,9 +35061,9 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 7548, - "total_submitted": 14065, - "total_column_articles": 96, + "total_acs": 7581, + "total_submitted": 14112, + "total_column_articles": 97, "frontend_question_id": "1192", "is_new_question": false }, @@ -34788,8 +35082,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 7849, - "total_submitted": 29170, + "total_acs": 7872, + "total_submitted": 29261, "total_column_articles": 128, "frontend_question_id": "1191", "is_new_question": false @@ -34809,8 +35103,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": 57487, - "total_submitted": 88588, + "total_acs": 57573, + "total_submitted": 88743, "total_column_articles": 736, "frontend_question_id": "1190", "is_new_question": false @@ -34830,9 +35124,9 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 57105, - "total_submitted": 83463, - "total_column_articles": 797, + "total_acs": 57235, + "total_submitted": 83659, + "total_column_articles": 799, "frontend_question_id": "1189", "is_new_question": false }, @@ -34851,9 +35145,9 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 5203, - "total_submitted": 15471, - "total_column_articles": 98, + "total_acs": 5223, + "total_submitted": 15538, + "total_column_articles": 99, "frontend_question_id": "1483", "is_new_question": false }, @@ -34872,8 +35166,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": 5738, - "total_submitted": 11625, + "total_acs": 5763, + "total_submitted": 11675, "total_column_articles": 90, "frontend_question_id": "1954", "is_new_question": false @@ -34893,9 +35187,9 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 8012, - "total_submitted": 26089, - "total_column_articles": 170, + "total_acs": 8048, + "total_submitted": 26173, + "total_column_articles": 171, "frontend_question_id": "2080", "is_new_question": false }, @@ -34914,9 +35208,9 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 27535, - "total_submitted": 41981, - "total_column_articles": 383, + "total_acs": 27598, + "total_submitted": 42062, + "total_column_articles": 385, "frontend_question_id": "1550", "is_new_question": false }, @@ -34935,8 +35229,8 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 8658, - "total_submitted": 13625, + "total_acs": 8693, + "total_submitted": 13716, "total_column_articles": 93, "frontend_question_id": "1174", "is_new_question": false @@ -34956,9 +35250,9 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 16861, - "total_submitted": 22075, - "total_column_articles": 126, + "total_acs": 16968, + "total_submitted": 22205, + "total_column_articles": 127, "frontend_question_id": "1173", "is_new_question": false }, @@ -34977,8 +35271,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 2911, - "total_submitted": 6149, + "total_acs": 2928, + "total_submitted": 6185, "total_column_articles": 52, "frontend_question_id": "1187", "is_new_question": false @@ -34998,9 +35292,9 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 38188, - "total_submitted": 61211, - "total_column_articles": 521, + "total_acs": 38259, + "total_submitted": 61329, + "total_column_articles": 522, "frontend_question_id": "1185", "is_new_question": false }, @@ -35019,8 +35313,8 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 11548, - "total_submitted": 27442, + "total_acs": 11587, + "total_submitted": 27530, "total_column_articles": 166, "frontend_question_id": "1186", "is_new_question": false @@ -35040,8 +35334,8 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 40436, - "total_submitted": 65214, + "total_acs": 40497, + "total_submitted": 65317, "total_column_articles": 608, "frontend_question_id": "1184", "is_new_question": false @@ -35061,8 +35355,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 5758, - "total_submitted": 12201, + "total_acs": 5798, + "total_submitted": 12282, "total_column_articles": 106, "frontend_question_id": "1425", "is_new_question": false @@ -35082,9 +35376,9 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 20490, - "total_submitted": 28108, - "total_column_articles": 280, + "total_acs": 20603, + "total_submitted": 28249, + "total_column_articles": 281, "frontend_question_id": "1382", "is_new_question": false }, @@ -35103,8 +35397,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 8735, - "total_submitted": 22832, + "total_acs": 8759, + "total_submitted": 22868, "total_column_articles": 143, "frontend_question_id": "1390", "is_new_question": false @@ -35124,9 +35418,9 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 14263, - "total_submitted": 24249, - "total_column_articles": 202, + "total_acs": 14347, + "total_submitted": 24362, + "total_column_articles": 203, "frontend_question_id": "1507", "is_new_question": false }, @@ -35145,8 +35439,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": 19866, - "total_submitted": 42644, + "total_acs": 19885, + "total_submitted": 42676, "total_column_articles": 199, "frontend_question_id": "1178", "is_new_question": false @@ -35166,8 +35460,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 8165, - "total_submitted": 27673, + "total_acs": 8201, + "total_submitted": 27727, "total_column_articles": 132, "frontend_question_id": "1177", "is_new_question": false @@ -35187,9 +35481,9 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 5674, - "total_submitted": 11823, - "total_column_articles": 94, + "total_acs": 5702, + "total_submitted": 11862, + "total_column_articles": 95, "frontend_question_id": "1176", "is_new_question": false }, @@ -35208,9 +35502,9 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 31484, - "total_submitted": 55800, - "total_column_articles": 370, + "total_acs": 31537, + "total_submitted": 55916, + "total_column_articles": 372, "frontend_question_id": "1175", "is_new_question": false }, @@ -35229,8 +35523,8 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 12034, - "total_submitted": 19995, + "total_acs": 12100, + "total_submitted": 20154, "total_column_articles": 146, "frontend_question_id": "1164", "is_new_question": false @@ -35250,8 +35544,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 7293, - "total_submitted": 20120, + "total_acs": 7313, + "total_submitted": 20192, "total_column_articles": 128, "frontend_question_id": "1363", "is_new_question": false @@ -35271,8 +35565,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 7401, - "total_submitted": 13686, + "total_acs": 7415, + "total_submitted": 13705, "total_column_articles": 96, "frontend_question_id": "1362", "is_new_question": false @@ -35292,8 +35586,8 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 11243, - "total_submitted": 28206, + "total_acs": 11291, + "total_submitted": 28324, "total_column_articles": 286, "frontend_question_id": "1361", "is_new_question": false @@ -35313,9 +35607,9 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 14104, - "total_submitted": 27593, - "total_column_articles": 215, + "total_acs": 14166, + "total_submitted": 27686, + "total_column_articles": 217, "frontend_question_id": "1360", "is_new_question": false }, @@ -35334,9 +35628,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": 16250, - "total_submitted": 26304, - "total_column_articles": 281, + "total_acs": 16282, + "total_submitted": 26354, + "total_column_articles": 282, "frontend_question_id": "1170", "is_new_question": false }, @@ -35355,8 +35649,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 8894, - "total_submitted": 27069, + "total_acs": 8922, + "total_submitted": 27119, "total_column_articles": 108, "frontend_question_id": "1169", "is_new_question": false @@ -35376,8 +35670,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 1644, - "total_submitted": 2863, + "total_acs": 1648, + "total_submitted": 2867, "total_column_articles": 39, "frontend_question_id": "1236", "is_new_question": false @@ -35397,8 +35691,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 3564, - "total_submitted": 12707, + "total_acs": 3576, + "total_submitted": 12749, "total_column_articles": 87, "frontend_question_id": "1172", "is_new_question": false @@ -35418,8 +35712,8 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 6627, - "total_submitted": 13044, + "total_acs": 6658, + "total_submitted": 13102, "total_column_articles": 118, "frontend_question_id": "1159", "is_new_question": false @@ -35439,9 +35733,9 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 29077, - "total_submitted": 52490, - "total_column_articles": 227, + "total_acs": 29428, + "total_submitted": 53093, + "total_column_articles": 233, "frontend_question_id": "1158", "is_new_question": false }, @@ -35460,9 +35754,9 @@ "question__title": "Remove Zero Sum Consecutive Nodes from Linked List", "question__title_slug": "remove-zero-sum-consecutive-nodes-from-linked-list", "question__hide": false, - "total_acs": 19401, - "total_submitted": 40102, - "total_column_articles": 220, + "total_acs": 19479, + "total_submitted": 40297, + "total_column_articles": 221, "frontend_question_id": "1171", "is_new_question": false }, @@ -35481,8 +35775,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": 12389, - "total_submitted": 17390, + "total_acs": 12433, + "total_submitted": 17449, "total_column_articles": 214, "frontend_question_id": "1935", "is_new_question": false @@ -35502,9 +35796,9 @@ "question__title": "Number of Dice Rolls With Target Sum", "question__title_slug": "number-of-dice-rolls-with-target-sum", "question__hide": false, - "total_acs": 17699, - "total_submitted": 35158, - "total_column_articles": 193, + "total_acs": 17758, + "total_submitted": 35297, + "total_column_articles": 195, "frontend_question_id": "1155", "is_new_question": false }, @@ -35523,9 +35817,9 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 4298, - "total_submitted": 12215, - "total_column_articles": 70, + "total_acs": 4382, + "total_submitted": 12387, + "total_column_articles": 71, "frontend_question_id": "1157", "is_new_question": false }, @@ -35544,9 +35838,9 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 7904, - "total_submitted": 18441, - "total_column_articles": 166, + "total_acs": 7941, + "total_submitted": 18517, + "total_column_articles": 168, "frontend_question_id": "1156", "is_new_question": false }, @@ -35565,9 +35859,9 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 54070, - "total_submitted": 85734, - "total_column_articles": 623, + "total_acs": 54217, + "total_submitted": 85979, + "total_column_articles": 625, "frontend_question_id": "1154", "is_new_question": false }, @@ -35586,8 +35880,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 9575, - "total_submitted": 21567, + "total_acs": 9629, + "total_submitted": 21689, "total_column_articles": 71, "frontend_question_id": "1149", "is_new_question": false @@ -35607,9 +35901,9 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 39698, - "total_submitted": 55237, - "total_column_articles": 143, + "total_acs": 40144, + "total_submitted": 55858, + "total_column_articles": 147, "frontend_question_id": "1148", "is_new_question": false }, @@ -35628,8 +35922,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 2188, - "total_submitted": 6225, + "total_acs": 2214, + "total_submitted": 6302, "total_column_articles": 49, "frontend_question_id": "1632", "is_new_question": false @@ -35649,8 +35943,8 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 44257, - "total_submitted": 73165, + "total_acs": 44367, + "total_submitted": 73348, "total_column_articles": 518, "frontend_question_id": "1331", "is_new_question": false @@ -35670,8 +35964,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 1887, - "total_submitted": 4478, + "total_acs": 1896, + "total_submitted": 4490, "total_column_articles": 42, "frontend_question_id": "1330", "is_new_question": false @@ -35691,8 +35985,8 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 61167, - "total_submitted": 71444, + "total_acs": 61283, + "total_submitted": 71585, "total_column_articles": 758, "frontend_question_id": "1302", "is_new_question": false @@ -35712,8 +36006,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 10972, - "total_submitted": 14072, + "total_acs": 10998, + "total_submitted": 14108, "total_column_articles": 231, "frontend_question_id": "1329", "is_new_question": false @@ -35733,8 +36027,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 8584, - "total_submitted": 18241, + "total_acs": 8620, + "total_submitted": 18311, "total_column_articles": 161, "frontend_question_id": "1328", "is_new_question": false @@ -35754,9 +36048,9 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 6630, - "total_submitted": 11630, - "total_column_articles": 127, + "total_acs": 6653, + "total_submitted": 11689, + "total_column_articles": 128, "frontend_question_id": "1147", "is_new_question": false }, @@ -35775,9 +36069,9 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 299720, - "total_submitted": 461492, - "total_column_articles": 1721, + "total_acs": 300828, + "total_submitted": 463187, + "total_column_articles": 1723, "frontend_question_id": "1143", "is_new_question": false }, @@ -35796,9 +36090,9 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 8027, - "total_submitted": 24557, - "total_column_articles": 108, + "total_acs": 8074, + "total_submitted": 24680, + "total_column_articles": 109, "frontend_question_id": "1146", "is_new_question": false }, @@ -35817,8 +36111,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 8779, - "total_submitted": 18326, + "total_acs": 8800, + "total_submitted": 18361, "total_column_articles": 148, "frontend_question_id": "1145", "is_new_question": false @@ -35838,8 +36132,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 12302, - "total_submitted": 27440, + "total_acs": 12317, + "total_submitted": 27465, "total_column_articles": 176, "frontend_question_id": "1144", "is_new_question": false @@ -35859,8 +36153,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": 11557, - "total_submitted": 31060, + "total_acs": 11610, + "total_submitted": 31168, "total_column_articles": 69, "frontend_question_id": "1142", "is_new_question": false @@ -35880,9 +36174,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": 41324, - "total_submitted": 90781, - "total_column_articles": 250, + "total_acs": 41736, + "total_submitted": 91642, + "total_column_articles": 254, "frontend_question_id": "1141", "is_new_question": false }, @@ -35901,8 +36195,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 4456, - "total_submitted": 9402, + "total_acs": 4482, + "total_submitted": 9439, "total_column_articles": 85, "frontend_question_id": "1316", "is_new_question": false @@ -35922,8 +36216,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": 17053, - "total_submitted": 20910, + "total_acs": 17089, + "total_submitted": 20952, "total_column_articles": 362, "frontend_question_id": "1315", "is_new_question": false @@ -35943,8 +36237,8 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 21852, - "total_submitted": 28882, + "total_acs": 21962, + "total_submitted": 29022, "total_column_articles": 350, "frontend_question_id": "1314", "is_new_question": false @@ -35964,8 +36258,8 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 41547, - "total_submitted": 49946, + "total_acs": 41627, + "total_submitted": 50032, "total_column_articles": 634, "frontend_question_id": "1313", "is_new_question": false @@ -35985,9 +36279,9 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 9755, - "total_submitted": 14747, - "total_column_articles": 123, + "total_acs": 9824, + "total_submitted": 14836, + "total_column_articles": 127, "frontend_question_id": "1140", "is_new_question": false }, @@ -36006,8 +36300,8 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 13052, - "total_submitted": 26351, + "total_acs": 13070, + "total_submitted": 26403, "total_column_articles": 207, "frontend_question_id": "1139", "is_new_question": false @@ -36027,8 +36321,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 7957, - "total_submitted": 17896, + "total_acs": 7973, + "total_submitted": 17970, "total_column_articles": 182, "frontend_question_id": "1138", "is_new_question": false @@ -36048,8 +36342,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 8282, - "total_submitted": 21328, + "total_acs": 8323, + "total_submitted": 21438, "total_column_articles": 76, "frontend_question_id": "1132", "is_new_question": false @@ -36069,9 +36363,9 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 142068, - "total_submitted": 233050, - "total_column_articles": 1335, + "total_acs": 142514, + "total_submitted": 233739, + "total_column_articles": 1338, "frontend_question_id": "1137", "is_new_question": false }, @@ -36090,8 +36384,8 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 6160, - "total_submitted": 16376, + "total_acs": 6189, + "total_submitted": 16447, "total_column_articles": 137, "frontend_question_id": "1301", "is_new_question": false @@ -36111,8 +36405,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 1487, - "total_submitted": 2315, + "total_acs": 1492, + "total_submitted": 2322, "total_column_articles": 33, "frontend_question_id": "1274", "is_new_question": false @@ -36132,9 +36426,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": 29622, - "total_submitted": 63527, - "total_column_articles": 442, + "total_acs": 29677, + "total_submitted": 63617, + "total_column_articles": 443, "frontend_question_id": "1300", "is_new_question": false }, @@ -36153,9 +36447,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": 38761, - "total_submitted": 49651, - "total_column_articles": 548, + "total_acs": 38858, + "total_submitted": 49787, + "total_column_articles": 549, "frontend_question_id": "1299", "is_new_question": false }, @@ -36174,8 +36468,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 4213, - "total_submitted": 8950, + "total_acs": 4229, + "total_submitted": 8971, "total_column_articles": 66, "frontend_question_id": "1131", "is_new_question": false @@ -36195,8 +36489,8 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 10549, - "total_submitted": 25855, + "total_acs": 10587, + "total_submitted": 25929, "total_column_articles": 218, "frontend_question_id": "1129", "is_new_question": false @@ -36216,8 +36510,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 8498, - "total_submitted": 13188, + "total_acs": 8538, + "total_submitted": 13243, "total_column_articles": 146, "frontend_question_id": "1130", "is_new_question": false @@ -36237,8 +36531,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 42334, - "total_submitted": 78197, + "total_acs": 42380, + "total_submitted": 78287, "total_column_articles": 537, "frontend_question_id": "1128", "is_new_question": false @@ -36258,8 +36552,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 7159, - "total_submitted": 16684, + "total_acs": 7210, + "total_submitted": 16780, "total_column_articles": 102, "frontend_question_id": "1127", "is_new_question": false @@ -36279,9 +36573,9 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 12198, - "total_submitted": 17729, - "total_column_articles": 138, + "total_acs": 12295, + "total_submitted": 17905, + "total_column_articles": 139, "frontend_question_id": "1126", "is_new_question": false }, @@ -36300,9 +36594,9 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 13247, - "total_submitted": 22388, - "total_column_articles": 167, + "total_acs": 13311, + "total_submitted": 22528, + "total_column_articles": 170, "frontend_question_id": "1289", "is_new_question": false }, @@ -36321,8 +36615,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 3748, - "total_submitted": 8959, + "total_acs": 3765, + "total_submitted": 8989, "total_column_articles": 60, "frontend_question_id": "1627", "is_new_question": false @@ -36342,8 +36636,8 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 24904, - "total_submitted": 44536, + "total_acs": 25001, + "total_submitted": 44702, "total_column_articles": 278, "frontend_question_id": "1288", "is_new_question": false @@ -36363,9 +36657,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": 22545, - "total_submitted": 38188, - "total_column_articles": 319, + "total_acs": 22638, + "total_submitted": 38339, + "total_column_articles": 321, "frontend_question_id": "1287", "is_new_question": false }, @@ -36384,8 +36678,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 4604, - "total_submitted": 9164, + "total_acs": 4624, + "total_submitted": 9186, "total_column_articles": 73, "frontend_question_id": "1125", "is_new_question": false @@ -36405,9 +36699,9 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 20496, - "total_submitted": 59016, - "total_column_articles": 213, + "total_acs": 20580, + "total_submitted": 59184, + "total_column_articles": 214, "frontend_question_id": "1124", "is_new_question": false }, @@ -36426,9 +36720,9 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 12207, - "total_submitted": 17116, - "total_column_articles": 160, + "total_acs": 12258, + "total_submitted": 17178, + "total_column_articles": 161, "frontend_question_id": "1123", "is_new_question": false }, @@ -36447,9 +36741,9 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 82995, - "total_submitted": 117371, - "total_column_articles": 1082, + "total_acs": 83182, + "total_submitted": 117633, + "total_column_articles": 1084, "frontend_question_id": "1122", "is_new_question": false }, @@ -36468,9 +36762,9 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 31439, - "total_submitted": 58335, - "total_column_articles": 440, + "total_acs": 31517, + "total_submitted": 58449, + "total_column_articles": 442, "frontend_question_id": "1116", "is_new_question": false }, @@ -36489,8 +36783,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 11605, - "total_submitted": 21693, + "total_acs": 11647, + "total_submitted": 21759, "total_column_articles": 71, "frontend_question_id": "1113", "is_new_question": false @@ -36510,9 +36804,9 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 15678, - "total_submitted": 23794, - "total_column_articles": 148, + "total_acs": 15799, + "total_submitted": 23997, + "total_column_articles": 149, "frontend_question_id": "1112", "is_new_question": false }, @@ -36531,9 +36825,9 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 3102, - "total_submitted": 5873, - "total_column_articles": 63, + "total_acs": 3112, + "total_submitted": 5891, + "total_column_articles": 64, "frontend_question_id": "1259", "is_new_question": false }, @@ -36552,9 +36846,9 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 10025, - "total_submitted": 18788, - "total_column_articles": 215, + "total_acs": 10060, + "total_submitted": 18853, + "total_column_articles": 216, "frontend_question_id": "1291", "is_new_question": false }, @@ -36573,8 +36867,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 6582, - "total_submitted": 10164, + "total_acs": 6609, + "total_submitted": 10198, "total_column_articles": 140, "frontend_question_id": "1286", "is_new_question": false @@ -36594,9 +36888,9 @@ "question__title": "Mean of Array After Removing Some Elements", "question__title_slug": "mean-of-array-after-removing-some-elements", "question__hide": false, - "total_acs": 43342, - "total_submitted": 60244, - "total_column_articles": 438, + "total_acs": 43399, + "total_submitted": 60320, + "total_column_articles": 437, "frontend_question_id": "1619", "is_new_question": false }, @@ -36615,8 +36909,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 4848, - "total_submitted": 6898, + "total_acs": 4853, + "total_submitted": 6905, "total_column_articles": 84, "frontend_question_id": "1188", "is_new_question": false @@ -36636,8 +36930,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": 26826, - "total_submitted": 34866, + "total_acs": 26851, + "total_submitted": 34903, "total_column_articles": 440, "frontend_question_id": "1111", "is_new_question": false @@ -36657,9 +36951,9 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 18643, - "total_submitted": 28700, - "total_column_articles": 317, + "total_acs": 18691, + "total_submitted": 28763, + "total_column_articles": 319, "frontend_question_id": "1110", "is_new_question": false }, @@ -36678,9 +36972,9 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 100800, - "total_submitted": 160302, - "total_column_articles": 1523, + "total_acs": 101191, + "total_submitted": 160803, + "total_column_articles": 1529, "frontend_question_id": "1109", "is_new_question": false }, @@ -36699,8 +36993,8 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 109099, - "total_submitted": 127460, + "total_acs": 109256, + "total_submitted": 127652, "total_column_articles": 982, "frontend_question_id": "1108", "is_new_question": false @@ -36720,8 +37014,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 12007, - "total_submitted": 29071, + "total_acs": 12061, + "total_submitted": 29238, "total_column_articles": 132, "frontend_question_id": "1107", "is_new_question": false @@ -36741,9 +37035,9 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 103906, - "total_submitted": 159420, - "total_column_articles": 715, + "total_acs": 104074, + "total_submitted": 159708, + "total_column_articles": 716, "frontend_question_id": "1114", "is_new_question": false }, @@ -36762,9 +37056,9 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 3826, - "total_submitted": 7630, - "total_column_articles": 55, + "total_acs": 3838, + "total_submitted": 7648, + "total_column_articles": 56, "frontend_question_id": "1246", "is_new_question": false }, @@ -36783,9 +37077,9 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 2367, - "total_submitted": 4189, - "total_column_articles": 68, + "total_acs": 2380, + "total_submitted": 4204, + "total_column_articles": 69, "frontend_question_id": "1273", "is_new_question": false }, @@ -36804,8 +37098,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 2479, - "total_submitted": 4458, + "total_acs": 2489, + "total_submitted": 4474, "total_column_articles": 43, "frontend_question_id": "1272", "is_new_question": false @@ -36825,9 +37119,9 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 3060, - "total_submitted": 5892, - "total_column_articles": 63, + "total_acs": 3073, + "total_submitted": 5918, + "total_column_articles": 64, "frontend_question_id": "1271", "is_new_question": false }, @@ -36846,8 +37140,8 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 12673, - "total_submitted": 26681, + "total_acs": 12723, + "total_submitted": 26828, "total_column_articles": 129, "frontend_question_id": "1098", "is_new_question": false @@ -36867,9 +37161,9 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 26223, - "total_submitted": 38068, - "total_column_articles": 562, + "total_acs": 26244, + "total_submitted": 38111, + "total_column_articles": 563, "frontend_question_id": "1106", "is_new_question": false }, @@ -36888,9 +37182,9 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 7163, - "total_submitted": 12386, - "total_column_articles": 93, + "total_acs": 7197, + "total_submitted": 12427, + "total_column_articles": 94, "frontend_question_id": "1105", "is_new_question": false }, @@ -36909,8 +37203,8 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 42401, - "total_submitted": 66642, + "total_acs": 42463, + "total_submitted": 66726, "total_column_articles": 1212, "frontend_question_id": "1103", "is_new_question": false @@ -36930,9 +37224,9 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 31964, - "total_submitted": 42076, - "total_column_articles": 761, + "total_acs": 31998, + "total_submitted": 42120, + "total_column_articles": 763, "frontend_question_id": "1104", "is_new_question": false }, @@ -36951,8 +37245,8 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 10700, - "total_submitted": 20392, + "total_acs": 10737, + "total_submitted": 20465, "total_column_articles": 162, "frontend_question_id": "1097", "is_new_question": false @@ -36972,8 +37266,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 6745, - "total_submitted": 11520, + "total_acs": 6769, + "total_submitted": 11561, "total_column_articles": 98, "frontend_question_id": "1231", "is_new_question": false @@ -36993,8 +37287,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 1960, - "total_submitted": 3348, + "total_acs": 1967, + "total_submitted": 3355, "total_column_articles": 76, "frontend_question_id": "1258", "is_new_question": false @@ -37014,8 +37308,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 2483, - "total_submitted": 4272, + "total_acs": 2493, + "total_submitted": 4287, "total_column_articles": 62, "frontend_question_id": "1257", "is_new_question": false @@ -37035,9 +37329,9 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 1965, - "total_submitted": 2865, - "total_column_articles": 52, + "total_acs": 1973, + "total_submitted": 2876, + "total_column_articles": 53, "frontend_question_id": "1256", "is_new_question": false }, @@ -37056,9 +37350,9 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 2519, - "total_submitted": 4407, - "total_column_articles": 67, + "total_acs": 2543, + "total_submitted": 4441, + "total_column_articles": 68, "frontend_question_id": "1096", "is_new_question": false }, @@ -37077,8 +37371,8 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 59828, - "total_submitted": 105447, + "total_acs": 60020, + "total_submitted": 105726, "total_column_articles": 586, "frontend_question_id": "1115", "is_new_question": false @@ -37098,9 +37392,9 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 24458, - "total_submitted": 45664, - "total_column_articles": 321, + "total_acs": 24511, + "total_submitted": 45746, + "total_column_articles": 322, "frontend_question_id": "1117", "is_new_question": false }, @@ -37119,9 +37413,9 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 25759, - "total_submitted": 68370, - "total_column_articles": 463, + "total_acs": 25811, + "total_submitted": 68477, + "total_column_articles": 465, "frontend_question_id": "1095", "is_new_question": false }, @@ -37140,9 +37434,9 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 64556, - "total_submitted": 122481, - "total_column_articles": 1226, + "total_acs": 64871, + "total_submitted": 123142, + "total_column_articles": 1234, "frontend_question_id": "1094", "is_new_question": false }, @@ -37161,8 +37455,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 5043, - "total_submitted": 13927, + "total_acs": 5062, + "total_submitted": 13966, "total_column_articles": 88, "frontend_question_id": "1093", "is_new_question": false @@ -37182,8 +37476,8 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 24250, - "total_submitted": 54798, + "total_acs": 24364, + "total_submitted": 55108, "total_column_articles": 288, "frontend_question_id": "550", "is_new_question": false @@ -37203,8 +37497,8 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 26160, - "total_submitted": 38159, + "total_acs": 26273, + "total_submitted": 38303, "total_column_articles": 193, "frontend_question_id": "534", "is_new_question": false @@ -37224,8 +37518,8 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 32365, - "total_submitted": 59840, + "total_acs": 32519, + "total_submitted": 60131, "total_column_articles": 220, "frontend_question_id": "512", "is_new_question": false @@ -37245,9 +37539,9 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 69858, - "total_submitted": 97916, - "total_column_articles": 313, + "total_acs": 70460, + "total_submitted": 98782, + "total_column_articles": 316, "frontend_question_id": "511", "is_new_question": false }, @@ -37266,8 +37560,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 2611, - "total_submitted": 4536, + "total_acs": 2616, + "total_submitted": 4549, "total_column_articles": 55, "frontend_question_id": "1216", "is_new_question": false @@ -37287,9 +37581,9 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 5414, - "total_submitted": 10264, - "total_column_articles": 102, + "total_acs": 5526, + "total_submitted": 10433, + "total_column_articles": 104, "frontend_question_id": "1245", "is_new_question": false }, @@ -37308,8 +37602,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 3970, - "total_submitted": 6276, + "total_acs": 3976, + "total_submitted": 6284, "total_column_articles": 65, "frontend_question_id": "1244", "is_new_question": false @@ -37329,8 +37623,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 3384, - "total_submitted": 6294, + "total_acs": 3395, + "total_submitted": 6322, "total_column_articles": 82, "frontend_question_id": "1243", "is_new_question": false @@ -37350,9 +37644,9 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 38810, - "total_submitted": 72550, - "total_column_articles": 279, + "total_acs": 39178, + "total_submitted": 73258, + "total_column_articles": 283, "frontend_question_id": "1084", "is_new_question": false }, @@ -37371,8 +37665,8 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 17083, - "total_submitted": 32281, + "total_acs": 17149, + "total_submitted": 32395, "total_column_articles": 147, "frontend_question_id": "1083", "is_new_question": false @@ -37392,8 +37686,8 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 18233, - "total_submitted": 23821, + "total_acs": 18291, + "total_submitted": 23883, "total_column_articles": 131, "frontend_question_id": "1082", "is_new_question": false @@ -37413,9 +37707,9 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 56765, - "total_submitted": 146734, - "total_column_articles": 566, + "total_acs": 57079, + "total_submitted": 147404, + "total_column_articles": 567, "frontend_question_id": "1091", "is_new_question": false }, @@ -37434,8 +37728,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 5017, - "total_submitted": 9321, + "total_acs": 5040, + "total_submitted": 9355, "total_column_articles": 88, "frontend_question_id": "1092", "is_new_question": false @@ -37455,8 +37749,8 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 5895, - "total_submitted": 10223, + "total_acs": 5926, + "total_submitted": 10263, "total_column_articles": 138, "frontend_question_id": "1090", "is_new_question": false @@ -37476,9 +37770,9 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 55910, - "total_submitted": 92473, - "total_column_articles": 742, + "total_acs": 55990, + "total_submitted": 92622, + "total_column_articles": 744, "frontend_question_id": "1089", "is_new_question": false }, @@ -37497,8 +37791,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 1022, - "total_submitted": 2175, + "total_acs": 1025, + "total_submitted": 2187, "total_column_articles": 29, "frontend_question_id": "1199", "is_new_question": false @@ -37518,8 +37812,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 5843, - "total_submitted": 10810, + "total_acs": 5876, + "total_submitted": 10877, "total_column_articles": 104, "frontend_question_id": "1230", "is_new_question": false @@ -37539,8 +37833,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 5814, - "total_submitted": 12634, + "total_acs": 5852, + "total_submitted": 12700, "total_column_articles": 116, "frontend_question_id": "1229", "is_new_question": false @@ -37560,8 +37854,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 3970, - "total_submitted": 7411, + "total_acs": 3984, + "total_submitted": 7437, "total_column_articles": 76, "frontend_question_id": "1228", "is_new_question": false @@ -37581,9 +37875,9 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 14956, - "total_submitted": 20723, - "total_column_articles": 134, + "total_acs": 15048, + "total_submitted": 20858, + "total_column_articles": 135, "frontend_question_id": "1077", "is_new_question": false }, @@ -37602,9 +37896,9 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 16962, - "total_submitted": 34426, - "total_column_articles": 126, + "total_acs": 17032, + "total_submitted": 34543, + "total_column_articles": 127, "frontend_question_id": "1076", "is_new_question": false }, @@ -37623,8 +37917,8 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 15687, - "total_submitted": 22438, + "total_acs": 15747, + "total_submitted": 22511, "total_column_articles": 104, "frontend_question_id": "1075", "is_new_question": false @@ -37644,9 +37938,9 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 16384, - "total_submitted": 22191, - "total_column_articles": 273, + "total_acs": 16410, + "total_submitted": 22223, + "total_column_articles": 274, "frontend_question_id": "1079", "is_new_question": false }, @@ -37665,8 +37959,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 24201, - "total_submitted": 41517, + "total_acs": 24277, + "total_submitted": 41647, "total_column_articles": 233, "frontend_question_id": "1081", "is_new_question": false @@ -37686,9 +37980,9 @@ "question__title": "Insufficient Nodes in Root to Leaf Paths", "question__title_slug": "insufficient-nodes-in-root-to-leaf-paths", "question__hide": false, - "total_acs": 7316, - "total_submitted": 14059, - "total_column_articles": 142, + "total_acs": 7355, + "total_submitted": 14114, + "total_column_articles": 144, "frontend_question_id": "1080", "is_new_question": false }, @@ -37707,9 +38001,9 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 36025, - "total_submitted": 55168, - "total_column_articles": 506, + "total_acs": 36081, + "total_submitted": 55249, + "total_column_articles": 509, "frontend_question_id": "1078", "is_new_question": false }, @@ -37728,8 +38022,8 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 13121, - "total_submitted": 27353, + "total_acs": 13202, + "total_submitted": 27506, "total_column_articles": 95, "frontend_question_id": "1070", "is_new_question": false @@ -37749,8 +38043,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 17228, - "total_submitted": 21120, + "total_acs": 17289, + "total_submitted": 21191, "total_column_articles": 80, "frontend_question_id": "1069", "is_new_question": false @@ -37770,8 +38064,8 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 19880, - "total_submitted": 23062, + "total_acs": 19946, + "total_submitted": 23135, "total_column_articles": 89, "frontend_question_id": "1068", "is_new_question": false @@ -37791,8 +38085,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 892, - "total_submitted": 1440, + "total_acs": 894, + "total_submitted": 1443, "total_column_articles": 26, "frontend_question_id": "1183", "is_new_question": false @@ -37812,8 +38106,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 2459, - "total_submitted": 5727, + "total_acs": 2462, + "total_submitted": 5735, "total_column_articles": 53, "frontend_question_id": "1215", "is_new_question": false @@ -37833,9 +38127,9 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 4785, - "total_submitted": 7290, - "total_column_articles": 94, + "total_acs": 4813, + "total_submitted": 7328, + "total_column_articles": 96, "frontend_question_id": "1214", "is_new_question": false }, @@ -37854,9 +38148,9 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 8400, - "total_submitted": 10740, - "total_column_articles": 179, + "total_acs": 8450, + "total_submitted": 10811, + "total_column_articles": 182, "frontend_question_id": "1213", "is_new_question": false }, @@ -37875,9 +38169,9 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 3508, - "total_submitted": 9916, - "total_column_articles": 70, + "total_acs": 3521, + "total_submitted": 9946, + "total_column_articles": 71, "frontend_question_id": "1073", "is_new_question": false }, @@ -37896,8 +38190,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": 4992, - "total_submitted": 8051, + "total_acs": 5019, + "total_submitted": 8106, "total_column_articles": 83, "frontend_question_id": "1072", "is_new_question": false @@ -37917,9 +38211,9 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 40843, - "total_submitted": 69723, - "total_column_articles": 749, + "total_acs": 40964, + "total_submitted": 69967, + "total_column_articles": 750, "frontend_question_id": "1071", "is_new_question": false }, @@ -37938,9 +38232,9 @@ "question__title": "Number of Submatrices That Sum to Target", "question__title_slug": "number-of-submatrices-that-sum-to-target", "question__hide": false, - "total_acs": 21317, - "total_submitted": 31691, - "total_column_articles": 220, + "total_acs": 21361, + "total_submitted": 31751, + "total_column_articles": 222, "frontend_question_id": "1074", "is_new_question": false }, @@ -37959,8 +38253,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 2604, - "total_submitted": 4224, + "total_acs": 2616, + "total_submitted": 4239, "total_column_articles": 49, "frontend_question_id": "1168", "is_new_question": false @@ -37980,9 +38274,9 @@ "question__title": "Find Smallest Common Element in All Rows", "question__title_slug": "find-smallest-common-element-in-all-rows", "question__hide": false, - "total_acs": 5252, - "total_submitted": 7117, - "total_column_articles": 85, + "total_acs": 5282, + "total_submitted": 7153, + "total_column_articles": 86, "frontend_question_id": "1198", "is_new_question": false }, @@ -38001,9 +38295,9 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 6935, - "total_submitted": 17883, - "total_column_articles": 82, + "total_acs": 6943, + "total_submitted": 17906, + "total_column_articles": 83, "frontend_question_id": "1197", "is_new_question": false }, @@ -38022,8 +38316,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": 4703, - "total_submitted": 6897, + "total_acs": 4718, + "total_submitted": 6914, "total_column_articles": 81, "frontend_question_id": "1196", "is_new_question": false @@ -38043,9 +38337,9 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 11102, - "total_submitted": 27922, - "total_column_articles": 163, + "total_acs": 11128, + "total_submitted": 27980, + "total_column_articles": 164, "frontend_question_id": "1054", "is_new_question": false }, @@ -38064,9 +38358,9 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 7605, - "total_submitted": 16553, - "total_column_articles": 121, + "total_acs": 7626, + "total_submitted": 16595, + "total_column_articles": 123, "frontend_question_id": "1053", "is_new_question": false }, @@ -38085,8 +38379,8 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 60570, - "total_submitted": 104425, + "total_acs": 60644, + "total_submitted": 104540, "total_column_articles": 898, "frontend_question_id": "1052", "is_new_question": false @@ -38106,9 +38400,9 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 66507, - "total_submitted": 83005, - "total_column_articles": 664, + "total_acs": 66630, + "total_submitted": 83151, + "total_column_articles": 666, "frontend_question_id": "1051", "is_new_question": false }, @@ -38127,9 +38421,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": 41295, - "total_submitted": 53333, - "total_column_articles": 181, + "total_acs": 41698, + "total_submitted": 53835, + "total_column_articles": 182, "frontend_question_id": "1050", "is_new_question": false }, @@ -38148,9 +38442,9 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 16120, - "total_submitted": 25414, - "total_column_articles": 172, + "total_acs": 16209, + "total_submitted": 25600, + "total_column_articles": 173, "frontend_question_id": "1045", "is_new_question": false }, @@ -38169,8 +38463,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 5108, - "total_submitted": 10891, + "total_acs": 5143, + "total_submitted": 10952, "total_column_articles": 95, "frontend_question_id": "1182", "is_new_question": false @@ -38190,8 +38484,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 7774, - "total_submitted": 28301, + "total_acs": 7789, + "total_submitted": 28344, "total_column_articles": 127, "frontend_question_id": "1163", "is_new_question": false @@ -38211,8 +38505,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 1848, - "total_submitted": 4741, + "total_acs": 1856, + "total_submitted": 4762, "total_column_articles": 36, "frontend_question_id": "1181", "is_new_question": false @@ -38232,9 +38526,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": 4111, - "total_submitted": 5303, - "total_column_articles": 99, + "total_acs": 4129, + "total_submitted": 5326, + "total_column_articles": 100, "frontend_question_id": "1180", "is_new_question": false }, @@ -38253,9 +38547,9 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 101541, - "total_submitted": 147757, - "total_column_articles": 720, + "total_acs": 102208, + "total_submitted": 148681, + "total_column_articles": 725, "frontend_question_id": "1049", "is_new_question": false }, @@ -38274,9 +38568,9 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 16785, - "total_submitted": 34444, - "total_column_articles": 238, + "total_acs": 16865, + "total_submitted": 34593, + "total_column_articles": 239, "frontend_question_id": "1048", "is_new_question": false }, @@ -38295,9 +38589,9 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 202437, - "total_submitted": 278801, - "total_column_articles": 1466, + "total_acs": 203449, + "total_submitted": 280293, + "total_column_articles": 1474, "frontend_question_id": "1047", "is_new_question": false }, @@ -38316,9 +38610,9 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 87126, - "total_submitted": 132449, - "total_column_articles": 1159, + "total_acs": 87378, + "total_submitted": 132841, + "total_column_articles": 1163, "frontend_question_id": "1046", "is_new_question": false }, @@ -38337,8 +38631,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 3563, - "total_submitted": 7140, + "total_acs": 3573, + "total_submitted": 7152, "total_column_articles": 49, "frontend_question_id": "1167", "is_new_question": false @@ -38358,8 +38652,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 4537, - "total_submitted": 9197, + "total_acs": 4546, + "total_submitted": 9209, "total_column_articles": 82, "frontend_question_id": "1166", "is_new_question": false @@ -38379,8 +38673,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 2202, - "total_submitted": 5852, + "total_acs": 2205, + "total_submitted": 5863, "total_column_articles": 28, "frontend_question_id": "1153", "is_new_question": false @@ -38400,9 +38694,9 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 9108, - "total_submitted": 10868, - "total_column_articles": 151, + "total_acs": 9133, + "total_submitted": 10894, + "total_column_articles": 152, "frontend_question_id": "1165", "is_new_question": false }, @@ -38421,8 +38715,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 26770, - "total_submitted": 75717, + "total_acs": 26811, + "total_submitted": 75827, "total_column_articles": 228, "frontend_question_id": "1044", "is_new_question": false @@ -38442,9 +38736,9 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 11760, - "total_submitted": 16713, - "total_column_articles": 146, + "total_acs": 11828, + "total_submitted": 16849, + "total_column_articles": 147, "frontend_question_id": "1043", "is_new_question": false }, @@ -38463,9 +38757,9 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 16023, - "total_submitted": 29017, - "total_column_articles": 208, + "total_acs": 16047, + "total_submitted": 29058, + "total_column_articles": 209, "frontend_question_id": "1042", "is_new_question": false }, @@ -38484,9 +38778,9 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 10769, - "total_submitted": 21364, - "total_column_articles": 165, + "total_acs": 10792, + "total_submitted": 21397, + "total_column_articles": 167, "frontend_question_id": "1041", "is_new_question": false }, @@ -38505,9 +38799,9 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 1442, - "total_submitted": 2428, - "total_column_articles": 24, + "total_acs": 1450, + "total_submitted": 2440, + "total_column_articles": 25, "frontend_question_id": "1121", "is_new_question": false }, @@ -38526,9 +38820,9 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 51280, - "total_submitted": 109756, - "total_column_articles": 641, + "total_acs": 51429, + "total_submitted": 110049, + "total_column_articles": 642, "frontend_question_id": "1162", "is_new_question": false }, @@ -38547,8 +38841,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": 34416, - "total_submitted": 51768, + "total_acs": 34458, + "total_submitted": 51827, "total_column_articles": 477, "frontend_question_id": "1161", "is_new_question": false @@ -38568,8 +38862,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 39841, - "total_submitted": 81662, + "total_acs": 39907, + "total_submitted": 81788, "total_column_articles": 412, "frontend_question_id": "1037", "is_new_question": false @@ -38589,8 +38883,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": 40797, - "total_submitted": 50384, + "total_acs": 40957, + "total_submitted": 50567, "total_column_articles": 510, "frontend_question_id": "1038", "is_new_question": false @@ -38610,8 +38904,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 3445, - "total_submitted": 6528, + "total_acs": 3450, + "total_submitted": 6536, "total_column_articles": 41, "frontend_question_id": "1040", "is_new_question": false @@ -38631,9 +38925,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": 72128, - "total_submitted": 105511, - "total_column_articles": 1038, + "total_acs": 72265, + "total_submitted": 105698, + "total_column_articles": 1040, "frontend_question_id": "1160", "is_new_question": false }, @@ -38652,8 +38946,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 6630, - "total_submitted": 11547, + "total_acs": 6648, + "total_submitted": 11579, "total_column_articles": 82, "frontend_question_id": "1039", "is_new_question": false @@ -38673,8 +38967,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 2627, - "total_submitted": 6424, + "total_acs": 2638, + "total_submitted": 6442, "total_column_articles": 55, "frontend_question_id": "1152", "is_new_question": false @@ -38694,8 +38988,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": 8726, - "total_submitted": 16681, + "total_acs": 8755, + "total_submitted": 16732, "total_column_articles": 126, "frontend_question_id": "1151", "is_new_question": false @@ -38715,8 +39009,8 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 20358, - "total_submitted": 43464, + "total_acs": 20374, + "total_submitted": 43494, "total_column_articles": 216, "frontend_question_id": "1036", "is_new_question": false @@ -38736,9 +39030,9 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 67808, - "total_submitted": 98282, - "total_column_articles": 556, + "total_acs": 68163, + "total_submitted": 98729, + "total_column_articles": 559, "frontend_question_id": "1035", "is_new_question": false }, @@ -38757,9 +39051,9 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 32548, - "total_submitted": 59001, - "total_column_articles": 521, + "total_acs": 32589, + "total_submitted": 59078, + "total_column_articles": 523, "frontend_question_id": "1034", "is_new_question": false }, @@ -38778,8 +39072,8 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 13109, - "total_submitted": 32520, + "total_acs": 13138, + "total_submitted": 32567, "total_column_articles": 196, "frontend_question_id": "1033", "is_new_question": false @@ -38799,9 +39093,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": 6767, - "total_submitted": 11367, - "total_column_articles": 123, + "total_acs": 6808, + "total_submitted": 11438, + "total_column_articles": 125, "frontend_question_id": "1150", "is_new_question": false }, @@ -38820,9 +39114,9 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 5636, - "total_submitted": 9406, - "total_column_articles": 97, + "total_acs": 5669, + "total_submitted": 9452, + "total_column_articles": 98, "frontend_question_id": "1136", "is_new_question": false }, @@ -38841,8 +39135,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 11921, - "total_submitted": 20738, + "total_acs": 11966, + "total_submitted": 20808, "total_column_articles": 145, "frontend_question_id": "1135", "is_new_question": false @@ -38862,8 +39156,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 8089, - "total_submitted": 20298, + "total_acs": 8103, + "total_submitted": 20339, "total_column_articles": 104, "frontend_question_id": "1102", "is_new_question": false @@ -38883,9 +39177,9 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 4190, - "total_submitted": 6432, - "total_column_articles": 90, + "total_acs": 4234, + "total_submitted": 6492, + "total_column_articles": 92, "frontend_question_id": "1133", "is_new_question": false }, @@ -38904,8 +39198,8 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 4941, - "total_submitted": 10554, + "total_acs": 4956, + "total_submitted": 10580, "total_column_articles": 85, "frontend_question_id": "1032", "is_new_question": false @@ -38925,8 +39219,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": 8819, - "total_submitted": 14856, + "total_acs": 8864, + "total_submitted": 14936, "total_column_articles": 131, "frontend_question_id": "1031", "is_new_question": false @@ -38946,8 +39240,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 23156, - "total_submitted": 34045, + "total_acs": 23210, + "total_submitted": 34119, "total_column_articles": 265, "frontend_question_id": "1029", "is_new_question": false @@ -38967,9 +39261,9 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 46274, - "total_submitted": 65403, - "total_column_articles": 507, + "total_acs": 46341, + "total_submitted": 65515, + "total_column_articles": 509, "frontend_question_id": "1030", "is_new_question": false }, @@ -38988,9 +39282,9 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 24334, - "total_submitted": 33368, - "total_column_articles": 522, + "total_acs": 24379, + "total_submitted": 33438, + "total_column_articles": 525, "frontend_question_id": "1028", "is_new_question": false }, @@ -39009,9 +39303,9 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 14386, - "total_submitted": 20826, - "total_column_articles": 259, + "total_acs": 14430, + "total_submitted": 20879, + "total_column_articles": 260, "frontend_question_id": "1026", "is_new_question": false }, @@ -39030,8 +39324,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 3725, - "total_submitted": 5926, + "total_acs": 3743, + "total_submitted": 5948, "total_column_articles": 73, "frontend_question_id": "1120", "is_new_question": false @@ -39051,9 +39345,9 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 4214, - "total_submitted": 5455, - "total_column_articles": 75, + "total_acs": 4236, + "total_submitted": 5479, + "total_column_articles": 76, "frontend_question_id": "1134", "is_new_question": false }, @@ -39072,8 +39366,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 10094, - "total_submitted": 11600, + "total_acs": 10117, + "total_submitted": 11624, "total_column_articles": 180, "frontend_question_id": "1119", "is_new_question": false @@ -39093,8 +39387,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 3535, - "total_submitted": 5456, + "total_acs": 3554, + "total_submitted": 5479, "total_column_articles": 65, "frontend_question_id": "1118", "is_new_question": false @@ -39114,8 +39408,8 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 20852, - "total_submitted": 47240, + "total_acs": 20917, + "total_submitted": 47399, "total_column_articles": 193, "frontend_question_id": "1027", "is_new_question": false @@ -39135,9 +39429,9 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 92840, - "total_submitted": 131334, - "total_column_articles": 769, + "total_acs": 93075, + "total_submitted": 131703, + "total_column_articles": 770, "frontend_question_id": "1025", "is_new_question": false }, @@ -39156,9 +39450,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": 3883, - "total_submitted": 5677, - "total_column_articles": 100, + "total_acs": 3928, + "total_submitted": 5746, + "total_column_articles": 101, "frontend_question_id": "1101", "is_new_question": false }, @@ -39177,9 +39471,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": 8315, - "total_submitted": 11865, - "total_column_articles": 163, + "total_acs": 8336, + "total_submitted": 11896, + "total_column_articles": 165, "frontend_question_id": "1100", "is_new_question": false }, @@ -39198,9 +39492,9 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 8258, - "total_submitted": 13818, - "total_column_articles": 136, + "total_acs": 8287, + "total_submitted": 13862, + "total_column_articles": 139, "frontend_question_id": "1099", "is_new_question": false }, @@ -39219,9 +39513,9 @@ "question__title": "Sum of Digits in the Minimum Number", "question__title_slug": "sum-of-digits-in-the-minimum-number", "question__hide": false, - "total_acs": 4623, - "total_submitted": 5942, - "total_column_articles": 105, + "total_acs": 4632, + "total_submitted": 5952, + "total_column_articles": 106, "frontend_question_id": "1085", "is_new_question": false }, @@ -39240,9 +39534,9 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 43451, - "total_submitted": 80962, - "total_column_articles": 530, + "total_acs": 43546, + "total_submitted": 81232, + "total_column_articles": 531, "frontend_question_id": "1024", "is_new_question": false }, @@ -39261,8 +39555,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 10240, - "total_submitted": 17868, + "total_acs": 10268, + "total_submitted": 17918, "total_column_articles": 216, "frontend_question_id": "1023", "is_new_question": false @@ -39282,8 +39576,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": 53874, - "total_submitted": 71873, + "total_acs": 53969, + "total_submitted": 72028, "total_column_articles": 639, "frontend_question_id": "1022", "is_new_question": false @@ -39303,9 +39597,9 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 94583, - "total_submitted": 116087, - "total_column_articles": 1052, + "total_acs": 94692, + "total_submitted": 116228, + "total_column_articles": 1054, "frontend_question_id": "1021", "is_new_question": false }, @@ -39324,8 +39618,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 1543, - "total_submitted": 3167, + "total_acs": 1561, + "total_submitted": 3193, "total_column_articles": 46, "frontend_question_id": "1088", "is_new_question": false @@ -39345,8 +39639,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 3047, - "total_submitted": 5424, + "total_acs": 3065, + "total_submitted": 5449, "total_column_articles": 82, "frontend_question_id": "1087", "is_new_question": false @@ -39366,8 +39660,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 3400, - "total_submitted": 6085, + "total_acs": 3407, + "total_submitted": 6092, "total_column_articles": 98, "frontend_question_id": "1065", "is_new_question": false @@ -39387,9 +39681,9 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 6473, - "total_submitted": 9574, - "total_column_articles": 112, + "total_acs": 6485, + "total_submitted": 9587, + "total_column_articles": 114, "frontend_question_id": "1086", "is_new_question": false }, @@ -39408,9 +39702,9 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 54153, - "total_submitted": 86948, - "total_column_articles": 779, + "total_acs": 54371, + "total_submitted": 87272, + "total_column_articles": 783, "frontend_question_id": "1020", "is_new_question": false }, @@ -39429,9 +39723,9 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 29321, - "total_submitted": 48139, - "total_column_articles": 424, + "total_acs": 29429, + "total_submitted": 48301, + "total_column_articles": 425, "frontend_question_id": "1019", "is_new_question": false }, @@ -39450,9 +39744,9 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 49530, - "total_submitted": 97380, - "total_column_articles": 444, + "total_acs": 49611, + "total_submitted": 97575, + "total_column_articles": 445, "frontend_question_id": "1018", "is_new_question": false }, @@ -39471,8 +39765,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 4964, - "total_submitted": 8693, + "total_acs": 4981, + "total_submitted": 8715, "total_column_articles": 78, "frontend_question_id": "1017", "is_new_question": false @@ -39492,8 +39786,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 4710, - "total_submitted": 10893, + "total_acs": 4730, + "total_submitted": 10926, "total_column_articles": 97, "frontend_question_id": "1056", "is_new_question": false @@ -39513,9 +39807,9 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 1598, - "total_submitted": 3389, - "total_column_articles": 44, + "total_acs": 1611, + "total_submitted": 3416, + "total_column_articles": 45, "frontend_question_id": "1067", "is_new_question": false }, @@ -39534,9 +39828,9 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 3015, - "total_submitted": 5985, - "total_column_articles": 64, + "total_acs": 3041, + "total_submitted": 6026, + "total_column_articles": 66, "frontend_question_id": "1066", "is_new_question": false }, @@ -39555,8 +39849,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 6106, - "total_submitted": 9442, + "total_acs": 6123, + "total_submitted": 9468, "total_column_articles": 99, "frontend_question_id": "1064", "is_new_question": false @@ -39576,8 +39870,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": 7252, - "total_submitted": 12445, + "total_acs": 7271, + "total_submitted": 12471, "total_column_articles": 112, "frontend_question_id": "1016", "is_new_question": false @@ -39597,8 +39891,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 6699, - "total_submitted": 18151, + "total_acs": 6728, + "total_submitted": 18212, "total_column_articles": 61, "frontend_question_id": "1015", "is_new_question": false @@ -39618,9 +39912,9 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 59038, - "total_submitted": 103566, - "total_column_articles": 687, + "total_acs": 59186, + "total_submitted": 103813, + "total_column_articles": 689, "frontend_question_id": "1014", "is_new_question": false }, @@ -39639,9 +39933,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": 57560, - "total_submitted": 148541, - "total_column_articles": 1033, + "total_acs": 57678, + "total_submitted": 148867, + "total_column_articles": 1035, "frontend_question_id": "1013", "is_new_question": false }, @@ -39660,8 +39954,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 2842, - "total_submitted": 3882, + "total_acs": 2849, + "total_submitted": 3890, "total_column_articles": 58, "frontend_question_id": "1063", "is_new_question": false @@ -39681,8 +39975,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 5935, - "total_submitted": 10495, + "total_acs": 5958, + "total_submitted": 10529, "total_column_articles": 81, "frontend_question_id": "1062", "is_new_question": false @@ -39702,9 +39996,9 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 10534, - "total_submitted": 19404, - "total_column_articles": 145, + "total_acs": 10581, + "total_submitted": 19478, + "total_column_articles": 146, "frontend_question_id": "1060", "is_new_question": false }, @@ -39723,9 +40017,9 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 4023, - "total_submitted": 6354, - "total_column_articles": 94, + "total_acs": 4219, + "total_submitted": 6603, + "total_column_articles": 100, "frontend_question_id": "1061", "is_new_question": false }, @@ -39733,7 +40027,7 @@ "difficulty": { "level": 2 }, - "paid_only": true, + "paid_only": false, "is_favor": false, "frequency": 0, "progress": 0 @@ -39744,9 +40038,9 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 6177, - "total_submitted": 14445, - "total_column_articles": 99, + "total_acs": 6217, + "total_submitted": 14492, + "total_column_articles": 101, "frontend_question_id": "1012", "is_new_question": false }, @@ -39765,9 +40059,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": 88749, - "total_submitted": 142840, - "total_column_articles": 824, + "total_acs": 88946, + "total_submitted": 143157, + "total_column_articles": 825, "frontend_question_id": "1011", "is_new_question": false }, @@ -39786,9 +40080,9 @@ "question__title": "Pairs of Songs With Total Durations Divisible by 60", "question__title_slug": "pairs-of-songs-with-total-durations-divisible-by-60", "question__hide": false, - "total_acs": 22817, - "total_submitted": 49389, - "total_column_articles": 293, + "total_acs": 22860, + "total_submitted": 49473, + "total_column_articles": 294, "frontend_question_id": "1010", "is_new_question": false }, @@ -39807,8 +40101,8 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 22398, - "total_submitted": 38174, + "total_acs": 22475, + "total_submitted": 38307, "total_column_articles": 325, "frontend_question_id": "1009", "is_new_question": false @@ -39828,8 +40122,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 1830, - "total_submitted": 4974, + "total_acs": 1835, + "total_submitted": 4981, "total_column_articles": 48, "frontend_question_id": "1058", "is_new_question": false @@ -39849,8 +40143,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 4125, - "total_submitted": 8206, + "total_acs": 4131, + "total_submitted": 8218, "total_column_articles": 54, "frontend_question_id": "1057", "is_new_question": false @@ -39870,9 +40164,9 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 8318, - "total_submitted": 13743, - "total_column_articles": 132, + "total_acs": 8358, + "total_submitted": 13792, + "total_column_articles": 134, "frontend_question_id": "1055", "is_new_question": false }, @@ -39891,9 +40185,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": 27485, - "total_submitted": 38146, - "total_column_articles": 371, + "total_acs": 27564, + "total_submitted": 38249, + "total_column_articles": 372, "frontend_question_id": "1008", "is_new_question": false }, @@ -39912,8 +40206,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 8577, - "total_submitted": 17968, + "total_acs": 8601, + "total_submitted": 18011, "total_column_articles": 119, "frontend_question_id": "1007", "is_new_question": false @@ -39933,9 +40227,9 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 47254, - "total_submitted": 75303, - "total_column_articles": 658, + "total_acs": 47282, + "total_submitted": 75350, + "total_column_articles": 659, "frontend_question_id": "1006", "is_new_question": false }, @@ -39954,9 +40248,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": 110033, - "total_submitted": 214698, - "total_column_articles": 1356, + "total_acs": 110627, + "total_submitted": 215930, + "total_column_articles": 1361, "frontend_question_id": "1005", "is_new_question": false }, @@ -39975,9 +40269,9 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 110998, - "total_submitted": 185390, - "total_column_articles": 1005, + "total_acs": 111352, + "total_submitted": 185998, + "total_column_articles": 1009, "frontend_question_id": "1004", "is_new_question": false }, @@ -39996,9 +40290,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": 15490, - "total_submitted": 26560, - "total_column_articles": 251, + "total_acs": 15550, + "total_submitted": 26673, + "total_column_articles": 252, "frontend_question_id": "1003", "is_new_question": false }, @@ -40017,9 +40311,9 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 77832, - "total_submitted": 109138, - "total_column_articles": 792, + "total_acs": 78075, + "total_submitted": 109522, + "total_column_articles": 793, "frontend_question_id": "1002", "is_new_question": false }, @@ -40038,8 +40332,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 18999, - "total_submitted": 42250, + "total_acs": 19008, + "total_submitted": 42272, "total_column_articles": 279, "frontend_question_id": "1001", "is_new_question": false @@ -40059,9 +40353,9 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 6155, - "total_submitted": 13773, - "total_column_articles": 65, + "total_acs": 6185, + "total_submitted": 13841, + "total_column_articles": 66, "frontend_question_id": "1000", "is_new_question": false }, @@ -40080,8 +40374,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 34184, - "total_submitted": 49330, + "total_acs": 34228, + "total_submitted": 49385, "total_column_articles": 630, "frontend_question_id": "999", "is_new_question": false @@ -40101,8 +40395,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 31997, - "total_submitted": 46561, + "total_acs": 32033, + "total_submitted": 46614, "total_column_articles": 434, "frontend_question_id": "998", "is_new_question": false @@ -40122,9 +40416,9 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 82916, - "total_submitted": 158450, - "total_column_articles": 837, + "total_acs": 83256, + "total_submitted": 159098, + "total_column_articles": 838, "frontend_question_id": "997", "is_new_question": false }, @@ -40143,9 +40437,9 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 6320, - "total_submitted": 12653, - "total_column_articles": 124, + "total_acs": 6358, + "total_submitted": 12706, + "total_column_articles": 126, "frontend_question_id": "996", "is_new_question": false }, @@ -40164,9 +40458,9 @@ "question__title": "Minimum Number of K Consecutive Bit Flips", "question__title_slug": "minimum-number-of-k-consecutive-bit-flips", "question__hide": false, - "total_acs": 25096, - "total_submitted": 46689, - "total_column_articles": 277, + "total_acs": 25144, + "total_submitted": 46759, + "total_column_articles": 279, "frontend_question_id": "995", "is_new_question": false }, @@ -40185,9 +40479,9 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 102202, - "total_submitted": 200007, - "total_column_articles": 1981, + "total_acs": 102685, + "total_submitted": 200873, + "total_column_articles": 1984, "frontend_question_id": "994", "is_new_question": false }, @@ -40206,8 +40500,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 61988, - "total_submitted": 111306, + "total_acs": 62077, + "total_submitted": 111465, "total_column_articles": 976, "frontend_question_id": "993", "is_new_question": false @@ -40227,8 +40521,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 29842, - "total_submitted": 63298, + "total_acs": 29899, + "total_submitted": 63416, "total_column_articles": 332, "frontend_question_id": "992", "is_new_question": false @@ -40248,9 +40542,9 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 11657, - "total_submitted": 22294, - "total_column_articles": 141, + "total_acs": 11679, + "total_submitted": 22345, + "total_column_articles": 142, "frontend_question_id": "991", "is_new_question": false }, @@ -40269,9 +40563,9 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 49511, - "total_submitted": 93183, - "total_column_articles": 840, + "total_acs": 49644, + "total_submitted": 93407, + "total_column_articles": 842, "frontend_question_id": "990", "is_new_question": false }, @@ -40290,8 +40584,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 67877, - "total_submitted": 145763, + "total_acs": 68116, + "total_submitted": 146308, "total_column_articles": 762, "frontend_question_id": "989", "is_new_question": false @@ -40311,8 +40605,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 14647, - "total_submitted": 28654, + "total_acs": 14703, + "total_submitted": 28758, "total_column_articles": 183, "frontend_question_id": "988", "is_new_question": false @@ -40332,9 +40626,9 @@ "question__title": "Vertical Order Traversal of a Binary Tree", "question__title_slug": "vertical-order-traversal-of-a-binary-tree", "question__hide": false, - "total_acs": 30584, - "total_submitted": 57095, - "total_column_articles": 496, + "total_acs": 30635, + "total_submitted": 57177, + "total_column_articles": 497, "frontend_question_id": "987", "is_new_question": false }, @@ -40353,9 +40647,9 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 57203, - "total_submitted": 83442, - "total_column_articles": 546, + "total_acs": 57528, + "total_submitted": 83901, + "total_column_articles": 548, "frontend_question_id": "986", "is_new_question": false }, @@ -40374,9 +40668,9 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 18820, - "total_submitted": 30907, - "total_column_articles": 219, + "total_acs": 18856, + "total_submitted": 30967, + "total_column_articles": 220, "frontend_question_id": "985", "is_new_question": false }, @@ -40395,9 +40689,9 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 12283, - "total_submitted": 28583, - "total_column_articles": 203, + "total_acs": 12312, + "total_submitted": 28624, + "total_column_articles": 204, "frontend_question_id": "984", "is_new_question": false }, @@ -40416,9 +40710,9 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 40009, - "total_submitted": 63055, - "total_column_articles": 521, + "total_acs": 40083, + "total_submitted": 63161, + "total_column_articles": 522, "frontend_question_id": "983", "is_new_question": false }, @@ -40437,8 +40731,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": 3766, - "total_submitted": 6560, + "total_acs": 3773, + "total_submitted": 6570, "total_column_articles": 50, "frontend_question_id": "982", "is_new_question": false @@ -40458,8 +40752,8 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 28672, - "total_submitted": 54001, + "total_acs": 28739, + "total_submitted": 54132, "total_column_articles": 380, "frontend_question_id": "981", "is_new_question": false @@ -40479,9 +40773,9 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 19784, - "total_submitted": 26766, - "total_column_articles": 290, + "total_acs": 19838, + "total_submitted": 26835, + "total_column_articles": 291, "frontend_question_id": "980", "is_new_question": false }, @@ -40500,9 +40794,9 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 12415, - "total_submitted": 17146, - "total_column_articles": 189, + "total_acs": 12453, + "total_submitted": 17203, + "total_column_articles": 190, "frontend_question_id": "979", "is_new_question": false }, @@ -40521,9 +40815,9 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 49953, - "total_submitted": 105181, - "total_column_articles": 674, + "total_acs": 50037, + "total_submitted": 105324, + "total_column_articles": 676, "frontend_question_id": "978", "is_new_question": false }, @@ -40542,9 +40836,9 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 457043, - "total_submitted": 665645, - "total_column_articles": 2965, + "total_acs": 459993, + "total_submitted": 670056, + "total_column_articles": 2992, "frontend_question_id": "977", "is_new_question": false }, @@ -40563,9 +40857,9 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 78813, - "total_submitted": 136507, - "total_column_articles": 783, + "total_acs": 79098, + "total_submitted": 137005, + "total_column_articles": 788, "frontend_question_id": "976", "is_new_question": false }, @@ -40584,8 +40878,8 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 5021, - "total_submitted": 10534, + "total_acs": 5051, + "total_submitted": 10583, "total_column_articles": 83, "frontend_question_id": "975", "is_new_question": false @@ -40605,9 +40899,9 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 54210, - "total_submitted": 113659, - "total_column_articles": 510, + "total_acs": 54451, + "total_submitted": 114078, + "total_column_articles": 514, "frontend_question_id": "974", "is_new_question": false }, @@ -40626,9 +40920,9 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 91009, - "total_submitted": 139847, - "total_column_articles": 795, + "total_acs": 91239, + "total_submitted": 140148, + "total_column_articles": 796, "frontend_question_id": "973", "is_new_question": false }, @@ -40647,9 +40941,9 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 492697, - "total_submitted": 740657, - "total_column_articles": 2864, + "total_acs": 494721, + "total_submitted": 743728, + "total_column_articles": 2887, "frontend_question_id": "509", "is_new_question": false }, @@ -40668,8 +40962,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 1954, - "total_submitted": 4771, + "total_acs": 1956, + "total_submitted": 4789, "total_column_articles": 48, "frontend_question_id": "972", "is_new_question": false @@ -40689,9 +40983,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": 9858, - "total_submitted": 21756, - "total_column_articles": 154, + "total_acs": 9894, + "total_submitted": 21837, + "total_column_articles": 155, "frontend_question_id": "971", "is_new_question": false }, @@ -40710,9 +41004,9 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 13523, - "total_submitted": 32868, - "total_column_articles": 155, + "total_acs": 13549, + "total_submitted": 32940, + "total_column_articles": 156, "frontend_question_id": "970", "is_new_question": false }, @@ -40731,8 +41025,8 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 45585, - "total_submitted": 67429, + "total_acs": 45632, + "total_submitted": 67505, "total_column_articles": 663, "frontend_question_id": "969", "is_new_question": false @@ -40752,9 +41046,9 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 50861, - "total_submitted": 97445, - "total_column_articles": 543, + "total_acs": 51165, + "total_submitted": 98003, + "total_column_articles": 544, "frontend_question_id": "968", "is_new_question": false }, @@ -40773,9 +41067,9 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 11419, - "total_submitted": 22775, - "total_column_articles": 223, + "total_acs": 11473, + "total_submitted": 22873, + "total_column_articles": 225, "frontend_question_id": "967", "is_new_question": false }, @@ -40794,8 +41088,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 4244, - "total_submitted": 9962, + "total_acs": 4412, + "total_submitted": 10333, "total_column_articles": 67, "frontend_question_id": "966", "is_new_question": false @@ -40815,9 +41109,9 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 76586, - "total_submitted": 107491, - "total_column_articles": 842, + "total_acs": 76745, + "total_submitted": 107753, + "total_column_articles": 843, "frontend_question_id": "965", "is_new_question": false }, @@ -40836,8 +41130,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 2119, - "total_submitted": 4612, + "total_acs": 2127, + "total_submitted": 4631, "total_column_articles": 39, "frontend_question_id": "964", "is_new_question": false @@ -40857,8 +41151,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 3504, - "total_submitted": 6824, + "total_acs": 3513, + "total_submitted": 6842, "total_column_articles": 51, "frontend_question_id": "963", "is_new_question": false @@ -40878,9 +41172,9 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 21762, - "total_submitted": 46794, - "total_column_articles": 199, + "total_acs": 21830, + "total_submitted": 46920, + "total_column_articles": 202, "frontend_question_id": "962", "is_new_question": false }, @@ -40899,9 +41193,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": 77311, - "total_submitted": 109965, - "total_column_articles": 713, + "total_acs": 77416, + "total_submitted": 110127, + "total_column_articles": 714, "frontend_question_id": "961", "is_new_question": false }, @@ -40920,8 +41214,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 3255, - "total_submitted": 5548, + "total_acs": 3267, + "total_submitted": 5566, "total_column_articles": 58, "frontend_question_id": "960", "is_new_question": false @@ -40941,9 +41235,9 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 22455, - "total_submitted": 30209, - "total_column_articles": 345, + "total_acs": 22486, + "total_submitted": 30245, + "total_column_articles": 346, "frontend_question_id": "959", "is_new_question": false }, @@ -40962,9 +41256,9 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 45622, - "total_submitted": 83582, - "total_column_articles": 436, + "total_acs": 45738, + "total_submitted": 83798, + "total_column_articles": 437, "frontend_question_id": "958", "is_new_question": false }, @@ -40983,8 +41277,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 18561, - "total_submitted": 50446, + "total_acs": 18583, + "total_submitted": 50490, "total_column_articles": 181, "frontend_question_id": "957", "is_new_question": false @@ -41004,9 +41298,9 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 5908, - "total_submitted": 13006, - "total_column_articles": 71, + "total_acs": 5931, + "total_submitted": 13037, + "total_column_articles": 72, "frontend_question_id": "956", "is_new_question": false }, @@ -41025,8 +41319,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 5002, - "total_submitted": 14273, + "total_acs": 5024, + "total_submitted": 14318, "total_column_articles": 90, "frontend_question_id": "955", "is_new_question": false @@ -41046,8 +41340,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 41960, - "total_submitted": 107497, + "total_acs": 41991, + "total_submitted": 107559, "total_column_articles": 476, "frontend_question_id": "954", "is_new_question": false @@ -41067,8 +41361,8 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 52235, - "total_submitted": 90363, + "total_acs": 52494, + "total_submitted": 90737, "total_column_articles": 671, "frontend_question_id": "953", "is_new_question": false @@ -41088,8 +41382,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 18419, - "total_submitted": 36232, + "total_acs": 18445, + "total_submitted": 36296, "total_column_articles": 179, "frontend_question_id": "952", "is_new_question": false @@ -41109,9 +41403,9 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 16266, - "total_submitted": 24398, - "total_column_articles": 236, + "total_acs": 16331, + "total_submitted": 24480, + "total_column_articles": 237, "frontend_question_id": "951", "is_new_question": false }, @@ -41130,9 +41424,9 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 13474, - "total_submitted": 17168, - "total_column_articles": 222, + "total_acs": 13503, + "total_submitted": 17200, + "total_column_articles": 223, "frontend_question_id": "950", "is_new_question": false }, @@ -41151,9 +41445,9 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 10963, - "total_submitted": 29026, - "total_column_articles": 179, + "total_acs": 10979, + "total_submitted": 29087, + "total_column_articles": 182, "frontend_question_id": "949", "is_new_question": false }, @@ -41172,8 +41466,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 9355, - "total_submitted": 23180, + "total_acs": 9378, + "total_submitted": 23214, "total_column_articles": 139, "frontend_question_id": "948", "is_new_question": false @@ -41193,9 +41487,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": 32636, - "total_submitted": 53030, - "total_column_articles": 420, + "total_acs": 32695, + "total_submitted": 53117, + "total_column_articles": 421, "frontend_question_id": "947", "is_new_question": false }, @@ -41214,9 +41508,9 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 74369, - "total_submitted": 111362, - "total_column_articles": 822, + "total_acs": 74507, + "total_submitted": 111539, + "total_column_articles": 823, "frontend_question_id": "946", "is_new_question": false }, @@ -41235,9 +41529,9 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 41423, - "total_submitted": 86249, - "total_column_articles": 610, + "total_acs": 41459, + "total_submitted": 86327, + "total_column_articles": 611, "frontend_question_id": "945", "is_new_question": false }, @@ -41256,8 +41550,8 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 55414, - "total_submitted": 80208, + "total_acs": 55478, + "total_submitted": 80295, "total_column_articles": 496, "frontend_question_id": "944", "is_new_question": false @@ -41277,9 +41571,9 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 3076, - "total_submitted": 6559, - "total_column_articles": 70, + "total_acs": 3109, + "total_submitted": 6631, + "total_column_articles": 71, "frontend_question_id": "943", "is_new_question": false }, @@ -41298,8 +41592,8 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 63862, - "total_submitted": 82485, + "total_acs": 63974, + "total_submitted": 82645, "total_column_articles": 766, "frontend_question_id": "942", "is_new_question": false @@ -41319,8 +41613,8 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 78133, - "total_submitted": 197765, + "total_acs": 78353, + "total_submitted": 198317, "total_column_articles": 770, "frontend_question_id": "941", "is_new_question": false @@ -41340,9 +41634,9 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 29446, - "total_submitted": 54653, - "total_column_articles": 274, + "total_acs": 29490, + "total_submitted": 54764, + "total_column_articles": 275, "frontend_question_id": "940", "is_new_question": false }, @@ -41361,9 +41655,9 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 8253, - "total_submitted": 17222, - "total_column_articles": 95, + "total_acs": 8286, + "total_submitted": 17278, + "total_column_articles": 96, "frontend_question_id": "939", "is_new_question": false }, @@ -41382,8 +41676,8 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 116998, - "total_submitted": 142511, + "total_acs": 117163, + "total_submitted": 142736, "total_column_articles": 968, "frontend_question_id": "938", "is_new_question": false @@ -41403,8 +41697,8 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 40842, - "total_submitted": 64215, + "total_acs": 40877, + "total_submitted": 64271, "total_column_articles": 482, "frontend_question_id": "937", "is_new_question": false @@ -41424,8 +41718,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 2493, - "total_submitted": 6016, + "total_acs": 2518, + "total_submitted": 6048, "total_column_articles": 39, "frontend_question_id": "936", "is_new_question": false @@ -41445,9 +41739,9 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 9044, - "total_submitted": 17878, - "total_column_articles": 127, + "total_acs": 9084, + "total_submitted": 17930, + "total_column_articles": 128, "frontend_question_id": "935", "is_new_question": false }, @@ -41466,9 +41760,9 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 62738, - "total_submitted": 119273, - "total_column_articles": 701, + "total_acs": 62898, + "total_submitted": 119579, + "total_column_articles": 702, "frontend_question_id": "934", "is_new_question": false }, @@ -41487,8 +41781,8 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 91865, - "total_submitted": 119366, + "total_acs": 92102, + "total_submitted": 119704, "total_column_articles": 790, "frontend_question_id": "933", "is_new_question": false @@ -41508,8 +41802,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 12683, - "total_submitted": 19393, + "total_acs": 12714, + "total_submitted": 19438, "total_column_articles": 126, "frontend_question_id": "932", "is_new_question": false @@ -41529,9 +41823,9 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 51198, - "total_submitted": 76082, - "total_column_articles": 895, + "total_acs": 51498, + "total_submitted": 76533, + "total_column_articles": 919, "frontend_question_id": "931", "is_new_question": false }, @@ -41550,8 +41844,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 42511, - "total_submitted": 77398, + "total_acs": 42578, + "total_submitted": 77535, "total_column_articles": 417, "frontend_question_id": "930", "is_new_question": false @@ -41571,9 +41865,9 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 54073, - "total_submitted": 78630, - "total_column_articles": 524, + "total_acs": 54153, + "total_submitted": 78753, + "total_column_articles": 525, "frontend_question_id": "929", "is_new_question": false }, @@ -41592,8 +41886,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 3739, - "total_submitted": 8525, + "total_acs": 3763, + "total_submitted": 8589, "total_column_articles": 72, "frontend_question_id": "928", "is_new_question": false @@ -41613,8 +41907,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 23401, - "total_submitted": 53251, + "total_acs": 23415, + "total_submitted": 53299, "total_column_articles": 362, "frontend_question_id": "927", "is_new_question": false @@ -41634,9 +41928,9 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 34736, - "total_submitted": 54511, - "total_column_articles": 496, + "total_acs": 34896, + "total_submitted": 54749, + "total_column_articles": 497, "frontend_question_id": "926", "is_new_question": false }, @@ -41655,8 +41949,8 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 61903, - "total_submitted": 163542, + "total_acs": 62093, + "total_submitted": 164008, "total_column_articles": 806, "frontend_question_id": "925", "is_new_question": false @@ -41676,8 +41970,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 9490, - "total_submitted": 26461, + "total_acs": 9531, + "total_submitted": 26625, "total_column_articles": 140, "frontend_question_id": "924", "is_new_question": false @@ -41697,8 +41991,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 9160, - "total_submitted": 24987, + "total_acs": 9199, + "total_submitted": 25065, "total_column_articles": 109, "frontend_question_id": "923", "is_new_question": false @@ -41718,9 +42012,9 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 109280, - "total_submitted": 153257, - "total_column_articles": 1031, + "total_acs": 109507, + "total_submitted": 153579, + "total_column_articles": 1034, "frontend_question_id": "922", "is_new_question": false }, @@ -41739,9 +42033,9 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 63186, - "total_submitted": 86549, - "total_column_articles": 881, + "total_acs": 63308, + "total_submitted": 86707, + "total_column_articles": 882, "frontend_question_id": "921", "is_new_question": false }, @@ -41760,9 +42054,9 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 2915, - "total_submitted": 5726, - "total_column_articles": 36, + "total_acs": 2957, + "total_submitted": 5800, + "total_column_articles": 37, "frontend_question_id": "920", "is_new_question": false }, @@ -41781,9 +42075,9 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 30911, - "total_submitted": 45939, - "total_column_articles": 404, + "total_acs": 30965, + "total_submitted": 46016, + "total_column_articles": 406, "frontend_question_id": "919", "is_new_question": false }, @@ -41802,9 +42096,9 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 49292, - "total_submitted": 131417, - "total_column_articles": 466, + "total_acs": 49563, + "total_submitted": 131968, + "total_column_articles": 469, "frontend_question_id": "918", "is_new_question": false }, @@ -41823,8 +42117,8 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 74433, - "total_submitted": 124726, + "total_acs": 74556, + "total_submitted": 124941, "total_column_articles": 1030, "frontend_question_id": "917", "is_new_question": false @@ -41844,9 +42138,9 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 8809, - "total_submitted": 19177, - "total_column_articles": 113, + "total_acs": 8842, + "total_submitted": 19248, + "total_column_articles": 114, "frontend_question_id": "916", "is_new_question": false }, @@ -41865,8 +42159,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 47015, - "total_submitted": 93778, + "total_acs": 47099, + "total_submitted": 93930, "total_column_articles": 549, "frontend_question_id": "915", "is_new_question": false @@ -41886,8 +42180,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": 57373, - "total_submitted": 151624, + "total_acs": 57486, + "total_submitted": 152011, "total_column_articles": 724, "frontend_question_id": "914", "is_new_question": false @@ -41907,8 +42201,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 17761, - "total_submitted": 32445, + "total_acs": 17782, + "total_submitted": 32509, "total_column_articles": 135, "frontend_question_id": "913", "is_new_question": false @@ -41928,9 +42222,9 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 487783, - "total_submitted": 901945, - "total_column_articles": 1927, + "total_acs": 489507, + "total_submitted": 905653, + "total_column_articles": 1932, "frontend_question_id": "912", "is_new_question": false }, @@ -41949,8 +42243,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 30985, - "total_submitted": 57607, + "total_acs": 31037, + "total_submitted": 57713, "total_column_articles": 360, "frontend_question_id": "911", "is_new_question": false @@ -41970,8 +42264,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 10934, - "total_submitted": 31084, + "total_acs": 11003, + "total_submitted": 31267, "total_column_articles": 118, "frontend_question_id": "910", "is_new_question": false @@ -41991,9 +42285,9 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 18923, - "total_submitted": 41347, - "total_column_articles": 218, + "total_acs": 18957, + "total_submitted": 41406, + "total_column_articles": 219, "frontend_question_id": "909", "is_new_question": false }, @@ -42012,9 +42306,9 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 53489, - "total_submitted": 71912, - "total_column_articles": 563, + "total_acs": 53572, + "total_submitted": 72014, + "total_column_articles": 564, "frontend_question_id": "908", "is_new_question": false }, @@ -42033,9 +42327,9 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 43978, - "total_submitted": 114879, - "total_column_articles": 428, + "total_acs": 44097, + "total_submitted": 115173, + "total_column_articles": 429, "frontend_question_id": "907", "is_new_question": false }, @@ -42054,8 +42348,8 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 3561, - "total_submitted": 11391, + "total_acs": 3585, + "total_submitted": 11444, "total_column_articles": 66, "frontend_question_id": "906", "is_new_question": false @@ -42075,9 +42369,9 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 115831, - "total_submitted": 162720, - "total_column_articles": 1394, + "total_acs": 116022, + "total_submitted": 162986, + "total_column_articles": 1396, "frontend_question_id": "905", "is_new_question": false }, @@ -42096,9 +42390,9 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 110076, - "total_submitted": 242719, - "total_column_articles": 1318, + "total_acs": 110678, + "total_submitted": 244015, + "total_column_articles": 1322, "frontend_question_id": "904", "is_new_question": false }, @@ -42117,9 +42411,9 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 3987, - "total_submitted": 7086, - "total_column_articles": 60, + "total_acs": 4009, + "total_submitted": 7122, + "total_column_articles": 61, "frontend_question_id": "903", "is_new_question": false }, @@ -42138,9 +42432,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": 25344, - "total_submitted": 55279, - "total_column_articles": 385, + "total_acs": 25399, + "total_submitted": 55374, + "total_column_articles": 388, "frontend_question_id": "902", "is_new_question": false }, @@ -42159,8 +42453,8 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 56606, - "total_submitted": 90684, + "total_acs": 56702, + "total_submitted": 90834, "total_column_articles": 641, "frontend_question_id": "901", "is_new_question": false @@ -42180,8 +42474,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 5135, - "total_submitted": 10052, + "total_acs": 5164, + "total_submitted": 10096, "total_column_articles": 82, "frontend_question_id": "900", "is_new_question": false @@ -42201,9 +42495,9 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 27058, - "total_submitted": 41812, - "total_column_articles": 268, + "total_acs": 27081, + "total_submitted": 41843, + "total_column_articles": 269, "frontend_question_id": "899", "is_new_question": false }, @@ -42222,8 +42516,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 8193, - "total_submitted": 21445, + "total_acs": 8226, + "total_submitted": 21499, "total_column_articles": 62, "frontend_question_id": "898", "is_new_question": false @@ -42243,9 +42537,9 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 75209, - "total_submitted": 101497, - "total_column_articles": 863, + "total_acs": 75335, + "total_submitted": 101645, + "total_column_articles": 864, "frontend_question_id": "897", "is_new_question": false }, @@ -42264,9 +42558,9 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 78177, - "total_submitted": 136507, - "total_column_articles": 931, + "total_acs": 78448, + "total_submitted": 136946, + "total_column_articles": 936, "frontend_question_id": "896", "is_new_question": false }, @@ -42285,8 +42579,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 29862, - "total_submitted": 46018, + "total_acs": 29926, + "total_submitted": 46104, "total_column_articles": 316, "frontend_question_id": "895", "is_new_question": false @@ -42306,9 +42600,9 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 18090, - "total_submitted": 23269, - "total_column_articles": 186, + "total_acs": 18152, + "total_submitted": 23338, + "total_column_articles": 188, "frontend_question_id": "894", "is_new_question": false }, @@ -42327,8 +42621,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 12531, - "total_submitted": 17209, + "total_acs": 12555, + "total_submitted": 17242, "total_column_articles": 138, "frontend_question_id": "893", "is_new_question": false @@ -42348,9 +42642,9 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 37388, - "total_submitted": 58167, - "total_column_articles": 760, + "total_acs": 37431, + "total_submitted": 58237, + "total_column_articles": 761, "frontend_question_id": "892", "is_new_question": false }, @@ -42369,8 +42663,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 19943, - "total_submitted": 42809, + "total_acs": 19970, + "total_submitted": 42874, "total_column_articles": 197, "frontend_question_id": "891", "is_new_question": false @@ -42390,8 +42684,8 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 30819, - "total_submitted": 39122, + "total_acs": 30861, + "total_submitted": 39175, "total_column_articles": 465, "frontend_question_id": "890", "is_new_question": false @@ -42411,9 +42705,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": 34093, - "total_submitted": 50052, - "total_column_articles": 339, + "total_acs": 34300, + "total_submitted": 50316, + "total_column_articles": 342, "frontend_question_id": "889", "is_new_question": false }, @@ -42432,9 +42726,9 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 65355, - "total_submitted": 102412, - "total_column_articles": 575, + "total_acs": 65473, + "total_submitted": 102588, + "total_column_articles": 577, "frontend_question_id": "888", "is_new_question": false }, @@ -42453,9 +42747,9 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 73451, - "total_submitted": 241261, - "total_column_articles": 451, + "total_acs": 73555, + "total_submitted": 241598, + "total_column_articles": 452, "frontend_question_id": "887", "is_new_question": false }, @@ -42474,9 +42768,9 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 44391, - "total_submitted": 85858, - "total_column_articles": 584, + "total_acs": 44538, + "total_submitted": 86129, + "total_column_articles": 586, "frontend_question_id": "886", "is_new_question": false }, @@ -42495,8 +42789,8 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 7479, - "total_submitted": 10553, + "total_acs": 7514, + "total_submitted": 10600, "total_column_articles": 121, "frontend_question_id": "885", "is_new_question": false @@ -42516,8 +42810,8 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 47757, - "total_submitted": 66746, + "total_acs": 47890, + "total_submitted": 66936, "total_column_articles": 610, "frontend_question_id": "884", "is_new_question": false @@ -42537,9 +42831,9 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 44333, - "total_submitted": 57998, - "total_column_articles": 555, + "total_acs": 44392, + "total_submitted": 58077, + "total_column_articles": 556, "frontend_question_id": "883", "is_new_question": false }, @@ -42558,8 +42852,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 15072, - "total_submitted": 23347, + "total_acs": 15101, + "total_submitted": 23401, "total_column_articles": 139, "frontend_question_id": "882", "is_new_question": false @@ -42579,8 +42873,8 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 63584, - "total_submitted": 118356, + "total_acs": 63704, + "total_submitted": 118538, "total_column_articles": 729, "frontend_question_id": "881", "is_new_question": false @@ -42600,9 +42894,9 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 8104, - "total_submitted": 30430, - "total_column_articles": 102, + "total_acs": 8139, + "total_submitted": 30554, + "total_column_articles": 103, "frontend_question_id": "880", "is_new_question": false }, @@ -42621,9 +42915,9 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 28628, - "total_submitted": 59273, - "total_column_articles": 184, + "total_acs": 28658, + "total_submitted": 59331, + "total_column_articles": 185, "frontend_question_id": "478", "is_new_question": false }, @@ -42642,9 +42936,9 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 23240, - "total_submitted": 55559, - "total_column_articles": 209, + "total_acs": 23298, + "total_submitted": 55670, + "total_column_articles": 210, "frontend_question_id": "497", "is_new_question": false }, @@ -42663,9 +42957,9 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 21255, - "total_submitted": 45781, - "total_column_articles": 204, + "total_acs": 21288, + "total_submitted": 45844, + "total_column_articles": 206, "frontend_question_id": "519", "is_new_question": false }, @@ -42684,9 +42978,9 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 52351, - "total_submitted": 108487, - "total_column_articles": 447, + "total_acs": 52537, + "total_submitted": 108875, + "total_column_articles": 448, "frontend_question_id": "528", "is_new_question": false }, @@ -42705,9 +42999,9 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 26275, - "total_submitted": 47790, - "total_column_articles": 222, + "total_acs": 26317, + "total_submitted": 47872, + "total_column_articles": 223, "frontend_question_id": "879", "is_new_question": false }, @@ -42726,8 +43020,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 23244, - "total_submitted": 58049, + "total_acs": 23284, + "total_submitted": 58117, "total_column_articles": 223, "frontend_question_id": "878", "is_new_question": false @@ -42747,8 +43041,8 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 88987, - "total_submitted": 116476, + "total_acs": 89159, + "total_submitted": 116713, "total_column_articles": 634, "frontend_question_id": "877", "is_new_question": false @@ -42768,9 +43062,9 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 345456, - "total_submitted": 490859, - "total_column_articles": 3212, + "total_acs": 347603, + "total_submitted": 493947, + "total_column_articles": 3230, "frontend_question_id": "876", "is_new_question": false }, @@ -42789,9 +43083,9 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 119227, - "total_submitted": 238614, - "total_column_articles": 911, + "total_acs": 119563, + "total_submitted": 239372, + "total_column_articles": 912, "frontend_question_id": "875", "is_new_question": false }, @@ -42810,8 +43104,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 26191, - "total_submitted": 61224, + "total_acs": 26246, + "total_submitted": 61336, "total_column_articles": 323, "frontend_question_id": "874", "is_new_question": false @@ -42831,9 +43125,9 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 47168, - "total_submitted": 83816, - "total_column_articles": 369, + "total_acs": 47257, + "total_submitted": 83960, + "total_column_articles": 371, "frontend_question_id": "873", "is_new_question": false }, @@ -42852,8 +43146,8 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 69778, - "total_submitted": 107174, + "total_acs": 69867, + "total_submitted": 107310, "total_column_articles": 847, "frontend_question_id": "872", "is_new_question": false @@ -42873,9 +43167,9 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 95906, - "total_submitted": 173566, - "total_column_articles": 444, + "total_acs": 96102, + "total_submitted": 173937, + "total_column_articles": 445, "frontend_question_id": "470", "is_new_question": false }, @@ -42894,8 +43188,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 32562, - "total_submitted": 75384, + "total_acs": 32609, + "total_submitted": 75515, "total_column_articles": 354, "frontend_question_id": "871", "is_new_question": false @@ -42915,9 +43209,9 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 59823, - "total_submitted": 119506, - "total_column_articles": 701, + "total_acs": 60049, + "total_submitted": 119907, + "total_column_articles": 709, "frontend_question_id": "870", "is_new_question": false }, @@ -42936,9 +43230,9 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 36135, - "total_submitted": 56577, - "total_column_articles": 526, + "total_acs": 36188, + "total_submitted": 56652, + "total_column_articles": 527, "frontend_question_id": "869", "is_new_question": false }, @@ -42957,8 +43251,8 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 50429, - "total_submitted": 72646, + "total_acs": 50481, + "total_submitted": 72717, "total_column_articles": 677, "frontend_question_id": "868", "is_new_question": false @@ -42978,8 +43272,8 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 94959, - "total_submitted": 142326, + "total_acs": 95064, + "total_submitted": 142475, "total_column_articles": 843, "frontend_question_id": "867", "is_new_question": false @@ -42999,8 +43293,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 10449, - "total_submitted": 43971, + "total_acs": 10498, + "total_submitted": 44290, "total_column_articles": 120, "frontend_question_id": "866", "is_new_question": false @@ -43020,8 +43314,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": 14236, - "total_submitted": 20793, + "total_acs": 14319, + "total_submitted": 20902, "total_column_articles": 214, "frontend_question_id": "865", "is_new_question": false @@ -43041,8 +43335,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 20397, - "total_submitted": 34287, + "total_acs": 20420, + "total_submitted": 34318, "total_column_articles": 242, "frontend_question_id": "864", "is_new_question": false @@ -43062,9 +43356,9 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 27629, - "total_submitted": 62918, - "total_column_articles": 399, + "total_acs": 27733, + "total_submitted": 63151, + "total_column_articles": 407, "frontend_question_id": "710", "is_new_question": false }, @@ -43083,9 +43377,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": 50078, - "total_submitted": 81411, - "total_column_articles": 721, + "total_acs": 50176, + "total_submitted": 81553, + "total_column_articles": 723, "frontend_question_id": "863", "is_new_question": false }, @@ -43104,8 +43398,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": 45372, - "total_submitted": 172847, + "total_acs": 45475, + "total_submitted": 173204, "total_column_articles": 370, "frontend_question_id": "862", "is_new_question": false @@ -43125,8 +43419,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 35045, - "total_submitted": 43371, + "total_acs": 35079, + "total_submitted": 43411, "total_column_articles": 512, "frontend_question_id": "861", "is_new_question": false @@ -43146,9 +43440,9 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 150577, - "total_submitted": 257156, - "total_column_articles": 1190, + "total_acs": 151186, + "total_submitted": 258166, + "total_column_articles": 1192, "frontend_question_id": "860", "is_new_question": false }, @@ -43167,8 +43461,8 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 67137, - "total_submitted": 194500, + "total_acs": 67200, + "total_submitted": 194726, "total_column_articles": 862, "frontend_question_id": "859", "is_new_question": false @@ -43188,8 +43482,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 4413, - "total_submitted": 7744, + "total_acs": 4446, + "total_submitted": 7788, "total_column_articles": 73, "frontend_question_id": "858", "is_new_question": false @@ -43209,8 +43503,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 19681, - "total_submitted": 30845, + "total_acs": 19711, + "total_submitted": 30886, "total_column_articles": 213, "frontend_question_id": "857", "is_new_question": false @@ -43230,8 +43524,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 52298, - "total_submitted": 76422, + "total_acs": 52368, + "total_submitted": 76512, "total_column_articles": 696, "frontend_question_id": "856", "is_new_question": false @@ -43251,9 +43545,9 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 20544, - "total_submitted": 42776, - "total_column_articles": 211, + "total_acs": 20592, + "total_submitted": 42867, + "total_column_articles": 212, "frontend_question_id": "855", "is_new_question": false }, @@ -43272,8 +43566,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 25169, - "total_submitted": 53756, + "total_acs": 25200, + "total_submitted": 53819, "total_column_articles": 242, "frontend_question_id": "854", "is_new_question": false @@ -43293,8 +43587,8 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 16582, - "total_submitted": 40487, + "total_acs": 16637, + "total_submitted": 40584, "total_column_articles": 192, "frontend_question_id": "853", "is_new_question": false @@ -43314,9 +43608,9 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 130941, - "total_submitted": 190230, - "total_column_articles": 1091, + "total_acs": 131299, + "total_submitted": 190748, + "total_column_articles": 1099, "frontend_question_id": "852", "is_new_question": false }, @@ -43335,8 +43629,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 29248, - "total_submitted": 46399, + "total_acs": 29285, + "total_submitted": 46447, "total_column_articles": 322, "frontend_question_id": "851", "is_new_question": false @@ -43356,8 +43650,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 18207, - "total_submitted": 28824, + "total_acs": 18252, + "total_submitted": 28895, "total_column_articles": 174, "frontend_question_id": "850", "is_new_question": false @@ -43377,9 +43671,9 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 20628, - "total_submitted": 47010, - "total_column_articles": 256, + "total_acs": 20690, + "total_submitted": 47125, + "total_column_articles": 257, "frontend_question_id": "849", "is_new_question": false }, @@ -43398,9 +43692,9 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 13167, - "total_submitted": 28548, - "total_column_articles": 144, + "total_acs": 13228, + "total_submitted": 28668, + "total_column_articles": 145, "frontend_question_id": "848", "is_new_question": false }, @@ -43419,9 +43713,9 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 24910, - "total_submitted": 36731, - "total_column_articles": 220, + "total_acs": 24974, + "total_submitted": 36827, + "total_column_articles": 222, "frontend_question_id": "847", "is_new_question": false }, @@ -43440,8 +43734,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 39274, - "total_submitted": 68464, + "total_acs": 39368, + "total_submitted": 68629, "total_column_articles": 530, "frontend_question_id": "846", "is_new_question": false @@ -43461,9 +43755,9 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 46558, - "total_submitted": 109925, - "total_column_articles": 683, + "total_acs": 46629, + "total_submitted": 110097, + "total_column_articles": 684, "frontend_question_id": "845", "is_new_question": false }, @@ -43482,9 +43776,9 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 179309, - "total_submitted": 370344, - "total_column_articles": 1725, + "total_acs": 180259, + "total_submitted": 372437, + "total_column_articles": 1731, "frontend_question_id": "844", "is_new_question": false }, @@ -43503,8 +43797,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 4343, - "total_submitted": 11739, + "total_acs": 4351, + "total_submitted": 11761, "total_column_articles": 62, "frontend_question_id": "843", "is_new_question": false @@ -43524,9 +43818,9 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 32941, - "total_submitted": 68120, - "total_column_articles": 372, + "total_acs": 32971, + "total_submitted": 68176, + "total_column_articles": 373, "frontend_question_id": "842", "is_new_question": false }, @@ -43545,8 +43839,8 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 79472, - "total_submitted": 117858, + "total_acs": 79762, + "total_submitted": 118223, "total_column_articles": 765, "frontend_question_id": "841", "is_new_question": false @@ -43566,8 +43860,8 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 10905, - "total_submitted": 29888, + "total_acs": 10926, + "total_submitted": 29932, "total_column_articles": 141, "frontend_question_id": "840", "is_new_question": false @@ -43587,8 +43881,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 23220, - "total_submitted": 39575, + "total_acs": 23269, + "total_submitted": 39664, "total_column_articles": 320, "frontend_question_id": "839", "is_new_question": false @@ -43608,8 +43902,8 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 38589, - "total_submitted": 69313, + "total_acs": 38641, + "total_submitted": 69377, "total_column_articles": 555, "frontend_question_id": "838", "is_new_question": false @@ -43629,8 +43923,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 21682, - "total_submitted": 54690, + "total_acs": 21724, + "total_submitted": 54798, "total_column_articles": 267, "frontend_question_id": "837", "is_new_question": false @@ -43650,9 +43944,9 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 47320, - "total_submitted": 96894, - "total_column_articles": 765, + "total_acs": 47389, + "total_submitted": 97048, + "total_column_articles": 766, "frontend_question_id": "836", "is_new_question": false }, @@ -43671,8 +43965,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 3258, - "total_submitted": 4377, + "total_acs": 3269, + "total_submitted": 4392, "total_column_articles": 36, "frontend_question_id": "489", "is_new_question": false @@ -43692,8 +43986,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 5964, - "total_submitted": 10232, + "total_acs": 5987, + "total_submitted": 10273, "total_column_articles": 66, "frontend_question_id": "835", "is_new_question": false @@ -43713,9 +44007,9 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 16214, - "total_submitted": 30045, - "total_column_articles": 167, + "total_acs": 16318, + "total_submitted": 30174, + "total_column_articles": 169, "frontend_question_id": "834", "is_new_question": false }, @@ -43734,8 +44028,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 7537, - "total_submitted": 17041, + "total_acs": 7569, + "total_submitted": 17110, "total_column_articles": 113, "frontend_question_id": "833", "is_new_question": false @@ -43755,9 +44049,9 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 97704, - "total_submitted": 122949, - "total_column_articles": 1096, + "total_acs": 97845, + "total_submitted": 123106, + "total_column_articles": 1098, "frontend_question_id": "832", "is_new_question": false }, @@ -43776,9 +44070,9 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 122774, - "total_submitted": 258336, - "total_column_articles": 949, + "total_acs": 123056, + "total_submitted": 258926, + "total_column_articles": 950, "frontend_question_id": "622", "is_new_question": false }, @@ -43797,8 +44091,8 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 56157, - "total_submitted": 98016, + "total_acs": 56257, + "total_submitted": 98240, "total_column_articles": 614, "frontend_question_id": "641", "is_new_question": false @@ -43818,9 +44112,9 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 10105, - "total_submitted": 23675, - "total_column_articles": 105, + "total_acs": 10132, + "total_submitted": 23723, + "total_column_articles": 107, "frontend_question_id": "831", "is_new_question": false }, @@ -43839,8 +44133,8 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 58245, - "total_submitted": 107376, + "total_acs": 58331, + "total_submitted": 107533, "total_column_articles": 681, "frontend_question_id": "830", "is_new_question": false @@ -43860,8 +44154,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 30488, - "total_submitted": 65357, + "total_acs": 30539, + "total_submitted": 65464, "total_column_articles": 367, "frontend_question_id": "829", "is_new_question": false @@ -43881,8 +44175,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": 27399, - "total_submitted": 41825, + "total_acs": 27430, + "total_submitted": 41867, "total_column_articles": 306, "frontend_question_id": "828", "is_new_question": false @@ -43902,8 +44196,8 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 36458, - "total_submitted": 76499, + "total_acs": 36548, + "total_submitted": 76736, "total_column_articles": 514, "frontend_question_id": "827", "is_new_question": false @@ -43923,9 +44217,9 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 14983, - "total_submitted": 35741, - "total_column_articles": 216, + "total_acs": 15060, + "total_submitted": 35872, + "total_column_articles": 218, "frontend_question_id": "826", "is_new_question": false }, @@ -43944,8 +44238,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 35933, - "total_submitted": 78916, + "total_acs": 36007, + "total_submitted": 79072, "total_column_articles": 355, "frontend_question_id": "825", "is_new_question": false @@ -43965,9 +44259,9 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 53179, - "total_submitted": 81628, - "total_column_articles": 726, + "total_acs": 53240, + "total_submitted": 81737, + "total_column_articles": 727, "frontend_question_id": "824", "is_new_question": false }, @@ -43986,8 +44280,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": 4661, - "total_submitted": 12300, + "total_acs": 4677, + "total_submitted": 12335, "total_column_articles": 89, "frontend_question_id": "708", "is_new_question": false @@ -44007,8 +44301,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 5151, - "total_submitted": 11831, + "total_acs": 5175, + "total_submitted": 11883, "total_column_articles": 72, "frontend_question_id": "823", "is_new_question": false @@ -44028,8 +44322,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 4495, - "total_submitted": 8714, + "total_acs": 4520, + "total_submitted": 8779, "total_column_articles": 65, "frontend_question_id": "822", "is_new_question": false @@ -44049,9 +44343,9 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 71419, - "total_submitted": 97822, - "total_column_articles": 970, + "total_acs": 71514, + "total_submitted": 97972, + "total_column_articles": 971, "frontend_question_id": "821", "is_new_question": false }, @@ -44070,9 +44364,9 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 67500, - "total_submitted": 130105, - "total_column_articles": 718, + "total_acs": 67579, + "total_submitted": 130253, + "total_column_articles": 720, "frontend_question_id": "820", "is_new_question": false }, @@ -44091,9 +44385,9 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 195224, - "total_submitted": 561252, - "total_column_articles": 1256, + "total_acs": 196498, + "total_submitted": 564846, + "total_column_articles": 1261, "frontend_question_id": "707", "is_new_question": false }, @@ -44112,9 +44406,9 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 57683, - "total_submitted": 125730, - "total_column_articles": 694, + "total_acs": 57782, + "total_submitted": 125991, + "total_column_articles": 695, "frontend_question_id": "819", "is_new_question": false }, @@ -44133,9 +44427,9 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 5500, - "total_submitted": 12249, - "total_column_articles": 63, + "total_acs": 5536, + "total_submitted": 12326, + "total_column_articles": 64, "frontend_question_id": "818", "is_new_question": false }, @@ -44154,8 +44448,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 48077, - "total_submitted": 78207, + "total_acs": 48140, + "total_submitted": 78320, "total_column_articles": 577, "frontend_question_id": "817", "is_new_question": false @@ -44175,9 +44469,9 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 26956, - "total_submitted": 42965, - "total_column_articles": 387, + "total_acs": 26984, + "total_submitted": 43011, + "total_column_articles": 388, "frontend_question_id": "816", "is_new_question": false }, @@ -44196,8 +44490,8 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 35504, - "total_submitted": 80351, + "total_acs": 35549, + "total_submitted": 80439, "total_column_articles": 393, "frontend_question_id": "815", "is_new_question": false @@ -44217,8 +44511,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 56978, - "total_submitted": 78540, + "total_acs": 57070, + "total_submitted": 78674, "total_column_articles": 778, "frontend_question_id": "814", "is_new_question": false @@ -44238,9 +44532,9 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 26686, - "total_submitted": 43094, - "total_column_articles": 259, + "total_acs": 26758, + "total_submitted": 43190, + "total_column_articles": 260, "frontend_question_id": "813", "is_new_question": false }, @@ -44259,8 +44553,8 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 35046, - "total_submitted": 51145, + "total_acs": 35130, + "total_submitted": 51267, "total_column_articles": 312, "frontend_question_id": "812", "is_new_question": false @@ -44280,8 +44574,8 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 43206, - "total_submitted": 56378, + "total_acs": 43252, + "total_submitted": 56433, "total_column_articles": 553, "frontend_question_id": "811", "is_new_question": false @@ -44301,8 +44595,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 18601, - "total_submitted": 25580, + "total_acs": 18616, + "total_submitted": 25604, "total_column_articles": 153, "frontend_question_id": "810", "is_new_question": false @@ -44322,8 +44616,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 24950, - "total_submitted": 50786, + "total_acs": 24975, + "total_submitted": 50871, "total_column_articles": 365, "frontend_question_id": "809", "is_new_question": false @@ -44343,8 +44637,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 21695, - "total_submitted": 36800, + "total_acs": 21719, + "total_submitted": 36845, "total_column_articles": 162, "frontend_question_id": "808", "is_new_question": false @@ -44364,9 +44658,9 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 52341, - "total_submitted": 59307, - "total_column_articles": 748, + "total_acs": 52405, + "total_submitted": 59379, + "total_column_articles": 749, "frontend_question_id": "807", "is_new_question": false }, @@ -44385,9 +44679,9 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 50724, - "total_submitted": 73872, - "total_column_articles": 626, + "total_acs": 50835, + "total_submitted": 74041, + "total_column_articles": 627, "frontend_question_id": "806", "is_new_question": false }, @@ -44406,8 +44700,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 20999, - "total_submitted": 48310, + "total_acs": 21026, + "total_submitted": 48404, "total_column_articles": 185, "frontend_question_id": "805", "is_new_question": false @@ -44427,9 +44721,9 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 76653, - "total_submitted": 93226, - "total_column_articles": 812, + "total_acs": 76766, + "total_submitted": 93348, + "total_column_articles": 814, "frontend_question_id": "804", "is_new_question": false }, @@ -44448,9 +44742,9 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 14201, - "total_submitted": 30010, - "total_column_articles": 149, + "total_acs": 14243, + "total_submitted": 30088, + "total_column_articles": 150, "frontend_question_id": "803", "is_new_question": false }, @@ -44469,8 +44763,8 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 41672, - "total_submitted": 70524, + "total_acs": 41747, + "total_submitted": 70633, "total_column_articles": 443, "frontend_question_id": "802", "is_new_question": false @@ -44490,9 +44784,9 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 30353, - "total_submitted": 59928, - "total_column_articles": 310, + "total_acs": 30385, + "total_submitted": 59994, + "total_column_articles": 311, "frontend_question_id": "801", "is_new_question": false }, @@ -44511,8 +44805,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 2166, - "total_submitted": 3085, + "total_acs": 2181, + "total_submitted": 3109, "total_column_articles": 53, "frontend_question_id": "800", "is_new_question": false @@ -44532,9 +44826,9 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 90887, - "total_submitted": 142475, - "total_column_articles": 571, + "total_acs": 91229, + "total_submitted": 143011, + "total_column_articles": 573, "frontend_question_id": "706", "is_new_question": false }, @@ -44553,8 +44847,8 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 97740, - "total_submitted": 153936, + "total_acs": 97982, + "total_submitted": 154319, "total_column_articles": 596, "frontend_question_id": "705", "is_new_question": false @@ -44574,8 +44868,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 27568, - "total_submitted": 51732, + "total_acs": 27619, + "total_submitted": 51819, "total_column_articles": 304, "frontend_question_id": "799", "is_new_question": false @@ -44595,8 +44889,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 20792, - "total_submitted": 33713, + "total_acs": 20808, + "total_submitted": 33752, "total_column_articles": 219, "frontend_question_id": "798", "is_new_question": false @@ -44616,9 +44910,9 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 91542, - "total_submitted": 115807, - "total_column_articles": 1714, + "total_acs": 92010, + "total_submitted": 116384, + "total_column_articles": 1719, "frontend_question_id": "797", "is_new_question": false }, @@ -44637,9 +44931,9 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 76382, - "total_submitted": 120628, - "total_column_articles": 859, + "total_acs": 76551, + "total_submitted": 120875, + "total_column_articles": 862, "frontend_question_id": "796", "is_new_question": false }, @@ -44658,8 +44952,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 34219, - "total_submitted": 59284, + "total_acs": 34267, + "total_submitted": 59352, "total_column_articles": 338, "frontend_question_id": "795", "is_new_question": false @@ -44679,8 +44973,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 30625, - "total_submitted": 79172, + "total_acs": 30654, + "total_submitted": 79250, "total_column_articles": 494, "frontend_question_id": "794", "is_new_question": false @@ -44700,8 +44994,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 26041, - "total_submitted": 53448, + "total_acs": 26107, + "total_submitted": 53592, "total_column_articles": 274, "frontend_question_id": "793", "is_new_question": false @@ -44721,8 +45015,8 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 38726, - "total_submitted": 75647, + "total_acs": 38814, + "total_submitted": 75806, "total_column_articles": 440, "frontend_question_id": "792", "is_new_question": false @@ -44742,9 +45036,9 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 39872, - "total_submitted": 53685, - "total_column_articles": 586, + "total_acs": 39927, + "total_submitted": 53759, + "total_column_articles": 588, "frontend_question_id": "791", "is_new_question": false }, @@ -44763,8 +45057,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 24476, - "total_submitted": 43057, + "total_acs": 24510, + "total_submitted": 43145, "total_column_articles": 275, "frontend_question_id": "790", "is_new_question": false @@ -44784,9 +45078,9 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 22769, - "total_submitted": 33190, - "total_column_articles": 317, + "total_acs": 22810, + "total_submitted": 33247, + "total_column_articles": 318, "frontend_question_id": "789", "is_new_question": false }, @@ -44805,9 +45099,9 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 44436, - "total_submitted": 67083, - "total_column_articles": 507, + "total_acs": 44459, + "total_submitted": 67140, + "total_column_articles": 506, "frontend_question_id": "788", "is_new_question": false }, @@ -44826,9 +45120,9 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 62089, - "total_submitted": 157570, - "total_column_articles": 616, + "total_acs": 62275, + "total_submitted": 158019, + "total_column_articles": 621, "frontend_question_id": "787", "is_new_question": false }, @@ -44847,8 +45141,8 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 30894, - "total_submitted": 45645, + "total_acs": 30977, + "total_submitted": 45762, "total_column_articles": 309, "frontend_question_id": "786", "is_new_question": false @@ -44868,9 +45162,9 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 71033, - "total_submitted": 131094, - "total_column_articles": 1368, + "total_acs": 71349, + "total_submitted": 131596, + "total_column_articles": 1372, "frontend_question_id": "785", "is_new_question": false }, @@ -44889,9 +45183,9 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 99678, - "total_submitted": 137523, - "total_column_articles": 1127, + "total_acs": 100043, + "total_submitted": 138010, + "total_column_articles": 1128, "frontend_question_id": "784", "is_new_question": false }, @@ -44910,8 +45204,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 82608, - "total_submitted": 137504, + "total_acs": 82719, + "total_submitted": 137708, "total_column_articles": 807, "frontend_question_id": "783", "is_new_question": false @@ -44931,8 +45225,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 14037, - "total_submitted": 23440, + "total_acs": 14049, + "total_submitted": 23463, "total_column_articles": 149, "frontend_question_id": "782", "is_new_question": false @@ -44952,8 +45246,8 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 53265, - "total_submitted": 89824, + "total_acs": 53337, + "total_submitted": 89949, "total_column_articles": 778, "frontend_question_id": "781", "is_new_question": false @@ -44973,8 +45267,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 26037, - "total_submitted": 68972, + "total_acs": 26070, + "total_submitted": 69062, "total_column_articles": 262, "frontend_question_id": "780", "is_new_question": false @@ -44994,8 +45288,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 50164, - "total_submitted": 100627, + "total_acs": 50209, + "total_submitted": 100714, "total_column_articles": 742, "frontend_question_id": "779", "is_new_question": false @@ -45015,8 +45309,8 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 31147, - "total_submitted": 52737, + "total_acs": 31198, + "total_submitted": 52819, "total_column_articles": 415, "frontend_question_id": "778", "is_new_question": false @@ -45036,9 +45330,9 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 27615, - "total_submitted": 71632, - "total_column_articles": 302, + "total_acs": 27672, + "total_submitted": 71771, + "total_column_articles": 301, "frontend_question_id": "777", "is_new_question": false }, @@ -45057,9 +45351,9 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 850679, - "total_submitted": 1558668, - "total_column_articles": 4318, + "total_acs": 855920, + "total_submitted": 1568448, + "total_column_articles": 4353, "frontend_question_id": "704", "is_new_question": false }, @@ -45078,9 +45372,9 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 2552, - "total_submitted": 4294, - "total_column_articles": 51, + "total_acs": 2558, + "total_submitted": 4305, + "total_column_articles": 52, "frontend_question_id": "776", "is_new_question": false }, @@ -45099,8 +45393,8 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 32146, - "total_submitted": 65161, + "total_acs": 32195, + "total_submitted": 65242, "total_column_articles": 414, "frontend_question_id": "775", "is_new_question": false @@ -45120,9 +45414,9 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 82509, - "total_submitted": 157450, - "total_column_articles": 761, + "total_acs": 82721, + "total_submitted": 157860, + "total_column_articles": 765, "frontend_question_id": "703", "is_new_question": false }, @@ -45141,8 +45435,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 2124, - "total_submitted": 3368, + "total_acs": 2129, + "total_submitted": 3375, "total_column_articles": 34, "frontend_question_id": "774", "is_new_question": false @@ -45162,9 +45456,9 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 32611, - "total_submitted": 46408, - "total_column_articles": 486, + "total_acs": 32679, + "total_submitted": 46502, + "total_column_articles": 488, "frontend_question_id": "773", "is_new_question": false }, @@ -45183,9 +45477,9 @@ "question__title": "Search in a Sorted Array of Unknown Size", "question__title_slug": "search-in-a-sorted-array-of-unknown-size", "question__hide": false, - "total_acs": 7519, - "total_submitted": 10059, - "total_column_articles": 118, + "total_acs": 7539, + "total_submitted": 10080, + "total_column_articles": 119, "frontend_question_id": "702", "is_new_question": false }, @@ -45204,8 +45498,8 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 11981, - "total_submitted": 22581, + "total_acs": 12011, + "total_submitted": 22633, "total_column_articles": 191, "frontend_question_id": "772", "is_new_question": false @@ -45225,9 +45519,9 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 166036, - "total_submitted": 232702, - "total_column_articles": 1205, + "total_acs": 167167, + "total_submitted": 234354, + "total_column_articles": 1216, "frontend_question_id": "701", "is_new_question": false }, @@ -45246,9 +45540,9 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 221391, - "total_submitted": 285131, - "total_column_articles": 1640, + "total_acs": 222817, + "total_submitted": 286884, + "total_column_articles": 1666, "frontend_question_id": "700", "is_new_question": false }, @@ -45267,9 +45561,9 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 177187, - "total_submitted": 208010, - "total_column_articles": 1388, + "total_acs": 177427, + "total_submitted": 208275, + "total_column_articles": 1394, "frontend_question_id": "771", "is_new_question": false }, @@ -45288,8 +45582,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 1762, - "total_submitted": 3127, + "total_acs": 1769, + "total_submitted": 3135, "total_column_articles": 37, "frontend_question_id": "770", "is_new_question": false @@ -45309,8 +45603,8 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 52415, - "total_submitted": 88339, + "total_acs": 52496, + "total_submitted": 88475, "total_column_articles": 736, "frontend_question_id": "769", "is_new_question": false @@ -45330,8 +45624,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 30787, - "total_submitted": 52286, + "total_acs": 30838, + "total_submitted": 52376, "total_column_articles": 372, "frontend_question_id": "768", "is_new_question": false @@ -45351,9 +45645,9 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 49928, - "total_submitted": 103290, - "total_column_articles": 599, + "total_acs": 50019, + "total_submitted": 103460, + "total_column_articles": 600, "frontend_question_id": "767", "is_new_question": false }, @@ -45372,9 +45666,9 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 65254, - "total_submitted": 92725, - "total_column_articles": 749, + "total_acs": 65334, + "total_submitted": 92828, + "total_column_articles": 750, "frontend_question_id": "766", "is_new_question": false }, @@ -45393,9 +45687,9 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 121003, - "total_submitted": 154183, - "total_column_articles": 883, + "total_acs": 121265, + "total_submitted": 154488, + "total_column_articles": 886, "frontend_question_id": "590", "is_new_question": false }, @@ -45414,9 +45708,9 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 174452, - "total_submitted": 228071, - "total_column_articles": 1085, + "total_acs": 174933, + "total_submitted": 228657, + "total_column_articles": 1092, "frontend_question_id": "589", "is_new_question": false }, @@ -45435,9 +45729,9 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 131306, - "total_submitted": 175539, - "total_column_articles": 1013, + "total_acs": 131797, + "total_submitted": 176161, + "total_column_articles": 1016, "frontend_question_id": "559", "is_new_question": false }, @@ -45456,8 +45750,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": 17786, - "total_submitted": 28257, + "total_acs": 17794, + "total_submitted": 28272, "total_column_articles": 161, "frontend_question_id": "558", "is_new_question": false @@ -45477,8 +45771,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 24725, - "total_submitted": 34678, + "total_acs": 24756, + "total_submitted": 34728, "total_column_articles": 328, "frontend_question_id": "427", "is_new_question": false @@ -45498,9 +45792,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": 1777, - "total_submitted": 2367, - "total_column_articles": 43, + "total_acs": 1790, + "total_submitted": 2385, + "total_column_articles": 44, "frontend_question_id": "431", "is_new_question": false }, @@ -45519,9 +45813,9 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 36274, - "total_submitted": 54932, - "total_column_articles": 536, + "total_acs": 36337, + "total_submitted": 55059, + "total_column_articles": 537, "frontend_question_id": "765", "is_new_question": false }, @@ -45540,8 +45834,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 28562, - "total_submitted": 52645, + "total_acs": 28587, + "total_submitted": 52692, "total_column_articles": 336, "frontend_question_id": "764", "is_new_question": false @@ -45561,9 +45855,9 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 146147, - "total_submitted": 190069, - "total_column_articles": 1472, + "total_acs": 146865, + "total_submitted": 191036, + "total_column_articles": 1476, "frontend_question_id": "763", "is_new_question": false }, @@ -45582,8 +45876,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": 54679, - "total_submitted": 72429, + "total_acs": 54767, + "total_submitted": 72550, "total_column_articles": 484, "frontend_question_id": "762", "is_new_question": false @@ -45603,8 +45897,8 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 59074, - "total_submitted": 99573, + "total_acs": 59270, + "total_submitted": 99850, "total_column_articles": 859, "frontend_question_id": "430", "is_new_question": false @@ -45624,8 +45918,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 5033, - "total_submitted": 7340, + "total_acs": 5049, + "total_submitted": 7359, "total_column_articles": 81, "frontend_question_id": "428", "is_new_question": false @@ -45645,9 +45939,9 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 140277, - "total_submitted": 193239, - "total_column_articles": 1092, + "total_acs": 140795, + "total_submitted": 193955, + "total_column_articles": 1096, "frontend_question_id": "429", "is_new_question": false }, @@ -45666,8 +45960,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 16662, - "total_submitted": 22077, + "total_acs": 16671, + "total_submitted": 22093, "total_column_articles": 149, "frontend_question_id": "761", "is_new_question": false @@ -45687,9 +45981,9 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 5231, - "total_submitted": 6230, - "total_column_articles": 122, + "total_acs": 5245, + "total_submitted": 6245, + "total_column_articles": 123, "frontend_question_id": "760", "is_new_question": false }, @@ -45708,8 +46002,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 3997, - "total_submitted": 5707, + "total_acs": 4023, + "total_submitted": 5745, "total_column_articles": 71, "frontend_question_id": "759", "is_new_question": false @@ -45729,8 +46023,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 4246, - "total_submitted": 8819, + "total_acs": 4252, + "total_submitted": 8831, "total_column_articles": 80, "frontend_question_id": "758", "is_new_question": false @@ -45750,8 +46044,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 17767, - "total_submitted": 31722, + "total_acs": 17785, + "total_submitted": 31752, "total_column_articles": 192, "frontend_question_id": "757", "is_new_question": false @@ -45771,8 +46065,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": 12820, - "total_submitted": 18815, + "total_acs": 12853, + "total_submitted": 18867, "total_column_articles": 183, "frontend_question_id": "426", "is_new_question": false @@ -45792,8 +46086,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 6326, - "total_submitted": 12007, + "total_acs": 6352, + "total_submitted": 12096, "total_column_articles": 98, "frontend_question_id": "756", "is_new_question": false @@ -45813,8 +46107,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 1856, - "total_submitted": 3840, + "total_acs": 1863, + "total_submitted": 3854, "total_column_articles": 41, "frontend_question_id": "755", "is_new_question": false @@ -45834,8 +46128,8 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 35861, - "total_submitted": 69806, + "total_acs": 35900, + "total_submitted": 69866, "total_column_articles": 399, "frontend_question_id": "754", "is_new_question": false @@ -45855,9 +46149,9 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 15748, - "total_submitted": 20934, - "total_column_articles": 146, + "total_acs": 15934, + "total_submitted": 21173, + "total_column_articles": 147, "frontend_question_id": "753", "is_new_question": false }, @@ -45876,9 +46170,9 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 110816, - "total_submitted": 209834, - "total_column_articles": 1151, + "total_acs": 111113, + "total_submitted": 210389, + "total_column_articles": 1155, "frontend_question_id": "752", "is_new_question": false }, @@ -45897,8 +46191,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 1831, - "total_submitted": 3831, + "total_acs": 1836, + "total_submitted": 3837, "total_column_articles": 35, "frontend_question_id": "751", "is_new_question": false @@ -45918,9 +46212,9 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 3106, - "total_submitted": 4285, - "total_column_articles": 59, + "total_acs": 3127, + "total_submitted": 4307, + "total_column_articles": 60, "frontend_question_id": "750", "is_new_question": false }, @@ -45939,9 +46233,9 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 13495, - "total_submitted": 19456, - "total_column_articles": 138, + "total_acs": 13503, + "total_submitted": 19472, + "total_column_articles": 137, "frontend_question_id": "749", "is_new_question": false }, @@ -45960,9 +46254,9 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 45082, - "total_submitted": 67197, - "total_column_articles": 560, + "total_acs": 45161, + "total_submitted": 67303, + "total_column_articles": 562, "frontend_question_id": "748", "is_new_question": false }, @@ -45981,9 +46275,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": 89499, - "total_submitted": 193928, - "total_column_articles": 907, + "total_acs": 89660, + "total_submitted": 194346, + "total_column_articles": 911, "frontend_question_id": "747", "is_new_question": false }, @@ -46002,9 +46296,9 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 272767, - "total_submitted": 427511, - "total_column_articles": 2185, + "total_acs": 274036, + "total_submitted": 429251, + "total_column_articles": 2193, "frontend_question_id": "746", "is_new_question": false }, @@ -46023,9 +46317,9 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 24234, - "total_submitted": 55208, - "total_column_articles": 254, + "total_acs": 24274, + "total_submitted": 55295, + "total_column_articles": 255, "frontend_question_id": "745", "is_new_question": false }, @@ -46044,9 +46338,9 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 105053, - "total_submitted": 217609, - "total_column_articles": 915, + "total_acs": 105361, + "total_submitted": 218169, + "total_column_articles": 918, "frontend_question_id": "744", "is_new_question": false }, @@ -46065,9 +46359,9 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 97646, - "total_submitted": 176848, - "total_column_articles": 813, + "total_acs": 98083, + "total_submitted": 177565, + "total_column_articles": 814, "frontend_question_id": "743", "is_new_question": false }, @@ -46086,8 +46380,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 2488, - "total_submitted": 5073, + "total_acs": 2494, + "total_submitted": 5095, "total_column_articles": 77, "frontend_question_id": "742", "is_new_question": false @@ -46107,9 +46401,9 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 117816, - "total_submitted": 152801, - "total_column_articles": 865, + "total_acs": 118093, + "total_submitted": 153172, + "total_column_articles": 868, "frontend_question_id": "709", "is_new_question": false }, @@ -46128,8 +46422,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 18867, - "total_submitted": 37316, + "total_acs": 18881, + "total_submitted": 37350, "total_column_articles": 139, "frontend_question_id": "741", "is_new_question": false @@ -46149,9 +46443,9 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 89134, - "total_submitted": 142651, - "total_column_articles": 906, + "total_acs": 89367, + "total_submitted": 143033, + "total_column_articles": 911, "frontend_question_id": "740", "is_new_question": false }, @@ -46170,9 +46464,9 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 387177, - "total_submitted": 557791, - "total_column_articles": 2472, + "total_acs": 388507, + "total_submitted": 559788, + "total_column_articles": 2479, "frontend_question_id": "739", "is_new_question": false }, @@ -46191,9 +46485,9 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 78082, - "total_submitted": 155162, - "total_column_articles": 873, + "total_acs": 78541, + "total_submitted": 156010, + "total_column_articles": 876, "frontend_question_id": "738", "is_new_question": false }, @@ -46212,9 +46506,9 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 5797, - "total_submitted": 12159, - "total_column_articles": 106, + "total_acs": 5903, + "total_submitted": 12310, + "total_column_articles": 108, "frontend_question_id": "737", "is_new_question": false }, @@ -46233,8 +46527,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 13286, - "total_submitted": 19894, + "total_acs": 13291, + "total_submitted": 19901, "total_column_articles": 151, "frontend_question_id": "736", "is_new_question": false @@ -46254,9 +46548,9 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 68420, - "total_submitted": 157667, - "total_column_articles": 779, + "total_acs": 68549, + "total_submitted": 157962, + "total_column_articles": 780, "frontend_question_id": "735", "is_new_question": false }, @@ -46275,9 +46569,9 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 3172, - "total_submitted": 6662, - "total_column_articles": 66, + "total_acs": 3234, + "total_submitted": 6778, + "total_column_articles": 67, "frontend_question_id": "734", "is_new_question": false }, @@ -46296,9 +46590,9 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 145096, - "total_submitted": 247694, - "total_column_articles": 1199, + "total_acs": 145944, + "total_submitted": 249012, + "total_column_articles": 1205, "frontend_question_id": "733", "is_new_question": false }, @@ -46317,8 +46611,8 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 23329, - "total_submitted": 32213, + "total_acs": 23370, + "total_submitted": 32268, "total_column_articles": 228, "frontend_question_id": "732", "is_new_question": false @@ -46338,8 +46632,8 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 27279, - "total_submitted": 43312, + "total_acs": 27317, + "total_submitted": 43376, "total_column_articles": 236, "frontend_question_id": "731", "is_new_question": false @@ -46359,9 +46653,9 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 17536, - "total_submitted": 27196, - "total_column_articles": 122, + "total_acs": 17581, + "total_submitted": 27268, + "total_column_articles": 123, "frontend_question_id": "730", "is_new_question": false }, @@ -46380,8 +46674,8 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 48691, - "total_submitted": 83174, + "total_acs": 48812, + "total_submitted": 83379, "total_column_articles": 421, "frontend_question_id": "729", "is_new_question": false @@ -46401,9 +46695,9 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 76543, - "total_submitted": 98534, - "total_column_articles": 727, + "total_acs": 76683, + "total_submitted": 98808, + "total_column_articles": 729, "frontend_question_id": "728", "is_new_question": false }, @@ -46422,9 +46716,9 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 5527, - "total_submitted": 13128, - "total_column_articles": 79, + "total_acs": 5545, + "total_submitted": 13165, + "total_column_articles": 81, "frontend_question_id": "727", "is_new_question": false }, @@ -46443,8 +46737,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 26329, - "total_submitted": 47729, + "total_acs": 26351, + "total_submitted": 47770, "total_column_articles": 475, "frontend_question_id": "726", "is_new_question": false @@ -46464,9 +46758,9 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 58590, - "total_submitted": 96866, - "total_column_articles": 734, + "total_acs": 58680, + "total_submitted": 97009, + "total_column_articles": 736, "frontend_question_id": "725", "is_new_question": false }, @@ -46485,9 +46779,9 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 253123, - "total_submitted": 497109, - "total_column_articles": 1403, + "total_acs": 254200, + "total_submitted": 499170, + "total_column_articles": 1411, "frontend_question_id": "724", "is_new_question": false }, @@ -46506,8 +46800,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 2178, - "total_submitted": 2976, + "total_acs": 2191, + "total_submitted": 2993, "total_column_articles": 55, "frontend_question_id": "723", "is_new_question": false @@ -46527,8 +46821,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 7642, - "total_submitted": 22721, + "total_acs": 7666, + "total_submitted": 22783, "total_column_articles": 99, "frontend_question_id": "722", "is_new_question": false @@ -46548,9 +46842,9 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 37545, - "total_submitted": 78200, - "total_column_articles": 419, + "total_acs": 37629, + "total_submitted": 78367, + "total_column_articles": 420, "frontend_question_id": "721", "is_new_question": false }, @@ -46569,8 +46863,8 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 64219, - "total_submitted": 123752, + "total_acs": 64294, + "total_submitted": 123907, "total_column_articles": 700, "frontend_question_id": "720", "is_new_question": false @@ -46590,8 +46884,8 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 32652, - "total_submitted": 70160, + "total_acs": 32701, + "total_submitted": 70256, "total_column_articles": 267, "frontend_question_id": "719", "is_new_question": false @@ -46611,9 +46905,9 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 166786, - "total_submitted": 292069, - "total_column_articles": 950, + "total_acs": 167509, + "total_submitted": 293334, + "total_column_articles": 952, "frontend_question_id": "718", "is_new_question": false }, @@ -46632,9 +46926,9 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 66419, - "total_submitted": 120057, - "total_column_articles": 804, + "total_acs": 66517, + "total_submitted": 120220, + "total_column_articles": 808, "frontend_question_id": "717", "is_new_question": false }, @@ -46653,8 +46947,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 6816, - "total_submitted": 15024, + "total_acs": 6824, + "total_submitted": 15041, "total_column_articles": 106, "frontend_question_id": "716", "is_new_question": false @@ -46674,9 +46968,9 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 18772, - "total_submitted": 35091, - "total_column_articles": 196, + "total_acs": 18809, + "total_submitted": 35166, + "total_column_articles": 198, "frontend_question_id": "715", "is_new_question": false }, @@ -46695,9 +46989,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": 192765, - "total_submitted": 257771, - "total_column_articles": 1169, + "total_acs": 193723, + "total_submitted": 258951, + "total_column_articles": 1173, "frontend_question_id": "714", "is_new_question": false }, @@ -46716,9 +47010,9 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 91738, - "total_submitted": 186794, - "total_column_articles": 832, + "total_acs": 92282, + "total_submitted": 187737, + "total_column_articles": 836, "frontend_question_id": "713", "is_new_question": false }, @@ -46737,8 +47031,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": 27933, - "total_submitted": 40777, + "total_acs": 28024, + "total_submitted": 40906, "total_column_articles": 305, "frontend_question_id": "712", "is_new_question": false @@ -46758,8 +47052,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 1318, - "total_submitted": 2289, + "total_acs": 1321, + "total_submitted": 2302, "total_column_articles": 42, "frontend_question_id": "711", "is_new_question": false @@ -46779,9 +47073,9 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 21765, - "total_submitted": 39664, - "total_column_articles": 226, + "total_acs": 21808, + "total_submitted": 39736, + "total_column_articles": 227, "frontend_question_id": "699", "is_new_question": false }, @@ -46800,9 +47094,9 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 93933, - "total_submitted": 220412, - "total_column_articles": 1305, + "total_acs": 94279, + "total_submitted": 221179, + "total_column_articles": 1318, "frontend_question_id": "698", "is_new_question": false }, @@ -46821,9 +47115,9 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 85533, - "total_submitted": 143441, - "total_column_articles": 1070, + "total_acs": 85748, + "total_submitted": 143751, + "total_column_articles": 1074, "frontend_question_id": "697", "is_new_question": false }, @@ -46842,8 +47136,8 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 66830, - "total_submitted": 104576, + "total_acs": 66977, + "total_submitted": 104820, "total_column_articles": 606, "frontend_question_id": "696", "is_new_question": false @@ -46863,9 +47157,9 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 258311, - "total_submitted": 379678, - "total_column_articles": 2366, + "total_acs": 259360, + "total_submitted": 381159, + "total_column_articles": 2371, "frontend_question_id": "695", "is_new_question": false }, @@ -46884,9 +47178,9 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 9731, - "total_submitted": 17010, - "total_column_articles": 164, + "total_acs": 9757, + "total_submitted": 17051, + "total_column_articles": 163, "frontend_question_id": "694", "is_new_question": false }, @@ -46905,9 +47199,9 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 74569, - "total_submitted": 114393, - "total_column_articles": 811, + "total_acs": 74667, + "total_submitted": 114530, + "total_column_articles": 815, "frontend_question_id": "693", "is_new_question": false }, @@ -46926,9 +47220,9 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 98355, - "total_submitted": 173642, - "total_column_articles": 1021, + "total_acs": 98605, + "total_submitted": 174072, + "total_column_articles": 1024, "frontend_question_id": "692", "is_new_question": false }, @@ -46947,9 +47241,9 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 22830, - "total_submitted": 38065, - "total_column_articles": 197, + "total_acs": 22914, + "total_submitted": 38219, + "total_column_articles": 198, "frontend_question_id": "691", "is_new_question": false }, @@ -46968,9 +47262,9 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 63934, - "total_submitted": 97588, - "total_column_articles": 659, + "total_acs": 64008, + "total_submitted": 97680, + "total_column_articles": 660, "frontend_question_id": "690", "is_new_question": false }, @@ -46989,8 +47283,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": 22151, - "total_submitted": 39390, + "total_acs": 22181, + "total_submitted": 39437, "total_column_articles": 286, "frontend_question_id": "689", "is_new_question": false @@ -47010,8 +47304,8 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 34803, - "total_submitted": 59755, + "total_acs": 34847, + "total_submitted": 59834, "total_column_articles": 383, "frontend_question_id": "688", "is_new_question": false @@ -47031,9 +47325,9 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 78925, - "total_submitted": 165959, - "total_column_articles": 649, + "total_acs": 79096, + "total_submitted": 166304, + "total_column_articles": 652, "frontend_question_id": "687", "is_new_question": false }, @@ -47052,9 +47346,9 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 48652, - "total_submitted": 121881, - "total_column_articles": 630, + "total_acs": 48731, + "total_submitted": 122096, + "total_column_articles": 631, "frontend_question_id": "686", "is_new_question": false }, @@ -47073,9 +47367,9 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 27011, - "total_submitted": 63972, - "total_column_articles": 336, + "total_acs": 27078, + "total_submitted": 64143, + "total_column_articles": 337, "frontend_question_id": "685", "is_new_question": false }, @@ -47094,9 +47388,9 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 90239, - "total_submitted": 133697, - "total_column_articles": 880, + "total_acs": 90553, + "total_submitted": 134133, + "total_column_articles": 882, "frontend_question_id": "684", "is_new_question": false }, @@ -47115,8 +47409,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 3804, - "total_submitted": 8408, + "total_acs": 3814, + "total_submitted": 8430, "total_column_articles": 77, "frontend_question_id": "683", "is_new_question": false @@ -47136,9 +47430,9 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 89130, - "total_submitted": 124293, - "total_column_articles": 953, + "total_acs": 89321, + "total_submitted": 124594, + "total_column_articles": 955, "frontend_question_id": "682", "is_new_question": false }, @@ -47157,8 +47451,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 4239, - "total_submitted": 8530, + "total_acs": 4248, + "total_submitted": 8540, "total_column_articles": 90, "frontend_question_id": "681", "is_new_question": false @@ -47178,9 +47472,9 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 125881, - "total_submitted": 314134, - "total_column_articles": 1134, + "total_acs": 126282, + "total_submitted": 315080, + "total_column_articles": 1140, "frontend_question_id": "680", "is_new_question": false }, @@ -47199,8 +47493,8 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 38195, - "total_submitted": 70891, + "total_acs": 38242, + "total_submitted": 70981, "total_column_articles": 355, "frontend_question_id": "679", "is_new_question": false @@ -47220,9 +47514,9 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 64020, - "total_submitted": 163310, - "total_column_articles": 654, + "total_acs": 64143, + "total_submitted": 163620, + "total_column_articles": 655, "frontend_question_id": "678", "is_new_question": false }, @@ -47241,9 +47535,9 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 46194, - "total_submitted": 70105, - "total_column_articles": 686, + "total_acs": 46295, + "total_submitted": 70259, + "total_column_articles": 687, "frontend_question_id": "677", "is_new_question": false }, @@ -47262,9 +47556,9 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 37755, - "total_submitted": 57824, - "total_column_articles": 461, + "total_acs": 37815, + "total_submitted": 57904, + "total_column_articles": 463, "frontend_question_id": "676", "is_new_question": false }, @@ -47283,8 +47577,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 21063, - "total_submitted": 39894, + "total_acs": 21079, + "total_submitted": 39938, "total_column_articles": 216, "frontend_question_id": "675", "is_new_question": false @@ -47304,9 +47598,9 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 167841, - "total_submitted": 307305, - "total_column_articles": 1197, + "total_acs": 168501, + "total_submitted": 308322, + "total_column_articles": 1201, "frontend_question_id": "674", "is_new_question": false }, @@ -47325,8 +47619,8 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 78711, - "total_submitted": 176666, + "total_acs": 79029, + "total_submitted": 177276, "total_column_articles": 605, "frontend_question_id": "673", "is_new_question": false @@ -47346,8 +47640,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 26053, - "total_submitted": 42728, + "total_acs": 26083, + "total_submitted": 42789, "total_column_articles": 259, "frontend_question_id": "672", "is_new_question": false @@ -47367,9 +47661,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": 66718, - "total_submitted": 138723, - "total_column_articles": 836, + "total_acs": 66840, + "total_submitted": 138967, + "total_column_articles": 840, "frontend_question_id": "671", "is_new_question": false }, @@ -47388,8 +47682,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 64721, - "total_submitted": 135072, + "total_acs": 64870, + "total_submitted": 135362, "total_column_articles": 918, "frontend_question_id": "670", "is_new_question": false @@ -47409,9 +47703,9 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 107667, - "total_submitted": 158430, - "total_column_articles": 840, + "total_acs": 108339, + "total_submitted": 159378, + "total_column_articles": 844, "frontend_question_id": "669", "is_new_question": false }, @@ -47430,9 +47724,9 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 29566, - "total_submitted": 50419, - "total_column_articles": 271, + "total_acs": 29603, + "total_submitted": 50472, + "total_column_articles": 272, "frontend_question_id": "668", "is_new_question": false }, @@ -47451,8 +47745,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 34953, - "total_submitted": 52447, + "total_acs": 34981, + "total_submitted": 52489, "total_column_articles": 514, "frontend_question_id": "667", "is_new_question": false @@ -47472,9 +47766,9 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 3282, - "total_submitted": 5231, - "total_column_articles": 105, + "total_acs": 3297, + "total_submitted": 5259, + "total_column_articles": 107, "frontend_question_id": "666", "is_new_question": false }, @@ -47493,9 +47787,9 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 94049, - "total_submitted": 339982, - "total_column_articles": 1137, + "total_acs": 94190, + "total_submitted": 340447, + "total_column_articles": 1138, "frontend_question_id": "665", "is_new_question": false }, @@ -47514,9 +47808,9 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 26240, - "total_submitted": 40195, - "total_column_articles": 221, + "total_acs": 26302, + "total_submitted": 40279, + "total_column_articles": 222, "frontend_question_id": "664", "is_new_question": false }, @@ -47535,9 +47829,9 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 2666, - "total_submitted": 5818, - "total_column_articles": 56, + "total_acs": 2674, + "total_submitted": 5832, + "total_column_articles": 57, "frontend_question_id": "663", "is_new_question": false }, @@ -47556,9 +47850,9 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 82430, - "total_submitted": 188903, - "total_column_articles": 773, + "total_acs": 82649, + "total_submitted": 189373, + "total_column_articles": 776, "frontend_question_id": "662", "is_new_question": false }, @@ -47577,8 +47871,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 50983, - "total_submitted": 79145, + "total_acs": 51094, + "total_submitted": 79297, "total_column_articles": 553, "frontend_question_id": "661", "is_new_question": false @@ -47598,8 +47892,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 1287, - "total_submitted": 1971, + "total_acs": 1289, + "total_submitted": 1974, "total_column_articles": 37, "frontend_question_id": "660", "is_new_question": false @@ -47619,9 +47913,9 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 35120, - "total_submitted": 64396, - "total_column_articles": 362, + "total_acs": 35197, + "total_submitted": 64526, + "total_column_articles": 368, "frontend_question_id": "659", "is_new_question": false }, @@ -47640,8 +47934,8 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 84127, - "total_submitted": 174789, + "total_acs": 84424, + "total_submitted": 175374, "total_column_articles": 798, "frontend_question_id": "658", "is_new_question": false @@ -47661,9 +47955,9 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 99475, - "total_submitted": 126245, - "total_column_articles": 798, + "total_acs": 99703, + "total_submitted": 126508, + "total_column_articles": 800, "frontend_question_id": "657", "is_new_question": false }, @@ -47682,8 +47976,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 1375, - "total_submitted": 4072, + "total_acs": 1377, + "total_submitted": 4079, "total_column_articles": 35, "frontend_question_id": "656", "is_new_question": false @@ -47703,8 +47997,8 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 34811, - "total_submitted": 50108, + "total_acs": 34862, + "total_submitted": 50163, "total_column_articles": 506, "frontend_question_id": "655", "is_new_question": false @@ -47724,9 +48018,9 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 171656, - "total_submitted": 207187, - "total_column_articles": 1468, + "total_acs": 172586, + "total_submitted": 208310, + "total_column_articles": 1473, "frontend_question_id": "654", "is_new_question": false }, @@ -47745,9 +48039,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": 105597, - "total_submitted": 166368, - "total_column_articles": 938, + "total_acs": 106038, + "total_submitted": 167033, + "total_column_articles": 940, "frontend_question_id": "653", "is_new_question": false }, @@ -47766,9 +48060,9 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 90328, - "total_submitted": 147436, - "total_column_articles": 607, + "total_acs": 90601, + "total_submitted": 147896, + "total_column_articles": 612, "frontend_question_id": "652", "is_new_question": false }, @@ -47787,8 +48081,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 5953, - "total_submitted": 9990, + "total_acs": 5973, + "total_submitted": 10013, "total_column_articles": 91, "frontend_question_id": "651", "is_new_question": false @@ -47808,8 +48102,8 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 63208, - "total_submitted": 109891, + "total_acs": 63329, + "total_submitted": 110074, "total_column_articles": 769, "frontend_question_id": "650", "is_new_question": false @@ -47829,8 +48123,8 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 36410, - "total_submitted": 75724, + "total_acs": 36507, + "total_submitted": 75966, "total_column_articles": 380, "frontend_question_id": "649", "is_new_question": false @@ -47850,9 +48144,9 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 64381, - "total_submitted": 99882, - "total_column_articles": 778, + "total_acs": 64519, + "total_submitted": 100108, + "total_column_articles": 781, "frontend_question_id": "648", "is_new_question": false }, @@ -47871,9 +48165,9 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 244711, - "total_submitted": 365815, - "total_column_articles": 1563, + "total_acs": 245735, + "total_submitted": 367267, + "total_column_articles": 1566, "frontend_question_id": "647", "is_new_question": false }, @@ -47892,8 +48186,8 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 62866, - "total_submitted": 101416, + "total_acs": 63004, + "total_submitted": 101616, "total_column_articles": 626, "frontend_question_id": "646", "is_new_question": false @@ -47913,9 +48207,9 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 97601, - "total_submitted": 241487, - "total_column_articles": 969, + "total_acs": 97895, + "total_submitted": 242354, + "total_column_articles": 971, "frontend_question_id": "645", "is_new_question": false }, @@ -47934,8 +48228,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 2104, - "total_submitted": 4742, + "total_acs": 2118, + "total_submitted": 4764, "total_column_articles": 39, "frontend_question_id": "644", "is_new_question": false @@ -47955,9 +48249,9 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 94855, - "total_submitted": 215595, - "total_column_articles": 841, + "total_acs": 95146, + "total_submitted": 216204, + "total_column_articles": 842, "frontend_question_id": "643", "is_new_question": false }, @@ -47976,9 +48270,9 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 5022, - "total_submitted": 9004, - "total_column_articles": 88, + "total_acs": 5051, + "total_submitted": 9043, + "total_column_articles": 89, "frontend_question_id": "642", "is_new_question": false }, @@ -47997,8 +48291,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 36009, - "total_submitted": 80417, + "total_acs": 36042, + "total_submitted": 80492, "total_column_articles": 701, "frontend_question_id": "640", "is_new_question": false @@ -48018,8 +48312,8 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 22854, - "total_submitted": 60993, + "total_acs": 22880, + "total_submitted": 61061, "total_column_articles": 313, "frontend_question_id": "639", "is_new_question": false @@ -48039,8 +48333,8 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 34030, - "total_submitted": 53580, + "total_acs": 34079, + "total_submitted": 53662, "total_column_articles": 326, "frontend_question_id": "638", "is_new_question": false @@ -48060,8 +48354,8 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 126086, - "total_submitted": 180658, + "total_acs": 126552, + "total_submitted": 181296, "total_column_articles": 984, "frontend_question_id": "637", "is_new_question": false @@ -48081,8 +48375,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 34151, - "total_submitted": 51737, + "total_acs": 34207, + "total_submitted": 51821, "total_column_articles": 345, "frontend_question_id": "636", "is_new_question": false @@ -48102,8 +48396,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 6013, - "total_submitted": 10614, + "total_acs": 6026, + "total_submitted": 10638, "total_column_articles": 102, "frontend_question_id": "635", "is_new_question": false @@ -48123,8 +48417,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 2167, - "total_submitted": 4610, + "total_acs": 2172, + "total_submitted": 4624, "total_column_articles": 31, "frontend_question_id": "634", "is_new_question": false @@ -48144,8 +48438,8 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 125356, - "total_submitted": 325499, + "total_acs": 125678, + "total_submitted": 326276, "total_column_articles": 1006, "frontend_question_id": "633", "is_new_question": false @@ -48165,9 +48459,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": 24207, - "total_submitted": 39840, - "total_column_articles": 301, + "total_acs": 24256, + "total_submitted": 39909, + "total_column_articles": 302, "frontend_question_id": "632", "is_new_question": false }, @@ -48186,9 +48480,9 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 1642, - "total_submitted": 4983, - "total_column_articles": 47, + "total_acs": 1645, + "total_submitted": 4995, + "total_column_articles": 48, "frontend_question_id": "631", "is_new_question": false }, @@ -48207,8 +48501,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 28298, - "total_submitted": 61042, + "total_acs": 28317, + "total_submitted": 61095, "total_column_articles": 256, "frontend_question_id": "630", "is_new_question": false @@ -48228,8 +48522,8 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 21494, - "total_submitted": 41987, + "total_acs": 21516, + "total_submitted": 42064, "total_column_articles": 203, "frontend_question_id": "629", "is_new_question": false @@ -48249,9 +48543,9 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 110323, - "total_submitted": 211006, - "total_column_articles": 1031, + "total_acs": 110596, + "total_submitted": 211608, + "total_column_articles": 1033, "frontend_question_id": "628", "is_new_question": false }, @@ -48270,9 +48564,9 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 157816, - "total_submitted": 192440, - "total_column_articles": 594, + "total_acs": 158694, + "total_submitted": 193468, + "total_column_articles": 596, "frontend_question_id": "627", "is_new_question": false }, @@ -48291,9 +48585,9 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 66791, - "total_submitted": 97221, - "total_column_articles": 550, + "total_acs": 67013, + "total_submitted": 97524, + "total_column_articles": 553, "frontend_question_id": "626", "is_new_question": false }, @@ -48312,8 +48606,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 3269, - "total_submitted": 9404, + "total_acs": 3279, + "total_submitted": 9454, "total_column_articles": 65, "frontend_question_id": "625", "is_new_question": false @@ -48333,8 +48627,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 3037, - "total_submitted": 6932, + "total_acs": 3045, + "total_submitted": 6941, "total_column_articles": 67, "frontend_question_id": "624", "is_new_question": false @@ -48354,9 +48648,9 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 43488, - "total_submitted": 72211, - "total_column_articles": 643, + "total_acs": 43546, + "total_submitted": 72306, + "total_column_articles": 644, "frontend_question_id": "623", "is_new_question": false }, @@ -48375,9 +48669,9 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 127074, - "total_submitted": 213834, - "total_column_articles": 795, + "total_acs": 127488, + "total_submitted": 214436, + "total_column_articles": 797, "frontend_question_id": "621", "is_new_question": false }, @@ -48396,9 +48690,9 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 122756, - "total_submitted": 159113, - "total_column_articles": 425, + "total_acs": 122950, + "total_submitted": 159351, + "total_column_articles": 428, "frontend_question_id": "620", "is_new_question": false }, @@ -48417,8 +48711,8 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 21919, - "total_submitted": 46991, + "total_acs": 22065, + "total_submitted": 47237, "total_column_articles": 146, "frontend_question_id": "619", "is_new_question": false @@ -48438,8 +48732,8 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 8741, - "total_submitted": 13932, + "total_acs": 8793, + "total_submitted": 13990, "total_column_articles": 84, "frontend_question_id": "618", "is_new_question": false @@ -48459,9 +48753,9 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 359342, - "total_submitted": 454015, - "total_column_articles": 2177, + "total_acs": 361056, + "total_submitted": 456149, + "total_column_articles": 2188, "frontend_question_id": "617", "is_new_question": false }, @@ -48480,9 +48774,9 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 5224, - "total_submitted": 10654, - "total_column_articles": 82, + "total_acs": 5232, + "total_submitted": 10666, + "total_column_articles": 83, "frontend_question_id": "616", "is_new_question": false }, @@ -48501,9 +48795,9 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 9484, - "total_submitted": 22542, - "total_column_articles": 139, + "total_acs": 9527, + "total_submitted": 22631, + "total_column_articles": 140, "frontend_question_id": "615", "is_new_question": false }, @@ -48522,8 +48816,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 14312, - "total_submitted": 38713, + "total_acs": 14366, + "total_submitted": 38854, "total_column_articles": 100, "frontend_question_id": "614", "is_new_question": false @@ -48543,8 +48837,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 18279, - "total_submitted": 22953, + "total_acs": 18333, + "total_submitted": 23014, "total_column_articles": 118, "frontend_question_id": "613", "is_new_question": false @@ -48564,8 +48858,8 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 12770, - "total_submitted": 19552, + "total_acs": 12822, + "total_submitted": 19624, "total_column_articles": 98, "frontend_question_id": "612", "is_new_question": false @@ -48585,9 +48879,9 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 82205, - "total_submitted": 152753, - "total_column_articles": 613, + "total_acs": 82542, + "total_submitted": 153354, + "total_column_articles": 616, "frontend_question_id": "611", "is_new_question": false }, @@ -48606,8 +48900,8 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 17106, - "total_submitted": 27020, + "total_acs": 17171, + "total_submitted": 27121, "total_column_articles": 105, "frontend_question_id": "610", "is_new_question": false @@ -48627,9 +48921,9 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 9511, - "total_submitted": 18332, - "total_column_articles": 152, + "total_acs": 9529, + "total_submitted": 18361, + "total_column_articles": 151, "frontend_question_id": "609", "is_new_question": false }, @@ -48648,9 +48942,9 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 44717, - "total_submitted": 73577, - "total_column_articles": 339, + "total_acs": 45254, + "total_submitted": 74391, + "total_column_articles": 342, "frontend_question_id": "608", "is_new_question": false }, @@ -48669,9 +48963,9 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 53453, - "total_submitted": 77918, - "total_column_articles": 325, + "total_acs": 53982, + "total_submitted": 78640, + "total_column_articles": 329, "frontend_question_id": "607", "is_new_question": false }, @@ -48690,9 +48984,9 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 69023, - "total_submitted": 110248, - "total_column_articles": 712, + "total_acs": 69160, + "total_submitted": 110479, + "total_column_articles": 713, "frontend_question_id": "606", "is_new_question": false }, @@ -48711,9 +49005,9 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 152772, - "total_submitted": 467803, - "total_column_articles": 1711, + "total_acs": 153113, + "total_submitted": 468994, + "total_column_articles": 1716, "frontend_question_id": "605", "is_new_question": false }, @@ -48732,9 +49026,9 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 3627, - "total_submitted": 9438, - "total_column_articles": 88, + "total_acs": 3648, + "total_submitted": 9481, + "total_column_articles": 89, "frontend_question_id": "604", "is_new_question": false }, @@ -48753,8 +49047,8 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 23858, - "total_submitted": 36965, + "total_acs": 23980, + "total_submitted": 37161, "total_column_articles": 218, "frontend_question_id": "603", "is_new_question": false @@ -48774,9 +49068,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": 14736, - "total_submitted": 24343, - "total_column_articles": 139, + "total_acs": 14781, + "total_submitted": 24408, + "total_column_articles": 140, "frontend_question_id": "602", "is_new_question": false }, @@ -48795,9 +49089,9 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 45508, - "total_submitted": 95142, - "total_column_articles": 530, + "total_acs": 45628, + "total_submitted": 95335, + "total_column_articles": 533, "frontend_question_id": "601", "is_new_question": false }, @@ -48816,9 +49110,9 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 23448, - "total_submitted": 47732, - "total_column_articles": 287, + "total_acs": 23490, + "total_submitted": 47808, + "total_column_articles": 290, "frontend_question_id": "600", "is_new_question": false }, @@ -48837,8 +49131,8 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 83795, - "total_submitted": 147406, + "total_acs": 83983, + "total_submitted": 147719, "total_column_articles": 717, "frontend_question_id": "599", "is_new_question": false @@ -48858,9 +49152,9 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 50804, - "total_submitted": 88064, - "total_column_articles": 588, + "total_acs": 50940, + "total_submitted": 88265, + "total_column_articles": 590, "frontend_question_id": "598", "is_new_question": false }, @@ -48879,8 +49173,8 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 17536, - "total_submitted": 40341, + "total_acs": 17606, + "total_submitted": 40480, "total_column_articles": 122, "frontend_question_id": "597", "is_new_question": false @@ -48900,8 +49194,8 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 136318, - "total_submitted": 276663, + "total_acs": 136834, + "total_submitted": 277444, "total_column_articles": 445, "frontend_question_id": "596", "is_new_question": false @@ -48921,9 +49215,9 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 236573, - "total_submitted": 349913, - "total_column_articles": 527, + "total_acs": 238104, + "total_submitted": 352375, + "total_column_articles": 532, "frontend_question_id": "595", "is_new_question": false }, @@ -48942,9 +49236,9 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 76676, - "total_submitted": 136408, - "total_column_articles": 670, + "total_acs": 76944, + "total_submitted": 136881, + "total_column_articles": 672, "frontend_question_id": "594", "is_new_question": false }, @@ -48963,9 +49257,9 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 34672, - "total_submitted": 73741, - "total_column_articles": 578, + "total_acs": 34747, + "total_submitted": 73866, + "total_column_articles": 579, "frontend_question_id": "593", "is_new_question": false }, @@ -48984,8 +49278,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 25555, - "total_submitted": 42652, + "total_acs": 25580, + "total_submitted": 42694, "total_column_articles": 474, "frontend_question_id": "592", "is_new_question": false @@ -49005,8 +49299,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 17419, - "total_submitted": 33314, + "total_acs": 17426, + "total_submitted": 33329, "total_column_articles": 196, "frontend_question_id": "591", "is_new_question": false @@ -49026,8 +49320,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 2953, - "total_submitted": 6815, + "total_acs": 2963, + "total_submitted": 6838, "total_column_articles": 52, "frontend_question_id": "588", "is_new_question": false @@ -49047,8 +49341,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 17106, - "total_submitted": 28009, + "total_acs": 17119, + "total_submitted": 28027, "total_column_articles": 136, "frontend_question_id": "587", "is_new_question": false @@ -49068,9 +49362,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": 59811, - "total_submitted": 84421, - "total_column_articles": 296, + "total_acs": 60346, + "total_submitted": 85160, + "total_column_articles": 299, "frontend_question_id": "586", "is_new_question": false }, @@ -49089,8 +49383,8 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 14452, - "total_submitted": 29346, + "total_acs": 14507, + "total_submitted": 29492, "total_column_articles": 160, "frontend_question_id": "585", "is_new_question": false @@ -49110,9 +49404,9 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 114675, - "total_submitted": 176169, - "total_column_articles": 345, + "total_acs": 115960, + "total_submitted": 178061, + "total_column_articles": 352, "frontend_question_id": "584", "is_new_question": false }, @@ -49131,8 +49425,8 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 106768, - "total_submitted": 161463, + "total_acs": 107312, + "total_submitted": 162240, "total_column_articles": 838, "frontend_question_id": "583", "is_new_question": false @@ -49152,8 +49446,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 11931, - "total_submitted": 26433, + "total_acs": 11951, + "total_submitted": 26461, "total_column_articles": 180, "frontend_question_id": "582", "is_new_question": false @@ -49173,9 +49467,9 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 163180, - "total_submitted": 392401, - "total_column_articles": 1270, + "total_acs": 163707, + "total_submitted": 393621, + "total_column_articles": 1276, "frontend_question_id": "581", "is_new_question": false }, @@ -49194,8 +49488,8 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 20600, - "total_submitted": 38668, + "total_acs": 20716, + "total_submitted": 38858, "total_column_articles": 145, "frontend_question_id": "580", "is_new_question": false @@ -49215,8 +49509,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 13116, - "total_submitted": 30055, + "total_acs": 13174, + "total_submitted": 30159, "total_column_articles": 182, "frontend_question_id": "579", "is_new_question": false @@ -49236,9 +49530,9 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 17816, - "total_submitted": 41278, - "total_column_articles": 180, + "total_acs": 17893, + "total_submitted": 41499, + "total_column_articles": 181, "frontend_question_id": "578", "is_new_question": false }, @@ -49257,8 +49551,8 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 26480, - "total_submitted": 38203, + "total_acs": 26573, + "total_submitted": 38328, "total_column_articles": 134, "frontend_question_id": "577", "is_new_question": false @@ -49278,8 +49572,8 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 34048, - "total_submitted": 72295, + "total_acs": 34111, + "total_submitted": 72412, "total_column_articles": 369, "frontend_question_id": "576", "is_new_question": false @@ -49299,9 +49593,9 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 106695, - "total_submitted": 151295, - "total_column_articles": 1010, + "total_acs": 106961, + "total_submitted": 151691, + "total_column_articles": 1014, "frontend_question_id": "575", "is_new_question": false }, @@ -49320,8 +49614,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 21753, - "total_submitted": 32744, + "total_acs": 21829, + "total_submitted": 32830, "total_column_articles": 157, "frontend_question_id": "574", "is_new_question": false @@ -49341,8 +49635,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 1607, - "total_submitted": 2484, + "total_acs": 1615, + "total_submitted": 2499, "total_column_articles": 47, "frontend_question_id": "573", "is_new_question": false @@ -49362,9 +49656,9 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 157654, - "total_submitted": 331231, - "total_column_articles": 1217, + "total_acs": 158332, + "total_submitted": 332690, + "total_column_articles": 1223, "frontend_question_id": "572", "is_new_question": false }, @@ -49383,8 +49677,8 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 12288, - "total_submitted": 26129, + "total_acs": 12355, + "total_submitted": 26303, "total_column_articles": 137, "frontend_question_id": "571", "is_new_question": false @@ -49404,9 +49698,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": 25685, - "total_submitted": 39167, - "total_column_articles": 186, + "total_acs": 25816, + "total_submitted": 39382, + "total_column_articles": 188, "frontend_question_id": "570", "is_new_question": false }, @@ -49425,8 +49719,8 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 18188, - "total_submitted": 31653, + "total_acs": 18277, + "total_submitted": 31817, "total_column_articles": 240, "frontend_question_id": "569", "is_new_question": false @@ -49446,9 +49740,9 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 1950, - "total_submitted": 3667, - "total_column_articles": 40, + "total_acs": 1965, + "total_submitted": 3689, + "total_column_articles": 42, "frontend_question_id": "568", "is_new_question": false }, @@ -49467,9 +49761,9 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 239439, - "total_submitted": 539575, - "total_column_articles": 2156, + "total_acs": 240471, + "total_submitted": 541808, + "total_column_articles": 2168, "frontend_question_id": "567", "is_new_question": false }, @@ -49488,9 +49782,9 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 131608, - "total_submitted": 200740, - "total_column_articles": 1222, + "total_acs": 132428, + "total_submitted": 202075, + "total_column_articles": 1227, "frontend_question_id": "566", "is_new_question": false }, @@ -49509,8 +49803,8 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 46542, - "total_submitted": 74633, + "total_acs": 46609, + "total_submitted": 74723, "total_column_articles": 444, "frontend_question_id": "565", "is_new_question": false @@ -49530,8 +49824,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 24244, - "total_submitted": 79563, + "total_acs": 24263, + "total_submitted": 79612, "total_column_articles": 257, "frontend_question_id": "564", "is_new_question": false @@ -49551,8 +49845,8 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 72090, - "total_submitted": 109485, + "total_acs": 72247, + "total_submitted": 109718, "total_column_articles": 739, "frontend_question_id": "563", "is_new_question": false @@ -49572,8 +49866,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": 5749, - "total_submitted": 11633, + "total_acs": 5769, + "total_submitted": 11658, "total_column_articles": 97, "frontend_question_id": "562", "is_new_question": false @@ -49593,9 +49887,9 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 126423, - "total_submitted": 161090, - "total_column_articles": 1060, + "total_acs": 126804, + "total_submitted": 161552, + "total_column_articles": 1063, "frontend_question_id": "561", "is_new_question": false }, @@ -49614,9 +49908,9 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 288605, - "total_submitted": 636033, - "total_column_articles": 1716, + "total_acs": 289593, + "total_submitted": 638274, + "total_column_articles": 1717, "frontend_question_id": "560", "is_new_question": false }, @@ -49635,9 +49929,9 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 284170, - "total_submitted": 383228, - "total_column_articles": 2369, + "total_acs": 285277, + "total_submitted": 384722, + "total_column_articles": 2379, "frontend_question_id": "557", "is_new_question": false }, @@ -49656,9 +49950,9 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 43737, - "total_submitted": 118577, - "total_column_articles": 551, + "total_acs": 43870, + "total_submitted": 118932, + "total_column_articles": 553, "frontend_question_id": "556", "is_new_question": false }, @@ -49677,8 +49971,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 1634, - "total_submitted": 4370, + "total_acs": 1636, + "total_submitted": 4378, "total_column_articles": 31, "frontend_question_id": "555", "is_new_question": false @@ -49698,8 +49992,8 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 59453, - "total_submitted": 115527, + "total_acs": 59525, + "total_submitted": 115667, "total_column_articles": 579, "frontend_question_id": "554", "is_new_question": false @@ -49719,8 +50013,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 30584, - "total_submitted": 47157, + "total_acs": 30616, + "total_submitted": 47214, "total_column_articles": 372, "frontend_question_id": "553", "is_new_question": false @@ -49740,8 +50034,8 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 27532, - "total_submitted": 47830, + "total_acs": 27562, + "total_submitted": 47867, "total_column_articles": 334, "frontend_question_id": "552", "is_new_question": false @@ -49761,9 +50055,9 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 74565, - "total_submitted": 131402, - "total_column_articles": 947, + "total_acs": 74773, + "total_submitted": 131740, + "total_column_articles": 952, "frontend_question_id": "551", "is_new_question": false }, @@ -49782,8 +50076,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 1591, - "total_submitted": 3040, + "total_acs": 1602, + "total_submitted": 3055, "total_column_articles": 39, "frontend_question_id": "1730", "is_new_question": false @@ -49803,9 +50097,9 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 3842, - "total_submitted": 7517, - "total_column_articles": 75, + "total_acs": 3856, + "total_submitted": 7542, + "total_column_articles": 76, "frontend_question_id": "549", "is_new_question": false }, @@ -49824,8 +50118,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 2288, - "total_submitted": 5965, + "total_acs": 2300, + "total_submitted": 5984, "total_column_articles": 53, "frontend_question_id": "548", "is_new_question": false @@ -49845,9 +50139,9 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 252260, - "total_submitted": 404903, - "total_column_articles": 1728, + "total_acs": 252965, + "total_submitted": 405967, + "total_column_articles": 1730, "frontend_question_id": "547", "is_new_question": false }, @@ -49866,9 +50160,9 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 17665, - "total_submitted": 28821, - "total_column_articles": 138, + "total_acs": 17702, + "total_submitted": 28877, + "total_column_articles": 139, "frontend_question_id": "546", "is_new_question": false }, @@ -49887,8 +50181,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 5229, - "total_submitted": 11829, + "total_acs": 5242, + "total_submitted": 11850, "total_column_articles": 94, "frontend_question_id": "545", "is_new_question": false @@ -49908,9 +50202,9 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 3248, - "total_submitted": 4498, - "total_column_articles": 70, + "total_acs": 3257, + "total_submitted": 4511, + "total_column_articles": 71, "frontend_question_id": "544", "is_new_question": false }, @@ -49929,9 +50223,9 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 285681, - "total_submitted": 492027, - "total_column_articles": 2073, + "total_acs": 286748, + "total_submitted": 493747, + "total_column_articles": 2089, "frontend_question_id": "543", "is_new_question": false }, @@ -49950,9 +50244,9 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 123493, - "total_submitted": 265800, - "total_column_articles": 1052, + "total_acs": 124026, + "total_submitted": 266871, + "total_column_articles": 1054, "frontend_question_id": "542", "is_new_question": false }, @@ -49971,9 +50265,9 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 166889, - "total_submitted": 284045, - "total_column_articles": 1360, + "total_acs": 168237, + "total_submitted": 286553, + "total_column_articles": 1374, "frontend_question_id": "541", "is_new_question": false }, @@ -49992,8 +50286,8 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 109543, - "total_submitted": 180784, + "total_acs": 109816, + "total_submitted": 181195, "total_column_articles": 1027, "frontend_question_id": "540", "is_new_question": false @@ -50013,8 +50307,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 60124, - "total_submitted": 90931, + "total_acs": 60226, + "total_submitted": 91094, "total_column_articles": 661, "frontend_question_id": "539", "is_new_question": false @@ -50034,9 +50328,9 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 205666, - "total_submitted": 271456, - "total_column_articles": 1405, + "total_acs": 206751, + "total_submitted": 272789, + "total_column_articles": 1410, "frontend_question_id": "538", "is_new_question": false }, @@ -50055,8 +50349,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 42967, - "total_submitted": 57449, + "total_acs": 43016, + "total_submitted": 57508, "total_column_articles": 652, "frontend_question_id": "537", "is_new_question": false @@ -50076,9 +50370,9 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 5446, - "total_submitted": 9906, - "total_column_articles": 92, + "total_acs": 5456, + "total_submitted": 9920, + "total_column_articles": 93, "frontend_question_id": "536", "is_new_question": false }, @@ -50097,9 +50391,9 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 42588, - "total_submitted": 48598, - "total_column_articles": 270, + "total_acs": 42679, + "total_submitted": 48708, + "total_column_articles": 271, "frontend_question_id": "535", "is_new_question": false }, @@ -50118,8 +50412,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 2508, - "total_submitted": 4734, + "total_acs": 2511, + "total_submitted": 4741, "total_column_articles": 45, "frontend_question_id": "533", "is_new_question": false @@ -50139,9 +50433,9 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 60480, - "total_submitted": 133393, - "total_column_articles": 690, + "total_acs": 60556, + "total_submitted": 133511, + "total_column_articles": 691, "frontend_question_id": "532", "is_new_question": false }, @@ -50160,8 +50454,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 5621, - "total_submitted": 8733, + "total_acs": 5633, + "total_submitted": 8757, "total_column_articles": 108, "frontend_question_id": "531", "is_new_question": false @@ -50181,9 +50475,9 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 152163, - "total_submitted": 239778, - "total_column_articles": 1042, + "total_acs": 153027, + "total_submitted": 241084, + "total_column_articles": 1050, "frontend_question_id": "530", "is_new_question": false }, @@ -50202,8 +50496,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 49071, - "total_submitted": 76567, + "total_acs": 49108, + "total_submitted": 76628, "total_column_articles": 585, "frontend_question_id": "529", "is_new_question": false @@ -50223,9 +50517,9 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 18041, - "total_submitted": 28249, - "total_column_articles": 276, + "total_acs": 18098, + "total_submitted": 28342, + "total_column_articles": 278, "frontend_question_id": "1721", "is_new_question": false }, @@ -50244,8 +50538,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 2658, - "total_submitted": 4430, + "total_acs": 2664, + "total_submitted": 4439, "total_column_articles": 38, "frontend_question_id": "527", "is_new_question": false @@ -50265,9 +50559,9 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 44941, - "total_submitted": 61155, - "total_column_articles": 494, + "total_acs": 45045, + "total_submitted": 61312, + "total_column_articles": 495, "frontend_question_id": "526", "is_new_question": false }, @@ -50286,9 +50580,9 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 63964, - "total_submitted": 117410, - "total_column_articles": 672, + "total_acs": 64118, + "total_submitted": 117660, + "total_column_articles": 673, "frontend_question_id": "525", "is_new_question": false }, @@ -50307,9 +50601,9 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 96069, - "total_submitted": 192022, - "total_column_articles": 949, + "total_acs": 96279, + "total_submitted": 192414, + "total_column_articles": 952, "frontend_question_id": "524", "is_new_question": false }, @@ -50328,9 +50622,9 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 91211, - "total_submitted": 321512, - "total_column_articles": 758, + "total_acs": 91377, + "total_submitted": 322094, + "total_column_articles": 759, "frontend_question_id": "523", "is_new_question": false }, @@ -50349,8 +50643,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 30950, - "total_submitted": 63364, + "total_acs": 30998, + "total_submitted": 63454, "total_column_articles": 358, "frontend_question_id": "522", "is_new_question": false @@ -50370,9 +50664,9 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 60974, - "total_submitted": 82729, - "total_column_articles": 554, + "total_acs": 61094, + "total_submitted": 82897, + "total_column_articles": 556, "frontend_question_id": "521", "is_new_question": false }, @@ -50391,9 +50685,9 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 83320, - "total_submitted": 146151, - "total_column_articles": 1261, + "total_acs": 83521, + "total_submitted": 146486, + "total_column_articles": 1264, "frontend_question_id": "520", "is_new_question": false }, @@ -50412,8 +50706,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": 299, - "total_submitted": 573, + "total_acs": 303, + "total_submitted": 580, "total_column_articles": 13, "frontend_question_id": "1983", "is_new_question": false @@ -50433,9 +50727,9 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 212648, - "total_submitted": 304035, - "total_column_articles": 1139, + "total_acs": 213504, + "total_submitted": 305107, + "total_column_articles": 1140, "frontend_question_id": "518", "is_new_question": false }, @@ -50454,8 +50748,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 23003, - "total_submitted": 45158, + "total_acs": 23049, + "total_submitted": 45234, "total_column_articles": 180, "frontend_question_id": "517", "is_new_question": false @@ -50475,8 +50769,8 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 159872, - "total_submitted": 238365, + "total_acs": 160618, + "total_submitted": 239434, "total_column_articles": 1023, "frontend_question_id": "516", "is_new_question": false @@ -50496,8 +50790,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": 108476, - "total_submitted": 163506, + "total_acs": 108909, + "total_submitted": 164133, "total_column_articles": 1048, "frontend_question_id": "515", "is_new_question": false @@ -50517,9 +50811,9 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 26096, - "total_submitted": 50910, - "total_column_articles": 322, + "total_acs": 26165, + "total_submitted": 51011, + "total_column_articles": 337, "frontend_question_id": "514", "is_new_question": false }, @@ -50538,9 +50832,9 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 158812, - "total_submitted": 214548, - "total_column_articles": 1418, + "total_acs": 159859, + "total_submitted": 216022, + "total_column_articles": 1423, "frontend_question_id": "513", "is_new_question": false }, @@ -50559,8 +50853,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 377, - "total_submitted": 891, + "total_acs": 378, + "total_submitted": 893, "total_column_articles": 19, "frontend_question_id": "2036", "is_new_question": false @@ -50580,8 +50874,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": 3354, - "total_submitted": 9250, + "total_acs": 3359, + "total_submitted": 9260, "total_column_articles": 50, "frontend_question_id": "1059", "is_new_question": false @@ -50601,8 +50895,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": 611, - "total_submitted": 1128, + "total_acs": 613, + "total_submitted": 1130, "total_column_articles": 20, "frontend_question_id": "2031", "is_new_question": false @@ -50622,9 +50916,9 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 5427, - "total_submitted": 8902, - "total_column_articles": 71, + "total_acs": 5443, + "total_submitted": 8930, + "total_column_articles": 72, "frontend_question_id": "510", "is_new_question": false }, @@ -50643,9 +50937,9 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 42441, - "total_submitted": 56255, - "total_column_articles": 556, + "total_acs": 42513, + "total_submitted": 56337, + "total_column_articles": 557, "frontend_question_id": "508", "is_new_question": false }, @@ -50664,8 +50958,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 72830, - "total_submitted": 148340, + "total_acs": 72989, + "total_submitted": 148621, "total_column_articles": 543, "frontend_question_id": "507", "is_new_question": false @@ -50685,9 +50979,9 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 73154, - "total_submitted": 112254, - "total_column_articles": 921, + "total_acs": 73376, + "total_submitted": 112557, + "total_column_articles": 924, "frontend_question_id": "506", "is_new_question": false }, @@ -50706,9 +51000,9 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 9035, - "total_submitted": 17723, - "total_column_articles": 110, + "total_acs": 9068, + "total_submitted": 17773, + "total_column_articles": 111, "frontend_question_id": "505", "is_new_question": false }, @@ -50727,9 +51021,9 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 82536, - "total_submitted": 159103, - "total_column_articles": 810, + "total_acs": 82695, + "total_submitted": 159396, + "total_column_articles": 812, "frontend_question_id": "504", "is_new_question": false }, @@ -50748,9 +51042,9 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 179263, - "total_submitted": 270011, - "total_column_articles": 1505, + "total_acs": 179903, + "total_submitted": 270895, + "total_column_articles": 1510, "frontend_question_id": "503", "is_new_question": false }, @@ -50769,8 +51063,8 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 34096, - "total_submitted": 76191, + "total_acs": 34126, + "total_submitted": 76245, "total_column_articles": 417, "frontend_question_id": "502", "is_new_question": false @@ -50790,9 +51084,9 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 135338, - "total_submitted": 249245, - "total_column_articles": 957, + "total_acs": 136284, + "total_submitted": 250877, + "total_column_articles": 965, "frontend_question_id": "501", "is_new_question": false }, @@ -50811,9 +51105,9 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 66409, - "total_submitted": 89310, - "total_column_articles": 978, + "total_acs": 66629, + "total_submitted": 89624, + "total_column_articles": 981, "frontend_question_id": "500", "is_new_question": false }, @@ -50832,8 +51126,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 4228, - "total_submitted": 10062, + "total_acs": 4244, + "total_submitted": 10098, "total_column_articles": 82, "frontend_question_id": "499", "is_new_question": false @@ -50853,8 +51147,8 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 100589, - "total_submitted": 180702, + "total_acs": 100892, + "total_submitted": 181240, "total_column_articles": 1060, "frontend_question_id": "498", "is_new_question": false @@ -50874,9 +51168,9 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 235504, - "total_submitted": 328041, - "total_column_articles": 2192, + "total_acs": 236449, + "total_submitted": 329296, + "total_column_articles": 2199, "frontend_question_id": "496", "is_new_question": false }, @@ -50895,9 +51189,9 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 87074, - "total_submitted": 145537, - "total_column_articles": 1204, + "total_acs": 87304, + "total_submitted": 146021, + "total_column_articles": 1206, "frontend_question_id": "495", "is_new_question": false }, @@ -50916,9 +51210,9 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 304886, - "total_submitted": 621750, - "total_column_articles": 1773, + "total_acs": 306347, + "total_submitted": 624964, + "total_column_articles": 1790, "frontend_question_id": "494", "is_new_question": false }, @@ -50937,9 +51231,9 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 37304, - "total_submitted": 102954, - "total_column_articles": 377, + "total_acs": 37439, + "total_submitted": 103260, + "total_column_articles": 379, "frontend_question_id": "493", "is_new_question": false }, @@ -50958,8 +51252,8 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 54394, - "total_submitted": 88978, + "total_acs": 54558, + "total_submitted": 89225, "total_column_articles": 518, "frontend_question_id": "492", "is_new_question": false @@ -50979,9 +51273,9 @@ "question__title": "Non-decreasing Subsequences", "question__title_slug": "non-decreasing-subsequences", "question__hide": false, - "total_acs": 113372, - "total_submitted": 215491, - "total_column_articles": 792, + "total_acs": 114117, + "total_submitted": 216824, + "total_column_articles": 794, "frontend_question_id": "491", "is_new_question": false }, @@ -51000,8 +51294,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 10897, - "total_submitted": 21852, + "total_acs": 10943, + "total_submitted": 21938, "total_column_articles": 128, "frontend_question_id": "490", "is_new_question": false @@ -51021,9 +51315,9 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 3057, - "total_submitted": 6464, - "total_column_articles": 69, + "total_acs": 3077, + "total_submitted": 6494, + "total_column_articles": 71, "frontend_question_id": "1643", "is_new_question": false }, @@ -51042,8 +51336,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 19724, - "total_submitted": 40118, + "total_acs": 19742, + "total_submitted": 40162, "total_column_articles": 184, "frontend_question_id": "488", "is_new_question": false @@ -51063,9 +51357,9 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 12361, - "total_submitted": 21268, - "total_column_articles": 213, + "total_acs": 12417, + "total_submitted": 21365, + "total_column_articles": 214, "frontend_question_id": "487", "is_new_question": false }, @@ -51084,9 +51378,9 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 63682, - "total_submitted": 107397, - "total_column_articles": 531, + "total_acs": 63885, + "total_submitted": 107712, + "total_column_articles": 532, "frontend_question_id": "486", "is_new_question": false }, @@ -51105,9 +51399,9 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 186460, - "total_submitted": 305318, - "total_column_articles": 1499, + "total_acs": 187028, + "total_submitted": 306250, + "total_column_articles": 1500, "frontend_question_id": "485", "is_new_question": false }, @@ -51126,8 +51420,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 2406, - "total_submitted": 3962, + "total_acs": 2407, + "total_submitted": 3964, "total_column_articles": 49, "frontend_question_id": "484", "is_new_question": false @@ -51147,8 +51441,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 18647, - "total_submitted": 31530, + "total_acs": 18674, + "total_submitted": 31571, "total_column_articles": 142, "frontend_question_id": "483", "is_new_question": false @@ -51168,9 +51462,9 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 53354, - "total_submitted": 113954, - "total_column_articles": 565, + "total_acs": 53494, + "total_submitted": 114240, + "total_column_articles": 566, "frontend_question_id": "482", "is_new_question": false }, @@ -51189,8 +51483,8 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 34288, - "total_submitted": 53492, + "total_acs": 34329, + "total_submitted": 53565, "total_column_articles": 464, "frontend_question_id": "481", "is_new_question": false @@ -51210,8 +51504,8 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 37872, - "total_submitted": 85099, + "total_acs": 37933, + "total_submitted": 85236, "total_column_articles": 504, "frontend_question_id": "480", "is_new_question": false @@ -51231,8 +51525,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 22535, - "total_submitted": 36075, + "total_acs": 22560, + "total_submitted": 36108, "total_column_articles": 171, "frontend_question_id": "479", "is_new_question": false @@ -51252,9 +51546,9 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 44630, - "total_submitted": 73690, - "total_column_articles": 378, + "total_acs": 44690, + "total_submitted": 73786, + "total_column_articles": 379, "frontend_question_id": "477", "is_new_question": false }, @@ -51273,9 +51567,9 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 78036, - "total_submitted": 111526, - "total_column_articles": 1044, + "total_acs": 78221, + "total_submitted": 111802, + "total_column_articles": 1046, "frontend_question_id": "476", "is_new_question": false }, @@ -51294,8 +51588,8 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 66976, - "total_submitted": 163550, + "total_acs": 67097, + "total_submitted": 163831, "total_column_articles": 694, "frontend_question_id": "475", "is_new_question": false @@ -51315,9 +51609,9 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 138308, - "total_submitted": 214482, - "total_column_articles": 965, + "total_acs": 138944, + "total_submitted": 215397, + "total_column_articles": 971, "frontend_question_id": "474", "is_new_question": false }, @@ -51336,8 +51630,8 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 67389, - "total_submitted": 144536, + "total_acs": 67522, + "total_submitted": 144812, "total_column_articles": 502, "frontend_question_id": "473", "is_new_question": false @@ -51357,9 +51651,9 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 26167, - "total_submitted": 50493, - "total_column_articles": 259, + "total_acs": 26227, + "total_submitted": 50577, + "total_column_articles": 260, "frontend_question_id": "472", "is_new_question": false }, @@ -51378,9 +51672,9 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 2427, - "total_submitted": 4071, - "total_column_articles": 41, + "total_acs": 2436, + "total_submitted": 4095, + "total_column_articles": 42, "frontend_question_id": "471", "is_new_question": false }, @@ -51399,8 +51693,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 2437, - "total_submitted": 5694, + "total_acs": 2448, + "total_submitted": 5710, "total_column_articles": 33, "frontend_question_id": "469", "is_new_question": false @@ -51420,9 +51714,9 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 59948, - "total_submitted": 213001, - "total_column_articles": 691, + "total_acs": 60065, + "total_submitted": 213467, + "total_column_articles": 692, "frontend_question_id": "468", "is_new_question": false }, @@ -51441,8 +51735,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 35540, - "total_submitted": 68599, + "total_acs": 35579, + "total_submitted": 68673, "total_column_articles": 364, "frontend_question_id": "467", "is_new_question": false @@ -51462,9 +51756,9 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 13317, - "total_submitted": 35555, - "total_column_articles": 202, + "total_acs": 13337, + "total_submitted": 35591, + "total_column_articles": 203, "frontend_question_id": "466", "is_new_question": false }, @@ -51483,9 +51777,9 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 2539, - "total_submitted": 4642, - "total_column_articles": 38, + "total_acs": 2563, + "total_submitted": 4685, + "total_column_articles": 39, "frontend_question_id": "465", "is_new_question": false }, @@ -51504,8 +51798,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 35866, - "total_submitted": 86656, + "total_acs": 35936, + "total_submitted": 86871, "total_column_articles": 279, "frontend_question_id": "464", "is_new_question": false @@ -51525,9 +51819,9 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 119150, - "total_submitted": 169746, - "total_column_articles": 1329, + "total_acs": 119590, + "total_submitted": 170362, + "total_column_articles": 1331, "frontend_question_id": "463", "is_new_question": false }, @@ -51546,9 +51840,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": 50337, - "total_submitted": 80660, - "total_column_articles": 516, + "total_acs": 50396, + "total_submitted": 80746, + "total_column_articles": 517, "frontend_question_id": "462", "is_new_question": false }, @@ -51567,9 +51861,9 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 257264, - "total_submitted": 314357, - "total_column_articles": 1949, + "total_acs": 258144, + "total_submitted": 315407, + "total_column_articles": 1957, "frontend_question_id": "461", "is_new_question": false }, @@ -51588,9 +51882,9 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 59358, - "total_submitted": 133735, - "total_column_articles": 609, + "total_acs": 59502, + "total_submitted": 134042, + "total_column_articles": 610, "frontend_question_id": "460", "is_new_question": false }, @@ -51609,9 +51903,9 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 159901, - "total_submitted": 312759, - "total_column_articles": 1176, + "total_acs": 160982, + "total_submitted": 314883, + "total_column_articles": 1179, "frontend_question_id": "459", "is_new_question": false }, @@ -51630,9 +51924,9 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 26280, - "total_submitted": 38402, - "total_column_articles": 236, + "total_acs": 26309, + "total_submitted": 38462, + "total_column_articles": 237, "frontend_question_id": "458", "is_new_question": false }, @@ -51651,8 +51945,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 34281, - "total_submitted": 79051, + "total_acs": 34340, + "total_submitted": 79153, "total_column_articles": 363, "frontend_question_id": "457", "is_new_question": false @@ -51672,9 +51966,9 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 72940, - "total_submitted": 200501, - "total_column_articles": 595, + "total_acs": 73071, + "total_submitted": 200876, + "total_column_articles": 596, "frontend_question_id": "456", "is_new_question": false }, @@ -51693,9 +51987,9 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 279296, - "total_submitted": 491744, - "total_column_articles": 2051, + "total_acs": 280650, + "total_submitted": 494195, + "total_column_articles": 2060, "frontend_question_id": "455", "is_new_question": false }, @@ -51714,9 +52008,9 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 169504, - "total_submitted": 265626, - "total_column_articles": 1018, + "total_acs": 170704, + "total_submitted": 267409, + "total_column_articles": 1026, "frontend_question_id": "454", "is_new_question": false }, @@ -51735,8 +52029,8 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 70974, - "total_submitted": 115192, + "total_acs": 71033, + "total_submitted": 115289, "total_column_articles": 821, "frontend_question_id": "453", "is_new_question": false @@ -51756,9 +52050,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": 178830, - "total_submitted": 352001, - "total_column_articles": 1387, + "total_acs": 179621, + "total_submitted": 353638, + "total_column_articles": 1393, "frontend_question_id": "452", "is_new_question": false }, @@ -51777,9 +52071,9 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 118192, - "total_submitted": 164122, - "total_column_articles": 1286, + "total_acs": 118495, + "total_submitted": 164515, + "total_column_articles": 1287, "frontend_question_id": "451", "is_new_question": false }, @@ -51798,9 +52092,9 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 179023, - "total_submitted": 342053, - "total_column_articles": 1779, + "total_acs": 180065, + "total_submitted": 343898, + "total_column_articles": 1791, "frontend_question_id": "450", "is_new_question": false }, @@ -51819,9 +52113,9 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 46938, - "total_submitted": 77327, - "total_column_articles": 427, + "total_acs": 47014, + "total_submitted": 77445, + "total_column_articles": 426, "frontend_question_id": "449", "is_new_question": false }, @@ -51840,9 +52134,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": 252539, - "total_submitted": 383396, - "total_column_articles": 1804, + "total_acs": 253637, + "total_submitted": 384995, + "total_column_articles": 1813, "frontend_question_id": "448", "is_new_question": false }, @@ -51861,8 +52155,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 54452, - "total_submitted": 81688, + "total_acs": 54496, + "total_submitted": 81747, "total_column_articles": 428, "frontend_question_id": "447", "is_new_question": false @@ -51882,8 +52176,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 22939, - "total_submitted": 41730, + "total_acs": 22990, + "total_submitted": 41813, "total_column_articles": 202, "frontend_question_id": "446", "is_new_question": false @@ -51903,9 +52197,9 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 115973, - "total_submitted": 192681, - "total_column_articles": 1254, + "total_acs": 116242, + "total_submitted": 193103, + "total_column_articles": 1258, "frontend_question_id": "445", "is_new_question": false }, @@ -51924,9 +52218,9 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 5483, - "total_submitted": 17963, - "total_column_articles": 83, + "total_acs": 5504, + "total_submitted": 18000, + "total_column_articles": 84, "frontend_question_id": "444", "is_new_question": false }, @@ -51945,8 +52239,8 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 74264, - "total_submitted": 155155, + "total_acs": 74440, + "total_submitted": 155466, "total_column_articles": 848, "frontend_question_id": "443", "is_new_question": false @@ -51966,9 +52260,9 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 103157, - "total_submitted": 137476, - "total_column_articles": 984, + "total_acs": 103371, + "total_submitted": 137751, + "total_column_articles": 986, "frontend_question_id": "442", "is_new_question": false }, @@ -51987,9 +52281,9 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 112207, - "total_submitted": 246668, - "total_column_articles": 1061, + "total_acs": 112684, + "total_submitted": 247625, + "total_column_articles": 1066, "frontend_question_id": "441", "is_new_question": false }, @@ -52008,8 +52302,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 46589, - "total_submitted": 109218, + "total_acs": 46665, + "total_submitted": 109373, "total_column_articles": 296, "frontend_question_id": "440", "is_new_question": false @@ -52029,9 +52323,9 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 3862, - "total_submitted": 6433, - "total_column_articles": 95, + "total_acs": 3875, + "total_submitted": 6447, + "total_column_articles": 96, "frontend_question_id": "439", "is_new_question": false }, @@ -52050,9 +52344,9 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 253118, - "total_submitted": 461016, - "total_column_articles": 1977, + "total_acs": 254451, + "total_submitted": 463360, + "total_column_articles": 1990, "frontend_question_id": "438", "is_new_question": false }, @@ -52071,9 +52365,9 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 206888, - "total_submitted": 397102, - "total_column_articles": 1427, + "total_acs": 207481, + "total_submitted": 398719, + "total_column_articles": 1429, "frontend_question_id": "437", "is_new_question": false }, @@ -52092,9 +52386,9 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 41896, - "total_submitted": 73763, - "total_column_articles": 548, + "total_acs": 42013, + "total_submitted": 73945, + "total_column_articles": 550, "frontend_question_id": "436", "is_new_question": false }, @@ -52113,9 +52407,9 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 193046, - "total_submitted": 377413, - "total_column_articles": 1475, + "total_acs": 193998, + "total_submitted": 379330, + "total_column_articles": 1479, "frontend_question_id": "435", "is_new_question": false }, @@ -52134,9 +52428,9 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 84843, - "total_submitted": 217903, - "total_column_articles": 1095, + "total_acs": 85173, + "total_submitted": 218685, + "total_column_articles": 1098, "frontend_question_id": "434", "is_new_question": false }, @@ -52155,9 +52449,9 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 49129, - "total_submitted": 89186, - "total_column_articles": 714, + "total_acs": 49223, + "total_submitted": 89374, + "total_column_articles": 715, "frontend_question_id": "433", "is_new_question": false }, @@ -52176,8 +52470,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 27812, - "total_submitted": 59078, + "total_acs": 27842, + "total_submitted": 59162, "total_column_articles": 297, "frontend_question_id": "432", "is_new_question": false @@ -52197,8 +52491,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 2323, - "total_submitted": 3719, + "total_acs": 2331, + "total_submitted": 3734, "total_column_articles": 47, "frontend_question_id": "425", "is_new_question": false @@ -52218,9 +52512,9 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 82355, - "total_submitted": 150903, - "total_column_articles": 711, + "total_acs": 82729, + "total_submitted": 151480, + "total_column_articles": 714, "frontend_question_id": "424", "is_new_question": false }, @@ -52239,8 +52533,8 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 37975, - "total_submitted": 62366, + "total_acs": 38093, + "total_submitted": 62510, "total_column_articles": 447, "frontend_question_id": "423", "is_new_question": false @@ -52260,9 +52554,9 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 3326, - "total_submitted": 7572, - "total_column_articles": 84, + "total_acs": 3345, + "total_submitted": 7615, + "total_column_articles": 85, "frontend_question_id": "422", "is_new_question": false }, @@ -52281,9 +52575,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": 42624, - "total_submitted": 69062, - "total_column_articles": 404, + "total_acs": 42807, + "total_submitted": 69307, + "total_column_articles": 405, "frontend_question_id": "421", "is_new_question": false }, @@ -52302,8 +52596,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 17998, - "total_submitted": 45732, + "total_acs": 18027, + "total_submitted": 45796, "total_column_articles": 161, "frontend_question_id": "420", "is_new_question": false @@ -52323,9 +52617,9 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 41894, - "total_submitted": 53458, - "total_column_articles": 540, + "total_acs": 42059, + "total_submitted": 53649, + "total_column_articles": 541, "frontend_question_id": "419", "is_new_question": false }, @@ -52344,9 +52638,9 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 3662, - "total_submitted": 9491, - "total_column_articles": 55, + "total_acs": 3683, + "total_submitted": 9534, + "total_column_articles": 56, "frontend_question_id": "418", "is_new_question": false }, @@ -52365,9 +52659,9 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 77149, - "total_submitted": 137554, - "total_column_articles": 798, + "total_acs": 77383, + "total_submitted": 137970, + "total_column_articles": 799, "frontend_question_id": "417", "is_new_question": false }, @@ -52386,9 +52680,9 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 361734, - "total_submitted": 692675, - "total_column_articles": 1852, + "total_acs": 363352, + "total_submitted": 695637, + "total_column_articles": 1857, "frontend_question_id": "416", "is_new_question": false }, @@ -52407,9 +52701,9 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 246123, - "total_submitted": 447709, - "total_column_articles": 1603, + "total_acs": 247003, + "total_submitted": 449193, + "total_column_articles": 1608, "frontend_question_id": "415", "is_new_question": false }, @@ -52428,9 +52722,9 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 130564, - "total_submitted": 328824, - "total_column_articles": 1589, + "total_acs": 131054, + "total_submitted": 329844, + "total_column_articles": 1596, "frontend_question_id": "414", "is_new_question": false }, @@ -52449,9 +52743,9 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 112657, - "total_submitted": 162031, - "total_column_articles": 1395, + "total_acs": 113091, + "total_submitted": 162602, + "total_column_articles": 1399, "frontend_question_id": "413", "is_new_question": false }, @@ -52470,9 +52764,9 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 172522, - "total_submitted": 248422, - "total_column_articles": 1088, + "total_acs": 173676, + "total_submitted": 250083, + "total_column_articles": 1094, "frontend_question_id": "412", "is_new_question": false }, @@ -52491,8 +52785,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 1471, - "total_submitted": 2979, + "total_acs": 1474, + "total_submitted": 2998, "total_column_articles": 33, "frontend_question_id": "411", "is_new_question": false @@ -52512,9 +52806,9 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 62220, - "total_submitted": 105379, - "total_column_articles": 505, + "total_acs": 62474, + "total_submitted": 105760, + "total_column_articles": 507, "frontend_question_id": "410", "is_new_question": false }, @@ -52533,9 +52827,9 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 158498, - "total_submitted": 284497, - "total_column_articles": 1941, + "total_acs": 159233, + "total_submitted": 285632, + "total_column_articles": 1946, "frontend_question_id": "409", "is_new_question": false }, @@ -52554,9 +52848,9 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 5951, - "total_submitted": 16944, - "total_column_articles": 117, + "total_acs": 5981, + "total_submitted": 17018, + "total_column_articles": 118, "frontend_question_id": "408", "is_new_question": false }, @@ -52575,8 +52869,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 32478, - "total_submitted": 56292, + "total_acs": 32616, + "total_submitted": 56488, "total_column_articles": 296, "frontend_question_id": "407", "is_new_question": false @@ -52596,9 +52890,9 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 218256, - "total_submitted": 287125, - "total_column_articles": 1309, + "total_acs": 219251, + "total_submitted": 288315, + "total_column_articles": 1311, "frontend_question_id": "406", "is_new_question": false }, @@ -52617,9 +52911,9 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 61176, - "total_submitted": 110525, - "total_column_articles": 600, + "total_acs": 61329, + "total_submitted": 110836, + "total_column_articles": 605, "frontend_question_id": "405", "is_new_question": false }, @@ -52638,9 +52932,9 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 204445, - "total_submitted": 330372, - "total_column_articles": 1863, + "total_acs": 205579, + "total_submitted": 332043, + "total_column_articles": 1874, "frontend_question_id": "404", "is_new_question": false }, @@ -52659,8 +52953,8 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 58573, - "total_submitted": 127429, + "total_acs": 58701, + "total_submitted": 127693, "total_column_articles": 557, "frontend_question_id": "403", "is_new_question": false @@ -52680,9 +52974,9 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 127408, - "total_submitted": 398527, - "total_column_articles": 900, + "total_acs": 127679, + "total_submitted": 399331, + "total_column_articles": 902, "frontend_question_id": "402", "is_new_question": false }, @@ -52701,9 +52995,9 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 68589, - "total_submitted": 109867, - "total_column_articles": 851, + "total_acs": 68738, + "total_submitted": 110105, + "total_column_articles": 853, "frontend_question_id": "401", "is_new_question": false }, @@ -52722,9 +53016,9 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 55091, - "total_submitted": 120650, - "total_column_articles": 612, + "total_acs": 55233, + "total_submitted": 120933, + "total_column_articles": 615, "frontend_question_id": "400", "is_new_question": false }, @@ -52743,9 +53037,9 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 69911, - "total_submitted": 117657, - "total_column_articles": 809, + "total_acs": 70172, + "total_submitted": 118125, + "total_column_articles": 812, "frontend_question_id": "399", "is_new_question": false }, @@ -52764,9 +53058,9 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 55855, - "total_submitted": 79031, - "total_column_articles": 462, + "total_acs": 55925, + "total_submitted": 79163, + "total_column_articles": 463, "frontend_question_id": "398", "is_new_question": false }, @@ -52785,9 +53079,9 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 62790, - "total_submitted": 147236, - "total_column_articles": 672, + "total_acs": 63040, + "total_submitted": 147832, + "total_column_articles": 674, "frontend_question_id": "397", "is_new_question": false }, @@ -52806,9 +53100,9 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 46925, - "total_submitted": 87267, - "total_column_articles": 586, + "total_acs": 47019, + "total_submitted": 87429, + "total_column_articles": 587, "frontend_question_id": "396", "is_new_question": false }, @@ -52827,9 +53121,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": 78840, - "total_submitted": 149730, - "total_column_articles": 631, + "total_acs": 79066, + "total_submitted": 150157, + "total_column_articles": 634, "frontend_question_id": "395", "is_new_question": false }, @@ -52848,9 +53142,9 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 218832, - "total_submitted": 384909, - "total_column_articles": 2066, + "total_acs": 219618, + "total_submitted": 386252, + "total_column_articles": 2071, "frontend_question_id": "394", "is_new_question": false }, @@ -52869,8 +53163,8 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 37564, - "total_submitted": 86007, + "total_acs": 37657, + "total_submitted": 86182, "total_column_articles": 483, "frontend_question_id": "393", "is_new_question": false @@ -52890,9 +53184,9 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 264097, - "total_submitted": 504237, - "total_column_articles": 2501, + "total_acs": 265248, + "total_submitted": 506354, + "total_column_articles": 2512, "frontend_question_id": "392", "is_new_question": false }, @@ -52911,8 +53205,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 25851, - "total_submitted": 55960, + "total_acs": 25892, + "total_submitted": 56067, "total_column_articles": 297, "frontend_question_id": "391", "is_new_question": false @@ -52932,8 +53226,8 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 35544, - "total_submitted": 58630, + "total_acs": 35639, + "total_submitted": 58795, "total_column_articles": 453, "frontend_question_id": "390", "is_new_question": false @@ -52953,9 +53247,9 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 151879, - "total_submitted": 225251, - "total_column_articles": 1526, + "total_acs": 152421, + "total_submitted": 226107, + "total_column_articles": 1531, "frontend_question_id": "389", "is_new_question": false }, @@ -52974,9 +53268,9 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 33022, - "total_submitted": 51794, - "total_column_articles": 514, + "total_acs": 33101, + "total_submitted": 51909, + "total_column_articles": 516, "frontend_question_id": "388", "is_new_question": false }, @@ -52995,9 +53289,9 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 357776, - "total_submitted": 642169, - "total_column_articles": 1978, + "total_acs": 359262, + "total_submitted": 644620, + "total_column_articles": 1987, "frontend_question_id": "387", "is_new_question": false }, @@ -53016,8 +53310,8 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 68582, - "total_submitted": 91620, + "total_acs": 68717, + "total_submitted": 91792, "total_column_articles": 657, "frontend_question_id": "386", "is_new_question": false @@ -53037,8 +53331,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 30615, - "total_submitted": 55842, + "total_acs": 30669, + "total_submitted": 55919, "total_column_articles": 292, "frontend_question_id": "385", "is_new_question": false @@ -53058,9 +53352,9 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 116253, - "total_submitted": 189151, - "total_column_articles": 566, + "total_acs": 116676, + "total_submitted": 189776, + "total_column_articles": 567, "frontend_question_id": "384", "is_new_question": false }, @@ -53079,9 +53373,9 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 282014, - "total_submitted": 468224, - "total_column_articles": 2560, + "total_acs": 284420, + "total_submitted": 472048, + "total_column_articles": 2582, "frontend_question_id": "383", "is_new_question": false }, @@ -53100,9 +53394,9 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 57950, - "total_submitted": 79699, - "total_column_articles": 436, + "total_acs": 58078, + "total_submitted": 79874, + "total_column_articles": 438, "frontend_question_id": "382", "is_new_question": false }, @@ -53121,9 +53415,9 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 25507, - "total_submitted": 59822, - "total_column_articles": 231, + "total_acs": 25554, + "total_submitted": 59943, + "total_column_articles": 233, "frontend_question_id": "381", "is_new_question": false }, @@ -53142,9 +53436,9 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 97368, - "total_submitted": 184563, - "total_column_articles": 1498, + "total_acs": 97723, + "total_submitted": 185236, + "total_column_articles": 1534, "frontend_question_id": "380", "is_new_question": false }, @@ -53163,8 +53457,8 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 5434, - "total_submitted": 8867, + "total_acs": 5450, + "total_submitted": 8890, "total_column_articles": 111, "frontend_question_id": "379", "is_new_question": false @@ -53184,9 +53478,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": 116176, - "total_submitted": 182770, - "total_column_articles": 804, + "total_acs": 116441, + "total_submitted": 183193, + "total_column_articles": 808, "frontend_question_id": "378", "is_new_question": false }, @@ -53205,9 +53499,9 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 124437, - "total_submitted": 234243, - "total_column_articles": 865, + "total_acs": 125053, + "total_submitted": 235345, + "total_column_articles": 870, "frontend_question_id": "377", "is_new_question": false }, @@ -53226,9 +53520,9 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 156618, - "total_submitted": 331889, - "total_column_articles": 1408, + "total_acs": 157509, + "total_submitted": 333719, + "total_column_articles": 1412, "frontend_question_id": "376", "is_new_question": false }, @@ -53247,8 +53541,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 42550, - "total_submitted": 68759, + "total_acs": 42652, + "total_submitted": 68896, "total_column_articles": 329, "frontend_question_id": "375", "is_new_question": false @@ -53268,9 +53562,9 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 147049, - "total_submitted": 282016, - "total_column_articles": 946, + "total_acs": 147670, + "total_submitted": 283141, + "total_column_articles": 953, "frontend_question_id": "374", "is_new_question": false }, @@ -53289,8 +53583,8 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 55572, - "total_submitted": 135924, + "total_acs": 55726, + "total_submitted": 136319, "total_column_articles": 524, "frontend_question_id": "373", "is_new_question": false @@ -53310,8 +53604,8 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 43952, - "total_submitted": 76718, + "total_acs": 44069, + "total_submitted": 76919, "total_column_articles": 475, "frontend_question_id": "372", "is_new_question": false @@ -53331,9 +53625,9 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 103029, - "total_submitted": 167579, - "total_column_articles": 663, + "total_acs": 103236, + "total_submitted": 167891, + "total_column_articles": 664, "frontend_question_id": "371", "is_new_question": false }, @@ -53352,9 +53646,9 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 10998, - "total_submitted": 14413, - "total_column_articles": 256, + "total_acs": 11063, + "total_submitted": 14496, + "total_column_articles": 257, "frontend_question_id": "370", "is_new_question": false }, @@ -53373,8 +53667,8 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 7610, - "total_submitted": 12008, + "total_acs": 7641, + "total_submitted": 12050, "total_column_articles": 213, "frontend_question_id": "369", "is_new_question": false @@ -53394,9 +53688,9 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 54061, - "total_submitted": 117475, - "total_column_articles": 573, + "total_acs": 54186, + "total_submitted": 117753, + "total_column_articles": 574, "frontend_question_id": "368", "is_new_question": false }, @@ -53415,9 +53709,9 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 203660, - "total_submitted": 453694, - "total_column_articles": 1534, + "total_acs": 204597, + "total_submitted": 455620, + "total_column_articles": 1541, "frontend_question_id": "367", "is_new_question": false }, @@ -53436,9 +53730,9 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 8525, - "total_submitted": 10720, - "total_column_articles": 207, + "total_acs": 8569, + "total_submitted": 10770, + "total_column_articles": 208, "frontend_question_id": "366", "is_new_question": false }, @@ -53457,8 +53751,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 45448, - "total_submitted": 115424, + "total_acs": 45551, + "total_submitted": 115614, "total_column_articles": 592, "frontend_question_id": "365", "is_new_question": false @@ -53478,8 +53772,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 3112, - "total_submitted": 4528, + "total_acs": 3122, + "total_submitted": 4547, "total_column_articles": 73, "frontend_question_id": "364", "is_new_question": false @@ -53499,8 +53793,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": 40060, - "total_submitted": 82914, + "total_acs": 40129, + "total_submitted": 83038, "total_column_articles": 261, "frontend_question_id": "363", "is_new_question": false @@ -53520,9 +53814,9 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 6328, - "total_submitted": 9203, - "total_column_articles": 110, + "total_acs": 6349, + "total_submitted": 9232, + "total_column_articles": 111, "frontend_question_id": "362", "is_new_question": false }, @@ -53541,9 +53835,9 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 5541, - "total_submitted": 9338, - "total_column_articles": 100, + "total_acs": 5566, + "total_submitted": 9371, + "total_column_articles": 101, "frontend_question_id": "361", "is_new_question": false }, @@ -53562,8 +53856,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 4746, - "total_submitted": 7689, + "total_acs": 4775, + "total_submitted": 7727, "total_column_articles": 88, "frontend_question_id": "360", "is_new_question": false @@ -53583,9 +53877,9 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 7971, - "total_submitted": 10694, - "total_column_articles": 96, + "total_acs": 8006, + "total_submitted": 10739, + "total_column_articles": 99, "frontend_question_id": "359", "is_new_question": false }, @@ -53604,9 +53898,9 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 6446, - "total_submitted": 17710, - "total_column_articles": 85, + "total_acs": 6459, + "total_submitted": 17742, + "total_column_articles": 86, "frontend_question_id": "358", "is_new_question": false }, @@ -53625,8 +53919,8 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 65830, - "total_submitted": 109107, + "total_acs": 65968, + "total_submitted": 109313, "total_column_articles": 914, "frontend_question_id": "357", "is_new_question": false @@ -53646,9 +53940,9 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 2471, - "total_submitted": 6741, - "total_column_articles": 59, + "total_acs": 2491, + "total_submitted": 6777, + "total_column_articles": 60, "frontend_question_id": "356", "is_new_question": false }, @@ -53667,9 +53961,9 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 40178, - "total_submitted": 98025, - "total_column_articles": 638, + "total_acs": 40290, + "total_submitted": 98294, + "total_column_articles": 650, "frontend_question_id": "355", "is_new_question": false }, @@ -53688,9 +53982,9 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 97002, - "total_submitted": 248972, - "total_column_articles": 785, + "total_acs": 97232, + "total_submitted": 249944, + "total_column_articles": 791, "frontend_question_id": "354", "is_new_question": false }, @@ -53709,8 +54003,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 3980, - "total_submitted": 9073, + "total_acs": 3992, + "total_submitted": 9101, "total_column_articles": 81, "frontend_question_id": "353", "is_new_question": false @@ -53730,8 +54024,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 24518, - "total_submitted": 36370, + "total_acs": 24559, + "total_submitted": 36425, "total_column_articles": 400, "frontend_question_id": "352", "is_new_question": false @@ -53751,9 +54045,9 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 7136, - "total_submitted": 11711, - "total_column_articles": 131, + "total_acs": 7155, + "total_submitted": 11733, + "total_column_articles": 132, "frontend_question_id": "351", "is_new_question": false }, @@ -53772,9 +54066,9 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 436026, - "total_submitted": 767395, - "total_column_articles": 2564, + "total_acs": 437852, + "total_submitted": 770512, + "total_column_articles": 2574, "frontend_question_id": "350", "is_new_question": false }, @@ -53793,9 +54087,9 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 389428, - "total_submitted": 523860, - "total_column_articles": 2590, + "total_acs": 391531, + "total_submitted": 526800, + "total_column_articles": 2603, "frontend_question_id": "349", "is_new_question": false }, @@ -53814,8 +54108,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 8872, - "total_submitted": 14904, + "total_acs": 8890, + "total_submitted": 14932, "total_column_articles": 127, "frontend_question_id": "348", "is_new_question": false @@ -53835,9 +54129,9 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 382053, - "total_submitted": 602492, - "total_column_articles": 2633, + "total_acs": 383614, + "total_submitted": 604787, + "total_column_articles": 2644, "frontend_question_id": "347", "is_new_question": false }, @@ -53856,8 +54150,8 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 18652, - "total_submitted": 25860, + "total_acs": 18680, + "total_submitted": 25897, "total_column_articles": 198, "frontend_question_id": "346", "is_new_question": false @@ -53877,9 +54171,9 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 147799, - "total_submitted": 271470, - "total_column_articles": 1339, + "total_acs": 148240, + "total_submitted": 272239, + "total_column_articles": 1342, "frontend_question_id": "345", "is_new_question": false }, @@ -53898,9 +54192,9 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 671311, - "total_submitted": 845485, - "total_column_articles": 3376, + "total_acs": 674377, + "total_submitted": 849170, + "total_column_articles": 3391, "frontend_question_id": "344", "is_new_question": false }, @@ -53919,9 +54213,9 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 223727, - "total_submitted": 359059, - "total_column_articles": 1743, + "total_acs": 225040, + "total_submitted": 361094, + "total_column_articles": 1749, "frontend_question_id": "343", "is_new_question": false }, @@ -53940,9 +54234,9 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 121873, - "total_submitted": 231266, - "total_column_articles": 1035, + "total_acs": 122346, + "total_submitted": 232103, + "total_column_articles": 1036, "frontend_question_id": "342", "is_new_question": false }, @@ -53961,8 +54255,8 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 71185, - "total_submitted": 97787, + "total_acs": 71378, + "total_submitted": 98066, "total_column_articles": 647, "frontend_question_id": "341", "is_new_question": false @@ -53982,9 +54276,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": 23265, - "total_submitted": 45757, - "total_column_articles": 289, + "total_acs": 23358, + "total_submitted": 45930, + "total_column_articles": 290, "frontend_question_id": "340", "is_new_question": false }, @@ -54003,8 +54297,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 5878, - "total_submitted": 7081, + "total_acs": 5895, + "total_submitted": 7099, "total_column_articles": 80, "frontend_question_id": "339", "is_new_question": false @@ -54024,9 +54318,9 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 266937, - "total_submitted": 338881, - "total_column_articles": 2069, + "total_acs": 268004, + "total_submitted": 340205, + "total_column_articles": 2080, "frontend_question_id": "338", "is_new_question": false }, @@ -54045,9 +54339,9 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 242009, - "total_submitted": 396860, - "total_column_articles": 1577, + "total_acs": 242995, + "total_submitted": 398530, + "total_column_articles": 1581, "frontend_question_id": "337", "is_new_question": false }, @@ -54066,8 +54360,8 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 26545, - "total_submitted": 69044, + "total_acs": 26605, + "total_submitted": 69224, "total_column_articles": 236, "frontend_question_id": "336", "is_new_question": false @@ -54087,8 +54381,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 18071, - "total_submitted": 42435, + "total_acs": 18111, + "total_submitted": 42504, "total_column_articles": 162, "frontend_question_id": "335", "is_new_question": false @@ -54108,9 +54402,9 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 113421, - "total_submitted": 261244, - "total_column_articles": 750, + "total_acs": 113888, + "total_submitted": 262323, + "total_column_articles": 753, "frontend_question_id": "334", "is_new_question": false }, @@ -54129,8 +54423,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 8160, - "total_submitted": 16869, + "total_acs": 8195, + "total_submitted": 16927, "total_column_articles": 141, "frontend_question_id": "333", "is_new_question": false @@ -54150,8 +54444,8 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 75498, - "total_submitted": 159090, + "total_acs": 75882, + "total_submitted": 159835, "total_column_articles": 548, "frontend_question_id": "332", "is_new_question": false @@ -54171,9 +54465,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": 57558, - "total_submitted": 119550, - "total_column_articles": 630, + "total_acs": 57672, + "total_submitted": 119799, + "total_column_articles": 632, "frontend_question_id": "331", "is_new_question": false }, @@ -54192,8 +54486,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 22179, - "total_submitted": 41810, + "total_acs": 22236, + "total_submitted": 41906, "total_column_articles": 182, "frontend_question_id": "330", "is_new_question": false @@ -54213,8 +54507,8 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 90965, - "total_submitted": 176611, + "total_acs": 91273, + "total_submitted": 177094, "total_column_articles": 803, "frontend_question_id": "329", "is_new_question": false @@ -54234,9 +54528,9 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 192843, - "total_submitted": 295703, - "total_column_articles": 1519, + "total_acs": 193331, + "total_submitted": 296439, + "total_column_articles": 1521, "frontend_question_id": "328", "is_new_question": false }, @@ -54255,9 +54549,9 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 37666, - "total_submitted": 91664, - "total_column_articles": 326, + "total_acs": 37886, + "total_submitted": 92122, + "total_column_articles": 328, "frontend_question_id": "327", "is_new_question": false }, @@ -54276,9 +54570,9 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 193700, - "total_submitted": 380631, - "total_column_articles": 859, + "total_acs": 194308, + "total_submitted": 381722, + "total_column_articles": 860, "frontend_question_id": "326", "is_new_question": false }, @@ -54297,9 +54591,9 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 15867, - "total_submitted": 30493, - "total_column_articles": 178, + "total_acs": 15948, + "total_submitted": 30706, + "total_column_articles": 180, "frontend_question_id": "325", "is_new_question": false }, @@ -54318,9 +54612,9 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 59581, - "total_submitted": 145409, - "total_column_articles": 382, + "total_acs": 59732, + "total_submitted": 145733, + "total_column_articles": 383, "frontend_question_id": "324", "is_new_question": false }, @@ -54339,9 +54633,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": 21581, - "total_submitted": 33017, - "total_column_articles": 312, + "total_acs": 21673, + "total_submitted": 33146, + "total_column_articles": 313, "frontend_question_id": "323", "is_new_question": false }, @@ -54360,9 +54654,9 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 567179, - "total_submitted": 1226594, - "total_column_articles": 3319, + "total_acs": 569240, + "total_submitted": 1230716, + "total_column_articles": 3339, "frontend_question_id": "322", "is_new_question": false }, @@ -54381,9 +54675,9 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 34467, - "total_submitted": 81966, - "total_column_articles": 290, + "total_acs": 34540, + "total_submitted": 82118, + "total_column_articles": 291, "frontend_question_id": "321", "is_new_question": false }, @@ -54402,9 +54696,9 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 4420, - "total_submitted": 6349, - "total_column_articles": 80, + "total_acs": 4447, + "total_submitted": 6377, + "total_column_articles": 81, "frontend_question_id": "320", "is_new_question": false }, @@ -54423,8 +54717,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 58516, - "total_submitted": 101552, + "total_acs": 58600, + "total_submitted": 101704, "total_column_articles": 526, "frontend_question_id": "319", "is_new_question": false @@ -54444,8 +54738,8 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 64339, - "total_submitted": 87999, + "total_acs": 64458, + "total_submitted": 88190, "total_column_articles": 600, "frontend_question_id": "318", "is_new_question": false @@ -54465,9 +54759,9 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 6946, - "total_submitted": 14559, - "total_column_articles": 91, + "total_acs": 6981, + "total_submitted": 14615, + "total_column_articles": 92, "frontend_question_id": "317", "is_new_question": false }, @@ -54486,8 +54780,8 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 108727, - "total_submitted": 225445, + "total_acs": 108990, + "total_submitted": 225999, "total_column_articles": 841, "frontend_question_id": "316", "is_new_question": false @@ -54507,9 +54801,9 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 77126, - "total_submitted": 178230, - "total_column_articles": 762, + "total_acs": 77385, + "total_submitted": 178708, + "total_column_articles": 770, "frontend_question_id": "315", "is_new_question": false }, @@ -54528,8 +54822,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 9314, - "total_submitted": 16717, + "total_acs": 9369, + "total_submitted": 16819, "total_column_articles": 155, "frontend_question_id": "314", "is_new_question": false @@ -54549,8 +54843,8 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 55524, - "total_submitted": 96176, + "total_acs": 55636, + "total_submitted": 96428, "total_column_articles": 484, "frontend_question_id": "313", "is_new_question": false @@ -54570,9 +54864,9 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 95088, - "total_submitted": 136009, - "total_column_articles": 611, + "total_acs": 95446, + "total_submitted": 136466, + "total_column_articles": 612, "frontend_question_id": "312", "is_new_question": false }, @@ -54591,8 +54885,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 6219, - "total_submitted": 8143, + "total_acs": 6229, + "total_submitted": 8161, "total_column_articles": 78, "frontend_question_id": "311", "is_new_question": false @@ -54612,8 +54906,8 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 56139, - "total_submitted": 130842, + "total_acs": 56366, + "total_submitted": 131302, "total_column_articles": 454, "frontend_question_id": "310", "is_new_question": false @@ -54633,9 +54927,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": 227289, - "total_submitted": 355400, - "total_column_articles": 1733, + "total_acs": 228273, + "total_submitted": 356973, + "total_column_articles": 1739, "frontend_question_id": "309", "is_new_question": false }, @@ -54654,8 +54948,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 3797, - "total_submitted": 5909, + "total_acs": 3819, + "total_submitted": 5938, "total_column_articles": 78, "frontend_question_id": "308", "is_new_question": false @@ -54675,8 +54969,8 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 62574, - "total_submitted": 120817, + "total_acs": 62778, + "total_submitted": 121121, "total_column_articles": 573, "frontend_question_id": "307", "is_new_question": false @@ -54696,9 +54990,9 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 46546, - "total_submitted": 122490, - "total_column_articles": 669, + "total_acs": 46621, + "total_submitted": 122690, + "total_column_articles": 670, "frontend_question_id": "306", "is_new_question": false }, @@ -54717,8 +55011,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 8564, - "total_submitted": 20267, + "total_acs": 8587, + "total_submitted": 20318, "total_column_articles": 121, "frontend_question_id": "305", "is_new_question": false @@ -54738,9 +55032,9 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 114300, - "total_submitted": 187954, - "total_column_articles": 1250, + "total_acs": 115109, + "total_submitted": 189100, + "total_column_articles": 1262, "frontend_question_id": "304", "is_new_question": false }, @@ -54759,9 +55053,9 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 201065, - "total_submitted": 263829, - "total_column_articles": 1973, + "total_acs": 201900, + "total_submitted": 264787, + "total_column_articles": 1983, "frontend_question_id": "303", "is_new_question": false }, @@ -54780,8 +55074,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 3606, - "total_submitted": 5321, + "total_acs": 3623, + "total_submitted": 5343, "total_column_articles": 62, "frontend_question_id": "302", "is_new_question": false @@ -54801,9 +55095,9 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 88835, - "total_submitted": 160799, - "total_column_articles": 553, + "total_acs": 89200, + "total_submitted": 161447, + "total_column_articles": 555, "frontend_question_id": "301", "is_new_question": false }, @@ -54822,9 +55116,9 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 662688, - "total_submitted": 1217471, - "total_column_articles": 3988, + "total_acs": 664925, + "total_submitted": 1221158, + "total_column_articles": 4013, "frontend_question_id": "300", "is_new_question": false }, @@ -54843,8 +55137,8 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 78802, - "total_submitted": 137605, + "total_acs": 78981, + "total_submitted": 137889, "total_column_articles": 867, "frontend_question_id": "299", "is_new_question": false @@ -54864,8 +55158,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 8825, - "total_submitted": 14691, + "total_acs": 8864, + "total_submitted": 14746, "total_column_articles": 136, "frontend_question_id": "298", "is_new_question": false @@ -54885,9 +55179,9 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 197868, - "total_submitted": 337309, - "total_column_articles": 1277, + "total_acs": 198598, + "total_submitted": 338427, + "total_column_articles": 1284, "frontend_question_id": "297", "is_new_question": false }, @@ -54906,8 +55200,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 4070, - "total_submitted": 6629, + "total_acs": 4078, + "total_submitted": 6661, "total_column_articles": 65, "frontend_question_id": "296", "is_new_question": false @@ -54927,9 +55221,9 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 100053, - "total_submitted": 188004, - "total_column_articles": 739, + "total_acs": 100339, + "total_submitted": 188532, + "total_column_articles": 740, "frontend_question_id": "295", "is_new_question": false }, @@ -54948,9 +55242,9 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 6004, - "total_submitted": 10077, - "total_column_articles": 83, + "total_acs": 6035, + "total_submitted": 10120, + "total_column_articles": 84, "frontend_question_id": "294", "is_new_question": false }, @@ -54969,8 +55263,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 7528, - "total_submitted": 10383, + "total_acs": 7555, + "total_submitted": 10420, "total_column_articles": 117, "frontend_question_id": "293", "is_new_question": false @@ -54990,9 +55284,9 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 150480, - "total_submitted": 213413, - "total_column_articles": 1029, + "total_acs": 150867, + "total_submitted": 213932, + "total_column_articles": 1030, "frontend_question_id": "292", "is_new_question": false }, @@ -55011,9 +55305,9 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 4577, - "total_submitted": 8712, - "total_column_articles": 97, + "total_acs": 4602, + "total_submitted": 8757, + "total_column_articles": 98, "frontend_question_id": "291", "is_new_question": false }, @@ -55032,9 +55326,9 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 122356, - "total_submitted": 272620, - "total_column_articles": 1575, + "total_acs": 122882, + "total_submitted": 273789, + "total_column_articles": 1579, "frontend_question_id": "290", "is_new_question": false }, @@ -55053,9 +55347,9 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 72282, - "total_submitted": 95516, - "total_column_articles": 1076, + "total_acs": 72445, + "total_submitted": 95710, + "total_column_articles": 1078, "frontend_question_id": "289", "is_new_question": false }, @@ -55074,8 +55368,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 5962, - "total_submitted": 12258, + "total_acs": 5994, + "total_submitted": 12298, "total_column_articles": 83, "frontend_question_id": "288", "is_new_question": false @@ -55095,9 +55389,9 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 292892, - "total_submitted": 454191, - "total_column_articles": 1879, + "total_acs": 293798, + "total_submitted": 455694, + "total_column_articles": 1884, "frontend_question_id": "287", "is_new_question": false }, @@ -55116,9 +55410,9 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 18312, - "total_submitted": 33519, - "total_column_articles": 235, + "total_acs": 18384, + "total_submitted": 33629, + "total_column_articles": 236, "frontend_question_id": "286", "is_new_question": false }, @@ -55137,9 +55431,9 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 14724, - "total_submitted": 22838, - "total_column_articles": 172, + "total_acs": 14815, + "total_submitted": 22957, + "total_column_articles": 174, "frontend_question_id": "285", "is_new_question": false }, @@ -55158,9 +55452,9 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 30886, - "total_submitted": 40311, - "total_column_articles": 248, + "total_acs": 30953, + "total_submitted": 40398, + "total_column_articles": 249, "frontend_question_id": "284", "is_new_question": false }, @@ -55179,9 +55473,9 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 948606, - "total_submitted": 1482775, - "total_column_articles": 5827, + "total_acs": 952756, + "total_submitted": 1489381, + "total_column_articles": 5861, "frontend_question_id": "283", "is_new_question": false }, @@ -55200,8 +55494,8 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 25283, - "total_submitted": 53629, + "total_acs": 25335, + "total_submitted": 53765, "total_column_articles": 207, "frontend_question_id": "282", "is_new_question": false @@ -55221,9 +55515,9 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 5220, - "total_submitted": 6820, - "total_column_articles": 124, + "total_acs": 5263, + "total_submitted": 6871, + "total_column_articles": 125, "frontend_question_id": "281", "is_new_question": false }, @@ -55242,8 +55536,8 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 9278, - "total_submitted": 13391, + "total_acs": 9301, + "total_submitted": 13423, "total_column_articles": 104, "frontend_question_id": "280", "is_new_question": false @@ -55263,9 +55557,9 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 363148, - "total_submitted": 551409, - "total_column_articles": 1887, + "total_acs": 364571, + "total_submitted": 553399, + "total_column_articles": 1894, "frontend_question_id": "279", "is_new_question": false }, @@ -55284,9 +55578,9 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 424279, - "total_submitted": 929761, - "total_column_articles": 2308, + "total_acs": 426511, + "total_submitted": 934943, + "total_column_articles": 2326, "frontend_question_id": "278", "is_new_question": false }, @@ -55305,8 +55599,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 13463, - "total_submitted": 23146, + "total_acs": 13505, + "total_submitted": 23214, "total_column_articles": 133, "frontend_question_id": "277", "is_new_question": false @@ -55326,8 +55620,8 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 10121, - "total_submitted": 19155, + "total_acs": 10150, + "total_submitted": 19195, "total_column_articles": 182, "frontend_question_id": "276", "is_new_question": false @@ -55347,9 +55641,9 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 65855, - "total_submitted": 145224, - "total_column_articles": 535, + "total_acs": 65994, + "total_submitted": 145516, + "total_column_articles": 537, "frontend_question_id": "275", "is_new_question": false }, @@ -55368,8 +55662,8 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 72077, - "total_submitted": 161950, + "total_acs": 72248, + "total_submitted": 162263, "total_column_articles": 731, "frontend_question_id": "274", "is_new_question": false @@ -55389,9 +55683,9 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 36640, - "total_submitted": 100335, - "total_column_articles": 433, + "total_acs": 36707, + "total_submitted": 100503, + "total_column_articles": 434, "frontend_question_id": "273", "is_new_question": false }, @@ -55410,9 +55704,9 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 5898, - "total_submitted": 8920, - "total_column_articles": 121, + "total_acs": 5916, + "total_submitted": 8948, + "total_column_articles": 123, "frontend_question_id": "272", "is_new_question": false }, @@ -55431,8 +55725,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 4739, - "total_submitted": 8260, + "total_acs": 4760, + "total_submitted": 8302, "total_column_articles": 69, "frontend_question_id": "271", "is_new_question": false @@ -55452,8 +55746,8 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 16760, - "total_submitted": 28761, + "total_acs": 16801, + "total_submitted": 28813, "total_column_articles": 198, "frontend_question_id": "270", "is_new_question": false @@ -55473,8 +55767,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 11572, - "total_submitted": 31735, + "total_acs": 11608, + "total_submitted": 31848, "total_column_articles": 170, "frontend_question_id": "269", "is_new_question": false @@ -55494,9 +55788,9 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 283305, - "total_submitted": 427465, - "total_column_articles": 2112, + "total_acs": 284341, + "total_submitted": 428894, + "total_column_articles": 2120, "frontend_question_id": "268", "is_new_question": false }, @@ -55515,9 +55809,9 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 5822, - "total_submitted": 12418, - "total_column_articles": 124, + "total_acs": 5857, + "total_submitted": 12463, + "total_column_articles": 125, "frontend_question_id": "267", "is_new_question": false }, @@ -55536,9 +55830,9 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 10908, - "total_submitted": 15583, - "total_column_articles": 165, + "total_acs": 10953, + "total_submitted": 15641, + "total_column_articles": 166, "frontend_question_id": "266", "is_new_question": false }, @@ -55557,8 +55851,8 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 12447, - "total_submitted": 19780, + "total_acs": 12500, + "total_submitted": 19852, "total_column_articles": 255, "frontend_question_id": "265", "is_new_question": false @@ -55578,9 +55872,9 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 148132, - "total_submitted": 251815, - "total_column_articles": 907, + "total_acs": 148455, + "total_submitted": 252339, + "total_column_articles": 909, "frontend_question_id": "264", "is_new_question": false }, @@ -55599,9 +55893,9 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 145478, - "total_submitted": 286434, - "total_column_articles": 1103, + "total_acs": 145855, + "total_submitted": 287189, + "total_column_articles": 1104, "frontend_question_id": "263", "is_new_question": false }, @@ -55620,9 +55914,9 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 59200, - "total_submitted": 140605, - "total_column_articles": 567, + "total_acs": 59413, + "total_submitted": 141108, + "total_column_articles": 570, "frontend_question_id": "262", "is_new_question": false }, @@ -55641,9 +55935,9 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 16508, - "total_submitted": 32363, - "total_column_articles": 223, + "total_acs": 16591, + "total_submitted": 32506, + "total_column_articles": 224, "frontend_question_id": "261", "is_new_question": false }, @@ -55662,9 +55956,9 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 105570, - "total_submitted": 145417, - "total_column_articles": 907, + "total_acs": 105835, + "total_submitted": 145790, + "total_column_articles": 910, "frontend_question_id": "260", "is_new_question": false }, @@ -55683,9 +55977,9 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 11967, - "total_submitted": 21603, - "total_column_articles": 136, + "total_acs": 12013, + "total_submitted": 21706, + "total_column_articles": 137, "frontend_question_id": "259", "is_new_question": false }, @@ -55704,9 +55998,9 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 154272, - "total_submitted": 216748, - "total_column_articles": 1320, + "total_acs": 154699, + "total_submitted": 217401, + "total_column_articles": 1323, "frontend_question_id": "258", "is_new_question": false }, @@ -55725,9 +56019,9 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 274932, - "total_submitted": 389557, - "total_column_articles": 1788, + "total_acs": 276365, + "total_submitted": 391481, + "total_column_articles": 1795, "frontend_question_id": "257", "is_new_question": false }, @@ -55746,8 +56040,8 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 19612, - "total_submitted": 28422, + "total_acs": 19711, + "total_submitted": 28540, "total_column_articles": 291, "frontend_question_id": "256", "is_new_question": false @@ -55767,9 +56061,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": 8845, - "total_submitted": 17833, - "total_column_articles": 101, + "total_acs": 8905, + "total_submitted": 17948, + "total_column_articles": 104, "frontend_question_id": "255", "is_new_question": false }, @@ -55788,9 +56082,9 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 9785, - "total_submitted": 17142, - "total_column_articles": 133, + "total_acs": 9850, + "total_submitted": 17232, + "total_column_articles": 134, "frontend_question_id": "254", "is_new_question": false }, @@ -55809,8 +56103,8 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 60507, - "total_submitted": 116028, + "total_acs": 60691, + "total_submitted": 116366, "total_column_articles": 560, "frontend_question_id": "253", "is_new_question": false @@ -55830,8 +56124,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 21966, - "total_submitted": 38036, + "total_acs": 22039, + "total_submitted": 38175, "total_column_articles": 231, "frontend_question_id": "252", "is_new_question": false @@ -55851,8 +56145,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 6699, - "total_submitted": 12142, + "total_acs": 6724, + "total_submitted": 12208, "total_column_articles": 107, "frontend_question_id": "251", "is_new_question": false @@ -55872,9 +56166,9 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 7433, - "total_submitted": 11741, - "total_column_articles": 147, + "total_acs": 7477, + "total_submitted": 11815, + "total_column_articles": 149, "frontend_question_id": "250", "is_new_question": false }, @@ -55893,8 +56187,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 9758, - "total_submitted": 15051, + "total_acs": 9787, + "total_submitted": 15087, "total_column_articles": 160, "frontend_question_id": "249", "is_new_question": false @@ -55914,8 +56208,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 4154, - "total_submitted": 8501, + "total_acs": 4172, + "total_submitted": 8532, "total_column_articles": 78, "frontend_question_id": "248", "is_new_question": false @@ -55935,8 +56229,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 8048, - "total_submitted": 14810, + "total_acs": 8080, + "total_submitted": 14852, "total_column_articles": 129, "frontend_question_id": "247", "is_new_question": false @@ -55956,8 +56250,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 9857, - "total_submitted": 20758, + "total_acs": 9951, + "total_submitted": 20901, "total_column_articles": 169, "frontend_question_id": "246", "is_new_question": false @@ -55977,8 +56271,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 7129, - "total_submitted": 12451, + "total_acs": 7156, + "total_submitted": 12484, "total_column_articles": 86, "frontend_question_id": "245", "is_new_question": false @@ -55998,8 +56292,8 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 9183, - "total_submitted": 15466, + "total_acs": 9221, + "total_submitted": 15522, "total_column_articles": 105, "frontend_question_id": "244", "is_new_question": false @@ -56019,8 +56313,8 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 14757, - "total_submitted": 22130, + "total_acs": 14811, + "total_submitted": 22208, "total_column_articles": 174, "frontend_question_id": "243", "is_new_question": false @@ -56040,9 +56334,9 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 539549, - "total_submitted": 820502, - "total_column_articles": 3028, + "total_acs": 542474, + "total_submitted": 824790, + "total_column_articles": 3043, "frontend_question_id": "242", "is_new_question": false }, @@ -56061,8 +56355,8 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 72286, - "total_submitted": 95406, + "total_acs": 72461, + "total_submitted": 95632, "total_column_articles": 712, "frontend_question_id": "241", "is_new_question": false @@ -56082,9 +56376,9 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 337482, - "total_submitted": 643516, - "total_column_articles": 1629, + "total_acs": 338711, + "total_submitted": 645616, + "total_column_articles": 1633, "frontend_question_id": "240", "is_new_question": false }, @@ -56103,9 +56397,9 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 391748, - "total_submitted": 784699, - "total_column_articles": 2877, + "total_acs": 393565, + "total_submitted": 788309, + "total_column_articles": 2925, "frontend_question_id": "239", "is_new_question": false }, @@ -56124,9 +56418,9 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 240696, - "total_submitted": 323385, - "total_column_articles": 1490, + "total_acs": 241712, + "total_submitted": 324676, + "total_column_articles": 1497, "frontend_question_id": "238", "is_new_question": false }, @@ -56145,9 +56439,9 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 326906, - "total_submitted": 379894, - "total_column_articles": 1682, + "total_acs": 327556, + "total_submitted": 380631, + "total_column_articles": 1683, "frontend_question_id": "237", "is_new_question": false }, @@ -56166,9 +56460,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": 487812, - "total_submitted": 701689, - "total_column_articles": 2516, + "total_acs": 489756, + "total_submitted": 704339, + "total_column_articles": 2528, "frontend_question_id": "236", "is_new_question": false }, @@ -56187,9 +56481,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": 307340, - "total_submitted": 452403, - "total_column_articles": 1687, + "total_acs": 308929, + "total_submitted": 454496, + "total_column_articles": 1696, "frontend_question_id": "235", "is_new_question": false }, @@ -56208,9 +56502,9 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 541472, - "total_submitted": 1025576, - "total_column_articles": 3273, + "total_acs": 543459, + "total_submitted": 1028879, + "total_column_articles": 3285, "frontend_question_id": "234", "is_new_question": false }, @@ -56229,9 +56523,9 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 50704, - "total_submitted": 103825, - "total_column_articles": 596, + "total_acs": 50830, + "total_submitted": 104057, + "total_column_articles": 598, "frontend_question_id": "233", "is_new_question": false }, @@ -56250,9 +56544,9 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 311730, - "total_submitted": 453893, - "total_column_articles": 2148, + "total_acs": 313445, + "total_submitted": 456457, + "total_column_articles": 2152, "frontend_question_id": "232", "is_new_question": false }, @@ -56271,9 +56565,9 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 270302, - "total_submitted": 537245, - "total_column_articles": 1937, + "total_acs": 271455, + "total_submitted": 539547, + "total_column_articles": 1944, "frontend_question_id": "231", "is_new_question": false }, @@ -56292,9 +56586,9 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 249606, - "total_submitted": 329123, - "total_column_articles": 1703, + "total_acs": 250329, + "total_submitted": 330067, + "total_column_articles": 1704, "frontend_question_id": "230", "is_new_question": false }, @@ -56313,8 +56607,8 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 91225, - "total_submitted": 169116, + "total_acs": 91425, + "total_submitted": 169454, "total_column_articles": 826, "frontend_question_id": "229", "is_new_question": false @@ -56334,9 +56628,9 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 85565, - "total_submitted": 154433, - "total_column_articles": 977, + "total_acs": 85861, + "total_submitted": 155055, + "total_column_articles": 979, "frontend_question_id": "228", "is_new_question": false }, @@ -56355,9 +56649,9 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 139526, - "total_submitted": 314268, - "total_column_articles": 1050, + "total_acs": 139884, + "total_submitted": 315037, + "total_column_articles": 1055, "frontend_question_id": "227", "is_new_question": false }, @@ -56376,9 +56670,9 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 592902, - "total_submitted": 746425, - "total_column_articles": 3854, + "total_acs": 595488, + "total_submitted": 749531, + "total_column_articles": 3893, "frontend_question_id": "226", "is_new_question": false }, @@ -56397,9 +56691,9 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 250996, - "total_submitted": 375432, - "total_column_articles": 5378, + "total_acs": 252293, + "total_submitted": 377630, + "total_column_articles": 5385, "frontend_question_id": "225", "is_new_question": false }, @@ -56418,9 +56712,9 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 109860, - "total_submitted": 259134, - "total_column_articles": 969, + "total_acs": 110144, + "total_submitted": 259837, + "total_column_articles": 976, "frontend_question_id": "224", "is_new_question": false }, @@ -56439,8 +56733,8 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 54691, - "total_submitted": 102286, + "total_acs": 54827, + "total_submitted": 102506, "total_column_articles": 621, "frontend_question_id": "223", "is_new_question": false @@ -56460,9 +56754,9 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 247771, - "total_submitted": 307304, - "total_column_articles": 1567, + "total_acs": 249248, + "total_submitted": 309046, + "total_column_articles": 1582, "frontend_question_id": "222", "is_new_question": false }, @@ -56481,9 +56775,9 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 247356, - "total_submitted": 500495, - "total_column_articles": 1568, + "total_acs": 248202, + "total_submitted": 502183, + "total_column_articles": 1571, "frontend_question_id": "221", "is_new_question": false }, @@ -56502,9 +56796,9 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 90411, - "total_submitted": 305162, - "total_column_articles": 604, + "total_acs": 90592, + "total_submitted": 305590, + "total_column_articles": 606, "frontend_question_id": "220", "is_new_question": false }, @@ -56523,9 +56817,9 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 216373, - "total_submitted": 487737, - "total_column_articles": 1719, + "total_acs": 217072, + "total_submitted": 489280, + "total_column_articles": 1722, "frontend_question_id": "219", "is_new_question": false }, @@ -56544,9 +56838,9 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 46510, - "total_submitted": 84027, - "total_column_articles": 408, + "total_acs": 46661, + "total_submitted": 84301, + "total_column_articles": 409, "frontend_question_id": "218", "is_new_question": false }, @@ -56565,9 +56859,9 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 716097, - "total_submitted": 1288485, - "total_column_articles": 3376, + "total_acs": 719974, + "total_submitted": 1296064, + "total_column_articles": 3391, "frontend_question_id": "217", "is_new_question": false }, @@ -56586,9 +56880,9 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 223774, - "total_submitted": 310226, - "total_column_articles": 1755, + "total_acs": 225063, + "total_submitted": 312042, + "total_column_articles": 1761, "frontend_question_id": "216", "is_new_question": false }, @@ -56607,9 +56901,9 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 793538, - "total_submitted": 1237909, - "total_column_articles": 3786, + "total_acs": 796011, + "total_submitted": 1241760, + "total_column_articles": 3793, "frontend_question_id": "215", "is_new_question": false }, @@ -56628,9 +56922,9 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 43347, - "total_submitted": 109903, - "total_column_articles": 440, + "total_acs": 43441, + "total_submitted": 110099, + "total_column_articles": 441, "frontend_question_id": "214", "is_new_question": false }, @@ -56649,9 +56943,9 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 304900, - "total_submitted": 692072, - "total_column_articles": 2517, + "total_acs": 306028, + "total_submitted": 694376, + "total_column_articles": 2523, "frontend_question_id": "213", "is_new_question": false }, @@ -56670,8 +56964,8 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 87258, - "total_submitted": 196297, + "total_acs": 87436, + "total_submitted": 196763, "total_column_articles": 731, "frontend_question_id": "212", "is_new_question": false @@ -56691,8 +56985,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": 68727, - "total_submitted": 138268, + "total_acs": 68880, + "total_submitted": 138621, "total_column_articles": 712, "frontend_question_id": "211", "is_new_question": false @@ -56712,9 +57006,9 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 163819, - "total_submitted": 290165, - "total_column_articles": 1236, + "total_acs": 164333, + "total_submitted": 291015, + "total_column_articles": 1239, "frontend_question_id": "210", "is_new_question": false }, @@ -56733,9 +57027,9 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 469119, - "total_submitted": 988138, - "total_column_articles": 2948, + "total_acs": 471846, + "total_submitted": 994327, + "total_column_articles": 2970, "frontend_question_id": "209", "is_new_question": false }, @@ -56754,9 +57048,9 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 243908, - "total_submitted": 338573, - "total_column_articles": 1546, + "total_acs": 244717, + "total_submitted": 339712, + "total_column_articles": 1549, "frontend_question_id": "208", "is_new_question": false }, @@ -56775,9 +57069,9 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 271121, - "total_submitted": 503756, - "total_column_articles": 1956, + "total_acs": 272152, + "total_submitted": 505658, + "total_column_articles": 1969, "frontend_question_id": "207", "is_new_question": false }, @@ -56796,9 +57090,9 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 1330367, - "total_submitted": 1811937, - "total_column_articles": 10777, + "total_acs": 1335768, + "total_submitted": 1819143, + "total_column_articles": 10818, "frontend_question_id": "206", "is_new_question": false }, @@ -56817,9 +57111,9 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 185585, - "total_submitted": 373250, - "total_column_articles": 1403, + "total_acs": 186239, + "total_submitted": 374541, + "total_column_articles": 1407, "frontend_question_id": "205", "is_new_question": false }, @@ -56838,9 +57132,9 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 237052, - "total_submitted": 632063, - "total_column_articles": 1034, + "total_acs": 237703, + "total_submitted": 633952, + "total_column_articles": 1041, "frontend_question_id": "204", "is_new_question": false }, @@ -56859,9 +57153,9 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 483210, - "total_submitted": 885815, - "total_column_articles": 2900, + "total_acs": 486106, + "total_submitted": 890959, + "total_column_articles": 2914, "frontend_question_id": "203", "is_new_question": false }, @@ -56880,9 +57174,9 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 336260, - "total_submitted": 531737, - "total_column_articles": 2482, + "total_acs": 338157, + "total_submitted": 534637, + "total_column_articles": 2497, "frontend_question_id": "202", "is_new_question": false }, @@ -56901,9 +57195,9 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 70539, - "total_submitted": 131097, - "total_column_articles": 488, + "total_acs": 70754, + "total_submitted": 131455, + "total_column_articles": 491, "frontend_question_id": "201", "is_new_question": false }, @@ -56922,9 +57216,9 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 598597, - "total_submitted": 1014801, - "total_column_articles": 3711, + "total_acs": 600493, + "total_submitted": 1017796, + "total_column_articles": 3722, "frontend_question_id": "200", "is_new_question": false }, @@ -56943,9 +57237,9 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 258721, - "total_submitted": 393800, - "total_column_articles": 2511, + "total_acs": 259673, + "total_submitted": 395171, + "total_column_articles": 2516, "frontend_question_id": "199", "is_new_question": false }, @@ -56964,9 +57258,9 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 678216, - "total_submitted": 1253523, - "total_column_articles": 4330, + "total_acs": 680660, + "total_submitted": 1257757, + "total_column_articles": 4340, "frontend_question_id": "198", "is_new_question": false }, @@ -56985,9 +57279,9 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 158661, - "total_submitted": 293208, - "total_column_articles": 900, + "total_acs": 159293, + "total_submitted": 294289, + "total_column_articles": 902, "frontend_question_id": "197", "is_new_question": false }, @@ -57006,9 +57300,9 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 189013, - "total_submitted": 275389, - "total_column_articles": 715, + "total_acs": 189932, + "total_submitted": 276640, + "total_column_articles": 720, "frontend_question_id": "196", "is_new_question": false }, @@ -57027,8 +57321,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 48878, - "total_submitted": 111015, + "total_acs": 48983, + "total_submitted": 111257, "total_column_articles": 190, "frontend_question_id": "195", "is_new_question": false @@ -57048,8 +57342,8 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 14290, - "total_submitted": 41422, + "total_acs": 14309, + "total_submitted": 41587, "total_column_articles": 100, "frontend_question_id": "194", "is_new_question": false @@ -57069,9 +57363,9 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 36328, - "total_submitted": 108610, - "total_column_articles": 183, + "total_acs": 36403, + "total_submitted": 108819, + "total_column_articles": 184, "frontend_question_id": "193", "is_new_question": false }, @@ -57090,8 +57384,8 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 29080, - "total_submitted": 81079, + "total_acs": 29133, + "total_submitted": 81294, "total_column_articles": 219, "frontend_question_id": "192", "is_new_question": false @@ -57111,9 +57405,9 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 306236, - "total_submitted": 401244, - "total_column_articles": 1915, + "total_acs": 307435, + "total_submitted": 402720, + "total_column_articles": 1923, "frontend_question_id": "191", "is_new_question": false }, @@ -57132,9 +57426,9 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 197993, - "total_submitted": 276544, - "total_column_articles": 1221, + "total_acs": 198709, + "total_submitted": 277444, + "total_column_articles": 1227, "frontend_question_id": "190", "is_new_question": false }, @@ -57153,9 +57447,9 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 598251, - "total_submitted": 1351592, - "total_column_articles": 3000, + "total_acs": 600372, + "total_submitted": 1356290, + "total_column_articles": 3014, "frontend_question_id": "189", "is_new_question": false }, @@ -57174,9 +57468,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": 165019, - "total_submitted": 378253, - "total_column_articles": 1210, + "total_acs": 165723, + "total_submitted": 379362, + "total_column_articles": 1212, "frontend_question_id": "188", "is_new_question": false }, @@ -57195,9 +57489,9 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 125779, - "total_submitted": 236683, - "total_column_articles": 929, + "total_acs": 126341, + "total_submitted": 237697, + "total_column_articles": 936, "frontend_question_id": "187", "is_new_question": false }, @@ -57216,9 +57510,9 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 11952, - "total_submitted": 15780, - "total_column_articles": 169, + "total_acs": 11997, + "total_submitted": 15830, + "total_column_articles": 170, "frontend_question_id": "186", "is_new_question": false }, @@ -57237,9 +57531,9 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 109217, - "total_submitted": 207525, - "total_column_articles": 917, + "total_acs": 109506, + "total_submitted": 208011, + "total_column_articles": 922, "frontend_question_id": "185", "is_new_question": false }, @@ -57258,9 +57552,9 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 156395, - "total_submitted": 307957, - "total_column_articles": 1027, + "total_acs": 156852, + "total_submitted": 308675, + "total_column_articles": 1030, "frontend_question_id": "184", "is_new_question": false }, @@ -57279,9 +57573,9 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 292662, - "total_submitted": 439820, - "total_column_articles": 1000, + "total_acs": 294109, + "total_submitted": 441964, + "total_column_articles": 1008, "frontend_question_id": "183", "is_new_question": false }, @@ -57300,9 +57594,9 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 271412, - "total_submitted": 342561, - "total_column_articles": 915, + "total_acs": 272132, + "total_submitted": 343451, + "total_column_articles": 920, "frontend_question_id": "182", "is_new_question": false }, @@ -57321,9 +57615,9 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 249870, - "total_submitted": 361816, - "total_column_articles": 1005, + "total_acs": 250520, + "total_submitted": 362744, + "total_column_articles": 1011, "frontend_question_id": "181", "is_new_question": false }, @@ -57342,9 +57636,9 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 135001, - "total_submitted": 280796, - "total_column_articles": 795, + "total_acs": 135405, + "total_submitted": 281677, + "total_column_articles": 796, "frontend_question_id": "180", "is_new_question": false }, @@ -57363,9 +57657,9 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 185920, - "total_submitted": 451238, - "total_column_articles": 1375, + "total_acs": 186365, + "total_submitted": 452285, + "total_column_articles": 1376, "frontend_question_id": "179", "is_new_question": false }, @@ -57384,9 +57678,9 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 181147, - "total_submitted": 296791, - "total_column_articles": 928, + "total_acs": 181616, + "total_submitted": 297552, + "total_column_articles": 930, "frontend_question_id": "178", "is_new_question": false }, @@ -57405,9 +57699,9 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 189323, - "total_submitted": 404237, - "total_column_articles": 741, + "total_acs": 189784, + "total_submitted": 405222, + "total_column_articles": 744, "frontend_question_id": "177", "is_new_question": false }, @@ -57426,9 +57720,9 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 376038, - "total_submitted": 1036617, - "total_column_articles": 1530, + "total_acs": 376996, + "total_submitted": 1039161, + "total_column_articles": 1533, "frontend_question_id": "176", "is_new_question": false }, @@ -57447,9 +57741,9 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 451329, - "total_submitted": 608599, - "total_column_articles": 1994, + "total_acs": 452486, + "total_submitted": 610067, + "total_column_articles": 1997, "frontend_question_id": "175", "is_new_question": false }, @@ -57468,9 +57762,9 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 58504, - "total_submitted": 119828, - "total_column_articles": 1301, + "total_acs": 58746, + "total_submitted": 120295, + "total_column_articles": 1325, "frontend_question_id": "174", "is_new_question": false }, @@ -57489,9 +57783,9 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 108435, - "total_submitted": 133065, - "total_column_articles": 865, + "total_acs": 108740, + "total_submitted": 133421, + "total_column_articles": 869, "frontend_question_id": "173", "is_new_question": false }, @@ -57510,9 +57804,9 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 162096, - "total_submitted": 326217, - "total_column_articles": 1070, + "total_acs": 162383, + "total_submitted": 326720, + "total_column_articles": 1071, "frontend_question_id": "172", "is_new_question": false }, @@ -57531,9 +57825,9 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 153419, - "total_submitted": 214706, - "total_column_articles": 1255, + "total_acs": 153869, + "total_submitted": 215316, + "total_column_articles": 1257, "frontend_question_id": "171", "is_new_question": false }, @@ -57552,8 +57846,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 15348, - "total_submitted": 35972, + "total_acs": 15387, + "total_submitted": 36049, "total_column_articles": 149, "frontend_question_id": "170", "is_new_question": false @@ -57573,9 +57867,9 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 634251, - "total_submitted": 948403, - "total_column_articles": 3407, + "total_acs": 636557, + "total_submitted": 951785, + "total_column_articles": 3427, "frontend_question_id": "169", "is_new_question": false }, @@ -57594,9 +57888,9 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 126905, - "total_submitted": 289149, - "total_column_articles": 1075, + "total_acs": 127284, + "total_submitted": 289902, + "total_column_articles": 1081, "frontend_question_id": "168", "is_new_question": false }, @@ -57615,9 +57909,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": 520153, - "total_submitted": 878560, - "total_column_articles": 3380, + "total_acs": 522149, + "total_submitted": 881906, + "total_column_articles": 3398, "frontend_question_id": "167", "is_new_question": false }, @@ -57636,9 +57930,9 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 59939, - "total_submitted": 178959, - "total_column_articles": 505, + "total_acs": 60099, + "total_submitted": 179416, + "total_column_articles": 506, "frontend_question_id": "166", "is_new_question": false }, @@ -57657,9 +57951,9 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 139197, - "total_submitted": 268084, - "total_column_articles": 1254, + "total_acs": 139567, + "total_submitted": 268766, + "total_column_articles": 1256, "frontend_question_id": "165", "is_new_question": false }, @@ -57678,8 +57972,8 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 78713, - "total_submitted": 130266, + "total_acs": 78819, + "total_submitted": 130439, "total_column_articles": 632, "frontend_question_id": "164", "is_new_question": false @@ -57699,8 +57993,8 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 17304, - "total_submitted": 48648, + "total_acs": 17385, + "total_submitted": 48815, "total_column_articles": 239, "frontend_question_id": "163", "is_new_question": false @@ -57720,9 +58014,9 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 278504, - "total_submitted": 563138, - "total_column_articles": 1807, + "total_acs": 279532, + "total_submitted": 565299, + "total_column_articles": 1810, "frontend_question_id": "162", "is_new_question": false }, @@ -57741,8 +58035,8 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 12354, - "total_submitted": 36148, + "total_acs": 12383, + "total_submitted": 36215, "total_column_articles": 161, "frontend_question_id": "161", "is_new_question": false @@ -57762,9 +58056,9 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 600677, - "total_submitted": 947443, - "total_column_articles": 3438, + "total_acs": 603028, + "total_submitted": 950799, + "total_column_articles": 3453, "frontend_question_id": "160", "is_new_question": false }, @@ -57783,9 +58077,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": 28297, - "total_submitted": 50620, - "total_column_articles": 318, + "total_acs": 28456, + "total_submitted": 50836, + "total_column_articles": 322, "frontend_question_id": "159", "is_new_question": false }, @@ -57804,9 +58098,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": 4698, - "total_submitted": 7791, - "total_column_articles": 98, + "total_acs": 4725, + "total_submitted": 7825, + "total_column_articles": 99, "frontend_question_id": "158", "is_new_question": false }, @@ -57825,8 +58119,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 9459, - "total_submitted": 17371, + "total_acs": 9497, + "total_submitted": 17444, "total_column_articles": 130, "frontend_question_id": "157", "is_new_question": false @@ -57846,9 +58140,9 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 12446, - "total_submitted": 17193, - "total_column_articles": 217, + "total_acs": 12510, + "total_submitted": 17285, + "total_column_articles": 220, "frontend_question_id": "156", "is_new_question": false }, @@ -57867,9 +58161,9 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 449126, - "total_submitted": 763954, - "total_column_articles": 2418, + "total_acs": 450421, + "total_submitted": 766050, + "total_column_articles": 2427, "frontend_question_id": "155", "is_new_question": false }, @@ -57888,9 +58182,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": 162391, - "total_submitted": 308347, - "total_column_articles": 1226, + "total_acs": 162791, + "total_submitted": 309129, + "total_column_articles": 1227, "frontend_question_id": "154", "is_new_question": false }, @@ -57909,9 +58203,9 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 344089, - "total_submitted": 603416, - "total_column_articles": 2295, + "total_acs": 345349, + "total_submitted": 605572, + "total_column_articles": 2302, "frontend_question_id": "153", "is_new_question": false }, @@ -57930,9 +58224,9 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 329926, - "total_submitted": 765953, - "total_column_articles": 1997, + "total_acs": 331105, + "total_submitted": 768559, + "total_column_articles": 2007, "frontend_question_id": "152", "is_new_question": false }, @@ -57951,9 +58245,9 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 337595, - "total_submitted": 657732, - "total_column_articles": 2628, + "total_acs": 339488, + "total_submitted": 661109, + "total_column_articles": 2642, "frontend_question_id": "151", "is_new_question": false }, @@ -57972,9 +58266,9 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 242711, - "total_submitted": 462274, - "total_column_articles": 1761, + "total_acs": 244023, + "total_submitted": 464712, + "total_column_articles": 1772, "frontend_question_id": "150", "is_new_question": false }, @@ -57993,9 +58287,9 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 74392, - "total_submitted": 191975, - "total_column_articles": 744, + "total_acs": 74661, + "total_submitted": 192451, + "total_column_articles": 745, "frontend_question_id": "149", "is_new_question": false }, @@ -58014,9 +58308,9 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 369663, - "total_submitted": 559637, - "total_column_articles": 2047, + "total_acs": 370790, + "total_submitted": 561372, + "total_column_articles": 2056, "frontend_question_id": "148", "is_new_question": false }, @@ -58035,9 +58329,9 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 139974, - "total_submitted": 201759, - "total_column_articles": 1063, + "total_acs": 140366, + "total_submitted": 202237, + "total_column_articles": 1065, "frontend_question_id": "147", "is_new_question": false }, @@ -58056,9 +58350,9 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 439622, - "total_submitted": 822877, - "total_column_articles": 3281, + "total_acs": 440855, + "total_submitted": 825174, + "total_column_articles": 3309, "frontend_question_id": "146", "is_new_question": false }, @@ -58077,9 +58371,9 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 560363, - "total_submitted": 734855, - "total_column_articles": 2487, + "total_acs": 562605, + "total_submitted": 737733, + "total_column_articles": 2501, "frontend_question_id": "145", "is_new_question": false }, @@ -58098,9 +58392,9 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 771660, - "total_submitted": 1082649, - "total_column_articles": 3231, + "total_acs": 774767, + "total_submitted": 1086919, + "total_column_articles": 3253, "frontend_question_id": "144", "is_new_question": false }, @@ -58119,9 +58413,9 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 228245, - "total_submitted": 353242, - "total_column_articles": 1719, + "total_acs": 229100, + "total_submitted": 354538, + "total_column_articles": 1724, "frontend_question_id": "143", "is_new_question": false }, @@ -58140,9 +58434,9 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 592990, - "total_submitted": 1046170, - "total_column_articles": 3387, + "total_acs": 595662, + "total_submitted": 1050551, + "total_column_articles": 3401, "frontend_question_id": "142", "is_new_question": false }, @@ -58161,9 +58455,9 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 907729, - "total_submitted": 1760984, - "total_column_articles": 4615, + "total_acs": 910906, + "total_submitted": 1766934, + "total_column_articles": 4628, "frontend_question_id": "141", "is_new_question": false }, @@ -58182,9 +58476,9 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 82476, - "total_submitted": 147153, - "total_column_articles": 938, + "total_acs": 82743, + "total_submitted": 147492, + "total_column_articles": 944, "frontend_question_id": "140", "is_new_question": false }, @@ -58203,9 +58497,9 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 392972, - "total_submitted": 728625, - "total_column_articles": 2234, + "total_acs": 394620, + "total_submitted": 731517, + "total_column_articles": 2245, "frontend_question_id": "139", "is_new_question": false }, @@ -58224,9 +58518,9 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 182147, - "total_submitted": 273226, - "total_column_articles": 1295, + "total_acs": 182677, + "total_submitted": 274017, + "total_column_articles": 1298, "frontend_question_id": "138", "is_new_question": false }, @@ -58245,9 +58539,9 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 142884, - "total_submitted": 198460, - "total_column_articles": 1032, + "total_acs": 143192, + "total_submitted": 198912, + "total_column_articles": 1036, "frontend_question_id": "137", "is_new_question": false }, @@ -58266,9 +58560,9 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 834893, - "total_submitted": 1155441, - "total_column_articles": 3743, + "total_acs": 837827, + "total_submitted": 1159524, + "total_column_articles": 3759, "frontend_question_id": "136", "is_new_question": false }, @@ -58287,9 +58581,9 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 189151, - "total_submitted": 381397, - "total_column_articles": 1382, + "total_acs": 189979, + "total_submitted": 383078, + "total_column_articles": 1383, "frontend_question_id": "135", "is_new_question": false }, @@ -58308,9 +58602,9 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 223413, - "total_submitted": 426207, - "total_column_articles": 1569, + "total_acs": 224493, + "total_submitted": 428515, + "total_column_articles": 1573, "frontend_question_id": "134", "is_new_question": false }, @@ -58329,9 +58623,9 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 108680, - "total_submitted": 157957, - "total_column_articles": 757, + "total_acs": 109103, + "total_submitted": 158487, + "total_column_articles": 761, "frontend_question_id": "133", "is_new_question": false }, @@ -58350,9 +58644,9 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 71239, - "total_submitted": 142874, - "total_column_articles": 592, + "total_acs": 71473, + "total_submitted": 143310, + "total_column_articles": 594, "frontend_question_id": "132", "is_new_question": false }, @@ -58371,9 +58665,9 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 256716, - "total_submitted": 349932, - "total_column_articles": 1554, + "total_acs": 257942, + "total_submitted": 351533, + "total_column_articles": 1558, "frontend_question_id": "131", "is_new_question": false }, @@ -58392,9 +58686,9 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 211905, - "total_submitted": 458927, - "total_column_articles": 2047, + "total_acs": 212544, + "total_submitted": 460176, + "total_column_articles": 2054, "frontend_question_id": "130", "is_new_question": false }, @@ -58413,9 +58707,9 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 196450, - "total_submitted": 281118, - "total_column_articles": 1678, + "total_acs": 196969, + "total_submitted": 281795, + "total_column_articles": 1679, "frontend_question_id": "129", "is_new_question": false }, @@ -58434,9 +58728,9 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 346166, - "total_submitted": 628140, - "total_column_articles": 2110, + "total_acs": 347514, + "total_submitted": 630568, + "total_column_articles": 2117, "frontend_question_id": "128", "is_new_question": false }, @@ -58455,9 +58749,9 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 174876, - "total_submitted": 363538, - "total_column_articles": 946, + "total_acs": 175329, + "total_submitted": 364388, + "total_column_articles": 949, "frontend_question_id": "127", "is_new_question": false }, @@ -58476,8 +58770,8 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 52078, - "total_submitted": 134291, + "total_acs": 52212, + "total_submitted": 134751, "total_column_articles": 472, "frontend_question_id": "126", "is_new_question": false @@ -58497,9 +58791,9 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 434673, - "total_submitted": 931696, - "total_column_articles": 2748, + "total_acs": 436138, + "total_submitted": 934967, + "total_column_articles": 2761, "frontend_question_id": "125", "is_new_question": false }, @@ -58518,9 +58812,9 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 293857, - "total_submitted": 648176, - "total_column_articles": 1823, + "total_acs": 294808, + "total_submitted": 650321, + "total_column_articles": 1829, "frontend_question_id": "124", "is_new_question": false }, @@ -58539,9 +58833,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": 229573, - "total_submitted": 395959, - "total_column_articles": 1351, + "total_acs": 230434, + "total_submitted": 397214, + "total_column_articles": 1354, "frontend_question_id": "123", "is_new_question": false }, @@ -58560,9 +58854,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": 785247, - "total_submitted": 1099098, - "total_column_articles": 4213, + "total_acs": 787760, + "total_submitted": 1102329, + "total_column_articles": 4226, "frontend_question_id": "122", "is_new_question": false }, @@ -58581,9 +58875,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": 992803, - "total_submitted": 1711810, - "total_column_articles": 5660, + "total_acs": 996517, + "total_submitted": 1718523, + "total_column_articles": 5682, "frontend_question_id": "121", "is_new_question": false }, @@ -58602,9 +58896,9 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 273155, - "total_submitted": 397566, - "total_column_articles": 2286, + "total_acs": 274023, + "total_submitted": 398744, + "total_column_articles": 2287, "frontend_question_id": "120", "is_new_question": false }, @@ -58623,9 +58917,9 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 247149, - "total_submitted": 358531, - "total_column_articles": 1932, + "total_acs": 248179, + "total_submitted": 360004, + "total_column_articles": 1935, "frontend_question_id": "119", "is_new_question": false }, @@ -58644,9 +58938,9 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 375569, - "total_submitted": 497014, - "total_column_articles": 2944, + "total_acs": 377386, + "total_submitted": 499354, + "total_column_articles": 2949, "frontend_question_id": "118", "is_new_question": false }, @@ -58665,9 +58959,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": 168467, - "total_submitted": 259597, - "total_column_articles": 1276, + "total_acs": 169203, + "total_submitted": 260637, + "total_column_articles": 1281, "frontend_question_id": "117", "is_new_question": false }, @@ -58686,9 +58980,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": 318061, - "total_submitted": 439704, - "total_column_articles": 2415, + "total_acs": 319506, + "total_submitted": 441594, + "total_column_articles": 2433, "frontend_question_id": "116", "is_new_question": false }, @@ -58707,9 +59001,9 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 119152, - "total_submitted": 226949, - "total_column_articles": 1144, + "total_acs": 119756, + "total_submitted": 228073, + "total_column_articles": 1146, "frontend_question_id": "115", "is_new_question": false }, @@ -58728,9 +59022,9 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 326139, - "total_submitted": 446710, - "total_column_articles": 2668, + "total_acs": 327273, + "total_submitted": 448175, + "total_column_articles": 2696, "frontend_question_id": "114", "is_new_question": false }, @@ -58749,9 +59043,9 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 317008, - "total_submitted": 501339, - "total_column_articles": 2076, + "total_acs": 318112, + "total_submitted": 503004, + "total_column_articles": 2081, "frontend_question_id": "113", "is_new_question": false }, @@ -58770,9 +59064,9 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 490957, - "total_submitted": 917080, - "total_column_articles": 2847, + "total_acs": 492998, + "total_submitted": 920795, + "total_column_articles": 2863, "frontend_question_id": "112", "is_new_question": false }, @@ -58791,9 +59085,9 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 497736, - "total_submitted": 965881, - "total_column_articles": 3506, + "total_acs": 499774, + "total_submitted": 969300, + "total_column_articles": 3530, "frontend_question_id": "111", "is_new_question": false }, @@ -58812,9 +59106,9 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 453553, - "total_submitted": 789854, - "total_column_articles": 2371, + "total_acs": 455362, + "total_submitted": 792837, + "total_column_articles": 2381, "frontend_question_id": "110", "is_new_question": false }, @@ -58833,9 +59127,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": 137898, - "total_submitted": 180216, - "total_column_articles": 1070, + "total_acs": 138207, + "total_submitted": 180587, + "total_column_articles": 1072, "frontend_question_id": "109", "is_new_question": false }, @@ -58854,9 +59148,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": 323723, - "total_submitted": 418797, - "total_column_articles": 1901, + "total_acs": 325056, + "total_submitted": 420450, + "total_column_articles": 1907, "frontend_question_id": "108", "is_new_question": false }, @@ -58875,9 +59169,9 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 251147, - "total_submitted": 348074, - "total_column_articles": 1862, + "total_acs": 251864, + "total_submitted": 349030, + "total_column_articles": 1866, "frontend_question_id": "107", "is_new_question": false }, @@ -58896,9 +59190,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": 251651, - "total_submitted": 347518, - "total_column_articles": 1551, + "total_acs": 252851, + "total_submitted": 349173, + "total_column_articles": 1559, "frontend_question_id": "106", "is_new_question": false }, @@ -58917,9 +59211,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": 451532, - "total_submitted": 632609, - "total_column_articles": 2431, + "total_acs": 453147, + "total_submitted": 634868, + "total_column_articles": 2443, "frontend_question_id": "105", "is_new_question": false }, @@ -58938,9 +59232,9 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 916401, - "total_submitted": 1188265, - "total_column_articles": 4662, + "total_acs": 920018, + "total_submitted": 1192898, + "total_column_articles": 4709, "frontend_question_id": "104", "is_new_question": false }, @@ -58959,9 +59253,9 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 283041, - "total_submitted": 492588, - "total_column_articles": 2344, + "total_acs": 283834, + "total_submitted": 493816, + "total_column_articles": 2348, "frontend_question_id": "103", "is_new_question": false }, @@ -58980,9 +59274,9 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 731311, - "total_submitted": 1119327, - "total_column_articles": 4168, + "total_acs": 734052, + "total_submitted": 1123243, + "total_column_articles": 4184, "frontend_question_id": "102", "is_new_question": false }, @@ -59001,9 +59295,9 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 748207, - "total_submitted": 1278373, - "total_column_articles": 3914, + "total_acs": 751237, + "total_submitted": 1283502, + "total_column_articles": 3930, "frontend_question_id": "101", "is_new_question": false }, @@ -59022,9 +59316,9 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 418167, - "total_submitted": 698197, - "total_column_articles": 2916, + "total_acs": 419585, + "total_submitted": 700528, + "total_column_articles": 2930, "frontend_question_id": "100", "is_new_question": false }, @@ -59043,9 +59337,9 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 125502, - "total_submitted": 207768, - "total_column_articles": 1006, + "total_acs": 125860, + "total_submitted": 208419, + "total_column_articles": 1009, "frontend_question_id": "99", "is_new_question": false }, @@ -59064,9 +59358,9 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 649771, - "total_submitted": 1769258, - "total_column_articles": 3671, + "total_acs": 652469, + "total_submitted": 1776224, + "total_column_articles": 3707, "frontend_question_id": "98", "is_new_question": false }, @@ -59085,9 +59379,9 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 106051, - "total_submitted": 235912, - "total_column_articles": 827, + "total_acs": 106432, + "total_submitted": 236712, + "total_column_articles": 828, "frontend_question_id": "97", "is_new_question": false }, @@ -59106,9 +59400,9 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 324258, - "total_submitted": 457607, - "total_column_articles": 2280, + "total_acs": 325685, + "total_submitted": 459589, + "total_column_articles": 2283, "frontend_question_id": "96", "is_new_question": false }, @@ -59127,9 +59421,9 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 156419, - "total_submitted": 214127, - "total_column_articles": 988, + "total_acs": 156881, + "total_submitted": 214699, + "total_column_articles": 991, "frontend_question_id": "95", "is_new_question": false }, @@ -59148,9 +59442,9 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1041176, - "total_submitted": 1366695, - "total_column_articles": 3919, + "total_acs": 1045051, + "total_submitted": 1371559, + "total_column_articles": 3940, "frontend_question_id": "94", "is_new_question": false }, @@ -59169,9 +59463,9 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 298195, - "total_submitted": 516845, - "total_column_articles": 2260, + "total_acs": 299524, + "total_submitted": 518831, + "total_column_articles": 2267, "frontend_question_id": "93", "is_new_question": false }, @@ -59190,9 +59484,9 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 365388, - "total_submitted": 656895, - "total_column_articles": 3463, + "total_acs": 366448, + "total_submitted": 658733, + "total_column_articles": 3475, "frontend_question_id": "92", "is_new_question": false }, @@ -59211,9 +59505,9 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 253610, - "total_submitted": 770956, - "total_column_articles": 2194, + "total_acs": 254321, + "total_submitted": 772713, + "total_column_articles": 2200, "frontend_question_id": "91", "is_new_question": false }, @@ -59232,9 +59526,9 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 265865, - "total_submitted": 417564, - "total_column_articles": 2056, + "total_acs": 267083, + "total_submitted": 419502, + "total_column_articles": 2065, "frontend_question_id": "90", "is_new_question": false }, @@ -59253,9 +59547,9 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 108738, - "total_submitted": 144993, - "total_column_articles": 865, + "total_acs": 109001, + "total_submitted": 145349, + "total_column_articles": 868, "frontend_question_id": "89", "is_new_question": false }, @@ -59274,9 +59568,9 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 816872, - "total_submitted": 1556809, - "total_column_articles": 5449, + "total_acs": 820077, + "total_submitted": 1562589, + "total_column_articles": 5475, "frontend_question_id": "88", "is_new_question": false }, @@ -59295,9 +59589,9 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 54492, - "total_submitted": 114584, - "total_column_articles": 423, + "total_acs": 54641, + "total_submitted": 114846, + "total_column_articles": 424, "frontend_question_id": "87", "is_new_question": false }, @@ -59316,9 +59610,9 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 194141, - "total_submitted": 303144, - "total_column_articles": 1899, + "total_acs": 194829, + "total_submitted": 304150, + "total_column_articles": 1907, "frontend_question_id": "86", "is_new_question": false }, @@ -59337,9 +59631,9 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 161728, - "total_submitted": 297729, - "total_column_articles": 1122, + "total_acs": 162216, + "total_submitted": 298610, + "total_column_articles": 1123, "frontend_question_id": "85", "is_new_question": false }, @@ -59358,9 +59652,9 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 312830, - "total_submitted": 697707, - "total_column_articles": 1832, + "total_acs": 313881, + "total_submitted": 699880, + "total_column_articles": 1833, "frontend_question_id": "84", "is_new_question": false }, @@ -59379,9 +59673,9 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 526980, - "total_submitted": 989249, - "total_column_articles": 3298, + "total_acs": 528929, + "total_submitted": 992958, + "total_column_articles": 3312, "frontend_question_id": "83", "is_new_question": false }, @@ -59400,9 +59694,9 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 312928, - "total_submitted": 583508, - "total_column_articles": 2600, + "total_acs": 314003, + "total_submitted": 585471, + "total_column_articles": 2612, "frontend_question_id": "82", "is_new_question": false }, @@ -59421,9 +59715,9 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 185120, - "total_submitted": 450087, - "total_column_articles": 1396, + "total_acs": 185617, + "total_submitted": 451335, + "total_column_articles": 1402, "frontend_question_id": "81", "is_new_question": false }, @@ -59442,9 +59736,9 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 215080, - "total_submitted": 347847, - "total_column_articles": 1805, + "total_acs": 215683, + "total_submitted": 348779, + "total_column_articles": 1814, "frontend_question_id": "80", "is_new_question": false }, @@ -59463,9 +59757,9 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 393806, - "total_submitted": 846828, - "total_column_articles": 2399, + "total_acs": 395159, + "total_submitted": 849848, + "total_column_articles": 2404, "frontend_question_id": "79", "is_new_question": false }, @@ -59484,9 +59778,9 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 564647, - "total_submitted": 697301, - "total_column_articles": 3943, + "total_acs": 566884, + "total_submitted": 699982, + "total_column_articles": 3955, "frontend_question_id": "78", "is_new_question": false }, @@ -59505,9 +59799,9 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 470040, - "total_submitted": 608239, - "total_column_articles": 2611, + "total_acs": 472499, + "total_submitted": 611272, + "total_column_articles": 2629, "frontend_question_id": "77", "is_new_question": false }, @@ -59526,9 +59820,9 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 379929, - "total_submitted": 843235, - "total_column_articles": 3077, + "total_acs": 381449, + "total_submitted": 846311, + "total_column_articles": 3091, "frontend_question_id": "76", "is_new_question": false }, @@ -59547,9 +59841,9 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 488144, - "total_submitted": 809567, - "total_column_articles": 3329, + "total_acs": 490147, + "total_submitted": 812806, + "total_column_articles": 3346, "frontend_question_id": "75", "is_new_question": false }, @@ -59568,9 +59862,9 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 287892, - "total_submitted": 594141, - "total_column_articles": 2772, + "total_acs": 288972, + "total_submitted": 596051, + "total_column_articles": 2779, "frontend_question_id": "74", "is_new_question": false }, @@ -59589,9 +59883,9 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 228353, - "total_submitted": 364298, - "total_column_articles": 1686, + "total_acs": 229408, + "total_submitted": 365935, + "total_column_articles": 1695, "frontend_question_id": "73", "is_new_question": false }, @@ -59610,9 +59904,9 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 330134, - "total_submitted": 525896, - "total_column_articles": 2822, + "total_acs": 331404, + "total_submitted": 527822, + "total_column_articles": 2847, "frontend_question_id": "72", "is_new_question": false }, @@ -59631,9 +59925,9 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 171156, - "total_submitted": 386555, - "total_column_articles": 1578, + "total_acs": 171711, + "total_submitted": 387794, + "total_column_articles": 1582, "frontend_question_id": "71", "is_new_question": false }, @@ -59652,9 +59946,9 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 1038295, - "total_submitted": 1921796, - "total_column_articles": 5761, + "total_acs": 1042301, + "total_submitted": 1928990, + "total_column_articles": 5783, "frontend_question_id": "70", "is_new_question": false }, @@ -59673,9 +59967,9 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 674781, - "total_submitted": 1744029, - "total_column_articles": 3368, + "total_acs": 677426, + "total_submitted": 1750812, + "total_column_articles": 3386, "frontend_question_id": "69", "is_new_question": false }, @@ -59694,8 +59988,8 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 50975, - "total_submitted": 97665, + "total_acs": 51097, + "total_submitted": 97882, "total_column_articles": 764, "frontend_question_id": "68", "is_new_question": false @@ -59715,9 +60009,9 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 297758, - "total_submitted": 557632, - "total_column_articles": 2674, + "total_acs": 298963, + "total_submitted": 560023, + "total_column_articles": 2694, "frontend_question_id": "67", "is_new_question": false }, @@ -59736,9 +60030,9 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 585415, - "total_submitted": 1288236, - "total_column_articles": 5223, + "total_acs": 587288, + "total_submitted": 1292487, + "total_column_articles": 5247, "frontend_question_id": "66", "is_new_question": false }, @@ -59757,9 +60051,9 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 61783, - "total_submitted": 224063, - "total_column_articles": 883, + "total_acs": 61927, + "total_submitted": 224646, + "total_column_articles": 884, "frontend_question_id": "65", "is_new_question": false }, @@ -59778,9 +60072,9 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 444961, - "total_submitted": 640787, - "total_column_articles": 3179, + "total_acs": 446280, + "total_submitted": 642565, + "total_column_articles": 3186, "frontend_question_id": "64", "is_new_question": false }, @@ -59799,9 +60093,9 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 329970, - "total_submitted": 806232, - "total_column_articles": 2719, + "total_acs": 331604, + "total_submitted": 809610, + "total_column_articles": 2730, "frontend_question_id": "63", "is_new_question": false }, @@ -59820,9 +60114,9 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 556081, - "total_submitted": 821945, - "total_column_articles": 3852, + "total_acs": 558251, + "total_submitted": 825153, + "total_column_articles": 3866, "frontend_question_id": "62", "is_new_question": false }, @@ -59841,9 +60135,9 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 294829, - "total_submitted": 708620, - "total_column_articles": 2877, + "total_acs": 295620, + "total_submitted": 710552, + "total_column_articles": 2885, "frontend_question_id": "61", "is_new_question": false }, @@ -59862,9 +60156,9 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 121932, - "total_submitted": 228273, - "total_column_articles": 1360, + "total_acs": 122199, + "total_submitted": 228780, + "total_column_articles": 1362, "frontend_question_id": "60", "is_new_question": false }, @@ -59883,9 +60177,9 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 272563, - "total_submitted": 366200, - "total_column_articles": 3061, + "total_acs": 274308, + "total_submitted": 368834, + "total_column_articles": 3087, "frontend_question_id": "59", "is_new_question": false }, @@ -59904,9 +60198,9 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 393249, - "total_submitted": 937527, - "total_column_articles": 4172, + "total_acs": 394926, + "total_submitted": 940787, + "total_column_articles": 4193, "frontend_question_id": "58", "is_new_question": false }, @@ -59925,9 +60219,9 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 134253, - "total_submitted": 320329, - "total_column_articles": 1338, + "total_acs": 134744, + "total_submitted": 321420, + "total_column_articles": 1341, "frontend_question_id": "57", "is_new_question": false }, @@ -59946,9 +60240,9 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 573836, - "total_submitted": 1165156, - "total_column_articles": 3869, + "total_acs": 576103, + "total_submitted": 1169946, + "total_column_articles": 3884, "frontend_question_id": "56", "is_new_question": false }, @@ -59967,9 +60261,9 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 638175, - "total_submitted": 1460456, - "total_column_articles": 4466, + "total_acs": 640718, + "total_submitted": 1466141, + "total_column_articles": 4486, "frontend_question_id": "55", "is_new_question": false }, @@ -59988,9 +60282,9 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 334543, - "total_submitted": 678881, - "total_column_articles": 3532, + "total_acs": 335738, + "total_submitted": 681235, + "total_column_articles": 3547, "frontend_question_id": "54", "is_new_question": false }, @@ -60009,9 +60303,9 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 1275022, - "total_submitted": 2324209, - "total_column_articles": 6312, + "total_acs": 1279448, + "total_submitted": 2332351, + "total_column_articles": 6332, "frontend_question_id": "53", "is_new_question": false }, @@ -60030,9 +60324,9 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 110179, - "total_submitted": 133733, - "total_column_articles": 870, + "total_acs": 110531, + "total_submitted": 134133, + "total_column_articles": 873, "frontend_question_id": "52", "is_new_question": false }, @@ -60051,9 +60345,9 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 273937, - "total_submitted": 369147, - "total_column_articles": 2766, + "total_acs": 275070, + "total_submitted": 370646, + "total_column_articles": 2777, "frontend_question_id": "51", "is_new_question": false }, @@ -60072,9 +60366,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 348316, - "total_submitted": 915733, - "total_column_articles": 1993, + "total_acs": 349422, + "total_submitted": 918589, + "total_column_articles": 1996, "frontend_question_id": "50", "is_new_question": false }, @@ -60093,9 +60387,9 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 415467, - "total_submitted": 612937, - "total_column_articles": 2307, + "total_acs": 417254, + "total_submitted": 615480, + "total_column_articles": 2316, "frontend_question_id": "49", "is_new_question": false }, @@ -60114,9 +60408,9 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 410672, - "total_submitted": 550823, - "total_column_articles": 4095, + "total_acs": 412352, + "total_submitted": 552981, + "total_column_articles": 4111, "frontend_question_id": "48", "is_new_question": false }, @@ -60135,9 +60429,9 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 411037, - "total_submitted": 628740, - "total_column_articles": 2618, + "total_acs": 412679, + "total_submitted": 631098, + "total_column_articles": 2633, "frontend_question_id": "47", "is_new_question": false }, @@ -60156,9 +60450,9 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 783501, - "total_submitted": 993587, - "total_column_articles": 5332, + "total_acs": 786326, + "total_submitted": 997061, + "total_column_articles": 5358, "frontend_question_id": "46", "is_new_question": false }, @@ -60177,9 +60471,9 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 437763, - "total_submitted": 968796, - "total_column_articles": 3008, + "total_acs": 439566, + "total_submitted": 972628, + "total_column_articles": 3020, "frontend_question_id": "45", "is_new_question": false }, @@ -60198,9 +60492,9 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 128472, - "total_submitted": 380861, - "total_column_articles": 849, + "total_acs": 128877, + "total_submitted": 381981, + "total_column_articles": 850, "frontend_question_id": "44", "is_new_question": false }, @@ -60219,9 +60513,9 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 277630, - "total_submitted": 621628, - "total_column_articles": 1886, + "total_acs": 278590, + "total_submitted": 623651, + "total_column_articles": 1903, "frontend_question_id": "43", "is_new_question": false }, @@ -60240,9 +60534,9 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 621905, - "total_submitted": 997819, - "total_column_articles": 3966, + "total_acs": 624047, + "total_submitted": 1001092, + "total_column_articles": 3981, "frontend_question_id": "42", "is_new_question": false }, @@ -60261,9 +60555,9 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 271843, - "total_submitted": 634035, - "total_column_articles": 2072, + "total_acs": 272635, + "total_submitted": 635672, + "total_column_articles": 2080, "frontend_question_id": "41", "is_new_question": false }, @@ -60282,9 +60576,9 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 382858, - "total_submitted": 635637, - "total_column_articles": 2457, + "total_acs": 384587, + "total_submitted": 638570, + "total_column_articles": 2472, "frontend_question_id": "40", "is_new_question": false }, @@ -60303,9 +60597,9 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 658014, - "total_submitted": 905888, - "total_column_articles": 3586, + "total_acs": 660543, + "total_submitted": 909317, + "total_column_articles": 3606, "frontend_question_id": "39", "is_new_question": false }, @@ -60324,9 +60618,9 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 322753, - "total_submitted": 535367, - "total_column_articles": 3143, + "total_acs": 323491, + "total_submitted": 536495, + "total_column_articles": 3150, "frontend_question_id": "38", "is_new_question": false }, @@ -60345,9 +60639,9 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 184760, - "total_submitted": 273148, - "total_column_articles": 1439, + "total_acs": 185586, + "total_submitted": 274371, + "total_column_articles": 1448, "frontend_question_id": "37", "is_new_question": false }, @@ -60366,9 +60660,9 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 343944, - "total_submitted": 543188, - "total_column_articles": 2438, + "total_acs": 345421, + "total_submitted": 545724, + "total_column_articles": 2446, "frontend_question_id": "36", "is_new_question": false }, @@ -60387,9 +60681,9 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 1031905, - "total_submitted": 2288364, - "total_column_articles": 6898, + "total_acs": 1036791, + "total_submitted": 2299213, + "total_column_articles": 6938, "frontend_question_id": "35", "is_new_question": false }, @@ -60408,9 +60702,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": 706910, - "total_submitted": 1667518, - "total_column_articles": 6740, + "total_acs": 710088, + "total_submitted": 1674667, + "total_column_articles": 6771, "frontend_question_id": "34", "is_new_question": false }, @@ -60429,9 +60723,9 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 672118, - "total_submitted": 1532620, - "total_column_articles": 4287, + "total_acs": 674536, + "total_submitted": 1537903, + "total_column_articles": 4299, "frontend_question_id": "33", "is_new_question": false }, @@ -60450,9 +60744,9 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 340233, - "total_submitted": 918149, - "total_column_articles": 2117, + "total_acs": 341288, + "total_submitted": 920968, + "total_column_articles": 2122, "frontend_question_id": "32", "is_new_question": false }, @@ -60471,9 +60765,9 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 392682, - "total_submitted": 1029110, - "total_column_articles": 2982, + "total_acs": 394127, + "total_submitted": 1032484, + "total_column_articles": 2991, "frontend_question_id": "31", "is_new_question": false }, @@ -60492,9 +60786,9 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 150398, - "total_submitted": 380215, - "total_column_articles": 1219, + "total_acs": 150938, + "total_submitted": 381478, + "total_column_articles": 1224, "frontend_question_id": "30", "is_new_question": false }, @@ -60513,9 +60807,9 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 195992, - "total_submitted": 883072, - "total_column_articles": 1498, + "total_acs": 196601, + "total_submitted": 885679, + "total_column_articles": 1504, "frontend_question_id": "29", "is_new_question": false }, @@ -60534,9 +60828,9 @@ "question__title": "Find the Index of the First Occurrence in a String", "question__title_slug": "find-the-index-of-the-first-occurrence-in-a-string", "question__hide": false, - "total_acs": 784071, - "total_submitted": 1868899, - "total_column_articles": 5384, + "total_acs": 786487, + "total_submitted": 1873845, + "total_column_articles": 5403, "frontend_question_id": "28", "is_new_question": false }, @@ -60555,9 +60849,9 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 927239, - "total_submitted": 1561159, - "total_column_articles": 7008, + "total_acs": 931838, + "total_submitted": 1568778, + "total_column_articles": 7036, "frontend_question_id": "27", "is_new_question": false }, @@ -60576,9 +60870,9 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 1363645, - "total_submitted": 2495663, - "total_column_articles": 7672, + "total_acs": 1368416, + "total_submitted": 2503982, + "total_column_articles": 7711, "frontend_question_id": "26", "is_new_question": false }, @@ -60597,9 +60891,9 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 425898, - "total_submitted": 628851, - "total_column_articles": 3611, + "total_acs": 427126, + "total_submitted": 630586, + "total_column_articles": 3619, "frontend_question_id": "25", "is_new_question": false }, @@ -60618,9 +60912,9 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 563929, - "total_submitted": 791066, - "total_column_articles": 4116, + "total_acs": 566516, + "total_submitted": 794563, + "total_column_articles": 4136, "frontend_question_id": "24", "is_new_question": false }, @@ -60639,9 +60933,9 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 589439, - "total_submitted": 1024483, - "total_column_articles": 3908, + "total_acs": 591229, + "total_submitted": 1027400, + "total_column_articles": 3922, "frontend_question_id": "23", "is_new_question": false }, @@ -60660,9 +60954,9 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 637051, - "total_submitted": 821218, - "total_column_articles": 4404, + "total_acs": 639212, + "total_submitted": 823960, + "total_column_articles": 4417, "frontend_question_id": "22", "is_new_question": false }, @@ -60681,9 +60975,9 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 1262952, - "total_submitted": 1897770, - "total_column_articles": 6611, + "total_acs": 1267546, + "total_submitted": 1904990, + "total_column_articles": 6637, "frontend_question_id": "21", "is_new_question": false }, @@ -60702,9 +60996,9 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 1345937, - "total_submitted": 3032065, - "total_column_articles": 8928, + "total_acs": 1350859, + "total_submitted": 3044189, + "total_column_articles": 8965, "frontend_question_id": "20", "is_new_question": false }, @@ -60723,9 +61017,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": 1010083, - "total_submitted": 2241201, - "total_column_articles": 7180, + "total_acs": 1014780, + "total_submitted": 2250318, + "total_column_articles": 7198, "frontend_question_id": "19", "is_new_question": false }, @@ -60744,9 +61038,9 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 406498, - "total_submitted": 1080644, - "total_column_articles": 2593, + "total_acs": 408502, + "total_submitted": 1086462, + "total_column_articles": 2609, "frontend_question_id": "18", "is_new_question": false }, @@ -60765,9 +61059,9 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 621424, - "total_submitted": 1071279, - "total_column_articles": 5079, + "total_acs": 624094, + "total_submitted": 1075831, + "total_column_articles": 5101, "frontend_question_id": "17", "is_new_question": false }, @@ -60786,9 +61080,9 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 433104, - "total_submitted": 957364, - "total_column_articles": 2264, + "total_acs": 434320, + "total_submitted": 960364, + "total_column_articles": 2273, "frontend_question_id": "16", "is_new_question": false }, @@ -60807,9 +61101,9 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 1231471, - "total_submitted": 3364954, - "total_column_articles": 5398, + "total_acs": 1237493, + "total_submitted": 3378465, + "total_column_articles": 5419, "frontend_question_id": "15", "is_new_question": false }, @@ -60828,9 +61122,9 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 1008285, - "total_submitted": 2336689, - "total_column_articles": 6213, + "total_acs": 1011485, + "total_submitted": 2343674, + "total_column_articles": 6241, "frontend_question_id": "14", "is_new_question": false }, @@ -60849,9 +61143,9 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 760738, - "total_submitted": 1221028, - "total_column_articles": 6096, + "total_acs": 763220, + "total_submitted": 1224925, + "total_column_articles": 6114, "frontend_question_id": "13", "is_new_question": false }, @@ -60870,9 +61164,9 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 355193, - "total_submitted": 536333, - "total_column_articles": 2763, + "total_acs": 356359, + "total_submitted": 538028, + "total_column_articles": 2772, "frontend_question_id": "12", "is_new_question": false }, @@ -60891,9 +61185,9 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 898135, - "total_submitted": 1480190, - "total_column_articles": 5038, + "total_acs": 901364, + "total_submitted": 1485694, + "total_column_articles": 5058, "frontend_question_id": "11", "is_new_question": false }, @@ -60912,9 +61206,9 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 339107, - "total_submitted": 1094031, - "total_column_articles": 1994, + "total_acs": 340127, + "total_submitted": 1098054, + "total_column_articles": 1999, "frontend_question_id": "10", "is_new_question": false }, @@ -60933,9 +61227,9 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 1254148, - "total_submitted": 2220717, - "total_column_articles": 7697, + "total_acs": 1258329, + "total_submitted": 2228472, + "total_column_articles": 7725, "frontend_question_id": "9", "is_new_question": false }, @@ -60954,9 +61248,9 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 535198, - "total_submitted": 2500393, - "total_column_articles": 3998, + "total_acs": 536946, + "total_submitted": 2508606, + "total_column_articles": 4011, "frontend_question_id": "8", "is_new_question": false }, @@ -60975,9 +61269,9 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 1137250, - "total_submitted": 3211668, - "total_column_articles": 6922, + "total_acs": 1139540, + "total_submitted": 3218018, + "total_column_articles": 6937, "frontend_question_id": "7", "is_new_question": false }, @@ -60996,9 +61290,9 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 521553, - "total_submitted": 1001261, - "total_column_articles": 4284, + "total_acs": 523210, + "total_submitted": 1004455, + "total_column_articles": 4296, "frontend_question_id": "6", "is_new_question": false }, @@ -61017,9 +61311,9 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1294866, - "total_submitted": 3466949, - "total_column_articles": 6984, + "total_acs": 1299346, + "total_submitted": 3478318, + "total_column_articles": 7006, "frontend_question_id": "5", "is_new_question": false }, @@ -61038,9 +61332,9 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 871082, - "total_submitted": 2092391, - "total_column_articles": 6391, + "total_acs": 873888, + "total_submitted": 2099178, + "total_column_articles": 6410, "frontend_question_id": "4", "is_new_question": false }, @@ -61059,9 +61353,9 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 2138434, - "total_submitted": 5470912, - "total_column_articles": 12580, + "total_acs": 2145316, + "total_submitted": 5488238, + "total_column_articles": 12633, "frontend_question_id": "3", "is_new_question": false }, @@ -61080,9 +61374,9 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 1609555, - "total_submitted": 3804068, - "total_column_articles": 11253, + "total_acs": 1614789, + "total_submitted": 3816041, + "total_column_articles": 11290, "frontend_question_id": "2", "is_new_question": false }, @@ -61101,9 +61395,9 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 4106508, - "total_submitted": 7769212, - "total_column_articles": 20410, + "total_acs": 4121497, + "total_submitted": 7797264, + "total_column_articles": 20474, "frontend_question_id": "1", "is_new_question": false }, diff --git a/leetcode-cn/originData/[no content]count-the-number-of-good-subsequences.json b/leetcode-cn/originData/[no content]count-the-number-of-good-subsequences.json new file mode 100644 index 00000000..75c5ae32 --- /dev/null +++ b/leetcode-cn/originData/[no content]count-the-number-of-good-subsequences.json @@ -0,0 +1,50 @@ +{ + "data": { + "question": { + "questionId": "2683", + "questionFrontendId": "2539", + "categoryTitle": "Algorithms", + "boundTopicId": 2068823, + "title": "Count the Number of Good Subsequences", + "titleSlug": "count-the-number-of-good-subsequences", + "content": null, + "translatedTitle": "好子序列的个数", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 2, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"33\", \"totalSubmission\": \"48\", \"totalAcceptedRaw\": 33, \"totalSubmissionRaw\": 48, \"acRate\": \"68.8%\"}", + "hints": [ + "Use the frequency array of characters of the string.", + "For 1 ≤ m ≤ s.length, count the number of subsequences of s where each character occurs exactly m times.", + "For any n and k, you can calculate (n choose k) mod p in O(log p) using binary exponentiation." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"aabb\"", + "metaData": "{\n \"name\": \"countGoodSubsequences\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

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

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

\\u7248\\u672c\\uff1aOpenJDK 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/p>\\r\\n\\r\\n

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

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

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

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

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

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

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

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

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

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

\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"

C# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/code><\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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": "\"aabb\"\n\"leet\"\n\"abcd\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]time-taken-to-cross-the-door.json b/leetcode-cn/originData/[no content]time-taken-to-cross-the-door.json new file mode 100644 index 00000000..fd10712c --- /dev/null +++ b/leetcode-cn/originData/[no content]time-taken-to-cross-the-door.json @@ -0,0 +1,68 @@ +{ + "data": { + "question": { + "questionId": "2617", + "questionFrontendId": "2534", + "categoryTitle": "Algorithms", + "boundTopicId": 2047519, + "title": "Time Taken to Cross the Door", + "titleSlug": "time-taken-to-cross-the-door", + "content": null, + "translatedTitle": "通过门的时间", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Queue", + "slug": "queue", + "translatedName": "队列", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": "模拟", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"38\", \"totalSubmission\": \"63\", \"totalAcceptedRaw\": 38, \"totalSubmissionRaw\": 63, \"acRate\": \"60.3%\"}", + "hints": [ + "Use a queue to store the people who want to enter or exit and their corresponding times.", + "Simulate the process described in the statement and apply the 4 rules to the people crossing the door." + ], + "solution": null, + "status": null, + "sampleTestCase": "[0,1,1,2,4]\n[0,1,0,0,1]", + "metaData": "{\n \"name\": \"timeTaken\",\n \"params\": [\n {\n \"name\": \"arrival\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"state\"\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@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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": "[0,1,1,2,4]\n[0,1,0,0,1]\n[0,0,0]\n[1,0,1]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/alternating-digit-sum.json b/leetcode-cn/originData/alternating-digit-sum.json new file mode 100644 index 00000000..bd18c850 --- /dev/null +++ b/leetcode-cn/originData/alternating-digit-sum.json @@ -0,0 +1,165 @@ +{ + "data": { + "question": { + "questionId": "2630", + "questionFrontendId": "2544", + "categoryTitle": "Algorithms", + "boundTopicId": 2068891, + "title": "Alternating Digit Sum", + "titleSlug": "alternating-digit-sum", + "content": "

You are given a positive integer n. Each digit of n has a sign according to the following rules:

\n\n
    \n\t
  • The most significant digit is assigned a positive sign.
  • \n\t
  • Each other digit has an opposite sign to its adjacent digits.
  • \n
\n\n

Return the sum of all digits with their corresponding sign.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 521\nOutput: 4\nExplanation: (+5) + (-2) + (+1) = 4.\n
\n\n

Example 2:

\n\n
\nInput: n = 111\nOutput: 1\nExplanation: (+1) + (-1) + (+1) = 1.\n
\n\n

Example 3:

\n\n
\nInput: n = 886996\nOutput: 0\nExplanation: (+8) + (-8) + (+6) + (-9) + (+9) + (-6) = 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 109
  • \n
\n\n

 

\n\n", + "translatedTitle": "交替数字和", + "translatedContent": "

给你一个正整数 nn 中的每一位数字都会按下述规则分配一个符号:

\n\n
    \n\t
  • 最高有效位 上的数字分配到 号。
  • \n\t
  • 剩余每位上数字的符号都与其相邻数字相反。
  • \n
\n\n

返回所有数字及其对应符号的和。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:n = 521\n输出:4\n解释:(+5) + (-2) + (+1) = 4
\n\n

示例 2:

\n\n
\n输入:n = 111\n输出:1\n解释:(+1) + (-1) + (+1) = 1\n
\n\n

示例 3:

\n\n
\n输入:n = 886996\n输出:0\n解释:(+8) + (-8) + (+6) + (-9) + (+9) + (-6) = 0\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 109
  • \n
\n\n

 

\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 1, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int alternateDigitSum(int n) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int alternateDigitSum(int n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def alternateDigitSum(self, n):\n \"\"\"\n :type n: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def alternateDigitSum(self, n: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int alternateDigitSum(int n){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int AlternateDigitSum(int n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @return {number}\n */\nvar alternateDigitSum = function(n) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @return {Integer}\ndef alternate_digit_sum(n)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func alternateDigitSum(_ n: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func alternateDigitSum(n int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def alternateDigitSum(n: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun alternateDigitSum(n: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn alternate_digit_sum(n: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @return Integer\n */\n function alternateDigitSum($n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function alternateDigitSum(n: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (alternate-digit-sum n)\n (-> exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec alternate_digit_sum(N :: integer()) -> integer().\nalternate_digit_sum(N) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec alternate_digit_sum(n :: integer) :: integer\n def alternate_digit_sum(n) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int alternateDigitSum(int n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 2880, \"totalSubmissionRaw\": 3555, \"acRate\": \"81.0%\"}", + "hints": [ + "The first step is to loop over the digits. We can convert the integer into a string, an array of digits, or just loop over its digits.", + "Keep a variable sign that initially equals 1 and a variable answer that initially equals 0.", + "Each time you loop over a digit i, add sign * i to answer, then multiply sign by -1." + ], + "solution": null, + "status": null, + "sampleTestCase": "521", + "metaData": "{\n \"name\": \"alternateDigitSum\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

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

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

\\u7248\\u672c\\uff1aOpenJDK 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/p>\\r\\n\\r\\n

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

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

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

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

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

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

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

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

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

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

\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"

C# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/code><\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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": "521\n111\n886996", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/apply-bitwise-operations-to-make-strings-equal.json b/leetcode-cn/originData/apply-bitwise-operations-to-make-strings-equal.json new file mode 100644 index 00000000..7c180e0c --- /dev/null +++ b/leetcode-cn/originData/apply-bitwise-operations-to-make-strings-equal.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2632", + "questionFrontendId": "2546", + "categoryTitle": "Algorithms", + "boundTopicId": 2068893, + "title": "Apply Bitwise Operations to Make Strings Equal", + "titleSlug": "apply-bitwise-operations-to-make-strings-equal", + "content": "

You are given two 0-indexed binary strings s and target of the same length n. You can do the following operation on s any number of times:

\n\n
    \n\t
  • Choose two different indices i and j where 0 <= i, j < n.
  • \n\t
  • Simultaneously, replace s[i] with (s[i] OR s[j]) and s[j] with (s[i] XOR s[j]).
  • \n
\n\n

For example, if s = "0110", you can choose i = 0 and j = 2, then simultaneously replace s[0] with (s[0] OR s[2] = 0 OR 1 = 1), and s[2] with (s[0] XOR s[2] = 0 XOR 1 = 1), so we will have s = "1110".

\n\n

Return true if you can make the string s equal to target, or false otherwise.

\n\n

 

\n

Example 1:

\n\n
\nInput: s = "1010", target = "0110"\nOutput: true\nExplanation: We can do the following operations:\n- Choose i = 2 and j = 0. We have now s = "0010".\n- Choose i = 2 and j = 1. We have now s = "0110".\nSince we can make s equal to target, we return true.\n
\n\n

Example 2:

\n\n
\nInput: s = "11", target = "00"\nOutput: false\nExplanation: It is not possible to make s equal to target with any number of operations.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == s.length == target.length
  • \n\t
  • 2 <= n <= 105
  • \n\t
  • s and target consist of only the digits 0 and 1.
  • \n
\n", + "translatedTitle": "执行逐位运算使字符串相等", + "translatedContent": "

给你两个下标从 0 开始的 二元 字符串 starget ,两个字符串的长度均为 n 。你可以对 s 执行下述操作 任意 次:

\n\n
    \n\t
  • 选择两个 不同 的下标 ij ,其中 0 <= i, j < n
  • \n\t
  • 同时,将 s[i] 替换为 (s[i] OR s[j]) ,s[j] 替换为 (s[i] XOR s[j]) 。
  • \n
\n\n

例如,如果 s = \"0110\" ,你可以选择 i = 0j = 2,然后同时将 s[0] 替换为 (s[0] OR s[2] = 0 OR 1 = 1),并将 s[2] 替换为 (s[0] XOR s[2] = 0 XOR 1 = 1),最终得到 s = \"1110\"

\n\n

如果可以使 s 等于 target ,返回 true ,否则,返回 false

\n\n

 

\n\n

示例 1:

\n\n
输入:s = \"1010\", target = \"0110\"\n输出:true\n解释:可以执行下述操作:\n- 选择 i = 2 和 j = 0 ,得到 s = \"0010\".\n- 选择 i = 2 和 j = 1 ,得到 s = \"0110\".\n可以使 s 等于 target ,返回 true 。\n
\n\n

示例 2:

\n\n
输入:s = \"11\", target = \"00\"\n输出:false\n解释:执行任意次操作都无法使 s 等于 target 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == s.length == target.length
  • \n\t
  • 2 <= n <= 105
  • \n\t
  • starget 仅由数字 01 组成
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "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 bool makeStringsEqual(string s, string target) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean makeStringsEqual(String s, String target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def makeStringsEqual(self, s, target):\n \"\"\"\n :type s: str\n :type target: str\n :rtype: bool\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def makeStringsEqual(self, s: str, target: str) -> bool:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool makeStringsEqual(char * s, char * target){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool MakeStringsEqual(string s, string target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} s\n * @param {string} target\n * @return {boolean}\n */\nvar makeStringsEqual = function(s, target) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} s\n# @param {String} target\n# @return {Boolean}\ndef make_strings_equal(s, target)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func makeStringsEqual(_ s: String, _ target: String) -> Bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func makeStringsEqual(s string, target string) bool {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def makeStringsEqual(s: String, target: String): Boolean = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun makeStringsEqual(s: String, target: String): Boolean {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn make_strings_equal(s: String, target: String) -> bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $s\n * @param String $target\n * @return Boolean\n */\n function makeStringsEqual($s, $target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function makeStringsEqual(s: string, target: string): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (make-strings-equal s target)\n (-> string? string? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec make_strings_equal(S :: unicode:unicode_binary(), Target :: unicode:unicode_binary()) -> boolean().\nmake_strings_equal(S, Target) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec make_strings_equal(s :: String.t, target :: String.t) :: boolean\n def make_strings_equal(s, target) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool makeStringsEqual(String s, String target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 2349, \"totalSubmissionRaw\": 6268, \"acRate\": \"37.5%\"}", + "hints": [ + "Think of when it is impossible to convert the string to the target.", + "If exactly one of the strings is having all 0’s, then it is impossible. And it is possible in all other cases. Why is that true?" + ], + "solution": null, + "status": null, + "sampleTestCase": "\"1010\"\n\"0110\"", + "metaData": "{\n \"name\": \"makeStringsEqual\",\n \"params\": [\n {\n \"name\": \"s\",\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@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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": "\"1010\"\n\"0110\"\n\"11\"\n\"00\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/check-if-point-is-reachable.json b/leetcode-cn/originData/check-if-point-is-reachable.json new file mode 100644 index 00000000..8c040304 --- /dev/null +++ b/leetcode-cn/originData/check-if-point-is-reachable.json @@ -0,0 +1,166 @@ +{ + "data": { + "question": { + "questionId": "2635", + "questionFrontendId": "2543", + "categoryTitle": "Algorithms", + "boundTopicId": 2070103, + "title": "Check if Point Is Reachable", + "titleSlug": "check-if-point-is-reachable", + "content": "

There exists an infinitely large grid. You are currently at point (1, 1), and you need to reach the point (targetX, targetY) using a finite number of steps.

\n\n

In one step, you can move from point (x, y) to any one of the following points:

\n\n
    \n\t
  • (x, y - x)
  • \n\t
  • (x - y, y)
  • \n\t
  • (2 * x, y)
  • \n\t
  • (x, 2 * y)
  • \n
\n\n

Given two integers targetX and targetY representing the X-coordinate and Y-coordinate of your final position, return true if you can reach the point from (1, 1) using some number of steps, and false otherwise.

\n\n

 

\n

Example 1:

\n\n
\nInput: targetX = 6, targetY = 9\nOutput: false\nExplanation: It is impossible to reach (6,9) from (1,1) using any sequence of moves, so false is returned.\n
\n\n

Example 2:

\n\n
\nInput: targetX = 4, targetY = 7\nOutput: true\nExplanation: You can follow the path (1,1) -> (1,2) -> (1,4) -> (1,8) -> (1,7) -> (2,7) -> (4,7).\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= targetX, targetY <= 109
  • \n
\n", + "translatedTitle": "判断一个点是否可以到达", + "translatedContent": "

给你一个无穷大的网格图。一开始你在 (1, 1) ,你需要通过有限步移动到达点 (targetX, targetY) 。

\n\n

每一步 ,你可以从点 (x, y) 移动到以下点之一:

\n\n
    \n\t
  • (x, y - x)
  • \n\t
  • (x - y, y)
  • \n\t
  • (2 * x, y)
  • \n\t
  • (x, 2 * y)
  • \n
\n\n

给你两个整数 targetX 和 targetY ,分别表示你最后需要到达点的 X 和 Y 坐标。如果你可以从 (1, 1) 出发到达这个点,请你返回true ,否则返回 false 

\n\n

 

\n\n

示例 1:

\n\n
输入:targetX = 6, targetY = 9\n输出:false\n解释:没法从 (1,1) 出发到达 (6,9) ,所以返回 false 。\n
\n\n

示例 2:

\n\n
输入:targetX = 4, targetY = 7\n输出:true\n解释:你可以按照以下路径到达:(1,1) -> (1,2) -> (1,4) -> (1,8) -> (1,7) -> (2,7) -> (4,7) 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= targetX, targetY <= 109
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 7, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"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 isReachable(int targetX, int targetY) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean isReachable(int targetX, int targetY) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def isReachable(self, targetX, targetY):\n \"\"\"\n :type targetX: int\n :type targetY: int\n :rtype: bool\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def isReachable(self, targetX: int, targetY: int) -> bool:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool isReachable(int targetX, int targetY){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool IsReachable(int targetX, int targetY) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} targetX\n * @param {number} targetY\n * @return {boolean}\n */\nvar isReachable = function(targetX, targetY) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} target_x\n# @param {Integer} target_y\n# @return {Boolean}\ndef is_reachable(target_x, target_y)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func isReachable(_ targetX: Int, _ targetY: Int) -> Bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func isReachable(targetX int, targetY int) bool {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def isReachable(targetX: Int, targetY: Int): Boolean = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun isReachable(targetX: Int, targetY: Int): Boolean {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn is_reachable(target_x: i32, target_y: i32) -> bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $targetX\n * @param Integer $targetY\n * @return Boolean\n */\n function isReachable($targetX, $targetY) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function isReachable(targetX: number, targetY: number): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (is-reachable targetX targetY)\n (-> exact-integer? exact-integer? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec is_reachable(TargetX :: integer(), TargetY :: integer()) -> boolean().\nis_reachable(TargetX, TargetY) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec is_reachable(target_x :: integer, target_y :: integer) :: boolean\n def is_reachable(target_x, target_y) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool isReachable(int targetX, int targetY) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"947\", \"totalSubmission\": \"2.5K\", \"totalAcceptedRaw\": 947, \"totalSubmissionRaw\": 2451, \"acRate\": \"38.6%\"}", + "hints": [ + "Let’s go in reverse order, from (targetX, targetY) to (1, 1). So, now we can move from (x, y) to (x+y, y), (x, y+x), (x/2, y) if x is even, and (x, y/2) if y is even.", + "When is it optimal to use the third and fourth operations?", + "Think how GCD of (x, y) is affected if we apply the first two operations.", + "How can we check if we can reach (1, 1) using the GCD value calculate above?" + ], + "solution": null, + "status": null, + "sampleTestCase": "6\n9", + "metaData": "{\n \"name\": \"isReachable\",\n \"params\": [\n {\n \"name\": \"targetX\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"targetY\"\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@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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\n9\n4\n7", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/count-the-number-of-good-subarrays.json b/leetcode-cn/originData/count-the-number-of-good-subarrays.json new file mode 100644 index 00000000..aabb088f --- /dev/null +++ b/leetcode-cn/originData/count-the-number-of-good-subarrays.json @@ -0,0 +1,185 @@ +{ + "data": { + "question": { + "questionId": "2626", + "questionFrontendId": "2537", + "categoryTitle": "Algorithms", + "boundTopicId": 2060310, + "title": "Count the Number of Good Subarrays", + "titleSlug": "count-the-number-of-good-subarrays", + "content": "

Given an integer array nums and an integer k, return the number of good subarrays of nums.

\n\n

A subarray arr is good if it there are at least k pairs of indices (i, j) such that i < j and arr[i] == arr[j].

\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,1,1,1,1], k = 10\nOutput: 1\nExplanation: The only good subarray is the array nums itself.\n
\n\n

Example 2:

\n\n
\nInput: nums = [3,1,4,3,2,2,4], k = 2\nOutput: 4\nExplanation: There are 4 different good subarrays:\n- [3,1,4,3,2,2] that has 2 pairs.\n- [3,1,4,3,2,2,4] that has 3 pairs.\n- [1,4,3,2,2,4] that has 2 pairs.\n- [4,3,2,2,4] that has 2 pairs.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i], k <= 109
  • \n
\n", + "translatedTitle": "统计好子数组的数目", + "translatedContent": "

给你一个整数数组 nums 和一个整数 k ,请你返回 nums 中  子数组的数目。

\n\n

一个子数组 arr 如果有 至少 k 对下标 (i, j) 满足 i < j 且 arr[i] == arr[j] ,那么称它是一个  子数组。

\n\n

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

\n\n

 

\n\n

示例 1:

\n\n
输入:nums = [1,1,1,1,1], k = 10\n输出:1\n解释:唯一的好子数组是这个数组本身。\n
\n\n

示例 2:

\n\n
输入:nums = [3,1,4,3,2,2,4], k = 2\n输出:4\n解释:总共有 4 个不同的好子数组:\n- [3,1,4,3,2,2] 有 2 对。\n- [3,1,4,3,2,2,4] 有 3 对。\n- [1,4,3,2,2,4] 有 2 对。\n- [4,3,2,2,4] 有 2 对。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i], k <= 109
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 23, + "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": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + }, + { + "name": "Sliding Window", + "slug": "sliding-window", + "translatedName": "滑动窗口", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long countGood(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long countGood(int[] nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countGood(self, nums, k):\n \"\"\"\n :type nums: List[int]\n :type k: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countGood(self, nums: List[int], k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long countGood(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long CountGood(int[] nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar countGood = function(nums, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef count_good(nums, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countGood(_ nums: [Int], _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countGood(nums []int, k int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countGood(nums: Array[Int], k: Int): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countGood(nums: IntArray, k: Int): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_good(nums: Vec, k: i32) -> i64 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $k\n * @return Integer\n */\n function countGood($nums, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countGood(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-good nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_good(Nums :: [integer()], K :: integer()) -> integer().\ncount_good(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_good(nums :: [integer], k :: integer) :: integer\n def count_good(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int countGood(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 4180, \"totalSubmissionRaw\": 8881, \"acRate\": \"47.1%\"}", + "hints": [ + "For a fixed index l, try to find the minimum value of index r, such that the subarray is not good", + "When a number is added to a subarray, it increases the number of pairs by its previous appearances.", + "When a number is removed from the subarray, it decreases the number of pairs by its remaining appearances.", + "Maintain 2-pointers l and r such that we can keep in account the number of equal pairs." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,1,1,1,1]\n10", + "metaData": "{\n \"name\": \"countGood\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 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@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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,1,1,1]\n10\n[3,1,4,3,2,2,4]\n2", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/difference-between-element-sum-and-digit-sum-of-an-array.json b/leetcode-cn/originData/difference-between-element-sum-and-digit-sum-of-an-array.json new file mode 100644 index 00000000..3a72d65d --- /dev/null +++ b/leetcode-cn/originData/difference-between-element-sum-and-digit-sum-of-an-array.json @@ -0,0 +1,177 @@ +{ + "data": { + "question": { + "questionId": "2624", + "questionFrontendId": "2535", + "categoryTitle": "Algorithms", + "boundTopicId": 2057617, + "title": "Difference Between Element Sum and Digit Sum of an Array", + "titleSlug": "difference-between-element-sum-and-digit-sum-of-an-array", + "content": "

You are given a positive integer array nums.

\n\n
    \n\t
  • The element sum is the sum of all the elements in nums.
  • \n\t
  • The digit sum is the sum of all the digits (not necessarily distinct) that appear in nums.
  • \n
\n\n

Return the absolute difference between the element sum and digit sum of nums.

\n\n

Note that the absolute difference between two integers x and y is defined as |x - y|.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,15,6,3]\nOutput: 9\nExplanation: \nThe element sum of nums is 1 + 15 + 6 + 3 = 25.\nThe digit sum of nums is 1 + 1 + 5 + 6 + 3 = 16.\nThe absolute difference between the element sum and digit sum is |25 - 16| = 9.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,3,4]\nOutput: 0\nExplanation:\nThe element sum of nums is 1 + 2 + 3 + 4 = 10.\nThe digit sum of nums is 1 + 2 + 3 + 4 = 10.\nThe absolute difference between the element sum and digit sum is |10 - 10| = 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 2000
  • \n\t
  • 1 <= nums[i] <= 2000
  • \n
\n", + "translatedTitle": "数组元素和与数字和的绝对差", + "translatedContent": "

给你一个正整数数组 nums

\n\n
    \n\t
  • 元素和nums 中的所有元素相加求和。
  • \n\t
  • 数字和 是 nums 中每一个元素的每一数位(重复数位需多次求和)相加求和。
  • \n
\n\n

返回 元素和数字和 的绝对差。

\n\n

注意:两个整数 xy 的绝对差定义为 |x - y|

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [1,15,6,3]\n输出:9\n解释:\nnums 的元素和是 1 + 15 + 6 + 3 = 25 。\nnums 的数字和是 1 + 1 + 5 + 6 + 3 = 16 。\n元素和与数字和的绝对差是 |25 - 16| = 9 。\n
\n\n

示例 2:

\n\n
\n输入:nums = [1,2,3,4]\n输出:0\n解释:\nnums 的元素和是 1 + 2 + 3 + 4 = 10 。\nnums 的数字和是 1 + 2 + 3 + 4 = 10 。\n元素和与数字和的绝对差是 |10 - 10| = 0 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 2000
  • \n\t
  • 1 <= nums[i] <= 2000
  • \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": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": "数学", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int differenceOfSum(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int differenceOfSum(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def differenceOfSum(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def differenceOfSum(self, nums: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int differenceOfSum(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int DifferenceOfSum(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar differenceOfSum = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef difference_of_sum(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func differenceOfSum(_ nums: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func differenceOfSum(nums []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def differenceOfSum(nums: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun differenceOfSum(nums: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn difference_of_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 differenceOfSum($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function differenceOfSum(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (difference-of-sum nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec difference_of_sum(Nums :: [integer()]) -> integer().\ndifference_of_sum(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec difference_of_sum(nums :: [integer]) :: integer\n def difference_of_sum(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int differenceOfSum(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"7.3K\", \"totalAcceptedRaw\": 6522, \"totalSubmissionRaw\": 7262, \"acRate\": \"89.8%\"}", + "hints": [ + "Use a simple for loop to iterate each number.", + "How you can get the digit for each number?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,15,6,3]", + "metaData": "{\n \"name\": \"differenceOfSum\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

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

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

\\u7248\\u672c\\uff1aOpenJDK 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/p>\\r\\n\\r\\n

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

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

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

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

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

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

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

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

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

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

\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"

C# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/code><\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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,15,6,3]\n[1,2,3,4]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/difference-between-maximum-and-minimum-price-sum.json b/leetcode-cn/originData/difference-between-maximum-and-minimum-price-sum.json new file mode 100644 index 00000000..699b8ce1 --- /dev/null +++ b/leetcode-cn/originData/difference-between-maximum-and-minimum-price-sum.json @@ -0,0 +1,186 @@ +{ + "data": { + "question": { + "questionId": "2627", + "questionFrontendId": "2538", + "categoryTitle": "Algorithms", + "boundTopicId": 2060313, + "title": "Difference Between Maximum and Minimum Price Sum", + "titleSlug": "difference-between-maximum-and-minimum-price-sum", + "content": "

There exists an undirected and initially unrooted tree with n nodes indexed from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

\n\n

Each node has an associated price. You are given an integer array price, where price[i] is the price of the ith node.

\n\n

The price sum of a given path is the sum of the prices of all nodes lying on that path.

\n\n

The tree can be rooted at any node root of your choice. The incurred cost after choosing root is the difference between the maximum and minimum price sum amongst all paths starting at root.

\n\n

Return the maximum possible cost amongst all possible root choices.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: n = 6, edges = [[0,1],[1,2],[1,3],[3,4],[3,5]], price = [9,8,7,6,10,5]\nOutput: 24\nExplanation: The diagram above denotes the tree after rooting it at node 2. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.\n- The first path contains nodes [2,1,3,4]: the prices are [7,8,6,10], and the sum of the prices is 31.\n- The second path contains the node [2] with the price [7].\nThe difference between the maximum and minimum price sum is 24. It can be proved that 24 is the maximum cost.\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 3, edges = [[0,1],[1,2]], price = [1,1,1]\nOutput: 2\nExplanation: The diagram above denotes the tree after rooting it at node 0. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.\n- The first path contains nodes [0,1,2]: the prices are [1,1,1], and the sum of the prices is 3.\n- The second path contains node [0] with a price [1].\nThe difference between the maximum and minimum price sum is 2. It can be proved that 2 is the maximum cost.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • edges.length == n - 1
  • \n\t
  • 0 <= ai, bi <= n - 1
  • \n\t
  • edges represents a valid tree.
  • \n\t
  • price.length == n
  • \n\t
  • 1 <= price[i] <= 105
  • \n
\n", + "translatedTitle": "最大价值和与最小价值和的差值", + "translatedContent": "

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

\n\n

每个节点都有一个价值。给你一个整数数组 price ,其中 price[i] 是第 i 个节点的价值。

\n\n

一条路径的 价值和 是这条路径上所有节点的价值之和。

\n\n

你可以选择树中任意一个节点作为根节点 root 。选择 root 为根的 开销 是以 root 为起点的所有路径中,价值和 最大的一条路径与最小的一条路径的差值。

\n\n

请你返回所有节点作为根节点的选择中,最大 的 开销 为多少。

\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
\n输入:n = 6, edges = [[0,1],[1,2],[1,3],[3,4],[3,5]], price = [9,8,7,6,10,5]\n输出:24\n解释:上图展示了以节点 2 为根的树。左图(红色的节点)是最大价值和路径,右图(蓝色的节点)是最小价值和路径。\n- 第一条路径节点为 [2,1,3,4]:价值为 [7,8,6,10] ,价值和为 31 。\n- 第二条路径节点为 [2] ,价值为 [7] 。\n最大路径和与最小路径和的差值为 24 。24 是所有方案中的最大开销。\n
\n\n

示例 2:

\n\n

\"\"

\n\n
\n输入:n = 3, edges = [[0,1],[1,2]], price = [1,1,1]\n输出:2\n解释:上图展示了以节点 0 为根的树。左图(红色的节点)是最大价值和路径,右图(蓝色的节点)是最小价值和路径。\n- 第一条路径包含节点 [0,1,2]:价值为 [1,1,1] ,价值和为 3 。\n- 第二条路径节点为 [0] ,价值为 [1] 。\n最大路径和与最小路径和的差值为 2 。2 是所有方案中的最大开销。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • edges.length == n - 1
  • \n\t
  • 0 <= ai, bi <= n - 1
  • \n\t
  • edges 表示一棵符合题面要求的树。
  • \n\t
  • price.length == n
  • \n\t
  • 1 <= price[i] <= 105
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 27, + "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": [ + { + "name": "Tree", + "slug": "tree", + "translatedName": "树", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long maxOutput(int n, vector>& edges, vector& price) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long maxOutput(int n, int[][] edges, int[] price) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maxOutput(self, n, edges, price):\n \"\"\"\n :type n: int\n :type edges: List[List[int]]\n :type price: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maxOutput(self, n: int, edges: List[List[int]], price: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long maxOutput(int n, int** edges, int edgesSize, int* edgesColSize, int* price, int priceSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MaxOutput(int n, int[][] edges, int[] price) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} edges\n * @param {number[]} price\n * @return {number}\n */\nvar maxOutput = function(n, edges, price) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} edges\n# @param {Integer[]} price\n# @return {Integer}\ndef max_output(n, edges, price)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maxOutput(_ n: Int, _ edges: [[Int]], _ price: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maxOutput(n int, edges [][]int, price []int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maxOutput(n: Int, edges: Array[Array[Int]], price: Array[Int]): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maxOutput(n: Int, edges: Array, price: IntArray): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn max_output(n: i32, edges: Vec>, price: Vec) -> i64 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $edges\n * @param Integer[] $price\n * @return Integer\n */\n function maxOutput($n, $edges, $price) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maxOutput(n: number, edges: number[][], price: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (max-output n edges price)\n (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec max_output(N :: integer(), Edges :: [[integer()]], Price :: [integer()]) -> integer().\nmax_output(N, Edges, Price) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec max_output(n :: integer, edges :: [[integer]], price :: [integer]) :: integer\n def max_output(n, edges, price) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maxOutput(int n, List> edges, List price) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"4.9K\", \"totalAcceptedRaw\": 2259, \"totalSubmissionRaw\": 4862, \"acRate\": \"46.5%\"}", + "hints": [ + "The minimum price sum is always the price of a rooted node.", + "Let’s root the tree at vertex 0 and find the answer from this perspective.", + "In the optimal answer maximum price is the sum of the prices of nodes on the path from “u” to “v” where either “u” or “v” is the parent of the second one or neither is a parent of the second one.", + "The first case is easy to find. For the second case, notice that in the optimal path, “u” and “v” are both leaves. Then we can use dynamic programming to find such a path.", + "Let DP(v,1) denote “the maximum price sum from node v to leaf, where v is a parent of that leaf” and let DP(v,0) denote “the maximum price sum from node v to leaf, where v is a parent of that leaf - price[leaf]”. Then the answer is maximum of DP(u,0) + DP(v,1) + price[parent] where u, v are directly connected to vertex “parent”." + ], + "solution": null, + "status": null, + "sampleTestCase": "6\n[[0,1],[1,2],[1,3],[3,4],[3,5]]\n[9,8,7,6,10,5]", + "metaData": "{\n \"name\": \"maxOutput\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"edges\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"price\"\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@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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\n[[0,1],[1,2],[1,3],[3,4],[3,5]]\n[9,8,7,6,10,5]\n3\n[[0,1],[1,2]]\n[1,1,1]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/increment-submatrices-by-one.json b/leetcode-cn/originData/increment-submatrices-by-one.json new file mode 100644 index 00000000..b29670a5 --- /dev/null +++ b/leetcode-cn/originData/increment-submatrices-by-one.json @@ -0,0 +1,184 @@ +{ + "data": { + "question": { + "questionId": "2625", + "questionFrontendId": "2536", + "categoryTitle": "Algorithms", + "boundTopicId": 2057619, + "title": "Increment Submatrices by One", + "titleSlug": "increment-submatrices-by-one", + "content": "

You are given a positive integer n, indicating that we initially have an n x n 0-indexed integer matrix mat filled with zeroes.

\n\n

You are also given a 2D integer array query. For each query[i] = [row1i, col1i, row2i, col2i], you should do the following operation:

\n\n
    \n\t
  • Add 1 to every element in the submatrix with the top left corner (row1i, col1i) and the bottom right corner (row2i, col2i). That is, add 1 to mat[x][y] for for all row1i <= x <= row2i and col1i <= y <= col2i.
  • \n
\n\n

Return the matrix mat after performing every query.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: n = 3, queries = [[1,1,2,2],[0,0,1,1]]\nOutput: [[1,1,0],[1,2,1],[0,1,1]]\nExplanation: The diagram above shows the initial matrix, the matrix after the first query, and the matrix after the second query.\n- In the first query, we add 1 to every element in the submatrix with the top left corner (1, 1) and bottom right corner (2, 2).\n- In the second query, we add 1 to every element in the submatrix with the top left corner (0, 0) and bottom right corner (1, 1).\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 2, queries = [[0,0,1,1]]\nOutput: [[1,1],[1,1]]\nExplanation: The diagram above shows the initial matrix and the matrix after the first query.\n- In the first query we add 1 to every element in the matrix.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 500
  • \n\t
  • 1 <= queries.length <= 104
  • \n\t
  • 0 <= row1i <= row2i < n
  • \n\t
  • 0 <= col1i <= col2i < n
  • \n
\n", + "translatedTitle": "子矩阵元素加 1", + "translatedContent": "

给你一个正整数 n ,表示最初有一个 n x n 、下标从 0 开始的整数矩阵 mat ,矩阵中填满了 0 。

\n\n

另给你一个二维整数数组 query 。针对每个查询 query[i] = [row1i, col1i, row2i, col2i] ,请你执行下述操作:

\n\n
    \n\t
  • 找出 左上角(row1i, col1i)右下角(row2i, col2i) 的子矩阵,将子矩阵中的 每个元素1 。也就是给所有满足 row1i <= x <= row2icol1i <= y <= col2imat[x][y]1
  • \n
\n\n

返回执行完所有操作后得到的矩阵 mat

\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
\n输入:n = 3, queries = [[1,1,2,2],[0,0,1,1]]\n输出:[[1,1,0],[1,2,1],[0,1,1]]\n解释:上图所展示的分别是:初始矩阵、执行完第一个操作后的矩阵、执行完第二个操作后的矩阵。\n- 第一个操作:将左上角为 (1, 1) 且右下角为 (2, 2) 的子矩阵中的每个元素加 1 。 \n- 第二个操作:将左上角为 (0, 0) 且右下角为 (1, 1) 的子矩阵中的每个元素加 1 。 \n
\n\n

示例 2:

\n\n

\"\"

\n\n
\n输入:n = 2, queries = [[0,0,1,1]]\n输出:[[1,1],[1,1]]\n解释:上图所展示的分别是:初始矩阵、执行完第一个操作后的矩阵。 \n- 第一个操作:将矩阵中的每个元素加 1 。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 500
  • \n\t
  • 1 <= queries.length <= 104
  • \n\t
  • 0 <= row1i <= row2i < n
  • \n\t
  • 0 <= col1i <= col2i < n
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 21, + "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": "Matrix", + "slug": "matrix", + "translatedName": "矩阵", + "__typename": "TopicTagNode" + }, + { + "name": "Prefix Sum", + "slug": "prefix-sum", + "translatedName": "前缀和", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector> rangeAddQueries(int n, vector>& queries) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[][] rangeAddQueries(int n, int[][] queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def rangeAddQueries(self, n, queries):\n \"\"\"\n :type n: int\n :type queries: List[List[int]]\n :rtype: List[List[int]]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def rangeAddQueries(self, n: int, queries: List[List[int]]) -> List[List[int]]:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\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** rangeAddQueries(int n, int** queries, int queriesSize, int* queriesColSize, int* returnSize, int** returnColumnSizes){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[][] RangeAddQueries(int n, int[][] queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} queries\n * @return {number[][]}\n */\nvar rangeAddQueries = function(n, queries) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} queries\n# @return {Integer[][]}\ndef range_add_queries(n, queries)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func rangeAddQueries(_ n: Int, _ queries: [[Int]]) -> [[Int]] {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func rangeAddQueries(n int, queries [][]int) [][]int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def rangeAddQueries(n: Int, queries: Array[Array[Int]]): Array[Array[Int]] = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun rangeAddQueries(n: Int, queries: Array): Array {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn range_add_queries(n: i32, queries: Vec>) -> Vec> {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $queries\n * @return Integer[][]\n */\n function rangeAddQueries($n, $queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function rangeAddQueries(n: number, queries: number[][]): number[][] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (range-add-queries n queries)\n (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec range_add_queries(N :: integer(), Queries :: [[integer()]]) -> [[integer()]].\nrange_add_queries(N, Queries) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec range_add_queries(n :: integer, queries :: [[integer]]) :: [[integer]]\n def range_add_queries(n, queries) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List> rangeAddQueries(int n, List> queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"9.5K\", \"totalAcceptedRaw\": 5552, \"totalSubmissionRaw\": 9456, \"acRate\": \"58.7%\"}", + "hints": [ + "Imagine each row as a separate array. Instead of updating the whole submatrix together, we can use prefix sum to update each row separately.", + "For each query, iterate over the rows i in the range [row1, row2] and add 1 to prefix sum S[i][col1], and subtract 1 from S[i][col2 + 1].", + "After doing this operation for all the queries, update each row separately with S[i][j] = S[i][j] + S[i][j - 1]." + ], + "solution": null, + "status": null, + "sampleTestCase": "3\n[[1,1,2,2],[0,0,1,1]]", + "metaData": "{\n \"name\": \"rangeAddQueries\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"queries\"\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@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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\n[[1,1,2,2],[0,0,1,1]]\n2\n[[0,0,1,1]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/maximum-subsequence-score.json b/leetcode-cn/originData/maximum-subsequence-score.json new file mode 100644 index 00000000..4b750412 --- /dev/null +++ b/leetcode-cn/originData/maximum-subsequence-score.json @@ -0,0 +1,165 @@ +{ + "data": { + "question": { + "questionId": "2636", + "questionFrontendId": "2542", + "categoryTitle": "Algorithms", + "boundTopicId": 2070101, + "title": "Maximum Subsequence Score", + "titleSlug": "maximum-subsequence-score", + "content": "

You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k.

\n\n

For chosen indices i0, i1, ..., ik - 1, your score is defined as:

\n\n
    \n\t
  • The sum of the selected elements from nums1 multiplied with the minimum of the selected elements from nums2.
  • \n\t
  • It can defined simply as: (nums1[i0] + nums1[i1] +...+ nums1[ik - 1]) * min(nums2[i0] , nums2[i1], ... ,nums2[ik - 1]).
  • \n
\n\n

Return the maximum possible score.

\n\n

A subsequence of indices of an array is a set that can be derived from the set {0, 1, ..., n-1} by deleting some or no elements.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [1,3,3,2], nums2 = [2,1,3,4], k = 3\nOutput: 12\nExplanation: \nThe four possible subsequence scores are:\n- We choose the indices 0, 1, and 2 with score = (1+3+3) * min(2,1,3) = 7.\n- We choose the indices 0, 1, and 3 with score = (1+3+2) * min(2,1,4) = 6. \n- We choose the indices 0, 2, and 3 with score = (1+3+2) * min(2,3,4) = 12. \n- We choose the indices 1, 2, and 3 with score = (3+3+2) * min(1,3,4) = 8.\nTherefore, we return the max score, which is 12.\n
\n\n

Example 2:

\n\n
\nInput: nums1 = [4,2,3,1,1], nums2 = [7,5,10,9,6], k = 1\nOutput: 30\nExplanation: \nChoosing index 2 is optimal: nums1[2] * nums2[2] = 3 * 10 = 30 is the maximum possible score.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 0 <= nums1[i], nums2[j] <= 105
  • \n\t
  • 1 <= k <= n
  • \n
\n", + "translatedTitle": "最大子序列的分数", + "translatedContent": "

给你两个下标从 0 开始的整数数组 nums1 和 nums2 ,两者长度都是 n ,再给你一个正整数 k 。你必须从 nums1 中选一个长度为 k 的 子序列 对应的下标。

\n\n

对于选择的下标 i0 ,i1 ,..., ik - 1 ,你的 分数 定义如下:

\n\n
    \n\t
  • nums1 中下标对应元素求和,乘以 nums2 中下标对应元素的 最小值 。
  • \n\t
  • 用公示表示: (nums1[i0] + nums1[i1] +...+ nums1[ik - 1]) * min(nums2[i0] , nums2[i1], ... ,nums2[ik - 1]) 。
  • \n
\n\n

请你返回 最大 可能的分数。

\n\n

一个数组的 子序列 下标是集合 {0, 1, ..., n-1} 中删除若干元素得到的剩余集合,也可以不删除任何元素。

\n\n

 

\n\n

示例 1:

\n\n
输入:nums1 = [1,3,3,2], nums2 = [2,1,3,4], k = 3\n输出:12\n解释:\n四个可能的子序列分数为:\n- 选择下标 0 ,1 和 2 ,得到分数 (1+3+3) * min(2,1,3) = 7 。\n- 选择下标 0 ,1 和 3 ,得到分数 (1+3+2) * min(2,1,4) = 6 。\n- 选择下标 0 ,2 和 3 ,得到分数 (1+3+2) * min(2,3,4) = 12 。\n- 选择下标 1 ,2 和 3 ,得到分数 (3+3+2) * min(1,3,4) = 8 。\n所以最大分数为 12 。\n
\n\n

示例 2:

\n\n
输入:nums1 = [4,2,3,1,1], nums2 = [7,5,10,9,6], k = 1\n输出:30\n解释:\n选择下标 2 最优:nums1[2] * nums2[2] = 3 * 10 = 30 是最大可能分数。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 0 <= nums1[i], nums2[j] <= 105
  • \n\t
  • 1 <= k <= n
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 11, + "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 maxScore(vector& nums1, vector& nums2, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long maxScore(int[] nums1, int[] nums2, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maxScore(self, nums1, nums2, k):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :type k: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maxScore(self, nums1: List[int], nums2: List[int], k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long maxScore(int* nums1, int nums1Size, int* nums2, int nums2Size, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MaxScore(int[] nums1, int[] nums2, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @param {number} k\n * @return {number}\n */\nvar maxScore = function(nums1, nums2, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @param {Integer} k\n# @return {Integer}\ndef max_score(nums1, nums2, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maxScore(_ nums1: [Int], _ nums2: [Int], _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maxScore(nums1 []int, nums2 []int, k int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maxScore(nums1: Array[Int], nums2: Array[Int], k: Int): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maxScore(nums1: IntArray, nums2: IntArray, k: Int): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn max_score(nums1: Vec, nums2: Vec, k: 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 $k\n * @return Integer\n */\n function maxScore($nums1, $nums2, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maxScore(nums1: number[], nums2: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (max-score nums1 nums2 k)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec max_score(Nums1 :: [integer()], Nums2 :: [integer()], K :: integer()) -> integer().\nmax_score(Nums1, Nums2, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec max_score(nums1 :: [integer], nums2 :: [integer], k :: integer) :: integer\n def max_score(nums1, nums2, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maxScore(List nums1, List nums2, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"2.6K\", \"totalAcceptedRaw\": 1159, \"totalSubmissionRaw\": 2623, \"acRate\": \"44.2%\"}", + "hints": [ + "How can we use sorting here?", + "Try sorting the two arrays based on second array.", + "Loop through nums2 and compute the max product given the minimum is nums2[i]. Update the answer accordingly." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,3,2]\n[2,1,3,4]\n3", + "metaData": "{\n \"name\": \"maxScore\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 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@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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,3,2]\n[2,1,3,4]\n3\n[4,2,3,1,1]\n[7,5,10,9,6]\n1", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-common-value.json b/leetcode-cn/originData/minimum-common-value.json new file mode 100644 index 00000000..712bdc47 --- /dev/null +++ b/leetcode-cn/originData/minimum-common-value.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2634", + "questionFrontendId": "2540", + "categoryTitle": "Algorithms", + "boundTopicId": 2070099, + "title": "Minimum Common Value", + "titleSlug": "minimum-common-value", + "content": "

Given two integer arrays nums1 and nums2, sorted in non-decreasing order, return the minimum integer common to both arrays. If there is no common integer amongst nums1 and nums2, return -1.

\n\n

Note that an integer is said to be common to nums1 and nums2 if both arrays have at least one occurrence of that integer.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [1,2,3], nums2 = [2,4]\nOutput: 2\nExplanation: The smallest element common to both arrays is 2, so we return 2.\n
\n\n

Example 2:

\n\n
\nInput: nums1 = [1,2,3,6], nums2 = [2,3,4,5]\nOutput: 2\nExplanation: There are two common elements in the array 2 and 3 out of which 2 is the smallest, so 2 is returned.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums1.length, nums2.length <= 105
  • \n\t
  • 1 <= nums1[i], nums2[j] <= 109
  • \n\t
  • Both nums1 and nums2 are sorted in non-decreasing order.
  • \n
\n", + "translatedTitle": "最小公共值", + "translatedContent": "

给你两个整数数组 nums1 和 nums2 ,它们已经按非降序排序,请你返回两个数组的 最小公共整数 。如果两个数组 nums1 和 nums2 没有公共整数,请你返回 -1 。

\n\n

如果一个整数在两个数组中都 至少出现一次 ,那么这个整数是数组 nums1 和 nums2 公共 的。

\n\n

 

\n\n

示例 1:

\n\n
输入:nums1 = [1,2,3], nums2 = [2,4]\n输出:2\n解释:两个数组的最小公共元素是 2 ,所以我们返回 2 。\n
\n\n

示例 2:

\n\n
输入:nums1 = [1,2,3,6], nums2 = [2,3,4,5]\n输出:2\n解释:两个数组中的公共元素是 2 和 3 ,2 是较小值,所以返回 2 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums1.length, nums2.length <= 105
  • \n\t
  • 1 <= nums1[i], nums2[j] <= 109
  • \n\t
  • nums1 和 nums2 都是 非降序 的。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 1, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int getCommon(vector& nums1, vector& nums2) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int getCommon(int[] nums1, int[] nums2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def getCommon(self, nums1, nums2):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def getCommon(self, nums1: List[int], nums2: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int getCommon(int* nums1, int nums1Size, int* nums2, int nums2Size){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int GetCommon(int[] nums1, int[] nums2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @return {number}\n */\nvar getCommon = function(nums1, nums2) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @return {Integer}\ndef get_common(nums1, nums2)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func getCommon(_ nums1: [Int], _ nums2: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func getCommon(nums1 []int, nums2 []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def getCommon(nums1: Array[Int], nums2: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun getCommon(nums1: IntArray, nums2: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn get_common(nums1: Vec, nums2: Vec) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums1\n * @param Integer[] $nums2\n * @return Integer\n */\n function getCommon($nums1, $nums2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function getCommon(nums1: number[], nums2: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (get-common nums1 nums2)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec get_common(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer().\nget_common(Nums1, Nums2) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec get_common(nums1 :: [integer], nums2 :: [integer]) :: integer\n def get_common(nums1, nums2) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int getCommon(List nums1, List nums2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 2154, \"totalSubmissionRaw\": 3236, \"acRate\": \"66.6%\"}", + "hints": [ + "Try to use a set.", + "Otherwise, try to use a two-pointer approach." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,3]\n[2,4]", + "metaData": "{\n \"name\": \"getCommon\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

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

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

\\u7248\\u672c\\uff1aOpenJDK 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/p>\\r\\n\\r\\n

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

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

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

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

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

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

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

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

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

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

\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"

C# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/code><\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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]\n[2,4]\n[1,2,3,6]\n[2,3,4,5]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-cost-to-split-an-array.json b/leetcode-cn/originData/minimum-cost-to-split-an-array.json new file mode 100644 index 00000000..680c78cc --- /dev/null +++ b/leetcode-cn/originData/minimum-cost-to-split-an-array.json @@ -0,0 +1,166 @@ +{ + "data": { + "question": { + "questionId": "2633", + "questionFrontendId": "2547", + "categoryTitle": "Algorithms", + "boundTopicId": 2068894, + "title": "Minimum Cost to Split an Array", + "titleSlug": "minimum-cost-to-split-an-array", + "content": "

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

\n\n

Split the array into some number of non-empty subarrays. The cost of a split is the sum of the importance value of each subarray in the split.

\n\n

Let trimmed(subarray) be the version of the subarray where all numbers which appear only once are removed.

\n\n
    \n\t
  • For example, trimmed([3,1,2,4,3,4]) = [3,4,3,4].
  • \n
\n\n

The importance value of a subarray is k + trimmed(subarray).length.

\n\n
    \n\t
  • For example, if a subarray is [1,2,3,3,3,4,4], then trimmed([1,2,3,3,3,4,4]) = [3,3,3,4,4].The importance value of this subarray will be k + 5.
  • \n
\n\n

Return the minimum possible cost of a split of nums.

\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,2,1,2,1,3,3], k = 2\nOutput: 8\nExplanation: We split nums to have two subarrays: [1,2], [1,2,1,3,3].\nThe importance value of [1,2] is 2 + (0) = 2.\nThe importance value of [1,2,1,3,3] is 2 + (2 + 2) = 6.\nThe cost of the split is 2 + 6 = 8. It can be shown that this is the minimum possible cost among all the possible splits.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,1,2,1], k = 2\nOutput: 6\nExplanation: We split nums to have two subarrays: [1,2], [1,2,1].\nThe importance value of [1,2] is 2 + (0) = 2.\nThe importance value of [1,2,1] is 2 + (2) = 4.\nThe cost of the split is 2 + 4 = 6. It can be shown that this is the minimum possible cost among all the possible splits.\n
\n\n

Example 3:

\n\n
\nInput: nums = [1,2,1,2,1], k = 5\nOutput: 10\nExplanation: We split nums to have one subarray: [1,2,1,2,1].\nThe importance value of [1,2,1,2,1] is 5 + (3 + 2) = 10.\nThe cost of the split is 10. It can be shown that this is the minimum possible cost among all the possible splits.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 1000
  • \n\t
  • 0 <= nums[i] < nums.length
  • \n\t
  • 1 <= k <= 109
  • \n
\n\n

 

\n\n", + "translatedTitle": "拆分数组的最小代价", + "translatedContent": "

给你一个整数数组 nums 和一个整数 k

\n\n

将数组拆分成一些非空子数组。拆分的 代价 是每个子数组中的 重要性 之和。

\n\n

trimmed(subarray) 作为子数组的一个特征,其中所有仅出现一次的数字将会被移除。

\n\n
    \n\t
  • 例如,trimmed([3,1,2,4,3,4]) = [3,4,3,4]
  • \n
\n\n

子数组的 重要性 定义为 k + trimmed(subarray).length

\n\n
    \n\t
  • 例如,如果一个子数组是 [1,2,3,3,3,4,4]trimmed([1,2,3,3,3,4,4]) = [3,3,3,4,4] 。这个子数组的重要性就是 k + 5
  • \n
\n\n

找出并返回拆分 nums 的所有可行方案中的最小代价。

\n\n

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

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [1,2,1,2,1,3,3], k = 2\n输出:8\n解释:将 nums 拆分成两个子数组:[1,2], [1,2,1,3,3]\n[1,2] 的重要性是 2 + (0) = 2 。\n[1,2,1,3,3] 的重要性是 2 + (2 + 2) = 6 。\n拆分的代价是 2 + 6 = 8 ,可以证明这是所有可行的拆分方案中的最小代价。\n
\n\n

示例 2:

\n\n
\n输入:nums = [1,2,1,2,1], k = 2\n输出:6\n解释:将 nums 拆分成两个子数组:[1,2], [1,2,1] 。\n[1,2] 的重要性是 2 + (0) = 2 。\n[1,2,1] 的重要性是 2 + (2) = 4 。\n拆分的代价是 2 + 4 = 6 ,可以证明这是所有可行的拆分方案中的最小代价。\n
\n\n

示例 3:

\n\n
\n输入:nums = [1,2,1,2,1], k = 5\n输出:10\n解释:将 nums 拆分成一个子数组:[1,2,1,2,1].\n[1,2,1,2,1] 的重要性是 5 + (3 + 2) = 10 。\n拆分的代价是 10 ,可以证明这是所有可行的拆分方案中的最小代价。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 1000
  • \n\t
  • 0 <= nums[i] < nums.length
  • \n\t
  • 1 <= k <= 109
  • \n
\n\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 minCost(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minCost(int[] nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minCost(self, nums, k):\n \"\"\"\n :type nums: List[int]\n :type k: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minCost(self, nums: List[int], k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minCost(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinCost(int[] nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar minCost = function(nums, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef min_cost(nums, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minCost(_ nums: [Int], _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minCost(nums []int, k int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minCost(nums: Array[Int], k: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minCost(nums: IntArray, k: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_cost(nums: Vec, k: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $k\n * @return Integer\n */\n function minCost($nums, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minCost(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-cost nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_cost(Nums :: [integer()], K :: integer()) -> integer().\nmin_cost(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_cost(nums :: [integer], k :: integer) :: integer\n def min_cost(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minCost(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"3K\", \"totalAcceptedRaw\": 1660, \"totalSubmissionRaw\": 3032, \"acRate\": \"54.7%\"}", + "hints": [ + "Let's denote dp[r] = minimum cost to partition the first r elements of nums. What would be the transitions of such dynamic programming?", + "dp[r] = min(dp[l] + importance(nums[l..r])) over all 0 <= l < r. This already gives us an O(n^3) approach, as importance can be calculated in linear time, and there are a total of O(n^2) transitions.", + "Can you think of a way to compute multiple importance values of related subarrays faster?", + "importance(nums[l-1..r]) is either importance(nums[l..r]) if a new unique element is added, importance(nums[l..r]) + 1 if an old element that appeared at least twice is added, or importance(nums[l..r]) + 2, if a previously unique element is duplicated. This allows us to compute importance(nums[l..r]) for all 0 <= l < r in O(n) by keeping a frequency table and decreasing l from r-1 down to 0." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,1,2,1,3,3]\n2", + "metaData": "{\n \"name\": \"minCost\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 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@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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,1,2,1,3,3]\n2\n[1,2,1,2,1]\n2\n[1,2,1,2,1]\n5", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-operations-to-make-array-equal-ii.json b/leetcode-cn/originData/minimum-operations-to-make-array-equal-ii.json new file mode 100644 index 00000000..67faa7b7 --- /dev/null +++ b/leetcode-cn/originData/minimum-operations-to-make-array-equal-ii.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2604", + "questionFrontendId": "2541", + "categoryTitle": "Algorithms", + "boundTopicId": 2070102, + "title": "Minimum Operations to Make Array Equal II", + "titleSlug": "minimum-operations-to-make-array-equal-ii", + "content": "

You are given two integer arrays nums1 and nums2 of equal length n and an integer k. You can perform the following operation on nums1:

\n\n
    \n\t
  • Choose two indexes i and j and increment nums1[i] by k and decrement nums1[j] by k. In other words, nums1[i] = nums1[i] + k and nums1[j] = nums1[j] - k.
  • \n
\n\n

nums1 is said to be equal to nums2 if for all indices i such that 0 <= i < n, nums1[i] == nums2[i].

\n\n

Return the minimum number of operations required to make nums1 equal to nums2. If it is impossible to make them equal, return -1.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [4,3,1,4], nums2 = [1,3,7,1], k = 3\nOutput: 2\nExplanation: In 2 operations, we can transform nums1 to nums2.\n1st operation: i = 2, j = 0. After applying the operation, nums1 = [1,3,4,4].\n2nd operation: i = 2, j = 3. After applying the operation, nums1 = [1,3,7,1].\nOne can prove that it is impossible to make arrays equal in fewer operations.
\n\n

Example 2:

\n\n
\nInput: nums1 = [3,8,5,2], nums2 = [2,4,1,6], k = 1\nOutput: -1\nExplanation: It can be proved that it is impossible to make the two arrays equal.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 2 <= n <= 105
  • \n\t
  • 0 <= nums1[i], nums2[j] <= 109
  • \n\t
  • 0 <= k <= 105
  • \n
\n", + "translatedTitle": "使数组中所有元素相等的最小操作数 II", + "translatedContent": "

给你两个整数数组 nums1 和 nums2 ,两个数组长度都是 n ,再给你一个整数 k 。你可以对数组 nums1 进行以下操作:

\n\n
    \n\t
  • 选择两个下标 i 和 j ,将 nums1[i] 增加 k ,将 nums1[j] 减少 k 。换言之,nums1[i] = nums1[i] + k 且 nums1[j] = nums1[j] - k 。
  • \n
\n\n

如果对于所有满足 0 <= i < n 都有 num1[i] == nums2[i] ,那么我们称 nums1 等于 nums2 。

\n\n

请你返回使 nums1 等于 nums2 的 最少 操作数。如果没办法让它们相等,请你返回 -1 。

\n\n

 

\n\n

示例 1:

\n\n
输入:nums1 = [4,3,1,4], nums2 = [1,3,7,1], k = 3\n输出:2\n解释:我们可以通过 2 个操作将 nums1 变成 nums2 。\n第 1 个操作:i = 2 ,j = 0 。操作后得到 nums1 = [1,3,4,4] 。\n第 2 个操作:i = 2 ,j = 3 。操作后得到 nums1 = [1,3,7,1] 。\n无法用更少操作使两个数组相等。
\n\n

示例 2:

\n\n
输入:nums1 = [3,8,5,2], nums2 = [2,4,1,6], k = 1\n输出:-1\n解释:无法使两个数组相等。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 2 <= n <= 105
  • \n\t
  • 0 <= nums1[i], nums2[j] <= 109
  • \n\t
  • 0 <= k <= 105
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 2, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long minOperations(vector& nums1, vector& nums2, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long minOperations(int[] nums1, int[] nums2, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minOperations(self, nums1, nums2, k):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :type k: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int], k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long minOperations(int* nums1, int nums1Size, int* nums2, int nums2Size, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MinOperations(int[] nums1, int[] nums2, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @param {number} k\n * @return {number}\n */\nvar minOperations = function(nums1, nums2, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @param {Integer} k\n# @return {Integer}\ndef min_operations(nums1, nums2, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minOperations(_ nums1: [Int], _ nums2: [Int], _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minOperations(nums1 []int, nums2 []int, k int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minOperations(nums1: Array[Int], nums2: Array[Int], k: Int): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minOperations(nums1: IntArray, nums2: IntArray, k: Int): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_operations(nums1: Vec, nums2: Vec, k: 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 $k\n * @return Integer\n */\n function minOperations($nums1, $nums2, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minOperations(nums1: number[], nums2: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-operations nums1 nums2 k)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_operations(Nums1 :: [integer()], Nums2 :: [integer()], K :: integer()) -> integer().\nmin_operations(Nums1, Nums2, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_operations(nums1 :: [integer], nums2 :: [integer], k :: integer) :: integer\n def min_operations(nums1, nums2, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minOperations(List nums1, List nums2, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"6.3K\", \"totalAcceptedRaw\": 1851, \"totalSubmissionRaw\": 6320, \"acRate\": \"29.3%\"}", + "hints": [ + "What are the cases for which we cannot make nums1 == nums2?", + "For minimum moves, if nums1[i] < nums2[i], then we should never decrement nums1[i]. \r\nIf nums1[i] > nums2[i], then we should never increment nums1[i]." + ], + "solution": null, + "status": null, + "sampleTestCase": "[4,3,1,4]\n[1,3,7,1]\n3", + "metaData": "{\n \"name\": \"minOperations\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 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@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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": "[4,3,1,4]\n[1,3,7,1]\n3\n[3,8,5,2]\n[2,4,1,6]\n1", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/sort-the-students-by-their-kth-score.json b/leetcode-cn/originData/sort-the-students-by-their-kth-score.json new file mode 100644 index 00000000..fc471291 --- /dev/null +++ b/leetcode-cn/originData/sort-the-students-by-their-kth-score.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "2631", + "questionFrontendId": "2545", + "categoryTitle": "Algorithms", + "boundTopicId": 2068892, + "title": "Sort the Students by Their Kth Score", + "titleSlug": "sort-the-students-by-their-kth-score", + "content": "

There is a class with m students and n exams. You are given a 0-indexed m x n integer matrix score, where each row represents one student and score[i][j] denotes the score the ith student got in the jth exam. The matrix score contains distinct integers only.

\n\n

You are also given an integer k. Sort the students (i.e., the rows of the matrix) by their scores in the kth (0-indexed) exam from the highest to the lowest.

\n\n

Return the matrix after sorting it.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: score = [[10,6,9,1],[7,5,11,2],[4,8,3,15]], k = 2\nOutput: [[7,5,11,2],[10,6,9,1],[4,8,3,15]]\nExplanation: In the above diagram, S denotes the student, while E denotes the exam.\n- The student with index 1 scored 11 in exam 2, which is the highest score, so they got first place.\n- The student with index 0 scored 9 in exam 2, which is the second highest score, so they got second place.\n- The student with index 2 scored 3 in exam 2, which is the lowest score, so they got third place.\n
\n\n

Example 2:

\n\"\"\n
\nInput: score = [[3,4],[5,6]], k = 0\nOutput: [[5,6],[3,4]]\nExplanation: In the above diagram, S denotes the student, while E denotes the exam.\n- The student with index 1 scored 5 in exam 0, which is the highest score, so they got first place.\n- The student with index 0 scored 3 in exam 0, which is the lowest score, so they got second place.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • m == score.length
  • \n\t
  • n == score[i].length
  • \n\t
  • 1 <= m, n <= 250
  • \n\t
  • 1 <= score[i][j] <= 105
  • \n\t
  • score consists of distinct integers.
  • \n\t
  • 0 <= k < n
  • \n
\n", + "translatedTitle": "根据第 K 场考试的分数排序", + "translatedContent": "

班里有 m 位学生,共计划组织 n 场考试。给你一个下标从 0 开始、大小为 m x n 的整数矩阵 score ,其中每一行对应一位学生,而 score[i][j] 表示第 i 位学生在第 j 场考试取得的分数。矩阵 score 包含的整数 互不相同 。

\n\n

另给你一个整数 k 。请你按第 k 场考试分数从高到低完成对这些学生(矩阵中的行)的排序。

\n\n

返回排序后的矩阵。

\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
\n输入:score = [[10,6,9,1],[7,5,11,2],[4,8,3,15]], k = 2\n输出:[[7,5,11,2],[10,6,9,1],[4,8,3,15]]\n解释:在上图中,S 表示学生,E 表示考试。\n- 下标为 1 的学生在第 2 场考试取得的分数为 11 ,这是考试的最高分,所以 TA 需要排在第一。\n- 下标为 0 的学生在第 2 场考试取得的分数为 9 ,这是考试的第二高分,所以 TA 需要排在第二。\n- 下标为 2 的学生在第 2 场考试取得的分数为 3 ,这是考试的最低分,所以 TA 需要排在第三。\n
\n\n

示例 2:

\n\n

\"\"

\n\n
\n输入:score = [[3,4],[5,6]], k = 0\n输出:[[5,6],[3,4]]\n解释:在上图中,S 表示学生,E 表示考试。\n- 下标为 1 的学生在第 0 场考试取得的分数为 5 ,这是考试的最高分,所以 TA 需要排在第一。\n- 下标为 0 的学生在第 0 场考试取得的分数为 3 ,这是考试的最低分,所以 TA 需要排在第二。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • m == score.length
  • \n\t
  • n == score[i].length
  • \n\t
  • 1 <= m, n <= 250
  • \n\t
  • 1 <= score[i][j] <= 105
  • \n\t
  • score不同 的整数组成
  • \n\t
  • 0 <= k < n
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 1, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector> sortTheStudents(vector>& score, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[][] sortTheStudents(int[][] score, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def sortTheStudents(self, score, k):\n \"\"\"\n :type score: List[List[int]]\n :type k: int\n :rtype: List[List[int]]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def sortTheStudents(self, score: List[List[int]], k: int) -> List[List[int]]:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\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** sortTheStudents(int** score, int scoreSize, int* scoreColSize, int k, int* returnSize, int** returnColumnSizes){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[][] SortTheStudents(int[][] score, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} score\n * @param {number} k\n * @return {number[][]}\n */\nvar sortTheStudents = function(score, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} score\n# @param {Integer} k\n# @return {Integer[][]}\ndef sort_the_students(score, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func sortTheStudents(_ score: [[Int]], _ k: Int) -> [[Int]] {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func sortTheStudents(score [][]int, k int) [][]int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def sortTheStudents(score: Array[Array[Int]], k: Int): Array[Array[Int]] = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun sortTheStudents(score: Array, k: Int): Array {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn sort_the_students(score: Vec>, k: i32) -> Vec> {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $score\n * @param Integer $k\n * @return Integer[][]\n */\n function sortTheStudents($score, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function sortTheStudents(score: number[][], k: number): number[][] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (sort-the-students score k)\n (-> (listof (listof exact-integer?)) exact-integer? (listof (listof exact-integer?)))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec sort_the_students(Score :: [[integer()]], K :: integer()) -> [[integer()]].\nsort_the_students(Score, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec sort_the_students(score :: [[integer]], k :: integer) :: [[integer]]\n def sort_the_students(score, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List> sortTheStudents(List> score, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 2820, \"totalSubmissionRaw\": 3229, \"acRate\": \"87.3%\"}", + "hints": [ + "Find the row with the highest score in the kth exam and swap it with the first row.", + "After fixing the first row, perform the same operation for the rest of the rows, and the matrix's rows will get sorted one by one." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[10,6,9,1],[7,5,11,2],[4,8,3,15]]\n2", + "metaData": "{\n \"name\": \"sortTheStudents\",\n \"params\": [\n {\n \"name\": \"score\",\n \"type\": \"integer[][]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer[][]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

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

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

\\u7248\\u672c\\uff1aOpenJDK 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/p>\\r\\n\\r\\n

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

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

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

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

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

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

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

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

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

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

\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n

3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"

C# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/code><\\/p>\\r\\n\\r\\n

\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/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>\\r\\n\\r\\n

lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/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,6,9,1],[7,5,11,2],[4,8,3,15]]\n2\n[[3,4],[5,6]]\n0", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/交替数字和 [alternating-digit-sum].html b/leetcode-cn/problem (Chinese)/交替数字和 [alternating-digit-sum].html new file mode 100644 index 00000000..e28e110d --- /dev/null +++ b/leetcode-cn/problem (Chinese)/交替数字和 [alternating-digit-sum].html @@ -0,0 +1,43 @@ +

给你一个正整数 nn 中的每一位数字都会按下述规则分配一个符号:

+ +
    +
  • 最高有效位 上的数字分配到 号。
  • +
  • 剩余每位上数字的符号都与其相邻数字相反。
  • +
+ +

返回所有数字及其对应符号的和。

+ +

 

+ +

示例 1:

+ +
+输入:n = 521
+输出:4
+解释:(+5) + (-2) + (+1) = 4
+ +

示例 2:

+ +
+输入:n = 111
+输出:1
+解释:(+1) + (-1) + (+1) = 1
+
+ +

示例 3:

+ +
+输入:n = 886996
+输出:0
+解释:(+8) + (-8) + (+6) + (-9) + (+9) + (-6) = 0
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 109
  • +
+ +

 

diff --git a/leetcode-cn/problem (Chinese)/使数组中所有元素相等的最小操作数 II [minimum-operations-to-make-array-equal-ii].html b/leetcode-cn/problem (Chinese)/使数组中所有元素相等的最小操作数 II [minimum-operations-to-make-array-equal-ii].html new file mode 100644 index 00000000..d678900d --- /dev/null +++ b/leetcode-cn/problem (Chinese)/使数组中所有元素相等的最小操作数 II [minimum-operations-to-make-array-equal-ii].html @@ -0,0 +1,38 @@ +

给你两个整数数组 nums1 和 nums2 ,两个数组长度都是 n ,再给你一个整数 k 。你可以对数组 nums1 进行以下操作:

+ +
    +
  • 选择两个下标 i 和 j ,将 nums1[i] 增加 k ,将 nums1[j] 减少 k 。换言之,nums1[i] = nums1[i] + k 且 nums1[j] = nums1[j] - k 。
  • +
+ +

如果对于所有满足 0 <= i < n 都有 num1[i] == nums2[i] ,那么我们称 nums1 等于 nums2 。

+ +

请你返回使 nums1 等于 nums2 的 最少 操作数。如果没办法让它们相等,请你返回 -1 。

+ +

 

+ +

示例 1:

+ +
输入:nums1 = [4,3,1,4], nums2 = [1,3,7,1], k = 3
+输出:2
+解释:我们可以通过 2 个操作将 nums1 变成 nums2 。
+第 1 个操作:i = 2 ,j = 0 。操作后得到 nums1 = [1,3,4,4] 。
+第 2 个操作:i = 2 ,j = 3 。操作后得到 nums1 = [1,3,7,1] 。
+无法用更少操作使两个数组相等。
+ +

示例 2:

+ +
输入:nums1 = [3,8,5,2], nums2 = [2,4,1,6], k = 1
+输出:-1
+解释:无法使两个数组相等。
+
+ +

 

+ +

提示:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 2 <= n <= 105
  • +
  • 0 <= nums1[i], nums2[j] <= 109
  • +
  • 0 <= k <= 105
  • +
diff --git a/leetcode-cn/problem (Chinese)/判断一个点是否可以到达 [check-if-point-is-reachable].html b/leetcode-cn/problem (Chinese)/判断一个点是否可以到达 [check-if-point-is-reachable].html new file mode 100644 index 00000000..12b1c154 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/判断一个点是否可以到达 [check-if-point-is-reachable].html @@ -0,0 +1,36 @@ +

给你一个无穷大的网格图。一开始你在 (1, 1) ,你需要通过有限步移动到达点 (targetX, targetY) 。

+ +

每一步 ,你可以从点 (x, y) 移动到以下点之一:

+ +
    +
  • (x, y - x)
  • +
  • (x - y, y)
  • +
  • (2 * x, y)
  • +
  • (x, 2 * y)
  • +
+ +

给你两个整数 targetX 和 targetY ,分别表示你最后需要到达点的 X 和 Y 坐标。如果你可以从 (1, 1) 出发到达这个点,请你返回true ,否则返回 false 

+ +

 

+ +

示例 1:

+ +
输入:targetX = 6, targetY = 9
+输出:false
+解释:没法从 (1,1) 出发到达 (6,9) ,所以返回 false 。
+
+ +

示例 2:

+ +
输入:targetX = 4, targetY = 7
+输出:true
+解释:你可以按照以下路径到达:(1,1) -> (1,2) -> (1,4) -> (1,8) -> (1,7) -> (2,7) -> (4,7) 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= targetX, targetY <= 109
  • +
diff --git a/leetcode-cn/problem (Chinese)/子矩阵元素加 1 [increment-submatrices-by-one].html b/leetcode-cn/problem (Chinese)/子矩阵元素加 1 [increment-submatrices-by-one].html new file mode 100644 index 00000000..301fb358 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/子矩阵元素加 1 [increment-submatrices-by-one].html @@ -0,0 +1,44 @@ +

给你一个正整数 n ,表示最初有一个 n x n 、下标从 0 开始的整数矩阵 mat ,矩阵中填满了 0 。

+ +

另给你一个二维整数数组 query 。针对每个查询 query[i] = [row1i, col1i, row2i, col2i] ,请你执行下述操作:

+ +
    +
  • 找出 左上角(row1i, col1i)右下角(row2i, col2i) 的子矩阵,将子矩阵中的 每个元素1 。也就是给所有满足 row1i <= x <= row2icol1i <= y <= col2imat[x][y]1
  • +
+ +

返回执行完所有操作后得到的矩阵 mat

+ +

 

+ +

示例 1:

+ +

+ +
+输入:n = 3, queries = [[1,1,2,2],[0,0,1,1]]
+输出:[[1,1,0],[1,2,1],[0,1,1]]
+解释:上图所展示的分别是:初始矩阵、执行完第一个操作后的矩阵、执行完第二个操作后的矩阵。
+- 第一个操作:将左上角为 (1, 1) 且右下角为 (2, 2) 的子矩阵中的每个元素加 1 。 
+- 第二个操作:将左上角为 (0, 0) 且右下角为 (1, 1) 的子矩阵中的每个元素加 1 。 
+
+ +

示例 2:

+ +

+ +
+输入:n = 2, queries = [[0,0,1,1]]
+输出:[[1,1],[1,1]]
+解释:上图所展示的分别是:初始矩阵、执行完第一个操作后的矩阵。 
+- 第一个操作:将矩阵中的每个元素加 1 。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 500
  • +
  • 1 <= queries.length <= 104
  • +
  • 0 <= row1i <= row2i < n
  • +
  • 0 <= col1i <= col2i < n
  • +
diff --git a/leetcode-cn/problem (Chinese)/执行逐位运算使字符串相等 [apply-bitwise-operations-to-make-strings-equal].html b/leetcode-cn/problem (Chinese)/执行逐位运算使字符串相等 [apply-bitwise-operations-to-make-strings-equal].html new file mode 100644 index 00000000..9e225032 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/执行逐位运算使字符串相等 [apply-bitwise-operations-to-make-strings-equal].html @@ -0,0 +1,39 @@ +

给你两个下标从 0 开始的 二元 字符串 starget ,两个字符串的长度均为 n 。你可以对 s 执行下述操作 任意 次:

+ +
    +
  • 选择两个 不同 的下标 ij ,其中 0 <= i, j < n
  • +
  • 同时,将 s[i] 替换为 (s[i] OR s[j]) ,s[j] 替换为 (s[i] XOR s[j]) 。
  • +
+ +

例如,如果 s = "0110" ,你可以选择 i = 0j = 2,然后同时将 s[0] 替换为 (s[0] OR s[2] = 0 OR 1 = 1),并将 s[2] 替换为 (s[0] XOR s[2] = 0 XOR 1 = 1),最终得到 s = "1110"

+ +

如果可以使 s 等于 target ,返回 true ,否则,返回 false

+ +

 

+ +

示例 1:

+ +
输入:s = "1010", target = "0110"
+输出:true
+解释:可以执行下述操作:
+- 选择 i = 2 和 j = 0 ,得到 s = "0010".
+- 选择 i = 2 和 j = 1 ,得到 s = "0110".
+可以使 s 等于 target ,返回 true 。
+
+ +

示例 2:

+ +
输入:s = "11", target = "00"
+输出:false
+解释:执行任意次操作都无法使 s 等于 target 。
+
+ +

 

+ +

提示:

+ +
    +
  • n == s.length == target.length
  • +
  • 2 <= n <= 105
  • +
  • starget 仅由数字 01 组成
  • +
diff --git a/leetcode-cn/problem (Chinese)/拆分数组的最小代价 [minimum-cost-to-split-an-array].html b/leetcode-cn/problem (Chinese)/拆分数组的最小代价 [minimum-cost-to-split-an-array].html new file mode 100644 index 00000000..03645f33 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/拆分数组的最小代价 [minimum-cost-to-split-an-array].html @@ -0,0 +1,65 @@ +

给你一个整数数组 nums 和一个整数 k

+ +

将数组拆分成一些非空子数组。拆分的 代价 是每个子数组中的 重要性 之和。

+ +

trimmed(subarray) 作为子数组的一个特征,其中所有仅出现一次的数字将会被移除。

+ +
    +
  • 例如,trimmed([3,1,2,4,3,4]) = [3,4,3,4]
  • +
+ +

子数组的 重要性 定义为 k + trimmed(subarray).length

+ +
    +
  • 例如,如果一个子数组是 [1,2,3,3,3,4,4]trimmed([1,2,3,3,3,4,4]) = [3,3,3,4,4] 。这个子数组的重要性就是 k + 5
  • +
+ +

找出并返回拆分 nums 的所有可行方案中的最小代价。

+ +

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

+ +

 

+ +

示例 1:

+ +
+输入:nums = [1,2,1,2,1,3,3], k = 2
+输出:8
+解释:将 nums 拆分成两个子数组:[1,2], [1,2,1,3,3]
+[1,2] 的重要性是 2 + (0) = 2 。
+[1,2,1,3,3] 的重要性是 2 + (2 + 2) = 6 。
+拆分的代价是 2 + 6 = 8 ,可以证明这是所有可行的拆分方案中的最小代价。
+
+ +

示例 2:

+ +
+输入:nums = [1,2,1,2,1], k = 2
+输出:6
+解释:将 nums 拆分成两个子数组:[1,2], [1,2,1] 。
+[1,2] 的重要性是 2 + (0) = 2 。
+[1,2,1] 的重要性是 2 + (2) = 4 。
+拆分的代价是 2 + 4 = 6 ,可以证明这是所有可行的拆分方案中的最小代价。
+
+ +

示例 3:

+ +
+输入:nums = [1,2,1,2,1], k = 5
+输出:10
+解释:将 nums 拆分成一个子数组:[1,2,1,2,1].
+[1,2,1,2,1] 的重要性是 5 + (3 + 2) = 10 。
+拆分的代价是 10 ,可以证明这是所有可行的拆分方案中的最小代价。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 1000
  • +
  • 0 <= nums[i] < nums.length
  • +
  • 1 <= k <= 109
  • +
+ +

 

diff --git a/leetcode-cn/problem (Chinese)/数组元素和与数字和的绝对差 [difference-between-element-sum-and-digit-sum-of-an-array].html b/leetcode-cn/problem (Chinese)/数组元素和与数字和的绝对差 [difference-between-element-sum-and-digit-sum-of-an-array].html new file mode 100644 index 00000000..1c826f59 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/数组元素和与数字和的绝对差 [difference-between-element-sum-and-digit-sum-of-an-array].html @@ -0,0 +1,43 @@ +

给你一个正整数数组 nums

+ +
    +
  • 元素和nums 中的所有元素相加求和。
  • +
  • 数字和 是 nums 中每一个元素的每一数位(重复数位需多次求和)相加求和。
  • +
+ +

返回 元素和数字和 的绝对差。

+ +

注意:两个整数 xy 的绝对差定义为 |x - y|

+ +

 

+ +

示例 1:

+ +
+输入:nums = [1,15,6,3]
+输出:9
+解释:
+nums 的元素和是 1 + 15 + 6 + 3 = 25 。
+nums 的数字和是 1 + 1 + 5 + 6 + 3 = 16 。
+元素和与数字和的绝对差是 |25 - 16| = 9 。
+
+ +

示例 2:

+ +
+输入:nums = [1,2,3,4]
+输出:0
+解释:
+nums 的元素和是 1 + 2 + 3 + 4 = 10 。
+nums 的数字和是 1 + 2 + 3 + 4 = 10 。
+元素和与数字和的绝对差是 |10 - 10| = 0 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 2000
  • +
  • 1 <= nums[i] <= 2000
  • +
diff --git a/leetcode-cn/problem (Chinese)/最大价值和与最小价值和的差值 [difference-between-maximum-and-minimum-price-sum].html b/leetcode-cn/problem (Chinese)/最大价值和与最小价值和的差值 [difference-between-maximum-and-minimum-price-sum].html new file mode 100644 index 00000000..cec4421e --- /dev/null +++ b/leetcode-cn/problem (Chinese)/最大价值和与最小价值和的差值 [difference-between-maximum-and-minimum-price-sum].html @@ -0,0 +1,50 @@ +

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

+ +

每个节点都有一个价值。给你一个整数数组 price ,其中 price[i] 是第 i 个节点的价值。

+ +

一条路径的 价值和 是这条路径上所有节点的价值之和。

+ +

你可以选择树中任意一个节点作为根节点 root 。选择 root 为根的 开销 是以 root 为起点的所有路径中,价值和 最大的一条路径与最小的一条路径的差值。

+ +

请你返回所有节点作为根节点的选择中,最大 的 开销 为多少。

+ +

 

+ +

示例 1:

+ +

+ +
+输入:n = 6, edges = [[0,1],[1,2],[1,3],[3,4],[3,5]], price = [9,8,7,6,10,5]
+输出:24
+解释:上图展示了以节点 2 为根的树。左图(红色的节点)是最大价值和路径,右图(蓝色的节点)是最小价值和路径。
+- 第一条路径节点为 [2,1,3,4]:价值为 [7,8,6,10] ,价值和为 31 。
+- 第二条路径节点为 [2] ,价值为 [7] 。
+最大路径和与最小路径和的差值为 24 。24 是所有方案中的最大开销。
+
+ +

示例 2:

+ +

+ +
+输入:n = 3, edges = [[0,1],[1,2]], price = [1,1,1]
+输出:2
+解释:上图展示了以节点 0 为根的树。左图(红色的节点)是最大价值和路径,右图(蓝色的节点)是最小价值和路径。
+- 第一条路径包含节点 [0,1,2]:价值为 [1,1,1] ,价值和为 3 。
+- 第二条路径节点为 [0] ,价值为 [1] 。
+最大路径和与最小路径和的差值为 2 。2 是所有方案中的最大开销。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 105
  • +
  • edges.length == n - 1
  • +
  • 0 <= ai, bi <= n - 1
  • +
  • edges 表示一棵符合题面要求的树。
  • +
  • price.length == n
  • +
  • 1 <= price[i] <= 105
  • +
diff --git a/leetcode-cn/problem (Chinese)/最大子序列的分数 [maximum-subsequence-score].html b/leetcode-cn/problem (Chinese)/最大子序列的分数 [maximum-subsequence-score].html new file mode 100644 index 00000000..8a2a9379 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/最大子序列的分数 [maximum-subsequence-score].html @@ -0,0 +1,46 @@ +

给你两个下标从 0 开始的整数数组 nums1 和 nums2 ,两者长度都是 n ,再给你一个正整数 k 。你必须从 nums1 中选一个长度为 k 的 子序列 对应的下标。

+ +

对于选择的下标 i0 ,i1 ,..., ik - 1 ,你的 分数 定义如下:

+ +
    +
  • nums1 中下标对应元素求和,乘以 nums2 中下标对应元素的 最小值 。
  • +
  • 用公示表示: (nums1[i0] + nums1[i1] +...+ nums1[ik - 1]) * min(nums2[i0] , nums2[i1], ... ,nums2[ik - 1]) 。
  • +
+ +

请你返回 最大 可能的分数。

+ +

一个数组的 子序列 下标是集合 {0, 1, ..., n-1} 中删除若干元素得到的剩余集合,也可以不删除任何元素。

+ +

 

+ +

示例 1:

+ +
输入:nums1 = [1,3,3,2], nums2 = [2,1,3,4], k = 3
+输出:12
+解释:
+四个可能的子序列分数为:
+- 选择下标 0 ,1 和 2 ,得到分数 (1+3+3) * min(2,1,3) = 7 。
+- 选择下标 0 ,1 和 3 ,得到分数 (1+3+2) * min(2,1,4) = 6 。
+- 选择下标 0 ,2 和 3 ,得到分数 (1+3+2) * min(2,3,4) = 12 。
+- 选择下标 1 ,2 和 3 ,得到分数 (3+3+2) * min(1,3,4) = 8 。
+所以最大分数为 12 。
+
+ +

示例 2:

+ +
输入:nums1 = [4,2,3,1,1], nums2 = [7,5,10,9,6], k = 1
+输出:30
+解释:
+选择下标 2 最优:nums1[2] * nums2[2] = 3 * 10 = 30 是最大可能分数。
+
+ +

 

+ +

提示:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 1 <= n <= 105
  • +
  • 0 <= nums1[i], nums2[j] <= 105
  • +
  • 1 <= k <= n
  • +
diff --git a/leetcode-cn/problem (Chinese)/最小公共值 [minimum-common-value].html b/leetcode-cn/problem (Chinese)/最小公共值 [minimum-common-value].html new file mode 100644 index 00000000..77f64604 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/最小公共值 [minimum-common-value].html @@ -0,0 +1,29 @@ +

给你两个整数数组 nums1 和 nums2 ,它们已经按非降序排序,请你返回两个数组的 最小公共整数 。如果两个数组 nums1 和 nums2 没有公共整数,请你返回 -1 。

+ +

如果一个整数在两个数组中都 至少出现一次 ,那么这个整数是数组 nums1 和 nums2 公共 的。

+ +

 

+ +

示例 1:

+ +
输入:nums1 = [1,2,3], nums2 = [2,4]
+输出:2
+解释:两个数组的最小公共元素是 2 ,所以我们返回 2 。
+
+ +

示例 2:

+ +
输入:nums1 = [1,2,3,6], nums2 = [2,3,4,5]
+输出:2
+解释:两个数组中的公共元素是 2 和 3 ,2 是较小值,所以返回 2 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 105
  • +
  • 1 <= nums1[i], nums2[j] <= 109
  • +
  • nums1 和 nums2 都是 非降序 的。
  • +
diff --git a/leetcode-cn/problem (Chinese)/根据第 K 场考试的分数排序 [sort-the-students-by-their-kth-score].html b/leetcode-cn/problem (Chinese)/根据第 K 场考试的分数排序 [sort-the-students-by-their-kth-score].html new file mode 100644 index 00000000..fddafe75 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/根据第 K 场考试的分数排序 [sort-the-students-by-their-kth-score].html @@ -0,0 +1,45 @@ +

班里有 m 位学生,共计划组织 n 场考试。给你一个下标从 0 开始、大小为 m x n 的整数矩阵 score ,其中每一行对应一位学生,而 score[i][j] 表示第 i 位学生在第 j 场考试取得的分数。矩阵 score 包含的整数 互不相同 。

+ +

另给你一个整数 k 。请你按第 k 场考试分数从高到低完成对这些学生(矩阵中的行)的排序。

+ +

返回排序后的矩阵。

+ +

 

+ +

示例 1:

+ +

+ +
+输入:score = [[10,6,9,1],[7,5,11,2],[4,8,3,15]], k = 2
+输出:[[7,5,11,2],[10,6,9,1],[4,8,3,15]]
+解释:在上图中,S 表示学生,E 表示考试。
+- 下标为 1 的学生在第 2 场考试取得的分数为 11 ,这是考试的最高分,所以 TA 需要排在第一。
+- 下标为 0 的学生在第 2 场考试取得的分数为 9 ,这是考试的第二高分,所以 TA 需要排在第二。
+- 下标为 2 的学生在第 2 场考试取得的分数为 3 ,这是考试的最低分,所以 TA 需要排在第三。
+
+ +

示例 2:

+ +

+ +
+输入:score = [[3,4],[5,6]], k = 0
+输出:[[5,6],[3,4]]
+解释:在上图中,S 表示学生,E 表示考试。
+- 下标为 1 的学生在第 0 场考试取得的分数为 5 ,这是考试的最高分,所以 TA 需要排在第一。
+- 下标为 0 的学生在第 0 场考试取得的分数为 3 ,这是考试的最低分,所以 TA 需要排在第二。
+
+ +

 

+ +

提示:

+ +
    +
  • m == score.length
  • +
  • n == score[i].length
  • +
  • 1 <= m, n <= 250
  • +
  • 1 <= score[i][j] <= 105
  • +
  • score不同 的整数组成
  • +
  • 0 <= k < n
  • +
diff --git a/leetcode-cn/problem (Chinese)/统计好子数组的数目 [count-the-number-of-good-subarrays].html b/leetcode-cn/problem (Chinese)/统计好子数组的数目 [count-the-number-of-good-subarrays].html new file mode 100644 index 00000000..cb01de35 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/统计好子数组的数目 [count-the-number-of-good-subarrays].html @@ -0,0 +1,34 @@ +

给你一个整数数组 nums 和一个整数 k ,请你返回 nums 中  子数组的数目。

+ +

一个子数组 arr 如果有 至少 k 对下标 (i, j) 满足 i < j 且 arr[i] == arr[j] ,那么称它是一个  子数组。

+ +

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

+ +

 

+ +

示例 1:

+ +
输入:nums = [1,1,1,1,1], k = 10
+输出:1
+解释:唯一的好子数组是这个数组本身。
+
+ +

示例 2:

+ +
输入:nums = [3,1,4,3,2,2,4], k = 2
+输出:4
+解释:总共有 4 个不同的好子数组:
+- [3,1,4,3,2,2] 有 2 对。
+- [3,1,4,3,2,2,4] 有 3 对。
+- [1,4,3,2,2,4] 有 2 对。
+- [4,3,2,2,4] 有 2 对。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i], k <= 109
  • +
diff --git a/leetcode-cn/problem (English)/交替数字和(English) [alternating-digit-sum].html b/leetcode-cn/problem (English)/交替数字和(English) [alternating-digit-sum].html new file mode 100644 index 00000000..9ebf2bfd --- /dev/null +++ b/leetcode-cn/problem (English)/交替数字和(English) [alternating-digit-sum].html @@ -0,0 +1,49 @@ +

You are given a positive integer n. Each digit of n has a sign according to the following rules:

+ +
    +
  • The most significant digit is assigned a positive sign.
  • +
  • Each other digit has an opposite sign to its adjacent digits.
  • +
+ +

Return the sum of all digits with their corresponding sign.

+ +

 

+

Example 1:

+ +
+Input: n = 521
+Output: 4
+Explanation: (+5) + (-2) + (+1) = 4.
+
+ +

Example 2:

+ +
+Input: n = 111
+Output: 1
+Explanation: (+1) + (-1) + (+1) = 1.
+
+ +

Example 3:

+ +
+Input: n = 886996
+Output: 0
+Explanation: (+8) + (-8) + (+6) + (-9) + (+9) + (-6) = 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
  • +
+ +

 

+ diff --git a/leetcode-cn/problem (English)/使数组中所有元素相等的最小操作数 II(English) [minimum-operations-to-make-array-equal-ii].html b/leetcode-cn/problem (English)/使数组中所有元素相等的最小操作数 II(English) [minimum-operations-to-make-array-equal-ii].html new file mode 100644 index 00000000..4d6623a3 --- /dev/null +++ b/leetcode-cn/problem (English)/使数组中所有元素相等的最小操作数 II(English) [minimum-operations-to-make-array-equal-ii].html @@ -0,0 +1,38 @@ +

You are given two integer arrays nums1 and nums2 of equal length n and an integer k. You can perform the following operation on nums1:

+ +
    +
  • Choose two indexes i and j and increment nums1[i] by k and decrement nums1[j] by k. In other words, nums1[i] = nums1[i] + k and nums1[j] = nums1[j] - k.
  • +
+ +

nums1 is said to be equal to nums2 if for all indices i such that 0 <= i < n, nums1[i] == nums2[i].

+ +

Return the minimum number of operations required to make nums1 equal to nums2. If it is impossible to make them equal, return -1.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [4,3,1,4], nums2 = [1,3,7,1], k = 3
+Output: 2
+Explanation: In 2 operations, we can transform nums1 to nums2.
+1st operation: i = 2, j = 0. After applying the operation, nums1 = [1,3,4,4].
+2nd operation: i = 2, j = 3. After applying the operation, nums1 = [1,3,7,1].
+One can prove that it is impossible to make arrays equal in fewer operations.
+ +

Example 2:

+ +
+Input: nums1 = [3,8,5,2], nums2 = [2,4,1,6], k = 1
+Output: -1
+Explanation: It can be proved that it is impossible to make the two arrays equal.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 2 <= n <= 105
  • +
  • 0 <= nums1[i], nums2[j] <= 109
  • +
  • 0 <= k <= 105
  • +
diff --git a/leetcode-cn/problem (English)/判断一个点是否可以到达(English) [check-if-point-is-reachable].html b/leetcode-cn/problem (English)/判断一个点是否可以到达(English) [check-if-point-is-reachable].html new file mode 100644 index 00000000..dabc328c --- /dev/null +++ b/leetcode-cn/problem (English)/判断一个点是否可以到达(English) [check-if-point-is-reachable].html @@ -0,0 +1,36 @@ +

There exists an infinitely large grid. You are currently at point (1, 1), and you need to reach the point (targetX, targetY) using a finite number of steps.

+ +

In one step, you can move from point (x, y) to any one of the following points:

+ +
    +
  • (x, y - x)
  • +
  • (x - y, y)
  • +
  • (2 * x, y)
  • +
  • (x, 2 * y)
  • +
+ +

Given two integers targetX and targetY representing the X-coordinate and Y-coordinate of your final position, return true if you can reach the point from (1, 1) using some number of steps, and false otherwise.

+ +

 

+

Example 1:

+ +
+Input: targetX = 6, targetY = 9
+Output: false
+Explanation: It is impossible to reach (6,9) from (1,1) using any sequence of moves, so false is returned.
+
+ +

Example 2:

+ +
+Input: targetX = 4, targetY = 7
+Output: true
+Explanation: You can follow the path (1,1) -> (1,2) -> (1,4) -> (1,8) -> (1,7) -> (2,7) -> (4,7).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= targetX, targetY <= 109
  • +
diff --git a/leetcode-cn/problem (English)/子矩阵元素加 1(English) [increment-submatrices-by-one].html b/leetcode-cn/problem (English)/子矩阵元素加 1(English) [increment-submatrices-by-one].html new file mode 100644 index 00000000..262f7cdb --- /dev/null +++ b/leetcode-cn/problem (English)/子矩阵元素加 1(English) [increment-submatrices-by-one].html @@ -0,0 +1,39 @@ +

You are given a positive integer n, indicating that we initially have an n x n 0-indexed integer matrix mat filled with zeroes.

+ +

You are also given a 2D integer array query. For each query[i] = [row1i, col1i, row2i, col2i], you should do the following operation:

+ +
    +
  • Add 1 to every element in the submatrix with the top left corner (row1i, col1i) and the bottom right corner (row2i, col2i). That is, add 1 to mat[x][y] for for all row1i <= x <= row2i and col1i <= y <= col2i.
  • +
+ +

Return the matrix mat after performing every query.

+ +

 

+

Example 1:

+ +
+Input: n = 3, queries = [[1,1,2,2],[0,0,1,1]]
+Output: [[1,1,0],[1,2,1],[0,1,1]]
+Explanation: The diagram above shows the initial matrix, the matrix after the first query, and the matrix after the second query.
+- In the first query, we add 1 to every element in the submatrix with the top left corner (1, 1) and bottom right corner (2, 2).
+- In the second query, we add 1 to every element in the submatrix with the top left corner (0, 0) and bottom right corner (1, 1).
+
+ +

Example 2:

+ +
+Input: n = 2, queries = [[0,0,1,1]]
+Output: [[1,1],[1,1]]
+Explanation: The diagram above shows the initial matrix and the matrix after the first query.
+- In the first query we add 1 to every element in the matrix.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 500
  • +
  • 1 <= queries.length <= 104
  • +
  • 0 <= row1i <= row2i < n
  • +
  • 0 <= col1i <= col2i < n
  • +
diff --git a/leetcode-cn/problem (English)/执行逐位运算使字符串相等(English) [apply-bitwise-operations-to-make-strings-equal].html b/leetcode-cn/problem (English)/执行逐位运算使字符串相等(English) [apply-bitwise-operations-to-make-strings-equal].html new file mode 100644 index 00000000..79e572ef --- /dev/null +++ b/leetcode-cn/problem (English)/执行逐位运算使字符串相等(English) [apply-bitwise-operations-to-make-strings-equal].html @@ -0,0 +1,39 @@ +

You are given two 0-indexed binary strings s and target of the same length n. You can do the following operation on s any number of times:

+ +
    +
  • Choose two different indices i and j where 0 <= i, j < n.
  • +
  • Simultaneously, replace s[i] with (s[i] OR s[j]) and s[j] with (s[i] XOR s[j]).
  • +
+ +

For example, if s = "0110", you can choose i = 0 and j = 2, then simultaneously replace s[0] with (s[0] OR s[2] = 0 OR 1 = 1), and s[2] with (s[0] XOR s[2] = 0 XOR 1 = 1), so we will have s = "1110".

+ +

Return true if you can make the string s equal to target, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: s = "1010", target = "0110"
+Output: true
+Explanation: We can do the following operations:
+- Choose i = 2 and j = 0. We have now s = "0010".
+- Choose i = 2 and j = 1. We have now s = "0110".
+Since we can make s equal to target, we return true.
+
+ +

Example 2:

+ +
+Input: s = "11", target = "00"
+Output: false
+Explanation: It is not possible to make s equal to target with any number of operations.
+
+ +

 

+

Constraints:

+ +
    +
  • n == s.length == target.length
  • +
  • 2 <= n <= 105
  • +
  • s and target consist of only the digits 0 and 1.
  • +
diff --git a/leetcode-cn/problem (English)/拆分数组的最小代价(English) [minimum-cost-to-split-an-array].html b/leetcode-cn/problem (English)/拆分数组的最小代价(English) [minimum-cost-to-split-an-array].html new file mode 100644 index 00000000..e183ee02 --- /dev/null +++ b/leetcode-cn/problem (English)/拆分数组的最小代价(English) [minimum-cost-to-split-an-array].html @@ -0,0 +1,70 @@ +

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

+ +

Split the array into some number of non-empty subarrays. The cost of a split is the sum of the importance value of each subarray in the split.

+ +

Let trimmed(subarray) be the version of the subarray where all numbers which appear only once are removed.

+ +
    +
  • For example, trimmed([3,1,2,4,3,4]) = [3,4,3,4].
  • +
+ +

The importance value of a subarray is k + trimmed(subarray).length.

+ +
    +
  • For example, if a subarray is [1,2,3,3,3,4,4], then trimmed([1,2,3,3,3,4,4]) = [3,3,3,4,4].The importance value of this subarray will be k + 5.
  • +
+ +

Return the minimum possible cost of a split of nums.

+ +

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

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,1,2,1,3,3], k = 2
+Output: 8
+Explanation: We split nums to have two subarrays: [1,2], [1,2,1,3,3].
+The importance value of [1,2] is 2 + (0) = 2.
+The importance value of [1,2,1,3,3] is 2 + (2 + 2) = 6.
+The cost of the split is 2 + 6 = 8. It can be shown that this is the minimum possible cost among all the possible splits.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,1,2,1], k = 2
+Output: 6
+Explanation: We split nums to have two subarrays: [1,2], [1,2,1].
+The importance value of [1,2] is 2 + (0) = 2.
+The importance value of [1,2,1] is 2 + (2) = 4.
+The cost of the split is 2 + 4 = 6. It can be shown that this is the minimum possible cost among all the possible splits.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,1,2,1], k = 5
+Output: 10
+Explanation: We split nums to have one subarray: [1,2,1,2,1].
+The importance value of [1,2,1,2,1] is 5 + (3 + 2) = 10.
+The cost of the split is 10. It can be shown that this is the minimum possible cost among all the possible splits.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
  • +
  • 0 <= nums[i] < nums.length
  • +
  • 1 <= k <= 109
  • +
+ +

 

+ diff --git a/leetcode-cn/problem (English)/数组元素和与数字和的绝对差(English) [difference-between-element-sum-and-digit-sum-of-an-array].html b/leetcode-cn/problem (English)/数组元素和与数字和的绝对差(English) [difference-between-element-sum-and-digit-sum-of-an-array].html new file mode 100644 index 00000000..5b18206c --- /dev/null +++ b/leetcode-cn/problem (English)/数组元素和与数字和的绝对差(English) [difference-between-element-sum-and-digit-sum-of-an-array].html @@ -0,0 +1,41 @@ +

You are given a positive integer array nums.

+ +
    +
  • The element sum is the sum of all the elements in nums.
  • +
  • The digit sum is the sum of all the digits (not necessarily distinct) that appear in nums.
  • +
+ +

Return the absolute difference between the element sum and digit sum of nums.

+ +

Note that the absolute difference between two integers x and y is defined as |x - y|.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,15,6,3]
+Output: 9
+Explanation: 
+The element sum of nums is 1 + 15 + 6 + 3 = 25.
+The digit sum of nums is 1 + 1 + 5 + 6 + 3 = 16.
+The absolute difference between the element sum and digit sum is |25 - 16| = 9.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4]
+Output: 0
+Explanation:
+The element sum of nums is 1 + 2 + 3 + 4 = 10.
+The digit sum of nums is 1 + 2 + 3 + 4 = 10.
+The absolute difference between the element sum and digit sum is |10 - 10| = 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 2000
  • +
  • 1 <= nums[i] <= 2000
  • +
diff --git a/leetcode-cn/problem (English)/最大价值和与最小价值和的差值(English) [difference-between-maximum-and-minimum-price-sum].html b/leetcode-cn/problem (English)/最大价值和与最小价值和的差值(English) [difference-between-maximum-and-minimum-price-sum].html new file mode 100644 index 00000000..9dceb85a --- /dev/null +++ b/leetcode-cn/problem (English)/最大价值和与最小价值和的差值(English) [difference-between-maximum-and-minimum-price-sum].html @@ -0,0 +1,44 @@ +

There exists an undirected and initially unrooted tree with n nodes indexed from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

Each node has an associated price. You are given an integer array price, where price[i] is the price of the ith node.

+ +

The price sum of a given path is the sum of the prices of all nodes lying on that path.

+ +

The tree can be rooted at any node root of your choice. The incurred cost after choosing root is the difference between the maximum and minimum price sum amongst all paths starting at root.

+ +

Return the maximum possible cost amongst all possible root choices.

+ +

 

+

Example 1:

+ +
+Input: n = 6, edges = [[0,1],[1,2],[1,3],[3,4],[3,5]], price = [9,8,7,6,10,5]
+Output: 24
+Explanation: The diagram above denotes the tree after rooting it at node 2. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.
+- The first path contains nodes [2,1,3,4]: the prices are [7,8,6,10], and the sum of the prices is 31.
+- The second path contains the node [2] with the price [7].
+The difference between the maximum and minimum price sum is 24. It can be proved that 24 is the maximum cost.
+
+ +

Example 2:

+ +
+Input: n = 3, edges = [[0,1],[1,2]], price = [1,1,1]
+Output: 2
+Explanation: The diagram above denotes the tree after rooting it at node 0. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.
+- The first path contains nodes [0,1,2]: the prices are [1,1,1], and the sum of the prices is 3.
+- The second path contains node [0] with a price [1].
+The difference between the maximum and minimum price sum is 2. It can be proved that 2 is the maximum cost.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
  • +
  • edges.length == n - 1
  • +
  • 0 <= ai, bi <= n - 1
  • +
  • edges represents a valid tree.
  • +
  • price.length == n
  • +
  • 1 <= price[i] <= 105
  • +
diff --git a/leetcode-cn/problem (English)/最大子序列的分数(English) [maximum-subsequence-score].html b/leetcode-cn/problem (English)/最大子序列的分数(English) [maximum-subsequence-score].html new file mode 100644 index 00000000..abd729ae --- /dev/null +++ b/leetcode-cn/problem (English)/最大子序列的分数(English) [maximum-subsequence-score].html @@ -0,0 +1,46 @@ +

You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k.

+ +

For chosen indices i0, i1, ..., ik - 1, your score is defined as:

+ +
    +
  • The sum of the selected elements from nums1 multiplied with the minimum of the selected elements from nums2.
  • +
  • It can defined simply as: (nums1[i0] + nums1[i1] +...+ nums1[ik - 1]) * min(nums2[i0] , nums2[i1], ... ,nums2[ik - 1]).
  • +
+ +

Return the maximum possible score.

+ +

A subsequence of indices of an array is a set that can be derived from the set {0, 1, ..., n-1} by deleting some or no elements.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,3,3,2], nums2 = [2,1,3,4], k = 3
+Output: 12
+Explanation: 
+The four possible subsequence scores are:
+- We choose the indices 0, 1, and 2 with score = (1+3+3) * min(2,1,3) = 7.
+- We choose the indices 0, 1, and 3 with score = (1+3+2) * min(2,1,4) = 6. 
+- We choose the indices 0, 2, and 3 with score = (1+3+2) * min(2,3,4) = 12. 
+- We choose the indices 1, 2, and 3 with score = (3+3+2) * min(1,3,4) = 8.
+Therefore, we return the max score, which is 12.
+
+ +

Example 2:

+ +
+Input: nums1 = [4,2,3,1,1], nums2 = [7,5,10,9,6], k = 1
+Output: 30
+Explanation: 
+Choosing index 2 is optimal: nums1[2] * nums2[2] = 3 * 10 = 30 is the maximum possible score.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 1 <= n <= 105
  • +
  • 0 <= nums1[i], nums2[j] <= 105
  • +
  • 1 <= k <= n
  • +
diff --git a/leetcode-cn/problem (English)/最小公共值(English) [minimum-common-value].html b/leetcode-cn/problem (English)/最小公共值(English) [minimum-common-value].html new file mode 100644 index 00000000..f4af1de1 --- /dev/null +++ b/leetcode-cn/problem (English)/最小公共值(English) [minimum-common-value].html @@ -0,0 +1,29 @@ +

Given two integer arrays nums1 and nums2, sorted in non-decreasing order, return the minimum integer common to both arrays. If there is no common integer amongst nums1 and nums2, return -1.

+ +

Note that an integer is said to be common to nums1 and nums2 if both arrays have at least one occurrence of that integer.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3], nums2 = [2,4]
+Output: 2
+Explanation: The smallest element common to both arrays is 2, so we return 2.
+
+ +

Example 2:

+ +
+Input: nums1 = [1,2,3,6], nums2 = [2,3,4,5]
+Output: 2
+Explanation: There are two common elements in the array 2 and 3 out of which 2 is the smallest, so 2 is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 105
  • +
  • 1 <= nums1[i], nums2[j] <= 109
  • +
  • Both nums1 and nums2 are sorted in non-decreasing order.
  • +
diff --git a/leetcode-cn/problem (English)/根据第 K 场考试的分数排序(English) [sort-the-students-by-their-kth-score].html b/leetcode-cn/problem (English)/根据第 K 场考试的分数排序(English) [sort-the-students-by-their-kth-score].html new file mode 100644 index 00000000..ddf50379 --- /dev/null +++ b/leetcode-cn/problem (English)/根据第 K 场考试的分数排序(English) [sort-the-students-by-their-kth-score].html @@ -0,0 +1,39 @@ +

There is a class with m students and n exams. You are given a 0-indexed m x n integer matrix score, where each row represents one student and score[i][j] denotes the score the ith student got in the jth exam. The matrix score contains distinct integers only.

+ +

You are also given an integer k. Sort the students (i.e., the rows of the matrix) by their scores in the kth (0-indexed) exam from the highest to the lowest.

+ +

Return the matrix after sorting it.

+ +

 

+

Example 1:

+ +
+Input: score = [[10,6,9,1],[7,5,11,2],[4,8,3,15]], k = 2
+Output: [[7,5,11,2],[10,6,9,1],[4,8,3,15]]
+Explanation: In the above diagram, S denotes the student, while E denotes the exam.
+- The student with index 1 scored 11 in exam 2, which is the highest score, so they got first place.
+- The student with index 0 scored 9 in exam 2, which is the second highest score, so they got second place.
+- The student with index 2 scored 3 in exam 2, which is the lowest score, so they got third place.
+
+ +

Example 2:

+ +
+Input: score = [[3,4],[5,6]], k = 0
+Output: [[5,6],[3,4]]
+Explanation: In the above diagram, S denotes the student, while E denotes the exam.
+- The student with index 1 scored 5 in exam 0, which is the highest score, so they got first place.
+- The student with index 0 scored 3 in exam 0, which is the lowest score, so they got second place.
+
+ +

 

+

Constraints:

+ +
    +
  • m == score.length
  • +
  • n == score[i].length
  • +
  • 1 <= m, n <= 250
  • +
  • 1 <= score[i][j] <= 105
  • +
  • score consists of distinct integers.
  • +
  • 0 <= k < n
  • +
diff --git a/leetcode-cn/problem (English)/统计好子数组的数目(English) [count-the-number-of-good-subarrays].html b/leetcode-cn/problem (English)/统计好子数组的数目(English) [count-the-number-of-good-subarrays].html new file mode 100644 index 00000000..4311b1e3 --- /dev/null +++ b/leetcode-cn/problem (English)/统计好子数组的数目(English) [count-the-number-of-good-subarrays].html @@ -0,0 +1,34 @@ +

Given an integer array nums and an integer k, return the number of good subarrays of nums.

+ +

A subarray arr is good if it there are at least k pairs of indices (i, j) such that i < j and arr[i] == arr[j].

+ +

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

+ +

 

+

Example 1:

+ +
+Input: nums = [1,1,1,1,1], k = 10
+Output: 1
+Explanation: The only good subarray is the array nums itself.
+
+ +

Example 2:

+ +
+Input: nums = [3,1,4,3,2,2,4], k = 2
+Output: 4
+Explanation: There are 4 different good subarrays:
+- [3,1,4,3,2,2] that has 2 pairs.
+- [3,1,4,3,2,2,4] that has 3 pairs.
+- [1,4,3,2,2,4] that has 2 pairs.
+- [4,3,2,2,4] that has 2 pairs.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i], k <= 109
  • +
diff --git a/leetcode/origin-data.json b/leetcode/origin-data.json index 217daf2f..76f15ebb 100644 --- a/leetcode/origin-data.json +++ b/leetcode/origin-data.json @@ -1,11 +1,34 @@ { "user_name": "", "num_solved": 0, - "num_total": 2533, + "num_total": 2547, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, "stat_status_pairs": [ + { + "stat": { + "question_id": 2683, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Count the Number of Good Subsequences", + "question__title_slug": "count-the-number-of-good-subsequences", + "question__hide": false, + "total_acs": 222, + "total_submitted": 365, + "frontend_question_id": 2539, + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2672, @@ -15,10 +38,10 @@ "question__title": "Number of Good Binary Strings", "question__title_slug": "number-of-good-binary-strings", "question__hide": false, - "total_acs": 214, - "total_submitted": 313, + "total_acs": 362, + "total_submitted": 548, "frontend_question_id": 2533, - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -38,8 +61,8 @@ "question__title": "Maximum Frequency Score of a Subarray", "question__title_slug": "maximum-frequency-score-of-a-subarray", "question__hide": false, - "total_acs": 417, - "total_submitted": 1030, + "total_acs": 441, + "total_submitted": 1096, "frontend_question_id": 2524, "is_new_question": false }, @@ -61,8 +84,8 @@ "question__title": "Count the Number of K-Big Indices", "question__title_slug": "count-the-number-of-k-big-indices", "question__hide": false, - "total_acs": 426, - "total_submitted": 633, + "total_acs": 461, + "total_submitted": 689, "frontend_question_id": 2519, "is_new_question": false }, @@ -84,8 +107,8 @@ "question__title": "Check if There is a Path With Equal Number of 0's And 1's", "question__title_slug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "question__hide": false, - "total_acs": 732, - "total_submitted": 1252, + "total_acs": 777, + "total_submitted": 1365, "frontend_question_id": 2510, "is_new_question": false }, @@ -107,8 +130,8 @@ "question__title": "Bitwise OR of All Subsequence Sums", "question__title_slug": "bitwise-or-of-all-subsequence-sums", "question__hide": false, - "total_acs": 466, - "total_submitted": 749, + "total_acs": 482, + "total_submitted": 778, "frontend_question_id": 2505, "is_new_question": false }, @@ -130,8 +153,8 @@ "question__title": "Concatenate the Name and the Profession", "question__title_slug": "concatenate-the-name-and-the-profession", "question__hide": false, - "total_acs": 502, - "total_submitted": 991, + "total_acs": 582, + "total_submitted": 1148, "frontend_question_id": 2504, "is_new_question": false }, @@ -153,8 +176,8 @@ "question__title": "Time to Cross a Bridge", "question__title_slug": "time-to-cross-a-bridge", "question__hide": false, - "total_acs": 2234, - "total_submitted": 4273, + "total_acs": 2547, + "total_submitted": 4798, "frontend_question_id": 2532, "is_new_question": false }, @@ -176,8 +199,8 @@ "question__title": "Number of Subarrays Having Even Product", "question__title_slug": "number-of-subarrays-having-even-product", "question__hide": false, - "total_acs": 766, - "total_submitted": 1141, + "total_acs": 795, + "total_submitted": 1179, "frontend_question_id": 2495, "is_new_question": false }, @@ -199,8 +222,8 @@ "question__title": "Merge Overlapping Events in the Same Hall", "question__title_slug": "merge-overlapping-events-in-the-same-hall", "question__hide": false, - "total_acs": 162, - "total_submitted": 951, + "total_acs": 195, + "total_submitted": 1169, "frontend_question_id": 2494, "is_new_question": false }, @@ -213,6 +236,167 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2636, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Maximum Subsequence Score", + "question__title_slug": "maximum-subsequence-score", + "question__hide": false, + "total_acs": 4287, + "total_submitted": 13466, + "frontend_question_id": 2542, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2635, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Check if Point Is Reachable", + "question__title_slug": "check-if-point-is-reachable", + "question__hide": false, + "total_acs": 2798, + "total_submitted": 7682, + "frontend_question_id": 2543, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2634, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Common Value", + "question__title_slug": "minimum-common-value", + "question__hide": false, + "total_acs": 17863, + "total_submitted": 33816, + "frontend_question_id": 2540, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2633, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Cost to Split an Array", + "question__title_slug": "minimum-cost-to-split-an-array", + "question__hide": false, + "total_acs": 5356, + "total_submitted": 14894, + "frontend_question_id": 2547, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2632, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Apply Bitwise Operations to Make Strings Equal", + "question__title_slug": "apply-bitwise-operations-to-make-strings-equal", + "question__hide": false, + "total_acs": 10613, + "total_submitted": 27769, + "frontend_question_id": 2546, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2631, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Sort the Students by Their Kth Score", + "question__title_slug": "sort-the-students-by-their-kth-score", + "question__hide": false, + "total_acs": 15897, + "total_submitted": 18478, + "frontend_question_id": 2545, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2630, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Alternating Digit Sum", + "question__title_slug": "alternating-digit-sum", + "question__hide": false, + "total_acs": 18198, + "total_submitted": 26194, + "frontend_question_id": 2544, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2629, @@ -222,8 +406,8 @@ "question__title": "Number of Substrings With Fixed Ratio", "question__title_slug": "number-of-substrings-with-fixed-ratio", "question__hide": false, - "total_acs": 404, - "total_submitted": 664, + "total_acs": 414, + "total_submitted": 688, "frontend_question_id": 2489, "is_new_question": false }, @@ -245,8 +429,8 @@ "question__title": "Minimize the Maximum of Two Arrays", "question__title_slug": "minimize-the-maximum-of-two-arrays", "question__hide": false, - "total_acs": 3759, - "total_submitted": 14548, + "total_acs": 3932, + "total_submitted": 15065, "frontend_question_id": 2513, "is_new_question": false }, @@ -259,6 +443,98 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2627, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Difference Between Maximum and Minimum Price Sum", + "question__title_slug": "difference-between-maximum-and-minimum-price-sum", + "question__hide": false, + "total_acs": 3999, + "total_submitted": 11586, + "frontend_question_id": 2538, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2626, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Count the Number of Good Subarrays", + "question__title_slug": "count-the-number-of-good-subarrays", + "question__hide": false, + "total_acs": 9872, + "total_submitted": 21352, + "frontend_question_id": 2537, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2625, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Increment Submatrices by One", + "question__title_slug": "increment-submatrices-by-one", + "question__hide": false, + "total_acs": 14408, + "total_submitted": 30841, + "frontend_question_id": 2536, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2624, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Difference Between Element Sum and Digit Sum of an Array", + "question__title_slug": "difference-between-element-sum-and-digit-sum-of-an-array", + "question__hide": false, + "total_acs": 30633, + "total_submitted": 34698, + "frontend_question_id": 2535, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2623, @@ -268,8 +544,8 @@ "question__title": "Maximum XOR of Two Non-Overlapping Subtrees", "question__title_slug": "maximum-xor-of-two-non-overlapping-subtrees", "question__hide": false, - "total_acs": 321, - "total_submitted": 700, + "total_acs": 325, + "total_submitted": 706, "frontend_question_id": 2479, "is_new_question": false }, @@ -291,8 +567,8 @@ "question__title": "Form a Chemical Bond", "question__title_slug": "form-a-chemical-bond", "question__hide": false, - "total_acs": 664, - "total_submitted": 1257, + "total_acs": 723, + "total_submitted": 1411, "frontend_question_id": 2480, "is_new_question": false }, @@ -314,8 +590,8 @@ "question__title": "Find Xor-Beauty of Array", "question__title_slug": "find-xor-beauty-of-array", "question__hide": false, - "total_acs": 11142, - "total_submitted": 16396, + "total_acs": 11984, + "total_submitted": 17444, "frontend_question_id": 2527, "is_new_question": false }, @@ -337,8 +613,8 @@ "question__title": "Find Consecutive Integers from a Data Stream", "question__title_slug": "find-consecutive-integers-from-a-data-stream", "question__hide": false, - "total_acs": 12965, - "total_submitted": 30134, + "total_acs": 13937, + "total_submitted": 31788, "frontend_question_id": 2526, "is_new_question": false }, @@ -360,8 +636,8 @@ "question__title": "Categorize Box According to Criteria", "question__title_slug": "categorize-box-according-to-criteria", "question__hide": false, - "total_acs": 17198, - "total_submitted": 52428, + "total_acs": 18672, + "total_submitted": 56168, "frontend_question_id": 2525, "is_new_question": false }, @@ -383,8 +659,8 @@ "question__title": "Maximize the Minimum Powered City", "question__title_slug": "maximize-the-minimum-powered-city", "question__hide": false, - "total_acs": 3225, - "total_submitted": 10701, + "total_acs": 3683, + "total_submitted": 11849, "frontend_question_id": 2528, "is_new_question": false }, @@ -397,6 +673,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2617, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Time Taken to Cross the Door", + "question__title_slug": "time-taken-to-cross-the-door", + "question__hide": false, + "total_acs": 292, + "total_submitted": 403, + "frontend_question_id": 2534, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2616, @@ -406,8 +705,8 @@ "question__title": "Maximal Score After Applying K Operations", "question__title_slug": "maximal-score-after-applying-k-operations", "question__hide": false, - "total_acs": 17243, - "total_submitted": 41097, + "total_acs": 18964, + "total_submitted": 44553, "frontend_question_id": 2530, "is_new_question": false }, @@ -429,8 +728,8 @@ "question__title": "Make Number of Distinct Characters Equal", "question__title_slug": "make-number-of-distinct-characters-equal", "question__hide": false, - "total_acs": 10867, - "total_submitted": 44352, + "total_acs": 12120, + "total_submitted": 48148, "frontend_question_id": 2531, "is_new_question": false }, @@ -452,8 +751,8 @@ "question__title": "Maximum Count of Positive Integer and Negative Integer", "question__title_slug": "maximum-count-of-positive-integer-and-negative-integer", "question__hide": false, - "total_acs": 24497, - "total_submitted": 30960, + "total_acs": 30621, + "total_submitted": 39297, "frontend_question_id": 2529, "is_new_question": false }, @@ -475,8 +774,8 @@ "question__title": "Customers With Strictly Increasing Purchases", "question__title_slug": "customers-with-strictly-increasing-purchases", "question__hide": false, - "total_acs": 435, - "total_submitted": 773, + "total_acs": 490, + "total_submitted": 907, "frontend_question_id": 2474, "is_new_question": false }, @@ -498,8 +797,8 @@ "question__title": "Minimum Cost to Buy Apples", "question__title_slug": "minimum-cost-to-buy-apples", "question__hide": false, - "total_acs": 679, - "total_submitted": 1070, + "total_acs": 701, + "total_submitted": 1101, "frontend_question_id": 2473, "is_new_question": false }, @@ -521,8 +820,8 @@ "question__title": "Closest Prime Numbers in Range", "question__title_slug": "closest-prime-numbers-in-range", "question__hide": false, - "total_acs": 13286, - "total_submitted": 36096, + "total_acs": 14009, + "total_submitted": 37796, "frontend_question_id": 2523, "is_new_question": false }, @@ -544,8 +843,8 @@ "question__title": "Distinct Prime Factors of Product of Array", "question__title_slug": "distinct-prime-factors-of-product-of-array", "question__hide": false, - "total_acs": 17035, - "total_submitted": 34333, + "total_acs": 17688, + "total_submitted": 35532, "frontend_question_id": 2521, "is_new_question": false }, @@ -567,8 +866,8 @@ "question__title": "Count the Digits That Divide a Number", "question__title_slug": "count-the-digits-that-divide-a-number", "question__hide": false, - "total_acs": 23798, - "total_submitted": 28213, + "total_acs": 26365, + "total_submitted": 31092, "frontend_question_id": 2520, "is_new_question": false }, @@ -590,8 +889,8 @@ "question__title": "Minimum Subarrays in a Valid Split", "question__title_slug": "minimum-subarrays-in-a-valid-split", "question__hide": false, - "total_acs": 593, - "total_submitted": 1035, + "total_acs": 602, + "total_submitted": 1056, "frontend_question_id": 2464, "is_new_question": false }, @@ -613,8 +912,8 @@ "question__title": "Difference Between Ones and Zeros in Row and Column", "question__title_slug": "difference-between-ones-and-zeros-in-row-and-column", "question__hide": false, - "total_acs": 14362, - "total_submitted": 17944, + "total_acs": 14810, + "total_submitted": 18510, "frontend_question_id": 2482, "is_new_question": false }, @@ -636,8 +935,8 @@ "question__title": "Count Anagrams", "question__title_slug": "count-anagrams", "question__hide": false, - "total_acs": 4824, - "total_submitted": 14037, + "total_acs": 4984, + "total_submitted": 14527, "frontend_question_id": 2514, "is_new_question": false }, @@ -650,6 +949,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2604, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Operations to Make Array Equal II", + "question__title_slug": "minimum-operations-to-make-array-equal-ii", + "question__hide": false, + "total_acs": 11351, + "total_submitted": 42759, + "frontend_question_id": 2541, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2603, @@ -659,8 +981,8 @@ "question__title": "Reward Top K Students", "question__title_slug": "reward-top-k-students", "question__hide": false, - "total_acs": 10568, - "total_submitted": 22698, + "total_acs": 10942, + "total_submitted": 23437, "frontend_question_id": 2512, "is_new_question": false }, @@ -682,8 +1004,8 @@ "question__title": "Maximum Enemy Forts That Can Be Captured", "question__title_slug": "maximum-enemy-forts-that-can-be-captured", "question__hide": false, - "total_acs": 12948, - "total_submitted": 35318, + "total_acs": 13431, + "total_submitted": 36364, "frontend_question_id": 2511, "is_new_question": false }, @@ -705,8 +1027,8 @@ "question__title": "Number of Great Partitions", "question__title_slug": "number-of-great-partitions", "question__hide": false, - "total_acs": 4465, - "total_submitted": 13487, + "total_acs": 4623, + "total_submitted": 13969, "frontend_question_id": 2518, "is_new_question": false }, @@ -728,8 +1050,8 @@ "question__title": "Maximum Tastiness of Candy Basket", "question__title_slug": "maximum-tastiness-of-candy-basket", "question__hide": false, - "total_acs": 8077, - "total_submitted": 12569, + "total_acs": 8522, + "total_submitted": 13232, "frontend_question_id": 2517, "is_new_question": false }, @@ -751,8 +1073,8 @@ "question__title": "Take K of Each Character From Left and Right", "question__title_slug": "take-k-of-each-character-from-left-and-right", "question__hide": false, - "total_acs": 9124, - "total_submitted": 27434, + "total_acs": 9513, + "total_submitted": 28319, "frontend_question_id": 2516, "is_new_question": false }, @@ -774,8 +1096,8 @@ "question__title": "Shortest Distance to Target String in a Circular Array", "question__title_slug": "shortest-distance-to-target-string-in-a-circular-array", "question__hide": false, - "total_acs": 16667, - "total_submitted": 34277, + "total_acs": 17376, + "total_submitted": 35625, "frontend_question_id": 2515, "is_new_question": false }, @@ -797,8 +1119,8 @@ "question__title": "Cycle Length Queries in a Tree", "question__title_slug": "cycle-length-queries-in-a-tree", "question__hide": false, - "total_acs": 7389, - "total_submitted": 13088, + "total_acs": 7747, + "total_submitted": 13564, "frontend_question_id": 2509, "is_new_question": false }, @@ -820,8 +1142,8 @@ "question__title": "Add Edges to Make Degrees of All Nodes Even", "question__title_slug": "add-edges-to-make-degrees-of-all-nodes-even", "question__hide": false, - "total_acs": 8263, - "total_submitted": 25537, + "total_acs": 8425, + "total_submitted": 25965, "frontend_question_id": 2508, "is_new_question": false }, @@ -843,8 +1165,8 @@ "question__title": "Smallest Value After Replacing With Sum of Prime Factors", "question__title_slug": "smallest-value-after-replacing-with-sum-of-prime-factors", "question__hide": false, - "total_acs": 14624, - "total_submitted": 30308, + "total_acs": 14963, + "total_submitted": 30935, "frontend_question_id": 2507, "is_new_question": false }, @@ -866,8 +1188,8 @@ "question__title": "Count Pairs Of Similar Strings", "question__title_slug": "count-pairs-of-similar-strings", "question__hide": false, - "total_acs": 20147, - "total_submitted": 28784, + "total_acs": 21156, + "total_submitted": 30169, "frontend_question_id": 2506, "is_new_question": false }, @@ -889,8 +1211,8 @@ "question__title": "Number of Distinct Binary Strings After Applying Operations", "question__title_slug": "number-of-distinct-binary-strings-after-applying-operations", "question__hide": false, - "total_acs": 486, - "total_submitted": 724, + "total_acs": 496, + "total_submitted": 740, "frontend_question_id": 2450, "is_new_question": false }, @@ -912,8 +1234,8 @@ "question__title": "Minimum Total Cost to Make Arrays Unequal", "question__title_slug": "minimum-total-cost-to-make-arrays-unequal", "question__hide": false, - "total_acs": 2278, - "total_submitted": 5225, + "total_acs": 2337, + "total_submitted": 5350, "frontend_question_id": 2499, "is_new_question": false }, @@ -935,8 +1257,8 @@ "question__title": "Frog Jump II", "question__title_slug": "frog-jump-ii", "question__hide": false, - "total_acs": 8979, - "total_submitted": 14905, + "total_acs": 9227, + "total_submitted": 15295, "frontend_question_id": 2498, "is_new_question": false }, @@ -958,8 +1280,8 @@ "question__title": "Maximum Star Sum of a Graph", "question__title_slug": "maximum-star-sum-of-a-graph", "question__hide": false, - "total_acs": 10474, - "total_submitted": 27327, + "total_acs": 10756, + "total_submitted": 28002, "frontend_question_id": 2497, "is_new_question": false }, @@ -981,8 +1303,8 @@ "question__title": "Maximum Value of a String in an Array", "question__title_slug": "maximum-value-of-a-string-in-an-array", "question__hide": false, - "total_acs": 18296, - "total_submitted": 25358, + "total_acs": 19235, + "total_submitted": 26721, "frontend_question_id": 2496, "is_new_question": false }, @@ -1004,8 +1326,8 @@ "question__title": "Maximum Number of Points From Grid Queries", "question__title_slug": "maximum-number-of-points-from-grid-queries", "question__hide": false, - "total_acs": 5585, - "total_submitted": 15284, + "total_acs": 5675, + "total_submitted": 15560, "frontend_question_id": 2503, "is_new_question": false }, @@ -1027,8 +1349,8 @@ "question__title": "Design Memory Allocator", "question__title_slug": "design-memory-allocator", "question__hide": false, - "total_acs": 9859, - "total_submitted": 19017, + "total_acs": 10031, + "total_submitted": 19289, "frontend_question_id": 2502, "is_new_question": false }, @@ -1050,8 +1372,8 @@ "question__title": "Longest Square Streak in an Array", "question__title_slug": "longest-square-streak-in-an-array", "question__hide": false, - "total_acs": 17039, - "total_submitted": 43015, + "total_acs": 17453, + "total_submitted": 44051, "frontend_question_id": 2501, "is_new_question": false }, @@ -1073,8 +1395,8 @@ "question__title": "Delete Greatest Value in Each Row", "question__title_slug": "delete-greatest-value-in-each-row", "question__hide": false, - "total_acs": 21661, - "total_submitted": 26127, + "total_acs": 22939, + "total_submitted": 27690, "frontend_question_id": 2500, "is_new_question": false }, @@ -1096,8 +1418,8 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 1026, - "total_submitted": 1430, + "total_acs": 1059, + "total_submitted": 1474, "frontend_question_id": 2445, "is_new_question": false }, @@ -1119,8 +1441,8 @@ "question__title": "Divide Nodes Into the Maximum Number of Groups", "question__title_slug": "divide-nodes-into-the-maximum-number-of-groups", "question__hide": false, - "total_acs": 4506, - "total_submitted": 12222, + "total_acs": 4575, + "total_submitted": 12394, "frontend_question_id": 2493, "is_new_question": false }, @@ -1136,14 +1458,14 @@ { "stat": { "question_id": 2582, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "minimum-score-of-a-path-between-two-cities", + "question__article__has_video_solution": false, "question__title": "Minimum Score of a Path Between Two Cities", "question__title_slug": "minimum-score-of-a-path-between-two-cities", "question__hide": false, - "total_acs": 14148, - "total_submitted": 30648, + "total_acs": 14504, + "total_submitted": 31418, "frontend_question_id": 2492, "is_new_question": false }, @@ -1165,8 +1487,8 @@ "question__title": "Divide Players Into Teams of Equal Skill", "question__title_slug": "divide-players-into-teams-of-equal-skill", "question__hide": false, - "total_acs": 20143, - "total_submitted": 34663, + "total_acs": 20628, + "total_submitted": 35425, "frontend_question_id": 2491, "is_new_question": false }, @@ -1188,8 +1510,8 @@ "question__title": "Circular Sentence", "question__title_slug": "circular-sentence", "question__hide": false, - "total_acs": 23293, - "total_submitted": 35685, + "total_acs": 23975, + "total_submitted": 36769, "frontend_question_id": 2490, "is_new_question": false }, @@ -1211,8 +1533,8 @@ "question__title": "Minimum Split Into Subarrays With GCD Greater Than One", "question__title_slug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "question__hide": false, - "total_acs": 1140, - "total_submitted": 1520, + "total_acs": 1186, + "total_submitted": 1578, "frontend_question_id": 2436, "is_new_question": false }, @@ -1234,8 +1556,8 @@ "question__title": "Count Palindromic Subsequences", "question__title_slug": "count-palindromic-subsequences", "question__hide": false, - "total_acs": 4268, - "total_submitted": 13320, + "total_acs": 4402, + "total_submitted": 13570, "frontend_question_id": 2484, "is_new_question": false }, @@ -1257,8 +1579,8 @@ "question__title": "Minimum Penalty for a Shop", "question__title_slug": "minimum-penalty-for-a-shop", "question__hide": false, - "total_acs": 11489, - "total_submitted": 20732, + "total_acs": 11682, + "total_submitted": 21049, "frontend_question_id": 2483, "is_new_question": false }, @@ -1280,8 +1602,8 @@ "question__title": "Minimum Cuts to Divide a Circle", "question__title_slug": "minimum-cuts-to-divide-a-circle", "question__hide": false, - "total_acs": 17289, - "total_submitted": 33166, + "total_acs": 17730, + "total_submitted": 33948, "frontend_question_id": 2481, "is_new_question": false }, @@ -1303,8 +1625,8 @@ "question__title": "Count Subarrays With Median K", "question__title_slug": "count-subarrays-with-median-k", "question__hide": false, - "total_acs": 7398, - "total_submitted": 17552, + "total_acs": 7491, + "total_submitted": 17727, "frontend_question_id": 2488, "is_new_question": false }, @@ -1326,8 +1648,8 @@ "question__title": "Remove Nodes From Linked List", "question__title_slug": "remove-nodes-from-linked-list", "question__hide": false, - "total_acs": 19551, - "total_submitted": 27828, + "total_acs": 20545, + "total_submitted": 29350, "frontend_question_id": 2487, "is_new_question": false }, @@ -1349,8 +1671,8 @@ "question__title": "Append Characters to String to Make Subsequence", "question__title_slug": "append-characters-to-string-to-make-subsequence", "question__hide": false, - "total_acs": 17600, - "total_submitted": 27556, + "total_acs": 18001, + "total_submitted": 28159, "frontend_question_id": 2486, "is_new_question": false }, @@ -1372,8 +1694,8 @@ "question__title": "Find the Pivot Integer", "question__title_slug": "find-the-pivot-integer", "question__hide": false, - "total_acs": 25357, - "total_submitted": 31710, + "total_acs": 26393, + "total_submitted": 33066, "frontend_question_id": 2485, "is_new_question": false }, @@ -1395,8 +1717,8 @@ "question__title": "Maximize Total Tastiness of Purchased Fruits", "question__title_slug": "maximize-total-tastiness-of-purchased-fruits", "question__hide": false, - "total_acs": 1178, - "total_submitted": 1714, + "total_acs": 1201, + "total_submitted": 1765, "frontend_question_id": 2431, "is_new_question": false }, @@ -1418,8 +1740,8 @@ "question__title": "Number of Beautiful Partitions", "question__title_slug": "number-of-beautiful-partitions", "question__hide": false, - "total_acs": 6645, - "total_submitted": 21564, + "total_acs": 6729, + "total_submitted": 21832, "frontend_question_id": 2478, "is_new_question": false }, @@ -1435,14 +1757,14 @@ { "stat": { "question_id": 2568, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "minimum-fuel-cost-to-report-to-the-capital", + "question__article__has_video_solution": false, "question__title": "Minimum Fuel Cost to Report to the Capital", "question__title_slug": "minimum-fuel-cost-to-report-to-the-capital", "question__hide": false, - "total_acs": 9026, - "total_submitted": 16906, + "total_acs": 9261, + "total_submitted": 17353, "frontend_question_id": 2477, "is_new_question": false }, @@ -1464,8 +1786,8 @@ "question__title": "Closest Nodes Queries in a Binary Search Tree", "question__title_slug": "closest-nodes-queries-in-a-binary-search-tree", "question__hide": false, - "total_acs": 13799, - "total_submitted": 33788, + "total_acs": 13990, + "total_submitted": 34251, "frontend_question_id": 2476, "is_new_question": false }, @@ -1487,8 +1809,8 @@ "question__title": "Number of Unequal Triplets in Array", "question__title_slug": "number-of-unequal-triplets-in-array", "question__hide": false, - "total_acs": 21952, - "total_submitted": 31154, + "total_acs": 22485, + "total_submitted": 31855, "frontend_question_id": 2475, "is_new_question": false }, @@ -1510,8 +1832,8 @@ "question__title": "Merge Operations to Turn Array Into a Palindrome", "question__title_slug": "merge-operations-to-turn-array-into-a-palindrome", "question__hide": false, - "total_acs": 1023, - "total_submitted": 1436, + "total_acs": 1053, + "total_submitted": 1486, "frontend_question_id": 2422, "is_new_question": false }, @@ -1533,8 +1855,8 @@ "question__title": "Most Profitable Path in a Tree", "question__title_slug": "most-profitable-path-in-a-tree", "question__hide": false, - "total_acs": 5856, - "total_submitted": 12245, + "total_acs": 6170, + "total_submitted": 12848, "frontend_question_id": 2467, "is_new_question": false }, @@ -1556,8 +1878,8 @@ "question__title": "Split Message Based on Limit", "question__title_slug": "split-message-based-on-limit", "question__hide": false, - "total_acs": 3490, - "total_submitted": 7364, + "total_acs": 3518, + "total_submitted": 7438, "frontend_question_id": 2468, "is_new_question": false }, @@ -1579,8 +1901,8 @@ "question__title": "Count Ways To Build Good Strings", "question__title_slug": "count-ways-to-build-good-strings", "question__hide": false, - "total_acs": 10456, - "total_submitted": 24885, + "total_acs": 10566, + "total_submitted": 25158, "frontend_question_id": 2466, "is_new_question": false }, @@ -1602,8 +1924,8 @@ "question__title": "Number of Distinct Averages", "question__title_slug": "number-of-distinct-averages", "question__hide": false, - "total_acs": 21973, - "total_submitted": 37399, + "total_acs": 22467, + "total_submitted": 38230, "frontend_question_id": 2465, "is_new_question": false }, @@ -1625,8 +1947,8 @@ "question__title": "Closest Fair Integer", "question__title_slug": "closest-fair-integer", "question__hide": false, - "total_acs": 632, - "total_submitted": 1425, + "total_acs": 640, + "total_submitted": 1443, "frontend_question_id": 2417, "is_new_question": false }, @@ -1648,8 +1970,8 @@ "question__title": "Maximum Number of Non-overlapping Palindrome Substrings", "question__title_slug": "maximum-number-of-non-overlapping-palindrome-substrings", "question__hide": false, - "total_acs": 8512, - "total_submitted": 22643, + "total_acs": 8674, + "total_submitted": 23018, "frontend_question_id": 2472, "is_new_question": false }, @@ -1671,8 +1993,8 @@ "question__title": "Minimum Number of Operations to Sort a Binary Tree by Level", "question__title_slug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "question__hide": false, - "total_acs": 14115, - "total_submitted": 22612, + "total_acs": 14302, + "total_submitted": 22925, "frontend_question_id": 2471, "is_new_question": false }, @@ -1694,8 +2016,8 @@ "question__title": "Number of Subarrays With LCM Equal to K", "question__title_slug": "number-of-subarrays-with-lcm-equal-to-k", "question__hide": false, - "total_acs": 17088, - "total_submitted": 44413, + "total_acs": 17224, + "total_submitted": 44808, "frontend_question_id": 2470, "is_new_question": false }, @@ -1717,8 +2039,8 @@ "question__title": "Convert the Temperature", "question__title_slug": "convert-the-temperature", "question__hide": false, - "total_acs": 47364, - "total_submitted": 52886, + "total_acs": 50750, + "total_submitted": 56659, "frontend_question_id": 2469, "is_new_question": false }, @@ -1740,8 +2062,8 @@ "question__title": "Design SQL", "question__title_slug": "design-sql", "question__hide": false, - "total_acs": 1040, - "total_submitted": 1254, + "total_acs": 1057, + "total_submitted": 1277, "frontend_question_id": 2408, "is_new_question": false }, @@ -1763,8 +2085,8 @@ "question__title": "Minimum Total Distance Traveled", "question__title_slug": "minimum-total-distance-traveled", "question__hide": false, - "total_acs": 5404, - "total_submitted": 13182, + "total_acs": 5469, + "total_submitted": 13337, "frontend_question_id": 2463, "is_new_question": false }, @@ -1786,8 +2108,8 @@ "question__title": "Total Cost to Hire K Workers", "question__title_slug": "total-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 13092, - "total_submitted": 35029, + "total_acs": 13220, + "total_submitted": 35355, "frontend_question_id": 2462, "is_new_question": false }, @@ -1809,8 +2131,8 @@ "question__title": "Maximum Sum of Distinct Subarrays With Length K", "question__title_slug": "maximum-sum-of-distinct-subarrays-with-length-k", "question__hide": false, - "total_acs": 20634, - "total_submitted": 59523, + "total_acs": 20970, + "total_submitted": 60459, "frontend_question_id": 2461, "is_new_question": false }, @@ -1832,8 +2154,8 @@ "question__title": "Apply Operations to an Array", "question__title_slug": "apply-operations-to-an-array", "question__hide": false, - "total_acs": 30128, - "total_submitted": 44832, + "total_acs": 30864, + "total_submitted": 45874, "frontend_question_id": 2460, "is_new_question": false }, @@ -1855,8 +2177,8 @@ "question__title": "Words Within Two Edits of Dictionary", "question__title_slug": "words-within-two-edits-of-dictionary", "question__hide": false, - "total_acs": 14593, - "total_submitted": 24148, + "total_acs": 14729, + "total_submitted": 24410, "frontend_question_id": 2452, "is_new_question": false }, @@ -1878,8 +2200,8 @@ "question__title": "Next Greater Element IV", "question__title_slug": "next-greater-element-iv", "question__hide": false, - "total_acs": 5700, - "total_submitted": 14370, + "total_acs": 5771, + "total_submitted": 14545, "frontend_question_id": 2454, "is_new_question": false }, @@ -1901,8 +2223,8 @@ "question__title": "Destroy Sequential Targets", "question__title_slug": "destroy-sequential-targets", "question__hide": false, - "total_acs": 10735, - "total_submitted": 28575, + "total_acs": 10839, + "total_submitted": 28808, "frontend_question_id": 2453, "is_new_question": false }, @@ -1924,8 +2246,8 @@ "question__title": "Odd String Difference", "question__title_slug": "odd-string-difference", "question__hide": false, - "total_acs": 18160, - "total_submitted": 30173, + "total_acs": 18459, + "total_submitted": 30677, "frontend_question_id": 2451, "is_new_question": false }, @@ -1947,8 +2269,8 @@ "question__title": "Number of Subarrays With GCD Equal to K", "question__title_slug": "number-of-subarrays-with-gcd-equal-to-k", "question__hide": false, - "total_acs": 18047, - "total_submitted": 37216, + "total_acs": 18182, + "total_submitted": 37520, "frontend_question_id": 2447, "is_new_question": false }, @@ -1970,8 +2292,8 @@ "question__title": "Height of Binary Tree After Subtree Removal Queries", "question__title_slug": "height-of-binary-tree-after-subtree-removal-queries", "question__hide": false, - "total_acs": 7229, - "total_submitted": 19990, + "total_acs": 7547, + "total_submitted": 20551, "frontend_question_id": 2458, "is_new_question": false }, @@ -1993,8 +2315,8 @@ "question__title": "Minimum Addition to Make Integer Beautiful", "question__title_slug": "minimum-addition-to-make-integer-beautiful", "question__hide": false, - "total_acs": 14332, - "total_submitted": 38943, + "total_acs": 14419, + "total_submitted": 39228, "frontend_question_id": 2457, "is_new_question": false }, @@ -2016,8 +2338,8 @@ "question__title": "Most Popular Video Creator", "question__title_slug": "most-popular-video-creator", "question__hide": false, - "total_acs": 16800, - "total_submitted": 38322, + "total_acs": 16924, + "total_submitted": 38626, "frontend_question_id": 2456, "is_new_question": false }, @@ -2039,8 +2361,8 @@ "question__title": "Average Value of Even Numbers That Are Divisible by Three", "question__title_slug": "average-value-of-even-numbers-that-are-divisible-by-three", "question__hide": false, - "total_acs": 30740, - "total_submitted": 52466, + "total_acs": 31306, + "total_submitted": 53317, "frontend_question_id": 2455, "is_new_question": false }, @@ -2062,8 +2384,8 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 26342, - "total_submitted": 57929, + "total_acs": 26608, + "total_submitted": 58411, "frontend_question_id": 2443, "is_new_question": false }, @@ -2085,8 +2407,8 @@ "question__title": "Minimum Number of Operations to Make Arrays Similar", "question__title_slug": "minimum-number-of-operations-to-make-arrays-similar", "question__hide": false, - "total_acs": 8066, - "total_submitted": 12494, + "total_acs": 8193, + "total_submitted": 12698, "frontend_question_id": 2449, "is_new_question": false }, @@ -2108,8 +2430,8 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 11376, - "total_submitted": 32777, + "total_acs": 11470, + "total_submitted": 33015, "frontend_question_id": 2448, "is_new_question": false }, @@ -2131,8 +2453,8 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 681, - "total_submitted": 1347, + "total_acs": 701, + "total_submitted": 1385, "frontend_question_id": 2403, "is_new_question": false }, @@ -2154,8 +2476,8 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 24816, - "total_submitted": 49933, + "total_acs": 25230, + "total_submitted": 50687, "frontend_question_id": 2446, "is_new_question": false }, @@ -2177,8 +2499,8 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 1848, - "total_submitted": 2496, + "total_acs": 1914, + "total_submitted": 2586, "frontend_question_id": 2393, "is_new_question": false }, @@ -2200,8 +2522,8 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 1367, - "total_submitted": 2976, + "total_acs": 1417, + "total_submitted": 3091, "frontend_question_id": 2394, "is_new_question": false }, @@ -2223,8 +2545,8 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 13150, - "total_submitted": 22435, + "total_acs": 13313, + "total_submitted": 22706, "frontend_question_id": 2425, "is_new_question": false }, @@ -2246,8 +2568,8 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 21191, - "total_submitted": 113908, + "total_acs": 21724, + "total_submitted": 117180, "frontend_question_id": 2423, "is_new_question": false }, @@ -2269,8 +2591,8 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 3810, - "total_submitted": 7004, + "total_acs": 3876, + "total_submitted": 7137, "frontend_question_id": 2440, "is_new_question": false }, @@ -2292,8 +2614,8 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 9565, - "total_submitted": 28315, + "total_acs": 9778, + "total_submitted": 28952, "frontend_question_id": 2439, "is_new_question": false }, @@ -2315,8 +2637,8 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 12538, - "total_submitted": 32359, + "total_acs": 12619, + "total_submitted": 32546, "frontend_question_id": 2438, "is_new_question": false }, @@ -2338,8 +2660,8 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 16456, - "total_submitted": 38682, + "total_acs": 16617, + "total_submitted": 38964, "frontend_question_id": 2437, "is_new_question": false }, @@ -2361,8 +2683,8 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 11292, - "total_submitted": 25620, + "total_acs": 11427, + "total_submitted": 25875, "frontend_question_id": 2444, "is_new_question": false }, @@ -2384,8 +2706,8 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 6994, - "total_submitted": 33458, + "total_acs": 7118, + "total_submitted": 33818, "frontend_question_id": 2407, "is_new_question": false }, @@ -2407,8 +2729,8 @@ "question__title": "Count Number of Distinct Integers After Reverse Operations", "question__title_slug": "count-number-of-distinct-integers-after-reverse-operations", "question__hide": false, - "total_acs": 30857, - "total_submitted": 39112, + "total_acs": 31703, + "total_submitted": 40165, "frontend_question_id": 2442, "is_new_question": false }, @@ -2430,8 +2752,8 @@ "question__title": "Largest Positive Integer That Exists With Its Negative", "question__title_slug": "largest-positive-integer-that-exists-with-its-negative", "question__hide": false, - "total_acs": 33415, - "total_submitted": 49246, + "total_acs": 34055, + "total_submitted": 50194, "frontend_question_id": 2441, "is_new_question": false }, @@ -2453,8 +2775,8 @@ "question__title": "Change Null Values in a Table to the Previous Value", "question__title_slug": "change-null-values-in-a-table-to-the-previous-value", "question__hide": false, - "total_acs": 1242, - "total_submitted": 1718, + "total_acs": 1290, + "total_submitted": 1774, "frontend_question_id": 2388, "is_new_question": false }, @@ -2476,8 +2798,8 @@ "question__title": "Median of a Row Wise Sorted Matrix", "question__title_slug": "median-of-a-row-wise-sorted-matrix", "question__hide": false, - "total_acs": 1127, - "total_submitted": 1661, + "total_acs": 1161, + "total_submitted": 1703, "frontend_question_id": 2387, "is_new_question": false }, @@ -2499,8 +2821,8 @@ "question__title": "Paths in Matrix Whose Sum Is Divisible by K", "question__title_slug": "paths-in-matrix-whose-sum-is-divisible-by-k", "question__hide": false, - "total_acs": 14079, - "total_submitted": 34024, + "total_acs": 14211, + "total_submitted": 34343, "frontend_question_id": 2435, "is_new_question": false }, @@ -2522,8 +2844,8 @@ "question__title": "Using a Robot to Print the Lexicographically Smallest String", "question__title_slug": "using-a-robot-to-print-the-lexicographically-smallest-string", "question__hide": false, - "total_acs": 13290, - "total_submitted": 34602, + "total_acs": 13389, + "total_submitted": 34813, "frontend_question_id": 2434, "is_new_question": false }, @@ -2545,8 +2867,8 @@ "question__title": "Find The Original Array of Prefix Xor", "question__title_slug": "find-the-original-array-of-prefix-xor", "question__hide": false, - "total_acs": 27115, - "total_submitted": 31668, + "total_acs": 27778, + "total_submitted": 32450, "frontend_question_id": 2433, "is_new_question": false }, @@ -2568,8 +2890,8 @@ "question__title": "The Employee That Worked on the Longest Task", "question__title_slug": "the-employee-that-worked-on-the-longest-task", "question__hide": false, - "total_acs": 25395, - "total_submitted": 51553, + "total_acs": 25596, + "total_submitted": 51887, "frontend_question_id": 2432, "is_new_question": false }, @@ -2591,8 +2913,8 @@ "question__title": "Choose Edges to Maximize Score in a Tree", "question__title_slug": "choose-edges-to-maximize-score-in-a-tree", "question__hide": false, - "total_acs": 741, - "total_submitted": 1217, + "total_acs": 772, + "total_submitted": 1270, "frontend_question_id": 2378, "is_new_question": false }, @@ -2614,8 +2936,8 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 2271, - "total_submitted": 2842, + "total_acs": 2364, + "total_submitted": 2958, "frontend_question_id": 2377, "is_new_question": false }, @@ -2637,8 +2959,8 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 1908, - "total_submitted": 2184, + "total_acs": 1980, + "total_submitted": 2260, "frontend_question_id": 2372, "is_new_question": false }, @@ -2660,8 +2982,8 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 7903, - "total_submitted": 18456, + "total_acs": 8079, + "total_submitted": 18916, "frontend_question_id": 2426, "is_new_question": false }, @@ -2683,8 +3005,8 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 13976, - "total_submitted": 25970, + "total_acs": 14110, + "total_submitted": 26203, "frontend_question_id": 2424, "is_new_question": false }, @@ -2706,8 +3028,8 @@ "question__title": "Partition String Into Substrings With Values at Most K", "question__title_slug": "partition-string-into-substrings-with-values-at-most-k", "question__hide": false, - "total_acs": 13706, - "total_submitted": 29202, + "total_acs": 14243, + "total_submitted": 30306, "frontend_question_id": 2522, "is_new_question": false }, @@ -2729,8 +3051,8 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 9857, - "total_submitted": 30530, + "total_acs": 9912, + "total_submitted": 30705, "frontend_question_id": 2430, "is_new_question": false }, @@ -2752,8 +3074,8 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 16793, - "total_submitted": 39891, + "total_acs": 16923, + "total_submitted": 40115, "frontend_question_id": 2429, "is_new_question": false }, @@ -2775,8 +3097,8 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 24733, - "total_submitted": 33345, + "total_acs": 25091, + "total_submitted": 33860, "frontend_question_id": 2428, "is_new_question": false }, @@ -2798,8 +3120,8 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 38762, - "total_submitted": 48508, + "total_acs": 39740, + "total_submitted": 49712, "frontend_question_id": 2427, "is_new_question": false }, @@ -2821,8 +3143,8 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 772, - "total_submitted": 1093, + "total_acs": 792, + "total_submitted": 1118, "frontend_question_id": 2371, "is_new_question": false }, @@ -2844,8 +3166,8 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 8541, - "total_submitted": 21073, + "total_acs": 45609, + "total_submitted": 78663, "frontend_question_id": 2421, "is_new_question": false }, @@ -2867,8 +3189,8 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 17438, - "total_submitted": 46634, + "total_acs": 17583, + "total_submitted": 46999, "frontend_question_id": 2420, "is_new_question": false }, @@ -2890,8 +3212,8 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 20428, - "total_submitted": 42714, + "total_acs": 20549, + "total_submitted": 42944, "frontend_question_id": 2419, "is_new_question": false }, @@ -2913,8 +3235,8 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 53381, - "total_submitted": 65531, + "total_acs": 55775, + "total_submitted": 68511, "frontend_question_id": 2418, "is_new_question": false }, @@ -2936,8 +3258,8 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 1268, - "total_submitted": 1495, + "total_acs": 1303, + "total_submitted": 1542, "frontend_question_id": 2362, "is_new_question": false }, @@ -2959,8 +3281,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 3211, - "total_submitted": 4211, + "total_acs": 3372, + "total_submitted": 4429, "frontend_question_id": 2361, "is_new_question": false }, @@ -2982,8 +3304,8 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 7909, - "total_submitted": 20154, + "total_acs": 7957, + "total_submitted": 20315, "frontend_question_id": 2412, "is_new_question": false }, @@ -3005,8 +3327,8 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 8806, - "total_submitted": 21439, + "total_acs": 8899, + "total_submitted": 21646, "frontend_question_id": 2411, "is_new_question": false }, @@ -3028,8 +3350,8 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 21024, - "total_submitted": 34856, + "total_acs": 21258, + "total_submitted": 35202, "frontend_question_id": 2410, "is_new_question": false }, @@ -3051,8 +3373,8 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 15768, - "total_submitted": 36536, + "total_acs": 15918, + "total_submitted": 36817, "frontend_question_id": 2409, "is_new_question": false }, @@ -3074,8 +3396,8 @@ "question__title": "Number of Unique Subjects Taught by Each Teacher", "question__title_slug": "number-of-unique-subjects-taught-by-each-teacher", "question__hide": false, - "total_acs": 3685, - "total_submitted": 4029, + "total_acs": 3835, + "total_submitted": 4210, "frontend_question_id": 2356, "is_new_question": false }, @@ -3097,8 +3419,8 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 17757, - "total_submitted": 41308, + "total_acs": 18037, + "total_submitted": 41816, "frontend_question_id": 2416, "is_new_question": false }, @@ -3120,8 +3442,8 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 27815, - "total_submitted": 36579, + "total_acs": 28315, + "total_submitted": 37163, "frontend_question_id": 2415, "is_new_question": false }, @@ -3143,8 +3465,8 @@ "question__title": "Length of the Longest Alphabetical Continuous Substring", "question__title_slug": "length-of-the-longest-alphabetical-continuous-substring", "question__hide": false, - "total_acs": 29795, - "total_submitted": 53245, + "total_acs": 30051, + "total_submitted": 53691, "frontend_question_id": 2414, "is_new_question": false }, @@ -3166,8 +3488,8 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 60814, - "total_submitted": 69420, + "total_acs": 62952, + "total_submitted": 71788, "frontend_question_id": 2413, "is_new_question": false }, @@ -3189,8 +3511,8 @@ "question__title": "Maximum Number of Books You Can Take", "question__title_slug": "maximum-number-of-books-you-can-take", "question__hide": false, - "total_acs": 3550, - "total_submitted": 7975, + "total_acs": 3624, + "total_submitted": 8114, "frontend_question_id": 2355, "is_new_question": false }, @@ -3212,8 +3534,8 @@ "question__title": "Sort Array by Moving Items to Empty Space", "question__title_slug": "sort-array-by-moving-items-to-empty-space", "question__hide": false, - "total_acs": 409, - "total_submitted": 787, + "total_acs": 419, + "total_submitted": 802, "frontend_question_id": 2459, "is_new_question": false }, @@ -3235,8 +3557,8 @@ "question__title": "Divide Intervals Into Minimum Number of Groups", "question__title_slug": "divide-intervals-into-minimum-number-of-groups", "question__hide": false, - "total_acs": 19308, - "total_submitted": 42298, + "total_acs": 19458, + "total_submitted": 42577, "frontend_question_id": 2406, "is_new_question": false }, @@ -3258,8 +3580,8 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 29675, - "total_submitted": 39719, + "total_acs": 30220, + "total_submitted": 40396, "frontend_question_id": 2405, "is_new_question": false }, @@ -3281,8 +3603,8 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 40518, - "total_submitted": 78977, + "total_acs": 41198, + "total_submitted": 80373, "frontend_question_id": 2404, "is_new_question": false }, @@ -3304,8 +3626,8 @@ "question__title": "Finding the Number of Visible Mountains", "question__title_slug": "finding-the-number-of-visible-mountains", "question__hide": false, - "total_acs": 2562, - "total_submitted": 5865, + "total_acs": 2716, + "total_submitted": 6235, "frontend_question_id": 2345, "is_new_question": false }, @@ -3327,8 +3649,8 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 1765, - "total_submitted": 5298, + "total_acs": 1825, + "total_submitted": 5476, "frontend_question_id": 2346, "is_new_question": false }, @@ -3350,8 +3672,8 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 16647, - "total_submitted": 35848, + "total_acs": 16740, + "total_submitted": 36045, "frontend_question_id": 2365, "is_new_question": false }, @@ -3373,8 +3695,8 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 11329, - "total_submitted": 21475, + "total_acs": 11379, + "total_submitted": 21554, "frontend_question_id": 2397, "is_new_question": false }, @@ -3396,8 +3718,8 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 37714, - "total_submitted": 42986, + "total_acs": 38978, + "total_submitted": 44381, "frontend_question_id": 2396, "is_new_question": false }, @@ -3419,8 +3741,8 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 31245, - "total_submitted": 48522, + "total_acs": 31682, + "total_submitted": 49108, "frontend_question_id": 2395, "is_new_question": false }, @@ -3442,8 +3764,8 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 13278, - "total_submitted": 39785, + "total_acs": 13744, + "total_submitted": 41117, "frontend_question_id": 2402, "is_new_question": false }, @@ -3465,8 +3787,8 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 18228, - "total_submitted": 37474, + "total_acs": 18547, + "total_submitted": 38022, "frontend_question_id": 2401, "is_new_question": false }, @@ -3488,8 +3810,8 @@ "question__title": "Number of Ways to Reach a Position After Exactly k Steps", "question__title_slug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "question__hide": false, - "total_acs": 19960, - "total_submitted": 61225, + "total_acs": 20144, + "total_submitted": 61686, "frontend_question_id": 2400, "is_new_question": false }, @@ -3511,8 +3833,8 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 31515, - "total_submitted": 44597, + "total_acs": 31991, + "total_submitted": 45217, "frontend_question_id": 2399, "is_new_question": false }, @@ -3534,8 +3856,8 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 19139, - "total_submitted": 62027, + "total_acs": 19286, + "total_submitted": 62442, "frontend_question_id": 2384, "is_new_question": false }, @@ -3557,8 +3879,8 @@ "question__title": "Minimum Adjacent Swaps to Make a Valid Array", "question__title_slug": "minimum-adjacent-swaps-to-make-a-valid-array", "question__hide": false, - "total_acs": 5159, - "total_submitted": 6815, + "total_acs": 5305, + "total_submitted": 7021, "frontend_question_id": 2340, "is_new_question": false }, @@ -3580,8 +3902,8 @@ "question__title": "Max Sum of a Pair With Equal Sum of Digits", "question__title_slug": "max-sum-of-a-pair-with-equal-sum-of-digits", "question__hide": false, - "total_acs": 29521, - "total_submitted": 55393, + "total_acs": 29843, + "total_submitted": 55948, "frontend_question_id": 2342, "is_new_question": false }, @@ -3603,8 +3925,8 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 10435, - "total_submitted": 17594, + "total_acs": 10504, + "total_submitted": 17696, "frontend_question_id": 2392, "is_new_question": false }, @@ -3626,8 +3948,8 @@ "question__title": "Minimum Amount of Time to Collect Garbage", "question__title_slug": "minimum-amount-of-time-to-collect-garbage", "question__hide": false, - "total_acs": 28877, - "total_submitted": 34024, + "total_acs": 29363, + "total_submitted": 34613, "frontend_question_id": 2391, "is_new_question": false }, @@ -3649,8 +3971,8 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 35813, - "total_submitted": 55519, + "total_acs": 36290, + "total_submitted": 56197, "frontend_question_id": 2390, "is_new_question": false }, @@ -3672,8 +3994,8 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 74212, - "total_submitted": 101937, + "total_acs": 74961, + "total_submitted": 103050, "frontend_question_id": 2389, "is_new_question": false }, @@ -3695,8 +4017,8 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 2271, - "total_submitted": 2996, + "total_acs": 2315, + "total_submitted": 3052, "frontend_question_id": 2330, "is_new_question": false }, @@ -3718,8 +4040,8 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 6012, - "total_submitted": 12599, + "total_acs": 6069, + "total_submitted": 12707, "frontend_question_id": 2382, "is_new_question": false }, @@ -3741,8 +4063,8 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 13414, - "total_submitted": 39019, + "total_acs": 13543, + "total_submitted": 39313, "frontend_question_id": 2381, "is_new_question": false }, @@ -3764,8 +4086,8 @@ "question__title": "Time Needed to Rearrange a Binary String", "question__title_slug": "time-needed-to-rearrange-a-binary-string", "question__hide": false, - "total_acs": 20723, - "total_submitted": 42671, + "total_acs": 20882, + "total_submitted": 42960, "frontend_question_id": 2380, "is_new_question": false }, @@ -3787,8 +4109,8 @@ "question__title": "Minimum Recolors to Get K Consecutive Black Blocks", "question__title_slug": "minimum-recolors-to-get-k-consecutive-black-blocks", "question__hide": false, - "total_acs": 28132, - "total_submitted": 49194, + "total_acs": 28566, + "total_submitted": 49897, "frontend_question_id": 2379, "is_new_question": false }, @@ -3810,8 +4132,8 @@ "question__title": "Find the K-Sum of an Array", "question__title_slug": "find-the-k-sum-of-an-array", "question__hide": false, - "total_acs": 6591, - "total_submitted": 17223, + "total_acs": 6650, + "total_submitted": 17313, "frontend_question_id": 2386, "is_new_question": false }, @@ -3833,8 +4155,8 @@ "question__title": "Amount of Time for Binary Tree to Be Infected", "question__title_slug": "amount-of-time-for-binary-tree-to-be-infected", "question__hide": false, - "total_acs": 20679, - "total_submitted": 36726, + "total_acs": 20984, + "total_submitted": 37212, "frontend_question_id": 2385, "is_new_question": false }, @@ -3856,8 +4178,8 @@ "question__title": "Minimum Hours of Training to Win a Competition", "question__title_slug": "minimum-hours-of-training-to-win-a-competition", "question__hide": false, - "total_acs": 24029, - "total_submitted": 58515, + "total_acs": 24230, + "total_submitted": 59099, "frontend_question_id": 2383, "is_new_question": false }, @@ -3879,8 +4201,8 @@ "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": 1416, - "total_submitted": 1881, + "total_acs": 1444, + "total_submitted": 1932, "frontend_question_id": 2323, "is_new_question": false }, @@ -3902,8 +4224,8 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 8305, - "total_submitted": 22780, + "total_acs": 8353, + "total_submitted": 22875, "frontend_question_id": 2376, "is_new_question": false }, @@ -3925,8 +4247,8 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 20203, - "total_submitted": 27234, + "total_acs": 20434, + "total_submitted": 27515, "frontend_question_id": 2375, "is_new_question": false }, @@ -3948,8 +4270,8 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 24432, - "total_submitted": 52590, + "total_acs": 24581, + "total_submitted": 52876, "frontend_question_id": 2374, "is_new_question": false }, @@ -3971,8 +4293,8 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 30257, - "total_submitted": 36144, + "total_acs": 31042, + "total_submitted": 37077, "frontend_question_id": 2373, "is_new_question": false }, @@ -3994,8 +4316,8 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 3266, - "total_submitted": 3679, + "total_acs": 3380, + "total_submitted": 3808, "frontend_question_id": 2339, "is_new_question": false }, @@ -4017,8 +4339,8 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 3074, - "total_submitted": 4425, + "total_acs": 3179, + "total_submitted": 4575, "frontend_question_id": 2329, "is_new_question": false }, @@ -4040,8 +4362,8 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 2803, - "total_submitted": 3367, + "total_acs": 2867, + "total_submitted": 3439, "frontend_question_id": 2324, "is_new_question": false }, @@ -4063,8 +4385,8 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 8864, - "total_submitted": 22028, + "total_acs": 8963, + "total_submitted": 22241, "frontend_question_id": 2366, "is_new_question": false }, @@ -4086,8 +4408,8 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 13437, - "total_submitted": 41262, + "total_acs": 13606, + "total_submitted": 41777, "frontend_question_id": 2398, "is_new_question": false }, @@ -4109,8 +4431,8 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 20704, - "total_submitted": 50509, + "total_acs": 21360, + "total_submitted": 51768, "frontend_question_id": 2364, "is_new_question": false }, @@ -4132,8 +4454,8 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 31516, - "total_submitted": 41703, + "total_acs": 31971, + "total_submitted": 42353, "frontend_question_id": 2363, "is_new_question": false }, @@ -4155,8 +4477,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": 2347, - "total_submitted": 3043, + "total_acs": 2418, + "total_submitted": 3137, "frontend_question_id": 2314, "is_new_question": false }, @@ -4178,8 +4500,8 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 28923, - "total_submitted": 50126, + "total_acs": 29316, + "total_submitted": 50765, "frontend_question_id": 2368, "is_new_question": false }, @@ -4201,8 +4523,8 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 17953, - "total_submitted": 47411, + "total_acs": 18060, + "total_submitted": 47651, "frontend_question_id": 2370, "is_new_question": false }, @@ -4224,8 +4546,8 @@ "question__title": "Check if There is a Valid Partition For The Array", "question__title_slug": "check-if-there-is-a-valid-partition-for-the-array", "question__hide": false, - "total_acs": 18346, - "total_submitted": 45681, + "total_acs": 18427, + "total_submitted": 45874, "frontend_question_id": 2369, "is_new_question": false }, @@ -4247,8 +4569,8 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 55831, - "total_submitted": 66725, + "total_acs": 57288, + "total_submitted": 68460, "frontend_question_id": 2367, "is_new_question": false }, @@ -4270,8 +4592,8 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 2375, - "total_submitted": 3051, + "total_acs": 2425, + "total_submitted": 3129, "frontend_question_id": 2308, "is_new_question": false }, @@ -4293,8 +4615,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 2786, - "total_submitted": 3207, + "total_acs": 2878, + "total_submitted": 3317, "frontend_question_id": 2298, "is_new_question": false }, @@ -4316,8 +4638,8 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 16179, - "total_submitted": 41727, + "total_acs": 16306, + "total_submitted": 42064, "frontend_question_id": 2360, "is_new_question": false }, @@ -4339,8 +4661,8 @@ "question__title": "Find Closest Node to Given Two Nodes", "question__title_slug": "find-closest-node-to-given-two-nodes", "question__hide": false, - "total_acs": 17854, - "total_submitted": 51966, + "total_acs": 17973, + "total_submitted": 52278, "frontend_question_id": 2359, "is_new_question": false }, @@ -4362,8 +4684,8 @@ "question__title": "Maximum Number of Groups Entering a Competition", "question__title_slug": "maximum-number-of-groups-entering-a-competition", "question__hide": false, - "total_acs": 27099, - "total_submitted": 40079, + "total_acs": 27321, + "total_submitted": 40410, "frontend_question_id": 2358, "is_new_question": false }, @@ -4385,8 +4707,8 @@ "question__title": "Make Array Zero by Subtracting Equal Amounts", "question__title_slug": "make-array-zero-by-subtracting-equal-amounts", "question__hide": false, - "total_acs": 54788, - "total_submitted": 75185, + "total_acs": 55955, + "total_submitted": 76813, "frontend_question_id": 2357, "is_new_question": false }, @@ -4408,8 +4730,8 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 11104, - "total_submitted": 16229, + "total_acs": 11177, + "total_submitted": 16332, "frontend_question_id": 2350, "is_new_question": false }, @@ -4431,8 +4753,8 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 17666, - "total_submitted": 38117, + "total_acs": 17745, + "total_submitted": 38385, "frontend_question_id": 2349, "is_new_question": false }, @@ -4454,8 +4776,8 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 27498, - "total_submitted": 45395, + "total_acs": 27931, + "total_submitted": 46008, "frontend_question_id": 2347, "is_new_question": false }, @@ -4477,8 +4799,8 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 26932, - "total_submitted": 46918, + "total_acs": 27187, + "total_submitted": 47295, "frontend_question_id": 2348, "is_new_question": false }, @@ -4500,8 +4822,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": 2992, - "total_submitted": 7470, + "total_acs": 3059, + "total_submitted": 7629, "frontend_question_id": 2292, "is_new_question": false }, @@ -4523,8 +4845,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 11522, - "total_submitted": 25034, + "total_acs": 11565, + "total_submitted": 25120, "frontend_question_id": 2354, "is_new_question": false }, @@ -4546,8 +4868,8 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 15540, - "total_submitted": 44870, + "total_acs": 15621, + "total_submitted": 45151, "frontend_question_id": 2353, "is_new_question": false }, @@ -4569,8 +4891,8 @@ "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 31582, - "total_submitted": 44548, + "total_acs": 31902, + "total_submitted": 45041, "frontend_question_id": 2352, "is_new_question": false }, @@ -4592,8 +4914,8 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 60450, - "total_submitted": 79878, + "total_acs": 61519, + "total_submitted": 81412, "frontend_question_id": 2351, "is_new_question": false }, @@ -4615,8 +4937,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 2930, - "total_submitted": 6480, + "total_acs": 3012, + "total_submitted": 6667, "frontend_question_id": 2291, "is_new_question": false }, @@ -4638,8 +4960,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": 1046, - "total_submitted": 2086, + "total_acs": 1049, + "total_submitted": 2095, "frontend_question_id": 2282, "is_new_question": false }, @@ -4661,8 +4983,8 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 22156, - "total_submitted": 38917, + "total_acs": 22343, + "total_submitted": 39258, "frontend_question_id": 2344, "is_new_question": false }, @@ -4684,8 +5006,8 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 19633, - "total_submitted": 47984, + "total_acs": 19958, + "total_submitted": 48559, "frontend_question_id": 2343, "is_new_question": false }, @@ -4707,8 +5029,8 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 42455, - "total_submitted": 55632, + "total_acs": 42991, + "total_submitted": 56335, "frontend_question_id": 2341, "is_new_question": false }, @@ -4730,8 +5052,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 2337, - "total_submitted": 3669, + "total_acs": 2356, + "total_submitted": 3697, "frontend_question_id": 2277, "is_new_question": false }, @@ -4753,8 +5075,8 @@ "question__title": "Subarray With Elements Greater Than Varying Threshold", "question__title_slug": "subarray-with-elements-greater-than-varying-threshold", "question__hide": false, - "total_acs": 5602, - "total_submitted": 13726, + "total_acs": 5648, + "total_submitted": 13807, "frontend_question_id": 2334, "is_new_question": false }, @@ -4776,8 +5098,8 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 10425, - "total_submitted": 40821, + "total_acs": 10571, + "total_submitted": 41279, "frontend_question_id": 2333, "is_new_question": false }, @@ -4799,8 +5121,8 @@ "question__title": "The Latest Time to Catch a Bus", "question__title_slug": "the-latest-time-to-catch-a-bus", "question__hide": false, - "total_acs": 12256, - "total_submitted": 53101, + "total_acs": 12416, + "total_submitted": 53710, "frontend_question_id": 2332, "is_new_question": false }, @@ -4822,8 +5144,8 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 38740, - "total_submitted": 49059, + "total_acs": 39514, + "total_submitted": 50036, "frontend_question_id": 2331, "is_new_question": false }, @@ -4845,8 +5167,8 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 4483, - "total_submitted": 17277, + "total_acs": 4505, + "total_submitted": 17340, "frontend_question_id": 2338, "is_new_question": false }, @@ -4868,8 +5190,8 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 19936, - "total_submitted": 41501, + "total_acs": 20051, + "total_submitted": 41726, "frontend_question_id": 2337, "is_new_question": false }, @@ -4891,8 +5213,8 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 26333, - "total_submitted": 36786, + "total_acs": 26593, + "total_submitted": 37162, "frontend_question_id": 2336, "is_new_question": false }, @@ -4914,8 +5236,8 @@ "question__title": "Minimum Amount of Time to Fill Cups", "question__title_slug": "minimum-amount-of-time-to-fill-cups", "question__hide": false, - "total_acs": 30962, - "total_submitted": 55553, + "total_acs": 31384, + "total_submitted": 56154, "frontend_question_id": 2335, "is_new_question": false }, @@ -4937,8 +5259,8 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 24329, - "total_submitted": 32596, + "total_acs": 24577, + "total_submitted": 32902, "frontend_question_id": 2326, "is_new_question": false }, @@ -4960,8 +5282,8 @@ "question__title": "Number of Increasing Paths in a Grid", "question__title_slug": "number-of-increasing-paths-in-a-grid", "question__hide": false, - "total_acs": 15641, - "total_submitted": 32857, + "total_acs": 15754, + "total_submitted": 33096, "frontend_question_id": 2328, "is_new_question": false }, @@ -4983,8 +5305,8 @@ "question__title": "Number of People Aware of a Secret", "question__title_slug": "number-of-people-aware-of-a-secret", "question__hide": false, - "total_acs": 15792, - "total_submitted": 35275, + "total_acs": 16142, + "total_submitted": 35918, "frontend_question_id": 2327, "is_new_question": false }, @@ -5006,8 +5328,8 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 46971, - "total_submitted": 55340, + "total_acs": 47932, + "total_submitted": 56484, "frontend_question_id": 2325, "is_new_question": false }, @@ -5029,8 +5351,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 9387, - "total_submitted": 12721, + "total_acs": 9545, + "total_submitted": 12931, "frontend_question_id": 2268, "is_new_question": false }, @@ -5052,8 +5374,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 8037, - "total_submitted": 14297, + "total_acs": 8068, + "total_submitted": 14356, "frontend_question_id": 2318, "is_new_question": false }, @@ -5075,8 +5397,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": 20276, - "total_submitted": 52511, + "total_acs": 20484, + "total_submitted": 52996, "frontend_question_id": 2316, "is_new_question": false }, @@ -5098,8 +5420,8 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 15347, - "total_submitted": 19483, + "total_acs": 15558, + "total_submitted": 19746, "frontend_question_id": 2317, "is_new_question": false }, @@ -5121,8 +5443,8 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 37607, - "total_submitted": 45708, + "total_acs": 38268, + "total_submitted": 46471, "frontend_question_id": 2315, "is_new_question": false }, @@ -5144,8 +5466,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": 5163, - "total_submitted": 10154, + "total_acs": 5206, + "total_submitted": 10232, "frontend_question_id": 2322, "is_new_question": false }, @@ -5167,8 +5489,8 @@ "question__title": "Minimum Flips in Binary Tree to Get Result", "question__title_slug": "minimum-flips-in-binary-tree-to-get-result", "question__hide": false, - "total_acs": 975, - "total_submitted": 1519, + "total_acs": 992, + "total_submitted": 1544, "frontend_question_id": 2313, "is_new_question": false }, @@ -5190,8 +5512,8 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 34300, - "total_submitted": 51116, + "total_acs": 34622, + "total_submitted": 51617, "frontend_question_id": 2319, "is_new_question": false }, @@ -5213,8 +5535,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": 20962, - "total_submitted": 51944, + "total_acs": 21095, + "total_submitted": 52200, "frontend_question_id": 2320, "is_new_question": false }, @@ -5236,8 +5558,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 1214, - "total_submitted": 1875, + "total_acs": 1223, + "total_submitted": 1887, "frontend_question_id": 2254, "is_new_question": false }, @@ -5259,8 +5581,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": 17491, - "total_submitted": 47541, + "total_acs": 17616, + "total_submitted": 47800, "frontend_question_id": 2311, "is_new_question": false }, @@ -5282,8 +5604,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": 15131, - "total_submitted": 29000, + "total_acs": 15265, + "total_submitted": 29288, "frontend_question_id": 2302, "is_new_question": false }, @@ -5305,8 +5627,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 10745, - "total_submitted": 27398, + "total_acs": 10775, + "total_submitted": 27465, "frontend_question_id": 2301, "is_new_question": false }, @@ -5328,8 +5650,8 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 21102, - "total_submitted": 65684, + "total_acs": 21252, + "total_submitted": 66001, "frontend_question_id": 2300, "is_new_question": false }, @@ -5351,8 +5673,8 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 27174, - "total_submitted": 48148, + "total_acs": 27546, + "total_submitted": 48780, "frontend_question_id": 2299, "is_new_question": false }, @@ -5368,14 +5690,14 @@ { "stat": { "question_id": 2390, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "naming-a-company", + "question__article__has_video_solution": false, "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 7928, - "total_submitted": 22960, + "total_acs": 7961, + "total_submitted": 23081, "frontend_question_id": 2306, "is_new_question": false }, @@ -5397,8 +5719,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 14609, - "total_submitted": 36216, + "total_acs": 14764, + "total_submitted": 36569, "frontend_question_id": 2296, "is_new_question": false }, @@ -5420,8 +5742,8 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 26071, - "total_submitted": 45261, + "total_acs": 26237, + "total_submitted": 45553, "frontend_question_id": 2295, "is_new_question": false }, @@ -5443,8 +5765,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": 28644, - "total_submitted": 39382, + "total_acs": 28908, + "total_submitted": 39732, "frontend_question_id": 2294, "is_new_question": false }, @@ -5466,8 +5788,8 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 33283, - "total_submitted": 51938, + "total_acs": 33703, + "total_submitted": 52542, "frontend_question_id": 2293, "is_new_question": false }, @@ -5489,8 +5811,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": 1736, - "total_submitted": 2620, + "total_acs": 1786, + "total_submitted": 2699, "frontend_question_id": 2237, "is_new_question": false }, @@ -5512,8 +5834,8 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 96935, - "total_submitted": 112662, + "total_acs": 99542, + "total_submitted": 115847, "frontend_question_id": 2236, "is_new_question": false }, @@ -5535,8 +5857,8 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 200696, - "total_submitted": 224943, + "total_acs": 207100, + "total_submitted": 232310, "frontend_question_id": 2235, "is_new_question": false }, @@ -5558,8 +5880,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 418, - "total_submitted": 614, + "total_acs": 428, + "total_submitted": 638, "frontend_question_id": 2253, "is_new_question": false }, @@ -5581,8 +5903,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 656, - "total_submitted": 1149, + "total_acs": 668, + "total_submitted": 1166, "frontend_question_id": 2252, "is_new_question": false }, @@ -5604,8 +5926,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 4061, - "total_submitted": 26254, + "total_acs": 4104, + "total_submitted": 26640, "frontend_question_id": 2286, "is_new_question": false }, @@ -5627,8 +5949,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 22722, - "total_submitted": 37381, + "total_acs": 22973, + "total_submitted": 37785, "frontend_question_id": 2285, "is_new_question": false }, @@ -5650,8 +5972,8 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 24536, - "total_submitted": 43850, + "total_acs": 24752, + "total_submitted": 44200, "frontend_question_id": 2284, "is_new_question": false }, @@ -5673,8 +5995,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": 34180, - "total_submitted": 46590, + "total_acs": 34674, + "total_submitted": 47314, "frontend_question_id": 2283, "is_new_question": false }, @@ -5696,8 +6018,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": 3693, - "total_submitted": 4872, + "total_acs": 3765, + "total_submitted": 4960, "frontend_question_id": 2238, "is_new_question": false }, @@ -5719,8 +6041,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 14956, - "total_submitted": 30542, + "total_acs": 15116, + "total_submitted": 30788, "frontend_question_id": 2290, "is_new_question": false }, @@ -5742,8 +6064,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 13311, - "total_submitted": 62581, + "total_acs": 13418, + "total_submitted": 63217, "frontend_question_id": 2289, "is_new_question": false }, @@ -5765,8 +6087,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 16423, - "total_submitted": 59267, + "total_acs": 16512, + "total_submitted": 59539, "frontend_question_id": 2288, "is_new_question": false }, @@ -5788,8 +6110,8 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 28310, - "total_submitted": 48765, + "total_acs": 28617, + "total_submitted": 49236, "frontend_question_id": 2287, "is_new_question": false }, @@ -5811,8 +6133,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": 2947, - "total_submitted": 5803, + "total_acs": 2997, + "total_submitted": 5930, "frontend_question_id": 2230, "is_new_question": false }, @@ -5834,8 +6156,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": 4181, - "total_submitted": 9407, + "total_acs": 4246, + "total_submitted": 9577, "frontend_question_id": 2228, "is_new_question": false }, @@ -5857,8 +6179,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 2537, - "total_submitted": 4207, + "total_acs": 2573, + "total_submitted": 4259, "frontend_question_id": 2219, "is_new_question": false }, @@ -5880,8 +6202,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 13075, - "total_submitted": 47148, + "total_acs": 13222, + "total_submitted": 47820, "frontend_question_id": 2281, "is_new_question": false }, @@ -5903,8 +6225,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": 21190, - "total_submitted": 87522, + "total_acs": 21321, + "total_submitted": 88058, "frontend_question_id": 2280, "is_new_question": false }, @@ -5926,8 +6248,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": 81935, - "total_submitted": 120664, + "total_acs": 82221, + "total_submitted": 121102, "frontend_question_id": 2279, "is_new_question": false }, @@ -5949,8 +6271,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 42821, - "total_submitted": 57703, + "total_acs": 43676, + "total_submitted": 58862, "frontend_question_id": 2278, "is_new_question": false }, @@ -5972,8 +6294,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 43953, - "total_submitted": 82187, + "total_acs": 63604, + "total_submitted": 113616, "frontend_question_id": 2246, "is_new_question": false }, @@ -5995,8 +6317,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": 6694, - "total_submitted": 19135, + "total_acs": 6718, + "total_submitted": 19212, "frontend_question_id": 2245, "is_new_question": false }, @@ -6018,8 +6340,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 125383, - "total_submitted": 198673, + "total_acs": 126518, + "total_submitted": 200671, "frontend_question_id": 2244, "is_new_question": false }, @@ -6041,8 +6363,8 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 27235, - "total_submitted": 40904, + "total_acs": 27509, + "total_submitted": 41310, "frontend_question_id": 2243, "is_new_question": false }, @@ -6064,8 +6386,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 22169, - "total_submitted": 59534, + "total_acs": 22399, + "total_submitted": 60188, "frontend_question_id": 2272, "is_new_question": false }, @@ -6087,8 +6409,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": 12577, - "total_submitted": 38139, + "total_acs": 12659, + "total_submitted": 38388, "frontend_question_id": 2271, "is_new_question": false }, @@ -6110,8 +6432,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 23397, - "total_submitted": 51549, + "total_acs": 23724, + "total_submitted": 52206, "frontend_question_id": 2270, "is_new_question": false }, @@ -6133,8 +6455,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 12092, - "total_submitted": 35054, + "total_acs": 12243, + "total_submitted": 35524, "frontend_question_id": 2276, "is_new_question": false }, @@ -6156,8 +6478,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": 19258, - "total_submitted": 26575, + "total_acs": 19421, + "total_submitted": 26797, "frontend_question_id": 2275, "is_new_question": false }, @@ -6179,8 +6501,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 23937, - "total_submitted": 45929, + "total_acs": 24211, + "total_submitted": 46433, "frontend_question_id": 2274, "is_new_question": false }, @@ -6202,8 +6524,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 25354, - "total_submitted": 43750, + "total_acs": 26247, + "total_submitted": 45170, "frontend_question_id": 2214, "is_new_question": false }, @@ -6225,8 +6547,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 9172, - "total_submitted": 24370, + "total_acs": 9207, + "total_submitted": 24448, "frontend_question_id": 2242, "is_new_question": false }, @@ -6248,8 +6570,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 12656, - "total_submitted": 32655, + "total_acs": 12752, + "total_submitted": 32913, "frontend_question_id": 2241, "is_new_question": false }, @@ -6271,8 +6593,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": 19010, - "total_submitted": 33300, + "total_acs": 19198, + "total_submitted": 33657, "frontend_question_id": 2240, "is_new_question": false }, @@ -6294,8 +6616,8 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 34735, - "total_submitted": 75826, + "total_acs": 35175, + "total_submitted": 76906, "frontend_question_id": 2239, "is_new_question": false }, @@ -6317,8 +6639,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": 12024, - "total_submitted": 31590, + "total_acs": 12074, + "total_submitted": 31723, "frontend_question_id": 2267, "is_new_question": false }, @@ -6340,8 +6662,8 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 14308, - "total_submitted": 30298, + "total_acs": 14420, + "total_submitted": 30532, "frontend_question_id": 2266, "is_new_question": false }, @@ -6363,8 +6685,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": 34302, - "total_submitted": 40109, + "total_acs": 34983, + "total_submitted": 40890, "frontend_question_id": 2265, "is_new_question": false }, @@ -6386,8 +6708,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": 28687, - "total_submitted": 48383, + "total_acs": 29023, + "total_submitted": 48916, "frontend_question_id": 2264, "is_new_question": false }, @@ -6409,8 +6731,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": 29945, - "total_submitted": 45758, + "total_acs": 30133, + "total_submitted": 46031, "frontend_question_id": 2224, "is_new_question": false }, @@ -6432,8 +6754,8 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 6373, - "total_submitted": 18204, + "total_acs": 6433, + "total_submitted": 18375, "frontend_question_id": 2258, "is_new_question": false }, @@ -6455,8 +6777,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 12673, - "total_submitted": 24195, + "total_acs": 12782, + "total_submitted": 24409, "frontend_question_id": 2257, "is_new_question": false }, @@ -6478,8 +6800,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 73333, - "total_submitted": 169937, + "total_acs": 73544, + "total_submitted": 170466, "frontend_question_id": 2256, "is_new_question": false }, @@ -6501,8 +6823,8 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 34872, - "total_submitted": 47629, + "total_acs": 35356, + "total_submitted": 48385, "frontend_question_id": 2255, "is_new_question": false }, @@ -6524,8 +6846,8 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 21687, - "total_submitted": 37546, + "total_acs": 21804, + "total_submitted": 37794, "frontend_question_id": 2262, "is_new_question": false }, @@ -6547,8 +6869,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 19045, - "total_submitted": 39925, + "total_acs": 19273, + "total_submitted": 40347, "frontend_question_id": 2261, "is_new_question": false }, @@ -6570,8 +6892,8 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 36549, - "total_submitted": 70878, + "total_acs": 37274, + "total_submitted": 72264, "frontend_question_id": 2260, "is_new_question": false }, @@ -6593,8 +6915,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": 44628, - "total_submitted": 95619, + "total_acs": 45247, + "total_submitted": 96897, "frontend_question_id": 2259, "is_new_question": false }, @@ -6616,8 +6938,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": 3539, - "total_submitted": 6984, + "total_acs": 3600, + "total_submitted": 7094, "frontend_question_id": 2205, "is_new_question": false }, @@ -6639,8 +6961,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 1433, - "total_submitted": 2866, + "total_acs": 1468, + "total_submitted": 2929, "frontend_question_id": 2199, "is_new_question": false }, @@ -6662,8 +6984,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 11913, - "total_submitted": 23012, + "total_acs": 11994, + "total_submitted": 23198, "frontend_question_id": 2251, "is_new_question": false }, @@ -6685,8 +7007,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": 11392, - "total_submitted": 33417, + "total_acs": 11459, + "total_submitted": 33625, "frontend_question_id": 2250, "is_new_question": false }, @@ -6708,8 +7030,8 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 17499, - "total_submitted": 34691, + "total_acs": 17616, + "total_submitted": 34921, "frontend_question_id": 2249, "is_new_question": false }, @@ -6731,8 +7053,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 42208, - "total_submitted": 60986, + "total_acs": 42907, + "total_submitted": 62001, "frontend_question_id": 2248, "is_new_question": false }, @@ -6754,8 +7076,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 5122, - "total_submitted": 17967, + "total_acs": 5153, + "total_submitted": 18059, "frontend_question_id": 2234, "is_new_question": false }, @@ -6777,8 +7099,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 21656, - "total_submitted": 52519, + "total_acs": 21811, + "total_submitted": 52889, "frontend_question_id": 2233, "is_new_question": false }, @@ -6800,8 +7122,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": 14453, - "total_submitted": 22094, + "total_acs": 14552, + "total_submitted": 22221, "frontend_question_id": 2232, "is_new_question": false }, @@ -6823,8 +7145,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": 28485, - "total_submitted": 46925, + "total_acs": 28809, + "total_submitted": 47385, "frontend_question_id": 2231, "is_new_question": false }, @@ -6846,8 +7168,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 4992, - "total_submitted": 13448, + "total_acs": 5021, + "total_submitted": 13512, "frontend_question_id": 2223, "is_new_question": false }, @@ -6869,8 +7191,8 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 23992, - "total_submitted": 46761, + "total_acs": 24207, + "total_submitted": 47148, "frontend_question_id": 2222, "is_new_question": false }, @@ -6892,8 +7214,8 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 48700, - "total_submitted": 61913, + "total_acs": 49261, + "total_submitted": 62616, "frontend_question_id": 2221, "is_new_question": false }, @@ -6915,8 +7237,8 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 32538, - "total_submitted": 39597, + "total_acs": 33080, + "total_submitted": 40247, "frontend_question_id": 2220, "is_new_question": false }, @@ -6938,8 +7260,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": 4725, - "total_submitted": 9288, + "total_acs": 4828, + "total_submitted": 9577, "frontend_question_id": 2184, "is_new_question": false }, @@ -6961,8 +7283,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": 8659, - "total_submitted": 24029, + "total_acs": 8689, + "total_submitted": 24130, "frontend_question_id": 2203, "is_new_question": false }, @@ -6984,8 +7306,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": 29906, - "total_submitted": 46159, + "total_acs": 30044, + "total_submitted": 46344, "frontend_question_id": 2200, "is_new_question": false }, @@ -7007,8 +7329,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 3238, - "total_submitted": 10443, + "total_acs": 3263, + "total_submitted": 10534, "frontend_question_id": 2213, "is_new_question": false }, @@ -7030,8 +7352,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 11735, - "total_submitted": 23882, + "total_acs": 11891, + "total_submitted": 24142, "frontend_question_id": 2212, "is_new_question": false }, @@ -7053,8 +7375,8 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 18399, - "total_submitted": 43629, + "total_acs": 18502, + "total_submitted": 43856, "frontend_question_id": 2211, "is_new_question": false }, @@ -7076,8 +7398,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": 28954, - "total_submitted": 49675, + "total_acs": 29226, + "total_submitted": 50087, "frontend_question_id": 2210, "is_new_question": false }, @@ -7099,8 +7421,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 3441, - "total_submitted": 5057, + "total_acs": 3508, + "total_submitted": 5175, "frontend_question_id": 2175, "is_new_question": false }, @@ -7122,8 +7444,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": 3984, - "total_submitted": 5822, + "total_acs": 3999, + "total_submitted": 5857, "frontend_question_id": 2174, "is_new_question": false }, @@ -7145,8 +7467,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 2420, - "total_submitted": 4145, + "total_acs": 2447, + "total_submitted": 4213, "frontend_question_id": 2173, "is_new_question": false }, @@ -7168,8 +7490,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": 24613, - "total_submitted": 40835, + "total_acs": 24828, + "total_submitted": 41191, "frontend_question_id": 2190, "is_new_question": false }, @@ -7191,8 +7513,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": 9218, - "total_submitted": 27167, + "total_acs": 9298, + "total_submitted": 27358, "frontend_question_id": 2209, "is_new_question": false }, @@ -7214,8 +7536,8 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 18976, - "total_submitted": 41993, + "total_acs": 19173, + "total_submitted": 42394, "frontend_question_id": 2208, "is_new_question": false }, @@ -7237,8 +7559,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": 14882, - "total_submitted": 44916, + "total_acs": 14980, + "total_submitted": 45132, "frontend_question_id": 2207, "is_new_question": false }, @@ -7260,8 +7582,8 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 46232, - "total_submitted": 62152, + "total_acs": 47033, + "total_submitted": 63273, "frontend_question_id": 2206, "is_new_question": false }, @@ -7283,8 +7605,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 11128, - "total_submitted": 28762, + "total_acs": 11181, + "total_submitted": 28906, "frontend_question_id": 2197, "is_new_question": false }, @@ -7306,8 +7628,8 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 23969, - "total_submitted": 33169, + "total_acs": 24195, + "total_submitted": 33470, "frontend_question_id": 2196, "is_new_question": false }, @@ -7329,8 +7651,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 23901, - "total_submitted": 95067, + "total_acs": 24052, + "total_submitted": 95611, "frontend_question_id": 2195, "is_new_question": false }, @@ -7352,8 +7674,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": 41655, - "total_submitted": 48774, + "total_acs": 42256, + "total_submitted": 49465, "frontend_question_id": 2194, "is_new_question": false }, @@ -7375,8 +7697,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 1571, - "total_submitted": 2655, + "total_acs": 1583, + "total_submitted": 2676, "frontend_question_id": 2168, "is_new_question": false }, @@ -7398,8 +7720,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 3913, - "total_submitted": 6230, + "total_acs": 3991, + "total_submitted": 6368, "frontend_question_id": 2159, "is_new_question": false }, @@ -7421,8 +7743,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 11232, - "total_submitted": 39303, + "total_acs": 11318, + "total_submitted": 39628, "frontend_question_id": 2183, "is_new_question": false }, @@ -7444,8 +7766,8 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 16176, - "total_submitted": 30990, + "total_acs": 16289, + "total_submitted": 31147, "frontend_question_id": 2182, "is_new_question": false }, @@ -7467,8 +7789,8 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 63025, - "total_submitted": 72694, + "total_acs": 64047, + "total_submitted": 73878, "frontend_question_id": 2181, "is_new_question": false }, @@ -7490,8 +7812,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 37162, - "total_submitted": 57180, + "total_acs": 37587, + "total_submitted": 57762, "frontend_question_id": 2180, "is_new_question": false }, @@ -7513,8 +7835,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": 22245, - "total_submitted": 40747, + "total_acs": 22408, + "total_submitted": 41073, "frontend_question_id": 2158, "is_new_question": false }, @@ -7536,8 +7858,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": 1609, - "total_submitted": 3262, + "total_acs": 1650, + "total_submitted": 3388, "frontend_question_id": 2153, "is_new_question": false }, @@ -7559,8 +7881,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 9305, - "total_submitted": 22324, + "total_acs": 9408, + "total_submitted": 22561, "frontend_question_id": 2188, "is_new_question": false }, @@ -7582,8 +7904,8 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 30055, - "total_submitted": 93457, + "total_acs": 30311, + "total_submitted": 94254, "frontend_question_id": 2187, "is_new_question": false }, @@ -7605,8 +7927,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": 29491, - "total_submitted": 40886, + "total_acs": 29741, + "total_submitted": 41219, "frontend_question_id": 2186, "is_new_question": false }, @@ -7628,8 +7950,8 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 54323, - "total_submitted": 70371, + "total_acs": 55072, + "total_submitted": 71311, "frontend_question_id": 2185, "is_new_question": false }, @@ -7651,8 +7973,8 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 10056, - "total_submitted": 20836, + "total_acs": 10229, + "total_submitted": 21219, "frontend_question_id": 2172, "is_new_question": false }, @@ -7674,8 +7996,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 20273, - "total_submitted": 48134, + "total_acs": 20401, + "total_submitted": 48460, "frontend_question_id": 2171, "is_new_question": false }, @@ -7697,8 +8019,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": 18624, - "total_submitted": 56116, + "total_acs": 18692, + "total_submitted": 56264, "frontend_question_id": 2170, "is_new_question": false }, @@ -7720,8 +8042,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 48058, - "total_submitted": 63776, + "total_acs": 48543, + "total_submitted": 64395, "frontend_question_id": 2169, "is_new_question": false }, @@ -7743,8 +8065,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": 1297, - "total_submitted": 2797, + "total_acs": 1319, + "total_submitted": 2852, "frontend_question_id": 2152, "is_new_question": false }, @@ -7766,8 +8088,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": 9841, - "total_submitted": 24464, + "total_acs": 9873, + "total_submitted": 24525, "frontend_question_id": 2167, "is_new_question": false }, @@ -7789,8 +8111,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 18002, - "total_submitted": 56920, + "total_acs": 18070, + "total_submitted": 57106, "frontend_question_id": 2166, "is_new_question": false }, @@ -7812,8 +8134,8 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 26665, - "total_submitted": 51830, + "total_acs": 26814, + "total_submitted": 52081, "frontend_question_id": 2165, "is_new_question": false }, @@ -7835,8 +8157,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 39203, - "total_submitted": 59450, + "total_acs": 39616, + "total_submitted": 60180, "frontend_question_id": 2164, "is_new_question": false }, @@ -7858,8 +8180,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": 725, - "total_submitted": 1376, + "total_acs": 729, + "total_submitted": 1382, "frontend_question_id": 2143, "is_new_question": false }, @@ -7881,8 +8203,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": 5254, - "total_submitted": 10352, + "total_acs": 5310, + "total_submitted": 10517, "frontend_question_id": 2142, "is_new_question": false }, @@ -7904,8 +8226,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 5414, - "total_submitted": 14244, + "total_acs": 5502, + "total_submitted": 14428, "frontend_question_id": 2179, "is_new_question": false }, @@ -7927,8 +8249,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 36760, - "total_submitted": 62060, + "total_acs": 36939, + "total_submitted": 62351, "frontend_question_id": 2178, "is_new_question": false }, @@ -7950,8 +8272,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": 30426, - "total_submitted": 47616, + "total_acs": 30740, + "total_submitted": 48088, "frontend_question_id": 2177, "is_new_question": false }, @@ -7973,8 +8295,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": 44810, - "total_submitted": 55771, + "total_acs": 45387, + "total_submitted": 56527, "frontend_question_id": 2176, "is_new_question": false }, @@ -7996,8 +8318,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 7280, - "total_submitted": 28568, + "total_acs": 7329, + "total_submitted": 28691, "frontend_question_id": 2157, "is_new_question": false }, @@ -8019,8 +8341,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 10884, - "total_submitted": 49162, + "total_acs": 10930, + "total_submitted": 49290, "frontend_question_id": 2156, "is_new_question": false }, @@ -8042,8 +8364,8 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 57867, - "total_submitted": 79231, + "total_acs": 58577, + "total_submitted": 80285, "frontend_question_id": 2154, "is_new_question": false }, @@ -8065,8 +8387,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": 1590, - "total_submitted": 2371, + "total_acs": 1601, + "total_submitted": 2390, "frontend_question_id": 2137, "is_new_question": false }, @@ -8088,8 +8410,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 10634, - "total_submitted": 21723, + "total_acs": 10771, + "total_submitted": 21964, "frontend_question_id": 2151, "is_new_question": false }, @@ -8111,8 +8433,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 61665, - "total_submitted": 76236, + "total_acs": 63013, + "total_submitted": 77898, "frontend_question_id": 2149, "is_new_question": false }, @@ -8134,8 +8456,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": 31760, - "total_submitted": 52317, + "total_acs": 32044, + "total_submitted": 52740, "frontend_question_id": 2150, "is_new_question": false }, @@ -8157,8 +8479,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": 37723, - "total_submitted": 62982, + "total_acs": 38068, + "total_submitted": 63559, "frontend_question_id": 2148, "is_new_question": false }, @@ -8180,8 +8502,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": 29828, - "total_submitted": 39083, + "total_acs": 29888, + "total_submitted": 39169, "frontend_question_id": 2128, "is_new_question": false }, @@ -8203,8 +8525,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": 7045, - "total_submitted": 14991, + "total_acs": 7082, + "total_submitted": 15059, "frontend_question_id": 2163, "is_new_question": false }, @@ -8226,8 +8548,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 13054, - "total_submitted": 32818, + "total_acs": 13107, + "total_submitted": 32920, "frontend_question_id": 2162, "is_new_question": false }, @@ -8249,8 +8571,8 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 41792, - "total_submitted": 49418, + "total_acs": 42404, + "total_submitted": 50126, "frontend_question_id": 2161, "is_new_question": false }, @@ -8272,8 +8594,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": 69624, - "total_submitted": 79461, + "total_acs": 71122, + "total_submitted": 81189, "frontend_question_id": 2160, "is_new_question": false }, @@ -8295,8 +8617,8 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 10667, - "total_submitted": 27216, + "total_acs": 10729, + "total_submitted": 27375, "frontend_question_id": 2141, "is_new_question": false }, @@ -8318,8 +8640,8 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 23915, - "total_submitted": 51809, + "total_acs": 24050, + "total_submitted": 52074, "frontend_question_id": 2140, "is_new_question": false }, @@ -8341,8 +8663,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": 23919, - "total_submitted": 37671, + "total_acs": 24007, + "total_submitted": 37849, "frontend_question_id": 2155, "is_new_question": false }, @@ -8364,8 +8686,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": 33060, - "total_submitted": 50612, + "total_acs": 33267, + "total_submitted": 50912, "frontend_question_id": 2138, "is_new_question": false }, @@ -8387,8 +8709,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": 644, - "total_submitted": 1556, + "total_acs": 649, + "total_submitted": 1579, "frontend_question_id": 2123, "is_new_question": false }, @@ -8410,8 +8732,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": 1369, - "total_submitted": 1879, + "total_acs": 1384, + "total_submitted": 1896, "frontend_question_id": 2113, "is_new_question": false }, @@ -8433,8 +8755,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 45333, - "total_submitted": 60987, + "total_acs": 45545, + "total_submitted": 61324, "frontend_question_id": 2136, "is_new_question": false }, @@ -8456,8 +8778,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": 28718, - "total_submitted": 67079, + "total_acs": 28826, + "total_submitted": 67345, "frontend_question_id": 2135, "is_new_question": false }, @@ -8479,8 +8801,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": 20296, - "total_submitted": 39803, + "total_acs": 20458, + "total_submitted": 40054, "frontend_question_id": 2134, "is_new_question": false }, @@ -8502,8 +8824,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": 47400, - "total_submitted": 89817, + "total_acs": 47884, + "total_submitted": 90741, "frontend_question_id": 2133, "is_new_question": false }, @@ -8525,8 +8847,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 1405, - "total_submitted": 2462, + "total_acs": 1421, + "total_submitted": 2492, "frontend_question_id": 2118, "is_new_question": false }, @@ -8548,8 +8870,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 4905, - "total_submitted": 6881, + "total_acs": 4976, + "total_submitted": 6964, "frontend_question_id": 2112, "is_new_question": false }, @@ -8571,8 +8893,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": 9159, - "total_submitted": 22942, + "total_acs": 9208, + "total_submitted": 23043, "frontend_question_id": 2147, "is_new_question": false }, @@ -8594,8 +8916,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": 11421, - "total_submitted": 27719, + "total_acs": 11508, + "total_submitted": 27886, "frontend_question_id": 2146, "is_new_question": false }, @@ -8617,8 +8939,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 14248, - "total_submitted": 38797, + "total_acs": 14314, + "total_submitted": 38933, "frontend_question_id": 2145, "is_new_question": false }, @@ -8640,8 +8962,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": 32524, - "total_submitted": 53311, + "total_acs": 32834, + "total_submitted": 53873, "frontend_question_id": 2144, "is_new_question": false }, @@ -8663,8 +8985,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": 2092, - "total_submitted": 3710, + "total_acs": 2117, + "total_submitted": 3754, "frontend_question_id": 2107, "is_new_question": false }, @@ -8686,8 +9008,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": 7779, - "total_submitted": 22710, + "total_acs": 7858, + "total_submitted": 22853, "frontend_question_id": 2127, "is_new_question": false }, @@ -8709,8 +9031,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 25188, - "total_submitted": 50636, + "total_acs": 25408, + "total_submitted": 51061, "frontend_question_id": 2126, "is_new_question": false }, @@ -8732,8 +9054,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": 41214, - "total_submitted": 49945, + "total_acs": 41667, + "total_submitted": 50505, "frontend_question_id": 2125, "is_new_question": false }, @@ -8755,8 +9077,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": 47425, - "total_submitted": 66441, + "total_acs": 47998, + "total_submitted": 67235, "frontend_question_id": 2124, "is_new_question": false }, @@ -8778,8 +9100,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": 1985, - "total_submitted": 5183, + "total_acs": 2004, + "total_submitted": 5254, "frontend_question_id": 2098, "is_new_question": false }, @@ -8801,8 +9123,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 8472, - "total_submitted": 22115, + "total_acs": 8496, + "total_submitted": 22166, "frontend_question_id": 2122, "is_new_question": false }, @@ -8824,8 +9146,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 14685, - "total_submitted": 33885, + "total_acs": 14763, + "total_submitted": 34056, "frontend_question_id": 2121, "is_new_question": false }, @@ -8847,8 +9169,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": 21751, - "total_submitted": 26094, + "total_acs": 21906, + "total_submitted": 26288, "frontend_question_id": 2120, "is_new_question": false }, @@ -8870,8 +9192,8 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 48889, - "total_submitted": 64083, + "total_acs": 49602, + "total_submitted": 64928, "frontend_question_id": 2119, "is_new_question": false }, @@ -8893,8 +9215,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": 92693, - "total_submitted": 189800, + "total_acs": 93531, + "total_submitted": 191751, "frontend_question_id": 2131, "is_new_question": false }, @@ -8916,8 +9238,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": 79854, - "total_submitted": 98428, + "total_acs": 80831, + "total_submitted": 99704, "frontend_question_id": 2130, "is_new_question": false }, @@ -8939,8 +9261,8 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 39140, - "total_submitted": 63574, + "total_acs": 39648, + "total_submitted": 64280, "frontend_question_id": 2129, "is_new_question": false }, @@ -8962,8 +9284,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": 10488, - "total_submitted": 27725, + "total_acs": 10529, + "total_submitted": 27966, "frontend_question_id": 2111, "is_new_question": false }, @@ -8985,8 +9307,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": 26441, - "total_submitted": 45884, + "total_acs": 26646, + "total_submitted": 46239, "frontend_question_id": 2110, "is_new_question": false }, @@ -9008,8 +9330,8 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 28653, - "total_submitted": 50811, + "total_acs": 28937, + "total_submitted": 51278, "frontend_question_id": 2109, "is_new_question": false }, @@ -9031,8 +9353,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": 73859, - "total_submitted": 93979, + "total_acs": 74824, + "total_submitted": 95160, "frontend_question_id": 2108, "is_new_question": false }, @@ -9054,8 +9376,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": 3424, - "total_submitted": 6131, + "total_acs": 3461, + "total_submitted": 6185, "frontend_question_id": 2093, "is_new_question": false }, @@ -9077,8 +9399,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": 8215, - "total_submitted": 23313, + "total_acs": 8259, + "total_submitted": 23405, "frontend_question_id": 2106, "is_new_question": false }, @@ -9100,8 +9422,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 14556, - "total_submitted": 29189, + "total_acs": 14650, + "total_submitted": 29413, "frontend_question_id": 2105, "is_new_question": false }, @@ -9123,8 +9445,8 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 64584, - "total_submitted": 107222, + "total_acs": 64901, + "total_submitted": 107726, "frontend_question_id": 2104, "is_new_question": false }, @@ -9146,8 +9468,8 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 48060, - "total_submitted": 59033, + "total_acs": 48614, + "total_submitted": 59704, "frontend_question_id": 2103, "is_new_question": false }, @@ -9169,8 +9491,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": 4952, - "total_submitted": 7278, + "total_acs": 4971, + "total_submitted": 7304, "frontend_question_id": 2083, "is_new_question": false }, @@ -9192,8 +9514,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": 6260, - "total_submitted": 6939, + "total_acs": 6335, + "total_submitted": 7020, "frontend_question_id": 2084, "is_new_question": false }, @@ -9215,8 +9537,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 7352, - "total_submitted": 9158, + "total_acs": 7457, + "total_submitted": 9287, "frontend_question_id": 2082, "is_new_question": false }, @@ -9238,8 +9560,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 2484, - "total_submitted": 8871, + "total_acs": 2496, + "total_submitted": 8940, "frontend_question_id": 2117, "is_new_question": false }, @@ -9261,8 +9583,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": 14246, - "total_submitted": 45591, + "total_acs": 14358, + "total_submitted": 45966, "frontend_question_id": 2116, "is_new_question": false }, @@ -9284,8 +9606,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": 61082, - "total_submitted": 125862, + "total_acs": 61664, + "total_submitted": 127036, "frontend_question_id": 2115, "is_new_question": false }, @@ -9307,8 +9629,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": 150513, - "total_submitted": 171614, + "total_acs": 153187, + "total_submitted": 174750, "frontend_question_id": 2114, "is_new_question": false }, @@ -9330,8 +9652,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": 2794, - "total_submitted": 5025, + "total_acs": 2826, + "total_submitted": 5083, "frontend_question_id": 2077, "is_new_question": false }, @@ -9353,8 +9675,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": 76807, - "total_submitted": 158225, + "total_acs": 77484, + "total_submitted": 159712, "frontend_question_id": 2096, "is_new_question": false }, @@ -9376,8 +9698,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": 167157, - "total_submitted": 278531, + "total_acs": 168770, + "total_submitted": 281598, "frontend_question_id": 2095, "is_new_question": false }, @@ -9399,8 +9721,8 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 21344, - "total_submitted": 37025, + "total_acs": 21529, + "total_submitted": 37290, "frontend_question_id": 2094, "is_new_question": false }, @@ -9422,8 +9744,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 7036, - "total_submitted": 9703, + "total_acs": 7129, + "total_submitted": 9813, "frontend_question_id": 2072, "is_new_question": false }, @@ -9445,8 +9767,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 19824, - "total_submitted": 58043, + "total_acs": 19954, + "total_submitted": 58399, "frontend_question_id": 2092, "is_new_question": false }, @@ -9468,8 +9790,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 27128, - "total_submitted": 48128, + "total_acs": 27367, + "total_submitted": 48578, "frontend_question_id": 2091, "is_new_question": false }, @@ -9491,8 +9813,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 21550, - "total_submitted": 50658, + "total_acs": 21969, + "total_submitted": 51592, "frontend_question_id": 2090, "is_new_question": false }, @@ -9514,8 +9836,8 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 99531, - "total_submitted": 130032, + "total_acs": 100924, + "total_submitted": 131805, "frontend_question_id": 2089, "is_new_question": false }, @@ -9537,8 +9859,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 1728, - "total_submitted": 3555, + "total_acs": 1744, + "total_submitted": 3599, "frontend_question_id": 2067, "is_new_question": false }, @@ -9560,8 +9882,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 5904, - "total_submitted": 6911, + "total_acs": 5967, + "total_submitted": 6985, "frontend_question_id": 2066, "is_new_question": false }, @@ -9583,8 +9905,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 11611, - "total_submitted": 17579, + "total_acs": 11700, + "total_submitted": 17708, "frontend_question_id": 2102, "is_new_question": false }, @@ -9606,8 +9928,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 25295, - "total_submitted": 60542, + "total_acs": 25928, + "total_submitted": 61885, "frontend_question_id": 2101, "is_new_question": false }, @@ -9629,8 +9951,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": 18983, - "total_submitted": 38603, + "total_acs": 19156, + "total_submitted": 38953, "frontend_question_id": 2100, "is_new_question": false }, @@ -9652,8 +9974,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": 29623, - "total_submitted": 69265, + "total_acs": 29973, + "total_submitted": 70047, "frontend_question_id": 2099, "is_new_question": false }, @@ -9675,8 +9997,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 3368, - "total_submitted": 6152, + "total_acs": 3382, + "total_submitted": 6176, "frontend_question_id": 2061, "is_new_question": false }, @@ -9698,8 +10020,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 6157, - "total_submitted": 14691, + "total_acs": 6174, + "total_submitted": 14723, "frontend_question_id": 2081, "is_new_question": false }, @@ -9721,8 +10043,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 6657, - "total_submitted": 16158, + "total_acs": 6731, + "total_submitted": 16335, "frontend_question_id": 2097, "is_new_question": false }, @@ -9744,8 +10066,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 5181, - "total_submitted": 16654, + "total_acs": 5221, + "total_submitted": 16730, "frontend_question_id": 2132, "is_new_question": false }, @@ -9767,8 +10089,8 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 37555, - "total_submitted": 55962, + "total_acs": 37976, + "total_submitted": 56593, "frontend_question_id": 2078, "is_new_question": false }, @@ -9790,8 +10112,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 13012, - "total_submitted": 24420, + "total_acs": 13089, + "total_submitted": 24563, "frontend_question_id": 2076, "is_new_question": false }, @@ -9813,8 +10135,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 10343, - "total_submitted": 20595, + "total_acs": 10440, + "total_submitted": 20748, "frontend_question_id": 2075, "is_new_question": false }, @@ -9836,8 +10158,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 14326, - "total_submitted": 27251, + "total_acs": 14497, + "total_submitted": 27523, "frontend_question_id": 2074, "is_new_question": false }, @@ -9859,8 +10181,8 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 35794, - "total_submitted": 57665, + "total_acs": 36276, + "total_submitted": 58385, "frontend_question_id": 2073, "is_new_question": false }, @@ -9882,8 +10204,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": 4959, - "total_submitted": 6786, + "total_acs": 5010, + "total_submitted": 6855, "frontend_question_id": 2051, "is_new_question": false }, @@ -9905,8 +10227,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 5477, - "total_submitted": 8605, + "total_acs": 5516, + "total_submitted": 8668, "frontend_question_id": 2088, "is_new_question": false }, @@ -9928,8 +10250,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": 12668, - "total_submitted": 24637, + "total_acs": 12763, + "total_submitted": 24875, "frontend_question_id": 2087, "is_new_question": false }, @@ -9951,8 +10273,8 @@ "question__title": "Minimum Number of Food Buckets to Feed the Hamsters", "question__title_slug": "minimum-number-of-food-buckets-to-feed-the-hamsters", "question__hide": false, - "total_acs": 13595, - "total_submitted": 30124, + "total_acs": 13680, + "total_submitted": 30300, "frontend_question_id": 2086, "is_new_question": false }, @@ -9974,8 +10296,8 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 39772, - "total_submitted": 56962, + "total_acs": 40307, + "total_submitted": 57694, "frontend_question_id": 2085, "is_new_question": false }, @@ -9997,8 +10319,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 14306, - "total_submitted": 24886, + "total_acs": 14373, + "total_submitted": 24989, "frontend_question_id": 2065, "is_new_question": false }, @@ -10020,8 +10342,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": 17553, - "total_submitted": 35037, + "total_acs": 17678, + "total_submitted": 35254, "frontend_question_id": 2064, "is_new_question": false }, @@ -10043,8 +10365,8 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 20127, - "total_submitted": 36686, + "total_acs": 20284, + "total_submitted": 36991, "frontend_question_id": 2063, "is_new_question": false }, @@ -10066,8 +10388,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 25110, - "total_submitted": 37995, + "total_acs": 25347, + "total_submitted": 38339, "frontend_question_id": 2062, "is_new_question": false }, @@ -10089,8 +10411,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 5581, - "total_submitted": 7023, + "total_acs": 5649, + "total_submitted": 7110, "frontend_question_id": 2041, "is_new_question": false }, @@ -10112,8 +10434,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": 8782, - "total_submitted": 21532, + "total_acs": 8812, + "total_submitted": 21616, "frontend_question_id": 2060, "is_new_question": false }, @@ -10135,8 +10457,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 12616, - "total_submitted": 26575, + "total_acs": 12669, + "total_submitted": 26679, "frontend_question_id": 2059, "is_new_question": false }, @@ -10158,8 +10480,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": 21584, - "total_submitted": 37847, + "total_acs": 21738, + "total_submitted": 38112, "frontend_question_id": 2058, "is_new_question": false }, @@ -10181,8 +10503,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 37444, - "total_submitted": 52402, + "total_acs": 37825, + "total_submitted": 52938, "frontend_question_id": 2057, "is_new_question": false }, @@ -10204,8 +10526,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": 6327, - "total_submitted": 18294, + "total_acs": 6355, + "total_submitted": 18405, "frontend_question_id": 2071, "is_new_question": false }, @@ -10227,8 +10549,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 11494, - "total_submitted": 23101, + "total_acs": 11595, + "total_submitted": 23287, "frontend_question_id": 2070, "is_new_question": false }, @@ -10250,8 +10572,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 7550, - "total_submitted": 32678, + "total_acs": 7588, + "total_submitted": 32830, "frontend_question_id": 2069, "is_new_question": false }, @@ -10273,8 +10595,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": 28519, - "total_submitted": 44140, + "total_acs": 29048, + "total_submitted": 45050, "frontend_question_id": 2068, "is_new_question": false }, @@ -10296,8 +10618,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 16729, - "total_submitted": 28151, + "total_acs": 16859, + "total_submitted": 28353, "frontend_question_id": 2050, "is_new_question": false }, @@ -10319,8 +10641,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 15227, - "total_submitted": 32138, + "total_acs": 15529, + "total_submitted": 32614, "frontend_question_id": 2049, "is_new_question": false }, @@ -10342,8 +10664,8 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 10437, - "total_submitted": 22090, + "total_acs": 10487, + "total_submitted": 22195, "frontend_question_id": 2048, "is_new_question": false }, @@ -10365,8 +10687,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": 20183, - "total_submitted": 68431, + "total_acs": 20358, + "total_submitted": 69081, "frontend_question_id": 2047, "is_new_question": false }, @@ -10388,8 +10710,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 7954, - "total_submitted": 9339, + "total_acs": 8061, + "total_submitted": 9455, "frontend_question_id": 2026, "is_new_question": false }, @@ -10411,8 +10733,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 8345, - "total_submitted": 21317, + "total_acs": 8375, + "total_submitted": 21390, "frontend_question_id": 2045, "is_new_question": false }, @@ -10434,8 +10756,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": 19053, - "total_submitted": 25355, + "total_acs": 19233, + "total_submitted": 25583, "frontend_question_id": 2044, "is_new_question": false }, @@ -10457,8 +10779,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 17264, - "total_submitted": 26322, + "total_acs": 17387, + "total_submitted": 26529, "frontend_question_id": 2043, "is_new_question": false }, @@ -10480,8 +10802,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": 37295, - "total_submitted": 56022, + "total_acs": 37677, + "total_submitted": 56512, "frontend_question_id": 2042, "is_new_question": false }, @@ -10503,8 +10825,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": 6930, - "total_submitted": 9407, + "total_acs": 7021, + "total_submitted": 9527, "frontend_question_id": 2020, "is_new_question": false }, @@ -10526,8 +10848,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": 3279, - "total_submitted": 5587, + "total_acs": 3288, + "total_submitted": 5620, "frontend_question_id": 2056, "is_new_question": false }, @@ -10549,8 +10871,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 27262, - "total_submitted": 61358, + "total_acs": 27506, + "total_submitted": 61839, "frontend_question_id": 2055, "is_new_question": false }, @@ -10572,8 +10894,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 12649, - "total_submitted": 28040, + "total_acs": 12743, + "total_submitted": 28248, "frontend_question_id": 2054, "is_new_question": false }, @@ -10595,8 +10917,8 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 38734, - "total_submitted": 53852, + "total_acs": 39326, + "total_submitted": 54715, "frontend_question_id": 2053, "is_new_question": false }, @@ -10618,8 +10940,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": 11936, - "total_submitted": 63893, + "total_acs": 12153, + "total_submitted": 64797, "frontend_question_id": 2035, "is_new_question": false }, @@ -10641,8 +10963,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 53186, - "total_submitted": 108492, + "total_acs": 53790, + "total_submitted": 109742, "frontend_question_id": 2034, "is_new_question": false }, @@ -10664,8 +10986,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": 18096, - "total_submitted": 34540, + "total_acs": 18175, + "total_submitted": 34701, "frontend_question_id": 2033, "is_new_question": false }, @@ -10687,8 +11009,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 41659, - "total_submitted": 57107, + "total_acs": 42202, + "total_submitted": 57786, "frontend_question_id": 2032, "is_new_question": false }, @@ -10710,8 +11032,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": 3507, - "total_submitted": 6005, + "total_acs": 3565, + "total_submitted": 6093, "frontend_question_id": 2010, "is_new_question": false }, @@ -10733,8 +11055,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": 5894, - "total_submitted": 15183, + "total_acs": 5931, + "total_submitted": 15275, "frontend_question_id": 2030, "is_new_question": false }, @@ -10756,8 +11078,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 6101, - "total_submitted": 23032, + "total_acs": 6119, + "total_submitted": 23091, "frontend_question_id": 2029, "is_new_question": false }, @@ -10779,8 +11101,8 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 18612, - "total_submitted": 42160, + "total_acs": 18859, + "total_submitted": 42626, "frontend_question_id": 2028, "is_new_question": false }, @@ -10802,8 +11124,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 25214, - "total_submitted": 46763, + "total_acs": 25383, + "total_submitted": 47068, "frontend_question_id": 2027, "is_new_question": false }, @@ -10825,8 +11147,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 402, - "total_submitted": 646, + "total_acs": 408, + "total_submitted": 653, "frontend_question_id": 2005, "is_new_question": false }, @@ -10848,8 +11170,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": 5421, - "total_submitted": 13651, + "total_acs": 5462, + "total_submitted": 13799, "frontend_question_id": 2004, "is_new_question": false }, @@ -10871,8 +11193,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": 10141, - "total_submitted": 19932, + "total_acs": 10204, + "total_submitted": 20062, "frontend_question_id": 2039, "is_new_question": false }, @@ -10894,8 +11216,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": 8689, - "total_submitted": 30011, + "total_acs": 8724, + "total_submitted": 30167, "frontend_question_id": 2040, "is_new_question": false }, @@ -10917,8 +11239,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": 21227, - "total_submitted": 36554, + "total_acs": 21557, + "total_submitted": 37140, "frontend_question_id": 2038, "is_new_question": false }, @@ -10940,8 +11262,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": 41770, - "total_submitted": 50869, + "total_acs": 42258, + "total_submitted": 51470, "frontend_question_id": 2037, "is_new_question": false }, @@ -10963,8 +11285,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": 5490, - "total_submitted": 16265, + "total_acs": 5516, + "total_submitted": 16348, "frontend_question_id": 2019, "is_new_question": false }, @@ -10986,8 +11308,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": 16526, - "total_submitted": 33381, + "total_acs": 16604, + "total_submitted": 33542, "frontend_question_id": 2018, "is_new_question": false }, @@ -11009,8 +11331,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 13815, - "total_submitted": 31977, + "total_acs": 13998, + "total_submitted": 32451, "frontend_question_id": 2017, "is_new_question": false }, @@ -11032,8 +11354,8 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 52923, - "total_submitted": 98414, + "total_acs": 53508, + "total_submitted": 99375, "frontend_question_id": 2016, "is_new_question": false }, @@ -11055,8 +11377,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 4437, - "total_submitted": 8561, + "total_acs": 4480, + "total_submitted": 8650, "frontend_question_id": 1990, "is_new_question": false }, @@ -11078,8 +11400,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": 1443, - "total_submitted": 2466, + "total_acs": 1453, + "total_submitted": 2480, "frontend_question_id": 2015, "is_new_question": false }, @@ -11101,8 +11423,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": 1168, - "total_submitted": 2376, + "total_acs": 1188, + "total_submitted": 2403, "frontend_question_id": 1999, "is_new_question": false }, @@ -11124,8 +11446,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 5474, - "total_submitted": 9853, + "total_acs": 5512, + "total_submitted": 9924, "frontend_question_id": 2014, "is_new_question": false }, @@ -11147,8 +11469,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 41990, - "total_submitted": 83587, + "total_acs": 42461, + "total_submitted": 84510, "frontend_question_id": 2013, "is_new_question": false }, @@ -11170,8 +11492,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 17555, - "total_submitted": 37544, + "total_acs": 17628, + "total_submitted": 37715, "frontend_question_id": 2012, "is_new_question": false }, @@ -11193,8 +11515,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": 189350, - "total_submitted": 213243, + "total_acs": 192866, + "total_submitted": 217219, "frontend_question_id": 2011, "is_new_question": false }, @@ -11216,8 +11538,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 7543, - "total_submitted": 10822, + "total_acs": 7701, + "total_submitted": 11079, "frontend_question_id": 1988, "is_new_question": false }, @@ -11239,8 +11561,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": 6641, - "total_submitted": 20331, + "total_acs": 6679, + "total_submitted": 20429, "frontend_question_id": 2025, "is_new_question": false }, @@ -11262,8 +11584,8 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 22531, - "total_submitted": 37619, + "total_acs": 22800, + "total_submitted": 38002, "frontend_question_id": 2024, "is_new_question": false }, @@ -11285,8 +11607,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": 28488, - "total_submitted": 38922, + "total_acs": 28785, + "total_submitted": 39326, "frontend_question_id": 2023, "is_new_question": false }, @@ -11308,8 +11630,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 51865, - "total_submitted": 88421, + "total_acs": 52532, + "total_submitted": 89458, "frontend_question_id": 2022, "is_new_question": false }, @@ -11331,8 +11653,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": 6200, - "total_submitted": 13958, + "total_acs": 6224, + "total_submitted": 14003, "frontend_question_id": 2003, "is_new_question": false }, @@ -11354,8 +11676,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": 16049, - "total_submitted": 30009, + "total_acs": 16187, + "total_submitted": 30232, "frontend_question_id": 2002, "is_new_question": false }, @@ -11377,8 +11699,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 22021, - "total_submitted": 48368, + "total_acs": 22318, + "total_submitted": 48907, "frontend_question_id": 2001, "is_new_question": false }, @@ -11400,8 +11722,8 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 54106, - "total_submitted": 69315, + "total_acs": 55020, + "total_submitted": 70369, "frontend_question_id": 2000, "is_new_question": false }, @@ -11423,8 +11745,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 7826, - "total_submitted": 15506, + "total_acs": 7906, + "total_submitted": 15674, "frontend_question_id": 1978, "is_new_question": false }, @@ -11446,8 +11768,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": 7362, - "total_submitted": 9806, + "total_acs": 7400, + "total_submitted": 9858, "frontend_question_id": 1973, "is_new_question": false }, @@ -11469,8 +11791,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 6350, - "total_submitted": 13908, + "total_acs": 6396, + "total_submitted": 14033, "frontend_question_id": 1998, "is_new_question": false }, @@ -11492,8 +11814,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": 7300, - "total_submitted": 19783, + "total_acs": 7326, + "total_submitted": 19859, "frontend_question_id": 1997, "is_new_question": false }, @@ -11515,8 +11837,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": 91529, - "total_submitted": 208037, + "total_acs": 91836, + "total_submitted": 208736, "frontend_question_id": 1996, "is_new_question": false }, @@ -11538,8 +11860,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 28454, - "total_submitted": 47755, + "total_acs": 28690, + "total_submitted": 48108, "frontend_question_id": 1995, "is_new_question": false }, @@ -11561,8 +11883,8 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 210428, - "total_submitted": 401062, + "total_acs": 212552, + "total_submitted": 405518, "frontend_question_id": 1971, "is_new_question": false }, @@ -11584,8 +11906,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": 6688, - "total_submitted": 12622, + "total_acs": 6756, + "total_submitted": 12745, "frontend_question_id": 1972, "is_new_question": false }, @@ -11607,8 +11929,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": 10096, - "total_submitted": 22084, + "total_acs": 10144, + "total_submitted": 22175, "frontend_question_id": 2009, "is_new_question": false }, @@ -11630,8 +11952,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 20199, - "total_submitted": 46358, + "total_acs": 20326, + "total_submitted": 46645, "frontend_question_id": 2008, "is_new_question": false }, @@ -11653,8 +11975,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 115461, - "total_submitted": 282938, + "total_acs": 115737, + "total_submitted": 283759, "frontend_question_id": 2007, "is_new_question": false }, @@ -11676,8 +11998,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": 82562, - "total_submitted": 100039, + "total_acs": 83657, + "total_submitted": 101300, "frontend_question_id": 2006, "is_new_question": false }, @@ -11699,8 +12021,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 8898, - "total_submitted": 17018, + "total_acs": 8929, + "total_submitted": 17083, "frontend_question_id": 1987, "is_new_question": false }, @@ -11722,8 +12044,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": 18464, - "total_submitted": 55978, + "total_acs": 18595, + "total_submitted": 56425, "frontend_question_id": 1986, "is_new_question": false }, @@ -11745,8 +12067,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": 42228, - "total_submitted": 94608, + "total_acs": 42613, + "total_submitted": 95469, "frontend_question_id": 1985, "is_new_question": false }, @@ -11768,8 +12090,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": 37942, - "total_submitted": 70143, + "total_acs": 38542, + "total_submitted": 71205, "frontend_question_id": 1984, "is_new_question": false }, @@ -11791,8 +12113,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": 2122, - "total_submitted": 3249, + "total_acs": 2139, + "total_submitted": 3274, "frontend_question_id": 1966, "is_new_question": false }, @@ -11814,8 +12136,8 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 68556, - "total_submitted": 87415, + "total_acs": 70966, + "total_submitted": 90940, "frontend_question_id": 1965, "is_new_question": false }, @@ -11837,8 +12159,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 4001, - "total_submitted": 8218, + "total_acs": 4019, + "total_submitted": 8287, "frontend_question_id": 1982, "is_new_question": false }, @@ -11860,8 +12182,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": 19425, - "total_submitted": 59993, + "total_acs": 19516, + "total_submitted": 60228, "frontend_question_id": 1981, "is_new_question": false }, @@ -11883,8 +12205,8 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 32854, - "total_submitted": 50852, + "total_acs": 33211, + "total_submitted": 51358, "frontend_question_id": 1980, "is_new_question": false }, @@ -11906,8 +12228,8 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 68824, - "total_submitted": 89699, + "total_acs": 69889, + "total_submitted": 91142, "frontend_question_id": 1979, "is_new_question": false }, @@ -11929,8 +12251,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 4855, - "total_submitted": 14028, + "total_acs": 4886, + "total_submitted": 14096, "frontend_question_id": 1994, "is_new_question": false }, @@ -11952,8 +12274,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 9579, - "total_submitted": 21882, + "total_acs": 9698, + "total_submitted": 22137, "frontend_question_id": 1993, "is_new_question": false }, @@ -11975,8 +12297,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 20077, - "total_submitted": 29243, + "total_acs": 20203, + "total_submitted": 29413, "frontend_question_id": 1992, "is_new_question": false }, @@ -11998,8 +12320,8 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 52870, - "total_submitted": 78547, + "total_acs": 53684, + "total_submitted": 79699, "frontend_question_id": 1991, "is_new_question": false }, @@ -12021,8 +12343,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": 11025, - "total_submitted": 22280, + "total_acs": 11097, + "total_submitted": 22379, "frontend_question_id": 1970, "is_new_question": false }, @@ -12044,8 +12366,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": 8520, - "total_submitted": 25096, + "total_acs": 8582, + "total_submitted": 25256, "frontend_question_id": 1969, "is_new_question": false }, @@ -12067,8 +12389,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": 42912, - "total_submitted": 53627, + "total_acs": 43464, + "total_submitted": 54308, "frontend_question_id": 1967, "is_new_question": false }, @@ -12090,8 +12412,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": 7781, - "total_submitted": 10736, + "total_acs": 7905, + "total_submitted": 10900, "frontend_question_id": 1951, "is_new_question": false }, @@ -12113,8 +12435,8 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 8179, - "total_submitted": 14199, + "total_acs": 8276, + "total_submitted": 14392, "frontend_question_id": 1949, "is_new_question": false }, @@ -12136,8 +12458,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": 9879, - "total_submitted": 21017, + "total_acs": 9924, + "total_submitted": 21106, "frontend_question_id": 1964, "is_new_question": false }, @@ -12159,8 +12481,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": 41074, - "total_submitted": 59717, + "total_acs": 41555, + "total_submitted": 60374, "frontend_question_id": 1963, "is_new_question": false }, @@ -12182,8 +12504,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 74942, - "total_submitted": 125001, + "total_acs": 75354, + "total_submitted": 125616, "frontend_question_id": 1962, "is_new_question": false }, @@ -12205,8 +12527,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": 34800, - "total_submitted": 64625, + "total_acs": 35054, + "total_submitted": 65210, "frontend_question_id": 1961, "is_new_question": false }, @@ -12228,8 +12550,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 7487, - "total_submitted": 12332, + "total_acs": 7566, + "total_submitted": 12538, "frontend_question_id": 1939, "is_new_question": false }, @@ -12251,8 +12573,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 3964, - "total_submitted": 19166, + "total_acs": 4110, + "total_submitted": 19630, "frontend_question_id": 1977, "is_new_question": false }, @@ -12274,8 +12596,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": 25498, - "total_submitted": 80300, + "total_acs": 25951, + "total_submitted": 82107, "frontend_question_id": 1976, "is_new_question": false }, @@ -12297,8 +12619,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 12733, - "total_submitted": 27728, + "total_acs": 13061, + "total_submitted": 28224, "frontend_question_id": 1975, "is_new_question": false }, @@ -12320,8 +12642,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": 27803, - "total_submitted": 38696, + "total_acs": 27996, + "total_submitted": 38959, "frontend_question_id": 1974, "is_new_question": false }, @@ -12343,8 +12665,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 9153, - "total_submitted": 11815, + "total_acs": 9221, + "total_submitted": 11911, "frontend_question_id": 1934, "is_new_question": false }, @@ -12366,8 +12688,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 8998, - "total_submitted": 17553, + "total_acs": 9034, + "total_submitted": 17606, "frontend_question_id": 1955, "is_new_question": false }, @@ -12389,8 +12711,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": 22062, - "total_submitted": 44686, + "total_acs": 22321, + "total_submitted": 45209, "frontend_question_id": 1968, "is_new_question": false }, @@ -12412,8 +12734,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": 18427, - "total_submitted": 46921, + "total_acs": 18477, + "total_submitted": 47034, "frontend_question_id": 1953, "is_new_question": false }, @@ -12435,8 +12757,8 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 38019, - "total_submitted": 66241, + "total_acs": 38490, + "total_submitted": 67010, "frontend_question_id": 1952, "is_new_question": false }, @@ -12458,8 +12780,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": 1294, - "total_submitted": 2562, + "total_acs": 1298, + "total_submitted": 2571, "frontend_question_id": 2052, "is_new_question": false }, @@ -12481,8 +12803,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": 6530, - "total_submitted": 15507, + "total_acs": 6553, + "total_submitted": 15551, "frontend_question_id": 1959, "is_new_question": false }, @@ -12504,8 +12826,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 8481, - "total_submitted": 18847, + "total_acs": 8548, + "total_submitted": 18960, "frontend_question_id": 1958, "is_new_question": false }, @@ -12527,8 +12849,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 6782, - "total_submitted": 11920, + "total_acs": 6802, + "total_submitted": 11962, "frontend_question_id": 1948, "is_new_question": false }, @@ -12550,8 +12872,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 18156, - "total_submitted": 29788, + "total_acs": 18279, + "total_submitted": 29975, "frontend_question_id": 1947, "is_new_question": false }, @@ -12573,8 +12895,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 16581, - "total_submitted": 47705, + "total_acs": 16661, + "total_submitted": 47933, "frontend_question_id": 1946, "is_new_question": false }, @@ -12596,8 +12918,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": 35904, - "total_submitted": 58469, + "total_acs": 36293, + "total_submitted": 59054, "frontend_question_id": 1945, "is_new_question": false }, @@ -12619,8 +12941,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 3769, - "total_submitted": 6029, + "total_acs": 3822, + "total_submitted": 6118, "frontend_question_id": 2021, "is_new_question": false }, @@ -12642,8 +12964,8 @@ "question__title": "Erect the Fence II", "question__title_slug": "erect-the-fence-ii", "question__hide": false, - "total_acs": 537, - "total_submitted": 1004, + "total_acs": 541, + "total_submitted": 1009, "frontend_question_id": 1924, "is_new_question": false }, @@ -12665,8 +12987,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": 632, - "total_submitted": 1347, + "total_acs": 651, + "total_submitted": 1383, "frontend_question_id": 1956, "is_new_question": false }, @@ -12688,8 +13010,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": 2350, - "total_submitted": 4680, + "total_acs": 2359, + "total_submitted": 4703, "frontend_question_id": 1950, "is_new_question": false }, @@ -12711,8 +13033,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 4796, - "total_submitted": 6059, + "total_acs": 4837, + "total_submitted": 6120, "frontend_question_id": 1940, "is_new_question": false }, @@ -12734,8 +13056,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": 2723, - "total_submitted": 5420, + "total_acs": 2738, + "total_submitted": 5458, "frontend_question_id": 1933, "is_new_question": false }, @@ -12757,8 +13079,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 3051, - "total_submitted": 5791, + "total_acs": 3070, + "total_submitted": 5830, "frontend_question_id": 1918, "is_new_question": false }, @@ -12780,8 +13102,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 4141, - "total_submitted": 10474, + "total_acs": 4153, + "total_submitted": 10513, "frontend_question_id": 1938, "is_new_question": false }, @@ -12803,8 +13125,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 53127, - "total_submitted": 146851, + "total_acs": 53259, + "total_submitted": 147268, "frontend_question_id": 1937, "is_new_question": false }, @@ -12826,8 +13148,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 22181, - "total_submitted": 51744, + "total_acs": 22254, + "total_submitted": 51925, "frontend_question_id": 1936, "is_new_question": false }, @@ -12849,8 +13171,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 740, - "total_submitted": 1706, + "total_acs": 754, + "total_submitted": 1746, "frontend_question_id": 2307, "is_new_question": false }, @@ -12872,8 +13194,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 3795, - "total_submitted": 8778, + "total_acs": 3826, + "total_submitted": 8856, "frontend_question_id": 1919, "is_new_question": false }, @@ -12895,8 +13217,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 4538, - "total_submitted": 15915, + "total_acs": 4580, + "total_submitted": 16141, "frontend_question_id": 1917, "is_new_question": false }, @@ -12918,8 +13240,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 1272, - "total_submitted": 2236, + "total_acs": 1285, + "total_submitted": 2251, "frontend_question_id": 1908, "is_new_question": false }, @@ -12941,8 +13263,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": 7376, - "total_submitted": 12904, + "total_acs": 7400, + "total_submitted": 12948, "frontend_question_id": 1931, "is_new_question": false }, @@ -12964,8 +13286,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 6014, - "total_submitted": 16921, + "total_acs": 6055, + "total_submitted": 17053, "frontend_question_id": 1932, "is_new_question": false }, @@ -12987,8 +13309,8 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 21157, - "total_submitted": 40894, + "total_acs": 21473, + "total_submitted": 41424, "frontend_question_id": 1930, "is_new_question": false }, @@ -13010,8 +13332,8 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 339260, - "total_submitted": 373241, + "total_acs": 346099, + "total_submitted": 381217, "frontend_question_id": 1929, "is_new_question": false }, @@ -13033,8 +13355,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 7676, - "total_submitted": 11979, + "total_acs": 7747, + "total_submitted": 12100, "frontend_question_id": 1907, "is_new_question": false }, @@ -13056,8 +13378,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 1200, - "total_submitted": 2118, + "total_acs": 1226, + "total_submitted": 2172, "frontend_question_id": 2297, "is_new_question": false }, @@ -13079,8 +13401,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 9581, - "total_submitted": 19858, + "total_acs": 9629, + "total_submitted": 19952, "frontend_question_id": 1943, "is_new_question": false }, @@ -13102,8 +13424,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": 13453, - "total_submitted": 33151, + "total_acs": 13495, + "total_submitted": 33232, "frontend_question_id": 1942, "is_new_question": false }, @@ -13125,8 +13447,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": 54312, - "total_submitted": 70669, + "total_acs": 55072, + "total_submitted": 71633, "frontend_question_id": 1941, "is_new_question": false }, @@ -13148,8 +13470,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 1748, - "total_submitted": 3917, + "total_acs": 1758, + "total_submitted": 3937, "frontend_question_id": 1902, "is_new_question": false }, @@ -13171,8 +13493,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 5882, - "total_submitted": 21201, + "total_acs": 5900, + "total_submitted": 21263, "frontend_question_id": 1923, "is_new_question": false }, @@ -13194,8 +13516,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 21950, - "total_submitted": 56421, + "total_acs": 22268, + "total_submitted": 57060, "frontend_question_id": 1922, "is_new_question": false }, @@ -13217,8 +13539,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 20231, - "total_submitted": 53667, + "total_acs": 20379, + "total_submitted": 54123, "frontend_question_id": 1921, "is_new_question": false }, @@ -13240,8 +13562,8 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 279323, - "total_submitted": 307256, + "total_acs": 284312, + "total_submitted": 313221, "frontend_question_id": 1920, "is_new_question": false }, @@ -13263,8 +13585,8 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 32580, - "total_submitted": 61570, + "total_acs": 33015, + "total_submitted": 62477, "frontend_question_id": 1901, "is_new_question": false }, @@ -13286,8 +13608,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 4857, - "total_submitted": 11053, + "total_acs": 4886, + "total_submitted": 11139, "frontend_question_id": 1892, "is_new_question": false }, @@ -13309,8 +13631,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 49785, - "total_submitted": 103268, + "total_acs": 49939, + "total_submitted": 103540, "frontend_question_id": 1891, "is_new_question": false }, @@ -13332,8 +13654,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 10546, - "total_submitted": 23285, + "total_acs": 10593, + "total_submitted": 23380, "frontend_question_id": 1915, "is_new_question": false }, @@ -13355,8 +13677,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 10576, - "total_submitted": 21948, + "total_acs": 10601, + "total_submitted": 21979, "frontend_question_id": 1914, "is_new_question": false }, @@ -13378,8 +13700,8 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 74638, - "total_submitted": 91719, + "total_acs": 75508, + "total_submitted": 92869, "frontend_question_id": 1913, "is_new_question": false }, @@ -13401,8 +13723,8 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 45175, - "total_submitted": 56043, + "total_acs": 46541, + "total_submitted": 57906, "frontend_question_id": 1890, "is_new_question": false }, @@ -13424,8 +13746,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": 13548, - "total_submitted": 36127, + "total_acs": 13617, + "total_submitted": 36340, "frontend_question_id": 1928, "is_new_question": false }, @@ -13447,8 +13769,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 8148, - "total_submitted": 17406, + "total_acs": 8173, + "total_submitted": 17464, "frontend_question_id": 1927, "is_new_question": false }, @@ -13470,8 +13792,8 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 73062, - "total_submitted": 149324, + "total_acs": 73525, + "total_submitted": 150333, "frontend_question_id": 1926, "is_new_question": false }, @@ -13493,8 +13815,8 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 29572, - "total_submitted": 43442, + "total_acs": 29839, + "total_submitted": 43797, "frontend_question_id": 1925, "is_new_question": false }, @@ -13516,8 +13838,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 4215, - "total_submitted": 7106, + "total_acs": 4242, + "total_submitted": 7145, "frontend_question_id": 1885, "is_new_question": false }, @@ -13539,8 +13861,8 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 59197, - "total_submitted": 87568, + "total_acs": 59995, + "total_submitted": 88713, "frontend_question_id": 1905, "is_new_question": false }, @@ -13562,8 +13884,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 9154, - "total_submitted": 20851, + "total_acs": 9186, + "total_submitted": 20921, "frontend_question_id": 1906, "is_new_question": false }, @@ -13585,8 +13907,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": 18435, - "total_submitted": 40710, + "total_acs": 18479, + "total_submitted": 40839, "frontend_question_id": 1904, "is_new_question": false }, @@ -13608,8 +13930,8 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 49224, - "total_submitted": 88099, + "total_acs": 49917, + "total_submitted": 89308, "frontend_question_id": 1903, "is_new_question": false }, @@ -13631,8 +13953,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": 31255, - "total_submitted": 44406, + "total_acs": 31515, + "total_submitted": 44737, "frontend_question_id": 1884, "is_new_question": false }, @@ -13654,8 +13976,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 8009, - "total_submitted": 10690, + "total_acs": 8095, + "total_submitted": 10827, "frontend_question_id": 1875, "is_new_question": false }, @@ -13677,8 +13999,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 15336, - "total_submitted": 16990, + "total_acs": 15442, + "total_submitted": 17107, "frontend_question_id": 1874, "is_new_question": false }, @@ -13700,8 +14022,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": 4518, - "total_submitted": 8725, + "total_acs": 4543, + "total_submitted": 8776, "frontend_question_id": 1900, "is_new_question": false }, @@ -13723,8 +14045,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 19638, - "total_submitted": 49349, + "total_acs": 19879, + "total_submitted": 49798, "frontend_question_id": 1898, "is_new_question": false }, @@ -13746,8 +14068,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 26527, - "total_submitted": 41085, + "total_acs": 26883, + "total_submitted": 41602, "frontend_question_id": 1899, "is_new_question": false }, @@ -13769,8 +14091,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": 27170, - "total_submitted": 45434, + "total_acs": 27304, + "total_submitted": 45689, "frontend_question_id": 1897, "is_new_question": false }, @@ -13792,8 +14114,8 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 126317, - "total_submitted": 205091, + "total_acs": 130567, + "total_submitted": 213005, "frontend_question_id": 1873, "is_new_question": false }, @@ -13815,8 +14137,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 4733, - "total_submitted": 11716, + "total_acs": 4761, + "total_submitted": 11817, "frontend_question_id": 1912, "is_new_question": false }, @@ -13838,8 +14160,8 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 22571, - "total_submitted": 37991, + "total_acs": 22711, + "total_submitted": 38229, "frontend_question_id": 1911, "is_new_question": false }, @@ -13861,8 +14183,8 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 49616, - "total_submitted": 66925, + "total_acs": 50423, + "total_submitted": 67999, "frontend_question_id": 1910, "is_new_question": false }, @@ -13884,8 +14206,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": 41352, - "total_submitted": 158854, + "total_acs": 41827, + "total_submitted": 160598, "frontend_question_id": 1909, "is_new_question": false }, @@ -13907,8 +14229,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": 25135, - "total_submitted": 43504, + "total_acs": 25213, + "total_submitted": 43648, "frontend_question_id": 1868, "is_new_question": false }, @@ -13930,8 +14252,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 9538, - "total_submitted": 30717, + "total_acs": 9628, + "total_submitted": 30940, "frontend_question_id": 1889, "is_new_question": false }, @@ -13953,8 +14275,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": 16621, - "total_submitted": 43248, + "total_acs": 16805, + "total_submitted": 43686, "frontend_question_id": 1888, "is_new_question": false }, @@ -13976,8 +14298,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": 20106, - "total_submitted": 32218, + "total_acs": 20228, + "total_submitted": 32397, "frontend_question_id": 1887, "is_new_question": false }, @@ -13999,8 +14321,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": 48031, - "total_submitted": 86537, + "total_acs": 48534, + "total_submitted": 87318, "frontend_question_id": 1886, "is_new_question": false }, @@ -14022,8 +14344,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 11692, - "total_submitted": 15555, + "total_acs": 11852, + "total_submitted": 15774, "frontend_question_id": 1867, "is_new_question": false }, @@ -14045,8 +14367,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": 5376, - "total_submitted": 14022, + "total_acs": 5395, + "total_submitted": 14055, "frontend_question_id": 1883, "is_new_question": false }, @@ -14068,8 +14390,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 23973, - "total_submitted": 60599, + "total_acs": 24138, + "total_submitted": 60969, "frontend_question_id": 1882, "is_new_question": false }, @@ -14091,8 +14413,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 21954, - "total_submitted": 59716, + "total_acs": 22074, + "total_submitted": 60075, "frontend_question_id": 1881, "is_new_question": false }, @@ -14114,8 +14436,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": 48688, - "total_submitted": 65871, + "total_acs": 48977, + "total_submitted": 66225, "frontend_question_id": 1880, "is_new_question": false }, @@ -14137,8 +14459,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 5523, - "total_submitted": 8267, + "total_acs": 5564, + "total_submitted": 8342, "frontend_question_id": 1858, "is_new_question": false }, @@ -14160,8 +14482,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": 3168, - "total_submitted": 5775, + "total_acs": 3180, + "total_submitted": 5789, "frontend_question_id": 1896, "is_new_question": false }, @@ -14183,8 +14505,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": 1003, - "total_submitted": 2027, + "total_acs": 1015, + "total_submitted": 2044, "frontend_question_id": 2247, "is_new_question": false }, @@ -14206,8 +14528,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": 26692, - "total_submitted": 60439, + "total_acs": 27022, + "total_submitted": 61247, "frontend_question_id": 1894, "is_new_question": false }, @@ -14229,8 +14551,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": 28910, - "total_submitted": 56912, + "total_acs": 29132, + "total_submitted": 57404, "frontend_question_id": 1893, "is_new_question": false }, @@ -14252,8 +14574,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 9474, - "total_submitted": 10847, + "total_acs": 9561, + "total_submitted": 10942, "frontend_question_id": 1853, "is_new_question": false }, @@ -14275,8 +14597,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 5321, - "total_submitted": 7493, + "total_acs": 5361, + "total_submitted": 7552, "frontend_question_id": 1852, "is_new_question": false }, @@ -14298,8 +14620,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 6959, - "total_submitted": 13230, + "total_acs": 6985, + "total_submitted": 13280, "frontend_question_id": 1872, "is_new_question": false }, @@ -14321,8 +14643,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 31514, - "total_submitted": 125433, + "total_acs": 31820, + "total_submitted": 126514, "frontend_question_id": 1871, "is_new_question": false }, @@ -14344,8 +14666,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 25607, - "total_submitted": 67923, + "total_acs": 25844, + "total_submitted": 68388, "frontend_question_id": 1870, "is_new_question": false }, @@ -14367,8 +14689,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": 35882, - "total_submitted": 59425, + "total_acs": 36075, + "total_submitted": 59727, "frontend_question_id": 1869, "is_new_question": false }, @@ -14390,8 +14712,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 7771, - "total_submitted": 16275, + "total_acs": 7850, + "total_submitted": 16464, "frontend_question_id": 1843, "is_new_question": false }, @@ -14413,8 +14735,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 4462, - "total_submitted": 8370, + "total_acs": 4512, + "total_submitted": 8464, "frontend_question_id": 1842, "is_new_question": false }, @@ -14436,8 +14758,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": 10260, - "total_submitted": 18457, + "total_acs": 10327, + "total_submitted": 18549, "frontend_question_id": 1866, "is_new_question": false }, @@ -14459,8 +14781,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 19281, - "total_submitted": 38294, + "total_acs": 19395, + "total_submitted": 38542, "frontend_question_id": 1865, "is_new_question": false }, @@ -14482,8 +14804,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": 21409, - "total_submitted": 50173, + "total_acs": 21527, + "total_submitted": 50415, "frontend_question_id": 1864, "is_new_question": false }, @@ -14505,8 +14827,8 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 48003, - "total_submitted": 60473, + "total_acs": 48569, + "total_submitted": 61086, "frontend_question_id": 1863, "is_new_question": false }, @@ -14528,8 +14850,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": 4371, - "total_submitted": 6329, + "total_acs": 4435, + "total_submitted": 6416, "frontend_question_id": 2046, "is_new_question": false }, @@ -14551,8 +14873,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 10076, - "total_submitted": 17753, + "total_acs": 10158, + "total_submitted": 18012, "frontend_question_id": 1841, "is_new_question": false }, @@ -14574,8 +14896,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": 11968, - "total_submitted": 25597, + "total_acs": 12074, + "total_submitted": 25768, "frontend_question_id": 1878, "is_new_question": false }, @@ -14597,8 +14919,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 10073, - "total_submitted": 22389, + "total_acs": 10123, + "total_submitted": 22533, "frontend_question_id": 1879, "is_new_question": false }, @@ -14620,8 +14942,8 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 66462, - "total_submitted": 82957, + "total_acs": 67015, + "total_submitted": 83744, "frontend_question_id": 1877, "is_new_question": false }, @@ -14643,8 +14965,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": 67136, - "total_submitted": 95060, + "total_acs": 68010, + "total_submitted": 96201, "frontend_question_id": 1876, "is_new_question": false }, @@ -14666,8 +14988,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": 14356, - "total_submitted": 35328, + "total_acs": 14432, + "total_submitted": 35497, "frontend_question_id": 1857, "is_new_question": false }, @@ -14689,8 +15011,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 19433, - "total_submitted": 51441, + "total_acs": 19554, + "total_submitted": 51794, "frontend_question_id": 1856, "is_new_question": false }, @@ -14712,8 +15034,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": 37390, - "total_submitted": 70636, + "total_acs": 37856, + "total_submitted": 71383, "frontend_question_id": 1855, "is_new_question": false }, @@ -14735,8 +15057,8 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 44367, - "total_submitted": 73880, + "total_acs": 44776, + "total_submitted": 74494, "frontend_question_id": 1854, "is_new_question": false }, @@ -14758,8 +15080,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": 21638, - "total_submitted": 30917, + "total_acs": 21843, + "total_submitted": 31176, "frontend_question_id": 1836, "is_new_question": false }, @@ -14781,8 +15103,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 11641, - "total_submitted": 13808, + "total_acs": 11796, + "total_submitted": 14008, "frontend_question_id": 1831, "is_new_question": false }, @@ -14804,8 +15126,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 3363, - "total_submitted": 6785, + "total_acs": 3379, + "total_submitted": 6818, "frontend_question_id": 1826, "is_new_question": false }, @@ -14827,8 +15149,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": 1549, - "total_submitted": 2929, + "total_acs": 1567, + "total_submitted": 2960, "frontend_question_id": 1989, "is_new_question": false }, @@ -14850,8 +15172,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": 16863, - "total_submitted": 23464, + "total_acs": 16905, + "total_submitted": 23533, "frontend_question_id": 1850, "is_new_question": false }, @@ -14873,8 +15195,8 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 14321, - "total_submitted": 29863, + "total_acs": 14588, + "total_submitted": 30340, "frontend_question_id": 1851, "is_new_question": false }, @@ -14896,8 +15218,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": 17710, - "total_submitted": 54395, + "total_acs": 17826, + "total_submitted": 54759, "frontend_question_id": 1849, "is_new_question": false }, @@ -14919,8 +15241,8 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 31567, - "total_submitted": 54082, + "total_acs": 31782, + "total_submitted": 54536, "frontend_question_id": 1848, "is_new_question": false }, @@ -14942,8 +15264,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": 13380, - "total_submitted": 14978, + "total_acs": 13508, + "total_submitted": 15132, "frontend_question_id": 1821, "is_new_question": false }, @@ -14965,8 +15287,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 37970, - "total_submitted": 58507, + "total_acs": 38219, + "total_submitted": 58842, "frontend_question_id": 1861, "is_new_question": false }, @@ -14988,8 +15310,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 14790, - "total_submitted": 20549, + "total_acs": 14864, + "total_submitted": 20644, "frontend_question_id": 1860, "is_new_question": false }, @@ -15011,8 +15333,8 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 100243, - "total_submitted": 118850, + "total_acs": 101525, + "total_submitted": 120471, "frontend_question_id": 1859, "is_new_question": false }, @@ -15034,8 +15356,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 5051, - "total_submitted": 10164, + "total_acs": 5084, + "total_submitted": 10245, "frontend_question_id": 1820, "is_new_question": false }, @@ -15057,8 +15379,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 5843, - "total_submitted": 16534, + "total_acs": 5860, + "total_submitted": 16585, "frontend_question_id": 1840, "is_new_question": false }, @@ -15080,8 +15402,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": 23080, - "total_submitted": 47489, + "total_acs": 23261, + "total_submitted": 47840, "frontend_question_id": 1839, "is_new_question": false }, @@ -15103,8 +15425,8 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 36848, - "total_submitted": 94839, + "total_acs": 37380, + "total_submitted": 96001, "frontend_question_id": 1838, "is_new_question": false }, @@ -15126,8 +15448,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 36312, - "total_submitted": 47216, + "total_acs": 36632, + "total_submitted": 47637, "frontend_question_id": 1837, "is_new_question": false }, @@ -15149,8 +15471,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 11775, - "total_submitted": 18212, + "total_acs": 11847, + "total_submitted": 18382, "frontend_question_id": 1811, "is_new_question": false }, @@ -15172,8 +15494,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": 13840, - "total_submitted": 22941, + "total_acs": 13930, + "total_submitted": 23081, "frontend_question_id": 1835, "is_new_question": false }, @@ -15195,8 +15517,8 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 84086, - "total_submitted": 183705, + "total_acs": 84431, + "total_submitted": 184510, "frontend_question_id": 1834, "is_new_question": false }, @@ -15218,8 +15540,8 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 133714, - "total_submitted": 180377, + "total_acs": 134822, + "total_submitted": 182030, "frontend_question_id": 1833, "is_new_question": false }, @@ -15241,8 +15563,8 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 206670, - "total_submitted": 246914, + "total_acs": 208967, + "total_submitted": 249754, "frontend_question_id": 1832, "is_new_question": false }, @@ -15264,8 +15586,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": 2274, - "total_submitted": 4193, + "total_acs": 2280, + "total_submitted": 4202, "frontend_question_id": 1810, "is_new_question": false }, @@ -15287,8 +15609,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 12061, - "total_submitted": 20218, + "total_acs": 12160, + "total_submitted": 20395, "frontend_question_id": 1809, "is_new_question": false }, @@ -15310,8 +15632,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 6757, - "total_submitted": 19098, + "total_acs": 6777, + "total_submitted": 19184, "frontend_question_id": 1847, "is_new_question": false }, @@ -15333,8 +15655,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 18271, - "total_submitted": 30905, + "total_acs": 18353, + "total_submitted": 31033, "frontend_question_id": 1846, "is_new_question": false }, @@ -15356,8 +15678,8 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 28180, - "total_submitted": 43179, + "total_acs": 28494, + "total_submitted": 43656, "frontend_question_id": 1845, "is_new_question": false }, @@ -15379,8 +15701,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 54880, - "total_submitted": 68676, + "total_acs": 55492, + "total_submitted": 69359, "frontend_question_id": 1844, "is_new_question": false }, @@ -15402,8 +15724,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 9783, - "total_submitted": 27531, + "total_acs": 9907, + "total_submitted": 27774, "frontend_question_id": 1825, "is_new_question": false }, @@ -15425,8 +15747,8 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 24690, - "total_submitted": 49980, + "total_acs": 25032, + "total_submitted": 50597, "frontend_question_id": 1824, "is_new_question": false }, @@ -15448,8 +15770,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": 79845, - "total_submitted": 102264, + "total_acs": 81205, + "total_submitted": 103930, "frontend_question_id": 1823, "is_new_question": false }, @@ -15471,8 +15793,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": 150969, - "total_submitted": 229515, + "total_acs": 152747, + "total_submitted": 232503, "frontend_question_id": 1822, "is_new_question": false }, @@ -15494,8 +15816,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 10990, - "total_submitted": 18400, + "total_acs": 11089, + "total_submitted": 18565, "frontend_question_id": 1804, "is_new_question": false }, @@ -15517,8 +15839,8 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 67474, - "total_submitted": 76607, + "total_acs": 69616, + "total_submitted": 79270, "frontend_question_id": 1795, "is_new_question": false }, @@ -15540,8 +15862,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 6969, - "total_submitted": 18046, + "total_acs": 7097, + "total_submitted": 18245, "frontend_question_id": 1819, "is_new_question": false }, @@ -15563,8 +15885,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 19390, - "total_submitted": 64056, + "total_acs": 19557, + "total_submitted": 64603, "frontend_question_id": 1818, "is_new_question": false }, @@ -15586,8 +15908,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 43880, - "total_submitted": 54451, + "total_acs": 44288, + "total_submitted": 54976, "frontend_question_id": 1817, "is_new_question": false }, @@ -15609,8 +15931,8 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 89503, - "total_submitted": 108493, + "total_acs": 90604, + "total_submitted": 109761, "frontend_question_id": 1816, "is_new_question": false }, @@ -15632,8 +15954,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": 1468, - "total_submitted": 2245, + "total_acs": 1488, + "total_submitted": 2288, "frontend_question_id": 1794, "is_new_question": false }, @@ -15655,8 +15977,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 14402, - "total_submitted": 18076, + "total_acs": 14501, + "total_submitted": 18208, "frontend_question_id": 1789, "is_new_question": false }, @@ -15678,8 +16000,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": 2884, - "total_submitted": 5854, + "total_acs": 2895, + "total_submitted": 5879, "frontend_question_id": 1830, "is_new_question": false }, @@ -15701,8 +16023,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 20975, - "total_submitted": 27317, + "total_acs": 21108, + "total_submitted": 27521, "frontend_question_id": 1829, "is_new_question": false }, @@ -15724,8 +16046,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": 54578, - "total_submitted": 63236, + "total_acs": 55061, + "total_submitted": 63807, "frontend_question_id": 1828, "is_new_question": false }, @@ -15747,8 +16069,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": 60327, - "total_submitted": 76950, + "total_acs": 60849, + "total_submitted": 77575, "frontend_question_id": 1827, "is_new_question": false }, @@ -15770,8 +16092,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 1677, - "total_submitted": 2522, + "total_acs": 1685, + "total_submitted": 2535, "frontend_question_id": 1788, "is_new_question": false }, @@ -15793,8 +16115,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 5287, - "total_submitted": 16815, + "total_acs": 5310, + "total_submitted": 16869, "frontend_question_id": 1808, "is_new_question": false }, @@ -15816,8 +16138,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": 15257, - "total_submitted": 21268, + "total_acs": 15330, + "total_submitted": 21355, "frontend_question_id": 1806, "is_new_question": false }, @@ -15839,8 +16161,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": 23341, - "total_submitted": 34899, + "total_acs": 23466, + "total_submitted": 35123, "frontend_question_id": 1807, "is_new_question": false }, @@ -15862,8 +16184,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": 34101, - "total_submitted": 93582, + "total_acs": 34333, + "total_submitted": 94230, "frontend_question_id": 1805, "is_new_question": false }, @@ -15885,8 +16207,8 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 16787, - "total_submitted": 19115, + "total_acs": 16999, + "total_submitted": 19364, "frontend_question_id": 1783, "is_new_question": false }, @@ -15908,8 +16230,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 4523, - "total_submitted": 11571, + "total_acs": 4532, + "total_submitted": 11583, "frontend_question_id": 1778, "is_new_question": false }, @@ -15931,8 +16253,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": 12636, - "total_submitted": 22966, + "total_acs": 12709, + "total_submitted": 23062, "frontend_question_id": 1798, "is_new_question": false }, @@ -15954,8 +16276,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": 14893, - "total_submitted": 46365, + "total_acs": 15067, + "total_submitted": 46804, "frontend_question_id": 1802, "is_new_question": false }, @@ -15977,8 +16299,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 14995, - "total_submitted": 31412, + "total_acs": 15130, + "total_submitted": 31643, "frontend_question_id": 1801, "is_new_question": false }, @@ -16000,8 +16322,8 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 38935, - "total_submitted": 61295, + "total_acs": 39245, + "total_submitted": 61848, "frontend_question_id": 1800, "is_new_question": false }, @@ -16023,8 +16345,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 15453, - "total_submitted": 18189, + "total_acs": 15592, + "total_submitted": 18369, "frontend_question_id": 1777, "is_new_question": false }, @@ -16046,8 +16368,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 22233, - "total_submitted": 53014, + "total_acs": 22720, + "total_submitted": 53998, "frontend_question_id": 1814, "is_new_question": false }, @@ -16069,8 +16391,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": 5175, - "total_submitted": 12939, + "total_acs": 5257, + "total_submitted": 13090, "frontend_question_id": 1815, "is_new_question": false }, @@ -16092,8 +16414,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 12356, - "total_submitted": 37353, + "total_acs": 12522, + "total_submitted": 37682, "frontend_question_id": 1813, "is_new_question": false }, @@ -16115,8 +16437,8 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 51554, - "total_submitted": 66437, + "total_acs": 52080, + "total_submitted": 67089, "frontend_question_id": 1812, "is_new_question": false }, @@ -16138,8 +16460,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 4728, - "total_submitted": 7275, + "total_acs": 4744, + "total_submitted": 7306, "frontend_question_id": 1772, "is_new_question": false }, @@ -16161,8 +16483,8 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 18751, - "total_submitted": 35016, + "total_acs": 18877, + "total_submitted": 35238, "frontend_question_id": 1793, "is_new_question": false }, @@ -16184,8 +16506,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 18189, - "total_submitted": 34850, + "total_acs": 18247, + "total_submitted": 34943, "frontend_question_id": 1792, "is_new_question": false }, @@ -16207,8 +16529,8 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 121200, - "total_submitted": 145046, + "total_acs": 122263, + "total_submitted": 146378, "frontend_question_id": 1791, "is_new_question": false }, @@ -16230,8 +16552,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": 74176, - "total_submitted": 162822, + "total_acs": 75341, + "total_submitted": 165440, "frontend_question_id": 1790, "is_new_question": false }, @@ -16253,8 +16575,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": 7281, - "total_submitted": 8684, + "total_acs": 7353, + "total_submitted": 8781, "frontend_question_id": 1767, "is_new_question": false }, @@ -16276,8 +16598,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": 4274, - "total_submitted": 10798, + "total_acs": 4283, + "total_submitted": 10845, "frontend_question_id": 1787, "is_new_question": false }, @@ -16299,8 +16621,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": 17421, - "total_submitted": 44314, + "total_acs": 17499, + "total_submitted": 44576, "frontend_question_id": 1786, "is_new_question": false }, @@ -16322,8 +16644,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": 16887, - "total_submitted": 39633, + "total_acs": 16970, + "total_submitted": 39817, "frontend_question_id": 1785, "is_new_question": false }, @@ -16345,8 +16667,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": 30714, - "total_submitted": 76120, + "total_acs": 30928, + "total_submitted": 76757, "frontend_question_id": 1784, "is_new_question": false }, @@ -16368,8 +16690,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 137165, - "total_submitted": 173189, + "total_acs": 137566, + "total_submitted": 173738, "frontend_question_id": 1762, "is_new_question": false }, @@ -16391,8 +16713,8 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 241977, - "total_submitted": 259597, + "total_acs": 249710, + "total_submitted": 268091, "frontend_question_id": 1757, "is_new_question": false }, @@ -16414,8 +16736,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": 5778, - "total_submitted": 12319, + "total_acs": 5801, + "total_submitted": 12362, "frontend_question_id": 1803, "is_new_question": false }, @@ -16437,8 +16759,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 15472, - "total_submitted": 33583, + "total_acs": 15543, + "total_submitted": 33879, "frontend_question_id": 1799, "is_new_question": false }, @@ -16460,8 +16782,8 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 15313, - "total_submitted": 27082, + "total_acs": 15438, + "total_submitted": 27268, "frontend_question_id": 1797, "is_new_question": false }, @@ -16483,8 +16805,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 35765, - "total_submitted": 72630, + "total_acs": 36092, + "total_submitted": 73351, "frontend_question_id": 1796, "is_new_question": false }, @@ -16506,8 +16828,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 8134, - "total_submitted": 10330, + "total_acs": 8189, + "total_submitted": 10410, "frontend_question_id": 1756, "is_new_question": false }, @@ -16529,8 +16851,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 21234, - "total_submitted": 39682, + "total_acs": 21287, + "total_submitted": 39808, "frontend_question_id": 1776, "is_new_question": false }, @@ -16552,8 +16874,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": 23451, - "total_submitted": 44324, + "total_acs": 23608, + "total_submitted": 44604, "frontend_question_id": 1775, "is_new_question": false }, @@ -16575,8 +16897,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 23081, - "total_submitted": 48972, + "total_acs": 23304, + "total_submitted": 49419, "frontend_question_id": 1774, "is_new_question": false }, @@ -16598,8 +16920,8 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 141052, - "total_submitted": 167318, + "total_acs": 142428, + "total_submitted": 168933, "frontend_question_id": 1773, "is_new_question": false }, @@ -16621,8 +16943,8 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 13558, - "total_submitted": 19902, + "total_acs": 13752, + "total_submitted": 20227, "frontend_question_id": 1747, "is_new_question": false }, @@ -16644,8 +16966,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 8876, - "total_submitted": 25215, + "total_acs": 8901, + "total_submitted": 25270, "frontend_question_id": 1771, "is_new_question": false }, @@ -16667,8 +16989,8 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 89559, - "total_submitted": 242220, + "total_acs": 89949, + "total_submitted": 242850, "frontend_question_id": 1770, "is_new_question": false }, @@ -16690,8 +17012,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": 94005, - "total_submitted": 110323, + "total_acs": 94697, + "total_submitted": 111125, "frontend_question_id": 1769, "is_new_question": false }, @@ -16713,8 +17035,8 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 87631, - "total_submitted": 114346, + "total_acs": 88865, + "total_submitted": 115830, "frontend_question_id": 1768, "is_new_question": false }, @@ -16736,8 +17058,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 7635, - "total_submitted": 12259, + "total_acs": 7704, + "total_submitted": 12395, "frontend_question_id": 1746, "is_new_question": false }, @@ -16759,8 +17081,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": 67427, - "total_submitted": 74237, + "total_acs": 69263, + "total_submitted": 76351, "frontend_question_id": 1741, "is_new_question": false }, @@ -16782,8 +17104,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 5218, - "total_submitted": 13609, + "total_acs": 5237, + "total_submitted": 13646, "frontend_question_id": 1782, "is_new_question": false }, @@ -16805,8 +17127,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 18347, - "total_submitted": 30188, + "total_acs": 18544, + "total_submitted": 30545, "frontend_question_id": 1781, "is_new_question": false }, @@ -16828,8 +17150,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": 30192, - "total_submitted": 46045, + "total_acs": 30406, + "total_submitted": 46376, "frontend_question_id": 1780, "is_new_question": false }, @@ -16851,8 +17173,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": 85983, - "total_submitted": 127380, + "total_acs": 87220, + "total_submitted": 129230, "frontend_question_id": 1779, "is_new_question": false }, @@ -16874,8 +17196,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": 19006, - "total_submitted": 45789, + "total_acs": 19038, + "total_submitted": 45875, "frontend_question_id": 1761, "is_new_question": false }, @@ -16897,8 +17219,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": 27551, - "total_submitted": 45622, + "total_acs": 27841, + "total_submitted": 46087, "frontend_question_id": 1760, "is_new_question": false }, @@ -16920,8 +17242,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 23199, - "total_submitted": 48211, + "total_acs": 23514, + "total_submitted": 48753, "frontend_question_id": 1759, "is_new_question": false }, @@ -16943,8 +17265,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": 32774, - "total_submitted": 56132, + "total_acs": 32930, + "total_submitted": 56416, "frontend_question_id": 1758, "is_new_question": false }, @@ -16966,8 +17288,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 17282, - "total_submitted": 25086, + "total_acs": 17436, + "total_submitted": 25272, "frontend_question_id": 1740, "is_new_question": false }, @@ -16989,8 +17311,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": 16589, - "total_submitted": 33215, + "total_acs": 16830, + "total_submitted": 33760, "frontend_question_id": 1731, "is_new_question": false }, @@ -17012,8 +17334,8 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 11324, - "total_submitted": 30974, + "total_acs": 11376, + "total_submitted": 31104, "frontend_question_id": 1755, "is_new_question": false }, @@ -17035,8 +17357,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 16988, - "total_submitted": 37456, + "total_acs": 17053, + "total_submitted": 37572, "frontend_question_id": 1754, "is_new_question": false }, @@ -17058,8 +17380,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 28708, - "total_submitted": 43190, + "total_acs": 28893, + "total_submitted": 43424, "frontend_question_id": 1753, "is_new_question": false }, @@ -17081,8 +17403,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": 69906, - "total_submitted": 140568, + "total_acs": 71574, + "total_submitted": 143649, "frontend_question_id": 1752, "is_new_question": false }, @@ -17104,8 +17426,8 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 50628, - "total_submitted": 70911, + "total_acs": 52110, + "total_submitted": 72973, "frontend_question_id": 1729, "is_new_question": false }, @@ -17127,8 +17449,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 19943, - "total_submitted": 33096, + "total_acs": 20007, + "total_submitted": 33209, "frontend_question_id": 1765, "is_new_question": false }, @@ -17150,8 +17472,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 7051, - "total_submitted": 17957, + "total_acs": 7070, + "total_submitted": 18055, "frontend_question_id": 1766, "is_new_question": false }, @@ -17173,8 +17495,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": 12200, - "total_submitted": 23067, + "total_acs": 12267, + "total_submitted": 23203, "frontend_question_id": 1764, "is_new_question": false }, @@ -17196,8 +17518,8 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 34145, - "total_submitted": 55442, + "total_acs": 34598, + "total_submitted": 56143, "frontend_question_id": 1763, "is_new_question": false }, @@ -17219,8 +17541,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": 8784, - "total_submitted": 26621, + "total_acs": 8820, + "total_submitted": 26687, "frontend_question_id": 1744, "is_new_question": false }, @@ -17242,8 +17564,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 18580, - "total_submitted": 40651, + "total_acs": 18881, + "total_submitted": 41459, "frontend_question_id": 1745, "is_new_question": false }, @@ -17265,8 +17587,8 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 32560, - "total_submitted": 47407, + "total_acs": 32741, + "total_submitted": 47670, "frontend_question_id": 1743, "is_new_question": false }, @@ -17288,8 +17610,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": 2181, - "total_submitted": 4144, + "total_acs": 2216, + "total_submitted": 4199, "frontend_question_id": 1724, "is_new_question": false }, @@ -17311,8 +17633,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 11552, - "total_submitted": 15071, + "total_acs": 11645, + "total_submitted": 15198, "frontend_question_id": 1715, "is_new_question": false }, @@ -17334,8 +17656,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 5710, - "total_submitted": 10950, + "total_acs": 5738, + "total_submitted": 10996, "frontend_question_id": 1739, "is_new_question": false }, @@ -17357,8 +17679,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 17448, - "total_submitted": 28591, + "total_acs": 17522, + "total_submitted": 28743, "frontend_question_id": 1738, "is_new_question": false }, @@ -17380,8 +17702,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": 11163, - "total_submitted": 31563, + "total_acs": 11208, + "total_submitted": 31655, "frontend_question_id": 1737, "is_new_question": false }, @@ -17403,8 +17725,8 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 27282, - "total_submitted": 64468, + "total_acs": 27436, + "total_submitted": 64845, "frontend_question_id": 1736, "is_new_question": false }, @@ -17426,8 +17748,8 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 15458, - "total_submitted": 20171, + "total_acs": 15641, + "total_submitted": 20432, "frontend_question_id": 1709, "is_new_question": false }, @@ -17449,8 +17771,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": 19873, - "total_submitted": 35237, + "total_acs": 20013, + "total_submitted": 35435, "frontend_question_id": 1751, "is_new_question": false }, @@ -17472,8 +17794,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": 17491, - "total_submitted": 39944, + "total_acs": 17610, + "total_submitted": 40212, "frontend_question_id": 1750, "is_new_question": false }, @@ -17495,8 +17817,8 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 28981, - "total_submitted": 49654, + "total_acs": 29239, + "total_submitted": 50023, "frontend_question_id": 1749, "is_new_question": false }, @@ -17518,8 +17840,8 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 102935, - "total_submitted": 135560, + "total_acs": 104086, + "total_submitted": 136988, "frontend_question_id": 1748, "is_new_question": false }, @@ -17541,8 +17863,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 6837, - "total_submitted": 10722, + "total_acs": 6890, + "total_submitted": 10794, "frontend_question_id": 1708, "is_new_question": false }, @@ -17564,8 +17886,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 14516, - "total_submitted": 23717, + "total_acs": 14565, + "total_submitted": 23778, "frontend_question_id": 1727, "is_new_question": false }, @@ -17587,8 +17909,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": 48162, - "total_submitted": 65234, + "total_acs": 48537, + "total_submitted": 65723, "frontend_question_id": 1742, "is_new_question": false }, @@ -17610,8 +17932,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": 52772, - "total_submitted": 67039, + "total_acs": 53072, + "total_submitted": 67426, "frontend_question_id": 1725, "is_new_question": false }, @@ -17633,8 +17955,8 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 29919, - "total_submitted": 35456, + "total_acs": 30364, + "total_submitted": 36069, "frontend_question_id": 1699, "is_new_question": false }, @@ -17656,8 +17978,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 14743, - "total_submitted": 30255, + "total_acs": 14797, + "total_submitted": 30384, "frontend_question_id": 1722, "is_new_question": false }, @@ -17679,8 +18001,8 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 100733, - "total_submitted": 117225, + "total_acs": 101743, + "total_submitted": 118403, "frontend_question_id": 1720, "is_new_question": false }, @@ -17702,8 +18024,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": 7555, - "total_submitted": 11960, + "total_acs": 7592, + "total_submitted": 12019, "frontend_question_id": 1698, "is_new_question": false }, @@ -17725,8 +18047,8 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 61894, - "total_submitted": 69321, + "total_acs": 63559, + "total_submitted": 71318, "frontend_question_id": 1693, "is_new_question": false }, @@ -17748,8 +18070,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": 4309, - "total_submitted": 8546, + "total_acs": 4333, + "total_submitted": 8612, "frontend_question_id": 1735, "is_new_question": false }, @@ -17771,8 +18093,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 11423, - "total_submitted": 18224, + "total_acs": 11488, + "total_submitted": 18306, "frontend_question_id": 1734, "is_new_question": false }, @@ -17794,8 +18116,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 7248, - "total_submitted": 17295, + "total_acs": 7271, + "total_submitted": 17357, "frontend_question_id": 1733, "is_new_question": false }, @@ -17817,8 +18139,8 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 99759, - "total_submitted": 126561, + "total_acs": 101131, + "total_submitted": 128291, "frontend_question_id": 1732, "is_new_question": false }, @@ -17840,8 +18162,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 8875, - "total_submitted": 18132, + "total_acs": 8928, + "total_submitted": 18245, "frontend_question_id": 1713, "is_new_question": false }, @@ -17863,8 +18185,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": 25909, - "total_submitted": 79420, + "total_acs": 26080, + "total_submitted": 80004, "frontend_question_id": 1712, "is_new_question": false }, @@ -17886,8 +18208,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 30814, - "total_submitted": 105699, + "total_acs": 30940, + "total_submitted": 106127, "frontend_question_id": 1711, "is_new_question": false }, @@ -17909,8 +18231,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 256563, - "total_submitted": 347294, + "total_acs": 257457, + "total_submitted": 348539, "frontend_question_id": 1710, "is_new_question": false }, @@ -17932,8 +18254,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 1938, - "total_submitted": 3104, + "total_acs": 1957, + "total_submitted": 3142, "frontend_question_id": 1692, "is_new_question": false }, @@ -17955,8 +18277,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 21454, - "total_submitted": 23601, + "total_acs": 21603, + "total_submitted": 23767, "frontend_question_id": 1683, "is_new_question": false }, @@ -17978,8 +18300,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": 13114, - "total_submitted": 29418, + "total_acs": 13180, + "total_submitted": 29569, "frontend_question_id": 1707, "is_new_question": false }, @@ -18001,8 +18323,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": 19701, - "total_submitted": 46271, + "total_acs": 19803, + "total_submitted": 46511, "frontend_question_id": 1723, "is_new_question": false }, @@ -18024,8 +18346,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 18176, - "total_submitted": 48101, + "total_acs": 18260, + "total_submitted": 48283, "frontend_question_id": 1705, "is_new_question": false }, @@ -18047,8 +18369,8 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 181080, - "total_submitted": 232524, + "total_acs": 181806, + "total_submitted": 233443, "frontend_question_id": 1704, "is_new_question": false }, @@ -18070,8 +18392,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 4264, - "total_submitted": 8651, + "total_acs": 4305, + "total_submitted": 8724, "frontend_question_id": 1682, "is_new_question": false }, @@ -18093,8 +18415,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 13474, - "total_submitted": 34721, + "total_acs": 13566, + "total_submitted": 35015, "frontend_question_id": 1677, "is_new_question": false }, @@ -18116,8 +18438,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": 3264, - "total_submitted": 7501, + "total_acs": 3292, + "total_submitted": 7559, "frontend_question_id": 1719, "is_new_question": false }, @@ -18139,8 +18461,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 10271, - "total_submitted": 19811, + "total_acs": 10303, + "total_submitted": 19864, "frontend_question_id": 1718, "is_new_question": false }, @@ -18162,8 +18484,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 11673, - "total_submitted": 25343, + "total_acs": 11730, + "total_submitted": 25441, "frontend_question_id": 1717, "is_new_question": false }, @@ -18185,8 +18507,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 36806, - "total_submitted": 56097, + "total_acs": 37110, + "total_submitted": 56475, "frontend_question_id": 1716, "is_new_question": false }, @@ -18208,8 +18530,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": 27566, - "total_submitted": 34732, + "total_acs": 27672, + "total_submitted": 34864, "frontend_question_id": 1676, "is_new_question": false }, @@ -18231,8 +18553,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": 11843, - "total_submitted": 23476, + "total_acs": 12042, + "total_submitted": 23825, "frontend_question_id": 1697, "is_new_question": false }, @@ -18254,8 +18576,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 95831, - "total_submitted": 207413, + "total_acs": 96103, + "total_submitted": 208140, "frontend_question_id": 1696, "is_new_question": false }, @@ -18277,8 +18599,8 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 105683, - "total_submitted": 183447, + "total_acs": 105967, + "total_submitted": 183923, "frontend_question_id": 1695, "is_new_question": false }, @@ -18300,8 +18622,8 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 29400, - "total_submitted": 45159, + "total_acs": 29509, + "total_submitted": 45323, "frontend_question_id": 1694, "is_new_question": false }, @@ -18323,8 +18645,8 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 83933, - "total_submitted": 126814, + "total_acs": 86651, + "total_submitted": 131113, "frontend_question_id": 1667, "is_new_question": false }, @@ -18346,8 +18668,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": 2739, - "total_submitted": 3936, + "total_acs": 2754, + "total_submitted": 3958, "frontend_question_id": 1666, "is_new_question": false }, @@ -18369,8 +18691,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": 1098, - "total_submitted": 2217, + "total_acs": 1103, + "total_submitted": 2242, "frontend_question_id": 1714, "is_new_question": false }, @@ -18392,8 +18714,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 29531, - "total_submitted": 50633, + "total_acs": 29607, + "total_submitted": 50784, "frontend_question_id": 1690, "is_new_question": false }, @@ -18415,8 +18737,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": 160821, - "total_submitted": 179859, + "total_acs": 161956, + "total_submitted": 181132, "frontend_question_id": 1689, "is_new_question": false }, @@ -18438,8 +18760,8 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 88330, - "total_submitted": 106123, + "total_acs": 89157, + "total_submitted": 107232, "frontend_question_id": 1688, "is_new_question": false }, @@ -18461,8 +18783,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": 8051, - "total_submitted": 18941, + "total_acs": 8083, + "total_submitted": 19029, "frontend_question_id": 1703, "is_new_question": false }, @@ -18484,8 +18806,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 10293, - "total_submitted": 22239, + "total_acs": 10343, + "total_submitted": 22336, "frontend_question_id": 1702, "is_new_question": false }, @@ -18507,8 +18829,8 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 22910, - "total_submitted": 36571, + "total_acs": 23043, + "total_submitted": 36793, "frontend_question_id": 1701, "is_new_question": false }, @@ -18530,8 +18852,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": 56840, - "total_submitted": 83341, + "total_acs": 57525, + "total_submitted": 84286, "frontend_question_id": 1700, "is_new_question": false }, @@ -18553,8 +18875,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 19409, - "total_submitted": 24621, + "total_acs": 19531, + "total_submitted": 24797, "frontend_question_id": 1661, "is_new_question": false }, @@ -18576,8 +18898,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 85706, - "total_submitted": 150423, + "total_acs": 85841, + "total_submitted": 150671, "frontend_question_id": 1680, "is_new_question": false }, @@ -18599,8 +18921,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 6595, - "total_submitted": 17626, + "total_acs": 6609, + "total_submitted": 17667, "frontend_question_id": 1681, "is_new_question": false }, @@ -18622,8 +18944,8 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 119325, - "total_submitted": 208215, + "total_acs": 119624, + "total_submitted": 208852, "frontend_question_id": 1679, "is_new_question": false }, @@ -18645,8 +18967,8 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 158592, - "total_submitted": 183839, + "total_acs": 160650, + "total_submitted": 186065, "frontend_question_id": 1678, "is_new_question": false }, @@ -18668,8 +18990,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 13401, - "total_submitted": 18512, + "total_acs": 13460, + "total_submitted": 18598, "frontend_question_id": 1660, "is_new_question": false }, @@ -18691,8 +19013,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 5080, - "total_submitted": 7477, + "total_acs": 5098, + "total_submitted": 7499, "frontend_question_id": 1651, "is_new_question": false }, @@ -18714,8 +19036,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 45271, - "total_submitted": 87125, + "total_acs": 45314, + "total_submitted": 87287, "frontend_question_id": 1675, "is_new_question": false }, @@ -18737,8 +19059,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 7059, - "total_submitted": 18282, + "total_acs": 7087, + "total_submitted": 18349, "frontend_question_id": 1674, "is_new_question": false }, @@ -18760,8 +19082,8 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 49742, - "total_submitted": 101002, + "total_acs": 49920, + "total_submitted": 101366, "frontend_question_id": 1673, "is_new_question": false }, @@ -18783,8 +19105,8 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 510022, - "total_submitted": 579036, + "total_acs": 517856, + "total_submitted": 588126, "frontend_question_id": 1672, "is_new_question": false }, @@ -18806,8 +19128,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": 155010, - "total_submitted": 200484, + "total_acs": 155364, + "total_submitted": 200918, "frontend_question_id": 1650, "is_new_question": false }, @@ -18829,8 +19151,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 4798, - "total_submitted": 12377, + "total_acs": 4811, + "total_submitted": 12417, "frontend_question_id": 1687, "is_new_question": false }, @@ -18852,8 +19174,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 13678, - "total_submitted": 25079, + "total_acs": 13748, + "total_submitted": 25191, "frontend_question_id": 1686, "is_new_question": false }, @@ -18875,8 +19197,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": 25367, - "total_submitted": 39273, + "total_acs": 25522, + "total_submitted": 39593, "frontend_question_id": 1685, "is_new_question": false }, @@ -18898,8 +19220,8 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 116894, - "total_submitted": 142549, + "total_acs": 117907, + "total_submitted": 143722, "frontend_question_id": 1684, "is_new_question": false }, @@ -18921,8 +19243,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 4897, - "total_submitted": 12595, + "total_acs": 4922, + "total_submitted": 12641, "frontend_question_id": 1645, "is_new_question": false }, @@ -18944,8 +19266,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 13621, - "total_submitted": 24226, + "total_acs": 13676, + "total_submitted": 24311, "frontend_question_id": 1665, "is_new_question": false }, @@ -18967,8 +19289,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 28907, - "total_submitted": 45656, + "total_acs": 29034, + "total_submitted": 45875, "frontend_question_id": 1664, "is_new_question": false }, @@ -18990,8 +19312,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": 85940, - "total_submitted": 128598, + "total_acs": 86080, + "total_submitted": 128788, "frontend_question_id": 1663, "is_new_question": false }, @@ -19013,8 +19335,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": 254131, - "total_submitted": 304881, + "total_acs": 255625, + "total_submitted": 306629, "frontend_question_id": 1662, "is_new_question": false }, @@ -19036,8 +19358,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": 55208, - "total_submitted": 92595, + "total_acs": 55389, + "total_submitted": 92840, "frontend_question_id": 1644, "is_new_question": false }, @@ -19059,8 +19381,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 6466, - "total_submitted": 12282, + "total_acs": 6505, + "total_submitted": 12387, "frontend_question_id": 1635, "is_new_question": false }, @@ -19082,8 +19404,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 4208, - "total_submitted": 11010, + "total_acs": 4232, + "total_submitted": 11060, "frontend_question_id": 1659, "is_new_question": false }, @@ -19105,8 +19427,8 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 103395, - "total_submitted": 183394, + "total_acs": 103716, + "total_submitted": 184001, "frontend_question_id": 1657, "is_new_question": false }, @@ -19128,8 +19450,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": 107558, - "total_submitted": 286034, + "total_acs": 107799, + "total_submitted": 286671, "frontend_question_id": 1658, "is_new_question": false }, @@ -19151,8 +19473,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 61359, - "total_submitted": 71833, + "total_acs": 62033, + "total_submitted": 72663, "frontend_question_id": 1656, "is_new_question": false }, @@ -19174,8 +19496,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": 8268, - "total_submitted": 15323, + "total_acs": 8325, + "total_submitted": 15410, "frontend_question_id": 1634, "is_new_question": false }, @@ -19197,8 +19519,8 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 20834, - "total_submitted": 30658, + "total_acs": 21135, + "total_submitted": 31160, "frontend_question_id": 1633, "is_new_question": false }, @@ -19220,8 +19542,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 21964, - "total_submitted": 58973, + "total_acs": 22025, + "total_submitted": 59101, "frontend_question_id": 1649, "is_new_question": false }, @@ -19243,8 +19565,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 33926, - "total_submitted": 111543, + "total_acs": 33997, + "total_submitted": 111803, "frontend_question_id": 1648, "is_new_question": false }, @@ -19266,8 +19588,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": 166957, - "total_submitted": 282153, + "total_acs": 167381, + "total_submitted": 282942, "frontend_question_id": 1647, "is_new_question": false }, @@ -19289,8 +19611,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 80126, - "total_submitted": 159645, + "total_acs": 80777, + "total_submitted": 160954, "frontend_question_id": 1646, "is_new_question": false }, @@ -19312,8 +19634,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": 23614, - "total_submitted": 28508, + "total_acs": 23691, + "total_submitted": 28587, "frontend_question_id": 1628, "is_new_question": false }, @@ -19335,8 +19657,8 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 19693, - "total_submitted": 34240, + "total_acs": 19827, + "total_submitted": 34454, "frontend_question_id": 1670, "is_new_question": false }, @@ -19358,8 +19680,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": 19676, - "total_submitted": 46374, + "total_acs": 19794, + "total_submitted": 46665, "frontend_question_id": 1671, "is_new_question": false }, @@ -19381,8 +19703,8 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 65501, - "total_submitted": 88215, + "total_acs": 65939, + "total_submitted": 88855, "frontend_question_id": 1669, "is_new_question": false }, @@ -19404,8 +19726,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 32221, - "total_submitted": 81460, + "total_acs": 32462, + "total_submitted": 82036, "frontend_question_id": 1668, "is_new_question": false }, @@ -19427,8 +19749,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": 16140, - "total_submitted": 18461, + "total_acs": 16224, + "total_submitted": 18590, "frontend_question_id": 1623, "is_new_question": false }, @@ -19450,8 +19772,8 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 110068, - "total_submitted": 227911, + "total_acs": 110367, + "total_submitted": 228541, "frontend_question_id": 1642, "is_new_question": false }, @@ -19473,8 +19795,8 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 150358, - "total_submitted": 194662, + "total_acs": 150883, + "total_submitted": 195311, "frontend_question_id": 1641, "is_new_question": false }, @@ -19496,8 +19818,8 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 73020, - "total_submitted": 129965, + "total_acs": 73175, + "total_submitted": 130222, "frontend_question_id": 1640, "is_new_question": false }, @@ -19519,8 +19841,8 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 14283, - "total_submitted": 18834, + "total_acs": 14410, + "total_submitted": 19005, "frontend_question_id": 1613, "is_new_question": false }, @@ -19542,8 +19864,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 9733, - "total_submitted": 24912, + "total_acs": 9815, + "total_submitted": 25064, "frontend_question_id": 1655, "is_new_question": false }, @@ -19565,8 +19887,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 32820, - "total_submitted": 113810, + "total_acs": 33082, + "total_submitted": 114705, "frontend_question_id": 1654, "is_new_question": false }, @@ -19588,8 +19910,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 31679, - "total_submitted": 53754, + "total_acs": 31935, + "total_submitted": 54143, "frontend_question_id": 1653, "is_new_question": false }, @@ -19611,8 +19933,8 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 28844, - "total_submitted": 46749, + "total_acs": 29091, + "total_submitted": 47073, "frontend_question_id": 1652, "is_new_question": false }, @@ -19634,8 +19956,8 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 135686, - "total_submitted": 244719, + "total_acs": 136480, + "total_submitted": 246016, "frontend_question_id": 1631, "is_new_question": false }, @@ -19657,8 +19979,8 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 45992, - "total_submitted": 57369, + "total_acs": 46417, + "total_submitted": 57909, "frontend_question_id": 1630, "is_new_question": false }, @@ -19680,8 +20002,8 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 86290, - "total_submitted": 145495, + "total_acs": 86499, + "total_submitted": 145890, "frontend_question_id": 1629, "is_new_question": false }, @@ -19703,8 +20025,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": 5998, - "total_submitted": 8552, + "total_acs": 6018, + "total_submitted": 8578, "frontend_question_id": 1612, "is_new_question": false }, @@ -19726,8 +20048,8 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 22394, - "total_submitted": 40505, + "total_acs": 22688, + "total_submitted": 41065, "frontend_question_id": 1607, "is_new_question": false }, @@ -19749,8 +20071,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 22824, - "total_submitted": 55437, + "total_acs": 22945, + "total_submitted": 55684, "frontend_question_id": 1626, "is_new_question": false }, @@ -19772,8 +20094,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 11910, - "total_submitted": 18106, + "total_acs": 11957, + "total_submitted": 18170, "frontend_question_id": 1625, "is_new_question": false }, @@ -19795,8 +20117,8 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 39350, - "total_submitted": 66638, + "total_acs": 39554, + "total_submitted": 66989, "frontend_question_id": 1624, "is_new_question": false }, @@ -19818,8 +20140,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": 20598, - "total_submitted": 27290, + "total_acs": 20647, + "total_submitted": 27354, "frontend_question_id": 1602, "is_new_question": false }, @@ -19841,8 +20163,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": 9828, - "total_submitted": 22778, + "total_acs": 9878, + "total_submitted": 22931, "frontend_question_id": 1639, "is_new_question": false }, @@ -19864,8 +20186,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": 22931, - "total_submitted": 32144, + "total_acs": 23028, + "total_submitted": 32282, "frontend_question_id": 1638, "is_new_question": false }, @@ -19887,8 +20209,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": 36737, - "total_submitted": 43565, + "total_acs": 36983, + "total_submitted": 43851, "frontend_question_id": 1637, "is_new_question": false }, @@ -19910,8 +20232,8 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 86563, - "total_submitted": 125283, + "total_acs": 87340, + "total_submitted": 126307, "frontend_question_id": 1636, "is_new_question": false }, @@ -19933,8 +20255,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": 7700, - "total_submitted": 11666, + "total_acs": 7736, + "total_submitted": 11724, "frontend_question_id": 1617, "is_new_question": false }, @@ -19956,8 +20278,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 19418, - "total_submitted": 61975, + "total_acs": 19471, + "total_submitted": 62170, "frontend_question_id": 1616, "is_new_question": false }, @@ -19979,8 +20301,8 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 57669, - "total_submitted": 98958, + "total_acs": 58054, + "total_submitted": 99545, "frontend_question_id": 1615, "is_new_question": false }, @@ -20002,8 +20324,8 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 116914, - "total_submitted": 141759, + "total_acs": 117958, + "total_submitted": 143039, "frontend_question_id": 1614, "is_new_question": false }, @@ -20025,8 +20347,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": 11601, - "total_submitted": 18553, + "total_acs": 11641, + "total_submitted": 18607, "frontend_question_id": 1597, "is_new_question": false }, @@ -20048,8 +20370,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": 24600, - "total_submitted": 28992, + "total_acs": 24790, + "total_submitted": 29267, "frontend_question_id": 1596, "is_new_question": false }, @@ -20071,8 +20393,8 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 57974, - "total_submitted": 65729, + "total_acs": 59308, + "total_submitted": 67492, "frontend_question_id": 1587, "is_new_question": false }, @@ -20094,8 +20416,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 35027, - "total_submitted": 93767, + "total_acs": 35202, + "total_submitted": 94253, "frontend_question_id": 1610, "is_new_question": false }, @@ -20117,8 +20439,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": 12241, - "total_submitted": 19303, + "total_acs": 12298, + "total_submitted": 19408, "frontend_question_id": 1611, "is_new_question": false }, @@ -20140,8 +20462,8 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 40964, - "total_submitted": 75889, + "total_acs": 41227, + "total_submitted": 76285, "frontend_question_id": 1609, "is_new_question": false }, @@ -20163,8 +20485,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": 59559, - "total_submitted": 98848, + "total_acs": 60231, + "total_submitted": 99851, "frontend_question_id": 1608, "is_new_question": false }, @@ -20186,8 +20508,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 12238, - "total_submitted": 17276, + "total_acs": 12298, + "total_submitted": 17355, "frontend_question_id": 1586, "is_new_question": false }, @@ -20209,8 +20531,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 9070, - "total_submitted": 56634, + "total_acs": 9128, + "total_submitted": 56905, "frontend_question_id": 1622, "is_new_question": false }, @@ -20232,8 +20554,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 5546, - "total_submitted": 13801, + "total_acs": 5588, + "total_submitted": 13900, "frontend_question_id": 1728, "is_new_question": false }, @@ -20255,8 +20577,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 7285, - "total_submitted": 19330, + "total_acs": 7304, + "total_submitted": 19366, "frontend_question_id": 1620, "is_new_question": false }, @@ -20278,8 +20600,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": 7906, - "total_submitted": 18741, + "total_acs": 7939, + "total_submitted": 18806, "frontend_question_id": 1621, "is_new_question": false }, @@ -20301,8 +20623,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": 73697, - "total_submitted": 84886, + "total_acs": 75738, + "total_submitted": 87523, "frontend_question_id": 1581, "is_new_question": false }, @@ -20324,8 +20646,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 9012, - "total_submitted": 17611, + "total_acs": 9025, + "total_submitted": 17637, "frontend_question_id": 1601, "is_new_question": false }, @@ -20347,8 +20669,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 13328, - "total_submitted": 20910, + "total_acs": 13378, + "total_submitted": 20976, "frontend_question_id": 1600, "is_new_question": false }, @@ -20370,8 +20692,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": 10545, - "total_submitted": 24192, + "total_acs": 10562, + "total_submitted": 24219, "frontend_question_id": 1599, "is_new_question": false }, @@ -20393,8 +20715,8 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 54746, - "total_submitted": 84968, + "total_acs": 55141, + "total_submitted": 85590, "frontend_question_id": 1598, "is_new_question": false }, @@ -20416,8 +20738,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 3807, - "total_submitted": 5983, + "total_acs": 3818, + "total_submitted": 6003, "frontend_question_id": 1580, "is_new_question": false }, @@ -20439,8 +20761,8 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 31072, - "total_submitted": 34641, + "total_acs": 31496, + "total_submitted": 35129, "frontend_question_id": 1571, "is_new_question": false }, @@ -20462,8 +20784,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": 7056, - "total_submitted": 15182, + "total_acs": 7074, + "total_submitted": 15223, "frontend_question_id": 1595, "is_new_question": false }, @@ -20485,8 +20807,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": 19694, - "total_submitted": 59527, + "total_acs": 19784, + "total_submitted": 59775, "frontend_question_id": 1594, "is_new_question": false }, @@ -20508,8 +20830,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": 24248, - "total_submitted": 44024, + "total_acs": 24346, + "total_submitted": 44194, "frontend_question_id": 1593, "is_new_question": false }, @@ -20531,8 +20853,8 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 45197, - "total_submitted": 103505, + "total_acs": 45429, + "total_submitted": 104251, "frontend_question_id": 1592, "is_new_question": false }, @@ -20554,8 +20876,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 179986, - "total_submitted": 199186, + "total_acs": 180514, + "total_submitted": 199780, "frontend_question_id": 1570, "is_new_question": false }, @@ -20577,8 +20899,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 17701, - "total_submitted": 21315, + "total_acs": 17812, + "total_submitted": 21447, "frontend_question_id": 1565, "is_new_question": false }, @@ -20600,8 +20922,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": 31775, - "total_submitted": 40779, + "total_acs": 31929, + "total_submitted": 40976, "frontend_question_id": 1605, "is_new_question": false }, @@ -20623,8 +20945,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": 12236, - "total_submitted": 28372, + "total_acs": 12331, + "total_submitted": 28598, "frontend_question_id": 1606, "is_new_question": false }, @@ -20646,8 +20968,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": 28061, - "total_submitted": 59587, + "total_acs": 28198, + "total_submitted": 59894, "frontend_question_id": 1604, "is_new_question": false }, @@ -20669,8 +20991,8 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 162511, - "total_submitted": 184683, + "total_acs": 163669, + "total_submitted": 185980, "frontend_question_id": 1603, "is_new_question": false }, @@ -20692,8 +21014,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": 6690, - "total_submitted": 13849, + "total_acs": 6709, + "total_submitted": 13888, "frontend_question_id": 1585, "is_new_question": false }, @@ -20715,8 +21037,8 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 143814, - "total_submitted": 224915, + "total_acs": 145225, + "total_submitted": 227169, "frontend_question_id": 1584, "is_new_question": false }, @@ -20738,8 +21060,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 22399, - "total_submitted": 36953, + "total_acs": 22591, + "total_submitted": 37218, "frontend_question_id": 1583, "is_new_question": false }, @@ -20761,8 +21083,8 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 38210, - "total_submitted": 58322, + "total_acs": 38500, + "total_submitted": 58741, "frontend_question_id": 1582, "is_new_question": false }, @@ -20784,8 +21106,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 14054, - "total_submitted": 20963, + "total_acs": 14077, + "total_submitted": 21001, "frontend_question_id": 1564, "is_new_question": false }, @@ -20807,8 +21129,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 13293, - "total_submitted": 25139, + "total_acs": 13395, + "total_submitted": 25342, "frontend_question_id": 1555, "is_new_question": false }, @@ -20830,8 +21152,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": 17666, - "total_submitted": 33300, + "total_acs": 17784, + "total_submitted": 33504, "frontend_question_id": 1579, "is_new_question": false }, @@ -20853,8 +21175,8 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 141575, - "total_submitted": 222426, + "total_acs": 142149, + "total_submitted": 223346, "frontend_question_id": 1578, "is_new_question": false }, @@ -20876,8 +21198,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": 17535, - "total_submitted": 43758, + "total_acs": 17584, + "total_submitted": 43888, "frontend_question_id": 1577, "is_new_question": false }, @@ -20899,8 +21221,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": 50472, - "total_submitted": 103438, + "total_acs": 50624, + "total_submitted": 104033, "frontend_question_id": 1576, "is_new_question": false }, @@ -20922,8 +21244,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 21625, - "total_submitted": 50471, + "total_acs": 21678, + "total_submitted": 50692, "frontend_question_id": 1554, "is_new_question": false }, @@ -20945,8 +21267,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 8056, - "total_submitted": 13754, + "total_acs": 8119, + "total_submitted": 13876, "frontend_question_id": 1591, "is_new_question": false }, @@ -20968,8 +21290,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 14932, - "total_submitted": 40322, + "total_acs": 15035, + "total_submitted": 40597, "frontend_question_id": 1589, "is_new_question": false }, @@ -20991,8 +21313,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 19829, - "total_submitted": 70522, + "total_acs": 20500, + "total_submitted": 72879, "frontend_question_id": 1590, "is_new_question": false }, @@ -21014,8 +21336,8 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 140194, - "total_submitted": 167946, + "total_acs": 141775, + "total_submitted": 169826, "frontend_question_id": 1588, "is_new_question": false }, @@ -21037,8 +21359,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": 11400, - "total_submitted": 23707, + "total_acs": 11435, + "total_submitted": 23794, "frontend_question_id": 1569, "is_new_question": false }, @@ -21060,8 +21382,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": 10292, - "total_submitted": 22053, + "total_acs": 10354, + "total_submitted": 22187, "frontend_question_id": 1568, "is_new_question": false }, @@ -21083,8 +21405,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": 78321, - "total_submitted": 178792, + "total_acs": 78809, + "total_submitted": 179875, "frontend_question_id": 1567, "is_new_question": false }, @@ -21106,8 +21428,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": 28265, - "total_submitted": 64906, + "total_acs": 28416, + "total_submitted": 65179, "frontend_question_id": 1566, "is_new_question": false }, @@ -21129,8 +21451,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": 20291, - "total_submitted": 29982, + "total_acs": 20602, + "total_submitted": 30425, "frontend_question_id": 1549, "is_new_question": false }, @@ -21152,8 +21474,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": 14494, - "total_submitted": 25440, + "total_acs": 14538, + "total_submitted": 25533, "frontend_question_id": 1548, "is_new_question": false }, @@ -21175,8 +21497,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 16525, - "total_submitted": 26847, + "total_acs": 16643, + "total_submitted": 27070, "frontend_question_id": 1543, "is_new_question": false }, @@ -21198,8 +21520,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 15176, - "total_submitted": 37452, + "total_acs": 15217, + "total_submitted": 37612, "frontend_question_id": 1563, "is_new_question": false }, @@ -21221,8 +21543,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 15416, - "total_submitted": 36157, + "total_acs": 15477, + "total_submitted": 36301, "frontend_question_id": 1562, "is_new_question": false }, @@ -21244,8 +21566,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": 60640, - "total_submitted": 77037, + "total_acs": 61185, + "total_submitted": 77643, "frontend_question_id": 1561, "is_new_question": false }, @@ -21267,8 +21589,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": 25230, - "total_submitted": 43192, + "total_acs": 25325, + "total_submitted": 43369, "frontend_question_id": 1560, "is_new_question": false }, @@ -21290,8 +21612,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": 1674, - "total_submitted": 2645, + "total_acs": 1688, + "total_submitted": 2660, "frontend_question_id": 1538, "is_new_question": false }, @@ -21313,8 +21635,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 12217, - "total_submitted": 21542, + "total_acs": 12275, + "total_submitted": 21640, "frontend_question_id": 1575, "is_new_question": false }, @@ -21336,8 +21658,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": 23666, - "total_submitted": 64398, + "total_acs": 23826, + "total_submitted": 64740, "frontend_question_id": 1574, "is_new_question": false }, @@ -21359,8 +21681,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": 23005, - "total_submitted": 70931, + "total_acs": 23085, + "total_submitted": 71230, "frontend_question_id": 1573, "is_new_question": false }, @@ -21382,8 +21704,8 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 158482, - "total_submitted": 198255, + "total_acs": 160403, + "total_submitted": 200509, "frontend_question_id": 1572, "is_new_question": false }, @@ -21405,8 +21727,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": 28258, - "total_submitted": 81441, + "total_acs": 28377, + "total_submitted": 81730, "frontend_question_id": 1553, "is_new_question": false }, @@ -21428,8 +21750,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 36917, - "total_submitted": 64315, + "total_acs": 37189, + "total_submitted": 64725, "frontend_question_id": 1552, "is_new_question": false }, @@ -21451,8 +21773,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 77176, - "total_submitted": 94997, + "total_acs": 77974, + "total_submitted": 95854, "frontend_question_id": 1551, "is_new_question": false }, @@ -21474,8 +21796,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": 5676, - "total_submitted": 11118, + "total_acs": 9567, + "total_submitted": 17227, "frontend_question_id": 1533, "is_new_question": false }, @@ -21497,8 +21819,8 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 20811, - "total_submitted": 29454, + "total_acs": 21014, + "total_submitted": 29799, "frontend_question_id": 1532, "is_new_question": false }, @@ -21520,8 +21842,8 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 83823, - "total_submitted": 201679, + "total_acs": 86278, + "total_submitted": 208107, "frontend_question_id": 1527, "is_new_question": false }, @@ -21543,8 +21865,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 42239, - "total_submitted": 73964, + "total_acs": 42738, + "total_submitted": 74799, "frontend_question_id": 1547, "is_new_question": false }, @@ -21566,8 +21888,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 10826, - "total_submitted": 25980, + "total_acs": 10860, + "total_submitted": 26050, "frontend_question_id": 1542, "is_new_question": false }, @@ -21589,8 +21911,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": 30898, - "total_submitted": 52966, + "total_acs": 31080, + "total_submitted": 53286, "frontend_question_id": 1545, "is_new_question": false }, @@ -21612,8 +21934,8 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 130313, - "total_submitted": 205863, + "total_acs": 130981, + "total_submitted": 206953, "frontend_question_id": 1544, "is_new_question": false }, @@ -21635,8 +21957,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 37019, - "total_submitted": 50347, + "total_acs": 37274, + "total_submitted": 50662, "frontend_question_id": 1522, "is_new_question": false }, @@ -21658,8 +21980,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 21985, - "total_submitted": 39865, + "total_acs": 22094, + "total_submitted": 40208, "frontend_question_id": 1517, "is_new_question": false }, @@ -21681,8 +22003,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 30815, - "total_submitted": 63989, + "total_acs": 31002, + "total_submitted": 64381, "frontend_question_id": 1559, "is_new_question": false }, @@ -21704,8 +22026,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": 17569, - "total_submitted": 27412, + "total_acs": 17629, + "total_submitted": 27536, "frontend_question_id": 1558, "is_new_question": false }, @@ -21727,8 +22049,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": 83862, - "total_submitted": 105474, + "total_acs": 84567, + "total_submitted": 106360, "frontend_question_id": 1557, "is_new_question": false }, @@ -21750,8 +22072,8 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 39577, - "total_submitted": 72154, + "total_acs": 39752, + "total_submitted": 72532, "frontend_question_id": 1556, "is_new_question": false }, @@ -21773,8 +22095,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 20556, - "total_submitted": 52300, + "total_acs": 20649, + "total_submitted": 52514, "frontend_question_id": 1537, "is_new_question": false }, @@ -21796,8 +22118,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": 12580, - "total_submitted": 27050, + "total_acs": 12610, + "total_submitted": 27105, "frontend_question_id": 1536, "is_new_question": false }, @@ -21819,8 +22141,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": 27591, - "total_submitted": 56636, + "total_acs": 27672, + "total_submitted": 56817, "frontend_question_id": 1535, "is_new_question": false }, @@ -21842,8 +22164,8 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 90914, - "total_submitted": 112436, + "total_acs": 91432, + "total_submitted": 113049, "frontend_question_id": 1534, "is_new_question": false }, @@ -21865,8 +22187,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": 1947, - "total_submitted": 3048, + "total_acs": 1953, + "total_submitted": 3062, "frontend_question_id": 1516, "is_new_question": false }, @@ -21888,8 +22210,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 33711, - "total_submitted": 46516, + "total_acs": 33904, + "total_submitted": 46897, "frontend_question_id": 1511, "is_new_question": false }, @@ -21911,8 +22233,8 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 32850, - "total_submitted": 53888, + "total_acs": 32976, + "total_submitted": 54083, "frontend_question_id": 1530, "is_new_question": false }, @@ -21934,8 +22256,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 37215, - "total_submitted": 51363, + "total_acs": 37447, + "total_submitted": 51668, "frontend_question_id": 1529, "is_new_question": false }, @@ -21957,8 +22279,8 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 268307, - "total_submitted": 313903, + "total_acs": 270509, + "total_submitted": 316536, "frontend_question_id": 1528, "is_new_question": false }, @@ -21980,8 +22302,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 27572, - "total_submitted": 35206, + "total_acs": 27772, + "total_submitted": 35452, "frontend_question_id": 1506, "is_new_question": false }, @@ -22003,8 +22325,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": 23688, - "total_submitted": 50025, + "total_acs": 23773, + "total_submitted": 50191, "frontend_question_id": 1546, "is_new_question": false }, @@ -22026,8 +22348,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": 36889, - "total_submitted": 73984, + "total_acs": 37020, + "total_submitted": 74246, "frontend_question_id": 1541, "is_new_question": false }, @@ -22049,8 +22371,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 15192, - "total_submitted": 45633, + "total_acs": 15235, + "total_submitted": 45745, "frontend_question_id": 1540, "is_new_question": false }, @@ -22072,8 +22394,8 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 208665, - "total_submitted": 372016, + "total_acs": 210033, + "total_submitted": 374238, "frontend_question_id": 1539, "is_new_question": false }, @@ -22095,8 +22417,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": 8419, - "total_submitted": 19289, + "total_acs": 8453, + "total_submitted": 19365, "frontend_question_id": 1521, "is_new_question": false }, @@ -22118,8 +22440,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 12724, - "total_submitted": 33330, + "total_acs": 12779, + "total_submitted": 33469, "frontend_question_id": 1520, "is_new_question": false }, @@ -22141,8 +22463,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": 73859, - "total_submitted": 132951, + "total_acs": 76503, + "total_submitted": 138072, "frontend_question_id": 1519, "is_new_question": false }, @@ -22164,8 +22486,8 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 58437, - "total_submitted": 96895, + "total_acs": 58736, + "total_submitted": 97358, "frontend_question_id": 1518, "is_new_question": false }, @@ -22187,8 +22509,8 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 28868, - "total_submitted": 50235, + "total_acs": 29265, + "total_submitted": 51100, "frontend_question_id": 1501, "is_new_question": false }, @@ -22210,8 +22532,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 3359, - "total_submitted": 7503, + "total_acs": 3373, + "total_submitted": 7530, "frontend_question_id": 1500, "is_new_question": false }, @@ -22233,8 +22555,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 23536, - "total_submitted": 47499, + "total_acs": 23694, + "total_submitted": 47880, "frontend_question_id": 1495, "is_new_question": false }, @@ -22256,8 +22578,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 11505, - "total_submitted": 30502, + "total_acs": 11592, + "total_submitted": 30741, "frontend_question_id": 1515, "is_new_question": false }, @@ -22279,8 +22601,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 42448, - "total_submitted": 85360, + "total_acs": 42566, + "total_submitted": 85614, "frontend_question_id": 1531, "is_new_question": false }, @@ -22302,8 +22624,8 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 34968, - "total_submitted": 77109, + "total_acs": 35192, + "total_submitted": 77516, "frontend_question_id": 1513, "is_new_question": false }, @@ -22325,8 +22647,8 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 394474, - "total_submitted": 447020, + "total_acs": 398434, + "total_submitted": 451485, "frontend_question_id": 1512, "is_new_question": false }, @@ -22348,8 +22670,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 24136, - "total_submitted": 28896, + "total_acs": 24248, + "total_submitted": 29023, "frontend_question_id": 1490, "is_new_question": false }, @@ -22371,8 +22693,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": 29721, - "total_submitted": 43282, + "total_acs": 29863, + "total_submitted": 43490, "frontend_question_id": 1526, "is_new_question": false }, @@ -22394,8 +22716,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": 85423, - "total_submitted": 123437, + "total_acs": 85792, + "total_submitted": 124013, "frontend_question_id": 1525, "is_new_question": false }, @@ -22417,8 +22739,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": 29449, - "total_submitted": 67410, + "total_acs": 29611, + "total_submitted": 67861, "frontend_question_id": 1524, "is_new_question": false }, @@ -22440,8 +22762,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": 176116, - "total_submitted": 382318, + "total_acs": 179769, + "total_submitted": 390864, "frontend_question_id": 1523, "is_new_question": false }, @@ -22463,8 +22785,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": 8434, - "total_submitted": 21999, + "total_acs": 8464, + "total_submitted": 22070, "frontend_question_id": 1505, "is_new_question": false }, @@ -22486,8 +22808,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 42077, - "total_submitted": 72967, + "total_acs": 42255, + "total_submitted": 73271, "frontend_question_id": 1504, "is_new_question": false }, @@ -22509,8 +22831,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": 17494, - "total_submitted": 31583, + "total_acs": 17564, + "total_submitted": 31739, "frontend_question_id": 1503, "is_new_question": false }, @@ -22532,8 +22854,8 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 117024, - "total_submitted": 172006, + "total_acs": 118366, + "total_submitted": 174053, "frontend_question_id": 1502, "is_new_question": false }, @@ -22555,8 +22877,8 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 94660, - "total_submitted": 115583, + "total_acs": 97300, + "total_submitted": 119260, "frontend_question_id": 1484, "is_new_question": false }, @@ -22578,8 +22900,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 19532, - "total_submitted": 24630, + "total_acs": 19615, + "total_submitted": 24731, "frontend_question_id": 1485, "is_new_question": false }, @@ -22601,8 +22923,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 14753, - "total_submitted": 18015, + "total_acs": 14798, + "total_submitted": 18114, "frontend_question_id": 1479, "is_new_question": false }, @@ -22624,8 +22946,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 36098, - "total_submitted": 78296, + "total_acs": 36237, + "total_submitted": 78666, "frontend_question_id": 1499, "is_new_question": false }, @@ -22647,8 +22969,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": 38284, - "total_submitted": 101452, + "total_acs": 38665, + "total_submitted": 102515, "frontend_question_id": 1498, "is_new_question": false }, @@ -22670,8 +22992,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": 38798, - "total_submitted": 98593, + "total_acs": 38989, + "total_submitted": 99167, "frontend_question_id": 1497, "is_new_question": false }, @@ -22693,8 +23015,8 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 42328, - "total_submitted": 75640, + "total_acs": 42644, + "total_submitted": 76258, "frontend_question_id": 1496, "is_new_question": false }, @@ -22716,8 +23038,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": 24149, - "total_submitted": 32770, + "total_acs": 24263, + "total_submitted": 32946, "frontend_question_id": 1474, "is_new_question": false }, @@ -22739,8 +23061,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 63568, - "total_submitted": 105140, + "total_acs": 63698, + "total_submitted": 105314, "frontend_question_id": 1510, "is_new_question": false }, @@ -22762,8 +23084,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": 73168, - "total_submitted": 133891, + "total_acs": 73331, + "total_submitted": 134204, "frontend_question_id": 1509, "is_new_question": false }, @@ -22785,8 +23107,8 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 30761, - "total_submitted": 52000, + "total_acs": 30949, + "total_submitted": 52341, "frontend_question_id": 1508, "is_new_question": false }, @@ -22808,8 +23130,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": 10351, - "total_submitted": 19658, + "total_acs": 10402, + "total_submitted": 19749, "frontend_question_id": 1489, "is_new_question": false }, @@ -22831,8 +23153,8 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 29062, - "total_submitted": 110917, + "total_acs": 29222, + "total_submitted": 111471, "frontend_question_id": 1488, "is_new_question": false }, @@ -22854,8 +23176,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 28799, - "total_submitted": 79963, + "total_acs": 28873, + "total_submitted": 80127, "frontend_question_id": 1487, "is_new_question": false }, @@ -22877,8 +23199,8 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 144792, - "total_submitted": 171558, + "total_acs": 145678, + "total_submitted": 172598, "frontend_question_id": 1486, "is_new_question": false }, @@ -22900,8 +23222,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 41870, - "total_submitted": 51096, + "total_acs": 42073, + "total_submitted": 51312, "frontend_question_id": 1469, "is_new_question": false }, @@ -22923,8 +23245,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 19538, - "total_submitted": 23940, + "total_acs": 19664, + "total_submitted": 24144, "frontend_question_id": 1468, "is_new_question": false }, @@ -22946,8 +23268,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 13424, - "total_submitted": 19259, + "total_acs": 13586, + "total_submitted": 19460, "frontend_question_id": 1459, "is_new_question": false }, @@ -22969,8 +23291,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": 53735, - "total_submitted": 97748, + "total_acs": 54262, + "total_submitted": 98943, "frontend_question_id": 1482, "is_new_question": false }, @@ -22992,8 +23314,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": 89891, - "total_submitted": 159297, + "total_acs": 90542, + "total_submitted": 160880, "frontend_question_id": 1481, "is_new_question": false }, @@ -23015,8 +23337,8 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 1209419, - "total_submitted": 1365525, + "total_acs": 1233496, + "total_submitted": 1395251, "frontend_question_id": 1480, "is_new_question": false }, @@ -23038,8 +23360,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 13043, - "total_submitted": 42444, + "total_acs": 13119, + "total_submitted": 42776, "frontend_question_id": 1494, "is_new_question": false }, @@ -23061,8 +23383,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": 54194, - "total_submitted": 89874, + "total_acs": 54798, + "total_submitted": 90871, "frontend_question_id": 1493, "is_new_question": false }, @@ -23084,8 +23406,8 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 109021, - "total_submitted": 174417, + "total_acs": 109435, + "total_submitted": 174950, "frontend_question_id": 1492, "is_new_question": false }, @@ -23107,8 +23429,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": 177989, - "total_submitted": 286329, + "total_acs": 180908, + "total_submitted": 291566, "frontend_question_id": 1491, "is_new_question": false }, @@ -23130,8 +23452,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 54206, - "total_submitted": 87621, + "total_acs": 54368, + "total_submitted": 87924, "frontend_question_id": 1473, "is_new_question": false }, @@ -23153,8 +23475,8 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 112831, - "total_submitted": 148132, + "total_acs": 113839, + "total_submitted": 149432, "frontend_question_id": 1472, "is_new_question": false }, @@ -23176,8 +23498,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": 30938, - "total_submitted": 51322, + "total_acs": 31036, + "total_submitted": 51486, "frontend_question_id": 1471, "is_new_question": false }, @@ -23199,8 +23521,8 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 401707, - "total_submitted": 454118, + "total_acs": 405091, + "total_submitted": 458161, "frontend_question_id": 1470, "is_new_question": false }, @@ -23222,8 +23544,8 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 30028, - "total_submitted": 78937, + "total_acs": 30194, + "total_submitted": 79468, "frontend_question_id": 1454, "is_new_question": false }, @@ -23245,8 +23567,8 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 39130, - "total_submitted": 43167, + "total_acs": 39616, + "total_submitted": 43746, "frontend_question_id": 1445, "is_new_question": false }, @@ -23268,8 +23590,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": 6837, - "total_submitted": 11217, + "total_acs": 6868, + "total_submitted": 11260, "frontend_question_id": 1467, "is_new_question": false }, @@ -23291,8 +23613,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": 71431, - "total_submitted": 115875, + "total_acs": 71981, + "total_submitted": 116711, "frontend_question_id": 1466, "is_new_question": false }, @@ -23314,8 +23636,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": 158414, - "total_submitted": 387735, + "total_acs": 158637, + "total_submitted": 388355, "frontend_question_id": 1465, "is_new_question": false }, @@ -23337,8 +23659,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": 172392, - "total_submitted": 216517, + "total_acs": 173658, + "total_submitted": 217963, "frontend_question_id": 1464, "is_new_question": false }, @@ -23360,8 +23682,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": 42546, - "total_submitted": 115332, + "total_acs": 42642, + "total_submitted": 115639, "frontend_question_id": 1477, "is_new_question": false }, @@ -23383,8 +23705,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 84156, - "total_submitted": 95266, + "total_acs": 84627, + "total_submitted": 95771, "frontend_question_id": 1476, "is_new_question": false }, @@ -23406,8 +23728,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 19350, - "total_submitted": 34798, + "total_acs": 19426, + "total_submitted": 34919, "frontend_question_id": 1478, "is_new_question": false }, @@ -23429,8 +23751,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": 98846, - "total_submitted": 130555, + "total_acs": 99567, + "total_submitted": 131445, "frontend_question_id": 1475, "is_new_question": false }, @@ -23452,8 +23774,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 19006, - "total_submitted": 40871, + "total_acs": 19053, + "total_submitted": 40966, "frontend_question_id": 1458, "is_new_question": false }, @@ -23475,8 +23797,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": 112225, - "total_submitted": 165121, + "total_acs": 112394, + "total_submitted": 165441, "frontend_question_id": 1457, "is_new_question": false }, @@ -23498,8 +23820,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": 53596, - "total_submitted": 92202, + "total_acs": 54161, + "total_submitted": 93151, "frontend_question_id": 1456, "is_new_question": false }, @@ -23521,8 +23843,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": 60492, - "total_submitted": 94122, + "total_acs": 60800, + "total_submitted": 94621, "frontend_question_id": 1455, "is_new_question": false }, @@ -23544,8 +23866,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 19645, - "total_submitted": 25846, + "total_acs": 19925, + "total_submitted": 26254, "frontend_question_id": 1440, "is_new_question": false }, @@ -23567,8 +23889,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 19083, - "total_submitted": 24615, + "total_acs": 19175, + "total_submitted": 24766, "frontend_question_id": 1435, "is_new_question": false }, @@ -23590,8 +23912,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": 5046, - "total_submitted": 13694, + "total_acs": 5062, + "total_submitted": 13727, "frontend_question_id": 1453, "is_new_question": false }, @@ -23613,8 +23935,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": 20588, - "total_submitted": 36228, + "total_acs": 20644, + "total_submitted": 36342, "frontend_question_id": 1452, "is_new_question": false }, @@ -23636,8 +23958,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 42621, - "total_submitted": 67815, + "total_acs": 42798, + "total_submitted": 68056, "frontend_question_id": 1451, "is_new_question": false }, @@ -23659,8 +23981,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": 96972, - "total_submitted": 127795, + "total_acs": 97350, + "total_submitted": 128273, "frontend_question_id": 1450, "is_new_question": false }, @@ -23682,8 +24004,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 75278, - "total_submitted": 107584, + "total_acs": 75738, + "total_submitted": 108303, "frontend_question_id": 1463, "is_new_question": false }, @@ -23705,8 +24027,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 40216, - "total_submitted": 82087, + "total_acs": 40410, + "total_submitted": 82478, "frontend_question_id": 1462, "is_new_question": false }, @@ -23728,8 +24050,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": 106188, - "total_submitted": 187333, + "total_acs": 106621, + "total_submitted": 188166, "frontend_question_id": 1461, "is_new_question": false }, @@ -23751,8 +24073,8 @@ "question__title": "Make Two Arrays Equal by Reversing Subarrays", "question__title_slug": "make-two-arrays-equal-by-reversing-subarrays", "question__hide": false, - "total_acs": 100867, - "total_submitted": 139666, + "total_acs": 101259, + "total_submitted": 140245, "frontend_question_id": 1460, "is_new_question": false }, @@ -23774,8 +24096,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": 23352, - "total_submitted": 40901, + "total_acs": 23678, + "total_submitted": 41563, "frontend_question_id": 1444, "is_new_question": false }, @@ -23797,8 +24119,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": 93479, - "total_submitted": 148338, + "total_acs": 95583, + "total_submitted": 152062, "frontend_question_id": 1443, "is_new_question": false }, @@ -23820,8 +24142,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": 30434, - "total_submitted": 40140, + "total_acs": 30634, + "total_submitted": 40386, "frontend_question_id": 1442, "is_new_question": false }, @@ -23843,8 +24165,8 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 70254, - "total_submitted": 98144, + "total_acs": 70505, + "total_submitted": 98479, "frontend_question_id": 1441, "is_new_question": false }, @@ -23866,8 +24188,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 21607, - "total_submitted": 25734, + "total_acs": 21766, + "total_submitted": 25951, "frontend_question_id": 1421, "is_new_question": false }, @@ -23889,8 +24211,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": 27988, - "total_submitted": 45546, + "total_acs": 28052, + "total_submitted": 45688, "frontend_question_id": 1439, "is_new_question": false }, @@ -23912,8 +24234,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": 104754, - "total_submitted": 217609, + "total_acs": 105222, + "total_submitted": 218494, "frontend_question_id": 1438, "is_new_question": false }, @@ -23935,8 +24257,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": 64536, - "total_submitted": 109361, + "total_acs": 64757, + "total_submitted": 109820, "frontend_question_id": 1437, "is_new_question": false }, @@ -23958,8 +24280,8 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 117625, - "total_submitted": 151584, + "total_acs": 118296, + "total_submitted": 152494, "frontend_question_id": 1436, "is_new_question": false }, @@ -23981,8 +24303,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": 19833, - "total_submitted": 31662, + "total_acs": 19951, + "total_submitted": 31880, "frontend_question_id": 1412, "is_new_question": false }, @@ -24004,8 +24326,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": 14215, - "total_submitted": 29907, + "total_acs": 14243, + "total_submitted": 29967, "frontend_question_id": 1449, "is_new_question": false }, @@ -24027,8 +24349,8 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 297485, - "total_submitted": 399436, + "total_acs": 299224, + "total_submitted": 401862, "frontend_question_id": 1448, "is_new_question": false }, @@ -24050,8 +24372,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 25082, - "total_submitted": 38542, + "total_acs": 25245, + "total_submitted": 38806, "frontend_question_id": 1447, "is_new_question": false }, @@ -24073,8 +24395,8 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 134302, - "total_submitted": 218454, + "total_acs": 134797, + "total_submitted": 219401, "frontend_question_id": 1446, "is_new_question": false }, @@ -24096,8 +24418,8 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 68506, - "total_submitted": 105524, + "total_acs": 69995, + "total_submitted": 108538, "frontend_question_id": 1407, "is_new_question": false }, @@ -24119,8 +24441,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 46504, - "total_submitted": 92202, + "total_acs": 46623, + "total_submitted": 92411, "frontend_question_id": 1424, "is_new_question": false }, @@ -24142,8 +24464,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": 212383, - "total_submitted": 406505, + "total_acs": 213171, + "total_submitted": 408104, "frontend_question_id": 1423, "is_new_question": false }, @@ -24165,8 +24487,8 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 44111, - "total_submitted": 76151, + "total_acs": 44312, + "total_submitted": 76477, "frontend_question_id": 1422, "is_new_question": false }, @@ -24188,8 +24510,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": 37884, - "total_submitted": 49109, + "total_acs": 38210, + "total_submitted": 49567, "frontend_question_id": 1398, "is_new_question": false }, @@ -24211,8 +24533,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": 11045, - "total_submitted": 17424, + "total_acs": 11098, + "total_submitted": 17509, "frontend_question_id": 1420, "is_new_question": false }, @@ -24234,8 +24556,8 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 33239, - "total_submitted": 66315, + "total_acs": 33527, + "total_submitted": 66853, "frontend_question_id": 1419, "is_new_question": false }, @@ -24257,8 +24579,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": 22227, - "total_submitted": 30062, + "total_acs": 22335, + "total_submitted": 30200, "frontend_question_id": 1418, "is_new_question": false }, @@ -24280,8 +24602,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 48060, - "total_submitted": 86934, + "total_acs": 48235, + "total_submitted": 87319, "frontend_question_id": 1417, "is_new_question": false }, @@ -24303,8 +24625,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": 11105, - "total_submitted": 25833, + "total_acs": 11154, + "total_submitted": 25936, "frontend_question_id": 1434, "is_new_question": false }, @@ -24326,8 +24648,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": 34257, - "total_submitted": 49651, + "total_acs": 34371, + "total_submitted": 49795, "frontend_question_id": 1433, "is_new_question": false }, @@ -24349,8 +24671,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": 13930, - "total_submitted": 32625, + "total_acs": 14032, + "total_submitted": 32846, "frontend_question_id": 1432, "is_new_question": false }, @@ -24372,8 +24694,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": 372991, - "total_submitted": 426784, + "total_acs": 375278, + "total_submitted": 429462, "frontend_question_id": 1431, "is_new_question": false }, @@ -24395,8 +24717,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": 28029, - "total_submitted": 44938, + "total_acs": 28092, + "total_submitted": 45021, "frontend_question_id": 1411, "is_new_question": false }, @@ -24418,8 +24740,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 20700, - "total_submitted": 39928, + "total_acs": 20744, + "total_submitted": 40010, "frontend_question_id": 1410, "is_new_question": false }, @@ -24441,8 +24763,8 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 41815, - "total_submitted": 50196, + "total_acs": 41929, + "total_submitted": 50315, "frontend_question_id": 1409, "is_new_question": false }, @@ -24464,8 +24786,8 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 65502, - "total_submitted": 102538, + "total_acs": 65913, + "total_submitted": 103192, "frontend_question_id": 1408, "is_new_question": false }, @@ -24487,8 +24809,8 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 67069, - "total_submitted": 74782, + "total_acs": 68716, + "total_submitted": 76820, "frontend_question_id": 1393, "is_new_question": false }, @@ -24510,8 +24832,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 41432, - "total_submitted": 69602, + "total_acs": 41553, + "total_submitted": 69795, "frontend_question_id": 1406, "is_new_question": false }, @@ -24533,8 +24855,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": 32510, - "total_submitted": 61971, + "total_acs": 32712, + "total_submitted": 62286, "frontend_question_id": 1404, "is_new_question": false }, @@ -24556,8 +24878,8 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 58419, - "total_submitted": 80911, + "total_acs": 58652, + "total_submitted": 81243, "frontend_question_id": 1403, "is_new_question": false }, @@ -24579,8 +24901,8 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 13512, - "total_submitted": 20230, + "total_acs": 13600, + "total_submitted": 20366, "frontend_question_id": 1384, "is_new_question": false }, @@ -24602,8 +24924,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 14292, - "total_submitted": 36848, + "total_acs": 14346, + "total_submitted": 36973, "frontend_question_id": 1416, "is_new_question": false }, @@ -24625,8 +24947,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": 30145, - "total_submitted": 41762, + "total_acs": 30309, + "total_submitted": 41949, "frontend_question_id": 1415, "is_new_question": false }, @@ -24648,8 +24970,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": 35536, - "total_submitted": 54205, + "total_acs": 35653, + "total_submitted": 54407, "frontend_question_id": 1414, "is_new_question": false }, @@ -24671,8 +24993,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": 89626, - "total_submitted": 132284, + "total_acs": 90650, + "total_submitted": 133963, "frontend_question_id": 1413, "is_new_question": false }, @@ -24694,8 +25016,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 5039, - "total_submitted": 11901, + "total_acs": 5060, + "total_submitted": 11965, "frontend_question_id": 1397, "is_new_question": false }, @@ -24717,8 +25039,8 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 160188, - "total_submitted": 217629, + "total_acs": 160712, + "total_submitted": 218322, "frontend_question_id": 1396, "is_new_question": false }, @@ -24740,8 +25062,8 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 97915, - "total_submitted": 144548, + "total_acs": 98133, + "total_submitted": 145015, "frontend_question_id": 1395, "is_new_question": false }, @@ -24763,8 +25085,8 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 85479, - "total_submitted": 133896, + "total_acs": 86181, + "total_submitted": 134815, "frontend_question_id": 1394, "is_new_question": false }, @@ -24786,8 +25108,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": 34165, - "total_submitted": 37399, + "total_acs": 34380, + "total_submitted": 37655, "frontend_question_id": 1378, "is_new_question": false }, @@ -24809,8 +25131,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 27467, - "total_submitted": 61245, + "total_acs": 27654, + "total_submitted": 61618, "frontend_question_id": 1392, "is_new_question": false }, @@ -24832,8 +25154,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": 23627, - "total_submitted": 50034, + "total_acs": 23725, + "total_submitted": 50216, "frontend_question_id": 1391, "is_new_question": false }, @@ -24855,8 +25177,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": 177188, - "total_submitted": 206368, + "total_acs": 178592, + "total_submitted": 208016, "frontend_question_id": 1389, "is_new_question": false }, @@ -24878,8 +25200,8 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 17320, - "total_submitted": 24879, + "total_acs": 17454, + "total_submitted": 25079, "frontend_question_id": 1369, "is_new_question": false }, @@ -24901,8 +25223,8 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 51139, - "total_submitted": 70994, + "total_acs": 51612, + "total_submitted": 71616, "frontend_question_id": 1402, "is_new_question": false }, @@ -24924,8 +25246,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 43383, - "total_submitted": 68801, + "total_acs": 43527, + "total_submitted": 69063, "frontend_question_id": 1400, "is_new_question": false }, @@ -24947,8 +25269,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 11251, - "total_submitted": 25466, + "total_acs": 11291, + "total_submitted": 25564, "frontend_question_id": 1401, "is_new_question": false }, @@ -24970,8 +25292,8 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 36057, - "total_submitted": 53681, + "total_acs": 36227, + "total_submitted": 53973, "frontend_question_id": 1399, "is_new_question": false }, @@ -24993,8 +25315,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 83789, - "total_submitted": 172131, + "total_acs": 84177, + "total_submitted": 173193, "frontend_question_id": 1383, "is_new_question": false }, @@ -25016,8 +25338,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": 181075, - "total_submitted": 208448, + "total_acs": 182089, + "total_submitted": 209696, "frontend_question_id": 1379, "is_new_question": false }, @@ -25039,8 +25361,8 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 86939, - "total_submitted": 112533, + "total_acs": 87414, + "total_submitted": 113177, "frontend_question_id": 1381, "is_new_question": false }, @@ -25062,8 +25384,8 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 78154, - "total_submitted": 110829, + "total_acs": 78607, + "total_submitted": 111459, "frontend_question_id": 1380, "is_new_question": false }, @@ -25085,8 +25407,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": 15880, - "total_submitted": 20151, + "total_acs": 15976, + "total_submitted": 20316, "frontend_question_id": 1364, "is_new_question": false }, @@ -25108,8 +25430,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 24238, - "total_submitted": 32601, + "total_acs": 24362, + "total_submitted": 32812, "frontend_question_id": 1355, "is_new_question": false }, @@ -25131,8 +25453,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 23454, - "total_submitted": 65099, + "total_acs": 23531, + "total_submitted": 65379, "frontend_question_id": 1377, "is_new_question": false }, @@ -25154,8 +25476,8 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 123822, - "total_submitted": 212054, + "total_acs": 124464, + "total_submitted": 213208, "frontend_question_id": 1376, "is_new_question": false }, @@ -25177,8 +25499,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": 44879, - "total_submitted": 68203, + "total_acs": 45014, + "total_submitted": 68432, "frontend_question_id": 1375, "is_new_question": false }, @@ -25200,8 +25522,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": 75213, - "total_submitted": 96941, + "total_acs": 75555, + "total_submitted": 97363, "frontend_question_id": 1374, "is_new_question": false }, @@ -25223,8 +25545,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 12775, - "total_submitted": 25499, + "total_acs": 12905, + "total_submitted": 25746, "frontend_question_id": 1388, "is_new_question": false }, @@ -25246,8 +25568,8 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 72669, - "total_submitted": 103630, + "total_acs": 73194, + "total_submitted": 104379, "frontend_question_id": 1387, "is_new_question": false }, @@ -25269,8 +25591,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 36838, - "total_submitted": 90065, + "total_acs": 37008, + "total_submitted": 90565, "frontend_question_id": 1386, "is_new_question": false }, @@ -25292,8 +25614,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": 73195, - "total_submitted": 111125, + "total_acs": 73989, + "total_submitted": 112148, "frontend_question_id": 1385, "is_new_question": false }, @@ -25315,8 +25637,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": 38018, - "total_submitted": 61896, + "total_acs": 38183, + "total_submitted": 62159, "frontend_question_id": 1368, "is_new_question": false }, @@ -25338,8 +25660,8 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 61573, - "total_submitted": 141275, + "total_acs": 61940, + "total_submitted": 142061, "frontend_question_id": 1367, "is_new_question": false }, @@ -25361,8 +25683,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 49473, - "total_submitted": 85175, + "total_acs": 49768, + "total_submitted": 85705, "frontend_question_id": 1366, "is_new_question": false }, @@ -25384,8 +25706,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": 394127, - "total_submitted": 454626, + "total_acs": 397241, + "total_submitted": 458194, "frontend_question_id": 1365, "is_new_question": false }, @@ -25407,8 +25729,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 45802, - "total_submitted": 50663, + "total_acs": 46003, + "total_submitted": 50909, "frontend_question_id": 1350, "is_new_question": false }, @@ -25430,8 +25752,8 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 24795, - "total_submitted": 42846, + "total_acs": 25013, + "total_submitted": 43319, "frontend_question_id": 1341, "is_new_question": false }, @@ -25453,8 +25775,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 63646, - "total_submitted": 175282, + "total_acs": 63689, + "total_submitted": 175397, "frontend_question_id": 1354, "is_new_question": false }, @@ -25476,8 +25798,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": 65718, - "total_submitted": 201668, + "total_acs": 66028, + "total_submitted": 202642, "frontend_question_id": 1353, "is_new_question": false }, @@ -25499,8 +25821,8 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 64907, - "total_submitted": 129894, + "total_acs": 65369, + "total_submitted": 130787, "frontend_question_id": 1352, "is_new_question": false }, @@ -25522,8 +25844,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": 223053, - "total_submitted": 296084, + "total_acs": 224767, + "total_submitted": 298284, "frontend_question_id": 1351, "is_new_question": false }, @@ -25545,8 +25867,8 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 47180, - "total_submitted": 119924, + "total_acs": 47492, + "total_submitted": 120618, "frontend_question_id": 1373, "is_new_question": false }, @@ -25568,8 +25890,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": 44344, - "total_submitted": 73913, + "total_acs": 44589, + "total_submitted": 74259, "frontend_question_id": 1372, "is_new_question": false }, @@ -25591,8 +25913,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": 21590, - "total_submitted": 34155, + "total_acs": 21652, + "total_submitted": 34254, "frontend_question_id": 1371, "is_new_question": false }, @@ -25614,8 +25936,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 62541, - "total_submitted": 80895, + "total_acs": 62817, + "total_submitted": 81271, "frontend_question_id": 1370, "is_new_question": false }, @@ -25637,8 +25959,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 12270, - "total_submitted": 25249, + "total_acs": 12334, + "total_submitted": 25360, "frontend_question_id": 1349, "is_new_question": false }, @@ -25660,8 +25982,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 29305, - "total_submitted": 67176, + "total_acs": 29351, + "total_submitted": 67256, "frontend_question_id": 1348, "is_new_question": false }, @@ -25683,8 +26005,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": 120910, - "total_submitted": 155770, + "total_acs": 121618, + "total_submitted": 156633, "frontend_question_id": 1347, "is_new_question": false }, @@ -25706,8 +26028,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": 260193, - "total_submitted": 715347, + "total_acs": 262257, + "total_submitted": 720305, "frontend_question_id": 1346, "is_new_question": false }, @@ -25729,8 +26051,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 10376, - "total_submitted": 20444, + "total_acs": 10432, + "total_submitted": 20599, "frontend_question_id": 1336, "is_new_question": false }, @@ -25752,8 +26074,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 23657, - "total_submitted": 37843, + "total_acs": 23791, + "total_submitted": 38045, "frontend_question_id": 1340, "is_new_question": false }, @@ -25775,8 +26097,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 110780, - "total_submitted": 231199, + "total_acs": 111179, + "total_submitted": 232128, "frontend_question_id": 1339, "is_new_question": false }, @@ -25798,8 +26120,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 165503, - "total_submitted": 237792, + "total_acs": 166049, + "total_submitted": 238673, "frontend_question_id": 1338, "is_new_question": false }, @@ -25821,8 +26143,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": 226616, - "total_submitted": 312873, + "total_acs": 228373, + "total_submitted": 315648, "frontend_question_id": 1337, "is_new_question": false }, @@ -25844,8 +26166,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": 33706, - "total_submitted": 43877, + "total_acs": 33902, + "total_submitted": 44212, "frontend_question_id": 1327, "is_new_question": false }, @@ -25867,8 +26189,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": 57254, - "total_submitted": 91083, + "total_acs": 57362, + "total_submitted": 91315, "frontend_question_id": 1359, "is_new_question": false }, @@ -25890,8 +26212,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": 50741, - "total_submitted": 80181, + "total_acs": 51366, + "total_submitted": 81131, "frontend_question_id": 1358, "is_new_question": false }, @@ -25913,8 +26235,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 17083, - "total_submitted": 24408, + "total_acs": 17155, + "total_submitted": 24520, "frontend_question_id": 1357, "is_new_question": false }, @@ -25936,8 +26258,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": 98710, - "total_submitted": 136368, + "total_acs": 100000, + "total_submitted": 137951, "frontend_question_id": 1356, "is_new_question": false }, @@ -25959,8 +26281,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 117075, - "total_submitted": 199739, + "total_acs": 117406, + "total_submitted": 200279, "frontend_question_id": 1335, "is_new_question": false }, @@ -25982,8 +26304,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": 55824, - "total_submitted": 103973, + "total_acs": 56603, + "total_submitted": 105143, "frontend_question_id": 1334, "is_new_question": false }, @@ -26005,8 +26327,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": 25537, - "total_submitted": 42692, + "total_acs": 25643, + "total_submitted": 42844, "frontend_question_id": 1333, "is_new_question": false }, @@ -26028,8 +26350,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 117556, - "total_submitted": 154317, + "total_acs": 117809, + "total_submitted": 154655, "frontend_question_id": 1332, "is_new_question": false }, @@ -26051,8 +26373,8 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 34387, - "total_submitted": 56663, + "total_acs": 34602, + "total_submitted": 57075, "frontend_question_id": 1322, "is_new_question": false }, @@ -26074,8 +26396,8 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 28317, - "total_submitted": 39638, + "total_acs": 28552, + "total_submitted": 40025, "frontend_question_id": 1321, "is_new_question": false }, @@ -26097,8 +26419,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": 66059, - "total_submitted": 138494, + "total_acs": 66250, + "total_submitted": 138933, "frontend_question_id": 1326, "is_new_question": false }, @@ -26120,8 +26442,8 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 82714, - "total_submitted": 110681, + "total_acs": 83188, + "total_submitted": 111345, "frontend_question_id": 1325, "is_new_question": false }, @@ -26143,8 +26465,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 31805, - "total_submitted": 52240, + "total_acs": 31985, + "total_submitted": 52465, "frontend_question_id": 1324, "is_new_question": false }, @@ -26166,8 +26488,8 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 203211, - "total_submitted": 247606, + "total_acs": 204356, + "total_submitted": 248979, "frontend_question_id": 1323, "is_new_question": false }, @@ -26189,8 +26511,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 82652, - "total_submitted": 188378, + "total_acs": 82909, + "total_submitted": 189040, "frontend_question_id": 1345, "is_new_question": false }, @@ -26212,8 +26534,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 102568, - "total_submitted": 161955, + "total_acs": 102866, + "total_submitted": 162418, "frontend_question_id": 1344, "is_new_question": false }, @@ -26235,8 +26557,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": 48362, - "total_submitted": 71696, + "total_acs": 49155, + "total_submitted": 72840, "frontend_question_id": 1343, "is_new_question": false }, @@ -26258,8 +26580,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": 452624, - "total_submitted": 530683, + "total_acs": 457682, + "total_submitted": 536694, "frontend_question_id": 1342, "is_new_question": false }, @@ -26281,8 +26603,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": 27076, - "total_submitted": 45469, + "total_acs": 27155, + "total_submitted": 45588, "frontend_question_id": 1320, "is_new_question": false }, @@ -26304,8 +26626,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": 110186, - "total_submitted": 187873, + "total_acs": 111130, + "total_submitted": 189341, "frontend_question_id": 1319, "is_new_question": false }, @@ -26327,8 +26649,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": 28618, - "total_submitted": 43292, + "total_acs": 28750, + "total_submitted": 43451, "frontend_question_id": 1318, "is_new_question": false }, @@ -26350,8 +26672,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": 35326, - "total_submitted": 63167, + "total_acs": 35547, + "total_submitted": 63607, "frontend_question_id": 1317, "is_new_question": false }, @@ -26373,8 +26695,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 33006, - "total_submitted": 37617, + "total_acs": 33356, + "total_submitted": 38021, "frontend_question_id": 1308, "is_new_question": false }, @@ -26396,8 +26718,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 55950, - "total_submitted": 61741, + "total_acs": 56503, + "total_submitted": 62380, "frontend_question_id": 1303, "is_new_question": false }, @@ -26419,8 +26741,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": 70486, - "total_submitted": 106934, + "total_acs": 71098, + "total_submitted": 107735, "frontend_question_id": 1312, "is_new_question": false }, @@ -26442,8 +26764,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 17491, - "total_submitted": 38106, + "total_acs": 17584, + "total_submitted": 38281, "frontend_question_id": 1311, "is_new_question": false }, @@ -26465,8 +26787,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 44583, - "total_submitted": 61758, + "total_acs": 44816, + "total_submitted": 62049, "frontend_question_id": 1310, "is_new_question": false }, @@ -26488,8 +26810,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": 99553, - "total_submitted": 125154, + "total_acs": 100454, + "total_submitted": 126208, "frontend_question_id": 1309, "is_new_question": false }, @@ -26511,8 +26833,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 9603, - "total_submitted": 24343, + "total_acs": 9639, + "total_submitted": 24438, "frontend_question_id": 2227, "is_new_question": false }, @@ -26534,8 +26856,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": 42166, - "total_submitted": 91073, + "total_acs": 42201, + "total_submitted": 91134, "frontend_question_id": 1430, "is_new_question": false }, @@ -26557,8 +26879,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": 20905, - "total_submitted": 41340, + "total_acs": 21224, + "total_submitted": 41908, "frontend_question_id": 2192, "is_new_question": false }, @@ -26580,8 +26902,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": 31299, - "total_submitted": 54798, + "total_acs": 31843, + "total_submitted": 55622, "frontend_question_id": 2269, "is_new_question": false }, @@ -26603,8 +26925,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 10185, - "total_submitted": 29577, + "total_acs": 10259, + "total_submitted": 29821, "frontend_question_id": 1307, "is_new_question": false }, @@ -26626,8 +26948,8 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 177404, - "total_submitted": 280511, + "total_acs": 178176, + "total_submitted": 281629, "frontend_question_id": 1306, "is_new_question": false }, @@ -26649,8 +26971,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": 182205, - "total_submitted": 228289, + "total_acs": 182939, + "total_submitted": 229181, "frontend_question_id": 1305, "is_new_question": false }, @@ -26672,8 +26994,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": 174501, - "total_submitted": 226239, + "total_acs": 175394, + "total_submitted": 227461, "frontend_question_id": 1304, "is_new_question": false }, @@ -26695,8 +27017,8 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 32335, - "total_submitted": 47794, + "total_acs": 32653, + "total_submitted": 48258, "frontend_question_id": 1294, "is_new_question": false }, @@ -26718,8 +27040,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": 12280, - "total_submitted": 20268, + "total_acs": 12364, + "total_submitted": 20426, "frontend_question_id": 1298, "is_new_question": false }, @@ -26741,8 +27063,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": 39173, - "total_submitted": 75357, + "total_acs": 39345, + "total_submitted": 75711, "frontend_question_id": 1297, "is_new_question": false }, @@ -26764,8 +27086,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": 69470, - "total_submitted": 122686, + "total_acs": 69690, + "total_submitted": 123149, "frontend_question_id": 1296, "is_new_question": false }, @@ -26787,8 +27109,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": 521126, - "total_submitted": 676727, + "total_acs": 523794, + "total_submitted": 680128, "frontend_question_id": 1295, "is_new_question": false }, @@ -26810,8 +27132,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": 28894, - "total_submitted": 33137, + "total_acs": 29195, + "total_submitted": 33587, "frontend_question_id": 1285, "is_new_question": false }, @@ -26833,8 +27155,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": 881, - "total_submitted": 1304, + "total_acs": 885, + "total_submitted": 1312, "frontend_question_id": 2263, "is_new_question": false }, @@ -26856,8 +27178,8 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 20828, - "total_submitted": 33405, + "total_acs": 21027, + "total_submitted": 33755, "frontend_question_id": 2305, "is_new_question": false }, @@ -26879,8 +27201,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 3544, - "total_submitted": 5793, + "total_acs": 3615, + "total_submitted": 5895, "frontend_question_id": 2229, "is_new_question": false }, @@ -26902,8 +27224,8 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 32656, - "total_submitted": 44434, + "total_acs": 32961, + "total_submitted": 44925, "frontend_question_id": 1280, "is_new_question": false }, @@ -26925,8 +27247,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": 171243, - "total_submitted": 376341, + "total_acs": 171905, + "total_submitted": 378133, "frontend_question_id": 1293, "is_new_question": false }, @@ -26948,8 +27270,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": 28795, - "total_submitted": 54121, + "total_acs": 28927, + "total_submitted": 54315, "frontend_question_id": 1292, "is_new_question": false }, @@ -26971,8 +27293,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": 355716, - "total_submitted": 431631, + "total_acs": 357982, + "total_submitted": 434527, "frontend_question_id": 1290, "is_new_question": false }, @@ -26994,8 +27316,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 10440, - "total_submitted": 14041, + "total_acs": 10485, + "total_submitted": 14104, "frontend_question_id": 1279, "is_new_question": false }, @@ -27017,8 +27339,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": 28480, - "total_submitted": 39554, + "total_acs": 28539, + "total_submitted": 39669, "frontend_question_id": 1284, "is_new_question": false }, @@ -27040,8 +27362,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": 100407, - "total_submitted": 180549, + "total_acs": 101048, + "total_submitted": 181564, "frontend_question_id": 1283, "is_new_question": false }, @@ -27063,8 +27385,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": 95486, - "total_submitted": 111473, + "total_acs": 96042, + "total_submitted": 112107, "frontend_question_id": 1282, "is_new_question": false }, @@ -27086,8 +27408,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": 337410, - "total_submitted": 389091, + "total_acs": 341862, + "total_submitted": 394186, "frontend_question_id": 1281, "is_new_question": false }, @@ -27109,8 +27431,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": 45241, - "total_submitted": 51629, + "total_acs": 45450, + "total_submitted": 51929, "frontend_question_id": 1270, "is_new_question": false }, @@ -27132,8 +27454,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 47447, - "total_submitted": 50349, + "total_acs": 47647, + "total_submitted": 50556, "frontend_question_id": 1265, "is_new_question": false }, @@ -27155,8 +27477,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 22189, - "total_submitted": 36520, + "total_acs": 22329, + "total_submitted": 36741, "frontend_question_id": 1278, "is_new_question": false }, @@ -27178,8 +27500,8 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 187466, - "total_submitted": 251845, + "total_acs": 188034, + "total_submitted": 252566, "frontend_question_id": 1277, "is_new_question": false }, @@ -27201,8 +27523,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": 20695, - "total_submitted": 40842, + "total_acs": 20764, + "total_submitted": 40997, "frontend_question_id": 1276, "is_new_question": false }, @@ -27224,8 +27546,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": 96913, - "total_submitted": 178503, + "total_acs": 97304, + "total_submitted": 179386, "frontend_question_id": 1275, "is_new_question": false }, @@ -27247,8 +27569,8 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 31401, - "total_submitted": 46552, + "total_acs": 31709, + "total_submitted": 47061, "frontend_question_id": 1264, "is_new_question": false }, @@ -27270,8 +27592,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": 31109, - "total_submitted": 71324, + "total_acs": 31205, + "total_submitted": 71542, "frontend_question_id": 1269, "is_new_question": false }, @@ -27293,8 +27615,8 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 239693, - "total_submitted": 360999, + "total_acs": 240213, + "total_submitted": 361877, "frontend_question_id": 1268, "is_new_question": false }, @@ -27316,8 +27638,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 49701, - "total_submitted": 83775, + "total_acs": 49887, + "total_submitted": 84065, "frontend_question_id": 1267, "is_new_question": false }, @@ -27339,8 +27661,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 130109, - "total_submitted": 164440, + "total_acs": 130563, + "total_submitted": 165016, "frontend_question_id": 1266, "is_new_question": false }, @@ -27362,8 +27684,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 19785, - "total_submitted": 30079, + "total_acs": 19963, + "total_submitted": 30303, "frontend_question_id": 2304, "is_new_question": false }, @@ -27385,8 +27707,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": 13020, - "total_submitted": 27150, + "total_acs": 13152, + "total_submitted": 27391, "frontend_question_id": 2218, "is_new_question": false }, @@ -27408,8 +27730,8 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 45063, - "total_submitted": 64399, + "total_acs": 45799, + "total_submitted": 65291, "frontend_question_id": 2215, "is_new_question": false }, @@ -27431,8 +27753,8 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 95835, - "total_submitted": 160617, + "total_acs": 96310, + "total_submitted": 161440, "frontend_question_id": 1426, "is_new_question": false }, @@ -27454,8 +27776,8 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 48484, - "total_submitted": 58779, + "total_acs": 48988, + "total_submitted": 59429, "frontend_question_id": 1251, "is_new_question": false }, @@ -27477,8 +27799,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": 24061, - "total_submitted": 49038, + "total_acs": 24150, + "total_submitted": 49255, "frontend_question_id": 1263, "is_new_question": false }, @@ -27500,8 +27822,8 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 44154, - "total_submitted": 86828, + "total_acs": 44326, + "total_submitted": 87167, "frontend_question_id": 1262, "is_new_question": false }, @@ -27523,8 +27845,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": 52841, - "total_submitted": 69374, + "total_acs": 53110, + "total_submitted": 69697, "frontend_question_id": 1261, "is_new_question": false }, @@ -27546,8 +27868,8 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 92618, - "total_submitted": 136393, + "total_acs": 92871, + "total_submitted": 136778, "frontend_question_id": 1260, "is_new_question": false }, @@ -27569,8 +27891,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": 1352, - "total_submitted": 2165, + "total_acs": 1373, + "total_submitted": 2197, "frontend_question_id": 2189, "is_new_question": false }, @@ -27592,8 +27914,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": 5936, - "total_submitted": 9999, + "total_acs": 5973, + "total_submitted": 10048, "frontend_question_id": 1618, "is_new_question": false }, @@ -27615,8 +27937,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 718, - "total_submitted": 1280, + "total_acs": 721, + "total_submitted": 1289, "frontend_question_id": 2198, "is_new_question": false }, @@ -27638,8 +27960,8 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 26979, - "total_submitted": 42237, + "total_acs": 27277, + "total_submitted": 42620, "frontend_question_id": 2303, "is_new_question": false }, @@ -27661,8 +27983,8 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 28091, - "total_submitted": 38624, + "total_acs": 28255, + "total_submitted": 38872, "frontend_question_id": 1255, "is_new_question": false }, @@ -27684,8 +28006,8 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 121887, - "total_submitted": 190034, + "total_acs": 122966, + "total_submitted": 191742, "frontend_question_id": 1254, "is_new_question": false }, @@ -27707,8 +28029,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 21830, - "total_submitted": 49611, + "total_acs": 21896, + "total_submitted": 49714, "frontend_question_id": 1253, "is_new_question": false }, @@ -27730,8 +28052,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": 90503, - "total_submitted": 115183, + "total_acs": 90828, + "total_submitted": 115575, "frontend_question_id": 1252, "is_new_question": false }, @@ -27753,8 +28075,8 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 29588, - "total_submitted": 44066, + "total_acs": 29748, + "total_submitted": 44299, "frontend_question_id": 1241, "is_new_question": false }, @@ -27776,8 +28098,8 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 7396, - "total_submitted": 15257, + "total_acs": 7446, + "total_submitted": 15339, "frontend_question_id": 2312, "is_new_question": false }, @@ -27799,8 +28121,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 13783, - "total_submitted": 40354, + "total_acs": 13838, + "total_submitted": 40551, "frontend_question_id": 2217, "is_new_question": false }, @@ -27822,8 +28144,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": 163005, - "total_submitted": 305348, + "total_acs": 163234, + "total_submitted": 305703, "frontend_question_id": 1428, "is_new_question": false }, @@ -27845,8 +28167,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": 16554, - "total_submitted": 28171, + "total_acs": 16655, + "total_submitted": 28336, "frontend_question_id": 1250, "is_new_question": false }, @@ -27868,8 +28190,8 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 484147, - "total_submitted": 736320, + "total_acs": 485320, + "total_submitted": 737893, "frontend_question_id": 1249, "is_new_question": false }, @@ -27891,8 +28213,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 72009, - "total_submitted": 119952, + "total_acs": 72887, + "total_submitted": 121194, "frontend_question_id": 1248, "is_new_question": false }, @@ -27914,8 +28236,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 32117, - "total_submitted": 50264, + "total_acs": 32234, + "total_submitted": 50432, "frontend_question_id": 1247, "is_new_question": false }, @@ -27937,8 +28259,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 39784, - "total_submitted": 81245, + "total_acs": 39904, + "total_submitted": 81513, "frontend_question_id": 1242, "is_new_question": false }, @@ -27960,8 +28282,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 16312, - "total_submitted": 30016, + "total_acs": 16430, + "total_submitted": 30243, "frontend_question_id": 1691, "is_new_question": false }, @@ -27983,8 +28305,8 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 76904, - "total_submitted": 145517, + "total_acs": 77037, + "total_submitted": 145712, "frontend_question_id": 1429, "is_new_question": false }, @@ -28006,8 +28328,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 22410, - "total_submitted": 36865, + "total_acs": 22513, + "total_submitted": 37054, "frontend_question_id": 1726, "is_new_question": false }, @@ -28029,8 +28351,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": 35406, - "total_submitted": 51630, + "total_acs": 35773, + "total_submitted": 52114, "frontend_question_id": 2309, "is_new_question": false }, @@ -28052,8 +28374,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 31190, - "total_submitted": 47721, + "total_acs": 31458, + "total_submitted": 48098, "frontend_question_id": 1227, "is_new_question": false }, @@ -28075,8 +28397,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": 20935, - "total_submitted": 38785, + "total_acs": 20977, + "total_submitted": 38846, "frontend_question_id": 1240, "is_new_question": false }, @@ -28098,8 +28420,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": 167515, - "total_submitted": 320872, + "total_acs": 167961, + "total_submitted": 321822, "frontend_question_id": 1239, "is_new_question": false }, @@ -28121,8 +28443,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 14084, - "total_submitted": 20414, + "total_acs": 14148, + "total_submitted": 20511, "frontend_question_id": 1238, "is_new_question": false }, @@ -28144,8 +28466,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": 55886, - "total_submitted": 80666, + "total_acs": 56112, + "total_submitted": 81003, "frontend_question_id": 1237, "is_new_question": false }, @@ -28167,8 +28489,8 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 16961, - "total_submitted": 27022, + "total_acs": 17066, + "total_submitted": 27224, "frontend_question_id": 1225, "is_new_question": false }, @@ -28190,8 +28512,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": 15676, - "total_submitted": 30361, + "total_acs": 15834, + "total_submitted": 30689, "frontend_question_id": 2193, "is_new_question": false }, @@ -28213,8 +28535,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 23944, - "total_submitted": 51345, + "total_acs": 24046, + "total_submitted": 51484, "frontend_question_id": 2216, "is_new_question": false }, @@ -28236,8 +28558,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": 84003, - "total_submitted": 114810, + "total_acs": 84794, + "total_submitted": 116023, "frontend_question_id": 2225, "is_new_question": false }, @@ -28259,8 +28581,8 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 35297, - "total_submitted": 60595, + "total_acs": 35724, + "total_submitted": 61307, "frontend_question_id": 2273, "is_new_question": false }, @@ -28282,8 +28604,8 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 174404, - "total_submitted": 325883, + "total_acs": 174979, + "total_submitted": 327149, "frontend_question_id": 1235, "is_new_question": false }, @@ -28305,8 +28627,8 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 26660, - "total_submitted": 72232, + "total_acs": 26793, + "total_submitted": 72530, "frontend_question_id": 1234, "is_new_question": false }, @@ -28328,8 +28650,8 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 46886, - "total_submitted": 71620, + "total_acs": 46981, + "total_submitted": 71757, "frontend_question_id": 1233, "is_new_question": false }, @@ -28351,8 +28673,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": 140282, - "total_submitted": 344244, + "total_acs": 141223, + "total_submitted": 346927, "frontend_question_id": 1232, "is_new_question": false }, @@ -28374,8 +28696,8 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 14950, - "total_submitted": 26865, + "total_acs": 15006, + "total_submitted": 26940, "frontend_question_id": 2321, "is_new_question": false }, @@ -28397,8 +28719,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": 1867, - "total_submitted": 2662, + "total_acs": 1878, + "total_submitted": 2683, "frontend_question_id": 2204, "is_new_question": false }, @@ -28420,8 +28742,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": 21454, - "total_submitted": 94085, + "total_acs": 21571, + "total_submitted": 94597, "frontend_question_id": 2202, "is_new_question": false }, @@ -28443,8 +28765,8 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 72828, - "total_submitted": 134174, + "total_acs": 72909, + "total_submitted": 134322, "frontend_question_id": 1427, "is_new_question": false }, @@ -28466,8 +28788,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 12572, - "total_submitted": 33886, + "total_acs": 12599, + "total_submitted": 33955, "frontend_question_id": 1224, "is_new_question": false }, @@ -28489,8 +28811,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 24724, - "total_submitted": 50894, + "total_acs": 24787, + "total_submitted": 51027, "frontend_question_id": 1223, "is_new_question": false }, @@ -28512,8 +28834,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 36363, - "total_submitted": 50592, + "total_acs": 36616, + "total_submitted": 50903, "frontend_question_id": 1222, "is_new_question": false }, @@ -28535,8 +28857,8 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 231386, - "total_submitted": 272369, + "total_acs": 232774, + "total_submitted": 273935, "frontend_question_id": 1221, "is_new_question": false }, @@ -28558,8 +28880,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 23397, - "total_submitted": 41479, + "total_acs": 23616, + "total_submitted": 41863, "frontend_question_id": 1226, "is_new_question": false }, @@ -28581,8 +28903,8 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 29576, - "total_submitted": 51445, + "total_acs": 29737, + "total_submitted": 51841, "frontend_question_id": 1212, "is_new_question": false }, @@ -28604,8 +28926,8 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 33986, - "total_submitted": 47421, + "total_acs": 34346, + "total_submitted": 47924, "frontend_question_id": 1211, "is_new_question": false }, @@ -28627,8 +28949,8 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 15943, - "total_submitted": 26322, + "total_acs": 16007, + "total_submitted": 26435, "frontend_question_id": 1206, "is_new_question": false }, @@ -28650,8 +28972,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": 2495, - "total_submitted": 8474, + "total_acs": 2518, + "total_submitted": 8532, "frontend_question_id": 1960, "is_new_question": false }, @@ -28673,8 +28995,8 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 22972, - "total_submitted": 63214, + "total_acs": 23160, + "total_submitted": 63651, "frontend_question_id": 2226, "is_new_question": false }, @@ -28696,8 +29018,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": 20562, - "total_submitted": 80099, + "total_acs": 20648, + "total_submitted": 80355, "frontend_question_id": 2310, "is_new_question": false }, @@ -28719,8 +29041,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 15520, - "total_submitted": 34115, + "total_acs": 15603, + "total_submitted": 34244, "frontend_question_id": 2191, "is_new_question": false }, @@ -28742,8 +29064,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 101165, - "total_submitted": 167453, + "total_acs": 101487, + "total_submitted": 168058, "frontend_question_id": 1220, "is_new_question": false }, @@ -28765,8 +29087,8 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 96201, - "total_submitted": 150622, + "total_acs": 96554, + "total_submitted": 151220, "frontend_question_id": 1219, "is_new_question": false }, @@ -28788,8 +29110,8 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 58205, - "total_submitted": 112204, + "total_acs": 58431, + "total_submitted": 112595, "frontend_question_id": 1218, "is_new_question": false }, @@ -28811,8 +29133,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": 108246, - "total_submitted": 150199, + "total_acs": 108616, + "total_submitted": 150729, "frontend_question_id": 1217, "is_new_question": false }, @@ -28834,8 +29156,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 18892, - "total_submitted": 43293, + "total_acs": 18995, + "total_submitted": 43747, "frontend_question_id": 1205, "is_new_question": false }, @@ -28857,8 +29179,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": 34478, - "total_submitted": 46585, + "total_acs": 34670, + "total_submitted": 46920, "frontend_question_id": 1204, "is_new_question": false }, @@ -28880,8 +29202,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 7195, - "total_submitted": 25621, + "total_acs": 7232, + "total_submitted": 25727, "frontend_question_id": 1862, "is_new_question": false }, @@ -28903,8 +29225,8 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 59659, - "total_submitted": 123158, + "total_acs": 60060, + "total_submitted": 123976, "frontend_question_id": 1514, "is_new_question": false }, @@ -28926,8 +29248,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 116553, - "total_submitted": 162728, + "total_acs": 117812, + "total_submitted": 164549, "frontend_question_id": 1706, "is_new_question": false }, @@ -28949,8 +29271,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": 8101, - "total_submitted": 16445, + "total_acs": 8120, + "total_submitted": 16474, "frontend_question_id": 1210, "is_new_question": false }, @@ -28972,8 +29294,8 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 35050, - "total_submitted": 72906, + "total_acs": 35375, + "total_submitted": 73485, "frontend_question_id": 1208, "is_new_question": false }, @@ -28995,8 +29317,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": 254261, - "total_submitted": 453806, + "total_acs": 255270, + "total_submitted": 455471, "frontend_question_id": 1209, "is_new_question": false }, @@ -29018,8 +29340,8 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 243647, - "total_submitted": 330783, + "total_acs": 245864, + "total_submitted": 333914, "frontend_question_id": 1207, "is_new_question": false }, @@ -29041,8 +29363,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 16200, - "total_submitted": 31575, + "total_acs": 16294, + "total_submitted": 31804, "frontend_question_id": 1194, "is_new_question": false }, @@ -29064,8 +29386,8 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 33003, - "total_submitted": 49491, + "total_acs": 33374, + "total_submitted": 50192, "frontend_question_id": 1193, "is_new_question": false }, @@ -29087,8 +29409,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 35110, - "total_submitted": 48253, + "total_acs": 35312, + "total_submitted": 48493, "frontend_question_id": 1195, "is_new_question": false }, @@ -29110,8 +29432,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": 5080, - "total_submitted": 10251, + "total_acs": 5134, + "total_submitted": 10339, "frontend_question_id": 1916, "is_new_question": false }, @@ -29133,8 +29455,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 16586, - "total_submitted": 30041, + "total_acs": 16621, + "total_submitted": 30094, "frontend_question_id": 2201, "is_new_question": false }, @@ -29156,8 +29478,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 8831, - "total_submitted": 16975, + "total_acs": 8859, + "total_submitted": 17030, "frontend_question_id": 1895, "is_new_question": false }, @@ -29179,8 +29501,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 31153, - "total_submitted": 38975, + "total_acs": 31452, + "total_submitted": 39361, "frontend_question_id": 2079, "is_new_question": false }, @@ -29202,8 +29524,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 14506, - "total_submitted": 28523, + "total_acs": 14589, + "total_submitted": 28681, "frontend_question_id": 1203, "is_new_question": false }, @@ -29225,8 +29547,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 94627, - "total_submitted": 164238, + "total_acs": 95046, + "total_submitted": 164963, "frontend_question_id": 1202, "is_new_question": false }, @@ -29248,8 +29570,8 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 25091, - "total_submitted": 87683, + "total_acs": 25210, + "total_submitted": 88102, "frontend_question_id": 1201, "is_new_question": false }, @@ -29271,8 +29593,8 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 147150, - "total_submitted": 211013, + "total_acs": 148012, + "total_submitted": 212246, "frontend_question_id": 1200, "is_new_question": false }, @@ -29294,8 +29616,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": 30679, - "total_submitted": 44136, + "total_acs": 30954, + "total_submitted": 44594, "frontend_question_id": 1944, "is_new_question": false }, @@ -29317,8 +29639,8 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 62034, - "total_submitted": 107973, + "total_acs": 62464, + "total_submitted": 108750, "frontend_question_id": 1405, "is_new_question": false }, @@ -29340,8 +29662,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 30712, - "total_submitted": 63340, + "total_acs": 30914, + "total_submitted": 63676, "frontend_question_id": 2139, "is_new_question": false }, @@ -29363,8 +29685,8 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 25415, - "total_submitted": 44732, + "total_acs": 25566, + "total_submitted": 44960, "frontend_question_id": 1957, "is_new_question": false }, @@ -29386,8 +29708,8 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 86317, - "total_submitted": 105624, + "total_acs": 86922, + "total_submitted": 106554, "frontend_question_id": 1179, "is_new_question": false }, @@ -29409,8 +29731,8 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 191211, - "total_submitted": 350501, + "total_acs": 191731, + "total_submitted": 351424, "frontend_question_id": 1192, "is_new_question": false }, @@ -29432,8 +29754,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 28841, - "total_submitted": 120644, + "total_acs": 28955, + "total_submitted": 121197, "frontend_question_id": 1191, "is_new_question": false }, @@ -29455,8 +29777,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": 58088, - "total_submitted": 88122, + "total_acs": 58350, + "total_submitted": 88503, "frontend_question_id": 1190, "is_new_question": false }, @@ -29478,8 +29800,8 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 133615, - "total_submitted": 217310, + "total_acs": 134869, + "total_submitted": 219567, "frontend_question_id": 1189, "is_new_question": false }, @@ -29501,8 +29823,8 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 25619, - "total_submitted": 75959, + "total_acs": 25734, + "total_submitted": 76326, "frontend_question_id": 1483, "is_new_question": false }, @@ -29524,8 +29846,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": 13160, - "total_submitted": 24748, + "total_acs": 13208, + "total_submitted": 24849, "frontend_question_id": 1954, "is_new_question": false }, @@ -29547,8 +29869,8 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 15150, - "total_submitted": 39452, + "total_acs": 15269, + "total_submitted": 39716, "frontend_question_id": 2080, "is_new_question": false }, @@ -29570,8 +29892,8 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 61491, - "total_submitted": 96673, + "total_acs": 61880, + "total_submitted": 97335, "frontend_question_id": 1550, "is_new_question": false }, @@ -29593,8 +29915,8 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 27821, - "total_submitted": 43799, + "total_acs": 27942, + "total_submitted": 44057, "frontend_question_id": 1174, "is_new_question": false }, @@ -29616,8 +29938,8 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 50300, - "total_submitted": 60474, + "total_acs": 50735, + "total_submitted": 61033, "frontend_question_id": 1173, "is_new_question": false }, @@ -29639,8 +29961,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 13327, - "total_submitted": 29442, + "total_acs": 13395, + "total_submitted": 29575, "frontend_question_id": 1187, "is_new_question": false }, @@ -29662,8 +29984,8 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 50671, - "total_submitted": 87919, + "total_acs": 50949, + "total_submitted": 88376, "frontend_question_id": 1185, "is_new_question": false }, @@ -29685,8 +30007,8 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 37553, - "total_submitted": 90798, + "total_acs": 37668, + "total_submitted": 91074, "frontend_question_id": 1186, "is_new_question": false }, @@ -29708,8 +30030,8 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 48176, - "total_submitted": 88940, + "total_acs": 48396, + "total_submitted": 89338, "frontend_question_id": 1184, "is_new_question": false }, @@ -29731,8 +30053,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 23086, - "total_submitted": 48675, + "total_acs": 23190, + "total_submitted": 48864, "frontend_question_id": 1425, "is_new_question": false }, @@ -29754,8 +30076,8 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 111829, - "total_submitted": 138620, + "total_acs": 112324, + "total_submitted": 139223, "frontend_question_id": 1382, "is_new_question": false }, @@ -29777,8 +30099,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 24298, - "total_submitted": 58935, + "total_acs": 24437, + "total_submitted": 59285, "frontend_question_id": 1390, "is_new_question": false }, @@ -29800,8 +30122,8 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 50701, - "total_submitted": 80701, + "total_acs": 50959, + "total_submitted": 81046, "frontend_question_id": 1507, "is_new_question": false }, @@ -29823,8 +30145,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": 28165, - "total_submitted": 60630, + "total_acs": 28217, + "total_submitted": 60724, "frontend_question_id": 1178, "is_new_question": false }, @@ -29846,8 +30168,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 22923, - "total_submitted": 60347, + "total_acs": 22997, + "total_submitted": 60522, "frontend_question_id": 1177, "is_new_question": false }, @@ -29869,8 +30191,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 28379, - "total_submitted": 54010, + "total_acs": 28442, + "total_submitted": 54101, "frontend_question_id": 1176, "is_new_question": false }, @@ -29892,8 +30214,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 23911, - "total_submitted": 44289, + "total_acs": 24061, + "total_submitted": 44507, "frontend_question_id": 1175, "is_new_question": false }, @@ -29915,8 +30237,8 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 39370, - "total_submitted": 57777, + "total_acs": 39655, + "total_submitted": 58336, "frontend_question_id": 1164, "is_new_question": false }, @@ -29938,8 +30260,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 16353, - "total_submitted": 49109, + "total_acs": 16432, + "total_submitted": 49380, "frontend_question_id": 1363, "is_new_question": false }, @@ -29961,8 +30283,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 17988, - "total_submitted": 29990, + "total_acs": 18078, + "total_submitted": 30112, "frontend_question_id": 1362, "is_new_question": false }, @@ -29984,8 +30306,8 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 41364, - "total_submitted": 103217, + "total_acs": 41537, + "total_submitted": 103742, "frontend_question_id": 1361, "is_new_question": false }, @@ -30007,8 +30329,8 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 37505, - "total_submitted": 78440, + "total_acs": 37696, + "total_submitted": 78781, "frontend_question_id": 1360, "is_new_question": false }, @@ -30030,8 +30352,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": 70619, - "total_submitted": 114963, + "total_acs": 70794, + "total_submitted": 115196, "frontend_question_id": 1170, "is_new_question": false }, @@ -30053,8 +30375,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 57661, - "total_submitted": 184336, + "total_acs": 58153, + "total_submitted": 185879, "frontend_question_id": 1169, "is_new_question": false }, @@ -30070,14 +30392,14 @@ { "stat": { "question_id": 1271, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "web-crawler", + "question__article__has_video_solution": false, "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 28733, - "total_submitted": 43277, + "total_acs": 28924, + "total_submitted": 43560, "frontend_question_id": 1236, "is_new_question": false }, @@ -30099,8 +30421,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 15292, - "total_submitted": 45812, + "total_acs": 15336, + "total_submitted": 46085, "frontend_question_id": 1172, "is_new_question": false }, @@ -30122,8 +30444,8 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 15525, - "total_submitted": 26620, + "total_acs": 15606, + "total_submitted": 26794, "frontend_question_id": 1159, "is_new_question": false }, @@ -30145,8 +30467,8 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 61963, - "total_submitted": 99184, + "total_acs": 63333, + "total_submitted": 101800, "frontend_question_id": 1158, "is_new_question": false }, @@ -30168,8 +30490,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": 42904, - "total_submitted": 99727, + "total_acs": 43372, + "total_submitted": 100699, "frontend_question_id": 1171, "is_new_question": false }, @@ -30191,8 +30513,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": 39696, - "total_submitted": 55765, + "total_acs": 40004, + "total_submitted": 56177, "frontend_question_id": 1935, "is_new_question": false }, @@ -30214,8 +30536,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": 173463, - "total_submitted": 322975, + "total_acs": 174057, + "total_submitted": 323926, "frontend_question_id": 1155, "is_new_question": false }, @@ -30237,8 +30559,8 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 14287, - "total_submitted": 34178, + "total_acs": 14326, + "total_submitted": 34290, "frontend_question_id": 1157, "is_new_question": false }, @@ -30260,8 +30582,8 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 26145, - "total_submitted": 57681, + "total_acs": 26255, + "total_submitted": 57959, "frontend_question_id": 1156, "is_new_question": false }, @@ -30283,8 +30605,8 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 40712, - "total_submitted": 81386, + "total_acs": 40996, + "total_submitted": 82071, "frontend_question_id": 1154, "is_new_question": false }, @@ -30306,8 +30628,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 30618, - "total_submitted": 64443, + "total_acs": 30822, + "total_submitted": 64933, "frontend_question_id": 1149, "is_new_question": false }, @@ -30329,8 +30651,8 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 92182, - "total_submitted": 120007, + "total_acs": 94413, + "total_submitted": 123016, "frontend_question_id": 1148, "is_new_question": false }, @@ -30352,8 +30674,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 19625, - "total_submitted": 47818, + "total_acs": 19652, + "total_submitted": 47907, "frontend_question_id": 1632, "is_new_question": false }, @@ -30375,8 +30697,8 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 78322, - "total_submitted": 132373, + "total_acs": 78793, + "total_submitted": 133197, "frontend_question_id": 1331, "is_new_question": false }, @@ -30398,8 +30720,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 4517, - "total_submitted": 11197, + "total_acs": 4539, + "total_submitted": 11253, "frontend_question_id": 1330, "is_new_question": false }, @@ -30421,8 +30743,8 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 258982, - "total_submitted": 298412, + "total_acs": 260442, + "total_submitted": 300209, "frontend_question_id": 1302, "is_new_question": false }, @@ -30444,8 +30766,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 141851, - "total_submitted": 169846, + "total_acs": 142310, + "total_submitted": 170423, "frontend_question_id": 1329, "is_new_question": false }, @@ -30467,8 +30789,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 139517, - "total_submitted": 263437, + "total_acs": 140293, + "total_submitted": 265197, "frontend_question_id": 1328, "is_new_question": false }, @@ -30490,8 +30812,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 19347, - "total_submitted": 32514, + "total_acs": 19407, + "total_submitted": 32609, "frontend_question_id": 1147, "is_new_question": false }, @@ -30513,8 +30835,8 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 631896, - "total_submitted": 1078436, + "total_acs": 636753, + "total_submitted": 1087257, "frontend_question_id": 1143, "is_new_question": false }, @@ -30536,8 +30858,8 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 137665, - "total_submitted": 369270, + "total_acs": 138249, + "total_submitted": 371018, "frontend_question_id": 1146, "is_new_question": false }, @@ -30559,8 +30881,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 39722, - "total_submitted": 77034, + "total_acs": 39833, + "total_submitted": 77227, "frontend_question_id": 1145, "is_new_question": false }, @@ -30582,8 +30904,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 16630, - "total_submitted": 35256, + "total_acs": 16698, + "total_submitted": 35386, "frontend_question_id": 1144, "is_new_question": false }, @@ -30605,8 +30927,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": 35941, - "total_submitted": 100084, + "total_acs": 36132, + "total_submitted": 100659, "frontend_question_id": 1142, "is_new_question": false }, @@ -30628,8 +30950,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": 79470, - "total_submitted": 160750, + "total_acs": 81172, + "total_submitted": 164541, "frontend_question_id": 1141, "is_new_question": false }, @@ -30651,8 +30973,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 13337, - "total_submitted": 26907, + "total_acs": 13425, + "total_submitted": 27056, "frontend_question_id": 1316, "is_new_question": false }, @@ -30674,8 +30996,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": 121896, - "total_submitted": 142446, + "total_acs": 122517, + "total_submitted": 143142, "frontend_question_id": 1315, "is_new_question": false }, @@ -30697,8 +31019,8 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 73017, - "total_submitted": 96865, + "total_acs": 73430, + "total_submitted": 97374, "frontend_question_id": 1314, "is_new_question": false }, @@ -30720,8 +31042,8 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 213428, - "total_submitted": 248627, + "total_acs": 214460, + "total_submitted": 249800, "frontend_question_id": 1313, "is_new_question": false }, @@ -30743,8 +31065,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 44792, - "total_submitted": 69126, + "total_acs": 44934, + "total_submitted": 69361, "frontend_question_id": 1140, "is_new_question": false }, @@ -30766,8 +31088,8 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 21209, - "total_submitted": 42302, + "total_acs": 21262, + "total_submitted": 42410, "frontend_question_id": 1139, "is_new_question": false }, @@ -30789,8 +31111,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 44386, - "total_submitted": 84966, + "total_acs": 44502, + "total_submitted": 85200, "frontend_question_id": 1138, "is_new_question": false }, @@ -30812,8 +31134,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 31903, - "total_submitted": 95226, + "total_acs": 32051, + "total_submitted": 95748, "frontend_question_id": 1132, "is_new_question": false }, @@ -30835,8 +31157,8 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 380131, - "total_submitted": 600921, + "total_acs": 383278, + "total_submitted": 606036, "frontend_question_id": 1137, "is_new_question": false }, @@ -30858,8 +31180,8 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 10721, - "total_submitted": 27624, + "total_acs": 10745, + "total_submitted": 27684, "frontend_question_id": 1301, "is_new_question": false }, @@ -30881,8 +31203,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 23612, - "total_submitted": 34089, + "total_acs": 23740, + "total_submitted": 34298, "frontend_question_id": 1274, "is_new_question": false }, @@ -30904,8 +31226,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": 30956, - "total_submitted": 71580, + "total_acs": 31190, + "total_submitted": 71992, "frontend_question_id": 1300, "is_new_question": false }, @@ -30927,8 +31249,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": 265944, - "total_submitted": 358653, + "total_acs": 268430, + "total_submitted": 362466, "frontend_question_id": 1299, "is_new_question": false }, @@ -30950,8 +31272,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 18752, - "total_submitted": 38026, + "total_acs": 18827, + "total_submitted": 38219, "frontend_question_id": 1131, "is_new_question": false }, @@ -30967,14 +31289,14 @@ { "stat": { "question_id": 1229, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "shortest-path-with-alternating-colors", + "question__article__has_video_solution": false, "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 47914, - "total_submitted": 111563, + "total_acs": 48241, + "total_submitted": 112366, "frontend_question_id": 1129, "is_new_question": false }, @@ -30996,8 +31318,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 81788, - "total_submitted": 119505, + "total_acs": 82058, + "total_submitted": 119894, "frontend_question_id": 1130, "is_new_question": false }, @@ -31019,8 +31341,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 55414, - "total_submitted": 117746, + "total_acs": 55681, + "total_submitted": 118226, "frontend_question_id": 1128, "is_new_question": false }, @@ -31042,8 +31364,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 12649, - "total_submitted": 24979, + "total_acs": 12708, + "total_submitted": 25143, "frontend_question_id": 1127, "is_new_question": false }, @@ -31065,8 +31387,8 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 37209, - "total_submitted": 55127, + "total_acs": 37488, + "total_submitted": 55603, "frontend_question_id": 1126, "is_new_question": false }, @@ -31088,8 +31410,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 38595, - "total_submitted": 65681, + "total_acs": 38802, + "total_submitted": 66115, "frontend_question_id": 1289, "is_new_question": false }, @@ -31111,8 +31433,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 13417, - "total_submitted": 29097, + "total_acs": 13491, + "total_submitted": 29218, "frontend_question_id": 1627, "is_new_question": false }, @@ -31134,8 +31456,8 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 104849, - "total_submitted": 183545, + "total_acs": 105117, + "total_submitted": 184076, "frontend_question_id": 1288, "is_new_question": false }, @@ -31157,8 +31479,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": 73344, - "total_submitted": 123240, + "total_acs": 73721, + "total_submitted": 123886, "frontend_question_id": 1287, "is_new_question": false }, @@ -31180,8 +31502,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 18265, - "total_submitted": 38925, + "total_acs": 18342, + "total_submitted": 39116, "frontend_question_id": 1125, "is_new_question": false }, @@ -31203,8 +31525,8 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 25454, - "total_submitted": 73507, + "total_acs": 25565, + "total_submitted": 73792, "frontend_question_id": 1124, "is_new_question": false }, @@ -31226,8 +31548,8 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 87561, - "total_submitted": 123711, + "total_acs": 87845, + "total_submitted": 124059, "frontend_question_id": 1123, "is_new_question": false }, @@ -31249,8 +31571,8 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 147668, - "total_submitted": 215491, + "total_acs": 148521, + "total_submitted": 216676, "frontend_question_id": 1122, "is_new_question": false }, @@ -31272,8 +31594,8 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 37606, - "total_submitted": 62295, + "total_acs": 37753, + "total_submitted": 62556, "frontend_question_id": 1116, "is_new_question": false }, @@ -31295,8 +31617,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 39266, - "total_submitted": 59541, + "total_acs": 39516, + "total_submitted": 59946, "frontend_question_id": 1113, "is_new_question": false }, @@ -31318,8 +31640,8 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 45685, - "total_submitted": 62387, + "total_acs": 46109, + "total_submitted": 63086, "frontend_question_id": 1112, "is_new_question": false }, @@ -31335,14 +31657,14 @@ { "stat": { "question_id": 1213, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "handshakes-that-dont-cross", + "question__article__has_video_solution": false, "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 6199, - "total_submitted": 10971, + "total_acs": 6233, + "total_submitted": 11017, "frontend_question_id": 1259, "is_new_question": false }, @@ -31364,8 +31686,8 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 87981, - "total_submitted": 143513, + "total_acs": 88155, + "total_submitted": 143825, "frontend_question_id": 1291, "is_new_question": false }, @@ -31387,8 +31709,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 66733, - "total_submitted": 90851, + "total_acs": 66854, + "total_submitted": 91024, "frontend_question_id": 1286, "is_new_question": false }, @@ -31410,8 +31732,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": 41638, - "total_submitted": 63851, + "total_acs": 41932, + "total_submitted": 64227, "frontend_question_id": 1619, "is_new_question": false }, @@ -31433,8 +31755,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 41822, - "total_submitted": 57364, + "total_acs": 41952, + "total_submitted": 57538, "frontend_question_id": 1188, "is_new_question": false }, @@ -31456,8 +31778,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": 22323, - "total_submitted": 30526, + "total_acs": 22392, + "total_submitted": 30626, "frontend_question_id": 1111, "is_new_question": false }, @@ -31479,8 +31801,8 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 176703, - "total_submitted": 254846, + "total_acs": 177137, + "total_submitted": 255530, "frontend_question_id": 1110, "is_new_question": false }, @@ -31502,8 +31824,8 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 48707, - "total_submitted": 80455, + "total_acs": 49080, + "total_submitted": 80975, "frontend_question_id": 1109, "is_new_question": false }, @@ -31525,8 +31847,8 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 481180, - "total_submitted": 539112, + "total_acs": 484280, + "total_submitted": 542653, "frontend_question_id": 1108, "is_new_question": false }, @@ -31548,8 +31870,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 29603, - "total_submitted": 64963, + "total_acs": 29759, + "total_submitted": 65367, "frontend_question_id": 1107, "is_new_question": false }, @@ -31571,8 +31893,8 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 122580, - "total_submitted": 179515, + "total_acs": 123145, + "total_submitted": 180228, "frontend_question_id": 1114, "is_new_question": false }, @@ -31594,8 +31916,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 9693, - "total_submitted": 21036, + "total_acs": 9710, + "total_submitted": 21065, "frontend_question_id": 1246, "is_new_question": false }, @@ -31617,8 +31939,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 9184, - "total_submitted": 15059, + "total_acs": 9210, + "total_submitted": 15109, "frontend_question_id": 1273, "is_new_question": false }, @@ -31640,8 +31962,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 26504, - "total_submitted": 41801, + "total_acs": 26577, + "total_submitted": 41893, "frontend_question_id": 1272, "is_new_question": false }, @@ -31663,8 +31985,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 9049, - "total_submitted": 15850, + "total_acs": 9083, + "total_submitted": 15905, "frontend_question_id": 1271, "is_new_question": false }, @@ -31686,8 +32008,8 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 32959, - "total_submitted": 73313, + "total_acs": 33180, + "total_submitted": 73892, "frontend_question_id": 1098, "is_new_question": false }, @@ -31709,8 +32031,8 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 21884, - "total_submitted": 37356, + "total_acs": 21957, + "total_submitted": 37480, "frontend_question_id": 1106, "is_new_question": false }, @@ -31732,8 +32054,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 42541, - "total_submitted": 71778, + "total_acs": 42936, + "total_submitted": 72409, "frontend_question_id": 1105, "is_new_question": false }, @@ -31755,8 +32077,8 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 73472, - "total_submitted": 114695, + "total_acs": 73734, + "total_submitted": 115053, "frontend_question_id": 1103, "is_new_question": false }, @@ -31778,8 +32100,8 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 37987, - "total_submitted": 50646, + "total_acs": 38149, + "total_submitted": 50847, "frontend_question_id": 1104, "is_new_question": false }, @@ -31801,8 +32123,8 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 18669, - "total_submitted": 34430, + "total_acs": 18791, + "total_submitted": 34701, "frontend_question_id": 1097, "is_new_question": false }, @@ -31824,8 +32146,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 42993, - "total_submitted": 75322, + "total_acs": 43230, + "total_submitted": 75660, "frontend_question_id": 1231, "is_new_question": false }, @@ -31847,8 +32169,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 18169, - "total_submitted": 32164, + "total_acs": 18334, + "total_submitted": 32378, "frontend_question_id": 1258, "is_new_question": false }, @@ -31870,8 +32192,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 18826, - "total_submitted": 29349, + "total_acs": 18948, + "total_submitted": 29536, "frontend_question_id": 1257, "is_new_question": false }, @@ -31893,8 +32215,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 6939, - "total_submitted": 9931, + "total_acs": 6953, + "total_submitted": 9948, "frontend_question_id": 1256, "is_new_question": false }, @@ -31916,8 +32238,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 21618, - "total_submitted": 33995, + "total_acs": 21672, + "total_submitted": 34067, "frontend_question_id": 1096, "is_new_question": false }, @@ -31939,8 +32261,8 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 62180, - "total_submitted": 100073, + "total_acs": 62444, + "total_submitted": 100452, "frontend_question_id": 1115, "is_new_question": false }, @@ -31962,8 +32284,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 37573, - "total_submitted": 67402, + "total_acs": 37718, + "total_submitted": 67603, "frontend_question_id": 1117, "is_new_question": false }, @@ -31985,8 +32307,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 55720, - "total_submitted": 156206, + "total_acs": 56293, + "total_submitted": 157820, "frontend_question_id": 1095, "is_new_question": false }, @@ -32008,8 +32330,8 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 182920, - "total_submitted": 320045, + "total_acs": 183725, + "total_submitted": 321737, "frontend_question_id": 1094, "is_new_question": false }, @@ -32031,8 +32353,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 15383, - "total_submitted": 34962, + "total_acs": 15443, + "total_submitted": 35165, "frontend_question_id": 1093, "is_new_question": false }, @@ -32054,8 +32376,8 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 51307, - "total_submitted": 117368, + "total_acs": 51703, + "total_submitted": 118742, "frontend_question_id": 550, "is_new_question": false }, @@ -32077,8 +32399,8 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 60855, - "total_submitted": 74342, + "total_acs": 61226, + "total_submitted": 74892, "frontend_question_id": 534, "is_new_question": false }, @@ -32100,8 +32422,8 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 69123, - "total_submitted": 129331, + "total_acs": 69565, + "total_submitted": 130439, "frontend_question_id": 512, "is_new_question": false }, @@ -32123,8 +32445,8 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 144789, - "total_submitted": 187456, + "total_acs": 147760, + "total_submitted": 191736, "frontend_question_id": 511, "is_new_question": false }, @@ -32146,8 +32468,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 42844, - "total_submitted": 84793, + "total_acs": 42955, + "total_submitted": 85005, "frontend_question_id": 1216, "is_new_question": false }, @@ -32169,8 +32491,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 29492, - "total_submitted": 47952, + "total_acs": 29633, + "total_submitted": 48166, "frontend_question_id": 1245, "is_new_question": false }, @@ -32192,8 +32514,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 57929, - "total_submitted": 84232, + "total_acs": 58256, + "total_submitted": 84748, "frontend_question_id": 1244, "is_new_question": false }, @@ -32215,8 +32537,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 11381, - "total_submitted": 22357, + "total_acs": 11405, + "total_submitted": 22392, "frontend_question_id": 1243, "is_new_question": false }, @@ -32238,8 +32560,8 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 84000, - "total_submitted": 166605, + "total_acs": 85530, + "total_submitted": 170284, "frontend_question_id": 1084, "is_new_question": false }, @@ -32261,8 +32583,8 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 49621, - "total_submitted": 98879, + "total_acs": 49885, + "total_submitted": 99412, "frontend_question_id": 1083, "is_new_question": false }, @@ -32284,8 +32606,8 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 49419, - "total_submitted": 65791, + "total_acs": 49687, + "total_submitted": 66137, "frontend_question_id": 1082, "is_new_question": false }, @@ -32307,8 +32629,8 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 284244, - "total_submitted": 637925, + "total_acs": 285841, + "total_submitted": 641500, "frontend_question_id": 1091, "is_new_question": false }, @@ -32330,8 +32652,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 67612, - "total_submitted": 116636, + "total_acs": 68296, + "total_submitted": 117736, "frontend_question_id": 1092, "is_new_question": false }, @@ -32353,8 +32675,8 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 31931, - "total_submitted": 52373, + "total_acs": 32017, + "total_submitted": 52510, "frontend_question_id": 1090, "is_new_question": false }, @@ -32376,8 +32698,8 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 329136, - "total_submitted": 638886, + "total_acs": 330835, + "total_submitted": 642308, "frontend_question_id": 1089, "is_new_question": false }, @@ -32399,8 +32721,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 3672, - "total_submitted": 9002, + "total_acs": 3679, + "total_submitted": 9033, "frontend_question_id": 1199, "is_new_question": false }, @@ -32422,8 +32744,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 12149, - "total_submitted": 22621, + "total_acs": 12214, + "total_submitted": 22722, "frontend_question_id": 1230, "is_new_question": false }, @@ -32445,8 +32767,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 68728, - "total_submitted": 124240, + "total_acs": 69089, + "total_submitted": 124956, "frontend_question_id": 1229, "is_new_question": false }, @@ -32468,8 +32790,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 22924, - "total_submitted": 44560, + "total_acs": 23011, + "total_submitted": 44733, "frontend_question_id": 1228, "is_new_question": false }, @@ -32491,8 +32813,8 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 44589, - "total_submitted": 56931, + "total_acs": 44938, + "total_submitted": 57449, "frontend_question_id": 1077, "is_new_question": false }, @@ -32514,8 +32836,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 48109, - "total_submitted": 94961, + "total_acs": 48406, + "total_submitted": 95632, "frontend_question_id": 1076, "is_new_question": false }, @@ -32537,8 +32859,8 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 45056, - "total_submitted": 67407, + "total_acs": 45311, + "total_submitted": 67849, "frontend_question_id": 1075, "is_new_question": false }, @@ -32560,8 +32882,8 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 80605, - "total_submitted": 106001, + "total_acs": 81005, + "total_submitted": 106520, "frontend_question_id": 1079, "is_new_question": false }, @@ -32583,8 +32905,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 47382, - "total_submitted": 82189, + "total_acs": 47604, + "total_submitted": 82504, "frontend_question_id": 1081, "is_new_question": false }, @@ -32606,8 +32928,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": 30215, - "total_submitted": 56801, + "total_acs": 30318, + "total_submitted": 56961, "frontend_question_id": 1080, "is_new_question": false }, @@ -32629,8 +32951,8 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 59210, - "total_submitted": 92968, + "total_acs": 59449, + "total_submitted": 93350, "frontend_question_id": 1078, "is_new_question": false }, @@ -32652,8 +32974,8 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 36296, - "total_submitted": 74187, + "total_acs": 36495, + "total_submitted": 74642, "frontend_question_id": 1070, "is_new_question": false }, @@ -32675,8 +32997,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 45827, - "total_submitted": 55998, + "total_acs": 46057, + "total_submitted": 56270, "frontend_question_id": 1069, "is_new_question": false }, @@ -32698,8 +33020,8 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 57238, - "total_submitted": 71358, + "total_acs": 57518, + "total_submitted": 71677, "frontend_question_id": 1068, "is_new_question": false }, @@ -32721,8 +33043,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 2415, - "total_submitted": 3947, + "total_acs": 2427, + "total_submitted": 3964, "frontend_question_id": 1183, "is_new_question": false }, @@ -32744,8 +33066,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 8132, - "total_submitted": 17670, + "total_acs": 8147, + "total_submitted": 17695, "frontend_question_id": 1215, "is_new_question": false }, @@ -32767,8 +33089,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 38225, - "total_submitted": 57852, + "total_acs": 38314, + "total_submitted": 57989, "frontend_question_id": 1214, "is_new_question": false }, @@ -32790,8 +33112,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 75473, - "total_submitted": 94408, + "total_acs": 75703, + "total_submitted": 94713, "frontend_question_id": 1213, "is_new_question": false }, @@ -32813,8 +33135,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 14616, - "total_submitted": 40152, + "total_acs": 14671, + "total_submitted": 40343, "frontend_question_id": 1073, "is_new_question": false }, @@ -32836,8 +33158,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": 18883, - "total_submitted": 29899, + "total_acs": 18951, + "total_submitted": 29990, "frontend_question_id": 1072, "is_new_question": false }, @@ -32859,8 +33181,8 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 86504, - "total_submitted": 169542, + "total_acs": 86870, + "total_submitted": 170359, "frontend_question_id": 1071, "is_new_question": false }, @@ -32882,8 +33204,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": 85305, - "total_submitted": 122204, + "total_acs": 85426, + "total_submitted": 122380, "frontend_question_id": 1074, "is_new_question": false }, @@ -32905,8 +33227,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 37575, - "total_submitted": 58304, + "total_acs": 37775, + "total_submitted": 58592, "frontend_question_id": 1168, "is_new_question": false }, @@ -32928,8 +33250,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": 37564, - "total_submitted": 48999, + "total_acs": 37654, + "total_submitted": 49132, "frontend_question_id": 1198, "is_new_question": false }, @@ -32951,8 +33273,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 131749, - "total_submitted": 332274, + "total_acs": 132073, + "total_submitted": 333081, "frontend_question_id": 1197, "is_new_question": false }, @@ -32974,8 +33296,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": 23583, - "total_submitted": 35242, + "total_acs": 23785, + "total_submitted": 35562, "frontend_question_id": 1196, "is_new_question": false }, @@ -32997,8 +33319,8 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 34690, - "total_submitted": 75869, + "total_acs": 35033, + "total_submitted": 76612, "frontend_question_id": 1054, "is_new_question": false }, @@ -33020,8 +33342,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 34746, - "total_submitted": 68598, + "total_acs": 34851, + "total_submitted": 68839, "frontend_question_id": 1053, "is_new_question": false }, @@ -33043,8 +33365,8 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 60435, - "total_submitted": 105882, + "total_acs": 60691, + "total_submitted": 106365, "frontend_question_id": 1052, "is_new_question": false }, @@ -33066,8 +33388,8 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 250763, - "total_submitted": 333028, + "total_acs": 252519, + "total_submitted": 335163, "frontend_question_id": 1051, "is_new_question": false }, @@ -33089,8 +33411,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": 96184, - "total_submitted": 134297, + "total_acs": 97977, + "total_submitted": 137041, "frontend_question_id": 1050, "is_new_question": false }, @@ -33112,8 +33434,8 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 46940, - "total_submitted": 69802, + "total_acs": 47300, + "total_submitted": 70367, "frontend_question_id": 1045, "is_new_question": false }, @@ -33135,8 +33457,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 32275, - "total_submitted": 58281, + "total_acs": 32422, + "total_submitted": 58525, "frontend_question_id": 1182, "is_new_question": false }, @@ -33158,8 +33480,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 31203, - "total_submitted": 89503, + "total_acs": 31270, + "total_submitted": 89778, "frontend_question_id": 1163, "is_new_question": false }, @@ -33181,8 +33503,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 9186, - "total_submitted": 20324, + "total_acs": 9195, + "total_submitted": 20335, "frontend_question_id": 1181, "is_new_question": false }, @@ -33204,8 +33526,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": 23010, - "total_submitted": 29097, + "total_acs": 23066, + "total_submitted": 29185, "frontend_question_id": 1180, "is_new_question": false }, @@ -33227,8 +33549,8 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 65579, - "total_submitted": 124369, + "total_acs": 65849, + "total_submitted": 124795, "frontend_question_id": 1049, "is_new_question": false }, @@ -33250,8 +33572,8 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 297077, - "total_submitted": 502094, + "total_acs": 297876, + "total_submitted": 503376, "frontend_question_id": 1048, "is_new_question": false }, @@ -33273,8 +33595,8 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 416301, - "total_submitted": 594079, + "total_acs": 418385, + "total_submitted": 597652, "frontend_question_id": 1047, "is_new_question": false }, @@ -33296,8 +33618,8 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 376137, - "total_submitted": 580610, + "total_acs": 379469, + "total_submitted": 585569, "frontend_question_id": 1046, "is_new_question": false }, @@ -33319,8 +33641,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 101333, - "total_submitted": 148514, + "total_acs": 101609, + "total_submitted": 148838, "frontend_question_id": 1167, "is_new_question": false }, @@ -33342,8 +33664,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 40321, - "total_submitted": 64958, + "total_acs": 40507, + "total_submitted": 65278, "frontend_question_id": 1166, "is_new_question": false }, @@ -33365,8 +33687,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 50201, - "total_submitted": 142137, + "total_acs": 50238, + "total_submitted": 142283, "frontend_question_id": 1153, "is_new_question": false }, @@ -33388,8 +33710,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 70141, - "total_submitted": 81078, + "total_acs": 70319, + "total_submitted": 81275, "frontend_question_id": 1165, "is_new_question": false }, @@ -33411,8 +33733,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 60085, - "total_submitted": 196292, + "total_acs": 60254, + "total_submitted": 196922, "frontend_question_id": 1044, "is_new_question": false }, @@ -33434,8 +33756,8 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 65320, - "total_submitted": 91538, + "total_acs": 65804, + "total_submitted": 92182, "frontend_question_id": 1043, "is_new_question": false }, @@ -33457,8 +33779,8 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 63844, - "total_submitted": 126461, + "total_acs": 64094, + "total_submitted": 126898, "frontend_question_id": 1042, "is_new_question": false }, @@ -33480,8 +33802,8 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 206283, - "total_submitted": 373046, + "total_acs": 206562, + "total_submitted": 373496, "frontend_question_id": 1041, "is_new_question": false }, @@ -33503,8 +33825,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 4193, - "total_submitted": 6969, + "total_acs": 4203, + "total_submitted": 6989, "frontend_question_id": 1121, "is_new_question": false }, @@ -33526,8 +33848,8 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 81686, - "total_submitted": 168482, + "total_acs": 82249, + "total_submitted": 169790, "frontend_question_id": 1162, "is_new_question": false }, @@ -33549,8 +33871,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": 121600, - "total_submitted": 184052, + "total_acs": 122024, + "total_submitted": 184720, "frontend_question_id": 1161, "is_new_question": false }, @@ -33572,8 +33894,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 38525, - "total_submitted": 103344, + "total_acs": 38873, + "total_submitted": 104332, "frontend_question_id": 1037, "is_new_question": false }, @@ -33595,8 +33917,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": 143073, - "total_submitted": 167223, + "total_acs": 143732, + "total_submitted": 167980, "frontend_question_id": 1038, "is_new_question": false }, @@ -33618,8 +33940,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 8443, - "total_submitted": 15147, + "total_acs": 8465, + "total_submitted": 15176, "frontend_question_id": 1040, "is_new_question": false }, @@ -33641,8 +33963,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": 138519, - "total_submitted": 204647, + "total_acs": 139133, + "total_submitted": 205623, "frontend_question_id": 1160, "is_new_question": false }, @@ -33664,8 +33986,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 31002, - "total_submitted": 56420, + "total_acs": 31251, + "total_submitted": 56817, "frontend_question_id": 1039, "is_new_question": false }, @@ -33687,8 +34009,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 85467, - "total_submitted": 197587, + "total_acs": 85724, + "total_submitted": 198293, "frontend_question_id": 1152, "is_new_question": false }, @@ -33710,8 +34032,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": 54272, - "total_submitted": 89196, + "total_acs": 54390, + "total_submitted": 89407, "frontend_question_id": 1151, "is_new_question": false }, @@ -33733,8 +34055,8 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 17573, - "total_submitted": 51528, + "total_acs": 17605, + "total_submitted": 51609, "frontend_question_id": 1036, "is_new_question": false }, @@ -33756,8 +34078,8 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 76029, - "total_submitted": 129164, + "total_acs": 76239, + "total_submitted": 129449, "frontend_question_id": 1035, "is_new_question": false }, @@ -33779,8 +34101,8 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 28084, - "total_submitted": 57219, + "total_acs": 28177, + "total_submitted": 57386, "frontend_question_id": 1034, "is_new_question": false }, @@ -33802,8 +34124,8 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 21403, - "total_submitted": 46565, + "total_acs": 21459, + "total_submitted": 46646, "frontend_question_id": 1033, "is_new_question": false }, @@ -33825,8 +34147,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": 37161, - "total_submitted": 65120, + "total_acs": 37305, + "total_submitted": 65341, "frontend_question_id": 1150, "is_new_question": false }, @@ -33848,8 +34170,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 53474, - "total_submitted": 86543, + "total_acs": 53945, + "total_submitted": 87318, "frontend_question_id": 1136, "is_new_question": false }, @@ -33871,8 +34193,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 64252, - "total_submitted": 104951, + "total_acs": 64441, + "total_submitted": 105245, "frontend_question_id": 1135, "is_new_question": false }, @@ -33894,8 +34216,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 54955, - "total_submitted": 103099, + "total_acs": 55139, + "total_submitted": 103477, "frontend_question_id": 1102, "is_new_question": false }, @@ -33917,8 +34239,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 35089, - "total_submitted": 52016, + "total_acs": 35509, + "total_submitted": 52607, "frontend_question_id": 1133, "is_new_question": false }, @@ -33940,8 +34262,8 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 80570, - "total_submitted": 156159, + "total_acs": 80679, + "total_submitted": 156401, "frontend_question_id": 1032, "is_new_question": false }, @@ -33963,8 +34285,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": 59938, - "total_submitted": 100686, + "total_acs": 60139, + "total_submitted": 100965, "frontend_question_id": 1031, "is_new_question": false }, @@ -33986,8 +34308,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 204448, - "total_submitted": 314702, + "total_acs": 205200, + "total_submitted": 315690, "frontend_question_id": 1029, "is_new_question": false }, @@ -34009,8 +34331,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 48017, - "total_submitted": 69168, + "total_acs": 48207, + "total_submitted": 69415, "frontend_question_id": 1030, "is_new_question": false }, @@ -34032,8 +34354,8 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 40902, - "total_submitted": 55914, + "total_acs": 41039, + "total_submitted": 56105, "frontend_question_id": 1028, "is_new_question": false }, @@ -34055,8 +34377,8 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 196722, - "total_submitted": 259574, + "total_acs": 197423, + "total_submitted": 260486, "frontend_question_id": 1026, "is_new_question": false }, @@ -34078,8 +34400,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 58445, - "total_submitted": 89183, + "total_acs": 58515, + "total_submitted": 89290, "frontend_question_id": 1120, "is_new_question": false }, @@ -34101,8 +34423,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 30993, - "total_submitted": 39669, + "total_acs": 31106, + "total_submitted": 39800, "frontend_question_id": 1134, "is_new_question": false }, @@ -34124,8 +34446,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 91677, - "total_submitted": 100995, + "total_acs": 91931, + "total_submitted": 101262, "frontend_question_id": 1119, "is_new_question": false }, @@ -34147,8 +34469,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 7172, - "total_submitted": 12583, + "total_acs": 7203, + "total_submitted": 12642, "frontend_question_id": 1118, "is_new_question": false }, @@ -34170,8 +34492,8 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 97839, - "total_submitted": 208674, + "total_acs": 98143, + "total_submitted": 209445, "frontend_question_id": 1027, "is_new_question": false }, @@ -34193,8 +34515,8 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 188934, - "total_submitted": 280560, + "total_acs": 190105, + "total_submitted": 282179, "frontend_question_id": 1025, "is_new_question": false }, @@ -34216,8 +34538,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": 59210, - "total_submitted": 91391, + "total_acs": 59927, + "total_submitted": 92519, "frontend_question_id": 1101, "is_new_question": false }, @@ -34239,8 +34561,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": 33577, - "total_submitted": 44948, + "total_acs": 33664, + "total_submitted": 45087, "frontend_question_id": 1100, "is_new_question": false }, @@ -34262,8 +34584,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 111760, - "total_submitted": 183394, + "total_acs": 112142, + "total_submitted": 184001, "frontend_question_id": 1099, "is_new_question": false }, @@ -34285,8 +34607,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": 21793, - "total_submitted": 28620, + "total_acs": 21859, + "total_submitted": 28696, "frontend_question_id": 1085, "is_new_question": false }, @@ -34308,8 +34630,8 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 55014, - "total_submitted": 108948, + "total_acs": 55186, + "total_submitted": 109298, "frontend_question_id": 1024, "is_new_question": false }, @@ -34331,8 +34653,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 37357, - "total_submitted": 61927, + "total_acs": 37554, + "total_submitted": 62208, "frontend_question_id": 1023, "is_new_question": false }, @@ -34354,8 +34676,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": 182613, - "total_submitted": 247826, + "total_acs": 183189, + "total_submitted": 248645, "frontend_question_id": 1022, "is_new_question": false }, @@ -34377,8 +34699,8 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 203072, - "total_submitted": 252658, + "total_acs": 204285, + "total_submitted": 254023, "frontend_question_id": 1021, "is_new_question": false }, @@ -34400,8 +34722,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 32509, - "total_submitted": 70015, + "total_acs": 33709, + "total_submitted": 71948, "frontend_question_id": 1088, "is_new_question": false }, @@ -34423,8 +34745,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 46772, - "total_submitted": 70739, + "total_acs": 46860, + "total_submitted": 70852, "frontend_question_id": 1087, "is_new_question": false }, @@ -34446,8 +34768,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 20136, - "total_submitted": 31771, + "total_acs": 20239, + "total_submitted": 31898, "frontend_question_id": 1065, "is_new_question": false }, @@ -34469,8 +34791,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 92360, - "total_submitted": 123016, + "total_acs": 92517, + "total_submitted": 123242, "frontend_question_id": 1086, "is_new_question": false }, @@ -34492,8 +34814,8 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 88672, - "total_submitted": 135931, + "total_acs": 89945, + "total_submitted": 137785, "frontend_question_id": 1020, "is_new_question": false }, @@ -34515,8 +34837,8 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 120924, - "total_submitted": 201889, + "total_acs": 121412, + "total_submitted": 202734, "frontend_question_id": 1019, "is_new_question": false }, @@ -34538,8 +34860,8 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 44317, - "total_submitted": 94064, + "total_acs": 44563, + "total_submitted": 94613, "frontend_question_id": 1018, "is_new_question": false }, @@ -34561,8 +34883,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 21769, - "total_submitted": 35729, + "total_acs": 21882, + "total_submitted": 35922, "frontend_question_id": 1017, "is_new_question": false }, @@ -34584,8 +34906,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 34378, - "total_submitted": 71489, + "total_acs": 34943, + "total_submitted": 72536, "frontend_question_id": 1056, "is_new_question": false }, @@ -34607,8 +34929,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 3277, - "total_submitted": 7279, + "total_acs": 3295, + "total_submitted": 7310, "frontend_question_id": 1067, "is_new_question": false }, @@ -34630,8 +34952,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 43960, - "total_submitted": 80222, + "total_acs": 44079, + "total_submitted": 80402, "frontend_question_id": 1066, "is_new_question": false }, @@ -34653,8 +34975,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 38621, - "total_submitted": 60715, + "total_acs": 39458, + "total_submitted": 61639, "frontend_question_id": 1064, "is_new_question": false }, @@ -34676,8 +34998,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": 32247, - "total_submitted": 56138, + "total_acs": 32361, + "total_submitted": 56347, "frontend_question_id": 1016, "is_new_question": false }, @@ -34699,8 +35021,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 58067, - "total_submitted": 123570, + "total_acs": 58168, + "total_submitted": 123815, "frontend_question_id": 1015, "is_new_question": false }, @@ -34722,8 +35044,8 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 78840, - "total_submitted": 132539, + "total_acs": 79447, + "total_submitted": 133554, "frontend_question_id": 1014, "is_new_question": false }, @@ -34745,8 +35067,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": 75007, - "total_submitted": 174508, + "total_acs": 75411, + "total_submitted": 175641, "frontend_question_id": 1013, "is_new_question": false }, @@ -34768,8 +35090,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 7218, - "total_submitted": 9728, + "total_acs": 7245, + "total_submitted": 9755, "frontend_question_id": 1063, "is_new_question": false }, @@ -34791,8 +35113,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 31655, - "total_submitted": 53412, + "total_acs": 31817, + "total_submitted": 53715, "frontend_question_id": 1062, "is_new_question": false }, @@ -34814,8 +35136,8 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 110547, - "total_submitted": 202365, + "total_acs": 110892, + "total_submitted": 202935, "frontend_question_id": 1060, "is_new_question": false }, @@ -34837,8 +35159,8 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 11845, - "total_submitted": 16697, + "total_acs": 66246, + "total_submitted": 86237, "frontend_question_id": 1061, "is_new_question": false }, @@ -34846,7 +35168,7 @@ "difficulty": { "level": 2 }, - "paid_only": true, + "paid_only": false, "is_favor": false, "frequency": 0, "progress": 0 @@ -34860,8 +35182,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 11544, - "total_submitted": 28651, + "total_acs": 11596, + "total_submitted": 28815, "frontend_question_id": 1012, "is_new_question": false }, @@ -34883,8 +35205,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": 190318, - "total_submitted": 293831, + "total_acs": 191415, + "total_submitted": 295319, "frontend_question_id": 1011, "is_new_question": false }, @@ -34906,8 +35228,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": 229881, - "total_submitted": 434854, + "total_acs": 230929, + "total_submitted": 437031, "frontend_question_id": 1010, "is_new_question": false }, @@ -34929,8 +35251,8 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 164063, - "total_submitted": 265852, + "total_acs": 165558, + "total_submitted": 268356, "frontend_question_id": 1009, "is_new_question": false }, @@ -34952,8 +35274,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 8255, - "total_submitted": 18407, + "total_acs": 8276, + "total_submitted": 18449, "frontend_question_id": 1058, "is_new_question": false }, @@ -34975,8 +35297,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 63664, - "total_submitted": 110494, + "total_acs": 63720, + "total_submitted": 110587, "frontend_question_id": 1057, "is_new_question": false }, @@ -34998,8 +35320,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 73833, - "total_submitted": 124759, + "total_acs": 74064, + "total_submitted": 125135, "frontend_question_id": 1055, "is_new_question": false }, @@ -35021,8 +35343,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": 278602, - "total_submitted": 343997, + "total_acs": 279715, + "total_submitted": 345267, "frontend_question_id": 1008, "is_new_question": false }, @@ -35044,8 +35366,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 189455, - "total_submitted": 362061, + "total_acs": 189650, + "total_submitted": 362412, "frontend_question_id": 1007, "is_new_question": false }, @@ -35067,8 +35389,8 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 23527, - "total_submitted": 42667, + "total_acs": 23661, + "total_submitted": 42892, "frontend_question_id": 1006, "is_new_question": false }, @@ -35090,8 +35412,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": 66669, - "total_submitted": 130944, + "total_acs": 67112, + "total_submitted": 131834, "frontend_question_id": 1005, "is_new_question": false }, @@ -35113,8 +35435,8 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 271062, - "total_submitted": 428147, + "total_acs": 273154, + "total_submitted": 431508, "frontend_question_id": 1004, "is_new_question": false }, @@ -35136,8 +35458,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": 47399, - "total_submitted": 81458, + "total_acs": 47628, + "total_submitted": 81851, "frontend_question_id": 1003, "is_new_question": false }, @@ -35159,8 +35481,8 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 168318, - "total_submitted": 246050, + "total_acs": 169299, + "total_submitted": 247462, "frontend_question_id": 1002, "is_new_question": false }, @@ -35182,8 +35504,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 17241, - "total_submitted": 47598, + "total_acs": 17311, + "total_submitted": 47764, "frontend_question_id": 1001, "is_new_question": false }, @@ -35205,8 +35527,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 32574, - "total_submitted": 76924, + "total_acs": 32677, + "total_submitted": 77189, "frontend_question_id": 1000, "is_new_question": false }, @@ -35228,8 +35550,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 55494, - "total_submitted": 81598, + "total_acs": 55769, + "total_submitted": 81947, "frontend_question_id": 999, "is_new_question": false }, @@ -35251,8 +35573,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 30094, - "total_submitted": 45132, + "total_acs": 30315, + "total_submitted": 45391, "frontend_question_id": 998, "is_new_question": false }, @@ -35274,8 +35596,8 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 323440, - "total_submitted": 657410, + "total_acs": 359843, + "total_submitted": 726023, "frontend_question_id": 997, "is_new_question": false }, @@ -35297,8 +35619,8 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 29701, - "total_submitted": 60349, + "total_acs": 29866, + "total_submitted": 60668, "frontend_question_id": 996, "is_new_question": false }, @@ -35320,8 +35642,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": 29369, - "total_submitted": 57438, + "total_acs": 29474, + "total_submitted": 57632, "frontend_question_id": 995, "is_new_question": false }, @@ -35343,8 +35665,8 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 544380, - "total_submitted": 1033022, + "total_acs": 549372, + "total_submitted": 1041969, "frontend_question_id": 994, "is_new_question": false }, @@ -35366,8 +35688,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 234382, - "total_submitted": 430742, + "total_acs": 235074, + "total_submitted": 431728, "frontend_question_id": 993, "is_new_question": false }, @@ -35389,8 +35711,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 86565, - "total_submitted": 158805, + "total_acs": 87088, + "total_submitted": 159718, "frontend_question_id": 992, "is_new_question": false }, @@ -35412,8 +35734,8 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 91870, - "total_submitted": 169950, + "total_acs": 92026, + "total_submitted": 170185, "frontend_question_id": 991, "is_new_question": false }, @@ -35435,8 +35757,8 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 106585, - "total_submitted": 210028, + "total_acs": 107014, + "total_submitted": 210926, "frontend_question_id": 990, "is_new_question": false }, @@ -35458,8 +35780,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 140626, - "total_submitted": 309268, + "total_acs": 141613, + "total_submitted": 311511, "frontend_question_id": 989, "is_new_question": false }, @@ -35481,8 +35803,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 63157, - "total_submitted": 126651, + "total_acs": 63399, + "total_submitted": 127086, "frontend_question_id": 988, "is_new_question": false }, @@ -35504,8 +35826,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": 317254, - "total_submitted": 707960, + "total_acs": 318352, + "total_submitted": 710068, "frontend_question_id": 987, "is_new_question": false }, @@ -35527,8 +35849,8 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 342421, - "total_submitted": 479808, + "total_acs": 343477, + "total_submitted": 481269, "frontend_question_id": 986, "is_new_question": false }, @@ -35550,8 +35872,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 129592, - "total_submitted": 190004, + "total_acs": 129785, + "total_submitted": 190300, "frontend_question_id": 985, "is_new_question": false }, @@ -35573,8 +35895,8 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 38973, - "total_submitted": 90584, + "total_acs": 39193, + "total_submitted": 90963, "frontend_question_id": 984, "is_new_question": false }, @@ -35596,8 +35918,8 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 182833, - "total_submitted": 284115, + "total_acs": 183617, + "total_submitted": 285366, "frontend_question_id": 983, "is_new_question": false }, @@ -35619,8 +35941,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": 14238, - "total_submitted": 24678, + "total_acs": 14282, + "total_submitted": 24761, "frontend_question_id": 982, "is_new_question": false }, @@ -35642,8 +35964,8 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 294380, - "total_submitted": 555988, + "total_acs": 296532, + "total_submitted": 561109, "frontend_question_id": 981, "is_new_question": false }, @@ -35665,8 +35987,8 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 169025, - "total_submitted": 206329, + "total_acs": 169591, + "total_submitted": 206996, "frontend_question_id": 980, "is_new_question": false }, @@ -35688,8 +36010,8 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 98573, - "total_submitted": 136660, + "total_acs": 98901, + "total_submitted": 137099, "frontend_question_id": 979, "is_new_question": false }, @@ -35711,8 +36033,8 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 80094, - "total_submitted": 169316, + "total_acs": 80448, + "total_submitted": 170126, "frontend_question_id": 978, "is_new_question": false }, @@ -35734,8 +36056,8 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 1294660, - "total_submitted": 1800148, + "total_acs": 1305109, + "total_submitted": 1814819, "frontend_question_id": 977, "is_new_question": false }, @@ -35757,8 +36079,8 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 187501, - "total_submitted": 343995, + "total_acs": 189288, + "total_submitted": 347155, "frontend_question_id": 976, "is_new_question": false }, @@ -35780,8 +36102,8 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 70558, - "total_submitted": 181540, + "total_acs": 70906, + "total_submitted": 182303, "frontend_question_id": 975, "is_new_question": false }, @@ -35803,8 +36125,8 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 131357, - "total_submitted": 245359, + "total_acs": 186075, + "total_submitted": 341171, "frontend_question_id": 974, "is_new_question": false }, @@ -35826,8 +36148,8 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 930918, - "total_submitted": 1414359, + "total_acs": 934723, + "total_submitted": 1420262, "frontend_question_id": 973, "is_new_question": false }, @@ -35849,8 +36171,8 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 1191547, - "total_submitted": 1715691, + "total_acs": 1204301, + "total_submitted": 1732619, "frontend_question_id": 509, "is_new_question": false }, @@ -35872,8 +36194,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 6007, - "total_submitted": 13897, + "total_acs": 6017, + "total_submitted": 13912, "frontend_question_id": 972, "is_new_question": false }, @@ -35895,8 +36217,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": 37847, - "total_submitted": 75684, + "total_acs": 37922, + "total_submitted": 75810, "frontend_question_id": 971, "is_new_question": false }, @@ -35918,8 +36240,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 49293, - "total_submitted": 113055, + "total_acs": 49393, + "total_submitted": 113286, "frontend_question_id": 970, "is_new_question": false }, @@ -35941,8 +36263,8 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 80991, - "total_submitted": 115685, + "total_acs": 81258, + "total_submitted": 116027, "frontend_question_id": 969, "is_new_question": false }, @@ -35964,8 +36286,8 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 116650, - "total_submitted": 249474, + "total_acs": 117023, + "total_submitted": 250298, "frontend_question_id": 968, "is_new_question": false }, @@ -35987,8 +36309,8 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 115999, - "total_submitted": 202602, + "total_acs": 116541, + "total_submitted": 203451, "frontend_question_id": 967, "is_new_question": false }, @@ -36010,8 +36332,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 37817, - "total_submitted": 73531, + "total_acs": 37850, + "total_submitted": 73620, "frontend_question_id": 966, "is_new_question": false }, @@ -36033,8 +36355,8 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 183666, - "total_submitted": 264405, + "total_acs": 184376, + "total_submitted": 265271, "frontend_question_id": 965, "is_new_question": false }, @@ -36056,8 +36378,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 8644, - "total_submitted": 18025, + "total_acs": 8660, + "total_submitted": 18056, "frontend_question_id": 964, "is_new_question": false }, @@ -36079,8 +36401,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 24801, - "total_submitted": 45311, + "total_acs": 24835, + "total_submitted": 45384, "frontend_question_id": 963, "is_new_question": false }, @@ -36102,8 +36424,8 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 38301, - "total_submitted": 78221, + "total_acs": 38450, + "total_submitted": 78585, "frontend_question_id": 962, "is_new_question": false }, @@ -36125,8 +36447,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": 197025, - "total_submitted": 259549, + "total_acs": 197752, + "total_submitted": 260487, "frontend_question_id": 961, "is_new_question": false }, @@ -36148,8 +36470,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 11723, - "total_submitted": 20483, + "total_acs": 11763, + "total_submitted": 20536, "frontend_question_id": 960, "is_new_question": false }, @@ -36171,8 +36493,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 43545, - "total_submitted": 63012, + "total_acs": 43748, + "total_submitted": 63271, "frontend_question_id": 959, "is_new_question": false }, @@ -36194,8 +36516,8 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 131419, - "total_submitted": 243932, + "total_acs": 131809, + "total_submitted": 244662, "frontend_question_id": 958, "is_new_question": false }, @@ -36217,8 +36539,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 150391, - "total_submitted": 384798, + "total_acs": 150520, + "total_submitted": 385099, "frontend_question_id": 957, "is_new_question": false }, @@ -36240,8 +36562,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 15366, - "total_submitted": 38395, + "total_acs": 15411, + "total_submitted": 38540, "frontend_question_id": 956, "is_new_question": false }, @@ -36263,8 +36585,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 17283, - "total_submitted": 49793, + "total_acs": 17348, + "total_submitted": 49977, "frontend_question_id": 955, "is_new_question": false }, @@ -36286,8 +36608,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 78721, - "total_submitted": 201260, + "total_acs": 78937, + "total_submitted": 201756, "frontend_question_id": 954, "is_new_question": false }, @@ -36309,8 +36631,8 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 381876, - "total_submitted": 723588, + "total_acs": 382964, + "total_submitted": 725338, "frontend_question_id": 953, "is_new_question": false }, @@ -36332,8 +36654,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 47805, - "total_submitted": 118672, + "total_acs": 47935, + "total_submitted": 119036, "frontend_question_id": 952, "is_new_question": false }, @@ -36355,8 +36677,8 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 125242, - "total_submitted": 187383, + "total_acs": 125674, + "total_submitted": 188036, "frontend_question_id": 951, "is_new_question": false }, @@ -36378,8 +36700,8 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 64555, - "total_submitted": 83080, + "total_acs": 64857, + "total_submitted": 83449, "frontend_question_id": 950, "is_new_question": false }, @@ -36401,8 +36723,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 76981, - "total_submitted": 218693, + "total_acs": 77124, + "total_submitted": 219125, "frontend_question_id": 949, "is_new_question": false }, @@ -36424,8 +36746,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 98841, - "total_submitted": 189733, + "total_acs": 99101, + "total_submitted": 190292, "frontend_question_id": 948, "is_new_question": false }, @@ -36447,8 +36769,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": 166923, - "total_submitted": 283761, + "total_acs": 167826, + "total_submitted": 285248, "frontend_question_id": 947, "is_new_question": false }, @@ -36470,8 +36792,8 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 194592, - "total_submitted": 287739, + "total_acs": 195127, + "total_submitted": 288516, "frontend_question_id": 946, "is_new_question": false }, @@ -36493,8 +36815,8 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 69510, - "total_submitted": 137057, + "total_acs": 70098, + "total_submitted": 138140, "frontend_question_id": 945, "is_new_question": false }, @@ -36516,8 +36838,8 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 164059, - "total_submitted": 219226, + "total_acs": 165214, + "total_submitted": 220770, "frontend_question_id": 944, "is_new_question": false }, @@ -36539,8 +36861,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 25369, - "total_submitted": 56855, + "total_acs": 25414, + "total_submitted": 56982, "frontend_question_id": 943, "is_new_question": false }, @@ -36562,8 +36884,8 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 124216, - "total_submitted": 161428, + "total_acs": 124839, + "total_submitted": 162147, "frontend_question_id": 942, "is_new_question": false }, @@ -36585,8 +36907,8 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 344283, - "total_submitted": 1028683, + "total_acs": 346043, + "total_submitted": 1033998, "frontend_question_id": 941, "is_new_question": false }, @@ -36608,8 +36930,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 31874, - "total_submitted": 72150, + "total_acs": 31970, + "total_submitted": 72428, "frontend_question_id": 940, "is_new_question": false }, @@ -36631,8 +36953,8 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 119816, - "total_submitted": 226332, + "total_acs": 120032, + "total_submitted": 226809, "frontend_question_id": 939, "is_new_question": false }, @@ -36654,8 +36976,8 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 756173, - "total_submitted": 880806, + "total_acs": 758519, + "total_submitted": 883434, "frontend_question_id": 938, "is_new_question": false }, @@ -36677,8 +36999,8 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 337597, - "total_submitted": 598502, + "total_acs": 338020, + "total_submitted": 599209, "frontend_question_id": 937, "is_new_question": false }, @@ -36700,8 +37022,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 55754, - "total_submitted": 88306, + "total_acs": 55832, + "total_submitted": 88476, "frontend_question_id": 936, "is_new_question": false }, @@ -36723,8 +37045,8 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 96347, - "total_submitted": 191978, + "total_acs": 96656, + "total_submitted": 192412, "frontend_question_id": 935, "is_new_question": false }, @@ -36746,8 +37068,8 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 120087, - "total_submitted": 221547, + "total_acs": 120727, + "total_submitted": 222634, "frontend_question_id": 934, "is_new_question": false }, @@ -36769,8 +37091,8 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 136006, - "total_submitted": 185822, + "total_acs": 136558, + "total_submitted": 186564, "frontend_question_id": 933, "is_new_question": false }, @@ -36792,8 +37114,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 38765, - "total_submitted": 59549, + "total_acs": 38858, + "total_submitted": 59673, "frontend_question_id": 932, "is_new_question": false }, @@ -36815,8 +37137,8 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 225642, - "total_submitted": 326394, + "total_acs": 227243, + "total_submitted": 328712, "frontend_question_id": 931, "is_new_question": false }, @@ -36838,8 +37160,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 61000, - "total_submitted": 118805, + "total_acs": 61628, + "total_submitted": 119781, "frontend_question_id": 930, "is_new_question": false }, @@ -36861,8 +37183,8 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 405903, - "total_submitted": 604475, + "total_acs": 407652, + "total_submitted": 607084, "frontend_question_id": 929, "is_new_question": false }, @@ -36884,8 +37206,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 17737, - "total_submitted": 41507, + "total_acs": 17827, + "total_submitted": 41695, "frontend_question_id": 928, "is_new_question": false }, @@ -36907,8 +37229,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 27292, - "total_submitted": 68824, + "total_acs": 27525, + "total_submitted": 69536, "frontend_question_id": 927, "is_new_question": false }, @@ -36930,8 +37252,8 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 110234, - "total_submitted": 184984, + "total_acs": 170789, + "total_submitted": 277933, "frontend_question_id": 926, "is_new_question": false }, @@ -36953,8 +37275,8 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 111144, - "total_submitted": 332221, + "total_acs": 111820, + "total_submitted": 334620, "frontend_question_id": 925, "is_new_question": false }, @@ -36976,8 +37298,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 42093, - "total_submitted": 99973, + "total_acs": 42259, + "total_submitted": 100328, "frontend_question_id": 924, "is_new_question": false }, @@ -36999,8 +37321,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 94519, - "total_submitted": 208300, + "total_acs": 94671, + "total_submitted": 208761, "frontend_question_id": 923, "is_new_question": false }, @@ -37022,8 +37344,8 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 208388, - "total_submitted": 294674, + "total_acs": 209283, + "total_submitted": 295982, "frontend_question_id": 922, "is_new_question": false }, @@ -37045,8 +37367,8 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 244835, - "total_submitted": 321780, + "total_acs": 245735, + "total_submitted": 323216, "frontend_question_id": 921, "is_new_question": false }, @@ -37068,8 +37390,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 22003, - "total_submitted": 43415, + "total_acs": 22063, + "total_submitted": 43542, "frontend_question_id": 920, "is_new_question": false }, @@ -37091,8 +37413,8 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 43806, - "total_submitted": 67345, + "total_acs": 44163, + "total_submitted": 67893, "frontend_question_id": 919, "is_new_question": false }, @@ -37114,8 +37436,8 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 146343, - "total_submitted": 381271, + "total_acs": 197942, + "total_submitted": 464308, "frontend_question_id": 918, "is_new_question": false }, @@ -37137,8 +37459,8 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 152144, - "total_submitted": 246779, + "total_acs": 153208, + "total_submitted": 248324, "frontend_question_id": 917, "is_new_question": false }, @@ -37160,8 +37482,8 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 106464, - "total_submitted": 197597, + "total_acs": 106807, + "total_submitted": 198297, "frontend_question_id": 916, "is_new_question": false }, @@ -37183,8 +37505,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 72422, - "total_submitted": 149103, + "total_acs": 72525, + "total_submitted": 149348, "frontend_question_id": 915, "is_new_question": false }, @@ -37206,8 +37528,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": 99917, - "total_submitted": 315624, + "total_acs": 100370, + "total_submitted": 317734, "frontend_question_id": 914, "is_new_question": false }, @@ -37229,8 +37551,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 16542, - "total_submitted": 47199, + "total_acs": 16575, + "total_submitted": 47335, "frontend_question_id": 913, "is_new_question": false }, @@ -37252,8 +37574,8 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 347962, - "total_submitted": 592406, + "total_acs": 350738, + "total_submitted": 597799, "frontend_question_id": 912, "is_new_question": false }, @@ -37275,8 +37597,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 47006, - "total_submitted": 90277, + "total_acs": 47153, + "total_submitted": 90520, "frontend_question_id": 911, "is_new_question": false }, @@ -37298,8 +37620,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 43828, - "total_submitted": 125940, + "total_acs": 44107, + "total_submitted": 126650, "frontend_question_id": 910, "is_new_question": false }, @@ -37321,8 +37643,8 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 89102, - "total_submitted": 218045, + "total_acs": 89346, + "total_submitted": 218659, "frontend_question_id": 909, "is_new_question": false }, @@ -37344,8 +37666,8 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 68732, - "total_submitted": 101172, + "total_acs": 69173, + "total_submitted": 101684, "frontend_question_id": 908, "is_new_question": false }, @@ -37367,8 +37689,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 138765, - "total_submitted": 386097, + "total_acs": 139349, + "total_submitted": 387791, "frontend_question_id": 907, "is_new_question": false }, @@ -37390,8 +37712,8 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 22249, - "total_submitted": 56798, + "total_acs": 22270, + "total_submitted": 56881, "frontend_question_id": 906, "is_new_question": false }, @@ -37413,8 +37735,8 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 572898, - "total_submitted": 757599, + "total_acs": 575107, + "total_submitted": 760661, "frontend_question_id": 905, "is_new_question": false }, @@ -37436,8 +37758,8 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 252264, - "total_submitted": 592473, + "total_acs": 253682, + "total_submitted": 595564, "frontend_question_id": 904, "is_new_question": false }, @@ -37459,8 +37781,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 13361, - "total_submitted": 23046, + "total_acs": 13390, + "total_submitted": 23089, "frontend_question_id": 903, "is_new_question": false }, @@ -37482,8 +37804,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": 39212, - "total_submitted": 94618, + "total_acs": 39267, + "total_submitted": 94813, "frontend_question_id": 902, "is_new_question": false }, @@ -37505,8 +37827,8 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 209333, - "total_submitted": 320822, + "total_acs": 210386, + "total_submitted": 322457, "frontend_question_id": 901, "is_new_question": false }, @@ -37528,8 +37850,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 62328, - "total_submitted": 104779, + "total_acs": 62530, + "total_submitted": 105129, "frontend_question_id": 900, "is_new_question": false }, @@ -37551,8 +37873,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 63375, - "total_submitted": 95327, + "total_acs": 63516, + "total_submitted": 95554, "frontend_question_id": 899, "is_new_question": false }, @@ -37574,8 +37896,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 29840, - "total_submitted": 80706, + "total_acs": 29911, + "total_submitted": 80837, "frontend_question_id": 898, "is_new_question": false }, @@ -37597,8 +37919,8 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 239550, - "total_submitted": 305268, + "total_acs": 240353, + "total_submitted": 306326, "frontend_question_id": 897, "is_new_question": false }, @@ -37620,8 +37942,8 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 244825, - "total_submitted": 420080, + "total_acs": 246192, + "total_submitted": 422179, "frontend_question_id": 896, "is_new_question": false }, @@ -37643,8 +37965,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 146815, - "total_submitted": 220144, + "total_acs": 147311, + "total_submitted": 220918, "frontend_question_id": 895, "is_new_question": false }, @@ -37666,8 +37988,8 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 102409, - "total_submitted": 128041, + "total_acs": 102953, + "total_submitted": 128730, "frontend_question_id": 894, "is_new_question": false }, @@ -37689,8 +38011,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 43976, - "total_submitted": 61972, + "total_acs": 44083, + "total_submitted": 62116, "frontend_question_id": 893, "is_new_question": false }, @@ -37712,8 +38034,8 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 32724, - "total_submitted": 51488, + "total_acs": 32852, + "total_submitted": 51647, "frontend_question_id": 892, "is_new_question": false }, @@ -37735,8 +38057,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 18002, - "total_submitted": 49264, + "total_acs": 18025, + "total_submitted": 49318, "frontend_question_id": 891, "is_new_question": false }, @@ -37758,8 +38080,8 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 165357, - "total_submitted": 212558, + "total_acs": 165873, + "total_submitted": 213262, "frontend_question_id": 890, "is_new_question": false }, @@ -37781,8 +38103,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": 84794, - "total_submitted": 119582, + "total_acs": 85092, + "total_submitted": 119988, "frontend_question_id": 889, "is_new_question": false }, @@ -37804,8 +38126,8 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 96262, - "total_submitted": 158720, + "total_acs": 96745, + "total_submitted": 159407, "frontend_question_id": 888, "is_new_question": false }, @@ -37827,8 +38149,8 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 57084, - "total_submitted": 209874, + "total_acs": 57292, + "total_submitted": 210588, "frontend_question_id": 887, "is_new_question": false }, @@ -37850,8 +38172,8 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 174045, - "total_submitted": 348791, + "total_acs": 174804, + "total_submitted": 350159, "frontend_question_id": 886, "is_new_question": false }, @@ -37873,8 +38195,8 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 39790, - "total_submitted": 54278, + "total_acs": 39986, + "total_submitted": 54535, "frontend_question_id": 885, "is_new_question": false }, @@ -37896,8 +38218,8 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 112211, - "total_submitted": 169633, + "total_acs": 112781, + "total_submitted": 170430, "frontend_question_id": 884, "is_new_question": false }, @@ -37919,8 +38241,8 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 45762, - "total_submitted": 64491, + "total_acs": 45945, + "total_submitted": 64716, "frontend_question_id": 883, "is_new_question": false }, @@ -37942,8 +38264,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 22960, - "total_submitted": 45742, + "total_acs": 23014, + "total_submitted": 45856, "frontend_question_id": 882, "is_new_question": false }, @@ -37965,8 +38287,8 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 168093, - "total_submitted": 317902, + "total_acs": 169006, + "total_submitted": 319346, "frontend_question_id": 881, "is_new_question": false }, @@ -37988,8 +38310,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 35659, - "total_submitted": 125903, + "total_acs": 35718, + "total_submitted": 126113, "frontend_question_id": 880, "is_new_question": false }, @@ -38011,8 +38333,8 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 36062, - "total_submitted": 91118, + "total_acs": 36140, + "total_submitted": 91383, "frontend_question_id": 478, "is_new_question": false }, @@ -38034,8 +38356,8 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 36262, - "total_submitted": 92213, + "total_acs": 36340, + "total_submitted": 92418, "frontend_question_id": 497, "is_new_question": false }, @@ -38057,8 +38379,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 15587, - "total_submitted": 39004, + "total_acs": 15650, + "total_submitted": 39147, "frontend_question_id": 519, "is_new_question": false }, @@ -38080,8 +38402,8 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 349880, - "total_submitted": 759279, + "total_acs": 350996, + "total_submitted": 761615, "frontend_question_id": 528, "is_new_question": false }, @@ -38103,8 +38425,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 17370, - "total_submitted": 42753, + "total_acs": 17411, + "total_submitted": 42858, "frontend_question_id": 879, "is_new_question": false }, @@ -38126,8 +38448,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 32279, - "total_submitted": 90843, + "total_acs": 32350, + "total_submitted": 91236, "frontend_question_id": 878, "is_new_question": false }, @@ -38149,8 +38471,8 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 177537, - "total_submitted": 254696, + "total_acs": 178250, + "total_submitted": 255754, "frontend_question_id": 877, "is_new_question": false }, @@ -38172,8 +38494,8 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 1150063, - "total_submitted": 1534416, + "total_acs": 1165857, + "total_submitted": 1553753, "frontend_question_id": 876, "is_new_question": false }, @@ -38195,8 +38517,8 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 261955, - "total_submitted": 505893, + "total_acs": 264790, + "total_submitted": 512315, "frontend_question_id": 875, "is_new_question": false }, @@ -38218,8 +38540,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 35281, - "total_submitted": 91353, + "total_acs": 35397, + "total_submitted": 91618, "frontend_question_id": 874, "is_new_question": false }, @@ -38241,8 +38563,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 54463, - "total_submitted": 112520, + "total_acs": 54578, + "total_submitted": 112743, "frontend_question_id": 873, "is_new_question": false }, @@ -38264,8 +38586,8 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 245706, - "total_submitted": 363385, + "total_acs": 246442, + "total_submitted": 364478, "frontend_question_id": 872, "is_new_question": false }, @@ -38287,8 +38609,8 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 69319, - "total_submitted": 148884, + "total_acs": 69499, + "total_submitted": 149360, "frontend_question_id": 470, "is_new_question": false }, @@ -38310,8 +38632,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 120083, - "total_submitted": 301339, + "total_acs": 120390, + "total_submitted": 302160, "frontend_question_id": 871, "is_new_question": false }, @@ -38333,8 +38655,8 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 58848, - "total_submitted": 113611, + "total_acs": 59018, + "total_submitted": 113910, "frontend_question_id": 870, "is_new_question": false }, @@ -38356,8 +38678,8 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 104408, - "total_submitted": 163594, + "total_acs": 104781, + "total_submitted": 164252, "frontend_question_id": 869, "is_new_question": false }, @@ -38379,8 +38701,8 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 66352, - "total_submitted": 106842, + "total_acs": 66624, + "total_submitted": 107194, "frontend_question_id": 868, "is_new_question": false }, @@ -38402,8 +38724,8 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 230551, - "total_submitted": 361835, + "total_acs": 231681, + "total_submitted": 363160, "frontend_question_id": 867, "is_new_question": false }, @@ -38425,8 +38747,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 27560, - "total_submitted": 107025, + "total_acs": 27633, + "total_submitted": 107449, "frontend_question_id": 866, "is_new_question": false }, @@ -38448,8 +38770,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": 113633, - "total_submitted": 165235, + "total_acs": 113900, + "total_submitted": 165545, "frontend_question_id": 865, "is_new_question": false }, @@ -38471,8 +38793,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 29544, - "total_submitted": 64888, + "total_acs": 29732, + "total_submitted": 65275, "frontend_question_id": 864, "is_new_question": false }, @@ -38494,8 +38816,8 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 34703, - "total_submitted": 103138, + "total_acs": 34861, + "total_submitted": 103564, "frontend_question_id": 710, "is_new_question": false }, @@ -38517,8 +38839,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": 288512, - "total_submitted": 463761, + "total_acs": 289815, + "total_submitted": 465831, "frontend_question_id": 863, "is_new_question": false }, @@ -38540,8 +38862,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": 82178, - "total_submitted": 315066, + "total_acs": 82479, + "total_submitted": 316382, "frontend_question_id": 862, "is_new_question": false }, @@ -38563,8 +38885,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 39686, - "total_submitted": 52917, + "total_acs": 39846, + "total_submitted": 53118, "frontend_question_id": 861, "is_new_question": false }, @@ -38586,8 +38908,8 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 118788, - "total_submitted": 224800, + "total_acs": 119535, + "total_submitted": 226259, "frontend_question_id": 860, "is_new_question": false }, @@ -38609,8 +38931,8 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 140776, - "total_submitted": 482958, + "total_acs": 141244, + "total_submitted": 484632, "frontend_question_id": 859, "is_new_question": false }, @@ -38632,8 +38954,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 75002, - "total_submitted": 118519, + "total_acs": 75124, + "total_submitted": 118763, "frontend_question_id": 858, "is_new_question": false }, @@ -38655,8 +38977,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 56785, - "total_submitted": 109107, + "total_acs": 56981, + "total_submitted": 109523, "frontend_question_id": 857, "is_new_question": false }, @@ -38678,8 +39000,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 152908, - "total_submitted": 235450, + "total_acs": 153230, + "total_submitted": 236027, "frontend_question_id": 856, "is_new_question": false }, @@ -38701,8 +39023,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 52865, - "total_submitted": 121796, + "total_acs": 53032, + "total_submitted": 122165, "frontend_question_id": 855, "is_new_question": false }, @@ -38724,8 +39046,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 39982, - "total_submitted": 99646, + "total_acs": 40049, + "total_submitted": 99833, "frontend_question_id": 854, "is_new_question": false }, @@ -38747,8 +39069,8 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 119677, - "total_submitted": 238376, + "total_acs": 121324, + "total_submitted": 241681, "frontend_question_id": 853, "is_new_question": false }, @@ -38770,8 +39092,8 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 504219, - "total_submitted": 727798, + "total_acs": 508126, + "total_submitted": 733892, "frontend_question_id": 852, "is_new_question": false }, @@ -38793,8 +39115,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 31194, - "total_submitted": 53369, + "total_acs": 31373, + "total_submitted": 53660, "frontend_question_id": 851, "is_new_question": false }, @@ -38816,8 +39138,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 31720, - "total_submitted": 58984, + "total_acs": 31775, + "total_submitted": 59115, "frontend_question_id": 850, "is_new_question": false }, @@ -38839,8 +39161,8 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 193543, - "total_submitted": 406659, + "total_acs": 194090, + "total_submitted": 407762, "frontend_question_id": 849, "is_new_question": false }, @@ -38862,8 +39184,8 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 82670, - "total_submitted": 182407, + "total_acs": 82930, + "total_submitted": 183047, "frontend_question_id": 848, "is_new_question": false }, @@ -38885,8 +39207,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 66892, - "total_submitted": 109362, + "total_acs": 67173, + "total_submitted": 109888, "frontend_question_id": 847, "is_new_question": false }, @@ -38908,8 +39230,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 109203, - "total_submitted": 193996, + "total_acs": 109867, + "total_submitted": 195217, "frontend_question_id": 846, "is_new_question": false }, @@ -38931,8 +39253,8 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 105647, - "total_submitted": 262824, + "total_acs": 106030, + "total_submitted": 263863, "frontend_question_id": 845, "is_new_question": false }, @@ -38954,8 +39276,8 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 590014, - "total_submitted": 1228855, + "total_acs": 594000, + "total_submitted": 1236899, "frontend_question_id": 844, "is_new_question": false }, @@ -38977,8 +39299,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 129177, - "total_submitted": 310839, + "total_acs": 129404, + "total_submitted": 311570, "frontend_question_id": 843, "is_new_question": false }, @@ -39000,8 +39322,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 34279, - "total_submitted": 89419, + "total_acs": 34392, + "total_submitted": 89728, "frontend_question_id": 842, "is_new_question": false }, @@ -39023,8 +39345,8 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 302821, - "total_submitted": 424702, + "total_acs": 304146, + "total_submitted": 426491, "frontend_question_id": 841, "is_new_question": false }, @@ -39046,8 +39368,8 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 34411, - "total_submitted": 89192, + "total_acs": 34563, + "total_submitted": 89603, "frontend_question_id": 840, "is_new_question": false }, @@ -39069,8 +39391,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 62880, - "total_submitted": 131443, + "total_acs": 63032, + "total_submitted": 131717, "frontend_question_id": 839, "is_new_question": false }, @@ -39092,8 +39414,8 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 109589, - "total_submitted": 192408, + "total_acs": 109915, + "total_submitted": 193007, "frontend_question_id": 838, "is_new_question": false }, @@ -39115,8 +39437,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 33904, - "total_submitted": 93905, + "total_acs": 34075, + "total_submitted": 94269, "frontend_question_id": 837, "is_new_question": false }, @@ -39138,8 +39460,8 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 118456, - "total_submitted": 270992, + "total_acs": 118908, + "total_submitted": 271921, "frontend_question_id": 836, "is_new_question": false }, @@ -39161,8 +39483,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 140802, - "total_submitted": 183895, + "total_acs": 141100, + "total_submitted": 184256, "frontend_question_id": 489, "is_new_question": false }, @@ -39184,8 +39506,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 87065, - "total_submitted": 136114, + "total_acs": 87212, + "total_submitted": 136418, "frontend_question_id": 835, "is_new_question": false }, @@ -39207,8 +39529,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 78891, - "total_submitted": 132954, + "total_acs": 79211, + "total_submitted": 133543, "frontend_question_id": 834, "is_new_question": false }, @@ -39230,8 +39552,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 131770, - "total_submitted": 243760, + "total_acs": 132077, + "total_submitted": 244386, "frontend_question_id": 833, "is_new_question": false }, @@ -39253,8 +39575,8 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 342813, - "total_submitted": 425290, + "total_acs": 344236, + "total_submitted": 426923, "frontend_question_id": 832, "is_new_question": false }, @@ -39276,8 +39598,8 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 252487, - "total_submitted": 488440, + "total_acs": 253532, + "total_submitted": 490694, "frontend_question_id": 622, "is_new_question": false }, @@ -39299,8 +39621,8 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 52704, - "total_submitted": 91562, + "total_acs": 53002, + "total_submitted": 92179, "frontend_question_id": 641, "is_new_question": false }, @@ -39322,8 +39644,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 16045, - "total_submitted": 34006, + "total_acs": 16097, + "total_submitted": 34084, "frontend_question_id": 831, "is_new_question": false }, @@ -39345,8 +39667,8 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 79825, - "total_submitted": 154125, + "total_acs": 80098, + "total_submitted": 154609, "frontend_question_id": 830, "is_new_question": false }, @@ -39368,8 +39690,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 76613, - "total_submitted": 184413, + "total_acs": 76810, + "total_submitted": 184852, "frontend_question_id": 829, "is_new_question": false }, @@ -39391,8 +39713,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": 62537, - "total_submitted": 120750, + "total_acs": 62651, + "total_submitted": 121027, "frontend_question_id": 828, "is_new_question": false }, @@ -39414,8 +39736,8 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 125310, - "total_submitted": 279699, + "total_acs": 125668, + "total_submitted": 280461, "frontend_question_id": 827, "is_new_question": false }, @@ -39437,8 +39759,8 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 51117, - "total_submitted": 114375, + "total_acs": 51351, + "total_submitted": 114864, "frontend_question_id": 826, "is_new_question": false }, @@ -39460,8 +39782,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 69970, - "total_submitted": 150978, + "total_acs": 70061, + "total_submitted": 151172, "frontend_question_id": 825, "is_new_question": false }, @@ -39483,8 +39805,8 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 153329, - "total_submitted": 225908, + "total_acs": 153653, + "total_submitted": 226377, "frontend_question_id": 824, "is_new_question": false }, @@ -39506,8 +39828,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": 127564, - "total_submitted": 369597, + "total_acs": 127816, + "total_submitted": 370339, "frontend_question_id": 708, "is_new_question": false }, @@ -39529,8 +39851,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 88389, - "total_submitted": 177441, + "total_acs": 88623, + "total_submitted": 177981, "frontend_question_id": 823, "is_new_question": false }, @@ -39552,8 +39874,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 14790, - "total_submitted": 32298, + "total_acs": 14849, + "total_submitted": 32410, "frontend_question_id": 822, "is_new_question": false }, @@ -39575,8 +39897,8 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 150884, - "total_submitted": 211185, + "total_acs": 151491, + "total_submitted": 212060, "frontend_question_id": 821, "is_new_question": false }, @@ -39598,8 +39920,8 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 90797, - "total_submitted": 149809, + "total_acs": 90894, + "total_submitted": 149970, "frontend_question_id": 820, "is_new_question": false }, @@ -39621,8 +39943,8 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 239951, - "total_submitted": 871245, + "total_acs": 241557, + "total_submitted": 876806, "frontend_question_id": 707, "is_new_question": false }, @@ -39644,8 +39966,8 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 318101, - "total_submitted": 709163, + "total_acs": 318756, + "total_submitted": 710786, "frontend_question_id": 819, "is_new_question": false }, @@ -39667,8 +39989,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 71721, - "total_submitted": 165487, + "total_acs": 72270, + "total_submitted": 166884, "frontend_question_id": 818, "is_new_question": false }, @@ -39690,8 +40012,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 77763, - "total_submitted": 134138, + "total_acs": 77992, + "total_submitted": 134699, "frontend_question_id": 817, "is_new_question": false }, @@ -39713,8 +40035,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 27135, - "total_submitted": 48318, + "total_acs": 27158, + "total_submitted": 48352, "frontend_question_id": 816, "is_new_question": false }, @@ -39736,8 +40058,8 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 115601, - "total_submitted": 253194, + "total_acs": 116442, + "total_submitted": 255213, "frontend_question_id": 815, "is_new_question": false }, @@ -39759,8 +40081,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 219918, - "total_submitted": 303398, + "total_acs": 220456, + "total_submitted": 304189, "frontend_question_id": 814, "is_new_question": false }, @@ -39782,8 +40104,8 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 44956, - "total_submitted": 84805, + "total_acs": 45064, + "total_submitted": 85008, "frontend_question_id": 813, "is_new_question": false }, @@ -39805,8 +40127,8 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 39016, - "total_submitted": 64996, + "total_acs": 39210, + "total_submitted": 65332, "frontend_question_id": 812, "is_new_question": false }, @@ -39828,8 +40150,8 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 202893, - "total_submitted": 269261, + "total_acs": 203606, + "total_submitted": 270106, "frontend_question_id": 811, "is_new_question": false }, @@ -39851,8 +40173,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 7708, - "total_submitted": 13828, + "total_acs": 7752, + "total_submitted": 13885, "frontend_question_id": 810, "is_new_question": false }, @@ -39874,8 +40196,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 105488, - "total_submitted": 228106, + "total_acs": 105732, + "total_submitted": 228771, "frontend_question_id": 809, "is_new_question": false }, @@ -39897,8 +40219,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 16986, - "total_submitted": 39139, + "total_acs": 17069, + "total_submitted": 39305, "frontend_question_id": 808, "is_new_question": false }, @@ -39920,8 +40242,8 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 140351, - "total_submitted": 163193, + "total_acs": 140879, + "total_submitted": 163782, "frontend_question_id": 807, "is_new_question": false }, @@ -39943,8 +40265,8 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 61741, - "total_submitted": 93014, + "total_acs": 62037, + "total_submitted": 93392, "frontend_question_id": 806, "is_new_question": false }, @@ -39966,8 +40288,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 29240, - "total_submitted": 113610, + "total_acs": 29362, + "total_submitted": 114079, "frontend_question_id": 805, "is_new_question": false }, @@ -39989,8 +40311,8 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 304249, - "total_submitted": 368096, + "total_acs": 305199, + "total_submitted": 369192, "frontend_question_id": 804, "is_new_question": false }, @@ -40012,8 +40334,8 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 27275, - "total_submitted": 79534, + "total_acs": 27321, + "total_submitted": 79628, "frontend_question_id": 803, "is_new_question": false }, @@ -40035,8 +40357,8 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 111364, - "total_submitted": 199573, + "total_acs": 112549, + "total_submitted": 201213, "frontend_question_id": 802, "is_new_question": false }, @@ -40058,8 +40380,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 60467, - "total_submitted": 154050, + "total_acs": 60709, + "total_submitted": 154577, "frontend_question_id": 801, "is_new_question": false }, @@ -40081,8 +40403,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 16084, - "total_submitted": 24003, + "total_acs": 16118, + "total_submitted": 24062, "frontend_question_id": 800, "is_new_question": false }, @@ -40104,8 +40426,8 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 390678, - "total_submitted": 602364, + "total_acs": 392358, + "total_submitted": 605049, "frontend_question_id": 706, "is_new_question": false }, @@ -40127,8 +40449,8 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 270851, - "total_submitted": 411738, + "total_acs": 272145, + "total_submitted": 413795, "frontend_question_id": 705, "is_new_question": false }, @@ -40150,8 +40472,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 82804, - "total_submitted": 161314, + "total_acs": 82914, + "total_submitted": 161489, "frontend_question_id": 799, "is_new_question": false }, @@ -40173,8 +40495,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 11409, - "total_submitted": 22780, + "total_acs": 11454, + "total_submitted": 22837, "frontend_question_id": 798, "is_new_question": false }, @@ -40196,8 +40518,8 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 410716, - "total_submitted": 499707, + "total_acs": 413297, + "total_submitted": 502773, "frontend_question_id": 797, "is_new_question": false }, @@ -40219,8 +40541,8 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 187692, - "total_submitted": 344133, + "total_acs": 189143, + "total_submitted": 346520, "frontend_question_id": 796, "is_new_question": false }, @@ -40242,8 +40564,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 59162, - "total_submitted": 112091, + "total_acs": 59306, + "total_submitted": 112338, "frontend_question_id": 795, "is_new_question": false }, @@ -40265,8 +40587,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 52949, - "total_submitted": 150637, + "total_acs": 53052, + "total_submitted": 151008, "frontend_question_id": 794, "is_new_question": false }, @@ -40288,8 +40610,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 14645, - "total_submitted": 34075, + "total_acs": 14708, + "total_submitted": 34201, "frontend_question_id": 793, "is_new_question": false }, @@ -40311,8 +40633,8 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 205056, - "total_submitted": 396256, + "total_acs": 205766, + "total_submitted": 397693, "frontend_question_id": 792, "is_new_question": false }, @@ -40334,8 +40656,8 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 205754, - "total_submitted": 297072, + "total_acs": 206671, + "total_submitted": 298433, "frontend_question_id": 791, "is_new_question": false }, @@ -40357,8 +40679,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 90823, - "total_submitted": 171274, + "total_acs": 91260, + "total_submitted": 172131, "frontend_question_id": 790, "is_new_question": false }, @@ -40380,8 +40702,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 24043, - "total_submitted": 39523, + "total_acs": 24134, + "total_submitted": 39659, "frontend_question_id": 789, "is_new_question": false }, @@ -40403,8 +40725,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 93370, - "total_submitted": 164334, + "total_acs": 93646, + "total_submitted": 164831, "frontend_question_id": 788, "is_new_question": false }, @@ -40426,8 +40748,8 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 299833, - "total_submitted": 835441, + "total_acs": 301609, + "total_submitted": 840691, "frontend_question_id": 787, "is_new_question": false }, @@ -40449,8 +40771,8 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 32584, - "total_submitted": 63783, + "total_acs": 32807, + "total_submitted": 64118, "frontend_question_id": 786, "is_new_question": false }, @@ -40472,8 +40794,8 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 379650, - "total_submitted": 717720, + "total_acs": 381508, + "total_submitted": 720765, "frontend_question_id": 785, "is_new_question": false }, @@ -40495,8 +40817,8 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 257701, - "total_submitted": 349972, + "total_acs": 259089, + "total_submitted": 351666, "frontend_question_id": 784, "is_new_question": false }, @@ -40518,8 +40840,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 142208, - "total_submitted": 249832, + "total_acs": 142829, + "total_submitted": 250870, "frontend_question_id": 783, "is_new_question": false }, @@ -40541,8 +40863,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 15705, - "total_submitted": 30324, + "total_acs": 15721, + "total_submitted": 30365, "frontend_question_id": 782, "is_new_question": false }, @@ -40564,8 +40886,8 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 43727, - "total_submitted": 79432, + "total_acs": 43935, + "total_submitted": 79863, "frontend_question_id": 781, "is_new_question": false }, @@ -40587,8 +40909,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 51249, - "total_submitted": 157456, + "total_acs": 51557, + "total_submitted": 158426, "frontend_question_id": 780, "is_new_question": false }, @@ -40610,8 +40932,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 107051, - "total_submitted": 260970, + "total_acs": 107683, + "total_submitted": 262233, "frontend_question_id": 779, "is_new_question": false }, @@ -40633,8 +40955,8 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 110205, - "total_submitted": 184275, + "total_acs": 110807, + "total_submitted": 185364, "frontend_question_id": 778, "is_new_question": false }, @@ -40656,8 +40978,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 67981, - "total_submitted": 183841, + "total_acs": 68130, + "total_submitted": 184303, "frontend_question_id": 777, "is_new_question": false }, @@ -40679,8 +41001,8 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 1482201, - "total_submitted": 2683921, + "total_acs": 1502383, + "total_submitted": 2718851, "frontend_question_id": 704, "is_new_question": false }, @@ -40702,8 +41024,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 28749, - "total_submitted": 48968, + "total_acs": 29288, + "total_submitted": 49523, "frontend_question_id": 776, "is_new_question": false }, @@ -40725,8 +41047,8 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 62516, - "total_submitted": 143655, + "total_acs": 62669, + "total_submitted": 144070, "frontend_question_id": 775, "is_new_question": false }, @@ -40748,8 +41070,8 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 326533, - "total_submitted": 588589, + "total_acs": 328647, + "total_submitted": 592437, "frontend_question_id": 703, "is_new_question": false }, @@ -40771,8 +41093,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 27703, - "total_submitted": 53695, + "total_acs": 27744, + "total_submitted": 53750, "frontend_question_id": 774, "is_new_question": false }, @@ -40794,8 +41116,8 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 82233, - "total_submitted": 128368, + "total_acs": 82473, + "total_submitted": 128725, "frontend_question_id": 773, "is_new_question": false }, @@ -40817,8 +41139,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": 83973, - "total_submitted": 117605, + "total_acs": 84292, + "total_submitted": 118011, "frontend_question_id": 702, "is_new_question": false }, @@ -40840,8 +41162,8 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 100064, - "total_submitted": 205550, + "total_acs": 100354, + "total_submitted": 206060, "frontend_question_id": 772, "is_new_question": false }, @@ -40863,8 +41185,8 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 379191, - "total_submitted": 509157, + "total_acs": 381705, + "total_submitted": 512743, "frontend_question_id": 701, "is_new_question": false }, @@ -40886,8 +41208,8 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 596586, - "total_submitted": 771270, + "total_acs": 600287, + "total_submitted": 775636, "frontend_question_id": 700, "is_new_question": false }, @@ -40909,8 +41231,8 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 827677, - "total_submitted": 939203, + "total_acs": 831518, + "total_submitted": 943468, "frontend_question_id": 771, "is_new_question": false }, @@ -40932,8 +41254,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 8989, - "total_submitted": 16029, + "total_acs": 9001, + "total_submitted": 16052, "frontend_question_id": 770, "is_new_question": false }, @@ -40955,8 +41277,8 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 85695, - "total_submitted": 147193, + "total_acs": 86074, + "total_submitted": 147809, "frontend_question_id": 769, "is_new_question": false }, @@ -40978,8 +41300,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 51044, - "total_submitted": 96483, + "total_acs": 51245, + "total_submitted": 96890, "frontend_question_id": 768, "is_new_question": false }, @@ -41001,8 +41323,8 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 252564, - "total_submitted": 478147, + "total_acs": 253409, + "total_submitted": 479661, "frontend_question_id": 767, "is_new_question": false }, @@ -41024,8 +41346,8 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 268270, - "total_submitted": 390162, + "total_acs": 268929, + "total_submitted": 391212, "frontend_question_id": 766, "is_new_question": false }, @@ -41047,8 +41369,8 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 214670, - "total_submitted": 277733, + "total_acs": 215673, + "total_submitted": 278963, "frontend_question_id": 590, "is_new_question": false }, @@ -41070,8 +41392,8 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 348007, - "total_submitted": 457148, + "total_acs": 352636, + "total_submitted": 463357, "frontend_question_id": 589, "is_new_question": false }, @@ -41093,8 +41415,8 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 239501, - "total_submitted": 334324, + "total_acs": 240290, + "total_submitted": 335448, "frontend_question_id": 559, "is_new_question": false }, @@ -41116,8 +41438,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": 12495, - "total_submitted": 25792, + "total_acs": 12537, + "total_submitted": 25870, "frontend_question_id": 558, "is_new_question": false }, @@ -41139,8 +41461,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 51519, - "total_submitted": 77380, + "total_acs": 51714, + "total_submitted": 77624, "frontend_question_id": 427, "is_new_question": false }, @@ -41162,8 +41484,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": 18973, - "total_submitted": 24080, + "total_acs": 19019, + "total_submitted": 24133, "frontend_question_id": 431, "is_new_question": false }, @@ -41185,8 +41507,8 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 50602, - "total_submitted": 88892, + "total_acs": 50822, + "total_submitted": 89249, "frontend_question_id": 765, "is_new_question": false }, @@ -41208,8 +41530,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 51853, - "total_submitted": 107121, + "total_acs": 51940, + "total_submitted": 107337, "frontend_question_id": 764, "is_new_question": false }, @@ -41231,8 +41553,8 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 445604, - "total_submitted": 558408, + "total_acs": 447427, + "total_submitted": 560862, "frontend_question_id": 763, "is_new_question": false }, @@ -41254,8 +41576,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": 78677, - "total_submitted": 115888, + "total_acs": 79011, + "total_submitted": 116294, "frontend_question_id": 762, "is_new_question": false }, @@ -41277,8 +41599,8 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 277264, - "total_submitted": 465123, + "total_acs": 278350, + "total_submitted": 466872, "frontend_question_id": 430, "is_new_question": false }, @@ -41300,8 +41622,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 76667, - "total_submitted": 116577, + "total_acs": 76843, + "total_submitted": 116797, "frontend_question_id": 428, "is_new_question": false }, @@ -41323,8 +41645,8 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 268555, - "total_submitted": 380124, + "total_acs": 269497, + "total_submitted": 381495, "frontend_question_id": 429, "is_new_question": false }, @@ -41346,8 +41668,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 14630, - "total_submitted": 24244, + "total_acs": 14664, + "total_submitted": 24291, "frontend_question_id": 761, "is_new_question": false }, @@ -41369,8 +41691,8 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 86931, - "total_submitted": 104860, + "total_acs": 87084, + "total_submitted": 105024, "frontend_question_id": 760, "is_new_question": false }, @@ -41392,8 +41714,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 128337, - "total_submitted": 178733, + "total_acs": 128641, + "total_submitted": 179178, "frontend_question_id": 759, "is_new_question": false }, @@ -41415,8 +41737,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 17579, - "total_submitted": 34653, + "total_acs": 17617, + "total_submitted": 34721, "frontend_question_id": 758, "is_new_question": false }, @@ -41438,8 +41760,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 18452, - "total_submitted": 42106, + "total_acs": 18519, + "total_submitted": 42236, "frontend_question_id": 757, "is_new_question": false }, @@ -41461,8 +41783,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": 231778, - "total_submitted": 358471, + "total_acs": 232089, + "total_submitted": 358912, "frontend_question_id": 426, "is_new_question": false }, @@ -41484,8 +41806,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 29628, - "total_submitted": 55962, + "total_acs": 29679, + "total_submitted": 56095, "frontend_question_id": 756, "is_new_question": false }, @@ -41507,8 +41829,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 34073, - "total_submitted": 73609, + "total_acs": 34164, + "total_submitted": 73801, "frontend_question_id": 755, "is_new_question": false }, @@ -41530,8 +41852,8 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 44295, - "total_submitted": 103655, + "total_acs": 44413, + "total_submitted": 103972, "frontend_question_id": 754, "is_new_question": false }, @@ -41553,8 +41875,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 51644, - "total_submitted": 92776, + "total_acs": 51733, + "total_submitted": 92904, "frontend_question_id": 753, "is_new_question": false }, @@ -41576,8 +41898,8 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 192599, - "total_submitted": 346690, + "total_acs": 193415, + "total_submitted": 348124, "frontend_question_id": 752, "is_new_question": false }, @@ -41599,8 +41921,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 17126, - "total_submitted": 31424, + "total_acs": 17221, + "total_submitted": 31581, "frontend_question_id": 751, "is_new_question": false }, @@ -41622,8 +41944,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 36799, - "total_submitted": 54549, + "total_acs": 36860, + "total_submitted": 54628, "frontend_question_id": 750, "is_new_question": false }, @@ -41645,8 +41967,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 9980, - "total_submitted": 19608, + "total_acs": 10031, + "total_submitted": 19688, "frontend_question_id": 749, "is_new_question": false }, @@ -41668,8 +41990,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 58028, - "total_submitted": 97975, + "total_acs": 58352, + "total_submitted": 98519, "frontend_question_id": 748, "is_new_question": false }, @@ -41691,8 +42013,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": 190692, - "total_submitted": 408192, + "total_acs": 191959, + "total_submitted": 410410, "frontend_question_id": 747, "is_new_question": false }, @@ -41714,8 +42036,8 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 732631, - "total_submitted": 1167069, + "total_acs": 739416, + "total_submitted": 1176751, "frontend_question_id": 746, "is_new_question": false }, @@ -41737,8 +42059,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 88460, - "total_submitted": 214289, + "total_acs": 88606, + "total_submitted": 214670, "frontend_question_id": 745, "is_new_question": false }, @@ -41760,8 +42082,8 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 267556, - "total_submitted": 593045, + "total_acs": 269842, + "total_submitted": 596986, "frontend_question_id": 744, "is_new_question": false }, @@ -41783,8 +42105,8 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 352040, - "total_submitted": 681909, + "total_acs": 354133, + "total_submitted": 685543, "frontend_question_id": 743, "is_new_question": false }, @@ -41806,8 +42128,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 41339, - "total_submitted": 90088, + "total_acs": 41417, + "total_submitted": 90320, "frontend_question_id": 742, "is_new_question": false }, @@ -41829,8 +42151,8 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 394729, - "total_submitted": 480603, + "total_acs": 397024, + "total_submitted": 483229, "frontend_question_id": 709, "is_new_question": false }, @@ -41852,8 +42174,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 62803, - "total_submitted": 172866, + "total_acs": 62995, + "total_submitted": 173462, "frontend_question_id": 741, "is_new_question": false }, @@ -41875,8 +42197,8 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 249467, - "total_submitted": 436046, + "total_acs": 250896, + "total_submitted": 438740, "frontend_question_id": 740, "is_new_question": false }, @@ -41898,8 +42220,8 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 562818, - "total_submitted": 847707, + "total_acs": 566778, + "total_submitted": 853828, "frontend_question_id": 739, "is_new_question": false }, @@ -41921,8 +42243,8 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 43204, - "total_submitted": 91669, + "total_acs": 43390, + "total_submitted": 92096, "frontend_question_id": 738, "is_new_question": false }, @@ -41944,8 +42266,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 64283, - "total_submitted": 131560, + "total_acs": 64405, + "total_submitted": 131769, "frontend_question_id": 737, "is_new_question": false }, @@ -41967,8 +42289,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 19882, - "total_submitted": 38502, + "total_acs": 19917, + "total_submitted": 38565, "frontend_question_id": 736, "is_new_question": false }, @@ -41990,8 +42312,8 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 250544, - "total_submitted": 564286, + "total_acs": 252070, + "total_submitted": 567664, "frontend_question_id": 735, "is_new_question": false }, @@ -42013,8 +42335,8 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 54345, - "total_submitted": 126111, + "total_acs": 54459, + "total_submitted": 126405, "frontend_question_id": 734, "is_new_question": false }, @@ -42036,8 +42358,8 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 638712, - "total_submitted": 1043497, + "total_acs": 646542, + "total_submitted": 1054247, "frontend_question_id": 733, "is_new_question": false }, @@ -42059,8 +42381,8 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 81972, - "total_submitted": 114525, + "total_acs": 82139, + "total_submitted": 114740, "frontend_question_id": 732, "is_new_question": false }, @@ -42082,8 +42404,8 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 87525, - "total_submitted": 159434, + "total_acs": 87799, + "total_submitted": 159855, "frontend_question_id": 731, "is_new_question": false }, @@ -42105,8 +42427,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 31533, - "total_submitted": 70493, + "total_acs": 31644, + "total_submitted": 70760, "frontend_question_id": 730, "is_new_question": false }, @@ -42128,8 +42450,8 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 247350, - "total_submitted": 433739, + "total_acs": 248498, + "total_submitted": 436052, "frontend_question_id": 729, "is_new_question": false }, @@ -42151,8 +42473,8 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 195621, - "total_submitted": 251592, + "total_acs": 196538, + "total_submitted": 252670, "frontend_question_id": 728, "is_new_question": false }, @@ -42174,8 +42496,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 81910, - "total_submitted": 191319, + "total_acs": 82030, + "total_submitted": 191615, "frontend_question_id": 727, "is_new_question": false }, @@ -42197,8 +42519,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 51393, - "total_submitted": 98367, + "total_acs": 51546, + "total_submitted": 98645, "frontend_question_id": 726, "is_new_question": false }, @@ -42220,8 +42542,8 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 108640, - "total_submitted": 189405, + "total_acs": 109089, + "total_submitted": 190281, "frontend_question_id": 725, "is_new_question": false }, @@ -42243,8 +42565,8 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 681380, - "total_submitted": 1263631, + "total_acs": 696273, + "total_submitted": 1288683, "frontend_question_id": 724, "is_new_question": false }, @@ -42266,8 +42588,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 61919, - "total_submitted": 80853, + "total_acs": 62140, + "total_submitted": 81152, "frontend_question_id": 723, "is_new_question": false }, @@ -42289,8 +42611,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 62783, - "total_submitted": 164605, + "total_acs": 62972, + "total_submitted": 165062, "frontend_question_id": 722, "is_new_question": false }, @@ -42312,8 +42634,8 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 294272, - "total_submitted": 522178, + "total_acs": 295772, + "total_submitted": 524878, "frontend_question_id": 721, "is_new_question": false }, @@ -42335,8 +42657,8 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 132097, - "total_submitted": 254600, + "total_acs": 132421, + "total_submitted": 255113, "frontend_question_id": 720, "is_new_question": false }, @@ -42358,8 +42680,8 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 72077, - "total_submitted": 197330, + "total_acs": 72408, + "total_submitted": 197964, "frontend_question_id": 719, "is_new_question": false }, @@ -42381,8 +42703,8 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 252922, - "total_submitted": 492086, + "total_acs": 253834, + "total_submitted": 494042, "frontend_question_id": 718, "is_new_question": false }, @@ -42404,8 +42726,8 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 113495, - "total_submitted": 247457, + "total_acs": 113831, + "total_submitted": 248247, "frontend_question_id": 717, "is_new_question": false }, @@ -42427,8 +42749,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 139213, - "total_submitted": 307560, + "total_acs": 139428, + "total_submitted": 308103, "frontend_question_id": 716, "is_new_question": false }, @@ -42450,8 +42772,8 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 55654, - "total_submitted": 124734, + "total_acs": 55935, + "total_submitted": 125491, "frontend_question_id": 715, "is_new_question": false }, @@ -42473,8 +42795,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": 211383, - "total_submitted": 326557, + "total_acs": 212700, + "total_submitted": 328349, "frontend_question_id": 714, "is_new_question": false }, @@ -42496,8 +42818,8 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 212245, - "total_submitted": 467607, + "total_acs": 213888, + "total_submitted": 470623, "frontend_question_id": 713, "is_new_question": false }, @@ -42519,8 +42841,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": 73038, - "total_submitted": 116972, + "total_acs": 73346, + "total_submitted": 117431, "frontend_question_id": 712, "is_new_question": false }, @@ -42542,8 +42864,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 9098, - "total_submitted": 17573, + "total_acs": 9117, + "total_submitted": 17618, "frontend_question_id": 711, "is_new_question": false }, @@ -42565,8 +42887,8 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 22257, - "total_submitted": 50005, + "total_acs": 22320, + "total_submitted": 50097, "frontend_question_id": 699, "is_new_question": false }, @@ -42588,8 +42910,8 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 227952, - "total_submitted": 563398, + "total_acs": 228766, + "total_submitted": 566825, "frontend_question_id": 698, "is_new_question": false }, @@ -42611,8 +42933,8 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 172993, - "total_submitted": 309359, + "total_acs": 173760, + "total_submitted": 310781, "frontend_question_id": 697, "is_new_question": false }, @@ -42634,8 +42956,8 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 177974, - "total_submitted": 271311, + "total_acs": 178725, + "total_submitted": 272570, "frontend_question_id": 696, "is_new_question": false }, @@ -42657,8 +42979,8 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 664536, - "total_submitted": 926355, + "total_acs": 668919, + "total_submitted": 932237, "frontend_question_id": 695, "is_new_question": false }, @@ -42680,8 +43002,8 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 144235, - "total_submitted": 237670, + "total_acs": 144682, + "total_submitted": 238381, "frontend_question_id": 694, "is_new_question": false }, @@ -42703,8 +43025,8 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 107323, - "total_submitted": 174726, + "total_acs": 107844, + "total_submitted": 175523, "frontend_question_id": 693, "is_new_question": false }, @@ -42726,8 +43048,8 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 517021, - "total_submitted": 907733, + "total_acs": 519643, + "total_submitted": 911667, "frontend_question_id": 692, "is_new_question": false }, @@ -42749,8 +43071,8 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 36256, - "total_submitted": 78351, + "total_acs": 36399, + "total_submitted": 78659, "frontend_question_id": 691, "is_new_question": false }, @@ -42772,8 +43094,8 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 189724, - "total_submitted": 290276, + "total_acs": 190070, + "total_submitted": 290683, "frontend_question_id": 690, "is_new_question": false }, @@ -42795,8 +43117,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": 66001, - "total_submitted": 134907, + "total_acs": 66079, + "total_submitted": 135041, "frontend_question_id": 689, "is_new_question": false }, @@ -42818,8 +43140,8 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 91703, - "total_submitted": 175986, + "total_acs": 92089, + "total_submitted": 176737, "frontend_question_id": 688, "is_new_question": false }, @@ -42841,8 +43163,8 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 158474, - "total_submitted": 393598, + "total_acs": 159297, + "total_submitted": 395077, "frontend_question_id": 687, "is_new_question": false }, @@ -42864,8 +43186,8 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 134130, - "total_submitted": 393917, + "total_acs": 134396, + "total_submitted": 394764, "frontend_question_id": 686, "is_new_question": false }, @@ -42887,8 +43209,8 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 59170, - "total_submitted": 173194, + "total_acs": 59345, + "total_submitted": 173751, "frontend_question_id": 685, "is_new_question": false }, @@ -42910,8 +43232,8 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 256097, - "total_submitted": 412364, + "total_acs": 257758, + "total_submitted": 414899, "frontend_question_id": 684, "is_new_question": false }, @@ -42933,8 +43255,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 58634, - "total_submitted": 158774, + "total_acs": 58671, + "total_submitted": 158867, "frontend_question_id": 683, "is_new_question": false }, @@ -42956,8 +43278,8 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 230811, - "total_submitted": 312222, + "total_acs": 232330, + "total_submitted": 314117, "frontend_question_id": 682, "is_new_question": false }, @@ -42979,8 +43301,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 100831, - "total_submitted": 217349, + "total_acs": 100958, + "total_submitted": 217647, "frontend_question_id": 681, "is_new_question": false }, @@ -43002,8 +43324,8 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 568012, - "total_submitted": 1444969, + "total_acs": 570044, + "total_submitted": 1450390, "frontend_question_id": 680, "is_new_question": false }, @@ -43025,8 +43347,8 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 69602, - "total_submitted": 141581, + "total_acs": 69740, + "total_submitted": 141852, "frontend_question_id": 679, "is_new_question": false }, @@ -43048,8 +43370,8 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 196056, - "total_submitted": 576447, + "total_acs": 196835, + "total_submitted": 578566, "frontend_question_id": 678, "is_new_question": false }, @@ -43071,8 +43393,8 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 99825, - "total_submitted": 175584, + "total_acs": 100118, + "total_submitted": 176087, "frontend_question_id": 677, "is_new_question": false }, @@ -43094,8 +43416,8 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 69902, - "total_submitted": 122812, + "total_acs": 70071, + "total_submitted": 123081, "frontend_question_id": 676, "is_new_question": false }, @@ -43117,8 +43439,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 60893, - "total_submitted": 178453, + "total_acs": 60995, + "total_submitted": 178809, "frontend_question_id": 675, "is_new_question": false }, @@ -43140,8 +43462,8 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 217805, - "total_submitted": 442613, + "total_acs": 218452, + "total_submitted": 443885, "frontend_question_id": 674, "is_new_question": false }, @@ -43163,8 +43485,8 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 136139, - "total_submitted": 320188, + "total_acs": 136847, + "total_submitted": 321477, "frontend_question_id": 673, "is_new_question": false }, @@ -43186,8 +43508,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 18878, - "total_submitted": 37119, + "total_acs": 18937, + "total_submitted": 37251, "frontend_question_id": 672, "is_new_question": false }, @@ -43209,8 +43531,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": 162400, - "total_submitted": 368785, + "total_acs": 162989, + "total_submitted": 369966, "frontend_question_id": 671, "is_new_question": false }, @@ -43232,8 +43554,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 189364, - "total_submitted": 395403, + "total_acs": 189760, + "total_submitted": 396219, "frontend_question_id": 670, "is_new_question": false }, @@ -43255,8 +43577,8 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 257808, - "total_submitted": 388592, + "total_acs": 258457, + "total_submitted": 389606, "frontend_question_id": 669, "is_new_question": false }, @@ -43278,8 +43600,8 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 54151, - "total_submitted": 105000, + "total_acs": 54308, + "total_submitted": 105328, "frontend_question_id": 668, "is_new_question": false }, @@ -43301,8 +43623,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 49813, - "total_submitted": 83401, + "total_acs": 49876, + "total_submitted": 83483, "frontend_question_id": 667, "is_new_question": false }, @@ -43324,8 +43646,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 21067, - "total_submitted": 35539, + "total_acs": 21175, + "total_submitted": 35663, "frontend_question_id": 666, "is_new_question": false }, @@ -43347,8 +43669,8 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 235045, - "total_submitted": 970468, + "total_acs": 235512, + "total_submitted": 971981, "frontend_question_id": 665, "is_new_question": false }, @@ -43370,8 +43692,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 31020, - "total_submitted": 66296, + "total_acs": 31092, + "total_submitted": 66464, "frontend_question_id": 664, "is_new_question": false }, @@ -43393,8 +43715,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 28963, - "total_submitted": 69920, + "total_acs": 29013, + "total_submitted": 70056, "frontend_question_id": 663, "is_new_question": false }, @@ -43416,8 +43738,8 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 233694, - "total_submitted": 574765, + "total_acs": 234999, + "total_submitted": 577756, "frontend_question_id": 662, "is_new_question": false }, @@ -43439,8 +43761,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 70410, - "total_submitted": 127578, + "total_acs": 70570, + "total_submitted": 127826, "frontend_question_id": 661, "is_new_question": false }, @@ -43462,8 +43784,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 9941, - "total_submitted": 17492, + "total_acs": 10127, + "total_submitted": 17690, "frontend_question_id": 660, "is_new_question": false }, @@ -43485,8 +43807,8 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 120657, - "total_submitted": 237780, + "total_acs": 120988, + "total_submitted": 238307, "frontend_question_id": 659, "is_new_question": false }, @@ -43508,8 +43830,8 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 407710, - "total_submitted": 871768, + "total_acs": 409650, + "total_submitted": 875974, "frontend_question_id": 658, "is_new_question": false }, @@ -43531,8 +43853,8 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 358343, - "total_submitted": 475703, + "total_acs": 359353, + "total_submitted": 477055, "frontend_question_id": 657, "is_new_question": false }, @@ -43554,8 +43876,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 13176, - "total_submitted": 41594, + "total_acs": 13198, + "total_submitted": 41677, "frontend_question_id": 656, "is_new_question": false }, @@ -43577,8 +43899,8 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 57819, - "total_submitted": 93790, + "total_acs": 57967, + "total_submitted": 93975, "frontend_question_id": 655, "is_new_question": false }, @@ -43600,8 +43922,8 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 244263, - "total_submitted": 288675, + "total_acs": 245220, + "total_submitted": 289765, "frontend_question_id": 654, "is_new_question": false }, @@ -43623,8 +43945,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": 432040, - "total_submitted": 708089, + "total_acs": 434074, + "total_submitted": 711386, "frontend_question_id": 653, "is_new_question": false }, @@ -43646,8 +43968,8 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 179148, - "total_submitted": 317046, + "total_acs": 179649, + "total_submitted": 317888, "frontend_question_id": 652, "is_new_question": false }, @@ -43669,8 +43991,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 23409, - "total_submitted": 42947, + "total_acs": 23475, + "total_submitted": 43054, "frontend_question_id": 651, "is_new_question": false }, @@ -43692,8 +44014,8 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 112321, - "total_submitted": 210820, + "total_acs": 112632, + "total_submitted": 211315, "frontend_question_id": 650, "is_new_question": false }, @@ -43715,8 +44037,8 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 21947, - "total_submitted": 54245, + "total_acs": 22079, + "total_submitted": 54563, "frontend_question_id": 649, "is_new_question": false }, @@ -43738,8 +44060,8 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 113616, - "total_submitted": 181099, + "total_acs": 114127, + "total_submitted": 181926, "frontend_question_id": 648, "is_new_question": false }, @@ -43761,8 +44083,8 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 539535, - "total_submitted": 810302, + "total_acs": 541945, + "total_submitted": 813603, "frontend_question_id": 647, "is_new_question": false }, @@ -43784,8 +44106,8 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 128080, - "total_submitted": 226654, + "total_acs": 129319, + "total_submitted": 228982, "frontend_question_id": 646, "is_new_question": false }, @@ -43807,8 +44129,8 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 256337, - "total_submitted": 597222, + "total_acs": 257268, + "total_submitted": 599843, "frontend_question_id": 645, "is_new_question": false }, @@ -43830,8 +44152,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 18455, - "total_submitted": 51440, + "total_acs": 18489, + "total_submitted": 51538, "frontend_question_id": 644, "is_new_question": false }, @@ -43853,8 +44175,8 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 186253, - "total_submitted": 425073, + "total_acs": 188091, + "total_submitted": 429291, "frontend_question_id": 643, "is_new_question": false }, @@ -43876,8 +44198,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 127041, - "total_submitted": 260846, + "total_acs": 127286, + "total_submitted": 261379, "frontend_question_id": 642, "is_new_question": false }, @@ -43899,8 +44221,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 34942, - "total_submitted": 80523, + "total_acs": 35018, + "total_submitted": 80681, "frontend_question_id": 640, "is_new_question": false }, @@ -43922,8 +44244,8 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 65822, - "total_submitted": 216520, + "total_acs": 65958, + "total_submitted": 216919, "frontend_question_id": 639, "is_new_question": false }, @@ -43945,8 +44267,8 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 51043, - "total_submitted": 94860, + "total_acs": 51354, + "total_submitted": 95659, "frontend_question_id": 638, "is_new_question": false }, @@ -43968,8 +44290,8 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 375690, - "total_submitted": 523744, + "total_acs": 376961, + "total_submitted": 525411, "frontend_question_id": 637, "is_new_question": false }, @@ -43991,8 +44313,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 186476, - "total_submitted": 304987, + "total_acs": 186686, + "total_submitted": 305282, "frontend_question_id": 636, "is_new_question": false }, @@ -44014,8 +44336,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 32635, - "total_submitted": 51966, + "total_acs": 32695, + "total_submitted": 52047, "frontend_question_id": 635, "is_new_question": false }, @@ -44037,8 +44359,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 10089, - "total_submitted": 24039, + "total_acs": 10124, + "total_submitted": 24138, "frontend_question_id": 634, "is_new_question": false }, @@ -44060,8 +44382,8 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 161022, - "total_submitted": 466510, + "total_acs": 161874, + "total_submitted": 469316, "frontend_question_id": 633, "is_new_question": false }, @@ -44083,8 +44405,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": 80648, - "total_submitted": 132844, + "total_acs": 81003, + "total_submitted": 133404, "frontend_question_id": 632, "is_new_question": false }, @@ -44106,8 +44428,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 13203, - "total_submitted": 30382, + "total_acs": 13253, + "total_submitted": 30523, "frontend_question_id": 631, "is_new_question": false }, @@ -44129,8 +44451,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 99819, - "total_submitted": 248417, + "total_acs": 100010, + "total_submitted": 248926, "frontend_question_id": 630, "is_new_question": false }, @@ -44152,8 +44474,8 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 57703, - "total_submitted": 134919, + "total_acs": 57779, + "total_submitted": 135182, "frontend_question_id": 629, "is_new_question": false }, @@ -44175,8 +44497,8 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 248166, - "total_submitted": 536981, + "total_acs": 249423, + "total_submitted": 540023, "frontend_question_id": 628, "is_new_question": false }, @@ -44198,8 +44520,8 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 300520, - "total_submitted": 361375, + "total_acs": 304765, + "total_submitted": 366388, "frontend_question_id": 627, "is_new_question": false }, @@ -44221,8 +44543,8 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 125024, - "total_submitted": 177507, + "total_acs": 125870, + "total_submitted": 178904, "frontend_question_id": 626, "is_new_question": false }, @@ -44244,8 +44566,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 10539, - "total_submitted": 31459, + "total_acs": 10561, + "total_submitted": 31510, "frontend_question_id": 625, "is_new_question": false }, @@ -44267,8 +44589,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 36617, - "total_submitted": 87669, + "total_acs": 36665, + "total_submitted": 87766, "frontend_question_id": 624, "is_new_question": false }, @@ -44290,8 +44612,8 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 146380, - "total_submitted": 246165, + "total_acs": 146694, + "total_submitted": 246709, "frontend_question_id": 623, "is_new_question": false }, @@ -44313,8 +44635,8 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 405144, - "total_submitted": 723261, + "total_acs": 407218, + "total_submitted": 726364, "frontend_question_id": 621, "is_new_question": false }, @@ -44336,8 +44658,8 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 217379, - "total_submitted": 299116, + "total_acs": 218496, + "total_submitted": 301115, "frontend_question_id": 620, "is_new_question": false }, @@ -44359,8 +44681,8 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 57281, - "total_submitted": 116178, + "total_acs": 57716, + "total_submitted": 116748, "frontend_question_id": 619, "is_new_question": false }, @@ -44382,8 +44704,8 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 19667, - "total_submitted": 30703, + "total_acs": 19756, + "total_submitted": 30813, "frontend_question_id": 618, "is_new_question": false }, @@ -44405,8 +44727,8 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 652267, - "total_submitted": 829971, + "total_acs": 655136, + "total_submitted": 833473, "frontend_question_id": 617, "is_new_question": false }, @@ -44428,8 +44750,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 81476, - "total_submitted": 167124, + "total_acs": 81583, + "total_submitted": 167314, "frontend_question_id": 616, "is_new_question": false }, @@ -44451,8 +44773,8 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 30771, - "total_submitted": 53937, + "total_acs": 30886, + "total_submitted": 54151, "frontend_question_id": 615, "is_new_question": false }, @@ -44474,8 +44796,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 45838, - "total_submitted": 123142, + "total_acs": 46010, + "total_submitted": 123441, "frontend_question_id": 614, "is_new_question": false }, @@ -44497,8 +44819,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 60028, - "total_submitted": 73889, + "total_acs": 60342, + "total_submitted": 74285, "frontend_question_id": 613, "is_new_question": false }, @@ -44520,8 +44842,8 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 35005, - "total_submitted": 55459, + "total_acs": 35149, + "total_submitted": 55720, "frontend_question_id": 612, "is_new_question": false }, @@ -44543,8 +44865,8 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 162018, - "total_submitted": 321181, + "total_acs": 162668, + "total_submitted": 322368, "frontend_question_id": 611, "is_new_question": false }, @@ -44566,8 +44888,8 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 58442, - "total_submitted": 82306, + "total_acs": 58696, + "total_submitted": 82668, "frontend_question_id": 610, "is_new_question": false }, @@ -44589,8 +44911,8 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 142464, - "total_submitted": 210092, + "total_acs": 142657, + "total_submitted": 210431, "frontend_question_id": 609, "is_new_question": false }, @@ -44612,8 +44934,8 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 102400, - "total_submitted": 142418, + "total_acs": 104649, + "total_submitted": 145723, "frontend_question_id": 608, "is_new_question": false }, @@ -44635,8 +44957,8 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 119598, - "total_submitted": 168506, + "total_acs": 121949, + "total_submitted": 172459, "frontend_question_id": 607, "is_new_question": false }, @@ -44658,8 +44980,8 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 209402, - "total_submitted": 328379, + "total_acs": 210042, + "total_submitted": 329196, "frontend_question_id": 606, "is_new_question": false }, @@ -44681,8 +45003,8 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 338693, - "total_submitted": 1035295, + "total_acs": 340165, + "total_submitted": 1041033, "frontend_question_id": 605, "is_new_question": false }, @@ -44704,8 +45026,8 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 28752, - "total_submitted": 72826, + "total_acs": 28812, + "total_submitted": 73022, "frontend_question_id": 604, "is_new_question": false }, @@ -44727,8 +45049,8 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 70449, - "total_submitted": 103645, + "total_acs": 70853, + "total_submitted": 104296, "frontend_question_id": 603, "is_new_question": false }, @@ -44750,8 +45072,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": 55324, - "total_submitted": 90202, + "total_acs": 55530, + "total_submitted": 90570, "frontend_question_id": 602, "is_new_question": false }, @@ -44773,8 +45095,8 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 74316, - "total_submitted": 147254, + "total_acs": 74748, + "total_submitted": 148374, "frontend_question_id": 601, "is_new_question": false }, @@ -44796,8 +45118,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 33404, - "total_submitted": 85491, + "total_acs": 33616, + "total_submitted": 85954, "frontend_question_id": 600, "is_new_question": false }, @@ -44819,8 +45141,8 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 179524, - "total_submitted": 337536, + "total_acs": 180462, + "total_submitted": 338937, "frontend_question_id": 599, "is_new_question": false }, @@ -44842,8 +45164,8 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 85878, - "total_submitted": 155658, + "total_acs": 86262, + "total_submitted": 156250, "frontend_question_id": 598, "is_new_question": false }, @@ -44865,8 +45187,8 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 66227, - "total_submitted": 154987, + "total_acs": 66409, + "total_submitted": 155550, "frontend_question_id": 597, "is_new_question": false }, @@ -44888,8 +45210,8 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 223433, - "total_submitted": 471647, + "total_acs": 225113, + "total_submitted": 474422, "frontend_question_id": 596, "is_new_question": false }, @@ -44911,8 +45233,8 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 520637, - "total_submitted": 722938, + "total_acs": 529387, + "total_submitted": 736904, "frontend_question_id": 595, "is_new_question": false }, @@ -44934,8 +45256,8 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 129399, - "total_submitted": 242553, + "total_acs": 129864, + "total_submitted": 243299, "frontend_question_id": 594, "is_new_question": false }, @@ -44957,8 +45279,8 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 94729, - "total_submitted": 215177, + "total_acs": 95190, + "total_submitted": 216289, "frontend_question_id": 593, "is_new_question": false }, @@ -44980,8 +45302,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 31601, - "total_submitted": 60531, + "total_acs": 31692, + "total_submitted": 60657, "frontend_question_id": 592, "is_new_question": false }, @@ -45003,8 +45325,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 12689, - "total_submitted": 34148, + "total_acs": 12717, + "total_submitted": 34237, "frontend_question_id": 591, "is_new_question": false }, @@ -45026,8 +45348,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 82517, - "total_submitted": 169381, + "total_acs": 82737, + "total_submitted": 169842, "frontend_question_id": 588, "is_new_question": false }, @@ -45049,8 +45371,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 53156, - "total_submitted": 101591, + "total_acs": 53218, + "total_submitted": 101733, "frontend_question_id": 587, "is_new_question": false }, @@ -45072,8 +45394,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": 142419, - "total_submitted": 200665, + "total_acs": 144999, + "total_submitted": 205048, "frontend_question_id": 586, "is_new_question": false }, @@ -45095,8 +45417,8 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 37771, - "total_submitted": 71318, + "total_acs": 37969, + "total_submitted": 71819, "frontend_question_id": 585, "is_new_question": false }, @@ -45118,8 +45440,8 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 242596, - "total_submitted": 348063, + "total_acs": 249034, + "total_submitted": 357291, "frontend_question_id": 584, "is_new_question": false }, @@ -45141,8 +45463,8 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 194099, - "total_submitted": 325911, + "total_acs": 194930, + "total_submitted": 327185, "frontend_question_id": 583, "is_new_question": false }, @@ -45164,8 +45486,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 77409, - "total_submitted": 112834, + "total_acs": 77547, + "total_submitted": 113013, "frontend_question_id": 582, "is_new_question": false }, @@ -45187,8 +45509,8 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 294455, - "total_submitted": 810162, + "total_acs": 295282, + "total_submitted": 811930, "frontend_question_id": 581, "is_new_question": false }, @@ -45210,8 +45532,8 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 56457, - "total_submitted": 96465, + "total_acs": 56850, + "total_submitted": 97076, "frontend_question_id": 580, "is_new_question": false }, @@ -45233,8 +45555,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 29536, - "total_submitted": 65091, + "total_acs": 29627, + "total_submitted": 65267, "frontend_question_id": 579, "is_new_question": false }, @@ -45256,8 +45578,8 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 46475, - "total_submitted": 112844, + "total_acs": 46676, + "total_submitted": 113412, "frontend_question_id": 578, "is_new_question": false }, @@ -45279,8 +45601,8 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 68834, - "total_submitted": 91475, + "total_acs": 69147, + "total_submitted": 91915, "frontend_question_id": 577, "is_new_question": false }, @@ -45302,8 +45624,8 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 114002, - "total_submitted": 257378, + "total_acs": 114210, + "total_submitted": 257850, "frontend_question_id": 576, "is_new_question": false }, @@ -45325,8 +45647,8 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 231290, - "total_submitted": 349028, + "total_acs": 232224, + "total_submitted": 350316, "frontend_question_id": 575, "is_new_question": false }, @@ -45348,8 +45670,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 54222, - "total_submitted": 90530, + "total_acs": 54477, + "total_submitted": 90991, "frontend_question_id": 574, "is_new_question": false }, @@ -45371,8 +45693,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 17745, - "total_submitted": 32232, + "total_acs": 17775, + "total_submitted": 32272, "frontend_question_id": 573, "is_new_question": false }, @@ -45394,8 +45716,8 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 609312, - "total_submitted": 1320768, + "total_acs": 612951, + "total_submitted": 1327885, "frontend_question_id": 572, "is_new_question": false }, @@ -45417,8 +45739,8 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 23418, - "total_submitted": 52950, + "total_acs": 23562, + "total_submitted": 53346, "frontend_question_id": 571, "is_new_question": false }, @@ -45440,8 +45762,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": 73982, - "total_submitted": 110392, + "total_acs": 74454, + "total_submitted": 111189, "frontend_question_id": 570, "is_new_question": false }, @@ -45463,8 +45785,8 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 32908, - "total_submitted": 48439, + "total_acs": 33077, + "total_submitted": 48719, "frontend_question_id": 569, "is_new_question": false }, @@ -45486,8 +45808,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 35489, - "total_submitted": 79017, + "total_acs": 35543, + "total_submitted": 79086, "frontend_question_id": 568, "is_new_question": false }, @@ -45509,8 +45831,8 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 533641, - "total_submitted": 1226190, + "total_acs": 538525, + "total_submitted": 1238134, "frontend_question_id": 567, "is_new_question": false }, @@ -45532,8 +45854,8 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 316402, - "total_submitted": 504335, + "total_acs": 319477, + "total_submitted": 509106, "frontend_question_id": 566, "is_new_question": false }, @@ -45555,8 +45877,8 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 120168, - "total_submitted": 212969, + "total_acs": 120410, + "total_submitted": 213417, "frontend_question_id": 565, "is_new_question": false }, @@ -45578,8 +45900,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 36743, - "total_submitted": 167317, + "total_acs": 36864, + "total_submitted": 167901, "frontend_question_id": 564, "is_new_question": false }, @@ -45601,8 +45923,8 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 183507, - "total_submitted": 307572, + "total_acs": 184059, + "total_submitted": 308245, "frontend_question_id": 563, "is_new_question": false }, @@ -45624,8 +45946,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": 70789, - "total_submitted": 141221, + "total_acs": 70983, + "total_submitted": 141573, "frontend_question_id": 562, "is_new_question": false }, @@ -45647,8 +45969,8 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 377642, - "total_submitted": 491168, + "total_acs": 379522, + "total_submitted": 493341, "frontend_question_id": 561, "is_new_question": false }, @@ -45670,8 +45992,8 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 915813, - "total_submitted": 2088187, + "total_acs": 922231, + "total_submitted": 2103062, "frontend_question_id": 560, "is_new_question": false }, @@ -45693,8 +46015,8 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 639686, - "total_submitted": 782565, + "total_acs": 644474, + "total_submitted": 788138, "frontend_question_id": 557, "is_new_question": false }, @@ -45716,8 +46038,8 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 120754, - "total_submitted": 354459, + "total_acs": 121332, + "total_submitted": 356255, "frontend_question_id": 556, "is_new_question": false }, @@ -45739,8 +46061,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 6254, - "total_submitted": 14348, + "total_acs": 6274, + "total_submitted": 14384, "frontend_question_id": 555, "is_new_question": false }, @@ -45762,8 +46084,8 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 111497, - "total_submitted": 209119, + "total_acs": 111957, + "total_submitted": 209839, "frontend_question_id": 554, "is_new_question": false }, @@ -45785,8 +46107,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 34519, - "total_submitted": 57706, + "total_acs": 34606, + "total_submitted": 57840, "frontend_question_id": 553, "is_new_question": false }, @@ -45808,8 +46130,8 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 57659, - "total_submitted": 139587, + "total_acs": 57888, + "total_submitted": 140025, "frontend_question_id": 552, "is_new_question": false }, @@ -45831,8 +46153,8 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 168597, - "total_submitted": 350028, + "total_acs": 169428, + "total_submitted": 351640, "frontend_question_id": 551, "is_new_question": false }, @@ -45854,8 +46176,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 51236, - "total_submitted": 94708, + "total_acs": 51467, + "total_submitted": 95155, "frontend_question_id": 1730, "is_new_question": false }, @@ -45877,8 +46199,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 49294, - "total_submitted": 99692, + "total_acs": 49392, + "total_submitted": 99858, "frontend_question_id": 549, "is_new_question": false }, @@ -45900,8 +46222,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 23093, - "total_submitted": 46068, + "total_acs": 23109, + "total_submitted": 46095, "frontend_question_id": 548, "is_new_question": false }, @@ -45923,8 +46245,8 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 578889, - "total_submitted": 911705, + "total_acs": 582706, + "total_submitted": 917155, "frontend_question_id": 547, "is_new_question": false }, @@ -45946,8 +46268,8 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 38381, - "total_submitted": 80256, + "total_acs": 38482, + "total_submitted": 80481, "frontend_question_id": 546, "is_new_question": false }, @@ -45969,8 +46291,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 117588, - "total_submitted": 264883, + "total_acs": 117760, + "total_submitted": 265182, "frontend_question_id": 545, "is_new_question": false }, @@ -45992,8 +46314,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 25741, - "total_submitted": 33496, + "total_acs": 25775, + "total_submitted": 33532, "frontend_question_id": 544, "is_new_question": false }, @@ -46015,8 +46337,8 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 958636, - "total_submitted": 1701137, + "total_acs": 965875, + "total_submitted": 1711704, "frontend_question_id": 543, "is_new_question": false }, @@ -46038,8 +46360,8 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 344790, - "total_submitted": 776479, + "total_acs": 347931, + "total_submitted": 783005, "frontend_question_id": 542, "is_new_question": false }, @@ -46061,8 +46383,8 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 183399, - "total_submitted": 362542, + "total_acs": 184464, + "total_submitted": 364722, "frontend_question_id": 541, "is_new_question": false }, @@ -46084,8 +46406,8 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 355789, - "total_submitted": 608817, + "total_acs": 357736, + "total_submitted": 612344, "frontend_question_id": 540, "is_new_question": false }, @@ -46107,8 +46429,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 117776, - "total_submitted": 209259, + "total_acs": 118201, + "total_submitted": 210020, "frontend_question_id": 539, "is_new_question": false }, @@ -46130,8 +46452,8 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 260320, - "total_submitted": 385360, + "total_acs": 260888, + "total_submitted": 386041, "frontend_question_id": 538, "is_new_question": false }, @@ -46153,8 +46475,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 86102, - "total_submitted": 120621, + "total_acs": 86258, + "total_submitted": 120822, "frontend_question_id": 537, "is_new_question": false }, @@ -46176,8 +46498,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 82254, - "total_submitted": 146348, + "total_acs": 82355, + "total_submitted": 146499, "frontend_question_id": 536, "is_new_question": false }, @@ -46199,8 +46521,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 221533, - "total_submitted": 258025, + "total_acs": 222190, + "total_submitted": 258742, "frontend_question_id": 535, "is_new_question": false }, @@ -46222,8 +46544,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 12628, - "total_submitted": 26036, + "total_acs": 12645, + "total_submitted": 26065, "frontend_question_id": 533, "is_new_question": false }, @@ -46245,8 +46567,8 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 281599, - "total_submitted": 688473, + "total_acs": 282366, + "total_submitted": 689930, "frontend_question_id": 532, "is_new_question": false }, @@ -46268,8 +46590,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 38252, - "total_submitted": 61550, + "total_acs": 38331, + "total_submitted": 61719, "frontend_question_id": 531, "is_new_question": false }, @@ -46291,8 +46613,8 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 189393, - "total_submitted": 333377, + "total_acs": 190456, + "total_submitted": 335207, "frontend_question_id": 530, "is_new_question": false }, @@ -46314,8 +46636,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 131981, - "total_submitted": 201119, + "total_acs": 132331, + "total_submitted": 201581, "frontend_question_id": 529, "is_new_question": false }, @@ -46337,8 +46659,8 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 197765, - "total_submitted": 293081, + "total_acs": 198862, + "total_submitted": 294900, "frontend_question_id": 1721, "is_new_question": false }, @@ -46360,8 +46682,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 25631, - "total_submitted": 42356, + "total_acs": 25656, + "total_submitted": 42395, "frontend_question_id": 527, "is_new_question": false }, @@ -46383,8 +46705,8 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 146946, - "total_submitted": 227825, + "total_acs": 147389, + "total_submitted": 228493, "frontend_question_id": 526, "is_new_question": false }, @@ -46406,8 +46728,8 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 287755, - "total_submitted": 614332, + "total_acs": 288520, + "total_submitted": 616024, "frontend_question_id": 525, "is_new_question": false }, @@ -46429,8 +46751,8 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 137970, - "total_submitted": 269991, + "total_acs": 138276, + "total_submitted": 270715, "frontend_question_id": 524, "is_new_question": false }, @@ -46452,8 +46774,8 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 379704, - "total_submitted": 1330327, + "total_acs": 381375, + "total_submitted": 1336176, "frontend_question_id": 523, "is_new_question": false }, @@ -46475,8 +46797,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 46246, - "total_submitted": 114494, + "total_acs": 46321, + "total_submitted": 114656, "frontend_question_id": 522, "is_new_question": false }, @@ -46498,8 +46820,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 93308, - "total_submitted": 154644, + "total_acs": 93643, + "total_submitted": 155197, "frontend_question_id": 521, "is_new_question": false }, @@ -46521,8 +46843,8 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 376615, - "total_submitted": 659387, + "total_acs": 378659, + "total_submitted": 663086, "frontend_question_id": 520, "is_new_question": false }, @@ -46544,8 +46866,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": 1713, - "total_submitted": 3156, + "total_acs": 1732, + "total_submitted": 3200, "frontend_question_id": 1983, "is_new_question": false }, @@ -46567,8 +46889,8 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 381829, - "total_submitted": 634745, + "total_acs": 384138, + "total_submitted": 637991, "frontend_question_id": 518, "is_new_question": false }, @@ -46590,8 +46912,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 24688, - "total_submitted": 61456, + "total_acs": 24747, + "total_submitted": 61578, "frontend_question_id": 517, "is_new_question": false }, @@ -46613,8 +46935,8 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 315085, - "total_submitted": 518033, + "total_acs": 316641, + "total_submitted": 520299, "frontend_question_id": 516, "is_new_question": false }, @@ -46636,8 +46958,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": 218574, - "total_submitted": 338325, + "total_acs": 219331, + "total_submitted": 339469, "frontend_question_id": 515, "is_new_question": false }, @@ -46659,8 +46981,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 30900, - "total_submitted": 65948, + "total_acs": 31019, + "total_submitted": 66166, "frontend_question_id": 514, "is_new_question": false }, @@ -46682,8 +47004,8 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 202293, - "total_submitted": 303503, + "total_acs": 203208, + "total_submitted": 304713, "frontend_question_id": 513, "is_new_question": false }, @@ -46705,8 +47027,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 1977, - "total_submitted": 4818, + "total_acs": 2004, + "total_submitted": 4878, "frontend_question_id": 2036, "is_new_question": false }, @@ -46728,8 +47050,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": 49432, - "total_submitted": 124312, + "total_acs": 49609, + "total_submitted": 124990, "frontend_question_id": 1059, "is_new_question": false }, @@ -46751,8 +47073,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": 2610, - "total_submitted": 5005, + "total_acs": 2656, + "total_submitted": 5072, "frontend_question_id": 2031, "is_new_question": false }, @@ -46774,8 +47096,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 59363, - "total_submitted": 97217, + "total_acs": 59492, + "total_submitted": 97451, "frontend_question_id": 510, "is_new_question": false }, @@ -46797,8 +47119,8 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 122565, - "total_submitted": 189653, + "total_acs": 122928, + "total_submitted": 190148, "frontend_question_id": 508, "is_new_question": false }, @@ -46820,8 +47142,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 123886, - "total_submitted": 328273, + "total_acs": 124846, + "total_submitted": 330767, "frontend_question_id": 507, "is_new_question": false }, @@ -46843,8 +47165,8 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 113513, - "total_submitted": 190244, + "total_acs": 114314, + "total_submitted": 191231, "frontend_question_id": 506, "is_new_question": false }, @@ -46866,8 +47188,8 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 93136, - "total_submitted": 177610, + "total_acs": 93359, + "total_submitted": 177993, "frontend_question_id": 505, "is_new_question": false }, @@ -46889,8 +47211,8 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 100097, - "total_submitted": 207895, + "total_acs": 100721, + "total_submitted": 209045, "frontend_question_id": 504, "is_new_question": false }, @@ -46912,8 +47234,8 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 281137, - "total_submitted": 445172, + "total_acs": 283136, + "total_submitted": 448331, "frontend_question_id": 503, "is_new_question": false }, @@ -46935,8 +47257,8 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 40336, - "total_submitted": 89438, + "total_acs": 40700, + "total_submitted": 90233, "frontend_question_id": 502, "is_new_question": false }, @@ -46958,8 +47280,8 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 180830, - "total_submitted": 369359, + "total_acs": 181627, + "total_submitted": 370695, "frontend_question_id": 501, "is_new_question": false }, @@ -46981,8 +47303,8 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 175123, - "total_submitted": 252557, + "total_acs": 176089, + "total_submitted": 253846, "frontend_question_id": 500, "is_new_question": false }, @@ -47004,8 +47326,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 26456, - "total_submitted": 56183, + "total_acs": 26563, + "total_submitted": 56367, "frontend_question_id": 499, "is_new_question": false }, @@ -47027,8 +47349,8 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 235127, - "total_submitted": 403958, + "total_acs": 235939, + "total_submitted": 405309, "frontend_question_id": 498, "is_new_question": false }, @@ -47050,8 +47372,8 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 478796, - "total_submitted": 670135, + "total_acs": 483043, + "total_submitted": 675995, "frontend_question_id": 496, "is_new_question": false }, @@ -47073,8 +47395,8 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 116405, - "total_submitted": 204407, + "total_acs": 117168, + "total_submitted": 205757, "frontend_question_id": 495, "is_new_question": false }, @@ -47096,8 +47418,8 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 431648, - "total_submitted": 946255, + "total_acs": 433670, + "total_submitted": 950735, "frontend_question_id": 494, "is_new_question": false }, @@ -47119,8 +47441,8 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 113156, - "total_submitted": 367147, + "total_acs": 113952, + "total_submitted": 369643, "frontend_question_id": 493, "is_new_question": false }, @@ -47142,8 +47464,8 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 90676, - "total_submitted": 167653, + "total_acs": 91831, + "total_submitted": 169159, "frontend_question_id": 492, "is_new_question": false }, @@ -47165,8 +47487,8 @@ "question__title": "Non-decreasing Subsequences", "question__title_slug": "non-decreasing-subsequences", "question__hide": false, - "total_acs": 87130, - "total_submitted": 166579, + "total_acs": 142799, + "total_submitted": 237996, "frontend_question_id": 491, "is_new_question": false }, @@ -47188,8 +47510,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 136382, - "total_submitted": 245369, + "total_acs": 136947, + "total_submitted": 246220, "frontend_question_id": 490, "is_new_question": false }, @@ -47211,8 +47533,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 9518, - "total_submitted": 20266, + "total_acs": 9561, + "total_submitted": 20347, "frontend_question_id": 1643, "is_new_question": false }, @@ -47234,8 +47556,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 21108, - "total_submitted": 61665, + "total_acs": 21159, + "total_submitted": 61935, "frontend_question_id": 488, "is_new_question": false }, @@ -47257,8 +47579,8 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 116054, - "total_submitted": 233837, + "total_acs": 116633, + "total_submitted": 235085, "frontend_question_id": 487, "is_new_question": false }, @@ -47280,8 +47602,8 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 131057, - "total_submitted": 257498, + "total_acs": 131660, + "total_submitted": 258604, "frontend_question_id": 486, "is_new_question": false }, @@ -47303,8 +47625,8 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 803857, - "total_submitted": 1427698, + "total_acs": 808688, + "total_submitted": 1435374, "frontend_question_id": 485, "is_new_question": false }, @@ -47326,8 +47648,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 35593, - "total_submitted": 53162, + "total_acs": 35634, + "total_submitted": 53228, "frontend_question_id": 484, "is_new_question": false }, @@ -47349,8 +47671,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 18485, - "total_submitted": 47983, + "total_acs": 18522, + "total_submitted": 48061, "frontend_question_id": 483, "is_new_question": false }, @@ -47372,8 +47694,8 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 241132, - "total_submitted": 557579, + "total_acs": 241901, + "total_submitted": 559283, "frontend_question_id": 482, "is_new_question": false }, @@ -47395,8 +47717,8 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 30684, - "total_submitted": 60520, + "total_acs": 30938, + "total_submitted": 61024, "frontend_question_id": 481, "is_new_question": false }, @@ -47418,8 +47740,8 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 122579, - "total_submitted": 296186, + "total_acs": 123019, + "total_submitted": 297451, "frontend_question_id": 480, "is_new_question": false }, @@ -47441,8 +47763,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 21615, - "total_submitted": 67947, + "total_acs": 21655, + "total_submitted": 68022, "frontend_question_id": 479, "is_new_question": false }, @@ -47464,8 +47786,8 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 95198, - "total_submitted": 182535, + "total_acs": 95441, + "total_submitted": 183042, "frontend_question_id": 477, "is_new_question": false }, @@ -47487,8 +47809,8 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 286665, - "total_submitted": 426142, + "total_acs": 287520, + "total_submitted": 427311, "frontend_question_id": 476, "is_new_question": false }, @@ -47510,8 +47832,8 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 98212, - "total_submitted": 270737, + "total_acs": 98443, + "total_submitted": 271272, "frontend_question_id": 475, "is_new_question": false }, @@ -47533,8 +47855,8 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 163525, - "total_submitted": 350180, + "total_acs": 164021, + "total_submitted": 351146, "frontend_question_id": 474, "is_new_question": false }, @@ -47556,8 +47878,8 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 136619, - "total_submitted": 339267, + "total_acs": 136990, + "total_submitted": 340284, "frontend_question_id": 473, "is_new_question": false }, @@ -47579,8 +47901,8 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 159058, - "total_submitted": 346168, + "total_acs": 159416, + "total_submitted": 346766, "frontend_question_id": 472, "is_new_question": false }, @@ -47602,8 +47924,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 29567, - "total_submitted": 58409, + "total_acs": 29600, + "total_submitted": 58487, "frontend_question_id": 471, "is_new_question": false }, @@ -47625,8 +47947,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 9925, - "total_submitted": 25729, + "total_acs": 9935, + "total_submitted": 25745, "frontend_question_id": 469, "is_new_question": false }, @@ -47648,8 +47970,8 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 138820, - "total_submitted": 522336, + "total_acs": 139210, + "total_submitted": 523616, "frontend_question_id": 468, "is_new_question": false }, @@ -47671,8 +47993,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 38636, - "total_submitted": 100584, + "total_acs": 38730, + "total_submitted": 100749, "frontend_question_id": 467, "is_new_question": false }, @@ -47694,8 +48016,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 15436, - "total_submitted": 52645, + "total_acs": 15487, + "total_submitted": 52792, "frontend_question_id": 466, "is_new_question": false }, @@ -47717,8 +48039,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 77260, - "total_submitted": 156798, + "total_acs": 77428, + "total_submitted": 157133, "frontend_question_id": 465, "is_new_question": false }, @@ -47740,8 +48062,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 82449, - "total_submitted": 277282, + "total_acs": 82673, + "total_submitted": 278090, "frontend_question_id": 464, "is_new_question": false }, @@ -47763,8 +48085,8 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 414646, - "total_submitted": 595763, + "total_acs": 416250, + "total_submitted": 597998, "frontend_question_id": 463, "is_new_question": false }, @@ -47786,8 +48108,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": 156360, - "total_submitted": 260095, + "total_acs": 156774, + "total_submitted": 260787, "frontend_question_id": 462, "is_new_question": false }, @@ -47809,8 +48131,8 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 508481, - "total_submitted": 678782, + "total_acs": 509767, + "total_submitted": 680366, "frontend_question_id": 461, "is_new_question": false }, @@ -47832,8 +48154,8 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 175898, - "total_submitted": 434650, + "total_acs": 176333, + "total_submitted": 435775, "frontend_question_id": 460, "is_new_question": false }, @@ -47855,8 +48177,8 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 279686, - "total_submitted": 640165, + "total_acs": 280914, + "total_submitted": 642920, "frontend_question_id": 459, "is_new_question": false }, @@ -47878,8 +48200,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 72846, - "total_submitted": 114604, + "total_acs": 73028, + "total_submitted": 115152, "frontend_question_id": 458, "is_new_question": false }, @@ -47901,8 +48223,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 66859, - "total_submitted": 206359, + "total_acs": 67111, + "total_submitted": 206926, "frontend_question_id": 457, "is_new_question": false }, @@ -47924,8 +48246,8 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 162728, - "total_submitted": 501988, + "total_acs": 163236, + "total_submitted": 503591, "frontend_question_id": 456, "is_new_question": false }, @@ -47947,8 +48269,8 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 203957, - "total_submitted": 405882, + "total_acs": 205463, + "total_submitted": 409173, "frontend_question_id": 455, "is_new_question": false }, @@ -47970,8 +48292,8 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 282972, - "total_submitted": 494034, + "total_acs": 283940, + "total_submitted": 495799, "frontend_question_id": 454, "is_new_question": false }, @@ -47993,8 +48315,8 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 146672, - "total_submitted": 262551, + "total_acs": 147135, + "total_submitted": 263297, "frontend_question_id": 453, "is_new_question": false }, @@ -48016,8 +48338,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": 291984, - "total_submitted": 528224, + "total_acs": 293170, + "total_submitted": 530404, "frontend_question_id": 452, "is_new_question": false }, @@ -48039,8 +48361,8 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 481830, - "total_submitted": 688620, + "total_acs": 483809, + "total_submitted": 691269, "frontend_question_id": 451, "is_new_question": false }, @@ -48062,8 +48384,8 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 334575, - "total_submitted": 667873, + "total_acs": 336214, + "total_submitted": 670869, "frontend_question_id": 450, "is_new_question": false }, @@ -48085,8 +48407,8 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 212877, - "total_submitted": 374348, + "total_acs": 213332, + "total_submitted": 375080, "frontend_question_id": 449, "is_new_question": false }, @@ -48108,8 +48430,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": 682398, - "total_submitted": 1140813, + "total_acs": 686122, + "total_submitted": 1146704, "frontend_question_id": 448, "is_new_question": false }, @@ -48131,8 +48453,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 91135, - "total_submitted": 166458, + "total_acs": 91492, + "total_submitted": 166978, "frontend_question_id": 447, "is_new_question": false }, @@ -48154,8 +48476,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 72670, - "total_submitted": 155793, + "total_acs": 72829, + "total_submitted": 156085, "frontend_question_id": 446, "is_new_question": false }, @@ -48177,8 +48499,8 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 354887, - "total_submitted": 595633, + "total_acs": 355970, + "total_submitted": 597352, "frontend_question_id": 445, "is_new_question": false }, @@ -48200,8 +48522,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 49240, - "total_submitted": 185577, + "total_acs": 49325, + "total_submitted": 185717, "frontend_question_id": 444, "is_new_question": false }, @@ -48223,8 +48545,8 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 297256, - "total_submitted": 605513, + "total_acs": 298582, + "total_submitted": 607780, "frontend_question_id": 443, "is_new_question": false }, @@ -48246,8 +48568,8 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 484880, - "total_submitted": 660307, + "total_acs": 487645, + "total_submitted": 664093, "frontend_question_id": 442, "is_new_question": false }, @@ -48269,8 +48591,8 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 333003, - "total_submitted": 720617, + "total_acs": 334985, + "total_submitted": 724677, "frontend_question_id": 441, "is_new_question": false }, @@ -48292,8 +48614,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 19153, - "total_submitted": 61979, + "total_acs": 19337, + "total_submitted": 62388, "frontend_question_id": 440, "is_new_question": false }, @@ -48315,8 +48637,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 25965, - "total_submitted": 44555, + "total_acs": 26007, + "total_submitted": 44616, "frontend_question_id": 439, "is_new_question": false }, @@ -48338,8 +48660,8 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 658122, - "total_submitted": 1341464, + "total_acs": 662595, + "total_submitted": 1350302, "frontend_question_id": 438, "is_new_question": false }, @@ -48361,8 +48683,8 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 432389, - "total_submitted": 894119, + "total_acs": 434362, + "total_submitted": 899239, "frontend_question_id": 437, "is_new_question": false }, @@ -48384,8 +48706,8 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 89280, - "total_submitted": 176912, + "total_acs": 89618, + "total_submitted": 177428, "frontend_question_id": 436, "is_new_question": false }, @@ -48407,8 +48729,8 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 334510, - "total_submitted": 668325, + "total_acs": 336952, + "total_submitted": 672877, "frontend_question_id": 435, "is_new_question": false }, @@ -48430,8 +48752,8 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 135360, - "total_submitted": 360736, + "total_acs": 136131, + "total_submitted": 363106, "frontend_question_id": 434, "is_new_question": false }, @@ -48453,8 +48775,8 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 111404, - "total_submitted": 213523, + "total_acs": 111972, + "total_submitted": 214458, "frontend_question_id": 433, "is_new_question": false }, @@ -48476,8 +48798,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 66632, - "total_submitted": 181927, + "total_acs": 66780, + "total_submitted": 182465, "frontend_question_id": 432, "is_new_question": false }, @@ -48499,8 +48821,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 68467, - "total_submitted": 129961, + "total_acs": 68605, + "total_submitted": 130183, "frontend_question_id": 425, "is_new_question": false }, @@ -48522,8 +48844,8 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 391016, - "total_submitted": 757362, + "total_acs": 396607, + "total_submitted": 767632, "frontend_question_id": 424, "is_new_question": false }, @@ -48545,8 +48867,8 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 70172, - "total_submitted": 136770, + "total_acs": 70416, + "total_submitted": 137283, "frontend_question_id": 423, "is_new_question": false }, @@ -48568,8 +48890,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 43983, - "total_submitted": 112902, + "total_acs": 44116, + "total_submitted": 113174, "frontend_question_id": 422, "is_new_question": false }, @@ -48591,8 +48913,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": 136751, - "total_submitted": 251234, + "total_acs": 136996, + "total_submitted": 251875, "frontend_question_id": 421, "is_new_question": false }, @@ -48614,8 +48936,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 29980, - "total_submitted": 214220, + "total_acs": 30274, + "total_submitted": 216301, "frontend_question_id": 420, "is_new_question": false }, @@ -48637,8 +48959,8 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 175795, - "total_submitted": 235121, + "total_acs": 176307, + "total_submitted": 235737, "frontend_question_id": 419, "is_new_question": false }, @@ -48660,8 +48982,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 91528, - "total_submitted": 257388, + "total_acs": 91720, + "total_submitted": 257888, "frontend_question_id": 418, "is_new_question": false }, @@ -48683,8 +49005,8 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 330734, - "total_submitted": 610032, + "total_acs": 333193, + "total_submitted": 614360, "frontend_question_id": 417, "is_new_question": false }, @@ -48706,8 +49028,8 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 577484, - "total_submitted": 1243766, + "total_acs": 581441, + "total_submitted": 1252898, "frontend_question_id": 416, "is_new_question": false }, @@ -48729,8 +49051,8 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 540350, - "total_submitted": 1028159, + "total_acs": 542416, + "total_submitted": 1032599, "frontend_question_id": 415, "is_new_question": false }, @@ -48752,8 +49074,8 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 399914, - "total_submitted": 1217666, + "total_acs": 402319, + "total_submitted": 1223734, "frontend_question_id": 414, "is_new_question": false }, @@ -48775,8 +49097,8 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 263628, - "total_submitted": 404712, + "total_acs": 264655, + "total_submitted": 406513, "frontend_question_id": 413, "is_new_question": false }, @@ -48798,8 +49120,8 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 863381, - "total_submitted": 1244904, + "total_acs": 872266, + "total_submitted": 1255960, "frontend_question_id": 412, "is_new_question": false }, @@ -48821,8 +49143,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 14107, - "total_submitted": 35871, + "total_acs": 14112, + "total_submitted": 35887, "frontend_question_id": 411, "is_new_question": false }, @@ -48844,8 +49166,8 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 247817, - "total_submitted": 464484, + "total_acs": 248942, + "total_submitted": 466419, "frontend_question_id": 410, "is_new_question": false }, @@ -48867,8 +49189,8 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 448683, - "total_submitted": 823197, + "total_acs": 455271, + "total_submitted": 835687, "frontend_question_id": 409, "is_new_question": false }, @@ -48890,8 +49212,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 116067, - "total_submitted": 333116, + "total_acs": 116361, + "total_submitted": 333950, "frontend_question_id": 408, "is_new_question": false }, @@ -48913,8 +49235,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 76760, - "total_submitted": 161451, + "total_acs": 76939, + "total_submitted": 161821, "frontend_question_id": 407, "is_new_question": false }, @@ -48936,8 +49258,8 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 277318, - "total_submitted": 380627, + "total_acs": 277693, + "total_submitted": 381087, "frontend_question_id": 406, "is_new_question": false }, @@ -48959,8 +49281,8 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 113335, - "total_submitted": 244420, + "total_acs": 113914, + "total_submitted": 245574, "frontend_question_id": 405, "is_new_question": false }, @@ -48982,8 +49304,8 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 412493, - "total_submitted": 730600, + "total_acs": 414701, + "total_submitted": 734168, "frontend_question_id": 404, "is_new_question": false }, @@ -49005,8 +49327,8 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 174341, - "total_submitted": 403932, + "total_acs": 174754, + "total_submitted": 404919, "frontend_question_id": 403, "is_new_question": false }, @@ -49028,8 +49350,8 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 295575, - "total_submitted": 969055, + "total_acs": 296501, + "total_submitted": 972019, "frontend_question_id": 402, "is_new_question": false }, @@ -49051,8 +49373,8 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 120480, - "total_submitted": 232221, + "total_acs": 120909, + "total_submitted": 232806, "frontend_question_id": 401, "is_new_question": false }, @@ -49074,8 +49396,8 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 82696, - "total_submitted": 242412, + "total_acs": 82846, + "total_submitted": 242837, "frontend_question_id": 400, "is_new_question": false }, @@ -49097,8 +49419,8 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 322506, - "total_submitted": 541242, + "total_acs": 323536, + "total_submitted": 542946, "frontend_question_id": 399, "is_new_question": false }, @@ -49120,8 +49442,8 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 184394, - "total_submitted": 294324, + "total_acs": 184663, + "total_submitted": 294792, "frontend_question_id": 398, "is_new_question": false }, @@ -49143,8 +49465,8 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 94251, - "total_submitted": 267829, + "total_acs": 94582, + "total_submitted": 268842, "frontend_question_id": 397, "is_new_question": false }, @@ -49166,8 +49488,8 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 70599, - "total_submitted": 172697, + "total_acs": 70909, + "total_submitted": 173289, "frontend_question_id": 396, "is_new_question": false }, @@ -49189,8 +49511,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": 179745, - "total_submitted": 401255, + "total_acs": 180663, + "total_submitted": 403224, "frontend_question_id": 395, "is_new_question": false }, @@ -49212,8 +49534,8 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 604517, - "total_submitted": 1045492, + "total_acs": 608016, + "total_submitted": 1050705, "frontend_question_id": 394, "is_new_question": false }, @@ -49235,8 +49557,8 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 115205, - "total_submitted": 255247, + "total_acs": 115394, + "total_submitted": 255688, "frontend_question_id": 393, "is_new_question": false }, @@ -49258,8 +49580,8 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 726505, - "total_submitted": 1500883, + "total_acs": 737100, + "total_submitted": 1526306, "frontend_question_id": 392, "is_new_question": false }, @@ -49281,8 +49603,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 38081, - "total_submitted": 116292, + "total_acs": 38230, + "total_submitted": 116695, "frontend_question_id": 391, "is_new_question": false }, @@ -49304,8 +49626,8 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 54501, - "total_submitted": 117416, + "total_acs": 54823, + "total_submitted": 118256, "frontend_question_id": 390, "is_new_question": false }, @@ -49327,8 +49649,8 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 465135, - "total_submitted": 772737, + "total_acs": 467907, + "total_submitted": 777715, "frontend_question_id": 389, "is_new_question": false }, @@ -49350,8 +49672,8 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 139710, - "total_submitted": 299815, + "total_acs": 139941, + "total_submitted": 300267, "frontend_question_id": 388, "is_new_question": false }, @@ -49373,8 +49695,8 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 1320652, - "total_submitted": 2230351, + "total_acs": 1327925, + "total_submitted": 2240704, "frontend_question_id": 387, "is_new_question": false }, @@ -49396,8 +49718,8 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 96639, - "total_submitted": 158143, + "total_acs": 97177, + "total_submitted": 158841, "frontend_question_id": 386, "is_new_question": false }, @@ -49419,8 +49741,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 51211, - "total_submitted": 139598, + "total_acs": 51289, + "total_submitted": 139741, "frontend_question_id": 385, "is_new_question": false }, @@ -49442,8 +49764,8 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 293414, - "total_submitted": 507675, + "total_acs": 294428, + "total_submitted": 509427, "frontend_question_id": 384, "is_new_question": false }, @@ -49465,8 +49787,8 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 675535, - "total_submitted": 1168066, + "total_acs": 682785, + "total_submitted": 1179270, "frontend_question_id": 383, "is_new_question": false }, @@ -49488,8 +49810,8 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 163130, - "total_submitted": 273566, + "total_acs": 163469, + "total_submitted": 274063, "frontend_question_id": 382, "is_new_question": false }, @@ -49511,8 +49833,8 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 123517, - "total_submitted": 347126, + "total_acs": 123810, + "total_submitted": 348070, "frontend_question_id": 381, "is_new_question": false }, @@ -49534,8 +49856,8 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 598675, - "total_submitted": 1133075, + "total_acs": 600774, + "total_submitted": 1137155, "frontend_question_id": 380, "is_new_question": false }, @@ -49557,8 +49879,8 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 60196, - "total_submitted": 117936, + "total_acs": 60371, + "total_submitted": 118235, "frontend_question_id": 379, "is_new_question": false }, @@ -49580,8 +49902,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": 514861, - "total_submitted": 834204, + "total_acs": 516591, + "total_submitted": 836954, "frontend_question_id": 378, "is_new_question": false }, @@ -49603,8 +49925,8 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 342892, - "total_submitted": 657527, + "total_acs": 344180, + "total_submitted": 659885, "frontend_question_id": 377, "is_new_question": false }, @@ -49626,8 +49948,8 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 212813, - "total_submitted": 440882, + "total_acs": 213440, + "total_submitted": 442134, "frontend_question_id": 376, "is_new_question": false }, @@ -49649,8 +49971,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 102402, - "total_submitted": 219762, + "total_acs": 102684, + "total_submitted": 220214, "frontend_question_id": 375, "is_new_question": false }, @@ -49672,8 +49994,8 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 460610, - "total_submitted": 893787, + "total_acs": 463316, + "total_submitted": 898438, "frontend_question_id": 374, "is_new_question": false }, @@ -49695,8 +50017,8 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 191857, - "total_submitted": 501073, + "total_acs": 192361, + "total_submitted": 502436, "frontend_question_id": 373, "is_new_question": false }, @@ -49718,8 +50040,8 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 56184, - "total_submitted": 152404, + "total_acs": 56388, + "total_submitted": 153410, "frontend_question_id": 372, "is_new_question": false }, @@ -49741,8 +50063,8 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 359462, - "total_submitted": 709661, + "total_acs": 361477, + "total_submitted": 713718, "frontend_question_id": 371, "is_new_question": false }, @@ -49764,8 +50086,8 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 83929, - "total_submitted": 118198, + "total_acs": 84449, + "total_submitted": 118842, "frontend_question_id": 370, "is_new_question": false }, @@ -49787,8 +50109,8 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 73074, - "total_submitted": 119888, + "total_acs": 73239, + "total_submitted": 120109, "frontend_question_id": 369, "is_new_question": false }, @@ -49810,8 +50132,8 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 171531, - "total_submitted": 414570, + "total_acs": 172196, + "total_submitted": 415922, "frontend_question_id": 368, "is_new_question": false }, @@ -49833,8 +50155,8 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 448709, - "total_submitted": 1036152, + "total_acs": 451583, + "total_submitted": 1042557, "frontend_question_id": 367, "is_new_question": false }, @@ -49856,8 +50178,8 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 231184, - "total_submitted": 288100, + "total_acs": 231891, + "total_submitted": 288926, "frontend_question_id": 366, "is_new_question": false }, @@ -49879,8 +50201,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 76101, - "total_submitted": 205670, + "total_acs": 76464, + "total_submitted": 206310, "frontend_question_id": 365, "is_new_question": false }, @@ -49902,8 +50224,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 128206, - "total_submitted": 191962, + "total_acs": 128321, + "total_submitted": 192233, "frontend_question_id": 364, "is_new_question": false }, @@ -49925,8 +50247,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": 117089, - "total_submitted": 265840, + "total_acs": 117224, + "total_submitted": 266195, "frontend_question_id": 363, "is_new_question": false }, @@ -49948,8 +50270,8 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 196879, - "total_submitted": 287865, + "total_acs": 197759, + "total_submitted": 289183, "frontend_question_id": 362, "is_new_question": false }, @@ -49971,8 +50293,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 72305, - "total_submitted": 141541, + "total_acs": 72485, + "total_submitted": 141797, "frontend_question_id": 361, "is_new_question": false }, @@ -49994,8 +50316,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 60970, - "total_submitted": 111205, + "total_acs": 61085, + "total_submitted": 111368, "frontend_question_id": 360, "is_new_question": false }, @@ -50017,8 +50339,8 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 268177, - "total_submitted": 354861, + "total_acs": 268985, + "total_submitted": 355927, "frontend_question_id": 359, "is_new_question": false }, @@ -50040,8 +50362,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 56681, - "total_submitted": 150639, + "total_acs": 56821, + "total_submitted": 150918, "frontend_question_id": 358, "is_new_question": false }, @@ -50063,8 +50385,8 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 113485, - "total_submitted": 219637, + "total_acs": 113782, + "total_submitted": 220157, "frontend_question_id": 357, "is_new_question": false }, @@ -50086,8 +50408,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 33806, - "total_submitted": 97349, + "total_acs": 33900, + "total_submitted": 97562, "frontend_question_id": 356, "is_new_question": false }, @@ -50109,8 +50431,8 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 112731, - "total_submitted": 304563, + "total_acs": 113458, + "total_submitted": 306455, "frontend_question_id": 355, "is_new_question": false }, @@ -50132,8 +50454,8 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 183027, - "total_submitted": 480041, + "total_acs": 183449, + "total_submitted": 481445, "frontend_question_id": 354, "is_new_question": false }, @@ -50155,8 +50477,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 70223, - "total_submitted": 179250, + "total_acs": 70467, + "total_submitted": 179878, "frontend_question_id": 353, "is_new_question": false }, @@ -50178,8 +50500,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 56202, - "total_submitted": 108674, + "total_acs": 56346, + "total_submitted": 108882, "frontend_question_id": 352, "is_new_question": false }, @@ -50201,8 +50523,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 68233, - "total_submitted": 132681, + "total_acs": 68310, + "total_submitted": 132806, "frontend_question_id": 351, "is_new_question": false }, @@ -50224,8 +50546,8 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 985560, - "total_submitted": 1767399, + "total_acs": 992290, + "total_submitted": 1778306, "frontend_question_id": 350, "is_new_question": false }, @@ -50247,8 +50569,8 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 794586, - "total_submitted": 1125932, + "total_acs": 799399, + "total_submitted": 1131984, "frontend_question_id": 349, "is_new_question": false }, @@ -50270,8 +50592,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 205673, - "total_submitted": 357271, + "total_acs": 206101, + "total_submitted": 358042, "frontend_question_id": 348, "is_new_question": false }, @@ -50293,8 +50615,8 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 1283690, - "total_submitted": 1988836, + "total_acs": 1293909, + "total_submitted": 2006483, "frontend_question_id": 347, "is_new_question": false }, @@ -50316,8 +50638,8 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 299333, - "total_submitted": 388318, + "total_acs": 300325, + "total_submitted": 389578, "frontend_question_id": 346, "is_new_question": false }, @@ -50339,8 +50661,8 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 472227, - "total_submitted": 946627, + "total_acs": 474402, + "total_submitted": 950374, "frontend_question_id": 345, "is_new_question": false }, @@ -50362,8 +50684,8 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 1944599, - "total_submitted": 2544106, + "total_acs": 1957488, + "total_submitted": 2559737, "frontend_question_id": 344, "is_new_question": false }, @@ -50385,8 +50707,8 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 219537, - "total_submitted": 394456, + "total_acs": 220559, + "total_submitted": 395887, "frontend_question_id": 343, "is_new_question": false }, @@ -50408,8 +50730,8 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 428854, - "total_submitted": 934736, + "total_acs": 431436, + "total_submitted": 939563, "frontend_question_id": 342, "is_new_question": false }, @@ -50431,8 +50753,8 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 353687, - "total_submitted": 573466, + "total_acs": 354539, + "total_submitted": 574702, "frontend_question_id": 341, "is_new_question": false }, @@ -50454,8 +50776,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": 303299, - "total_submitted": 633220, + "total_acs": 304067, + "total_submitted": 634612, "frontend_question_id": 340, "is_new_question": false }, @@ -50477,8 +50799,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 220899, - "total_submitted": 268559, + "total_acs": 221220, + "total_submitted": 269014, "frontend_question_id": 339, "is_new_question": false }, @@ -50500,8 +50822,8 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 717065, - "total_submitted": 950096, + "total_acs": 721456, + "total_submitted": 955376, "frontend_question_id": 338, "is_new_question": false }, @@ -50523,8 +50845,8 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 323075, - "total_submitted": 599346, + "total_acs": 324168, + "total_submitted": 601342, "frontend_question_id": 337, "is_new_question": false }, @@ -50546,8 +50868,8 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 189095, - "total_submitted": 539430, + "total_acs": 189386, + "total_submitted": 540283, "frontend_question_id": 336, "is_new_question": false }, @@ -50569,8 +50891,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 29592, - "total_submitted": 100791, + "total_acs": 29644, + "total_submitted": 100890, "frontend_question_id": 335, "is_new_question": false }, @@ -50592,8 +50914,8 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 370670, - "total_submitted": 867494, + "total_acs": 372353, + "total_submitted": 871351, "frontend_question_id": 334, "is_new_question": false }, @@ -50615,8 +50937,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 93915, - "total_submitted": 220213, + "total_acs": 94102, + "total_submitted": 220575, "frontend_question_id": 333, "is_new_question": false }, @@ -50638,8 +50960,8 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 318447, - "total_submitted": 774780, + "total_acs": 319337, + "total_submitted": 776604, "frontend_question_id": 332, "is_new_question": false }, @@ -50661,8 +50983,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": 125752, - "total_submitted": 282754, + "total_acs": 125972, + "total_submitted": 283167, "frontend_question_id": 331, "is_new_question": false }, @@ -50684,8 +51006,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 60079, - "total_submitted": 149695, + "total_acs": 60177, + "total_submitted": 149882, "frontend_question_id": 330, "is_new_question": false }, @@ -50707,8 +51029,8 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 426517, - "total_submitted": 815177, + "total_acs": 428041, + "total_submitted": 817764, "frontend_question_id": 329, "is_new_question": false }, @@ -50730,8 +51052,8 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 682793, - "total_submitted": 1116018, + "total_acs": 686317, + "total_submitted": 1121630, "frontend_question_id": 328, "is_new_question": false }, @@ -50753,8 +51075,8 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 66578, - "total_submitted": 184785, + "total_acs": 66754, + "total_submitted": 185353, "frontend_question_id": 327, "is_new_question": false }, @@ -50776,8 +51098,8 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 636371, - "total_submitted": 1403702, + "total_acs": 640610, + "total_submitted": 1412207, "frontend_question_id": 326, "is_new_question": false }, @@ -50799,8 +51121,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 169317, - "total_submitted": 343779, + "total_acs": 169599, + "total_submitted": 344419, "frontend_question_id": 325, "is_new_question": false }, @@ -50822,8 +51144,8 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 136426, - "total_submitted": 411886, + "total_acs": 136857, + "total_submitted": 412988, "frontend_question_id": 324, "is_new_question": false }, @@ -50845,8 +51167,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": 317541, - "total_submitted": 510592, + "total_acs": 319214, + "total_submitted": 513212, "frontend_question_id": 323, "is_new_question": false }, @@ -50868,8 +51190,8 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 1294763, - "total_submitted": 3101041, + "total_acs": 1302256, + "total_submitted": 3115584, "frontend_question_id": 322, "is_new_question": false }, @@ -50891,8 +51213,8 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 53154, - "total_submitted": 183930, + "total_acs": 53290, + "total_submitted": 184201, "frontend_question_id": 321, "is_new_question": false }, @@ -50914,8 +51236,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 64448, - "total_submitted": 112117, + "total_acs": 64521, + "total_submitted": 112203, "frontend_question_id": 320, "is_new_question": false }, @@ -50937,8 +51259,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 127006, - "total_submitted": 263662, + "total_acs": 127345, + "total_submitted": 264267, "frontend_question_id": 319, "is_new_question": false }, @@ -50960,8 +51282,8 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 198355, - "total_submitted": 330662, + "total_acs": 198634, + "total_submitted": 331141, "frontend_question_id": 318, "is_new_question": false }, @@ -50983,8 +51305,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 151116, - "total_submitted": 353688, + "total_acs": 151336, + "total_submitted": 354323, "frontend_question_id": 317, "is_new_question": false }, @@ -51006,8 +51328,8 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 219625, - "total_submitted": 490806, + "total_acs": 220514, + "total_submitted": 492285, "frontend_question_id": 316, "is_new_question": false }, @@ -51029,8 +51351,8 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 285133, - "total_submitted": 667696, + "total_acs": 285790, + "total_submitted": 669558, "frontend_question_id": 315, "is_new_question": false }, @@ -51052,8 +51374,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 314563, - "total_submitted": 602672, + "total_acs": 315180, + "total_submitted": 603683, "frontend_question_id": 314, "is_new_question": false }, @@ -51075,8 +51397,8 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 114198, - "total_submitted": 250157, + "total_acs": 114444, + "total_submitted": 250782, "frontend_question_id": 313, "is_new_question": false }, @@ -51098,8 +51420,8 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 217048, - "total_submitted": 381873, + "total_acs": 217947, + "total_submitted": 383271, "frontend_question_id": 312, "is_new_question": false }, @@ -51121,8 +51443,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 167861, - "total_submitted": 249623, + "total_acs": 168268, + "total_submitted": 250146, "frontend_question_id": 311, "is_new_question": false }, @@ -51144,8 +51466,8 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 235963, - "total_submitted": 612353, + "total_acs": 236998, + "total_submitted": 614857, "frontend_question_id": 310, "is_new_question": false }, @@ -51167,8 +51489,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": 381632, - "total_submitted": 682309, + "total_acs": 383549, + "total_submitted": 685214, "frontend_question_id": 309, "is_new_question": false }, @@ -51190,8 +51512,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 70871, - "total_submitted": 166351, + "total_acs": 70989, + "total_submitted": 166556, "frontend_question_id": 308, "is_new_question": false }, @@ -51213,8 +51535,8 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 240283, - "total_submitted": 590311, + "total_acs": 240756, + "total_submitted": 591536, "frontend_question_id": 307, "is_new_question": false }, @@ -51236,8 +51558,8 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 76438, - "total_submitted": 246608, + "total_acs": 76646, + "total_submitted": 247374, "frontend_question_id": 306, "is_new_question": false }, @@ -51259,8 +51581,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 124697, - "total_submitted": 316394, + "total_acs": 124919, + "total_submitted": 316927, "frontend_question_id": 305, "is_new_question": false }, @@ -51282,8 +51604,8 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 309971, - "total_submitted": 590815, + "total_acs": 311001, + "total_submitted": 592305, "frontend_question_id": 304, "is_new_question": false }, @@ -51305,8 +51627,8 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 411225, - "total_submitted": 701035, + "total_acs": 413380, + "total_submitted": 703455, "frontend_question_id": 303, "is_new_question": false }, @@ -51328,8 +51650,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 46815, - "total_submitted": 80191, + "total_acs": 46897, + "total_submitted": 80304, "frontend_question_id": 302, "is_new_question": false }, @@ -51351,8 +51673,8 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 375084, - "total_submitted": 795041, + "total_acs": 375703, + "total_submitted": 796175, "frontend_question_id": 301, "is_new_question": false }, @@ -51374,8 +51696,8 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 1129935, - "total_submitted": 2182801, + "total_acs": 1136160, + "total_submitted": 2193058, "frontend_question_id": 300, "is_new_question": false }, @@ -51397,8 +51719,8 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 324808, - "total_submitted": 662862, + "total_acs": 327134, + "total_submitted": 666561, "frontend_question_id": 299, "is_new_question": false }, @@ -51420,8 +51742,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 135764, - "total_submitted": 257917, + "total_acs": 135997, + "total_submitted": 258307, "frontend_question_id": 298, "is_new_question": false }, @@ -51443,8 +51765,8 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 712245, - "total_submitted": 1290498, + "total_acs": 714660, + "total_submitted": 1294320, "frontend_question_id": 297, "is_new_question": false }, @@ -51466,8 +51788,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 66063, - "total_submitted": 109958, + "total_acs": 66190, + "total_submitted": 110154, "frontend_question_id": 296, "is_new_question": false }, @@ -51489,8 +51811,8 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 600866, - "total_submitted": 1167076, + "total_acs": 603315, + "total_submitted": 1172054, "frontend_question_id": 295, "is_new_question": false }, @@ -51512,8 +51834,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 66833, - "total_submitted": 128858, + "total_acs": 66901, + "total_submitted": 128987, "frontend_question_id": 294, "is_new_question": false }, @@ -51535,8 +51857,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 62784, - "total_submitted": 99453, + "total_acs": 62884, + "total_submitted": 99588, "frontend_question_id": 293, "is_new_question": false }, @@ -51558,8 +51880,8 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 307809, - "total_submitted": 549817, + "total_acs": 308949, + "total_submitted": 551745, "frontend_question_id": 292, "is_new_question": false }, @@ -51581,8 +51903,8 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 66228, - "total_submitted": 140923, + "total_acs": 66347, + "total_submitted": 141133, "frontend_question_id": 291, "is_new_question": false }, @@ -51604,8 +51926,8 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 492053, - "total_submitted": 1180535, + "total_acs": 495950, + "total_submitted": 1190230, "frontend_question_id": 290, "is_new_question": false }, @@ -51627,8 +51949,8 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 379720, - "total_submitted": 567298, + "total_acs": 380717, + "total_submitted": 568583, "frontend_question_id": 289, "is_new_question": false }, @@ -51650,8 +51972,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 68410, - "total_submitted": 268880, + "total_acs": 68521, + "total_submitted": 269142, "frontend_question_id": 288, "is_new_question": false }, @@ -51673,8 +51995,8 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 1084005, - "total_submitted": 1833930, + "total_acs": 1090806, + "total_submitted": 1845658, "frontend_question_id": 287, "is_new_question": false }, @@ -51696,8 +52018,8 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 260666, - "total_submitted": 431886, + "total_acs": 261542, + "total_submitted": 433257, "frontend_question_id": 286, "is_new_question": false }, @@ -51719,8 +52041,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 295829, - "total_submitted": 609338, + "total_acs": 296555, + "total_submitted": 610566, "frontend_question_id": 285, "is_new_question": false }, @@ -51742,8 +52064,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 202685, - "total_submitted": 346809, + "total_acs": 203122, + "total_submitted": 347390, "frontend_question_id": 284, "is_new_question": false }, @@ -51765,8 +52087,8 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 2059309, - "total_submitted": 3354602, + "total_acs": 2073290, + "total_submitted": 3377079, "frontend_question_id": 283, "is_new_question": false }, @@ -51788,8 +52110,8 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 195311, - "total_submitted": 498474, + "total_acs": 195651, + "total_submitted": 499276, "frontend_question_id": 282, "is_new_question": false }, @@ -51811,8 +52133,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 85348, - "total_submitted": 136505, + "total_acs": 85519, + "total_submitted": 136700, "frontend_question_id": 281, "is_new_question": false }, @@ -51834,8 +52156,8 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 122057, - "total_submitted": 183464, + "total_acs": 122333, + "total_submitted": 183805, "frontend_question_id": 280, "is_new_question": false }, @@ -51857,8 +52179,8 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 636786, - "total_submitted": 1211131, + "total_acs": 638843, + "total_submitted": 1214908, "frontend_question_id": 279, "is_new_question": false }, @@ -51880,8 +52202,8 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 1352483, - "total_submitted": 3139219, + "total_acs": 1364658, + "total_submitted": 3165216, "frontend_question_id": 278, "is_new_question": false }, @@ -51903,8 +52225,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 242574, - "total_submitted": 521274, + "total_acs": 243170, + "total_submitted": 522388, "frontend_question_id": 277, "is_new_question": false }, @@ -51926,8 +52248,8 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 95469, - "total_submitted": 215472, + "total_acs": 95724, + "total_submitted": 215873, "frontend_question_id": 276, "is_new_question": false }, @@ -51949,8 +52271,8 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 171030, - "total_submitted": 456419, + "total_acs": 171372, + "total_submitted": 457256, "frontend_question_id": 275, "is_new_question": false }, @@ -51972,8 +52294,8 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 254364, - "total_submitted": 665028, + "total_acs": 254912, + "total_submitted": 666269, "frontend_question_id": 274, "is_new_question": false }, @@ -51995,8 +52317,8 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 335442, - "total_submitted": 1120795, + "total_acs": 335973, + "total_submitted": 1122338, "frontend_question_id": 273, "is_new_question": false }, @@ -52018,8 +52340,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 109202, - "total_submitted": 187180, + "total_acs": 109321, + "total_submitted": 187357, "frontend_question_id": 272, "is_new_question": false }, @@ -52041,8 +52363,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 131966, - "total_submitted": 312600, + "total_acs": 133078, + "total_submitted": 314608, "frontend_question_id": 271, "is_new_question": false }, @@ -52064,8 +52386,8 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 277729, - "total_submitted": 507978, + "total_acs": 278359, + "total_submitted": 509038, "frontend_question_id": 270, "is_new_question": false }, @@ -52087,8 +52409,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 327052, - "total_submitted": 926212, + "total_acs": 327901, + "total_submitted": 928675, "frontend_question_id": 269, "is_new_question": false }, @@ -52110,8 +52432,8 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 1362418, - "total_submitted": 2196930, + "total_acs": 1373104, + "total_submitted": 2211653, "frontend_question_id": 268, "is_new_question": false }, @@ -52133,8 +52455,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 59987, - "total_submitted": 147688, + "total_acs": 60170, + "total_submitted": 148046, "frontend_question_id": 267, "is_new_question": false }, @@ -52156,8 +52478,8 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 177541, - "total_submitted": 269224, + "total_acs": 177932, + "total_submitted": 269713, "frontend_question_id": 266, "is_new_question": false }, @@ -52179,8 +52501,8 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 106659, - "total_submitted": 202570, + "total_acs": 106974, + "total_submitted": 202978, "frontend_question_id": 265, "is_new_question": false }, @@ -52202,8 +52524,8 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 295087, - "total_submitted": 638922, + "total_acs": 295996, + "total_submitted": 640960, "frontend_question_id": 264, "is_new_question": false }, @@ -52225,8 +52547,8 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 403227, - "total_submitted": 949400, + "total_acs": 405149, + "total_submitted": 954556, "frontend_question_id": 263, "is_new_question": false }, @@ -52248,8 +52570,8 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 137467, - "total_submitted": 361298, + "total_acs": 138335, + "total_submitted": 364341, "frontend_question_id": 262, "is_new_question": false }, @@ -52271,8 +52593,8 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 324360, - "total_submitted": 690372, + "total_acs": 325842, + "total_submitted": 693184, "frontend_question_id": 261, "is_new_question": false }, @@ -52294,8 +52616,8 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 284022, - "total_submitted": 420453, + "total_acs": 285236, + "total_submitted": 422152, "frontend_question_id": 260, "is_new_question": false }, @@ -52317,8 +52639,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 131115, - "total_submitted": 258683, + "total_acs": 131540, + "total_submitted": 259538, "frontend_question_id": 259, "is_new_question": false }, @@ -52340,8 +52662,8 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 531934, - "total_submitted": 835398, + "total_acs": 535184, + "total_submitted": 839865, "frontend_question_id": 258, "is_new_question": false }, @@ -52363,8 +52685,8 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 588703, - "total_submitted": 965571, + "total_acs": 591176, + "total_submitted": 968782, "frontend_question_id": 257, "is_new_question": false }, @@ -52386,8 +52708,8 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 181313, - "total_submitted": 297914, + "total_acs": 181800, + "total_submitted": 298587, "frontend_question_id": 256, "is_new_question": false }, @@ -52409,8 +52731,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": 69319, - "total_submitted": 144022, + "total_acs": 69463, + "total_submitted": 144255, "frontend_question_id": 255, "is_new_question": false }, @@ -52432,8 +52754,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 117870, - "total_submitted": 240804, + "total_acs": 118113, + "total_submitted": 241230, "frontend_question_id": 254, "is_new_question": false }, @@ -52455,8 +52777,8 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 753203, - "total_submitted": 1490699, + "total_acs": 755582, + "total_submitted": 1495416, "frontend_question_id": 253, "is_new_question": false }, @@ -52478,8 +52800,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 325726, - "total_submitted": 570022, + "total_acs": 327366, + "total_submitted": 572781, "frontend_question_id": 252, "is_new_question": false }, @@ -52501,8 +52823,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 116652, - "total_submitted": 237908, + "total_acs": 116988, + "total_submitted": 238514, "frontend_question_id": 251, "is_new_question": false }, @@ -52524,8 +52846,8 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 135036, - "total_submitted": 244029, + "total_acs": 135421, + "total_submitted": 244665, "frontend_question_id": 250, "is_new_question": false }, @@ -52547,8 +52869,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 187634, - "total_submitted": 291819, + "total_acs": 187968, + "total_submitted": 292360, "frontend_question_id": 249, "is_new_question": false }, @@ -52570,8 +52892,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 35084, - "total_submitted": 83844, + "total_acs": 35127, + "total_submitted": 83926, "frontend_question_id": 248, "is_new_question": false }, @@ -52593,8 +52915,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 127342, - "total_submitted": 247259, + "total_acs": 127525, + "total_submitted": 247556, "frontend_question_id": 247, "is_new_question": false }, @@ -52616,8 +52938,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 156842, - "total_submitted": 328283, + "total_acs": 157118, + "total_submitted": 328884, "frontend_question_id": 246, "is_new_question": false }, @@ -52639,8 +52961,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 73264, - "total_submitted": 127327, + "total_acs": 73409, + "total_submitted": 127573, "frontend_question_id": 245, "is_new_question": false }, @@ -52662,8 +52984,8 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 145018, - "total_submitted": 238538, + "total_acs": 145194, + "total_submitted": 238823, "frontend_question_id": 244, "is_new_question": false }, @@ -52685,8 +53007,8 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 196594, - "total_submitted": 302592, + "total_acs": 197022, + "total_submitted": 303197, "frontend_question_id": 243, "is_new_question": false }, @@ -52708,8 +53030,8 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 1908545, - "total_submitted": 3034580, + "total_acs": 1929023, + "total_submitted": 3065798, "frontend_question_id": 242, "is_new_question": false }, @@ -52731,8 +53053,8 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 186715, - "total_submitted": 293820, + "total_acs": 187333, + "total_submitted": 294570, "frontend_question_id": 241, "is_new_question": false }, @@ -52754,8 +53076,8 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 752041, - "total_submitted": 1480632, + "total_acs": 755163, + "total_submitted": 1485856, "frontend_question_id": 240, "is_new_question": false }, @@ -52777,8 +53099,8 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 710571, - "total_submitted": 1528307, + "total_acs": 714461, + "total_submitted": 1537373, "frontend_question_id": 239, "is_new_question": false }, @@ -52800,8 +53122,8 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 1495736, - "total_submitted": 2304924, + "total_acs": 1506277, + "total_submitted": 2320230, "frontend_question_id": 238, "is_new_question": false }, @@ -52823,8 +53145,8 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 1011614, - "total_submitted": 1338573, + "total_acs": 1016154, + "total_submitted": 1343536, "frontend_question_id": 237, "is_new_question": false }, @@ -52846,8 +53168,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": 1236916, - "total_submitted": 2119549, + "total_acs": 1241610, + "total_submitted": 2125412, "frontend_question_id": 236, "is_new_question": false }, @@ -52869,8 +53191,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": 1085761, - "total_submitted": 1786100, + "total_acs": 1093872, + "total_submitted": 1796519, "frontend_question_id": 235, "is_new_question": false }, @@ -52892,8 +53214,8 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 1335273, - "total_submitted": 2678865, + "total_acs": 1345407, + "total_submitted": 2696406, "frontend_question_id": 234, "is_new_question": false }, @@ -52915,8 +53237,8 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 73119, - "total_submitted": 214510, + "total_acs": 73395, + "total_submitted": 215331, "frontend_question_id": 233, "is_new_question": false }, @@ -52938,8 +53260,8 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 601617, - "total_submitted": 959287, + "total_acs": 606461, + "total_submitted": 965891, "frontend_question_id": 232, "is_new_question": false }, @@ -52961,8 +53283,8 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 811041, - "total_submitted": 1769707, + "total_acs": 818196, + "total_submitted": 1784112, "frontend_question_id": 231, "is_new_question": false }, @@ -52984,8 +53306,8 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 1011065, - "total_submitted": 1450501, + "total_acs": 1017155, + "total_submitted": 1458100, "frontend_question_id": 230, "is_new_question": false }, @@ -53007,8 +53329,8 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 369914, - "total_submitted": 830259, + "total_acs": 372433, + "total_submitted": 834727, "frontend_question_id": 229, "is_new_question": false }, @@ -53030,8 +53352,8 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 329345, - "total_submitted": 700828, + "total_acs": 330832, + "total_submitted": 703792, "frontend_question_id": 228, "is_new_question": false }, @@ -53053,8 +53375,8 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 496236, - "total_submitted": 1172232, + "total_acs": 497801, + "total_submitted": 1175631, "frontend_question_id": 227, "is_new_question": false }, @@ -53076,8 +53398,8 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 1372786, - "total_submitted": 1863594, + "total_acs": 1383502, + "total_submitted": 1876251, "frontend_question_id": 226, "is_new_question": false }, @@ -53099,8 +53421,8 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 416597, - "total_submitted": 717050, + "total_acs": 419250, + "total_submitted": 720950, "frontend_question_id": 225, "is_new_question": false }, @@ -53122,8 +53444,8 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 366844, - "total_submitted": 866671, + "total_acs": 367932, + "total_submitted": 868873, "frontend_question_id": 224, "is_new_question": false }, @@ -53145,8 +53467,8 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 195355, - "total_submitted": 434067, + "total_acs": 195728, + "total_submitted": 434759, "frontend_question_id": 223, "is_new_question": false }, @@ -53168,8 +53490,8 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 523734, - "total_submitted": 872049, + "total_acs": 525426, + "total_submitted": 874001, "frontend_question_id": 222, "is_new_question": false }, @@ -53191,8 +53513,8 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 559616, - "total_submitted": 1251326, + "total_acs": 561189, + "total_submitted": 1254020, "frontend_question_id": 221, "is_new_question": false }, @@ -53214,8 +53536,8 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 223565, - "total_submitted": 1014618, + "total_acs": 224080, + "total_submitted": 1016212, "frontend_question_id": 220, "is_new_question": false }, @@ -53237,8 +53559,8 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 627335, - "total_submitted": 1479674, + "total_acs": 630737, + "total_submitted": 1486698, "frontend_question_id": 219, "is_new_question": false }, @@ -53260,8 +53582,8 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 257158, - "total_submitted": 616702, + "total_acs": 257762, + "total_submitted": 618071, "frontend_question_id": 218, "is_new_question": false }, @@ -53283,8 +53605,8 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 2392293, - "total_submitted": 3898050, + "total_acs": 2421848, + "total_submitted": 3944752, "frontend_question_id": 217, "is_new_question": false }, @@ -53306,8 +53628,8 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 381695, - "total_submitted": 566327, + "total_acs": 383327, + "total_submitted": 568561, "frontend_question_id": 216, "is_new_question": false }, @@ -53329,8 +53651,8 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 1649630, - "total_submitted": 2502694, + "total_acs": 1656420, + "total_submitted": 2511680, "frontend_question_id": 215, "is_new_question": false }, @@ -53352,8 +53674,8 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 150311, - "total_submitted": 466158, + "total_acs": 150690, + "total_submitted": 467317, "frontend_question_id": 214, "is_new_question": false }, @@ -53375,8 +53697,8 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 532468, - "total_submitted": 1303905, + "total_acs": 536085, + "total_submitted": 1312122, "frontend_question_id": 213, "is_new_question": false }, @@ -53398,8 +53720,8 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 537971, - "total_submitted": 1467015, + "total_acs": 539590, + "total_submitted": 1472656, "frontend_question_id": 212, "is_new_question": false }, @@ -53421,8 +53743,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": 460795, - "total_submitted": 1073105, + "total_acs": 462538, + "total_submitted": 1076998, "frontend_question_id": 211, "is_new_question": false }, @@ -53444,8 +53766,8 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 769898, - "total_submitted": 1596185, + "total_acs": 773774, + "total_submitted": 1603242, "frontend_question_id": 210, "is_new_question": false }, @@ -53467,8 +53789,8 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 649118, - "total_submitted": 1451773, + "total_acs": 653207, + "total_submitted": 1459624, "frontend_question_id": 209, "is_new_question": false }, @@ -53490,8 +53812,8 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 724033, - "total_submitted": 1180867, + "total_acs": 727758, + "total_submitted": 1185804, "frontend_question_id": 208, "is_new_question": false }, @@ -53513,8 +53835,8 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 1097665, - "total_submitted": 2419864, + "total_acs": 1103733, + "total_submitted": 2433185, "frontend_question_id": 207, "is_new_question": false }, @@ -53536,8 +53858,8 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 2811406, - "total_submitted": 3854048, + "total_acs": 2835273, + "total_submitted": 3881947, "frontend_question_id": 206, "is_new_question": false }, @@ -53559,8 +53881,8 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 767335, - "total_submitted": 1797194, + "total_acs": 778303, + "total_submitted": 1822189, "frontend_question_id": 205, "is_new_question": false }, @@ -53582,8 +53904,8 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 694204, - "total_submitted": 2099532, + "total_acs": 697465, + "total_submitted": 2108845, "frontend_question_id": 204, "is_new_question": false }, @@ -53605,8 +53927,8 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 865933, - "total_submitted": 1911546, + "total_acs": 871416, + "total_submitted": 1919788, "frontend_question_id": 203, "is_new_question": false }, @@ -53628,8 +53950,8 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 1049516, - "total_submitted": 1921732, + "total_acs": 1058277, + "total_submitted": 1936607, "frontend_question_id": 202, "is_new_question": false }, @@ -53651,8 +53973,8 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 233590, - "total_submitted": 551102, + "total_acs": 234333, + "total_submitted": 552530, "frontend_question_id": 201, "is_new_question": false }, @@ -53674,8 +53996,8 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 2023969, - "total_submitted": 3574423, + "total_acs": 2035103, + "total_submitted": 3590834, "frontend_question_id": 200, "is_new_question": false }, @@ -53697,8 +54019,8 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 889502, - "total_submitted": 1448922, + "total_acs": 894172, + "total_submitted": 1455926, "frontend_question_id": 199, "is_new_question": false }, @@ -53720,8 +54042,8 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 1498216, - "total_submitted": 3044252, + "total_acs": 1507279, + "total_submitted": 3061085, "frontend_question_id": 198, "is_new_question": false }, @@ -53743,8 +54065,8 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 295149, - "total_submitted": 660830, + "total_acs": 298093, + "total_submitted": 667319, "frontend_question_id": 197, "is_new_question": false }, @@ -53766,8 +54088,8 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 332300, - "total_submitted": 556474, + "total_acs": 336638, + "total_submitted": 562525, "frontend_question_id": 196, "is_new_question": false }, @@ -53789,8 +54111,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 83033, - "total_submitted": 252024, + "total_acs": 83432, + "total_submitted": 253337, "frontend_question_id": 195, "is_new_question": false }, @@ -53812,8 +54134,8 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 20431, - "total_submitted": 80877, + "total_acs": 20501, + "total_submitted": 81088, "frontend_question_id": 194, "is_new_question": false }, @@ -53835,8 +54157,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 64351, - "total_submitted": 247265, + "total_acs": 64686, + "total_submitted": 248607, "frontend_question_id": 193, "is_new_question": false }, @@ -53858,8 +54180,8 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 41160, - "total_submitted": 160655, + "total_acs": 41285, + "total_submitted": 161205, "frontend_question_id": 192, "is_new_question": false }, @@ -53881,8 +54203,8 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 1009843, - "total_submitted": 1538594, + "total_acs": 1018797, + "total_submitted": 1548931, "frontend_question_id": 191, "is_new_question": false }, @@ -53904,8 +54226,8 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 582725, - "total_submitted": 1098491, + "total_acs": 586856, + "total_submitted": 1103436, "frontend_question_id": 190, "is_new_question": false }, @@ -53927,8 +54249,8 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 1376043, - "total_submitted": 3502668, + "total_acs": 1385522, + "total_submitted": 3525965, "frontend_question_id": 189, "is_new_question": false }, @@ -53950,8 +54272,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": 339283, - "total_submitted": 882913, + "total_acs": 340800, + "total_submitted": 885409, "frontend_question_id": 188, "is_new_question": false }, @@ -53973,8 +54295,8 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 308429, - "total_submitted": 662468, + "total_acs": 309871, + "total_submitted": 664812, "frontend_question_id": 187, "is_new_question": false }, @@ -53996,8 +54318,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 145014, - "total_submitted": 275409, + "total_acs": 145263, + "total_submitted": 275737, "frontend_question_id": 186, "is_new_question": false }, @@ -54019,8 +54341,8 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 202524, - "total_submitted": 402958, + "total_acs": 203744, + "total_submitted": 405281, "frontend_question_id": 185, "is_new_question": false }, @@ -54042,8 +54364,8 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 275128, - "total_submitted": 551801, + "total_acs": 277142, + "total_submitted": 555493, "frontend_question_id": 184, "is_new_question": false }, @@ -54065,8 +54387,8 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 543909, - "total_submitted": 795637, + "total_acs": 551409, + "total_submitted": 806051, "frontend_question_id": 183, "is_new_question": false }, @@ -54088,8 +54410,8 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 454929, - "total_submitted": 642745, + "total_acs": 459074, + "total_submitted": 648387, "frontend_question_id": 182, "is_new_question": false }, @@ -54111,8 +54433,8 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 447483, - "total_submitted": 650007, + "total_acs": 450775, + "total_submitted": 654657, "frontend_question_id": 181, "is_new_question": false }, @@ -54134,8 +54456,8 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 231700, - "total_submitted": 495789, + "total_acs": 233244, + "total_submitted": 499285, "frontend_question_id": 180, "is_new_question": false }, @@ -54157,8 +54479,8 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 371272, - "total_submitted": 1084079, + "total_acs": 373081, + "total_submitted": 1088290, "frontend_question_id": 179, "is_new_question": false }, @@ -54180,8 +54502,8 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 276013, - "total_submitted": 458523, + "total_acs": 277788, + "total_submitted": 461274, "frontend_question_id": 178, "is_new_question": false }, @@ -54203,8 +54525,8 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 285345, - "total_submitted": 761403, + "total_acs": 286690, + "total_submitted": 764782, "frontend_question_id": 177, "is_new_question": false }, @@ -54226,8 +54548,8 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 594894, - "total_submitted": 1608171, + "total_acs": 599501, + "total_submitted": 1617088, "frontend_question_id": 176, "is_new_question": false }, @@ -54249,8 +54571,8 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 690411, - "total_submitted": 938638, + "total_acs": 696856, + "total_submitted": 946215, "frontend_question_id": 175, "is_new_question": false }, @@ -54272,8 +54594,8 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 191735, - "total_submitted": 512910, + "total_acs": 192439, + "total_submitted": 514523, "frontend_question_id": 174, "is_new_question": false }, @@ -54295,8 +54617,8 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 648003, - "total_submitted": 933891, + "total_acs": 649823, + "total_submitted": 935956, "frontend_question_id": 173, "is_new_question": false }, @@ -54318,8 +54640,8 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 352629, - "total_submitted": 840562, + "total_acs": 354188, + "total_submitted": 843310, "frontend_question_id": 172, "is_new_question": false }, @@ -54341,8 +54663,8 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 567951, - "total_submitted": 921025, + "total_acs": 570587, + "total_submitted": 924597, "frontend_question_id": 171, "is_new_question": false }, @@ -54364,8 +54686,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 137627, - "total_submitted": 368291, + "total_acs": 138083, + "total_submitted": 369380, "frontend_question_id": 170, "is_new_question": false }, @@ -54387,8 +54709,8 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 1570723, - "total_submitted": 2457170, + "total_acs": 1582907, + "total_submitted": 2475759, "frontend_question_id": 169, "is_new_question": false }, @@ -54410,8 +54732,8 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 357330, - "total_submitted": 1019620, + "total_acs": 358977, + "total_submitted": 1022677, "frontend_question_id": 168, "is_new_question": false }, @@ -54433,8 +54755,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": 1336677, - "total_submitted": 2226070, + "total_acs": 1346682, + "total_submitted": 2242773, "frontend_question_id": 167, "is_new_question": false }, @@ -54456,8 +54778,8 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 200873, - "total_submitted": 830606, + "total_acs": 201593, + "total_submitted": 832829, "frontend_question_id": 166, "is_new_question": false }, @@ -54479,8 +54801,8 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 342198, - "total_submitted": 962712, + "total_acs": 342643, + "total_submitted": 963549, "frontend_question_id": 165, "is_new_question": false }, @@ -54502,8 +54824,8 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 159532, - "total_submitted": 371228, + "total_acs": 160247, + "total_submitted": 372587, "frontend_question_id": 164, "is_new_question": false }, @@ -54525,8 +54847,8 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 193089, - "total_submitted": 601493, + "total_acs": 193832, + "total_submitted": 603531, "frontend_question_id": 163, "is_new_question": false }, @@ -54548,8 +54870,8 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 949609, - "total_submitted": 2056973, + "total_acs": 954581, + "total_submitted": 2068658, "frontend_question_id": 162, "is_new_question": false }, @@ -54571,8 +54893,8 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 184989, - "total_submitted": 542074, + "total_acs": 185330, + "total_submitted": 543049, "frontend_question_id": 161, "is_new_question": false }, @@ -54594,8 +54916,8 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 1192130, - "total_submitted": 2218309, + "total_acs": 1198816, + "total_submitted": 2227555, "frontend_question_id": 160, "is_new_question": false }, @@ -54617,8 +54939,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": 221132, - "total_submitted": 412204, + "total_acs": 221722, + "total_submitted": 413121, "frontend_question_id": 159, "is_new_question": false }, @@ -54640,8 +54962,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": 173798, - "total_submitted": 418684, + "total_acs": 174042, + "total_submitted": 419048, "frontend_question_id": 158, "is_new_question": false }, @@ -54663,8 +54985,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 178177, - "total_submitted": 436180, + "total_acs": 178487, + "total_submitted": 436676, "frontend_question_id": 157, "is_new_question": false }, @@ -54686,8 +55008,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 95451, - "total_submitted": 154545, + "total_acs": 95593, + "total_submitted": 154702, "frontend_question_id": 156, "is_new_question": false }, @@ -54709,8 +55031,8 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 1183680, - "total_submitted": 2273505, + "total_acs": 1190224, + "total_submitted": 2284662, "frontend_question_id": 155, "is_new_question": false }, @@ -54732,8 +55054,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": 368634, - "total_submitted": 848114, + "total_acs": 369835, + "total_submitted": 851049, "frontend_question_id": 154, "is_new_question": false }, @@ -54755,8 +55077,8 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 1188178, - "total_submitted": 2441200, + "total_acs": 1196800, + "total_submitted": 2457900, "frontend_question_id": 153, "is_new_question": false }, @@ -54778,8 +55100,8 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 933068, - "total_submitted": 2673249, + "total_acs": 938594, + "total_submitted": 2689217, "frontend_question_id": 152, "is_new_question": false }, @@ -54801,8 +55123,8 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 874725, - "total_submitted": 2719229, + "total_acs": 878251, + "total_submitted": 2724084, "frontend_question_id": 151, "is_new_question": false }, @@ -54824,8 +55146,8 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 605315, - "total_submitted": 1342022, + "total_acs": 609896, + "total_submitted": 1349305, "frontend_question_id": 150, "is_new_question": false }, @@ -54847,8 +55169,8 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 325525, - "total_submitted": 1311507, + "total_acs": 327269, + "total_submitted": 1315320, "frontend_question_id": 149, "is_new_question": false }, @@ -54870,8 +55192,8 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 590039, - "total_submitted": 1080785, + "total_acs": 593266, + "total_submitted": 1085463, "frontend_question_id": 148, "is_new_question": false }, @@ -54893,8 +55215,8 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 311497, - "total_submitted": 616206, + "total_acs": 312497, + "total_submitted": 617442, "frontend_question_id": 147, "is_new_question": false }, @@ -54916,8 +55238,8 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 1246068, - "total_submitted": 3076778, + "total_acs": 1250434, + "total_submitted": 3086586, "frontend_question_id": 146, "is_new_question": false }, @@ -54939,8 +55261,8 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 890316, - "total_submitted": 1324017, + "total_acs": 895956, + "total_submitted": 1330566, "frontend_question_id": 145, "is_new_question": false }, @@ -54962,8 +55284,8 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 1237288, - "total_submitted": 1867410, + "total_acs": 1244435, + "total_submitted": 1875998, "frontend_question_id": 144, "is_new_question": false }, @@ -54985,8 +55307,8 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 618801, - "total_submitted": 1196124, + "total_acs": 622946, + "total_submitted": 1201905, "frontend_question_id": 143, "is_new_question": false }, @@ -55008,8 +55330,8 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 911124, - "total_submitted": 1940423, + "total_acs": 919509, + "total_submitted": 1954230, "frontend_question_id": 142, "is_new_question": false }, @@ -55031,8 +55353,8 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 1878305, - "total_submitted": 3984398, + "total_acs": 1893001, + "total_submitted": 4012049, "frontend_question_id": 141, "is_new_question": false }, @@ -55054,8 +55376,8 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 499111, - "total_submitted": 1112644, + "total_acs": 500380, + "total_submitted": 1114169, "frontend_question_id": 140, "is_new_question": false }, @@ -55077,8 +55399,8 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 1270909, - "total_submitted": 2792279, + "total_acs": 1275759, + "total_submitted": 2802165, "frontend_question_id": 139, "is_new_question": false }, @@ -55100,8 +55422,8 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 910375, - "total_submitted": 1788671, + "total_acs": 913475, + "total_submitted": 1792761, "frontend_question_id": 138, "is_new_question": false }, @@ -55123,8 +55445,8 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 391271, - "total_submitted": 673573, + "total_acs": 392969, + "total_submitted": 676065, "frontend_question_id": 137, "is_new_question": false }, @@ -55146,8 +55468,8 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 2006847, - "total_submitted": 2854173, + "total_acs": 2020366, + "total_submitted": 2871403, "frontend_question_id": 136, "is_new_question": false }, @@ -55169,8 +55491,8 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 294696, - "total_submitted": 721158, + "total_acs": 295645, + "total_submitted": 723254, "frontend_question_id": 135, "is_new_question": false }, @@ -55192,8 +55514,8 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 555436, - "total_submitted": 1208253, + "total_acs": 558828, + "total_submitted": 1215143, "frontend_question_id": 134, "is_new_question": false }, @@ -55215,8 +55537,8 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 888100, - "total_submitted": 1732082, + "total_acs": 892273, + "total_submitted": 1737295, "frontend_question_id": 133, "is_new_question": false }, @@ -55238,8 +55560,8 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 231472, - "total_submitted": 687043, + "total_acs": 232951, + "total_submitted": 691193, "frontend_question_id": 132, "is_new_question": false }, @@ -55261,8 +55583,8 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 555984, - "total_submitted": 883872, + "total_acs": 607307, + "total_submitted": 942755, "frontend_question_id": 131, "is_new_question": false }, @@ -55284,8 +55606,8 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 500552, - "total_submitted": 1376601, + "total_acs": 503281, + "total_submitted": 1382552, "frontend_question_id": 130, "is_new_question": false }, @@ -55307,8 +55629,8 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 525556, - "total_submitted": 890511, + "total_acs": 527315, + "total_submitted": 892864, "frontend_question_id": 129, "is_new_question": false }, @@ -55330,8 +55652,8 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 1009433, - "total_submitted": 2070085, + "total_acs": 1018341, + "total_submitted": 2089758, "frontend_question_id": 128, "is_new_question": false }, @@ -55353,8 +55675,8 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 877565, - "total_submitted": 2378999, + "total_acs": 880241, + "total_submitted": 2384015, "frontend_question_id": 127, "is_new_question": false }, @@ -55376,8 +55698,8 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 336217, - "total_submitted": 1220411, + "total_acs": 336688, + "total_submitted": 1222339, "frontend_question_id": 126, "is_new_question": false }, @@ -55399,8 +55721,8 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 1736509, - "total_submitted": 3948641, + "total_acs": 1753287, + "total_submitted": 3981412, "frontend_question_id": 125, "is_new_question": false }, @@ -55422,8 +55744,8 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 926650, - "total_submitted": 2369015, + "total_acs": 930730, + "total_submitted": 2378680, "frontend_question_id": 124, "is_new_question": false }, @@ -55445,8 +55767,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": 453467, - "total_submitted": 1004343, + "total_acs": 455427, + "total_submitted": 1007709, "frontend_question_id": 123, "is_new_question": false }, @@ -55468,8 +55790,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": 1354137, - "total_submitted": 2129552, + "total_acs": 1360314, + "total_submitted": 2138090, "frontend_question_id": 122, "is_new_question": false }, @@ -55491,8 +55813,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": 2964654, - "total_submitted": 5457882, + "total_acs": 2989802, + "total_submitted": 5508032, "frontend_question_id": 121, "is_new_question": false }, @@ -55514,8 +55836,8 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 555758, - "total_submitted": 1025565, + "total_acs": 558667, + "total_submitted": 1030072, "frontend_question_id": 120, "is_new_question": false }, @@ -55537,8 +55859,8 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 633822, - "total_submitted": 1053186, + "total_acs": 637510, + "total_submitted": 1058046, "frontend_question_id": 119, "is_new_question": false }, @@ -55560,8 +55882,8 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 1108305, - "total_submitted": 1585514, + "total_acs": 1118710, + "total_submitted": 1597587, "frontend_question_id": 118, "is_new_question": false }, @@ -55583,8 +55905,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": 530911, - "total_submitted": 1062733, + "total_acs": 532227, + "total_submitted": 1064597, "frontend_question_id": 117, "is_new_question": false }, @@ -55606,8 +55928,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": 882536, - "total_submitted": 1473702, + "total_acs": 886049, + "total_submitted": 1477937, "frontend_question_id": 116, "is_new_question": false }, @@ -55629,8 +55951,8 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 272510, - "total_submitted": 618481, + "total_acs": 274099, + "total_submitted": 621358, "frontend_question_id": 115, "is_new_question": false }, @@ -55652,8 +55974,8 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 743474, - "total_submitted": 1210163, + "total_acs": 745782, + "total_submitted": 1212885, "frontend_question_id": 114, "is_new_question": false }, @@ -55675,8 +55997,8 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 715393, - "total_submitted": 1258476, + "total_acs": 717738, + "total_submitted": 1261905, "frontend_question_id": 113, "is_new_question": false }, @@ -55698,8 +56020,8 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 1105971, - "total_submitted": 2309064, + "total_acs": 1111381, + "total_submitted": 2318177, "frontend_question_id": 112, "is_new_question": false }, @@ -55721,8 +56043,8 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 886364, - "total_submitted": 2017454, + "total_acs": 890503, + "total_submitted": 2024085, "frontend_question_id": 111, "is_new_question": false }, @@ -55744,8 +56066,8 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 1013648, - "total_submitted": 2089033, + "total_acs": 1021244, + "total_submitted": 2101824, "frontend_question_id": 110, "is_new_question": false }, @@ -55767,8 +56089,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": 413267, - "total_submitted": 717165, + "total_acs": 414262, + "total_submitted": 718411, "frontend_question_id": 109, "is_new_question": false }, @@ -55790,8 +56112,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": 931235, - "total_submitted": 1341713, + "total_acs": 936378, + "total_submitted": 1348154, "frontend_question_id": 108, "is_new_question": false }, @@ -55813,8 +56135,8 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 557354, - "total_submitted": 918283, + "total_acs": 558819, + "total_submitted": 920010, "frontend_question_id": 107, "is_new_question": false }, @@ -55836,8 +56158,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": 455684, - "total_submitted": 788435, + "total_acs": 457090, + "total_submitted": 790304, "frontend_question_id": 106, "is_new_question": false }, @@ -55859,8 +56181,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": 908769, - "total_submitted": 1486971, + "total_acs": 913195, + "total_submitted": 1493038, "frontend_question_id": 105, "is_new_question": false }, @@ -55882,8 +56204,8 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 2103642, - "total_submitted": 2869219, + "total_acs": 2117531, + "total_submitted": 2886936, "frontend_question_id": 104, "is_new_question": false }, @@ -55905,8 +56227,8 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 854992, - "total_submitted": 1541986, + "total_acs": 858892, + "total_submitted": 1547646, "frontend_question_id": 103, "is_new_question": false }, @@ -55928,8 +56250,8 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 1648834, - "total_submitted": 2587365, + "total_acs": 1660108, + "total_submitted": 2601769, "frontend_question_id": 102, "is_new_question": false }, @@ -55951,8 +56273,8 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 1484864, - "total_submitted": 2788689, + "total_acs": 1493090, + "total_submitted": 2801428, "frontend_question_id": 101, "is_new_question": false }, @@ -55974,8 +56296,8 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 1412752, - "total_submitted": 2449396, + "total_acs": 1422398, + "total_submitted": 2463230, "frontend_question_id": 100, "is_new_question": false }, @@ -55997,8 +56319,8 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 377277, - "total_submitted": 745446, + "total_acs": 378561, + "total_submitted": 747421, "frontend_question_id": 99, "is_new_question": false }, @@ -56020,8 +56342,8 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 1801877, - "total_submitted": 5657398, + "total_acs": 1812474, + "total_submitted": 5687533, "frontend_question_id": 98, "is_new_question": false }, @@ -56043,8 +56365,8 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 361196, - "total_submitted": 970514, + "total_acs": 362408, + "total_submitted": 973542, "frontend_question_id": 97, "is_new_question": false }, @@ -56066,8 +56388,8 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 547070, - "total_submitted": 920498, + "total_acs": 548975, + "total_submitted": 923196, "frontend_question_id": 96, "is_new_question": false }, @@ -56089,8 +56411,8 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 342225, - "total_submitted": 658642, + "total_acs": 343110, + "total_submitted": 659685, "frontend_question_id": 95, "is_new_question": false }, @@ -56112,8 +56434,8 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1869462, - "total_submitted": 2548183, + "total_acs": 1881125, + "total_submitted": 2561944, "frontend_question_id": 94, "is_new_question": false }, @@ -56135,8 +56457,8 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 336400, - "total_submitted": 765874, + "total_acs": 386788, + "total_submitted": 824367, "frontend_question_id": 93, "is_new_question": false }, @@ -56158,8 +56480,8 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 602804, - "total_submitted": 1327617, + "total_acs": 605218, + "total_submitted": 1332911, "frontend_question_id": 92, "is_new_question": false }, @@ -56181,8 +56503,8 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 966468, - "total_submitted": 2975997, + "total_acs": 970351, + "total_submitted": 2985017, "frontend_question_id": 91, "is_new_question": false }, @@ -56204,8 +56526,8 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 648647, - "total_submitted": 1166511, + "total_acs": 653149, + "total_submitted": 1173867, "frontend_question_id": 90, "is_new_question": false }, @@ -56227,8 +56549,8 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 253738, - "total_submitted": 446614, + "total_acs": 254381, + "total_submitted": 447402, "frontend_question_id": 89, "is_new_question": false }, @@ -56250,8 +56572,8 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 1838784, - "total_submitted": 3987202, + "total_acs": 1853177, + "total_submitted": 4012476, "frontend_question_id": 88, "is_new_question": false }, @@ -56273,8 +56595,8 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 159612, - "total_submitted": 442077, + "total_acs": 159974, + "total_submitted": 443128, "frontend_question_id": 87, "is_new_question": false }, @@ -56296,8 +56618,8 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 432522, - "total_submitted": 837218, + "total_acs": 433895, + "total_submitted": 839280, "frontend_question_id": 86, "is_new_question": false }, @@ -56319,8 +56641,8 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 331341, - "total_submitted": 746125, + "total_acs": 332371, + "total_submitted": 747752, "frontend_question_id": 85, "is_new_question": false }, @@ -56342,8 +56664,8 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 624330, - "total_submitted": 1474513, + "total_acs": 627834, + "total_submitted": 1481868, "frontend_question_id": 84, "is_new_question": false }, @@ -56365,8 +56687,8 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 1081131, - "total_submitted": 2154170, + "total_acs": 1089383, + "total_submitted": 2168214, "frontend_question_id": 83, "is_new_question": false }, @@ -56388,8 +56710,8 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 568936, - "total_submitted": 1246213, + "total_acs": 571338, + "total_submitted": 1250880, "frontend_question_id": 82, "is_new_question": false }, @@ -56411,8 +56733,8 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 485043, - "total_submitted": 1356616, + "total_acs": 486898, + "total_submitted": 1362186, "frontend_question_id": 81, "is_new_question": false }, @@ -56434,8 +56756,8 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 481775, - "total_submitted": 927715, + "total_acs": 483331, + "total_submitted": 929978, "frontend_question_id": 80, "is_new_question": false }, @@ -56457,8 +56779,8 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 1209486, - "total_submitted": 3013707, + "total_acs": 1215447, + "total_submitted": 3027252, "frontend_question_id": 79, "is_new_question": false }, @@ -56480,8 +56802,8 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 1344511, - "total_submitted": 1807869, + "total_acs": 1352729, + "total_submitted": 1817140, "frontend_question_id": 78, "is_new_question": false }, @@ -56503,8 +56825,8 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 628872, - "total_submitted": 945343, + "total_acs": 632158, + "total_submitted": 949399, "frontend_question_id": 77, "is_new_question": false }, @@ -56526,8 +56848,8 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 953674, - "total_submitted": 2338038, + "total_acs": 958111, + "total_submitted": 2348740, "frontend_question_id": 76, "is_new_question": false }, @@ -56549,8 +56871,8 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 1302689, - "total_submitted": 2253027, + "total_acs": 1312586, + "total_submitted": 2266466, "frontend_question_id": 75, "is_new_question": false }, @@ -56572,8 +56894,8 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 1099229, - "total_submitted": 2324839, + "total_acs": 1109694, + "total_submitted": 2344457, "frontend_question_id": 74, "is_new_question": false }, @@ -56595,8 +56917,8 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 906153, - "total_submitted": 1792139, + "total_acs": 912629, + "total_submitted": 1801992, "frontend_question_id": 73, "is_new_question": false }, @@ -56618,8 +56940,8 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 567990, - "total_submitted": 1072116, + "total_acs": 570862, + "total_submitted": 1076639, "frontend_question_id": 72, "is_new_question": false }, @@ -56641,8 +56963,8 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 482850, - "total_submitted": 1229857, + "total_acs": 484503, + "total_submitted": 1233743, "frontend_question_id": 71, "is_new_question": false }, @@ -56664,8 +56986,8 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 2143760, - "total_submitted": 4112376, + "total_acs": 2162139, + "total_submitted": 4146632, "frontend_question_id": 70, "is_new_question": false }, @@ -56687,8 +57009,8 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 1331789, - "total_submitted": 3580408, + "total_acs": 1343122, + "total_submitted": 3608334, "frontend_question_id": 69, "is_new_question": false }, @@ -56710,8 +57032,8 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 282651, - "total_submitted": 762450, + "total_acs": 283469, + "total_submitted": 763776, "frontend_question_id": 68, "is_new_question": false }, @@ -56733,8 +57055,8 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 1006652, - "total_submitted": 1955477, + "total_acs": 1013230, + "total_submitted": 1967458, "frontend_question_id": 67, "is_new_question": false }, @@ -56756,8 +57078,8 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 1525645, - "total_submitted": 3505687, + "total_acs": 1538975, + "total_submitted": 3533793, "frontend_question_id": 66, "is_new_question": false }, @@ -56779,8 +57101,8 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 296895, - "total_submitted": 1592187, + "total_acs": 297467, + "total_submitted": 1594749, "frontend_question_id": 65, "is_new_question": false }, @@ -56802,8 +57124,8 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 834860, - "total_submitted": 1371484, + "total_acs": 838410, + "total_submitted": 1376629, "frontend_question_id": 64, "is_new_question": false }, @@ -56825,8 +57147,8 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 641963, - "total_submitted": 1635563, + "total_acs": 644880, + "total_submitted": 1642085, "frontend_question_id": 63, "is_new_question": false }, @@ -56848,8 +57170,8 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 1274647, - "total_submitted": 2039790, + "total_acs": 1283410, + "total_submitted": 2053310, "frontend_question_id": 62, "is_new_question": false }, @@ -56871,8 +57193,8 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 675921, - "total_submitted": 1881081, + "total_acs": 679457, + "total_submitted": 1889870, "frontend_question_id": 61, "is_new_question": false }, @@ -56894,8 +57216,8 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 311783, - "total_submitted": 707696, + "total_acs": 313168, + "total_submitted": 709944, "frontend_question_id": 60, "is_new_question": false }, @@ -56917,8 +57239,8 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 415815, - "total_submitted": 620931, + "total_acs": 417741, + "total_submitted": 623250, "frontend_question_id": 59, "is_new_question": false }, @@ -56940,8 +57262,8 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 993565, - "total_submitted": 2384263, + "total_acs": 1005271, + "total_submitted": 2402152, "frontend_question_id": 58, "is_new_question": false }, @@ -56963,8 +57285,8 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 656088, - "total_submitted": 1724421, + "total_acs": 715136, + "total_submitted": 1837691, "frontend_question_id": 57, "is_new_question": false }, @@ -56986,8 +57308,8 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 1766334, - "total_submitted": 3835077, + "total_acs": 1776634, + "total_submitted": 3856038, "frontend_question_id": 56, "is_new_question": false }, @@ -57009,8 +57331,8 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 1295043, - "total_submitted": 3333198, + "total_acs": 1301904, + "total_submitted": 3349898, "frontend_question_id": 55, "is_new_question": false }, @@ -57032,8 +57354,8 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 940041, - "total_submitted": 2122858, + "total_acs": 947435, + "total_submitted": 2135400, "frontend_question_id": 54, "is_new_question": false }, @@ -57055,8 +57377,8 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 2945106, - "total_submitted": 5876941, + "total_acs": 2966282, + "total_submitted": 5916342, "frontend_question_id": 53, "is_new_question": false }, @@ -57078,8 +57400,8 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 294964, - "total_submitted": 413981, + "total_acs": 296216, + "total_submitted": 415430, "frontend_question_id": 52, "is_new_question": false }, @@ -57101,8 +57423,8 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 505720, - "total_submitted": 795650, + "total_acs": 508700, + "total_submitted": 799290, "frontend_question_id": 51, "is_new_question": false }, @@ -57124,8 +57446,8 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 1115538, - "total_submitted": 3392445, + "total_acs": 1122280, + "total_submitted": 3411185, "frontend_question_id": 50, "is_new_question": false }, @@ -57147,8 +57469,8 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 1802816, - "total_submitted": 2707331, + "total_acs": 1815727, + "total_submitted": 2725840, "frontend_question_id": 49, "is_new_question": false }, @@ -57170,8 +57492,8 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 1184143, - "total_submitted": 1681181, + "total_acs": 1192108, + "total_submitted": 1690637, "frontend_question_id": 48, "is_new_question": false }, @@ -57193,8 +57515,8 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 747594, - "total_submitted": 1311117, + "total_acs": 750774, + "total_submitted": 1315638, "frontend_question_id": 47, "is_new_question": false }, @@ -57216,8 +57538,8 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 1465351, - "total_submitted": 1948787, + "total_acs": 1474687, + "total_submitted": 1959370, "frontend_question_id": 46, "is_new_question": false }, @@ -57233,14 +57555,14 @@ { "stat": { "question_id": 45, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "jump-game-ii", + "question__article__has_video_solution": false, "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 767301, - "total_submitted": 1979572, + "total_acs": 771661, + "total_submitted": 1989895, "frontend_question_id": 45, "is_new_question": false }, @@ -57262,8 +57584,8 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 448433, - "total_submitted": 1669581, + "total_acs": 450286, + "total_submitted": 1675985, "frontend_question_id": 44, "is_new_question": false }, @@ -57285,8 +57607,8 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 618847, - "total_submitted": 1588309, + "total_acs": 622423, + "total_submitted": 1596746, "frontend_question_id": 43, "is_new_question": false }, @@ -57308,8 +57630,8 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 1429490, - "total_submitted": 2422486, + "total_acs": 1436806, + "total_submitted": 2433702, "frontend_question_id": 42, "is_new_question": false }, @@ -57331,8 +57653,8 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 821374, - "total_submitted": 2243813, + "total_acs": 825782, + "total_submitted": 2255037, "frontend_question_id": 41, "is_new_question": false }, @@ -57354,8 +57676,8 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 692590, - "total_submitted": 1297868, + "total_acs": 696883, + "total_submitted": 1305798, "frontend_question_id": 40, "is_new_question": false }, @@ -57377,8 +57699,8 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 1365884, - "total_submitted": 2004528, + "total_acs": 1374449, + "total_submitted": 2015134, "frontend_question_id": 39, "is_new_question": false }, @@ -57400,8 +57722,8 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 753602, - "total_submitted": 1459597, + "total_acs": 756441, + "total_submitted": 1463342, "frontend_question_id": 38, "is_new_question": false }, @@ -57423,8 +57745,8 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 428987, - "total_submitted": 749911, + "total_acs": 431330, + "total_submitted": 753143, "frontend_question_id": 37, "is_new_question": false }, @@ -57446,8 +57768,8 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 1002711, - "total_submitted": 1733312, + "total_acs": 1010687, + "total_submitted": 1746024, "frontend_question_id": 36, "is_new_question": false }, @@ -57469,8 +57791,8 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 1909212, - "total_submitted": 4513348, + "total_acs": 1926618, + "total_submitted": 4547742, "frontend_question_id": 35, "is_new_question": false }, @@ -57492,8 +57814,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": 1421705, - "total_submitted": 3410636, + "total_acs": 1430652, + "total_submitted": 3429948, "frontend_question_id": 34, "is_new_question": false }, @@ -57515,8 +57837,8 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 1878152, - "total_submitted": 4837576, + "total_acs": 1890128, + "total_submitted": 4866742, "frontend_question_id": 33, "is_new_question": false }, @@ -57538,8 +57860,8 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 589648, - "total_submitted": 1800481, + "total_acs": 591786, + "total_submitted": 1806889, "frontend_question_id": 32, "is_new_question": false }, @@ -57561,8 +57883,8 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 974885, - "total_submitted": 2614725, + "total_acs": 980065, + "total_submitted": 2626359, "frontend_question_id": 31, "is_new_question": false }, @@ -57584,8 +57906,8 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 330670, - "total_submitted": 1065476, + "total_acs": 331854, + "total_submitted": 1068747, "frontend_question_id": 30, "is_new_question": false }, @@ -57607,8 +57929,8 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 570751, - "total_submitted": 3307825, + "total_acs": 573397, + "total_submitted": 3326115, "frontend_question_id": 29, "is_new_question": false }, @@ -57630,8 +57952,8 @@ "question__title": "Find the Index of the First Occurrence in a String", "question__title_slug": "find-the-index-of-the-first-occurrence-in-a-string", "question__hide": false, - "total_acs": 1507278, - "total_submitted": 3979848, + "total_acs": 1515084, + "total_submitted": 3995813, "frontend_question_id": 28, "is_new_question": false }, @@ -57653,8 +57975,8 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 1621887, - "total_submitted": 3088399, + "total_acs": 1635191, + "total_submitted": 3110062, "frontend_question_id": 27, "is_new_question": false }, @@ -57676,8 +57998,8 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 2724440, - "total_submitted": 5326185, + "total_acs": 2744358, + "total_submitted": 5359371, "frontend_question_id": 26, "is_new_question": false }, @@ -57699,8 +58021,8 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 644465, - "total_submitted": 1191702, + "total_acs": 648284, + "total_submitted": 1197642, "frontend_question_id": 25, "is_new_question": false }, @@ -57722,8 +58044,8 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 1029246, - "total_submitted": 1691773, + "total_acs": 1034425, + "total_submitted": 1698614, "frontend_question_id": 24, "is_new_question": false }, @@ -57745,8 +58067,8 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 1502533, - "total_submitted": 3085197, + "total_acs": 1509016, + "total_submitted": 3094842, "frontend_question_id": 23, "is_new_question": false }, @@ -57768,8 +58090,8 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 1302184, - "total_submitted": 1804163, + "total_acs": 1310414, + "total_submitted": 1814323, "frontend_question_id": 22, "is_new_question": false }, @@ -57791,8 +58113,8 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 2917290, - "total_submitted": 4693988, + "total_acs": 2943403, + "total_submitted": 4731383, "frontend_question_id": 21, "is_new_question": false }, @@ -57814,8 +58136,8 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 2958579, - "total_submitted": 7313234, + "total_acs": 2984916, + "total_submitted": 7384473, "frontend_question_id": 20, "is_new_question": false }, @@ -57837,8 +58159,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": 1856067, - "total_submitted": 4592855, + "total_acs": 1869815, + "total_submitted": 4617056, "frontend_question_id": 19, "is_new_question": false }, @@ -57860,8 +58182,8 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 693464, - "total_submitted": 1915214, + "total_acs": 697013, + "total_submitted": 1927634, "frontend_question_id": 18, "is_new_question": false }, @@ -57883,8 +58205,8 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 1456068, - "total_submitted": 2599376, + "total_acs": 1463804, + "total_submitted": 2609947, "frontend_question_id": 17, "is_new_question": false }, @@ -57906,8 +58228,8 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 977422, - "total_submitted": 2125291, + "total_acs": 981676, + "total_submitted": 2136503, "frontend_question_id": 16, "is_new_question": false }, @@ -57929,8 +58251,8 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 2452996, - "total_submitted": 7572920, + "total_acs": 2469425, + "total_submitted": 7620171, "frontend_question_id": 15, "is_new_question": false }, @@ -57952,8 +58274,8 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 2114042, - "total_submitted": 5181950, + "total_acs": 2135070, + "total_submitted": 5233731, "frontend_question_id": 14, "is_new_question": false }, @@ -57975,8 +58297,8 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 2356931, - "total_submitted": 4048896, + "total_acs": 2382027, + "total_submitted": 4090578, "frontend_question_id": 13, "is_new_question": false }, @@ -57998,8 +58320,8 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 921828, - "total_submitted": 1493810, + "total_acs": 926982, + "total_submitted": 1501290, "frontend_question_id": 12, "is_new_question": false }, @@ -58021,8 +58343,8 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 1924213, - "total_submitted": 3550187, + "total_acs": 1937767, + "total_submitted": 3577094, "frontend_question_id": 11, "is_new_question": false }, @@ -58044,8 +58366,8 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 776532, - "total_submitted": 2753927, + "total_acs": 779228, + "total_submitted": 2767603, "frontend_question_id": 10, "is_new_question": false }, @@ -58067,8 +58389,8 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 2812653, - "total_submitted": 5289949, + "total_acs": 2841313, + "total_submitted": 5339002, "frontend_question_id": 9, "is_new_question": false }, @@ -58090,8 +58412,8 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 1177251, - "total_submitted": 7088598, + "total_acs": 1182950, + "total_submitted": 7124121, "frontend_question_id": 8, "is_new_question": false }, @@ -58113,8 +58435,8 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 2416550, - "total_submitted": 8844701, + "total_acs": 2430056, + "total_submitted": 8889503, "frontend_question_id": 7, "is_new_question": false }, @@ -58136,8 +58458,8 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 908850, - "total_submitted": 2092289, + "total_acs": 913644, + "total_submitted": 2100962, "frontend_question_id": 6, "is_new_question": false }, @@ -58159,8 +58481,8 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 2254130, - "total_submitted": 6956346, + "total_acs": 2266440, + "total_submitted": 6994288, "frontend_question_id": 5, "is_new_question": false }, @@ -58182,8 +58504,8 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 1744448, - "total_submitted": 4893648, + "total_acs": 1757503, + "total_submitted": 4920508, "frontend_question_id": 4, "is_new_question": false }, @@ -58205,8 +58527,8 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 4171159, - "total_submitted": 12339034, + "total_acs": 4197987, + "total_submitted": 12416782, "frontend_question_id": 3, "is_new_question": false }, @@ -58228,8 +58550,8 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 3360167, - "total_submitted": 8393199, + "total_acs": 3380348, + "total_submitted": 8435522, "frontend_question_id": 2, "is_new_question": false }, @@ -58251,8 +58573,8 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 8696972, - "total_submitted": 17648136, + "total_acs": 8774895, + "total_submitted": 17784489, "frontend_question_id": 1, "is_new_question": false }, diff --git a/leetcode/originData/[no content]count-the-number-of-good-subsequences.json b/leetcode/originData/[no content]count-the-number-of-good-subsequences.json new file mode 100644 index 00000000..7cd22215 --- /dev/null +++ b/leetcode/originData/[no content]count-the-number-of-good-subsequences.json @@ -0,0 +1,47 @@ +{ + "data": { + "question": { + "questionId": "2683", + "questionFrontendId": "2539", + "boundTopicId": null, + "title": "Count the Number of Good Subsequences", + "titleSlug": "count-the-number-of-good-subsequences", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 5, + "dislikes": 11, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Number of Music Playlists\", \"titleSlug\": \"number-of-music-playlists\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Count Ways to Build Rooms in an Ant Colony\", \"titleSlug\": \"count-ways-to-build-rooms-in-an-ant-colony\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "\"aabb\"\n\"leet\"\n\"abcd\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"222\", \"totalSubmission\": \"365\", \"totalAcceptedRaw\": 222, \"totalSubmissionRaw\": 365, \"acRate\": \"60.8%\"}", + "hints": [ + "Use the frequency array of characters of the string.", + "For 1 ≤ m ≤ s.length, count the number of subsequences of s where each character occurs exactly m times.", + "For any n and k, you can calculate (n choose k) mod p in O(log p) using binary exponentiation." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"aabb\"", + "metaData": "{\n \"name\": \"countGoodSubsequences\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

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

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

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

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

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

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

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

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

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

\\r\\n

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

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

Python 2.7.12.

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

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

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

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

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

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

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

Compiled with gcc 8.2 using the gnu11 standard.

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

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

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

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

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

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

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

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

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

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

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

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

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

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

C# 10 with .NET 6 runtime

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

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]time-taken-to-cross-the-door.json b/leetcode/originData/[no content]time-taken-to-cross-the-door.json new file mode 100644 index 00000000..ab395e7e --- /dev/null +++ b/leetcode/originData/[no content]time-taken-to-cross-the-door.json @@ -0,0 +1,65 @@ +{ + "data": { + "question": { + "questionId": "2617", + "questionFrontendId": "2534", + "boundTopicId": null, + "title": "Time Taken to Cross the Door", + "titleSlug": "time-taken-to-cross-the-door", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 4, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[{\"title\": \"The Latest Time to Catch a Bus\", \"titleSlug\": \"the-latest-time-to-catch-a-bus\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[0,1,1,2,4]\n[0,1,0,0,1]\n[0,0,0]\n[1,0,1]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Queue", + "slug": "queue", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Simulation", + "slug": "simulation", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"292\", \"totalSubmission\": \"403\", \"totalAcceptedRaw\": 292, \"totalSubmissionRaw\": 403, \"acRate\": \"72.5%\"}", + "hints": [ + "Use a queue to store the people who want to enter or exit and their corresponding times.", + "Simulate the process described in the statement and apply the 4 rules to the people crossing the door." + ], + "solution": null, + "status": null, + "sampleTestCase": "[0,1,1,2,4]\n[0,1,0,0,1]", + "metaData": "{\n \"name\": \"timeTaken\",\n \"params\": [\n {\n \"name\": \"arrival\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"state\"\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 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/alternating-digit-sum.json b/leetcode/originData/alternating-digit-sum.json new file mode 100644 index 00000000..49bbbff4 --- /dev/null +++ b/leetcode/originData/alternating-digit-sum.json @@ -0,0 +1,162 @@ +{ + "data": { + "question": { + "questionId": "2630", + "questionFrontendId": "2544", + "boundTopicId": null, + "title": "Alternating Digit Sum", + "titleSlug": "alternating-digit-sum", + "content": "

You are given a positive integer n. Each digit of n has a sign according to the following rules:

\n\n
    \n\t
  • The most significant digit is assigned a positive sign.
  • \n\t
  • Each other digit has an opposite sign to its adjacent digits.
  • \n
\n\n

Return the sum of all digits with their corresponding sign.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 521\nOutput: 4\nExplanation: (+5) + (-2) + (+1) = 4.\n
\n\n

Example 2:

\n\n
\nInput: n = 111\nOutput: 1\nExplanation: (+1) + (-1) + (+1) = 1.\n
\n\n

Example 3:

\n\n
\nInput: n = 886996\nOutput: 0\nExplanation: (+8) + (-8) + (+6) + (-9) + (+9) + (-6) = 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 109
  • \n
\n\n

 

\n\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 81, + "dislikes": 5, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Add Digits\", \"titleSlug\": \"add-digits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Sum of Four Digit Number After Splitting Digits\", \"titleSlug\": \"minimum-sum-of-four-digit-number-after-splitting-digits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "521\n111\n886996", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int alternateDigitSum(int n) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int alternateDigitSum(int n) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def alternateDigitSum(self, n):\n \"\"\"\n :type n: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def alternateDigitSum(self, n: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int alternateDigitSum(int n){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int AlternateDigitSum(int n) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @return {number}\n */\nvar alternateDigitSum = function(n) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @return {Integer}\ndef alternate_digit_sum(n)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func alternateDigitSum(_ n: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func alternateDigitSum(n int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def alternateDigitSum(n: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun alternateDigitSum(n: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn alternate_digit_sum(n: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @return Integer\n */\n function alternateDigitSum($n) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function alternateDigitSum(n: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (alternate-digit-sum n)\n (-> exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec alternate_digit_sum(N :: integer()) -> integer().\nalternate_digit_sum(N) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec alternate_digit_sum(n :: integer) :: integer\n def alternate_digit_sum(n) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int alternateDigitSum(int n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"26.2K\", \"totalAcceptedRaw\": 18188, \"totalSubmissionRaw\": 26184, \"acRate\": \"69.5%\"}", + "hints": [ + "The first step is to loop over the digits. We can convert the integer into a string, an array of digits, or just loop over its digits.", + "Keep a variable sign that initially equals 1 and a variable answer that initially equals 0.", + "Each time you loop over a digit i, add sign * i to answer, then multiply sign by -1." + ], + "solution": null, + "status": null, + "sampleTestCase": "521", + "metaData": "{\n \"name\": \"alternateDigitSum\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

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

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

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

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

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

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

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

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

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

\\r\\n

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

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

Python 2.7.12.

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

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

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

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

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

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

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

Compiled with gcc 8.2 using the gnu11 standard.

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

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

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

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

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

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

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

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

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

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

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

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

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

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

C# 10 with .NET 6 runtime

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

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/apply-bitwise-operations-to-make-strings-equal.json b/leetcode/originData/apply-bitwise-operations-to-make-strings-equal.json new file mode 100644 index 00000000..1cb3d61b --- /dev/null +++ b/leetcode/originData/apply-bitwise-operations-to-make-strings-equal.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "2632", + "questionFrontendId": "2546", + "boundTopicId": null, + "title": "Apply Bitwise Operations to Make Strings Equal", + "titleSlug": "apply-bitwise-operations-to-make-strings-equal", + "content": "

You are given two 0-indexed binary strings s and target of the same length n. You can do the following operation on s any number of times:

\n\n
    \n\t
  • Choose two different indices i and j where 0 <= i, j < n.
  • \n\t
  • Simultaneously, replace s[i] with (s[i] OR s[j]) and s[j] with (s[i] XOR s[j]).
  • \n
\n\n

For example, if s = "0110", you can choose i = 0 and j = 2, then simultaneously replace s[0] with (s[0] OR s[2] = 0 OR 1 = 1), and s[2] with (s[0] XOR s[2] = 0 XOR 1 = 1), so we will have s = "1110".

\n\n

Return true if you can make the string s equal to target, or false otherwise.

\n\n

 

\n

Example 1:

\n\n
\nInput: s = "1010", target = "0110"\nOutput: true\nExplanation: We can do the following operations:\n- Choose i = 2 and j = 0. We have now s = "0010".\n- Choose i = 2 and j = 1. We have now s = "0110".\nSince we can make s equal to target, we return true.\n
\n\n

Example 2:

\n\n
\nInput: s = "11", target = "00"\nOutput: false\nExplanation: It is not possible to make s equal to target with any number of operations.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == s.length == target.length
  • \n\t
  • 2 <= n <= 105
  • \n\t
  • s and target consist of only the digits 0 and 1.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 109, + "dislikes": 65, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Minimum One Bit Operations to Make Integers Zero\", \"titleSlug\": \"minimum-one-bit-operations-to-make-integers-zero\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "\"1010\"\n\"0110\"\n\"11\"\n\"00\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool makeStringsEqual(string s, string target) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean makeStringsEqual(String s, String target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def makeStringsEqual(self, s, target):\n \"\"\"\n :type s: str\n :type target: str\n :rtype: bool\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def makeStringsEqual(self, s: str, target: str) -> bool:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool makeStringsEqual(char * s, char * target){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool MakeStringsEqual(string s, string target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} s\n * @param {string} target\n * @return {boolean}\n */\nvar makeStringsEqual = function(s, target) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} s\n# @param {String} target\n# @return {Boolean}\ndef make_strings_equal(s, target)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func makeStringsEqual(_ s: String, _ target: String) -> Bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func makeStringsEqual(s string, target string) bool {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def makeStringsEqual(s: String, target: String): Boolean = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun makeStringsEqual(s: String, target: String): Boolean {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn make_strings_equal(s: String, target: String) -> bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $s\n * @param String $target\n * @return Boolean\n */\n function makeStringsEqual($s, $target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function makeStringsEqual(s: string, target: string): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (make-strings-equal s target)\n (-> string? string? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec make_strings_equal(S :: unicode:unicode_binary(), Target :: unicode:unicode_binary()) -> boolean().\nmake_strings_equal(S, Target) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec make_strings_equal(s :: String.t, target :: String.t) :: boolean\n def make_strings_equal(s, target) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool makeStringsEqual(String s, String target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"27.8K\", \"totalAcceptedRaw\": 10613, \"totalSubmissionRaw\": 27769, \"acRate\": \"38.2%\"}", + "hints": [ + "Think of when it is impossible to convert the string to the target.", + "If exactly one of the strings is having all 0’s, then it is impossible. And it is possible in all other cases. Why is that true?" + ], + "solution": null, + "status": null, + "sampleTestCase": "\"1010\"\n\"0110\"", + "metaData": "{\n \"name\": \"makeStringsEqual\",\n \"params\": [\n {\n \"name\": \"s\",\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 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/check-if-point-is-reachable.json b/leetcode/originData/check-if-point-is-reachable.json new file mode 100644 index 00000000..f1e4d1bd --- /dev/null +++ b/leetcode/originData/check-if-point-is-reachable.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "2635", + "questionFrontendId": "2543", + "boundTopicId": null, + "title": "Check if Point Is Reachable", + "titleSlug": "check-if-point-is-reachable", + "content": "

There exists an infinitely large grid. You are currently at point (1, 1), and you need to reach the point (targetX, targetY) using a finite number of steps.

\n\n

In one step, you can move from point (x, y) to any one of the following points:

\n\n
    \n\t
  • (x, y - x)
  • \n\t
  • (x - y, y)
  • \n\t
  • (2 * x, y)
  • \n\t
  • (x, 2 * y)
  • \n
\n\n

Given two integers targetX and targetY representing the X-coordinate and Y-coordinate of your final position, return true if you can reach the point from (1, 1) using some number of steps, and false otherwise.

\n\n

 

\n

Example 1:

\n\n
\nInput: targetX = 6, targetY = 9\nOutput: false\nExplanation: It is impossible to reach (6,9) from (1,1) using any sequence of moves, so false is returned.\n
\n\n

Example 2:

\n\n
\nInput: targetX = 4, targetY = 7\nOutput: true\nExplanation: You can follow the path (1,1) -> (1,2) -> (1,4) -> (1,8) -> (1,7) -> (2,7) -> (4,7).\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= targetX, targetY <= 109
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 96, + "dislikes": 26, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Reaching Points\", \"titleSlug\": \"reaching-points\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "6\n9\n4\n7", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool isReachable(int targetX, int targetY) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean isReachable(int targetX, int targetY) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def isReachable(self, targetX, targetY):\n \"\"\"\n :type targetX: int\n :type targetY: int\n :rtype: bool\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def isReachable(self, targetX: int, targetY: int) -> bool:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool isReachable(int targetX, int targetY){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool IsReachable(int targetX, int targetY) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} targetX\n * @param {number} targetY\n * @return {boolean}\n */\nvar isReachable = function(targetX, targetY) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} target_x\n# @param {Integer} target_y\n# @return {Boolean}\ndef is_reachable(target_x, target_y)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func isReachable(_ targetX: Int, _ targetY: Int) -> Bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func isReachable(targetX int, targetY int) bool {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def isReachable(targetX: Int, targetY: Int): Boolean = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun isReachable(targetX: Int, targetY: Int): Boolean {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn is_reachable(target_x: i32, target_y: i32) -> bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $targetX\n * @param Integer $targetY\n * @return Boolean\n */\n function isReachable($targetX, $targetY) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function isReachable(targetX: number, targetY: number): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (is-reachable targetX targetY)\n (-> exact-integer? exact-integer? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec is_reachable(TargetX :: integer(), TargetY :: integer()) -> boolean().\nis_reachable(TargetX, TargetY) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec is_reachable(target_x :: integer, target_y :: integer) :: boolean\n def is_reachable(target_x, target_y) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool isReachable(int targetX, int targetY) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"7.7K\", \"totalAcceptedRaw\": 2797, \"totalSubmissionRaw\": 7681, \"acRate\": \"36.4%\"}", + "hints": [ + "Let’s go in reverse order, from (targetX, targetY) to (1, 1). So, now we can move from (x, y) to (x+y, y), (x, y+x), (x/2, y) if x is even, and (x, y/2) if y is even.", + "When is it optimal to use the third and fourth operations?", + "Think how GCD of (x, y) is affected if we apply the first two operations.", + "How can we check if we can reach (1, 1) using the GCD value calculate above?" + ], + "solution": null, + "status": null, + "sampleTestCase": "6\n9", + "metaData": "{\n \"name\": \"isReachable\",\n \"params\": [\n {\n \"name\": \"targetX\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"targetY\"\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 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/count-the-number-of-good-subarrays.json b/leetcode/originData/count-the-number-of-good-subarrays.json new file mode 100644 index 00000000..81547462 --- /dev/null +++ b/leetcode/originData/count-the-number-of-good-subarrays.json @@ -0,0 +1,182 @@ +{ + "data": { + "question": { + "questionId": "2626", + "questionFrontendId": "2537", + "boundTopicId": null, + "title": "Count the Number of Good Subarrays", + "titleSlug": "count-the-number-of-good-subarrays", + "content": "

Given an integer array nums and an integer k, return the number of good subarrays of nums.

\n\n

A subarray arr is good if it there are at least k pairs of indices (i, j) such that i < j and arr[i] == arr[j].

\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,1,1,1,1], k = 10\nOutput: 1\nExplanation: The only good subarray is the array nums itself.\n
\n\n

Example 2:

\n\n
\nInput: nums = [3,1,4,3,2,2,4], k = 2\nOutput: 4\nExplanation: There are 4 different good subarrays:\n- [3,1,4,3,2,2] that has 2 pairs.\n- [3,1,4,3,2,2,4] that has 3 pairs.\n- [1,4,3,2,2,4] that has 2 pairs.\n- [4,3,2,2,4] that has 2 pairs.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i], k <= 109
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 421, + "dislikes": 14, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Count Number of Homogenous Substrings\", \"titleSlug\": \"count-number-of-homogenous-substrings\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Sum of Distinct Subarrays With Length K\", \"titleSlug\": \"maximum-sum-of-distinct-subarrays-with-length-k\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,1,1,1,1]\n10\n[3,1,4,3,2,2,4]\n2", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Sliding Window", + "slug": "sliding-window", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long countGood(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long countGood(int[] nums, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countGood(self, nums, k):\n \"\"\"\n :type nums: List[int]\n :type k: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countGood(self, nums: List[int], k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long countGood(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long CountGood(int[] nums, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar countGood = function(nums, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef count_good(nums, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countGood(_ nums: [Int], _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countGood(nums []int, k int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countGood(nums: Array[Int], k: Int): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countGood(nums: IntArray, k: Int): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_good(nums: Vec, k: i32) -> i64 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $k\n * @return Integer\n */\n function countGood($nums, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countGood(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-good nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_good(Nums :: [integer()], K :: integer()) -> integer().\ncount_good(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_good(nums :: [integer], k :: integer) :: integer\n def count_good(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int countGood(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"9.9K\", \"totalSubmission\": \"21.4K\", \"totalAcceptedRaw\": 9871, \"totalSubmissionRaw\": 21351, \"acRate\": \"46.2%\"}", + "hints": [ + "For a fixed index l, try to find the minimum value of index r, such that the subarray is not good", + "When a number is added to a subarray, it increases the number of pairs by its previous appearances.", + "When a number is removed from the subarray, it decreases the number of pairs by its remaining appearances.", + "Maintain 2-pointers l and r such that we can keep in account the number of equal pairs." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,1,1,1,1]\n10", + "metaData": "{\n \"name\": \"countGood\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "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 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/difference-between-element-sum-and-digit-sum-of-an-array.json b/leetcode/originData/difference-between-element-sum-and-digit-sum-of-an-array.json new file mode 100644 index 00000000..1a0f7ba8 --- /dev/null +++ b/leetcode/originData/difference-between-element-sum-and-digit-sum-of-an-array.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "2624", + "questionFrontendId": "2535", + "boundTopicId": null, + "title": "Difference Between Element Sum and Digit Sum of an Array", + "titleSlug": "difference-between-element-sum-and-digit-sum-of-an-array", + "content": "

You are given a positive integer array nums.

\n\n
    \n\t
  • The element sum is the sum of all the elements in nums.
  • \n\t
  • The digit sum is the sum of all the digits (not necessarily distinct) that appear in nums.
  • \n
\n\n

Return the absolute difference between the element sum and digit sum of nums.

\n\n

Note that the absolute difference between two integers x and y is defined as |x - y|.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,15,6,3]\nOutput: 9\nExplanation: \nThe element sum of nums is 1 + 15 + 6 + 3 = 25.\nThe digit sum of nums is 1 + 1 + 5 + 6 + 3 = 16.\nThe absolute difference between the element sum and digit sum is |25 - 16| = 9.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,3,4]\nOutput: 0\nExplanation:\nThe element sum of nums is 1 + 2 + 3 + 4 = 10.\nThe digit sum of nums is 1 + 2 + 3 + 4 = 10.\nThe absolute difference between the element sum and digit sum is |10 - 10| = 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 2000
  • \n\t
  • 1 <= nums[i] <= 2000
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 188, + "dislikes": 5, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Add Digits\", \"titleSlug\": \"add-digits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Sum of Four Digit Number After Splitting Digits\", \"titleSlug\": \"minimum-sum-of-four-digit-number-after-splitting-digits\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,15,6,3]\n[1,2,3,4]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int differenceOfSum(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int differenceOfSum(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def differenceOfSum(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def differenceOfSum(self, nums: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int differenceOfSum(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int DifferenceOfSum(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar differenceOfSum = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef difference_of_sum(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func differenceOfSum(_ nums: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func differenceOfSum(nums []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def differenceOfSum(nums: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun differenceOfSum(nums: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn difference_of_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 differenceOfSum($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function differenceOfSum(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (difference-of-sum nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec difference_of_sum(Nums :: [integer()]) -> integer().\ndifference_of_sum(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec difference_of_sum(nums :: [integer]) :: integer\n def difference_of_sum(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int differenceOfSum(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"30.6K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 30626, \"totalSubmissionRaw\": 34689, \"acRate\": \"88.3%\"}", + "hints": [ + "Use a simple for loop to iterate each number.", + "How you can get the digit for each number?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,15,6,3]", + "metaData": "{\n \"name\": \"differenceOfSum\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

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

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

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

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

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

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

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

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

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

\\r\\n

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

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

Python 2.7.12.

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

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

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

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

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

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

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

Compiled with gcc 8.2 using the gnu11 standard.

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

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

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

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

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

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

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

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

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

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

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

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

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

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

C# 10 with .NET 6 runtime

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

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/difference-between-maximum-and-minimum-price-sum.json b/leetcode/originData/difference-between-maximum-and-minimum-price-sum.json new file mode 100644 index 00000000..5ad6e7d0 --- /dev/null +++ b/leetcode/originData/difference-between-maximum-and-minimum-price-sum.json @@ -0,0 +1,183 @@ +{ + "data": { + "question": { + "questionId": "2627", + "questionFrontendId": "2538", + "boundTopicId": null, + "title": "Difference Between Maximum and Minimum Price Sum", + "titleSlug": "difference-between-maximum-and-minimum-price-sum", + "content": "

There exists an undirected and initially unrooted tree with n nodes indexed from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

\n\n

Each node has an associated price. You are given an integer array price, where price[i] is the price of the ith node.

\n\n

The price sum of a given path is the sum of the prices of all nodes lying on that path.

\n\n

The tree can be rooted at any node root of your choice. The incurred cost after choosing root is the difference between the maximum and minimum price sum amongst all paths starting at root.

\n\n

Return the maximum possible cost amongst all possible root choices.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: n = 6, edges = [[0,1],[1,2],[1,3],[3,4],[3,5]], price = [9,8,7,6,10,5]\nOutput: 24\nExplanation: The diagram above denotes the tree after rooting it at node 2. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.\n- The first path contains nodes [2,1,3,4]: the prices are [7,8,6,10], and the sum of the prices is 31.\n- The second path contains the node [2] with the price [7].\nThe difference between the maximum and minimum price sum is 24. It can be proved that 24 is the maximum cost.\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 3, edges = [[0,1],[1,2]], price = [1,1,1]\nOutput: 2\nExplanation: The diagram above denotes the tree after rooting it at node 0. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.\n- The first path contains nodes [0,1,2]: the prices are [1,1,1], and the sum of the prices is 3.\n- The second path contains node [0] with a price [1].\nThe difference between the maximum and minimum price sum is 2. It can be proved that 2 is the maximum cost.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • edges.length == n - 1
  • \n\t
  • 0 <= ai, bi <= n - 1
  • \n\t
  • edges represents a valid tree.
  • \n\t
  • price.length == n
  • \n\t
  • 1 <= price[i] <= 105
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 204, + "dislikes": 8, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Binary Tree Maximum Path Sum\", \"titleSlug\": \"binary-tree-maximum-path-sum\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "6\n[[0,1],[1,2],[1,3],[3,4],[3,5]]\n[9,8,7,6,10,5]\n3\n[[0,1],[1,2]]\n[1,1,1]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Tree", + "slug": "tree", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long maxOutput(int n, vector>& edges, vector& price) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long maxOutput(int n, int[][] edges, int[] price) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maxOutput(self, n, edges, price):\n \"\"\"\n :type n: int\n :type edges: List[List[int]]\n :type price: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maxOutput(self, n: int, edges: List[List[int]], price: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long maxOutput(int n, int** edges, int edgesSize, int* edgesColSize, int* price, int priceSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MaxOutput(int n, int[][] edges, int[] price) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} edges\n * @param {number[]} price\n * @return {number}\n */\nvar maxOutput = function(n, edges, price) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} edges\n# @param {Integer[]} price\n# @return {Integer}\ndef max_output(n, edges, price)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maxOutput(_ n: Int, _ edges: [[Int]], _ price: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maxOutput(n int, edges [][]int, price []int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maxOutput(n: Int, edges: Array[Array[Int]], price: Array[Int]): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maxOutput(n: Int, edges: Array, price: IntArray): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn max_output(n: i32, edges: Vec>, price: Vec) -> i64 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $edges\n * @param Integer[] $price\n * @return Integer\n */\n function maxOutput($n, $edges, $price) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maxOutput(n: number, edges: number[][], price: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (max-output n edges price)\n (-> exact-integer? (listof (listof exact-integer?)) (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec max_output(N :: integer(), Edges :: [[integer()]], Price :: [integer()]) -> integer().\nmax_output(N, Edges, Price) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec max_output(n :: integer, edges :: [[integer]], price :: [integer]) :: integer\n def max_output(n, edges, price) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maxOutput(int n, List> edges, List price) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 3999, \"totalSubmissionRaw\": 11584, \"acRate\": \"34.5%\"}", + "hints": [ + "The minimum price sum is always the price of a rooted node.", + "Let’s root the tree at vertex 0 and find the answer from this perspective.", + "In the optimal answer maximum price is the sum of the prices of nodes on the path from “u” to “v” where either “u” or “v” is the parent of the second one or neither is a parent of the second one.", + "The first case is easy to find. For the second case, notice that in the optimal path, “u” and “v” are both leaves. Then we can use dynamic programming to find such a path.", + "Let DP(v,1) denote “the maximum price sum from node v to leaf, where v is a parent of that leaf” and let DP(v,0) denote “the maximum price sum from node v to leaf, where v is a parent of that leaf - price[leaf]”. Then the answer is maximum of DP(u,0) + DP(v,1) + price[parent] where u, v are directly connected to vertex “parent”." + ], + "solution": null, + "status": null, + "sampleTestCase": "6\n[[0,1],[1,2],[1,3],[3,4],[3,5]]\n[9,8,7,6,10,5]", + "metaData": "{\n \"name\": \"maxOutput\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"edges\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"price\"\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 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/increment-submatrices-by-one.json b/leetcode/originData/increment-submatrices-by-one.json new file mode 100644 index 00000000..c3b005e6 --- /dev/null +++ b/leetcode/originData/increment-submatrices-by-one.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "2625", + "questionFrontendId": "2536", + "boundTopicId": null, + "title": "Increment Submatrices by One", + "titleSlug": "increment-submatrices-by-one", + "content": "

You are given a positive integer n, indicating that we initially have an n x n 0-indexed integer matrix mat filled with zeroes.

\n\n

You are also given a 2D integer array query. For each query[i] = [row1i, col1i, row2i, col2i], you should do the following operation:

\n\n
    \n\t
  • Add 1 to every element in the submatrix with the top left corner (row1i, col1i) and the bottom right corner (row2i, col2i). That is, add 1 to mat[x][y] for for all row1i <= x <= row2i and col1i <= y <= col2i.
  • \n
\n\n

Return the matrix mat after performing every query.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: n = 3, queries = [[1,1,2,2],[0,0,1,1]]\nOutput: [[1,1,0],[1,2,1],[0,1,1]]\nExplanation: The diagram above shows the initial matrix, the matrix after the first query, and the matrix after the second query.\n- In the first query, we add 1 to every element in the submatrix with the top left corner (1, 1) and bottom right corner (2, 2).\n- In the second query, we add 1 to every element in the submatrix with the top left corner (0, 0) and bottom right corner (1, 1).\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 2, queries = [[0,0,1,1]]\nOutput: [[1,1],[1,1]]\nExplanation: The diagram above shows the initial matrix and the matrix after the first query.\n- In the first query we add 1 to every element in the matrix.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 500
  • \n\t
  • 1 <= queries.length <= 104
  • \n\t
  • 0 <= row1i <= row2i < n
  • \n\t
  • 0 <= col1i <= col2i < n
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 302, + "dislikes": 53, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Range Sum Query 2D - Mutable\", \"titleSlug\": \"range-sum-query-2d-mutable\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Count Positions on Street With Required Brightness\", \"titleSlug\": \"count-positions-on-street-with-required-brightness\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "3\n[[1,1,2,2],[0,0,1,1]]\n2\n[[0,0,1,1]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Matrix", + "slug": "matrix", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Prefix Sum", + "slug": "prefix-sum", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector> rangeAddQueries(int n, vector>& queries) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[][] rangeAddQueries(int n, int[][] queries) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def rangeAddQueries(self, n, queries):\n \"\"\"\n :type n: int\n :type queries: List[List[int]]\n :rtype: List[List[int]]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def rangeAddQueries(self, n: int, queries: List[List[int]]) -> List[List[int]]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\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** rangeAddQueries(int n, int** queries, int queriesSize, int* queriesColSize, int* returnSize, int** returnColumnSizes){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[][] RangeAddQueries(int n, int[][] queries) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} queries\n * @return {number[][]}\n */\nvar rangeAddQueries = function(n, queries) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} queries\n# @return {Integer[][]}\ndef range_add_queries(n, queries)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func rangeAddQueries(_ n: Int, _ queries: [[Int]]) -> [[Int]] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func rangeAddQueries(n int, queries [][]int) [][]int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def rangeAddQueries(n: Int, queries: Array[Array[Int]]): Array[Array[Int]] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun rangeAddQueries(n: Int, queries: Array): Array {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn range_add_queries(n: i32, queries: Vec>) -> Vec> {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $queries\n * @return Integer[][]\n */\n function rangeAddQueries($n, $queries) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function rangeAddQueries(n: number, queries: number[][]): number[][] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (range-add-queries n queries)\n (-> exact-integer? (listof (listof exact-integer?)) (listof (listof exact-integer?)))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec range_add_queries(N :: integer(), Queries :: [[integer()]]) -> [[integer()]].\nrange_add_queries(N, Queries) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec range_add_queries(n :: integer, queries :: [[integer]]) :: [[integer]]\n def range_add_queries(n, queries) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List> rangeAddQueries(int n, List> queries) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 14407, \"totalSubmissionRaw\": 30840, \"acRate\": \"46.7%\"}", + "hints": [ + "Imagine each row as a separate array. Instead of updating the whole submatrix together, we can use prefix sum to update each row separately.", + "For each query, iterate over the rows i in the range [row1, row2] and add 1 to prefix sum S[i][col1], and subtract 1 from S[i][col2 + 1].", + "After doing this operation for all the queries, update each row separately with S[i][j] = S[i][j] + S[i][j - 1]." + ], + "solution": null, + "status": null, + "sampleTestCase": "3\n[[1,1,2,2],[0,0,1,1]]", + "metaData": "{\n \"name\": \"rangeAddQueries\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"queries\"\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 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/maximum-subsequence-score.json b/leetcode/originData/maximum-subsequence-score.json new file mode 100644 index 00000000..1b55400b --- /dev/null +++ b/leetcode/originData/maximum-subsequence-score.json @@ -0,0 +1,162 @@ +{ + "data": { + "question": { + "questionId": "2636", + "questionFrontendId": "2542", + "boundTopicId": null, + "title": "Maximum Subsequence Score", + "titleSlug": "maximum-subsequence-score", + "content": "

You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k.

\n\n

For chosen indices i0, i1, ..., ik - 1, your score is defined as:

\n\n
    \n\t
  • The sum of the selected elements from nums1 multiplied with the minimum of the selected elements from nums2.
  • \n\t
  • It can defined simply as: (nums1[i0] + nums1[i1] +...+ nums1[ik - 1]) * min(nums2[i0] , nums2[i1], ... ,nums2[ik - 1]).
  • \n
\n\n

Return the maximum possible score.

\n\n

A subsequence of indices of an array is a set that can be derived from the set {0, 1, ..., n-1} by deleting some or no elements.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [1,3,3,2], nums2 = [2,1,3,4], k = 3\nOutput: 12\nExplanation: \nThe four possible subsequence scores are:\n- We choose the indices 0, 1, and 2 with score = (1+3+3) * min(2,1,3) = 7.\n- We choose the indices 0, 1, and 3 with score = (1+3+2) * min(2,1,4) = 6. \n- We choose the indices 0, 2, and 3 with score = (1+3+2) * min(2,3,4) = 12. \n- We choose the indices 1, 2, and 3 with score = (3+3+2) * min(1,3,4) = 8.\nTherefore, we return the max score, which is 12.\n
\n\n

Example 2:

\n\n
\nInput: nums1 = [4,2,3,1,1], nums2 = [7,5,10,9,6], k = 1\nOutput: 30\nExplanation: \nChoosing index 2 is optimal: nums1[2] * nums2[2] = 3 * 10 = 30 is the maximum possible score.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 0 <= nums1[i], nums2[j] <= 105
  • \n\t
  • 1 <= k <= n
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 231, + "dislikes": 12, + "isLiked": null, + "similarQuestions": "[{\"title\": \"IPO\", \"titleSlug\": \"ipo\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Cost to Hire K Workers\", \"titleSlug\": \"minimum-cost-to-hire-k-workers\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,3,3,2]\n[2,1,3,4]\n3\n[4,2,3,1,1]\n[7,5,10,9,6]\n1", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long maxScore(vector& nums1, vector& nums2, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long maxScore(int[] nums1, int[] nums2, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maxScore(self, nums1, nums2, k):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :type k: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maxScore(self, nums1: List[int], nums2: List[int], k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long maxScore(int* nums1, int nums1Size, int* nums2, int nums2Size, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MaxScore(int[] nums1, int[] nums2, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @param {number} k\n * @return {number}\n */\nvar maxScore = function(nums1, nums2, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @param {Integer} k\n# @return {Integer}\ndef max_score(nums1, nums2, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maxScore(_ nums1: [Int], _ nums2: [Int], _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maxScore(nums1 []int, nums2 []int, k int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maxScore(nums1: Array[Int], nums2: Array[Int], k: Int): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maxScore(nums1: IntArray, nums2: IntArray, k: Int): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn max_score(nums1: Vec, nums2: Vec, k: 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 $k\n * @return Integer\n */\n function maxScore($nums1, $nums2, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maxScore(nums1: number[], nums2: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (max-score nums1 nums2 k)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec max_score(Nums1 :: [integer()], Nums2 :: [integer()], K :: integer()) -> integer().\nmax_score(Nums1, Nums2, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec max_score(nums1 :: [integer], nums2 :: [integer], k :: integer) :: integer\n def max_score(nums1, nums2, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maxScore(List nums1, List nums2, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"13.5K\", \"totalAcceptedRaw\": 4284, \"totalSubmissionRaw\": 13461, \"acRate\": \"31.8%\"}", + "hints": [ + "How can we use sorting here?", + "Try sorting the two arrays based on second array.", + "Loop through nums2 and compute the max product given the minimum is nums2[i]. Update the answer accordingly." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,3,2]\n[2,1,3,4]\n3", + "metaData": "{\n \"name\": \"maxScore\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\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 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-common-value.json b/leetcode/originData/minimum-common-value.json new file mode 100644 index 00000000..ab04afa6 --- /dev/null +++ b/leetcode/originData/minimum-common-value.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "2634", + "questionFrontendId": "2540", + "boundTopicId": null, + "title": "Minimum Common Value", + "titleSlug": "minimum-common-value", + "content": "

Given two integer arrays nums1 and nums2, sorted in non-decreasing order, return the minimum integer common to both arrays. If there is no common integer amongst nums1 and nums2, return -1.

\n\n

Note that an integer is said to be common to nums1 and nums2 if both arrays have at least one occurrence of that integer.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [1,2,3], nums2 = [2,4]\nOutput: 2\nExplanation: The smallest element common to both arrays is 2, so we return 2.\n
\n\n

Example 2:

\n\n
\nInput: nums1 = [1,2,3,6], nums2 = [2,3,4,5]\nOutput: 2\nExplanation: There are two common elements in the array 2 and 3 out of which 2 is the smallest, so 2 is returned.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums1.length, nums2.length <= 105
  • \n\t
  • 1 <= nums1[i], nums2[j] <= 109
  • \n\t
  • Both nums1 and nums2 are sorted in non-decreasing order.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 106, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Intersection of Two Arrays\", \"titleSlug\": \"intersection-of-two-arrays\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Intersection of Two Arrays II\", \"titleSlug\": \"intersection-of-two-arrays-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,2,3]\n[2,4]\n[1,2,3,6]\n[2,3,4,5]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int getCommon(vector& nums1, vector& nums2) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int getCommon(int[] nums1, int[] nums2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def getCommon(self, nums1, nums2):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def getCommon(self, nums1: List[int], nums2: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int getCommon(int* nums1, int nums1Size, int* nums2, int nums2Size){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int GetCommon(int[] nums1, int[] nums2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @return {number}\n */\nvar getCommon = function(nums1, nums2) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @return {Integer}\ndef get_common(nums1, nums2)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func getCommon(_ nums1: [Int], _ nums2: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func getCommon(nums1 []int, nums2 []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def getCommon(nums1: Array[Int], nums2: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun getCommon(nums1: IntArray, nums2: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn get_common(nums1: Vec, nums2: Vec) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums1\n * @param Integer[] $nums2\n * @return Integer\n */\n function getCommon($nums1, $nums2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function getCommon(nums1: number[], nums2: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (get-common nums1 nums2)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec get_common(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer().\nget_common(Nums1, Nums2) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec get_common(nums1 :: [integer], nums2 :: [integer]) :: integer\n def get_common(nums1, nums2) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int getCommon(List nums1, List nums2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"33.8K\", \"totalAcceptedRaw\": 17863, \"totalSubmissionRaw\": 33816, \"acRate\": \"52.8%\"}", + "hints": [ + "Try to use a set.", + "Otherwise, try to use a two-pointer approach." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,3]\n[2,4]", + "metaData": "{\n \"name\": \"getCommon\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

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

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

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

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

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

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

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

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

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

\\r\\n

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

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

Python 2.7.12.

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

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

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

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

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

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

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

Compiled with gcc 8.2 using the gnu11 standard.

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

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

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

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

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

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

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

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

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

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

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

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

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

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

C# 10 with .NET 6 runtime

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

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-cost-to-split-an-array.json b/leetcode/originData/minimum-cost-to-split-an-array.json new file mode 100644 index 00000000..207b8c27 --- /dev/null +++ b/leetcode/originData/minimum-cost-to-split-an-array.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "2633", + "questionFrontendId": "2547", + "boundTopicId": null, + "title": "Minimum Cost to Split an Array", + "titleSlug": "minimum-cost-to-split-an-array", + "content": "

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

\n\n

Split the array into some number of non-empty subarrays. The cost of a split is the sum of the importance value of each subarray in the split.

\n\n

Let trimmed(subarray) be the version of the subarray where all numbers which appear only once are removed.

\n\n
    \n\t
  • For example, trimmed([3,1,2,4,3,4]) = [3,4,3,4].
  • \n
\n\n

The importance value of a subarray is k + trimmed(subarray).length.

\n\n
    \n\t
  • For example, if a subarray is [1,2,3,3,3,4,4], then trimmed([1,2,3,3,3,4,4]) = [3,3,3,4,4].The importance value of this subarray will be k + 5.
  • \n
\n\n

Return the minimum possible cost of a split of nums.

\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,2,1,2,1,3,3], k = 2\nOutput: 8\nExplanation: We split nums to have two subarrays: [1,2], [1,2,1,3,3].\nThe importance value of [1,2] is 2 + (0) = 2.\nThe importance value of [1,2,1,3,3] is 2 + (2 + 2) = 6.\nThe cost of the split is 2 + 6 = 8. It can be shown that this is the minimum possible cost among all the possible splits.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,1,2,1], k = 2\nOutput: 6\nExplanation: We split nums to have two subarrays: [1,2], [1,2,1].\nThe importance value of [1,2] is 2 + (0) = 2.\nThe importance value of [1,2,1] is 2 + (2) = 4.\nThe cost of the split is 2 + 4 = 6. It can be shown that this is the minimum possible cost among all the possible splits.\n
\n\n

Example 3:

\n\n
\nInput: nums = [1,2,1,2,1], k = 5\nOutput: 10\nExplanation: We split nums to have one subarray: [1,2,1,2,1].\nThe importance value of [1,2,1,2,1] is 5 + (3 + 2) = 10.\nThe cost of the split is 10. It can be shown that this is the minimum possible cost among all the possible splits.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 1000
  • \n\t
  • 0 <= nums[i] < nums.length
  • \n\t
  • 1 <= k <= 109
  • \n
\n\n

 

\n\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 184, + "dislikes": 15, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Coin Change\", \"titleSlug\": \"coin-change\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Split Array Largest Sum\", \"titleSlug\": \"split-array-largest-sum\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,2,1,2,1,3,3]\n2\n[1,2,1,2,1]\n2\n[1,2,1,2,1]\n5", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minCost(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minCost(int[] nums, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minCost(self, nums, k):\n \"\"\"\n :type nums: List[int]\n :type k: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minCost(self, nums: List[int], k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minCost(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinCost(int[] nums, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar minCost = function(nums, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef min_cost(nums, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minCost(_ nums: [Int], _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minCost(nums []int, k int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minCost(nums: Array[Int], k: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minCost(nums: IntArray, k: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_cost(nums: Vec, k: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $k\n * @return Integer\n */\n function minCost($nums, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minCost(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-cost nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_cost(Nums :: [integer()], K :: integer()) -> integer().\nmin_cost(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_cost(nums :: [integer], k :: integer) :: integer\n def min_cost(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minCost(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"14.9K\", \"totalAcceptedRaw\": 5355, \"totalSubmissionRaw\": 14881, \"acRate\": \"36.0%\"}", + "hints": [ + "Let's denote dp[r] = minimum cost to partition the first r elements of nums. What would be the transitions of such dynamic programming?", + "dp[r] = min(dp[l] + importance(nums[l..r])) over all 0 <= l < r. This already gives us an O(n^3) approach, as importance can be calculated in linear time, and there are a total of O(n^2) transitions.", + "Can you think of a way to compute multiple importance values of related subarrays faster?", + "importance(nums[l-1..r]) is either importance(nums[l..r]) if a new unique element is added, importance(nums[l..r]) + 1 if an old element that appeared at least twice is added, or importance(nums[l..r]) + 2, if a previously unique element is duplicated. This allows us to compute importance(nums[l..r]) for all 0 <= l < r in O(n) by keeping a frequency table and decreasing l from r-1 down to 0." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,2,1,2,1,3,3]\n2", + "metaData": "{\n \"name\": \"minCost\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "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 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-operations-to-make-array-equal-ii.json b/leetcode/originData/minimum-operations-to-make-array-equal-ii.json new file mode 100644 index 00000000..6edfa386 --- /dev/null +++ b/leetcode/originData/minimum-operations-to-make-array-equal-ii.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "2604", + "questionFrontendId": "2541", + "boundTopicId": null, + "title": "Minimum Operations to Make Array Equal II", + "titleSlug": "minimum-operations-to-make-array-equal-ii", + "content": "

You are given two integer arrays nums1 and nums2 of equal length n and an integer k. You can perform the following operation on nums1:

\n\n
    \n\t
  • Choose two indexes i and j and increment nums1[i] by k and decrement nums1[j] by k. In other words, nums1[i] = nums1[i] + k and nums1[j] = nums1[j] - k.
  • \n
\n\n

nums1 is said to be equal to nums2 if for all indices i such that 0 <= i < n, nums1[i] == nums2[i].

\n\n

Return the minimum number of operations required to make nums1 equal to nums2. If it is impossible to make them equal, return -1.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [4,3,1,4], nums2 = [1,3,7,1], k = 3\nOutput: 2\nExplanation: In 2 operations, we can transform nums1 to nums2.\n1st operation: i = 2, j = 0. After applying the operation, nums1 = [1,3,4,4].\n2nd operation: i = 2, j = 3. After applying the operation, nums1 = [1,3,7,1].\nOne can prove that it is impossible to make arrays equal in fewer operations.
\n\n

Example 2:

\n\n
\nInput: nums1 = [3,8,5,2], nums2 = [2,4,1,6], k = 1\nOutput: -1\nExplanation: It can be proved that it is impossible to make the two arrays equal.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 2 <= n <= 105
  • \n\t
  • 0 <= nums1[i], nums2[j] <= 109
  • \n\t
  • 0 <= k <= 105
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 169, + "dislikes": 10, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Minimum Operations to Make Array Equal\", \"titleSlug\": \"minimum-operations-to-make-array-equal\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Operations to Make Arrays Similar\", \"titleSlug\": \"minimum-number-of-operations-to-make-arrays-similar\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[4,3,1,4]\n[1,3,7,1]\n3\n[3,8,5,2]\n[2,4,1,6]\n1", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long minOperations(vector& nums1, vector& nums2, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long minOperations(int[] nums1, int[] nums2, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minOperations(self, nums1, nums2, k):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :type k: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minOperations(self, nums1: List[int], nums2: List[int], k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "long long minOperations(int* nums1, int nums1Size, int* nums2, int nums2Size, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long MinOperations(int[] nums1, int[] nums2, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @param {number} k\n * @return {number}\n */\nvar minOperations = function(nums1, nums2, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @param {Integer} k\n# @return {Integer}\ndef min_operations(nums1, nums2, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minOperations(_ nums1: [Int], _ nums2: [Int], _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minOperations(nums1 []int, nums2 []int, k int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minOperations(nums1: Array[Int], nums2: Array[Int], k: Int): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minOperations(nums1: IntArray, nums2: IntArray, k: Int): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_operations(nums1: Vec, nums2: Vec, k: 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 $k\n * @return Integer\n */\n function minOperations($nums1, $nums2, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minOperations(nums1: number[], nums2: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-operations nums1 nums2 k)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_operations(Nums1 :: [integer()], Nums2 :: [integer()], K :: integer()) -> integer().\nmin_operations(Nums1, Nums2, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_operations(nums1 :: [integer], nums2 :: [integer], k :: integer) :: integer\n def min_operations(nums1, nums2, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minOperations(List nums1, List nums2, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"11.3K\", \"totalSubmission\": \"42.7K\", \"totalAcceptedRaw\": 11331, \"totalSubmissionRaw\": 42721, \"acRate\": \"26.5%\"}", + "hints": [ + "What are the cases for which we cannot make nums1 == nums2?", + "For minimum moves, if nums1[i] < nums2[i], then we should never decrement nums1[i]. \r\nIf nums1[i] > nums2[i], then we should never increment nums1[i]." + ], + "solution": null, + "status": null, + "sampleTestCase": "[4,3,1,4]\n[1,3,7,1]\n3", + "metaData": "{\n \"name\": \"minOperations\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\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 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/sort-the-students-by-their-kth-score.json b/leetcode/originData/sort-the-students-by-their-kth-score.json new file mode 100644 index 00000000..83a7d2d3 --- /dev/null +++ b/leetcode/originData/sort-the-students-by-their-kth-score.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "2631", + "questionFrontendId": "2545", + "boundTopicId": null, + "title": "Sort the Students by Their Kth Score", + "titleSlug": "sort-the-students-by-their-kth-score", + "content": "

There is a class with m students and n exams. You are given a 0-indexed m x n integer matrix score, where each row represents one student and score[i][j] denotes the score the ith student got in the jth exam. The matrix score contains distinct integers only.

\n\n

You are also given an integer k. Sort the students (i.e., the rows of the matrix) by their scores in the kth (0-indexed) exam from the highest to the lowest.

\n\n

Return the matrix after sorting it.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: score = [[10,6,9,1],[7,5,11,2],[4,8,3,15]], k = 2\nOutput: [[7,5,11,2],[10,6,9,1],[4,8,3,15]]\nExplanation: In the above diagram, S denotes the student, while E denotes the exam.\n- The student with index 1 scored 11 in exam 2, which is the highest score, so they got first place.\n- The student with index 0 scored 9 in exam 2, which is the second highest score, so they got second place.\n- The student with index 2 scored 3 in exam 2, which is the lowest score, so they got third place.\n
\n\n

Example 2:

\n\"\"\n
\nInput: score = [[3,4],[5,6]], k = 0\nOutput: [[5,6],[3,4]]\nExplanation: In the above diagram, S denotes the student, while E denotes the exam.\n- The student with index 1 scored 5 in exam 0, which is the highest score, so they got first place.\n- The student with index 0 scored 3 in exam 0, which is the lowest score, so they got second place.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • m == score.length
  • \n\t
  • n == score[i].length
  • \n\t
  • 1 <= m, n <= 250
  • \n\t
  • 1 <= score[i][j] <= 105
  • \n\t
  • score consists of distinct integers.
  • \n\t
  • 0 <= k < n
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 117, + "dislikes": 5, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Erect the Fence\", \"titleSlug\": \"erect-the-fence\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Custom Sort String\", \"titleSlug\": \"custom-sort-string\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Sort the People\", \"titleSlug\": \"sort-the-people\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[[10,6,9,1],[7,5,11,2],[4,8,3,15]]\n2\n[[3,4],[5,6]]\n0", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n vector> sortTheStudents(vector>& score, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int[][] sortTheStudents(int[][] score, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def sortTheStudents(self, score, k):\n \"\"\"\n :type score: List[List[int]]\n :type k: int\n :rtype: List[List[int]]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def sortTheStudents(self, score: List[List[int]], k: int) -> List[List[int]]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\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** sortTheStudents(int** score, int scoreSize, int* scoreColSize, int k, int* returnSize, int** returnColumnSizes){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int[][] SortTheStudents(int[][] score, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} score\n * @param {number} k\n * @return {number[][]}\n */\nvar sortTheStudents = function(score, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} score\n# @param {Integer} k\n# @return {Integer[][]}\ndef sort_the_students(score, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func sortTheStudents(_ score: [[Int]], _ k: Int) -> [[Int]] {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func sortTheStudents(score [][]int, k int) [][]int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def sortTheStudents(score: Array[Array[Int]], k: Int): Array[Array[Int]] = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun sortTheStudents(score: Array, k: Int): Array {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn sort_the_students(score: Vec>, k: i32) -> Vec> {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $score\n * @param Integer $k\n * @return Integer[][]\n */\n function sortTheStudents($score, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function sortTheStudents(score: number[][], k: number): number[][] {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (sort-the-students score k)\n (-> (listof (listof exact-integer?)) exact-integer? (listof (listof exact-integer?)))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec sort_the_students(Score :: [[integer()]], K :: integer()) -> [[integer()]].\nsort_the_students(Score, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec sort_the_students(score :: [[integer]], k :: integer) :: [[integer]]\n def sort_the_students(score, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n List> sortTheStudents(List> score, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"18.5K\", \"totalAcceptedRaw\": 15896, \"totalSubmissionRaw\": 18477, \"acRate\": \"86.0%\"}", + "hints": [ + "Find the row with the highest score in the kth exam and swap it with the first row.", + "After fixing the first row, perform the same operation for the rest of the rows, and the matrix's rows will get sorted one by one." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[10,6,9,1],[7,5,11,2],[4,8,3,15]]\n2", + "metaData": "{\n \"name\": \"sortTheStudents\",\n \"params\": [\n {\n \"name\": \"score\",\n \"type\": \"integer[][]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer[][]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

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

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

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

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

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

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

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

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

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

\\r\\n

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

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

Python 2.7.12.

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

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

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

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

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

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

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

Compiled with gcc 8.2 using the gnu11 standard.

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

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

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

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

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

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

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

1. Adding an item to a hash.\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            /* we'll use this field as the key */\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n
\\r\\n

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

2. Looking up an item in a hash:\\r\\n

\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n
\\r\\n

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

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

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

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

C# 10 with .NET 6 runtime

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

Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

For Priority Queue / Queue data structures, you may use 5.3.0 version of datastructures-js/priority-queue and 4.2.1 version of 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\"], \"dart\": [\"Dart\", \"

Dart 2.17.3

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

Your code will be run directly without compiling

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/problem/alternating-digit-sum.html b/leetcode/problem/alternating-digit-sum.html new file mode 100644 index 00000000..9ebf2bfd --- /dev/null +++ b/leetcode/problem/alternating-digit-sum.html @@ -0,0 +1,49 @@ +

You are given a positive integer n. Each digit of n has a sign according to the following rules:

+ +
    +
  • The most significant digit is assigned a positive sign.
  • +
  • Each other digit has an opposite sign to its adjacent digits.
  • +
+ +

Return the sum of all digits with their corresponding sign.

+ +

 

+

Example 1:

+ +
+Input: n = 521
+Output: 4
+Explanation: (+5) + (-2) + (+1) = 4.
+
+ +

Example 2:

+ +
+Input: n = 111
+Output: 1
+Explanation: (+1) + (-1) + (+1) = 1.
+
+ +

Example 3:

+ +
+Input: n = 886996
+Output: 0
+Explanation: (+8) + (-8) + (+6) + (-9) + (+9) + (-6) = 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 109
  • +
+ +

 

+ diff --git a/leetcode/problem/apply-bitwise-operations-to-make-strings-equal.html b/leetcode/problem/apply-bitwise-operations-to-make-strings-equal.html new file mode 100644 index 00000000..79e572ef --- /dev/null +++ b/leetcode/problem/apply-bitwise-operations-to-make-strings-equal.html @@ -0,0 +1,39 @@ +

You are given two 0-indexed binary strings s and target of the same length n. You can do the following operation on s any number of times:

+ +
    +
  • Choose two different indices i and j where 0 <= i, j < n.
  • +
  • Simultaneously, replace s[i] with (s[i] OR s[j]) and s[j] with (s[i] XOR s[j]).
  • +
+ +

For example, if s = "0110", you can choose i = 0 and j = 2, then simultaneously replace s[0] with (s[0] OR s[2] = 0 OR 1 = 1), and s[2] with (s[0] XOR s[2] = 0 XOR 1 = 1), so we will have s = "1110".

+ +

Return true if you can make the string s equal to target, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: s = "1010", target = "0110"
+Output: true
+Explanation: We can do the following operations:
+- Choose i = 2 and j = 0. We have now s = "0010".
+- Choose i = 2 and j = 1. We have now s = "0110".
+Since we can make s equal to target, we return true.
+
+ +

Example 2:

+ +
+Input: s = "11", target = "00"
+Output: false
+Explanation: It is not possible to make s equal to target with any number of operations.
+
+ +

 

+

Constraints:

+ +
    +
  • n == s.length == target.length
  • +
  • 2 <= n <= 105
  • +
  • s and target consist of only the digits 0 and 1.
  • +
diff --git a/leetcode/problem/check-if-point-is-reachable.html b/leetcode/problem/check-if-point-is-reachable.html new file mode 100644 index 00000000..dabc328c --- /dev/null +++ b/leetcode/problem/check-if-point-is-reachable.html @@ -0,0 +1,36 @@ +

There exists an infinitely large grid. You are currently at point (1, 1), and you need to reach the point (targetX, targetY) using a finite number of steps.

+ +

In one step, you can move from point (x, y) to any one of the following points:

+ +
    +
  • (x, y - x)
  • +
  • (x - y, y)
  • +
  • (2 * x, y)
  • +
  • (x, 2 * y)
  • +
+ +

Given two integers targetX and targetY representing the X-coordinate and Y-coordinate of your final position, return true if you can reach the point from (1, 1) using some number of steps, and false otherwise.

+ +

 

+

Example 1:

+ +
+Input: targetX = 6, targetY = 9
+Output: false
+Explanation: It is impossible to reach (6,9) from (1,1) using any sequence of moves, so false is returned.
+
+ +

Example 2:

+ +
+Input: targetX = 4, targetY = 7
+Output: true
+Explanation: You can follow the path (1,1) -> (1,2) -> (1,4) -> (1,8) -> (1,7) -> (2,7) -> (4,7).
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= targetX, targetY <= 109
  • +
diff --git a/leetcode/problem/count-the-number-of-good-subarrays.html b/leetcode/problem/count-the-number-of-good-subarrays.html new file mode 100644 index 00000000..4311b1e3 --- /dev/null +++ b/leetcode/problem/count-the-number-of-good-subarrays.html @@ -0,0 +1,34 @@ +

Given an integer array nums and an integer k, return the number of good subarrays of nums.

+ +

A subarray arr is good if it there are at least k pairs of indices (i, j) such that i < j and arr[i] == arr[j].

+ +

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

+ +

 

+

Example 1:

+ +
+Input: nums = [1,1,1,1,1], k = 10
+Output: 1
+Explanation: The only good subarray is the array nums itself.
+
+ +

Example 2:

+ +
+Input: nums = [3,1,4,3,2,2,4], k = 2
+Output: 4
+Explanation: There are 4 different good subarrays:
+- [3,1,4,3,2,2] that has 2 pairs.
+- [3,1,4,3,2,2,4] that has 3 pairs.
+- [1,4,3,2,2,4] that has 2 pairs.
+- [4,3,2,2,4] that has 2 pairs.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i], k <= 109
  • +
diff --git a/leetcode/problem/difference-between-element-sum-and-digit-sum-of-an-array.html b/leetcode/problem/difference-between-element-sum-and-digit-sum-of-an-array.html new file mode 100644 index 00000000..5b18206c --- /dev/null +++ b/leetcode/problem/difference-between-element-sum-and-digit-sum-of-an-array.html @@ -0,0 +1,41 @@ +

You are given a positive integer array nums.

+ +
    +
  • The element sum is the sum of all the elements in nums.
  • +
  • The digit sum is the sum of all the digits (not necessarily distinct) that appear in nums.
  • +
+ +

Return the absolute difference between the element sum and digit sum of nums.

+ +

Note that the absolute difference between two integers x and y is defined as |x - y|.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,15,6,3]
+Output: 9
+Explanation: 
+The element sum of nums is 1 + 15 + 6 + 3 = 25.
+The digit sum of nums is 1 + 1 + 5 + 6 + 3 = 16.
+The absolute difference between the element sum and digit sum is |25 - 16| = 9.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4]
+Output: 0
+Explanation:
+The element sum of nums is 1 + 2 + 3 + 4 = 10.
+The digit sum of nums is 1 + 2 + 3 + 4 = 10.
+The absolute difference between the element sum and digit sum is |10 - 10| = 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 2000
  • +
  • 1 <= nums[i] <= 2000
  • +
diff --git a/leetcode/problem/difference-between-maximum-and-minimum-price-sum.html b/leetcode/problem/difference-between-maximum-and-minimum-price-sum.html new file mode 100644 index 00000000..9dceb85a --- /dev/null +++ b/leetcode/problem/difference-between-maximum-and-minimum-price-sum.html @@ -0,0 +1,44 @@ +

There exists an undirected and initially unrooted tree with n nodes indexed from 0 to n - 1. You are given the integer n and a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

Each node has an associated price. You are given an integer array price, where price[i] is the price of the ith node.

+ +

The price sum of a given path is the sum of the prices of all nodes lying on that path.

+ +

The tree can be rooted at any node root of your choice. The incurred cost after choosing root is the difference between the maximum and minimum price sum amongst all paths starting at root.

+ +

Return the maximum possible cost amongst all possible root choices.

+ +

 

+

Example 1:

+ +
+Input: n = 6, edges = [[0,1],[1,2],[1,3],[3,4],[3,5]], price = [9,8,7,6,10,5]
+Output: 24
+Explanation: The diagram above denotes the tree after rooting it at node 2. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.
+- The first path contains nodes [2,1,3,4]: the prices are [7,8,6,10], and the sum of the prices is 31.
+- The second path contains the node [2] with the price [7].
+The difference between the maximum and minimum price sum is 24. It can be proved that 24 is the maximum cost.
+
+ +

Example 2:

+ +
+Input: n = 3, edges = [[0,1],[1,2]], price = [1,1,1]
+Output: 2
+Explanation: The diagram above denotes the tree after rooting it at node 0. The first part (colored in red) shows the path with the maximum price sum. The second part (colored in blue) shows the path with the minimum price sum.
+- The first path contains nodes [0,1,2]: the prices are [1,1,1], and the sum of the prices is 3.
+- The second path contains node [0] with a price [1].
+The difference between the maximum and minimum price sum is 2. It can be proved that 2 is the maximum cost.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
  • +
  • edges.length == n - 1
  • +
  • 0 <= ai, bi <= n - 1
  • +
  • edges represents a valid tree.
  • +
  • price.length == n
  • +
  • 1 <= price[i] <= 105
  • +
diff --git a/leetcode/problem/increment-submatrices-by-one.html b/leetcode/problem/increment-submatrices-by-one.html new file mode 100644 index 00000000..262f7cdb --- /dev/null +++ b/leetcode/problem/increment-submatrices-by-one.html @@ -0,0 +1,39 @@ +

You are given a positive integer n, indicating that we initially have an n x n 0-indexed integer matrix mat filled with zeroes.

+ +

You are also given a 2D integer array query. For each query[i] = [row1i, col1i, row2i, col2i], you should do the following operation:

+ +
    +
  • Add 1 to every element in the submatrix with the top left corner (row1i, col1i) and the bottom right corner (row2i, col2i). That is, add 1 to mat[x][y] for for all row1i <= x <= row2i and col1i <= y <= col2i.
  • +
+ +

Return the matrix mat after performing every query.

+ +

 

+

Example 1:

+ +
+Input: n = 3, queries = [[1,1,2,2],[0,0,1,1]]
+Output: [[1,1,0],[1,2,1],[0,1,1]]
+Explanation: The diagram above shows the initial matrix, the matrix after the first query, and the matrix after the second query.
+- In the first query, we add 1 to every element in the submatrix with the top left corner (1, 1) and bottom right corner (2, 2).
+- In the second query, we add 1 to every element in the submatrix with the top left corner (0, 0) and bottom right corner (1, 1).
+
+ +

Example 2:

+ +
+Input: n = 2, queries = [[0,0,1,1]]
+Output: [[1,1],[1,1]]
+Explanation: The diagram above shows the initial matrix and the matrix after the first query.
+- In the first query we add 1 to every element in the matrix.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 500
  • +
  • 1 <= queries.length <= 104
  • +
  • 0 <= row1i <= row2i < n
  • +
  • 0 <= col1i <= col2i < n
  • +
diff --git a/leetcode/problem/maximum-subsequence-score.html b/leetcode/problem/maximum-subsequence-score.html new file mode 100644 index 00000000..abd729ae --- /dev/null +++ b/leetcode/problem/maximum-subsequence-score.html @@ -0,0 +1,46 @@ +

You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k.

+ +

For chosen indices i0, i1, ..., ik - 1, your score is defined as:

+ +
    +
  • The sum of the selected elements from nums1 multiplied with the minimum of the selected elements from nums2.
  • +
  • It can defined simply as: (nums1[i0] + nums1[i1] +...+ nums1[ik - 1]) * min(nums2[i0] , nums2[i1], ... ,nums2[ik - 1]).
  • +
+ +

Return the maximum possible score.

+ +

A subsequence of indices of an array is a set that can be derived from the set {0, 1, ..., n-1} by deleting some or no elements.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,3,3,2], nums2 = [2,1,3,4], k = 3
+Output: 12
+Explanation: 
+The four possible subsequence scores are:
+- We choose the indices 0, 1, and 2 with score = (1+3+3) * min(2,1,3) = 7.
+- We choose the indices 0, 1, and 3 with score = (1+3+2) * min(2,1,4) = 6. 
+- We choose the indices 0, 2, and 3 with score = (1+3+2) * min(2,3,4) = 12. 
+- We choose the indices 1, 2, and 3 with score = (3+3+2) * min(1,3,4) = 8.
+Therefore, we return the max score, which is 12.
+
+ +

Example 2:

+ +
+Input: nums1 = [4,2,3,1,1], nums2 = [7,5,10,9,6], k = 1
+Output: 30
+Explanation: 
+Choosing index 2 is optimal: nums1[2] * nums2[2] = 3 * 10 = 30 is the maximum possible score.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 1 <= n <= 105
  • +
  • 0 <= nums1[i], nums2[j] <= 105
  • +
  • 1 <= k <= n
  • +
diff --git a/leetcode/problem/minimum-common-value.html b/leetcode/problem/minimum-common-value.html new file mode 100644 index 00000000..f4af1de1 --- /dev/null +++ b/leetcode/problem/minimum-common-value.html @@ -0,0 +1,29 @@ +

Given two integer arrays nums1 and nums2, sorted in non-decreasing order, return the minimum integer common to both arrays. If there is no common integer amongst nums1 and nums2, return -1.

+ +

Note that an integer is said to be common to nums1 and nums2 if both arrays have at least one occurrence of that integer.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [1,2,3], nums2 = [2,4]
+Output: 2
+Explanation: The smallest element common to both arrays is 2, so we return 2.
+
+ +

Example 2:

+ +
+Input: nums1 = [1,2,3,6], nums2 = [2,3,4,5]
+Output: 2
+Explanation: There are two common elements in the array 2 and 3 out of which 2 is the smallest, so 2 is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums1.length, nums2.length <= 105
  • +
  • 1 <= nums1[i], nums2[j] <= 109
  • +
  • Both nums1 and nums2 are sorted in non-decreasing order.
  • +
diff --git a/leetcode/problem/minimum-cost-to-split-an-array.html b/leetcode/problem/minimum-cost-to-split-an-array.html new file mode 100644 index 00000000..e183ee02 --- /dev/null +++ b/leetcode/problem/minimum-cost-to-split-an-array.html @@ -0,0 +1,70 @@ +

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

+ +

Split the array into some number of non-empty subarrays. The cost of a split is the sum of the importance value of each subarray in the split.

+ +

Let trimmed(subarray) be the version of the subarray where all numbers which appear only once are removed.

+ +
    +
  • For example, trimmed([3,1,2,4,3,4]) = [3,4,3,4].
  • +
+ +

The importance value of a subarray is k + trimmed(subarray).length.

+ +
    +
  • For example, if a subarray is [1,2,3,3,3,4,4], then trimmed([1,2,3,3,3,4,4]) = [3,3,3,4,4].The importance value of this subarray will be k + 5.
  • +
+ +

Return the minimum possible cost of a split of nums.

+ +

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

+ +

 

+

Example 1:

+ +
+Input: nums = [1,2,1,2,1,3,3], k = 2
+Output: 8
+Explanation: We split nums to have two subarrays: [1,2], [1,2,1,3,3].
+The importance value of [1,2] is 2 + (0) = 2.
+The importance value of [1,2,1,3,3] is 2 + (2 + 2) = 6.
+The cost of the split is 2 + 6 = 8. It can be shown that this is the minimum possible cost among all the possible splits.
+
+ +

Example 2:

+ +
+Input: nums = [1,2,1,2,1], k = 2
+Output: 6
+Explanation: We split nums to have two subarrays: [1,2], [1,2,1].
+The importance value of [1,2] is 2 + (0) = 2.
+The importance value of [1,2,1] is 2 + (2) = 4.
+The cost of the split is 2 + 4 = 6. It can be shown that this is the minimum possible cost among all the possible splits.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,1,2,1], k = 5
+Output: 10
+Explanation: We split nums to have one subarray: [1,2,1,2,1].
+The importance value of [1,2,1,2,1] is 5 + (3 + 2) = 10.
+The cost of the split is 10. It can be shown that this is the minimum possible cost among all the possible splits.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 1000
  • +
  • 0 <= nums[i] < nums.length
  • +
  • 1 <= k <= 109
  • +
+ +

 

+ diff --git a/leetcode/problem/minimum-operations-to-make-array-equal-ii.html b/leetcode/problem/minimum-operations-to-make-array-equal-ii.html new file mode 100644 index 00000000..4d6623a3 --- /dev/null +++ b/leetcode/problem/minimum-operations-to-make-array-equal-ii.html @@ -0,0 +1,38 @@ +

You are given two integer arrays nums1 and nums2 of equal length n and an integer k. You can perform the following operation on nums1:

+ +
    +
  • Choose two indexes i and j and increment nums1[i] by k and decrement nums1[j] by k. In other words, nums1[i] = nums1[i] + k and nums1[j] = nums1[j] - k.
  • +
+ +

nums1 is said to be equal to nums2 if for all indices i such that 0 <= i < n, nums1[i] == nums2[i].

+ +

Return the minimum number of operations required to make nums1 equal to nums2. If it is impossible to make them equal, return -1.

+ +

 

+

Example 1:

+ +
+Input: nums1 = [4,3,1,4], nums2 = [1,3,7,1], k = 3
+Output: 2
+Explanation: In 2 operations, we can transform nums1 to nums2.
+1st operation: i = 2, j = 0. After applying the operation, nums1 = [1,3,4,4].
+2nd operation: i = 2, j = 3. After applying the operation, nums1 = [1,3,7,1].
+One can prove that it is impossible to make arrays equal in fewer operations.
+ +

Example 2:

+ +
+Input: nums1 = [3,8,5,2], nums2 = [2,4,1,6], k = 1
+Output: -1
+Explanation: It can be proved that it is impossible to make the two arrays equal.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 2 <= n <= 105
  • +
  • 0 <= nums1[i], nums2[j] <= 109
  • +
  • 0 <= k <= 105
  • +
diff --git a/leetcode/problem/sort-the-students-by-their-kth-score.html b/leetcode/problem/sort-the-students-by-their-kth-score.html new file mode 100644 index 00000000..ddf50379 --- /dev/null +++ b/leetcode/problem/sort-the-students-by-their-kth-score.html @@ -0,0 +1,39 @@ +

There is a class with m students and n exams. You are given a 0-indexed m x n integer matrix score, where each row represents one student and score[i][j] denotes the score the ith student got in the jth exam. The matrix score contains distinct integers only.

+ +

You are also given an integer k. Sort the students (i.e., the rows of the matrix) by their scores in the kth (0-indexed) exam from the highest to the lowest.

+ +

Return the matrix after sorting it.

+ +

 

+

Example 1:

+ +
+Input: score = [[10,6,9,1],[7,5,11,2],[4,8,3,15]], k = 2
+Output: [[7,5,11,2],[10,6,9,1],[4,8,3,15]]
+Explanation: In the above diagram, S denotes the student, while E denotes the exam.
+- The student with index 1 scored 11 in exam 2, which is the highest score, so they got first place.
+- The student with index 0 scored 9 in exam 2, which is the second highest score, so they got second place.
+- The student with index 2 scored 3 in exam 2, which is the lowest score, so they got third place.
+
+ +

Example 2:

+ +
+Input: score = [[3,4],[5,6]], k = 0
+Output: [[5,6],[3,4]]
+Explanation: In the above diagram, S denotes the student, while E denotes the exam.
+- The student with index 1 scored 5 in exam 0, which is the highest score, so they got first place.
+- The student with index 0 scored 3 in exam 0, which is the lowest score, so they got second place.
+
+ +

 

+

Constraints:

+ +
    +
  • m == score.length
  • +
  • n == score[i].length
  • +
  • 1 <= m, n <= 250
  • +
  • 1 <= score[i][j] <= 105
  • +
  • score consists of distinct integers.
  • +
  • 0 <= k < n
  • +