From 3a7fe98f11b75419781a294464ab5f1716066b95 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: Sun, 20 Aug 2023 20:47:46 +0800 Subject: [PATCH] update --- README.md | 2 +- leetcode-cn/origin-data.json | 16213 ++++++++-------- .../[no content]deep-object-filter.json | 46 + ...]delay-the-resolution-of-each-promise.json | 46 + .../[no content]election-results.json | 59 + .../[no content]inversion-of-object.json | 46 + ...relative-loss-after-buying-chocolates.json | 52 + .../apply-operations-to-maximize-score.json | 205 + ...ck-if-a-string-is-an-acronym-of-words.json | 163 + ...t-pairs-whose-sum-is-less-than-target.json | 163 + ...the-minimum-sum-of-a-k-avoiding-array.json | 166 + ...a-number-represented-as-a-linked-list.json | 184 + .../find-the-longest-equal-subarray.json | 166 + ...a-subsequence-using-cyclic-increments.json | 166 + .../originData/max-pair-sum-in-an-array.json | 176 + .../maximize-the-profit-as-the-salesman.json | 165 + ...ence-between-elements-with-constraint.json | 186 + ...er-of-beautiful-integers-in-the-range.json | 164 + .../originData/sorting-three-groups.json | 165 + ...rmine-the-minimum-sum-of-a-k-avoiding-array].html | 33 + ... [check-if-a-string-is-an-acronym-of-words].html | 45 + .../将三个组排序 [sorting-three-groups].html | 65 + ...串 [make-string-a-subsequence-using-cyclic-increments].html | 46 + ...值子数组 [find-the-longest-equal-subarray].html | 41 + ...最大 [apply-operations-to-maximize-score].html | 51 + ...的最大数对和 [max-pair-sum-in-an-array].html | 30 + ...数目 [count-pairs-whose-sum-is-less-than-target].html | 41 + ... [double-a-number-represented-as-a-linked-list].html | 30 + ...目 [number-of-beautiful-integers-in-the-range].html | 54 + ...大化 [maximize-the-profit-as-the-salesman].html | 42 + ...bsolute-difference-between-elements-with-constraint].html | 49 + ...rmine-the-minimum-sum-of-a-k-avoiding-array].html | 31 + ...h) [check-if-a-string-is-an-acronym-of-words].html | 43 + ...组排序(English) [sorting-three-groups].html | 63 + ...ish) [make-string-a-subsequence-using-cyclic-increments].html | 44 + ...组(English) [find-the-longest-equal-subarray].html | 39 + ...nglish) [apply-operations-to-maximize-score].html | 49 + ...数对和(English) [max-pair-sum-in-an-array].html | 30 + ...glish) [count-pairs-whose-sum-is-less-than-target].html | 39 + ...h) [double-a-number-represented-as-a-linked-list].html | 29 + ...sh) [number-of-beautiful-integers-in-the-range].html | 52 + ...glish) [maximize-the-profit-as-the-salesman].html | 41 + ...bsolute-difference-between-elements-with-constraint].html | 47 + leetcode/origin-data.json | 11691 +++++------ .../[no content]deep-object-filter.json | 43 + ...]delay-the-resolution-of-each-promise.json | 43 + .../[no content]election-results.json | 56 + .../[no content]inversion-of-object.json | 43 + ...relative-loss-after-buying-chocolates.json | 49 + .../apply-operations-to-maximize-score.json | 202 + ...ck-if-a-string-is-an-acronym-of-words.json | 160 + ...t-pairs-whose-sum-is-less-than-target.json | 160 + ...the-minimum-sum-of-a-k-avoiding-array.json | 163 + ...a-number-represented-as-a-linked-list.json | 181 + .../find-the-longest-equal-subarray.json | 163 + ...a-subsequence-using-cyclic-increments.json | 163 + .../originData/max-pair-sum-in-an-array.json | 173 + .../maximize-the-profit-as-the-salesman.json | 162 + ...ence-between-elements-with-constraint.json | 183 + ...er-of-beautiful-integers-in-the-range.json | 161 + leetcode/originData/sorting-three-groups.json | 162 + .../apply-operations-to-maximize-score.html | 49 + ...ck-if-a-string-is-an-acronym-of-words.html | 43 + ...t-pairs-whose-sum-is-less-than-target.html | 39 + ...the-minimum-sum-of-a-k-avoiding-array.html | 31 + ...a-number-represented-as-a-linked-list.html | 29 + .../find-the-longest-equal-subarray.html | 39 + ...a-subsequence-using-cyclic-increments.html | 44 + .../problem/max-pair-sum-in-an-array.html | 30 + .../maximize-the-profit-as-the-salesman.html | 41 + ...ence-between-elements-with-constraint.html | 47 + ...er-of-beautiful-integers-in-the-range.html | 52 + leetcode/problem/sorting-three-groups.html | 63 + 73 files changed, 20453 insertions(+), 13579 deletions(-) create mode 100644 leetcode-cn/originData/[no content]deep-object-filter.json create mode 100644 leetcode-cn/originData/[no content]delay-the-resolution-of-each-promise.json create mode 100644 leetcode-cn/originData/[no content]election-results.json create mode 100644 leetcode-cn/originData/[no content]inversion-of-object.json create mode 100644 leetcode-cn/originData/[no content]minimum-relative-loss-after-buying-chocolates.json create mode 100644 leetcode-cn/originData/apply-operations-to-maximize-score.json create mode 100644 leetcode-cn/originData/check-if-a-string-is-an-acronym-of-words.json create mode 100644 leetcode-cn/originData/count-pairs-whose-sum-is-less-than-target.json create mode 100644 leetcode-cn/originData/determine-the-minimum-sum-of-a-k-avoiding-array.json create mode 100644 leetcode-cn/originData/double-a-number-represented-as-a-linked-list.json create mode 100644 leetcode-cn/originData/find-the-longest-equal-subarray.json create mode 100644 leetcode-cn/originData/make-string-a-subsequence-using-cyclic-increments.json create mode 100644 leetcode-cn/originData/max-pair-sum-in-an-array.json create mode 100644 leetcode-cn/originData/maximize-the-profit-as-the-salesman.json create mode 100644 leetcode-cn/originData/minimum-absolute-difference-between-elements-with-constraint.json create mode 100644 leetcode-cn/originData/number-of-beautiful-integers-in-the-range.json create mode 100644 leetcode-cn/originData/sorting-three-groups.json create mode 100644 leetcode-cn/problem (Chinese)/k-avoiding 数组的最小总和 [determine-the-minimum-sum-of-a-k-avoiding-array].html create mode 100644 leetcode-cn/problem (Chinese)/判别首字母缩略词 [check-if-a-string-is-an-acronym-of-words].html create mode 100644 leetcode-cn/problem (Chinese)/将三个组排序 [sorting-three-groups].html create mode 100644 leetcode-cn/problem (Chinese)/循环增长使字符串子序列等于另一个字符串 [make-string-a-subsequence-using-cyclic-increments].html create mode 100644 leetcode-cn/problem (Chinese)/找出最长等值子数组 [find-the-longest-equal-subarray].html create mode 100644 leetcode-cn/problem (Chinese)/操作使得分最大 [apply-operations-to-maximize-score].html create mode 100644 leetcode-cn/problem (Chinese)/数组中的最大数对和 [max-pair-sum-in-an-array].html create mode 100644 leetcode-cn/problem (Chinese)/统计和小于目标的下标对数目 [count-pairs-whose-sum-is-less-than-target].html create mode 100644 leetcode-cn/problem (Chinese)/翻倍以链表形式表示的数字 [double-a-number-represented-as-a-linked-list].html create mode 100644 leetcode-cn/problem (Chinese)/范围中美丽整数的数目 [number-of-beautiful-integers-in-the-range].html create mode 100644 leetcode-cn/problem (Chinese)/销售利润最大化 [maximize-the-profit-as-the-salesman].html create mode 100644 leetcode-cn/problem (Chinese)/限制条件下元素之间的最小绝对差 [minimum-absolute-difference-between-elements-with-constraint].html create mode 100644 leetcode-cn/problem (English)/k-avoiding 数组的最小总和(English) [determine-the-minimum-sum-of-a-k-avoiding-array].html create mode 100644 leetcode-cn/problem (English)/判别首字母缩略词(English) [check-if-a-string-is-an-acronym-of-words].html create mode 100644 leetcode-cn/problem (English)/将三个组排序(English) [sorting-three-groups].html create mode 100644 leetcode-cn/problem (English)/循环增长使字符串子序列等于另一个字符串(English) [make-string-a-subsequence-using-cyclic-increments].html create mode 100644 leetcode-cn/problem (English)/找出最长等值子数组(English) [find-the-longest-equal-subarray].html create mode 100644 leetcode-cn/problem (English)/操作使得分最大(English) [apply-operations-to-maximize-score].html create mode 100644 leetcode-cn/problem (English)/数组中的最大数对和(English) [max-pair-sum-in-an-array].html create mode 100644 leetcode-cn/problem (English)/统计和小于目标的下标对数目(English) [count-pairs-whose-sum-is-less-than-target].html create mode 100644 leetcode-cn/problem (English)/翻倍以链表形式表示的数字(English) [double-a-number-represented-as-a-linked-list].html create mode 100644 leetcode-cn/problem (English)/范围中美丽整数的数目(English) [number-of-beautiful-integers-in-the-range].html create mode 100644 leetcode-cn/problem (English)/销售利润最大化(English) [maximize-the-profit-as-the-salesman].html create mode 100644 leetcode-cn/problem (English)/限制条件下元素之间的最小绝对差(English) [minimum-absolute-difference-between-elements-with-constraint].html create mode 100644 leetcode/originData/[no content]deep-object-filter.json create mode 100644 leetcode/originData/[no content]delay-the-resolution-of-each-promise.json create mode 100644 leetcode/originData/[no content]election-results.json create mode 100644 leetcode/originData/[no content]inversion-of-object.json create mode 100644 leetcode/originData/[no content]minimum-relative-loss-after-buying-chocolates.json create mode 100644 leetcode/originData/apply-operations-to-maximize-score.json create mode 100644 leetcode/originData/check-if-a-string-is-an-acronym-of-words.json create mode 100644 leetcode/originData/count-pairs-whose-sum-is-less-than-target.json create mode 100644 leetcode/originData/determine-the-minimum-sum-of-a-k-avoiding-array.json create mode 100644 leetcode/originData/double-a-number-represented-as-a-linked-list.json create mode 100644 leetcode/originData/find-the-longest-equal-subarray.json create mode 100644 leetcode/originData/make-string-a-subsequence-using-cyclic-increments.json create mode 100644 leetcode/originData/max-pair-sum-in-an-array.json create mode 100644 leetcode/originData/maximize-the-profit-as-the-salesman.json create mode 100644 leetcode/originData/minimum-absolute-difference-between-elements-with-constraint.json create mode 100644 leetcode/originData/number-of-beautiful-integers-in-the-range.json create mode 100644 leetcode/originData/sorting-three-groups.json create mode 100644 leetcode/problem/apply-operations-to-maximize-score.html create mode 100644 leetcode/problem/check-if-a-string-is-an-acronym-of-words.html create mode 100644 leetcode/problem/count-pairs-whose-sum-is-less-than-target.html create mode 100644 leetcode/problem/determine-the-minimum-sum-of-a-k-avoiding-array.html create mode 100644 leetcode/problem/double-a-number-represented-as-a-linked-list.html create mode 100644 leetcode/problem/find-the-longest-equal-subarray.html create mode 100644 leetcode/problem/make-string-a-subsequence-using-cyclic-increments.html create mode 100644 leetcode/problem/max-pair-sum-in-an-array.html create mode 100644 leetcode/problem/maximize-the-profit-as-the-salesman.html create mode 100644 leetcode/problem/minimum-absolute-difference-between-elements-with-constraint.html create mode 100644 leetcode/problem/number-of-beautiful-integers-in-the-range.html create mode 100644 leetcode/problem/sorting-three-groups.html diff --git a/README.md b/README.md index b275e52a..ca384289 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # 力扣题库(完整版) -> 最后更新日期: **2023.08.11** +> 最后更新日期: **2023.08.20** > > 使用脚本前请务必仔细完整阅读本 `README.md` 文件 diff --git a/leetcode-cn/origin-data.json b/leetcode-cn/origin-data.json index d4f0ea53..ff4846f6 100644 --- a/leetcode-cn/origin-data.json +++ b/leetcode-cn/origin-data.json @@ -1,7 +1,7 @@ { "user_name": "", "num_solved": 0, - "num_total": 3202, + "num_total": 3219, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, @@ -12,8 +12,8 @@ "question__title": "万灵之树", "question__title_slug": "cnHoX6", "question__hide": false, - "total_acs": 236, - "total_submitted": 1572, + "total_acs": 241, + "total_submitted": 1587, "total_column_articles": 5, "frontend_question_id": "LCP 82", "is_new_question": false @@ -33,8 +33,8 @@ "question__title": "与非的谜题", "question__title_slug": "ryfUiz", "question__hide": false, - "total_acs": 594, - "total_submitted": 1239, + "total_acs": 607, + "total_submitted": 1254, "total_column_articles": 15, "frontend_question_id": "LCP 81", "is_new_question": false @@ -54,8 +54,8 @@ "question__title": "生物进化录", "question__title_slug": "qoQAMX", "question__hide": false, - "total_acs": 915, - "total_submitted": 1798, + "total_acs": 967, + "total_submitted": 1853, "total_column_articles": 14, "frontend_question_id": "LCP 80", "is_new_question": false @@ -75,8 +75,8 @@ "question__title": "提取咒文", "question__title_slug": "kjpLFZ", "question__hide": false, - "total_acs": 1576, - "total_submitted": 5332, + "total_acs": 1578, + "total_submitted": 5348, "total_column_articles": 18, "frontend_question_id": "LCP 79", "is_new_question": false @@ -96,8 +96,8 @@ "question__title": "城墙防线", "question__title_slug": "Nsibyl", "question__hide": false, - "total_acs": 1515, - "total_submitted": 3285, + "total_acs": 1526, + "total_submitted": 3306, "total_column_articles": 22, "frontend_question_id": "LCP 78", "is_new_question": false @@ -117,9 +117,9 @@ "question__title": "符文储备", "question__title_slug": "W2ZX4X", "question__hide": false, - "total_acs": 2455, - "total_submitted": 3495, - "total_column_articles": 26, + "total_acs": 2504, + "total_submitted": 3582, + "total_column_articles": 28, "frontend_question_id": "LCP 77", "is_new_question": false }, @@ -138,8 +138,8 @@ "question__title": "魔法棋盘", "question__title_slug": "1ybDKD", "question__hide": false, - "total_acs": 673, - "total_submitted": 1794, + "total_acs": 674, + "total_submitted": 1796, "total_column_articles": 12, "frontend_question_id": "LCP 76", "is_new_question": false @@ -159,8 +159,8 @@ "question__title": "传送卷轴", "question__title_slug": "rdmXM7", "question__hide": false, - "total_acs": 856, - "total_submitted": 2333, + "total_acs": 858, + "total_submitted": 2335, "total_column_articles": 15, "frontend_question_id": "LCP 75", "is_new_question": false @@ -180,8 +180,8 @@ "question__title": "最强祝福力场", "question__title_slug": "xepqZ5", "question__hide": false, - "total_acs": 2044, - "total_submitted": 7040, + "total_acs": 2060, + "total_submitted": 7070, "total_column_articles": 35, "frontend_question_id": "LCP 74", "is_new_question": false @@ -201,8 +201,8 @@ "question__title": "探险营地", "question__title_slug": "0Zeoeg", "question__hide": false, - "total_acs": 3166, - "total_submitted": 6907, + "total_acs": 3176, + "total_submitted": 6928, "total_column_articles": 26, "frontend_question_id": "LCP 73", "is_new_question": false @@ -222,8 +222,8 @@ "question__title": "补给马车", "question__title_slug": "hqCnmP", "question__hide": false, - "total_acs": 3809, - "total_submitted": 5536, + "total_acs": 3841, + "total_submitted": 5587, "total_column_articles": 44, "frontend_question_id": "LCP 72", "is_new_question": false @@ -243,8 +243,8 @@ "question__title": "集水器", "question__title_slug": "kskhHQ", "question__hide": false, - "total_acs": 606, - "total_submitted": 1082, + "total_acs": 611, + "total_submitted": 1087, "total_column_articles": 13, "frontend_question_id": "LCP 71", "is_new_question": false @@ -285,8 +285,8 @@ "question__title": "Hello LeetCode!", "question__title_slug": "rMeRt2", "question__hide": false, - "total_acs": 1439, - "total_submitted": 3982, + "total_acs": 1440, + "total_submitted": 3983, "total_column_articles": 24, "frontend_question_id": "LCP 69", "is_new_question": false @@ -306,8 +306,8 @@ "question__title": "美观的花束", "question__title_slug": "1GxJYY", "question__hide": false, - "total_acs": 3335, - "total_submitted": 6523, + "total_acs": 3358, + "total_submitted": 6547, "total_column_articles": 52, "frontend_question_id": "LCP 68", "is_new_question": false @@ -327,9 +327,9 @@ "question__title": "装饰树", "question__title_slug": "KnLfVT", "question__hide": false, - "total_acs": 5619, - "total_submitted": 6399, - "total_column_articles": 82, + "total_acs": 5668, + "total_submitted": 6457, + "total_column_articles": 83, "frontend_question_id": "LCP 67", "is_new_question": false }, @@ -348,9 +348,9 @@ "question__title": "最小展台数量", "question__title_slug": "600YaG", "question__hide": false, - "total_acs": 5516, - "total_submitted": 7128, - "total_column_articles": 88, + "total_acs": 5558, + "total_submitted": 7181, + "total_column_articles": 89, "frontend_question_id": "LCP 66", "is_new_question": false }, @@ -369,8 +369,8 @@ "question__title": "弹珠游戏", "question__title_slug": "EXvqDp", "question__hide": false, - "total_acs": 4057, - "total_submitted": 15180, + "total_acs": 4065, + "total_submitted": 15191, "total_column_articles": 119, "frontend_question_id": "LCP 63", "is_new_question": false @@ -390,8 +390,8 @@ "question__title": "二叉树灯饰", "question__title_slug": "U7WvvU", "question__hide": false, - "total_acs": 2080, - "total_submitted": 5768, + "total_acs": 2121, + "total_submitted": 5815, "total_column_articles": 51, "frontend_question_id": "LCP 64", "is_new_question": false @@ -411,8 +411,8 @@ "question__title": "舒适的湿度", "question__title_slug": "3aqs1c", "question__hide": false, - "total_acs": 1049, - "total_submitted": 2290, + "total_acs": 1072, + "total_submitted": 2315, "total_column_articles": 18, "frontend_question_id": "LCP 65", "is_new_question": false @@ -432,9 +432,9 @@ "question__title": "交通枢纽", "question__title_slug": "D9PW8w", "question__hide": false, - "total_acs": 6103, - "total_submitted": 9757, - "total_column_articles": 74, + "total_acs": 6117, + "total_submitted": 9781, + "total_column_articles": 75, "frontend_question_id": "LCP 62", "is_new_question": false }, @@ -453,8 +453,8 @@ "question__title": "气温变化趋势", "question__title_slug": "6CE719", "question__hide": false, - "total_acs": 7801, - "total_submitted": 12688, + "total_acs": 7826, + "total_submitted": 12717, "total_column_articles": 85, "frontend_question_id": "LCP 61", "is_new_question": false @@ -474,8 +474,8 @@ "question__title": "积木拼接", "question__title_slug": "De4qBB", "question__hide": false, - "total_acs": 453, - "total_submitted": 1274, + "total_acs": 454, + "total_submitted": 1275, "total_column_articles": 19, "frontend_question_id": "LCP 58", "is_new_question": false @@ -495,8 +495,8 @@ "question__title": "力扣泡泡龙", "question__title_slug": "WInSav", "question__hide": false, - "total_acs": 894, - "total_submitted": 4515, + "total_acs": 895, + "total_submitted": 4521, "total_column_articles": 27, "frontend_question_id": "LCP 60", "is_new_question": false @@ -517,7 +517,7 @@ "question__title_slug": "NfY1m5", "question__hide": false, "total_acs": 360, - "total_submitted": 1003, + "total_submitted": 1004, "total_column_articles": 10, "frontend_question_id": "LCP 59", "is_new_question": false @@ -537,8 +537,8 @@ "question__title": "打地鼠", "question__title_slug": "ZbAuEH", "question__hide": false, - "total_acs": 1980, - "total_submitted": 7295, + "total_acs": 1983, + "total_submitted": 7319, "total_column_articles": 45, "frontend_question_id": "LCP 57", "is_new_question": false @@ -558,8 +558,8 @@ "question__title": "信物传送", "question__title_slug": "6UEx57", "question__hide": false, - "total_acs": 2630, - "total_submitted": 5973, + "total_acs": 2646, + "total_submitted": 6000, "total_column_articles": 76, "frontend_question_id": "LCP 56", "is_new_question": false @@ -579,8 +579,8 @@ "question__title": "采集果实", "question__title_slug": "PTXy4P", "question__hide": false, - "total_acs": 5561, - "total_submitted": 7547, + "total_acs": 5585, + "total_submitted": 7578, "total_column_articles": 78, "frontend_question_id": "LCP 55", "is_new_question": false @@ -600,8 +600,8 @@ "question__title": "夺回据点", "question__title_slug": "s5kipK", "question__hide": false, - "total_acs": 576, - "total_submitted": 1425, + "total_acs": 578, + "total_submitted": 1430, "total_column_articles": 13, "frontend_question_id": "LCP 54", "is_new_question": false @@ -621,8 +621,8 @@ "question__title": "守护太空城", "question__title_slug": "EJvmW4", "question__hide": false, - "total_acs": 1022, - "total_submitted": 2263, + "total_acs": 1031, + "total_submitted": 2275, "total_column_articles": 18, "frontend_question_id": "LCP 53", "is_new_question": false @@ -642,8 +642,8 @@ "question__title": "二叉搜索树染色", "question__title_slug": "QO5KpG", "question__hide": false, - "total_acs": 4237, - "total_submitted": 14676, + "total_acs": 4276, + "total_submitted": 14760, "total_column_articles": 97, "frontend_question_id": "LCP 52", "is_new_question": false @@ -663,9 +663,9 @@ "question__title": "烹饪料理", "question__title_slug": "UEcfPD", "question__hide": false, - "total_acs": 5511, - "total_submitted": 11432, - "total_column_articles": 118, + "total_acs": 5542, + "total_submitted": 11490, + "total_column_articles": 121, "frontend_question_id": "LCP 51", "is_new_question": false }, @@ -684,8 +684,8 @@ "question__title": "宝石补给", "question__title_slug": "WHnhjV", "question__hide": false, - "total_acs": 7954, - "total_submitted": 11618, + "total_acs": 7978, + "total_submitted": 11650, "total_column_articles": 79, "frontend_question_id": "LCP 50", "is_new_question": false @@ -705,8 +705,8 @@ "question__title": "自行车炫技赛场", "question__title_slug": "kplEvH", "question__hide": false, - "total_acs": 2763, - "total_submitted": 9290, + "total_acs": 2765, + "total_submitted": 9296, "total_column_articles": 60, "frontend_question_id": "LCP 45", "is_new_question": false @@ -727,7 +727,7 @@ "question__title_slug": "fsa7oZ", "question__hide": false, "total_acs": 987, - "total_submitted": 3599, + "total_submitted": 3601, "total_column_articles": 17, "frontend_question_id": "LCP 48", "is_new_question": false @@ -747,8 +747,8 @@ "question__title": "志愿者调配", "question__title_slug": "05ZEDJ", "question__hide": false, - "total_acs": 1997, - "total_submitted": 4054, + "total_acs": 2003, + "total_submitted": 4070, "total_column_articles": 45, "frontend_question_id": "LCP 46", "is_new_question": false @@ -768,8 +768,8 @@ "question__title": "玩具套圈", "question__title_slug": "vFjcfV", "question__hide": false, - "total_acs": 2647, - "total_submitted": 9263, + "total_acs": 2651, + "total_submitted": 9272, "total_column_articles": 49, "frontend_question_id": "LCP 42", "is_new_question": false @@ -789,8 +789,8 @@ "question__title": "黑白翻转棋", "question__title_slug": "fHi6rV", "question__hide": false, - "total_acs": 11545, - "total_submitted": 16872, + "total_acs": 11550, + "total_submitted": 16881, "total_column_articles": 141, "frontend_question_id": "LCP 41", "is_new_question": false @@ -810,8 +810,8 @@ "question__title": "无人机方阵", "question__title_slug": "0jQkd0", "question__hide": false, - "total_acs": 9077, - "total_submitted": 16338, + "total_acs": 9099, + "total_submitted": 16381, "total_column_articles": 100, "frontend_question_id": "LCP 39", "is_new_question": false @@ -831,8 +831,8 @@ "question__title": "心算挑战", "question__title_slug": "uOAnQW", "question__hide": false, - "total_acs": 9352, - "total_submitted": 29749, + "total_acs": 9378, + "total_submitted": 29835, "total_column_articles": 189, "frontend_question_id": "LCP 40", "is_new_question": false @@ -873,8 +873,8 @@ "question__title": "开幕式焰火", "question__title_slug": "sZ59z6", "question__hide": false, - "total_acs": 14870, - "total_submitted": 18910, + "total_acs": 14943, + "total_submitted": 19027, "total_column_articles": 221, "frontend_question_id": "LCP 44", "is_new_question": false @@ -894,8 +894,8 @@ "question__title": "入场安检", "question__title_slug": "oPs9Bm", "question__hide": false, - "total_acs": 1816, - "total_submitted": 4022, + "total_acs": 1817, + "total_submitted": 4023, "total_column_articles": 33, "frontend_question_id": "LCP 47", "is_new_question": false @@ -936,9 +936,9 @@ "question__title": "省份数量", "question__title_slug": "bLyHh0", "question__hide": false, - "total_acs": 23469, - "total_submitted": 34884, - "total_column_articles": 218, + "total_acs": 23604, + "total_submitted": 35076, + "total_column_articles": 220, "frontend_question_id": "LCR 116", "is_new_question": false }, @@ -957,9 +957,9 @@ "question__title": "不同路径", "question__title_slug": "2AoeFn", "question__hide": false, - "total_acs": 22142, - "total_submitted": 29055, - "total_column_articles": 215, + "total_acs": 22294, + "total_submitted": 29255, + "total_column_articles": 217, "frontend_question_id": "LCR 098", "is_new_question": false }, @@ -978,9 +978,9 @@ "question__title": "组合", "question__title_slug": "uUsW3B", "question__hide": false, - "total_acs": 29967, - "total_submitted": 36087, - "total_column_articles": 208, + "total_acs": 30211, + "total_submitted": 36434, + "total_column_articles": 210, "frontend_question_id": "LCR 080", "is_new_question": false }, @@ -999,9 +999,9 @@ "question__title": "子集", "question__title_slug": "TVdhkn", "question__hide": false, - "total_acs": 32577, - "total_submitted": 38229, - "total_column_articles": 317, + "total_acs": 32790, + "total_submitted": 38499, + "total_column_articles": 319, "frontend_question_id": "LCR 079", "is_new_question": false }, @@ -1020,8 +1020,8 @@ "question__title": "合并 K 个升序链表", "question__title_slug": "vvXgSW", "question__hide": false, - "total_acs": 31746, - "total_submitted": 49402, + "total_acs": 32082, + "total_submitted": 49883, "total_column_articles": 282, "frontend_question_id": "LCR 078", "is_new_question": false @@ -1041,9 +1041,9 @@ "question__title": "排序链表", "question__title_slug": "7WHec2", "question__hide": false, - "total_acs": 40564, - "total_submitted": 64480, - "total_column_articles": 375, + "total_acs": 40830, + "total_submitted": 64912, + "total_column_articles": 376, "frontend_question_id": "LCR 077", "is_new_question": false }, @@ -1062,8 +1062,8 @@ "question__title": "数组中的第 K 个最大元素", "question__title_slug": "xx4gT2", "question__hide": false, - "total_acs": 48521, - "total_submitted": 72494, + "total_acs": 48972, + "total_submitted": 73262, "total_column_articles": 310, "frontend_question_id": "LCR 076", "is_new_question": false @@ -1083,9 +1083,9 @@ "question__title": "数组的相对排序", "question__title_slug": "0H97ZC", "question__hide": false, - "total_acs": 28191, - "total_submitted": 40226, - "total_column_articles": 354, + "total_acs": 28298, + "total_submitted": 40397, + "total_column_articles": 355, "frontend_question_id": "LCR 075", "is_new_question": false }, @@ -1104,9 +1104,9 @@ "question__title": "合并区间", "question__title_slug": "SsGoHC", "question__hide": false, - "total_acs": 29706, - "total_submitted": 52567, - "total_column_articles": 260, + "total_acs": 29946, + "total_submitted": 53009, + "total_column_articles": 263, "frontend_question_id": "LCR 074", "is_new_question": false }, @@ -1125,8 +1125,8 @@ "question__title": "爱吃香蕉的狒狒", "question__title_slug": "nZZqjQ", "question__hide": false, - "total_acs": 24470, - "total_submitted": 45904, + "total_acs": 24585, + "total_submitted": 46114, "total_column_articles": 193, "frontend_question_id": "LCR 073", "is_new_question": false @@ -1146,8 +1146,8 @@ "question__title": "x 的平方根", "question__title_slug": "jJ0w9p", "question__hide": false, - "total_acs": 38618, - "total_submitted": 89492, + "total_acs": 38841, + "total_submitted": 90025, "total_column_articles": 252, "frontend_question_id": "LCR 072", "is_new_question": false @@ -1167,8 +1167,8 @@ "question__title": "按权重随机选择", "question__title_slug": "cuyjEf", "question__hide": false, - "total_acs": 17392, - "total_submitted": 34893, + "total_acs": 17462, + "total_submitted": 35034, "total_column_articles": 113, "frontend_question_id": "LCR 071", "is_new_question": false @@ -1188,8 +1188,8 @@ "question__title": "有序数组中的单一元素", "question__title_slug": "skFtm2", "question__hide": false, - "total_acs": 31545, - "total_submitted": 51686, + "total_acs": 31711, + "total_submitted": 51991, "total_column_articles": 274, "frontend_question_id": "LCR 070", "is_new_question": false @@ -1209,9 +1209,9 @@ "question__title": "山脉数组的峰顶索引", "question__title_slug": "B1IidL", "question__hide": false, - "total_acs": 67015, - "total_submitted": 94836, - "total_column_articles": 619, + "total_acs": 67170, + "total_submitted": 95036, + "total_column_articles": 620, "frontend_question_id": "LCR 069", "is_new_question": false }, @@ -1230,8 +1230,8 @@ "question__title": "搜索插入位置", "question__title_slug": "N6YdxV", "question__hide": false, - "total_acs": 32613, - "total_submitted": 66512, + "total_acs": 32810, + "total_submitted": 66951, "total_column_articles": 278, "frontend_question_id": "LCR 068", "is_new_question": false @@ -1251,9 +1251,9 @@ "question__title": "数组中两个数的最大异或值", "question__title_slug": "ms70jA", "question__hide": false, - "total_acs": 15160, - "total_submitted": 23051, - "total_column_articles": 156, + "total_acs": 15219, + "total_submitted": 23132, + "total_column_articles": 157, "frontend_question_id": "LCR 067", "is_new_question": false }, @@ -1272,9 +1272,9 @@ "question__title": " 键值映射", "question__title_slug": "z1R5dt", "question__hide": false, - "total_acs": 16813, - "total_submitted": 26142, - "total_column_articles": 231, + "total_acs": 16864, + "total_submitted": 26218, + "total_column_articles": 232, "frontend_question_id": "LCR 066", "is_new_question": false }, @@ -1293,9 +1293,9 @@ "question__title": "单词的压缩编码", "question__title_slug": "iSwD2y", "question__hide": false, - "total_acs": 16997, - "total_submitted": 26922, - "total_column_articles": 176, + "total_acs": 17045, + "total_submitted": 27005, + "total_column_articles": 177, "frontend_question_id": "LCR 065", "is_new_question": false }, @@ -1314,9 +1314,9 @@ "question__title": "实现一个魔法字典", "question__title_slug": "US1pGT", "question__hide": false, - "total_acs": 16831, - "total_submitted": 27593, - "total_column_articles": 175, + "total_acs": 16887, + "total_submitted": 27676, + "total_column_articles": 176, "frontend_question_id": "LCR 064", "is_new_question": false }, @@ -1335,9 +1335,9 @@ "question__title": "单词替换", "question__title_slug": "UhWRSj", "question__hide": false, - "total_acs": 21217, - "total_submitted": 29929, - "total_column_articles": 261, + "total_acs": 21303, + "total_submitted": 30044, + "total_column_articles": 262, "frontend_question_id": "LCR 063", "is_new_question": false }, @@ -1356,8 +1356,8 @@ "question__title": "查找和最小的 K 对数字", "question__title_slug": "qn8gGX", "question__hide": false, - "total_acs": 21522, - "total_submitted": 40296, + "total_acs": 21608, + "total_submitted": 40474, "total_column_articles": 189, "frontend_question_id": "LCR 061", "is_new_question": false @@ -1377,8 +1377,8 @@ "question__title": "实现 Trie (前缀树)", "question__title_slug": "QC3q1f", "question__hide": false, - "total_acs": 24092, - "total_submitted": 31924, + "total_acs": 24226, + "total_submitted": 32112, "total_column_articles": 211, "frontend_question_id": "LCR 062", "is_new_question": false @@ -1398,8 +1398,8 @@ "question__title": "前 K 个高频元素", "question__title_slug": "g5c51o", "question__hide": false, - "total_acs": 27898, - "total_submitted": 40717, + "total_acs": 28047, + "total_submitted": 40953, "total_column_articles": 278, "frontend_question_id": "LCR 060", "is_new_question": false @@ -1419,8 +1419,8 @@ "question__title": "数据流中的第 K 大元素", "question__title_slug": "jBjn9C", "question__hide": false, - "total_acs": 24884, - "total_submitted": 39754, + "total_acs": 24988, + "total_submitted": 39943, "total_column_articles": 204, "frontend_question_id": "LCR 059", "is_new_question": false @@ -1440,8 +1440,8 @@ "question__title": "我的日程安排表 I", "question__title_slug": "fi9suh", "question__hide": false, - "total_acs": 19758, - "total_submitted": 32291, + "total_acs": 19816, + "total_submitted": 32390, "total_column_articles": 176, "frontend_question_id": "LCR 058", "is_new_question": false @@ -1461,9 +1461,9 @@ "question__title": "存在重复元素 III", "question__title_slug": "7WqeDu", "question__hide": false, - "total_acs": 21248, - "total_submitted": 60851, - "total_column_articles": 146, + "total_acs": 21326, + "total_submitted": 61117, + "total_column_articles": 147, "frontend_question_id": "LCR 057", "is_new_question": false }, @@ -1482,9 +1482,9 @@ "question__title": "最长连续序列", "question__title_slug": "WhsWhI", "question__hide": false, - "total_acs": 27367, - "total_submitted": 55651, - "total_column_articles": 235, + "total_acs": 27565, + "total_submitted": 56078, + "total_column_articles": 238, "frontend_question_id": "LCR 119", "is_new_question": false }, @@ -1503,9 +1503,9 @@ "question__title": "两数之和 IV - 输入二叉搜索树", "question__title_slug": "opLdQZ", "question__hide": false, - "total_acs": 32996, - "total_submitted": 44961, - "total_column_articles": 312, + "total_acs": 33105, + "total_submitted": 45117, + "total_column_articles": 314, "frontend_question_id": "LCR 056", "is_new_question": false }, @@ -1524,8 +1524,8 @@ "question__title": "冗余连接", "question__title_slug": "7LpjUW", "question__hide": false, - "total_acs": 12084, - "total_submitted": 17421, + "total_acs": 12141, + "total_submitted": 17504, "total_column_articles": 132, "frontend_question_id": "LCR 118", "is_new_question": false @@ -1545,9 +1545,9 @@ "question__title": "相似字符串组", "question__title_slug": "H6lPxb", "question__hide": false, - "total_acs": 10235, - "total_submitted": 16484, - "total_column_articles": 98, + "total_acs": 10272, + "total_submitted": 16540, + "total_column_articles": 100, "frontend_question_id": "LCR 117", "is_new_question": false }, @@ -1566,8 +1566,8 @@ "question__title": "二叉搜索树迭代器", "question__title_slug": "kTOapQ", "question__hide": false, - "total_acs": 22540, - "total_submitted": 26458, + "total_acs": 22610, + "total_submitted": 26533, "total_column_articles": 201, "frontend_question_id": "LCR 055", "is_new_question": false @@ -1587,9 +1587,9 @@ "question__title": "把二叉搜索树转换为累加树", "question__title_slug": "w6cpku", "question__hide": false, - "total_acs": 27683, - "total_submitted": 32315, - "total_column_articles": 281, + "total_acs": 27826, + "total_submitted": 32486, + "total_column_articles": 282, "frontend_question_id": "LCR 054", "is_new_question": false }, @@ -1608,8 +1608,8 @@ "question__title": "序列重建", "question__title_slug": "ur2n8P", "question__hide": false, - "total_acs": 25915, - "total_submitted": 50702, + "total_acs": 26063, + "total_submitted": 50917, "total_column_articles": 284, "frontend_question_id": "LCR 115", "is_new_question": false @@ -1629,9 +1629,9 @@ "question__title": "二叉搜索树中的中序后继", "question__title_slug": "P5rCT8", "question__hide": false, - "total_acs": 33972, - "total_submitted": 53808, - "total_column_articles": 283, + "total_acs": 34099, + "total_submitted": 54007, + "total_column_articles": 285, "frontend_question_id": "LCR 053", "is_new_question": false }, @@ -1650,8 +1650,8 @@ "question__title": "火星词典", "question__title_slug": "Jf1JuT", "question__hide": false, - "total_acs": 21936, - "total_submitted": 42434, + "total_acs": 22073, + "total_submitted": 42674, "total_column_articles": 218, "frontend_question_id": "LCR 114", "is_new_question": false @@ -1671,9 +1671,9 @@ "question__title": "递增顺序搜索树", "question__title_slug": "NYBBNL", "question__hide": false, - "total_acs": 32540, - "total_submitted": 44241, - "total_column_articles": 280, + "total_acs": 32656, + "total_submitted": 44395, + "total_column_articles": 281, "frontend_question_id": "LCR 052", "is_new_question": false }, @@ -1692,9 +1692,9 @@ "question__title": "课程表 II", "question__title_slug": "QA2IGt", "question__hide": false, - "total_acs": 15677, - "total_submitted": 27699, - "total_column_articles": 155, + "total_acs": 15773, + "total_submitted": 27868, + "total_column_articles": 154, "frontend_question_id": "LCR 113", "is_new_question": false }, @@ -1713,9 +1713,9 @@ "question__title": "二叉树中的最大路径和", "question__title_slug": "jC7MId", "question__hide": false, - "total_acs": 21242, - "total_submitted": 43258, - "total_column_articles": 174, + "total_acs": 21397, + "total_submitted": 43615, + "total_column_articles": 175, "frontend_question_id": "LCR 051", "is_new_question": false }, @@ -1734,8 +1734,8 @@ "question__title": "矩阵中的最长递增路径", "question__title_slug": "fpTFWP", "question__hide": false, - "total_acs": 14662, - "total_submitted": 25341, + "total_acs": 14741, + "total_submitted": 25481, "total_column_articles": 136, "frontend_question_id": "LCR 112", "is_new_question": false @@ -1755,8 +1755,8 @@ "question__title": "路径总和 III", "question__title_slug": "6eUYwP", "question__hide": false, - "total_acs": 27860, - "total_submitted": 54997, + "total_acs": 27974, + "total_submitted": 55314, "total_column_articles": 226, "frontend_question_id": "LCR 050", "is_new_question": false @@ -1776,8 +1776,8 @@ "question__title": "求根节点到叶节点数字之和", "question__title_slug": "3Etpl5", "question__hide": false, - "total_acs": 31588, - "total_submitted": 42874, + "total_acs": 31709, + "total_submitted": 43024, "total_column_articles": 298, "frontend_question_id": "LCR 049", "is_new_question": false @@ -1797,8 +1797,8 @@ "question__title": "除法求值", "question__title_slug": "vlzXQL", "question__hide": false, - "total_acs": 9674, - "total_submitted": 14961, + "total_acs": 9724, + "total_submitted": 15033, "total_column_articles": 120, "frontend_question_id": "LCR 111", "is_new_question": false @@ -1818,8 +1818,8 @@ "question__title": "二叉树的序列化与反序列化", "question__title_slug": "h54YBf", "question__hide": false, - "total_acs": 22883, - "total_submitted": 34225, + "total_acs": 23009, + "total_submitted": 34402, "total_column_articles": 191, "frontend_question_id": "LCR 048", "is_new_question": false @@ -1839,9 +1839,9 @@ "question__title": "所有可能的路径", "question__title_slug": "bP4bmD", "question__hide": false, - "total_acs": 19822, - "total_submitted": 24480, - "total_column_articles": 215, + "total_acs": 19945, + "total_submitted": 24636, + "total_column_articles": 216, "frontend_question_id": "LCR 110", "is_new_question": false }, @@ -1860,8 +1860,8 @@ "question__title": "打开转盘锁", "question__title_slug": "zlDJc7", "question__hide": false, - "total_acs": 14878, - "total_submitted": 25958, + "total_acs": 14968, + "total_submitted": 26146, "total_column_articles": 130, "frontend_question_id": "LCR 109", "is_new_question": false @@ -1881,8 +1881,8 @@ "question__title": "二叉树剪枝", "question__title_slug": "pOCWxh", "question__hide": false, - "total_acs": 31817, - "total_submitted": 46535, + "total_acs": 31978, + "total_submitted": 46783, "total_column_articles": 343, "frontend_question_id": "LCR 047", "is_new_question": false @@ -1902,8 +1902,8 @@ "question__title": "单词接龙", "question__title_slug": "om3reC", "question__hide": false, - "total_acs": 11325, - "total_submitted": 19216, + "total_acs": 11378, + "total_submitted": 19311, "total_column_articles": 90, "frontend_question_id": "LCR 108", "is_new_question": false @@ -1923,9 +1923,9 @@ "question__title": "二叉树的右视图", "question__title_slug": "WNC0Lk", "question__hide": false, - "total_acs": 29255, - "total_submitted": 41479, - "total_column_articles": 348, + "total_acs": 29387, + "total_submitted": 41686, + "total_column_articles": 349, "frontend_question_id": "LCR 046", "is_new_question": false }, @@ -1944,9 +1944,9 @@ "question__title": "找树左下角的值", "question__title_slug": "LwUNpT", "question__hide": false, - "total_acs": 33076, - "total_submitted": 41780, - "total_column_articles": 347, + "total_acs": 33217, + "total_submitted": 41965, + "total_column_articles": 348, "frontend_question_id": "LCR 045", "is_new_question": false }, @@ -1965,8 +1965,8 @@ "question__title": "在每个树行中找最大值", "question__title_slug": "hPov7L", "question__hide": false, - "total_acs": 32719, - "total_submitted": 50966, + "total_acs": 32818, + "total_submitted": 51096, "total_column_articles": 305, "frontend_question_id": "LCR 044", "is_new_question": false @@ -1986,8 +1986,8 @@ "question__title": "01 矩阵", "question__title_slug": "2bCMpM", "question__hide": false, - "total_acs": 15900, - "total_submitted": 31319, + "total_acs": 16007, + "total_submitted": 31583, "total_column_articles": 122, "frontend_question_id": "LCR 107", "is_new_question": false @@ -2007,9 +2007,9 @@ "question__title": "完全二叉树插入器", "question__title_slug": "NaqhDT", "question__hide": false, - "total_acs": 24011, - "total_submitted": 38482, - "total_column_articles": 272, + "total_acs": 24067, + "total_submitted": 38557, + "total_column_articles": 273, "frontend_question_id": "LCR 043", "is_new_question": false }, @@ -2028,8 +2028,8 @@ "question__title": "判断二分图", "question__title_slug": "vEAB3K", "question__hide": false, - "total_acs": 17046, - "total_submitted": 30869, + "total_acs": 17148, + "total_submitted": 31057, "total_column_articles": 152, "frontend_question_id": "LCR 106", "is_new_question": false @@ -2049,8 +2049,8 @@ "question__title": "最近的请求次数", "question__title_slug": "H8086Q", "question__hide": false, - "total_acs": 28744, - "total_submitted": 35078, + "total_acs": 28854, + "total_submitted": 35205, "total_column_articles": 222, "frontend_question_id": "LCR 042", "is_new_question": false @@ -2070,9 +2070,9 @@ "question__title": "数据流中的移动平均值", "question__title_slug": "qIsx9U", "question__hide": false, - "total_acs": 58966, - "total_submitted": 75822, - "total_column_articles": 481, + "total_acs": 59107, + "total_submitted": 76011, + "total_column_articles": 482, "frontend_question_id": "LCR 041", "is_new_question": false }, @@ -2091,9 +2091,9 @@ "question__title": "岛屿的最大面积", "question__title_slug": "ZL6zAn", "question__hide": false, - "total_acs": 31499, - "total_submitted": 45245, - "total_column_articles": 303, + "total_acs": 31818, + "total_submitted": 45722, + "total_column_articles": 305, "frontend_question_id": "LCR 105", "is_new_question": false }, @@ -2112,9 +2112,9 @@ "question__title": "组合总和 Ⅳ", "question__title_slug": "D0F0SV", "question__hide": false, - "total_acs": 15468, - "total_submitted": 26972, - "total_column_articles": 115, + "total_acs": 15560, + "total_submitted": 27138, + "total_column_articles": 116, "frontend_question_id": "LCR 104", "is_new_question": false }, @@ -2133,9 +2133,9 @@ "question__title": "零钱兑换", "question__title_slug": "gaM7Ch", "question__hide": false, - "total_acs": 30335, - "total_submitted": 59349, - "total_column_articles": 191, + "total_acs": 30632, + "total_submitted": 59846, + "total_column_articles": 192, "frontend_question_id": "LCR 103", "is_new_question": false }, @@ -2154,9 +2154,9 @@ "question__title": "目标和", "question__title_slug": "YaVDxD", "question__hide": false, - "total_acs": 21421, - "total_submitted": 37754, - "total_column_articles": 141, + "total_acs": 21584, + "total_submitted": 38064, + "total_column_articles": 142, "frontend_question_id": "LCR 102", "is_new_question": false }, @@ -2175,8 +2175,8 @@ "question__title": "分割等和子集", "question__title_slug": "NUPfPr", "question__hide": false, - "total_acs": 26708, - "total_submitted": 54188, + "total_acs": 26886, + "total_submitted": 54597, "total_column_articles": 168, "frontend_question_id": "LCR 101", "is_new_question": false @@ -2196,8 +2196,8 @@ "question__title": "三角形最小路径和", "question__title_slug": "IlPe0q", "question__hide": false, - "total_acs": 22264, - "total_submitted": 29966, + "total_acs": 22383, + "total_submitted": 30128, "total_column_articles": 224, "frontend_question_id": "LCR 100", "is_new_question": false @@ -2217,8 +2217,8 @@ "question__title": "最小路径和", "question__title_slug": "0i0mDW", "question__hide": false, - "total_acs": 25957, - "total_submitted": 35383, + "total_acs": 26132, + "total_submitted": 35637, "total_column_articles": 227, "frontend_question_id": "LCR 099", "is_new_question": false @@ -2238,8 +2238,8 @@ "question__title": "最大矩形", "question__title_slug": "PLYXKQ", "question__hide": false, - "total_acs": 18259, - "total_submitted": 31368, + "total_acs": 18341, + "total_submitted": 31481, "total_column_articles": 195, "frontend_question_id": "LCR 040", "is_new_question": false @@ -2259,9 +2259,9 @@ "question__title": "柱状图中最大的矩形", "question__title_slug": "0ynMMM", "question__hide": false, - "total_acs": 27447, - "total_submitted": 54148, - "total_column_articles": 210, + "total_acs": 27577, + "total_submitted": 54462, + "total_column_articles": 211, "frontend_question_id": "LCR 039", "is_new_question": false }, @@ -2280,8 +2280,8 @@ "question__title": "每日温度", "question__title_slug": "iIQa4I", "question__hide": false, - "total_acs": 39362, - "total_submitted": 51674, + "total_acs": 39529, + "total_submitted": 51918, "total_column_articles": 345, "frontend_question_id": "LCR 038", "is_new_question": false @@ -2301,9 +2301,9 @@ "question__title": "行星碰撞", "question__title_slug": "XagZNi", "question__hide": false, - "total_acs": 31820, - "total_submitted": 70878, - "total_column_articles": 340, + "total_acs": 31919, + "total_submitted": 71087, + "total_column_articles": 341, "frontend_question_id": "LCR 037", "is_new_question": false }, @@ -2322,9 +2322,9 @@ "question__title": "不同的子序列", "question__title_slug": "21dk04", "question__hide": false, - "total_acs": 15496, - "total_submitted": 28058, - "total_column_articles": 123, + "total_acs": 15592, + "total_submitted": 28264, + "total_column_articles": 125, "frontend_question_id": "LCR 097", "is_new_question": false }, @@ -2343,9 +2343,9 @@ "question__title": "逆波兰表达式求值", "question__title_slug": "8Zf90G", "question__hide": false, - "total_acs": 29955, - "total_submitted": 54120, - "total_column_articles": 287, + "total_acs": 30111, + "total_submitted": 54436, + "total_column_articles": 288, "frontend_question_id": "LCR 036", "is_new_question": false }, @@ -2364,9 +2364,9 @@ "question__title": "最小时间差", "question__title_slug": "569nqc", "question__hide": false, - "total_acs": 31052, - "total_submitted": 47083, - "total_column_articles": 222, + "total_acs": 31135, + "total_submitted": 47226, + "total_column_articles": 223, "frontend_question_id": "LCR 035", "is_new_question": false }, @@ -2385,8 +2385,8 @@ "question__title": "交错字符串", "question__title_slug": "IY6buf", "question__hide": false, - "total_acs": 17159, - "total_submitted": 35699, + "total_acs": 17265, + "total_submitted": 35945, "total_column_articles": 127, "frontend_question_id": "LCR 096", "is_new_question": false @@ -2406,9 +2406,9 @@ "question__title": "验证外星语词典", "question__title_slug": "lwyVBB", "question__hide": false, - "total_acs": 26288, - "total_submitted": 47162, - "total_column_articles": 314, + "total_acs": 26362, + "total_submitted": 47270, + "total_column_articles": 315, "frontend_question_id": "LCR 034", "is_new_question": false }, @@ -2427,9 +2427,9 @@ "question__title": "字母异位词分组", "question__title_slug": "sfvd7V", "question__hide": false, - "total_acs": 30653, - "total_submitted": 41090, - "total_column_articles": 238, + "total_acs": 30731, + "total_submitted": 41201, + "total_column_articles": 239, "frontend_question_id": "LCR 033", "is_new_question": false }, @@ -2448,8 +2448,8 @@ "question__title": "最长公共子序列", "question__title_slug": "qJnOS7", "question__hide": false, - "total_acs": 45381, - "total_submitted": 69348, + "total_acs": 45812, + "total_submitted": 69995, "total_column_articles": 280, "frontend_question_id": "LCR 095", "is_new_question": false @@ -2469,9 +2469,9 @@ "question__title": "有效的字母异位词", "question__title_slug": "dKk3P7", "question__hide": false, - "total_acs": 36001, - "total_submitted": 60397, - "total_column_articles": 280, + "total_acs": 36134, + "total_submitted": 60647, + "total_column_articles": 281, "frontend_question_id": "LCR 032", "is_new_question": false }, @@ -2490,8 +2490,8 @@ "question__title": "分割回文串 II", "question__title_slug": "omKAoA", "question__hide": false, - "total_acs": 14816, - "total_submitted": 25719, + "total_acs": 14914, + "total_submitted": 25955, "total_column_articles": 111, "frontend_question_id": "LCR 094", "is_new_question": false @@ -2511,8 +2511,8 @@ "question__title": "最长的斐波那契子序列的长度", "question__title_slug": "Q91FMA", "question__hide": false, - "total_acs": 20973, - "total_submitted": 35942, + "total_acs": 21057, + "total_submitted": 36110, "total_column_articles": 141, "frontend_question_id": "LCR 093", "is_new_question": false @@ -2532,8 +2532,8 @@ "question__title": "LRU 缓存", "question__title_slug": "OrIXps", "question__hide": false, - "total_acs": 28457, - "total_submitted": 51222, + "total_acs": 28580, + "total_submitted": 51506, "total_column_articles": 273, "frontend_question_id": "LCR 031", "is_new_question": false @@ -2553,8 +2553,8 @@ "question__title": "将字符串翻转到单调递增", "question__title_slug": "cyJERH", "question__hide": false, - "total_acs": 22429, - "total_submitted": 32916, + "total_acs": 22530, + "total_submitted": 33056, "total_column_articles": 250, "frontend_question_id": "LCR 092", "is_new_question": false @@ -2574,8 +2574,8 @@ "question__title": "粉刷房子", "question__title_slug": "JEj789", "question__hide": false, - "total_acs": 47748, - "total_submitted": 61563, + "total_acs": 47947, + "total_submitted": 61870, "total_column_articles": 560, "frontend_question_id": "LCR 091", "is_new_question": false @@ -2595,9 +2595,9 @@ "question__title": "O(1) 时间插入、删除和获取随机元素", "question__title_slug": "FortPu", "question__hide": false, - "total_acs": 26379, - "total_submitted": 48998, - "total_column_articles": 178, + "total_acs": 26467, + "total_submitted": 49127, + "total_column_articles": 179, "frontend_question_id": "LCR 030", "is_new_question": false }, @@ -2616,9 +2616,9 @@ "question__title": "打家劫舍 II", "question__title_slug": "PzWKhm", "question__hide": false, - "total_acs": 19687, - "total_submitted": 40355, - "total_column_articles": 161, + "total_acs": 20001, + "total_submitted": 41048, + "total_column_articles": 164, "frontend_question_id": "LCR 090", "is_new_question": false }, @@ -2637,9 +2637,9 @@ "question__title": "循环有序列表的插入", "question__title_slug": "4ueAj6", "question__hide": false, - "total_acs": 47287, - "total_submitted": 142112, - "total_column_articles": 635, + "total_acs": 47384, + "total_submitted": 142335, + "total_column_articles": 636, "frontend_question_id": "LCR 029", "is_new_question": false }, @@ -2658,8 +2658,8 @@ "question__title": "扁平化多级双向链表", "question__title_slug": "Qv1Da2", "question__hide": false, - "total_acs": 26873, - "total_submitted": 44793, + "total_acs": 26938, + "total_submitted": 44903, "total_column_articles": 353, "frontend_question_id": "LCR 028", "is_new_question": false @@ -2679,9 +2679,9 @@ "question__title": "回文链表", "question__title_slug": "aMhZSa", "question__hide": false, - "total_acs": 65443, - "total_submitted": 107327, - "total_column_articles": 519, + "total_acs": 65853, + "total_submitted": 108039, + "total_column_articles": 520, "frontend_question_id": "LCR 027", "is_new_question": false }, @@ -2700,8 +2700,8 @@ "question__title": "重排链表", "question__title_slug": "LGjMqU", "question__hide": false, - "total_acs": 44280, - "total_submitted": 66793, + "total_acs": 44493, + "total_submitted": 67144, "total_column_articles": 395, "frontend_question_id": "LCR 026", "is_new_question": false @@ -2721,8 +2721,8 @@ "question__title": "两数相加 II", "question__title_slug": "lMSNwu", "question__hide": false, - "total_acs": 41028, - "total_submitted": 70391, + "total_acs": 41155, + "total_submitted": 70636, "total_column_articles": 420, "frontend_question_id": "LCR 025", "is_new_question": false @@ -2742,9 +2742,9 @@ "question__title": "反转链表", "question__title_slug": "UHnkqh", "question__hide": false, - "total_acs": 103845, - "total_submitted": 137942, - "total_column_articles": 606, + "total_acs": 104818, + "total_submitted": 139235, + "total_column_articles": 608, "frontend_question_id": "LCR 024", "is_new_question": false }, @@ -2763,8 +2763,8 @@ "question__title": "相交链表", "question__title_slug": "3u1WK4", "question__hide": false, - "total_acs": 46965, - "total_submitted": 67056, + "total_acs": 47355, + "total_submitted": 67670, "total_column_articles": 310, "frontend_question_id": "LCR 023", "is_new_question": false @@ -2784,9 +2784,9 @@ "question__title": "环形链表 II", "question__title_slug": "c32eOV", "question__hide": false, - "total_acs": 59487, - "total_submitted": 106557, - "total_column_articles": 384, + "total_acs": 59820, + "total_submitted": 107125, + "total_column_articles": 385, "frontend_question_id": "LCR 022", "is_new_question": false }, @@ -2805,9 +2805,9 @@ "question__title": "删除链表的倒数第 N 个结点", "question__title_slug": "SLwz0R", "question__hide": false, - "total_acs": 55022, - "total_submitted": 101186, - "total_column_articles": 492, + "total_acs": 55358, + "total_submitted": 101716, + "total_column_articles": 495, "frontend_question_id": "LCR 021", "is_new_question": false }, @@ -2826,8 +2826,8 @@ "question__title": "回文子串", "question__title_slug": "a7VOhD", "question__hide": false, - "total_acs": 39827, - "total_submitted": 55639, + "total_acs": 40068, + "total_submitted": 56023, "total_column_articles": 321, "frontend_question_id": "LCR 020", "is_new_question": false @@ -2847,9 +2847,9 @@ "question__title": "验证回文串 II", "question__title_slug": "RQku0D", "question__hide": false, - "total_acs": 39501, - "total_submitted": 86691, - "total_column_articles": 353, + "total_acs": 39634, + "total_submitted": 86989, + "total_column_articles": 355, "frontend_question_id": "LCR 019", "is_new_question": false }, @@ -2868,9 +2868,9 @@ "question__title": "验证回文串", "question__title_slug": "XltzEq", "question__hide": false, - "total_acs": 45228, - "total_submitted": 87767, - "total_column_articles": 362, + "total_acs": 45424, + "total_submitted": 88155, + "total_column_articles": 364, "frontend_question_id": "LCR 018", "is_new_question": false }, @@ -2889,8 +2889,8 @@ "question__title": "最小覆盖子串", "question__title_slug": "M1oyTv", "question__hide": false, - "total_acs": 32735, - "total_submitted": 64280, + "total_acs": 32892, + "total_submitted": 64589, "total_column_articles": 320, "frontend_question_id": "LCR 017", "is_new_question": false @@ -2910,9 +2910,9 @@ "question__title": "无重复字符的最长子串", "question__title_slug": "wtcaE1", "question__hide": false, - "total_acs": 49432, - "total_submitted": 103876, - "total_column_articles": 468, + "total_acs": 49800, + "total_submitted": 104629, + "total_column_articles": 469, "frontend_question_id": "LCR 016", "is_new_question": false }, @@ -2931,8 +2931,8 @@ "question__title": "找到字符串中所有字母异位词", "question__title_slug": "VabMRr", "question__hide": false, - "total_acs": 36409, - "total_submitted": 59097, + "total_acs": 36575, + "total_submitted": 59413, "total_column_articles": 310, "frontend_question_id": "LCR 015", "is_new_question": false @@ -2952,8 +2952,8 @@ "question__title": "字符串的排列", "question__title_slug": "MPnaiL", "question__hide": false, - "total_acs": 45587, - "total_submitted": 88562, + "total_acs": 45726, + "total_submitted": 88916, "total_column_articles": 352, "frontend_question_id": "LCR 014", "is_new_question": false @@ -2973,8 +2973,8 @@ "question__title": "二维区域和检索 - 矩阵不可变", "question__title_slug": "O4NDxx", "question__hide": false, - "total_acs": 36636, - "total_submitted": 53150, + "total_acs": 36727, + "total_submitted": 53275, "total_column_articles": 310, "frontend_question_id": "LCR 013", "is_new_question": false @@ -2994,8 +2994,8 @@ "question__title": "寻找数组的中心下标", "question__title_slug": "tvdfij", "question__hide": false, - "total_acs": 47495, - "total_submitted": 70772, + "total_acs": 47648, + "total_submitted": 70985, "total_column_articles": 417, "frontend_question_id": "LCR 012", "is_new_question": false @@ -3015,8 +3015,8 @@ "question__title": "连续数组", "question__title_slug": "A1NYOS", "question__hide": false, - "total_acs": 41943, - "total_submitted": 76426, + "total_acs": 42055, + "total_submitted": 76648, "total_column_articles": 353, "frontend_question_id": "LCR 011", "is_new_question": false @@ -3036,8 +3036,8 @@ "question__title": "和为 K 的子数组", "question__title_slug": "QTMn0o", "question__hide": false, - "total_acs": 55525, - "total_submitted": 129217, + "total_acs": 55766, + "total_submitted": 129785, "total_column_articles": 384, "frontend_question_id": "LCR 010", "is_new_question": false @@ -3057,9 +3057,9 @@ "question__title": "打家劫舍", "question__title_slug": "Gu0c2T", "question__hide": false, - "total_acs": 27833, - "total_submitted": 46016, - "total_column_articles": 210, + "total_acs": 28432, + "total_submitted": 46979, + "total_column_articles": 214, "frontend_question_id": "LCR 089", "is_new_question": false }, @@ -3078,9 +3078,9 @@ "question__title": "乘积小于 K 的子数组", "question__title_slug": "ZVAVXX", "question__hide": false, - "total_acs": 49871, - "total_submitted": 93937, - "total_column_articles": 395, + "total_acs": 50002, + "total_submitted": 94212, + "total_column_articles": 396, "frontend_question_id": "LCR 009", "is_new_question": false }, @@ -3099,9 +3099,9 @@ "question__title": "使用最小花费爬楼梯", "question__title_slug": "GzCJIP", "question__hide": false, - "total_acs": 39306, - "total_submitted": 54417, - "total_column_articles": 306, + "total_acs": 39579, + "total_submitted": 54803, + "total_column_articles": 309, "frontend_question_id": "LCR 088", "is_new_question": false }, @@ -3120,9 +3120,9 @@ "question__title": "长度最小的子数组", "question__title_slug": "2VG8Kg", "question__hide": false, - "total_acs": 59825, - "total_submitted": 119901, - "total_column_articles": 472, + "total_acs": 60076, + "total_submitted": 120386, + "total_column_articles": 473, "frontend_question_id": "LCR 008", "is_new_question": false }, @@ -3141,8 +3141,8 @@ "question__title": "复原 IP 地址", "question__title_slug": "0on3uN", "question__hide": false, - "total_acs": 22710, - "total_submitted": 35909, + "total_acs": 22806, + "total_submitted": 36056, "total_column_articles": 221, "frontend_question_id": "LCR 087", "is_new_question": false @@ -3162,8 +3162,8 @@ "question__title": "分割回文串", "question__title_slug": "M99OJA", "question__hide": false, - "total_acs": 21708, - "total_submitted": 28692, + "total_acs": 21831, + "total_submitted": 28888, "total_column_articles": 171, "frontend_question_id": "LCR 086", "is_new_question": false @@ -3183,8 +3183,8 @@ "question__title": "三数之和", "question__title_slug": "1fGaJU", "question__hide": false, - "total_acs": 57342, - "total_submitted": 131629, + "total_acs": 57624, + "total_submitted": 132290, "total_column_articles": 368, "frontend_question_id": "LCR 007", "is_new_question": false @@ -3204,9 +3204,9 @@ "question__title": "括号生成", "question__title_slug": "IDBivT", "question__hide": false, - "total_acs": 29940, - "total_submitted": 35228, - "total_column_articles": 290, + "total_acs": 30106, + "total_submitted": 35450, + "total_column_articles": 292, "frontend_question_id": "LCR 085", "is_new_question": false }, @@ -3225,9 +3225,9 @@ "question__title": "两数之和 II - 输入有序数组", "question__title_slug": "kLl5u1", "question__hide": false, - "total_acs": 66092, - "total_submitted": 98243, - "total_column_articles": 491, + "total_acs": 66302, + "total_submitted": 98545, + "total_column_articles": 493, "frontend_question_id": "LCR 006", "is_new_question": false }, @@ -3246,9 +3246,9 @@ "question__title": "最大单词长度乘积", "question__title_slug": "aseY1I", "question__hide": false, - "total_acs": 53825, - "total_submitted": 75677, - "total_column_articles": 416, + "total_acs": 53903, + "total_submitted": 75775, + "total_column_articles": 417, "frontend_question_id": "LCR 005", "is_new_question": false }, @@ -3267,9 +3267,9 @@ "question__title": "全排列 II ", "question__title_slug": "7p8L0Z", "question__hide": false, - "total_acs": 25188, - "total_submitted": 36299, - "total_column_articles": 204, + "total_acs": 25385, + "total_submitted": 36621, + "total_column_articles": 207, "frontend_question_id": "LCR 084", "is_new_question": false }, @@ -3288,9 +3288,9 @@ "question__title": "全排列", "question__title_slug": "VvJkup", "question__hide": false, - "total_acs": 29788, - "total_submitted": 34709, - "total_column_articles": 286, + "total_acs": 30217, + "total_submitted": 35259, + "total_column_articles": 287, "frontend_question_id": "LCR 083", "is_new_question": false }, @@ -3309,9 +3309,9 @@ "question__title": "只出现一次的数字 II", "question__title_slug": "WGki4K", "question__hide": false, - "total_acs": 66292, - "total_submitted": 93596, - "total_column_articles": 488, + "total_acs": 66420, + "total_submitted": 93754, + "total_column_articles": 489, "frontend_question_id": "LCR 004", "is_new_question": false }, @@ -3330,9 +3330,9 @@ "question__title": "组合总和 II", "question__title_slug": "4sjJUc", "question__hide": false, - "total_acs": 25708, - "total_submitted": 39038, - "total_column_articles": 202, + "total_acs": 25841, + "total_submitted": 39291, + "total_column_articles": 204, "frontend_question_id": "LCR 082", "is_new_question": false }, @@ -3351,9 +3351,9 @@ "question__title": "二进制求和", "question__title_slug": "JFETK5", "question__hide": false, - "total_acs": 59601, - "total_submitted": 110806, - "total_column_articles": 585, + "total_acs": 59696, + "total_submitted": 110997, + "total_column_articles": 586, "frontend_question_id": "LCR 002", "is_new_question": false }, @@ -3372,8 +3372,8 @@ "question__title": "比特位计数", "question__title_slug": "w3tCBm", "question__hide": false, - "total_acs": 76192, - "total_submitted": 97426, + "total_acs": 76363, + "total_submitted": 97627, "total_column_articles": 629, "frontend_question_id": "LCR 003", "is_new_question": false @@ -3393,9 +3393,9 @@ "question__title": "组合总和", "question__title_slug": "Ygoe9J", "question__hide": false, - "total_acs": 29824, - "total_submitted": 37023, - "total_column_articles": 249, + "total_acs": 30043, + "total_submitted": 37342, + "total_column_articles": 250, "frontend_question_id": "LCR 081", "is_new_question": false }, @@ -3414,8 +3414,8 @@ "question__title": "两数相除", "question__title_slug": "xoh6Oh", "question__hide": false, - "total_acs": 63814, - "total_submitted": 302718, + "total_acs": 63911, + "total_submitted": 303160, "total_column_articles": 522, "frontend_question_id": "LCR 001", "is_new_question": false @@ -3435,9 +3435,9 @@ "question__title": "主题空间", "question__title_slug": "YesdPw", "question__hide": false, - "total_acs": 3785, - "total_submitted": 9134, - "total_column_articles": 99, + "total_acs": 3799, + "total_submitted": 9180, + "total_column_articles": 100, "frontend_question_id": "LCS 03", "is_new_question": false }, @@ -3456,9 +3456,9 @@ "question__title": "完成一半题目", "question__title_slug": "WqXACV", "question__hide": false, - "total_acs": 9563, - "total_submitted": 14846, - "total_column_articles": 190, + "total_acs": 9619, + "total_submitted": 14911, + "total_column_articles": 192, "frontend_question_id": "LCS 02", "is_new_question": false }, @@ -3477,9 +3477,9 @@ "question__title": "下载插件", "question__title_slug": "Ju9Xwi", "question__hide": false, - "total_acs": 14023, - "total_submitted": 26048, - "total_column_articles": 274, + "total_acs": 14102, + "total_submitted": 26192, + "total_column_articles": 275, "frontend_question_id": "LCS 01", "is_new_question": false }, @@ -3498,8 +3498,8 @@ "question__title": "魔塔游戏", "question__title_slug": "p0NxJO", "question__hide": false, - "total_acs": 9767, - "total_submitted": 25886, + "total_acs": 9792, + "total_submitted": 25935, "total_column_articles": 143, "frontend_question_id": "LCP 30", "is_new_question": false @@ -3519,8 +3519,8 @@ "question__title": "守卫城堡", "question__title_slug": "7rLGCR", "question__hide": false, - "total_acs": 1103, - "total_submitted": 1965, + "total_acs": 1122, + "total_submitted": 1984, "total_column_articles": 19, "frontend_question_id": "LCP 38", "is_new_question": false @@ -3540,8 +3540,8 @@ "question__title": "最多牌组数", "question__title_slug": "Up5XYM", "question__hide": false, - "total_acs": 1699, - "total_submitted": 4904, + "total_acs": 1703, + "total_submitted": 4920, "total_column_articles": 26, "frontend_question_id": "LCP 36", "is_new_question": false @@ -3561,8 +3561,8 @@ "question__title": "蓄水", "question__title_slug": "o8SXZn", "question__hide": false, - "total_acs": 20610, - "total_submitted": 59181, + "total_acs": 20655, + "total_submitted": 59278, "total_column_articles": 199, "frontend_question_id": "LCP 33", "is_new_question": false @@ -3582,9 +3582,9 @@ "question__title": "电动车游城市", "question__title_slug": "DFPeFJ", "question__hide": false, - "total_acs": 2484, - "total_submitted": 5127, - "total_column_articles": 39, + "total_acs": 2685, + "total_submitted": 5576, + "total_column_articles": 43, "frontend_question_id": "LCP 35", "is_new_question": false }, @@ -3603,8 +3603,8 @@ "question__title": "批量处理任务", "question__title_slug": "t3fKg1", "question__hide": false, - "total_acs": 2349, - "total_submitted": 5518, + "total_acs": 2352, + "total_submitted": 5523, "total_column_articles": 32, "frontend_question_id": "LCP 32", "is_new_question": false @@ -3624,8 +3624,8 @@ "question__title": "变换的迷宫", "question__title_slug": "Db3wC1", "question__hide": false, - "total_acs": 2847, - "total_submitted": 9752, + "total_acs": 2849, + "total_submitted": 9754, "total_column_articles": 42, "frontend_question_id": "LCP 31", "is_new_question": false @@ -3645,8 +3645,8 @@ "question__title": "乐团站位", "question__title_slug": "SNJvJP", "question__hide": false, - "total_acs": 8305, - "total_submitted": 39181, + "total_acs": 8312, + "total_submitted": 39206, "total_column_articles": 171, "frontend_question_id": "LCP 29", "is_new_question": false @@ -3666,8 +3666,8 @@ "question__title": "采购方案", "question__title_slug": "4xy4Wx", "question__hide": false, - "total_acs": 19066, - "total_submitted": 59763, + "total_acs": 19117, + "total_submitted": 59877, "total_column_articles": 293, "frontend_question_id": "LCP 28", "is_new_question": false @@ -3687,8 +3687,8 @@ "question__title": "黑盒光线反射", "question__title_slug": "IQvJ9i", "question__hide": false, - "total_acs": 1695, - "total_submitted": 4920, + "total_acs": 1696, + "total_submitted": 4921, "total_column_articles": 30, "frontend_question_id": "LCP 27", "is_new_question": false @@ -3708,8 +3708,8 @@ "question__title": "早餐组合", "question__title_slug": "2vYnGI", "question__hide": false, - "total_acs": 25694, - "total_submitted": 84617, + "total_acs": 25742, + "total_submitted": 84782, "total_column_articles": 358, "frontend_question_id": "LCP 18", "is_new_question": false @@ -3729,8 +3729,8 @@ "question__title": "黑白方格画", "question__title_slug": "ccw6C7", "question__hide": false, - "total_acs": 11544, - "total_submitted": 32969, + "total_acs": 11565, + "total_submitted": 33021, "total_column_articles": 224, "frontend_question_id": "LCP 22", "is_new_question": false @@ -3750,9 +3750,9 @@ "question__title": "速算机器人", "question__title_slug": "nGK0Fy", "question__hide": false, - "total_acs": 33620, - "total_submitted": 41936, - "total_column_articles": 358, + "total_acs": 33738, + "total_submitted": 42093, + "total_column_articles": 359, "frontend_question_id": "LCP 17", "is_new_question": false }, @@ -3771,8 +3771,8 @@ "question__title": "古董键盘", "question__title_slug": "Uh984O", "question__hide": false, - "total_acs": 2031, - "total_submitted": 5385, + "total_acs": 2037, + "total_submitted": 5395, "total_column_articles": 36, "frontend_question_id": "LCP 25", "is_new_question": false @@ -3792,8 +3792,8 @@ "question__title": "追逐游戏", "question__title_slug": "Za25hA", "question__hide": false, - "total_acs": 1576, - "total_submitted": 4043, + "total_acs": 1590, + "total_submitted": 4073, "total_column_articles": 35, "frontend_question_id": "LCP 21", "is_new_question": false @@ -3813,8 +3813,8 @@ "question__title": "快速公交", "question__title_slug": "meChtZ", "question__hide": false, - "total_acs": 2629, - "total_submitted": 7304, + "total_acs": 2632, + "total_submitted": 7318, "total_column_articles": 40, "frontend_question_id": "LCP 20", "is_new_question": false @@ -3834,8 +3834,8 @@ "question__title": "导航装置", "question__title_slug": "hSRGyL", "question__hide": false, - "total_acs": 988, - "total_submitted": 2623, + "total_acs": 995, + "total_submitted": 2638, "total_column_articles": 23, "frontend_question_id": "LCP 26", "is_new_question": false @@ -3855,8 +3855,8 @@ "question__title": "数字游戏", "question__title_slug": "5TxKeK", "question__hide": false, - "total_acs": 1508, - "total_submitted": 4630, + "total_acs": 1510, + "total_submitted": 4632, "total_column_articles": 30, "frontend_question_id": "LCP 24", "is_new_question": false @@ -3876,8 +3876,8 @@ "question__title": "秋叶收藏集", "question__title_slug": "UlBDOe", "question__hide": false, - "total_acs": 22118, - "total_submitted": 42674, + "total_acs": 22133, + "total_submitted": 42710, "total_column_articles": 234, "frontend_question_id": "LCP 19", "is_new_question": false @@ -3897,9 +3897,9 @@ "question__title": "寻宝", "question__title_slug": "xun-bao", "question__hide": false, - "total_acs": 10340, - "total_submitted": 17363, - "total_column_articles": 100, + "total_acs": 10353, + "total_submitted": 17394, + "total_column_articles": 101, "frontend_question_id": "LCP 13", "is_new_question": false }, @@ -3918,8 +3918,8 @@ "question__title": "最小矩形面积", "question__title_slug": "zui-xiao-ju-xing-mian-ji", "question__hide": false, - "total_acs": 1682, - "total_submitted": 6801, + "total_acs": 1698, + "total_submitted": 6858, "total_column_articles": 27, "frontend_question_id": "LCP 37", "is_new_question": false @@ -3939,8 +3939,8 @@ "question__title": "最小跳跃次数", "question__title_slug": "zui-xiao-tiao-yue-ci-shu", "question__hide": false, - "total_acs": 10988, - "total_submitted": 34427, + "total_acs": 11010, + "total_submitted": 34494, "total_column_articles": 136, "frontend_question_id": "LCP 09", "is_new_question": false @@ -3960,8 +3960,8 @@ "question__title": "二叉树染色", "question__title_slug": "er-cha-shu-ran-se-UGC", "question__hide": false, - "total_acs": 5404, - "total_submitted": 9641, + "total_acs": 5522, + "total_submitted": 9809, "total_column_articles": 103, "frontend_question_id": "LCP 34", "is_new_question": false @@ -3981,8 +3981,8 @@ "question__title": "游乐园的迷宫", "question__title_slug": "you-le-yuan-de-mi-gong", "question__hide": false, - "total_acs": 1502, - "total_submitted": 2392, + "total_acs": 1503, + "total_submitted": 2393, "total_column_articles": 30, "frontend_question_id": "LCP 15", "is_new_question": false @@ -4002,8 +4002,8 @@ "question__title": "小张刷题计划", "question__title_slug": "xiao-zhang-shua-ti-ji-hua", "question__hide": false, - "total_acs": 11058, - "total_submitted": 25268, + "total_acs": 11084, + "total_submitted": 25365, "total_column_articles": 156, "frontend_question_id": "LCP 12", "is_new_question": false @@ -4023,9 +4023,9 @@ "question__title": "期望个数统计", "question__title_slug": "qi-wang-ge-shu-tong-ji", "question__hide": false, - "total_acs": 10328, - "total_submitted": 14235, - "total_column_articles": 100, + "total_acs": 10377, + "total_submitted": 14296, + "total_column_articles": 101, "frontend_question_id": "LCP 11", "is_new_question": false }, @@ -4044,8 +4044,8 @@ "question__title": "游乐园的游览计划", "question__title_slug": "you-le-yuan-de-you-lan-ji-hua", "question__hide": false, - "total_acs": 1074, - "total_submitted": 3082, + "total_acs": 1075, + "total_submitted": 3085, "total_column_articles": 22, "frontend_question_id": "LCP 16", "is_new_question": false @@ -4065,8 +4065,8 @@ "question__title": "传递信息", "question__title_slug": "chuan-di-xin-xi", "question__hide": false, - "total_acs": 54499, - "total_submitted": 72135, + "total_acs": 54624, + "total_submitted": 72298, "total_column_articles": 633, "frontend_question_id": "LCP 07", "is_new_question": false @@ -4086,8 +4086,8 @@ "question__title": "二叉树任务调度", "question__title_slug": "er-cha-shu-ren-wu-diao-du", "question__hide": false, - "total_acs": 3078, - "total_submitted": 4988, + "total_acs": 3084, + "total_submitted": 5000, "total_column_articles": 53, "frontend_question_id": "LCP 10", "is_new_question": false @@ -4107,8 +4107,8 @@ "question__title": "切分数组", "question__title_slug": "qie-fen-shu-zu", "question__hide": false, - "total_acs": 4066, - "total_submitted": 16860, + "total_acs": 4075, + "total_submitted": 16904, "total_column_articles": 59, "frontend_question_id": "LCP 14", "is_new_question": false @@ -4128,8 +4128,8 @@ "question__title": "魔术排列", "question__title_slug": "er94lq", "question__hide": false, - "total_acs": 3845, - "total_submitted": 10327, + "total_acs": 3849, + "total_submitted": 10340, "total_column_articles": 69, "frontend_question_id": "LCP 23", "is_new_question": false @@ -4149,8 +4149,8 @@ "question__title": "剧情触发时间", "question__title_slug": "ju-qing-hong-fa-shi-jian", "question__hide": false, - "total_acs": 7497, - "total_submitted": 22740, + "total_acs": 7511, + "total_submitted": 22764, "total_column_articles": 132, "frontend_question_id": "LCP 08", "is_new_question": false @@ -4170,9 +4170,9 @@ "question__title": "拿硬币", "question__title_slug": "na-ying-bi", "question__hide": false, - "total_acs": 59431, - "total_submitted": 70872, - "total_column_articles": 879, + "total_acs": 59591, + "total_submitted": 71066, + "total_column_articles": 881, "frontend_question_id": "LCP 06", "is_new_question": false }, @@ -4191,8 +4191,8 @@ "question__title": "Sparse Similarity LCCI", "question__title_slug": "sparse-similarity-lcci", "question__hide": false, - "total_acs": 6037, - "total_submitted": 17112, + "total_acs": 6055, + "total_submitted": 17147, "total_column_articles": 92, "frontend_question_id": "面试题 17.26", "is_new_question": false @@ -4212,8 +4212,8 @@ "question__title": "Langtons Ant LCCI", "question__title_slug": "langtons-ant-lcci", "question__hide": false, - "total_acs": 4795, - "total_submitted": 8257, + "total_acs": 4817, + "total_submitted": 8286, "total_column_articles": 85, "frontend_question_id": "面试题 16.22", "is_new_question": false @@ -4233,8 +4233,8 @@ "question__title": "Word Rectangle LCCI", "question__title_slug": "word-rectangle-lcci", "question__hide": false, - "total_acs": 3179, - "total_submitted": 6263, + "total_acs": 3201, + "total_submitted": 6324, "total_column_articles": 58, "frontend_question_id": "面试题 17.25", "is_new_question": false @@ -4254,8 +4254,8 @@ "question__title": "Sum Swap LCCI", "question__title_slug": "sum-swap-lcci", "question__hide": false, - "total_acs": 16071, - "total_submitted": 33674, + "total_acs": 16124, + "total_submitted": 33758, "total_column_articles": 271, "frontend_question_id": "面试题 16.21", "is_new_question": false @@ -4275,8 +4275,8 @@ "question__title": "T9 LCCI", "question__title_slug": "t9-lcci", "question__hide": false, - "total_acs": 14992, - "total_submitted": 21046, + "total_acs": 15036, + "total_submitted": 21114, "total_column_articles": 262, "frontend_question_id": "面试题 16.20", "is_new_question": false @@ -4296,8 +4296,8 @@ "question__title": "Max Submatrix LCCI", "question__title_slug": "max-submatrix-lcci", "question__hide": false, - "total_acs": 23325, - "total_submitted": 43576, + "total_acs": 23408, + "total_submitted": 43721, "total_column_articles": 199, "frontend_question_id": "面试题 17.24", "is_new_question": false @@ -4317,9 +4317,9 @@ "question__title": "Max Black Square LCCI", "question__title_slug": "max-black-square-lcci", "question__hide": false, - "total_acs": 8277, - "total_submitted": 21868, - "total_column_articles": 156, + "total_acs": 8330, + "total_submitted": 21965, + "total_column_articles": 155, "frontend_question_id": "面试题 17.23", "is_new_question": false }, @@ -4338,8 +4338,8 @@ "question__title": "Missing Two LCCI", "question__title_slug": "missing-two-lcci", "question__hide": false, - "total_acs": 40449, - "total_submitted": 66826, + "total_acs": 40509, + "total_submitted": 66949, "total_column_articles": 580, "frontend_question_id": "面试题 17.19", "is_new_question": false @@ -4359,9 +4359,9 @@ "question__title": "Shortest Supersequence LCCI", "question__title_slug": "shortest-supersequence-lcci", "question__hide": false, - "total_acs": 14332, - "total_submitted": 32268, - "total_column_articles": 179, + "total_acs": 14378, + "total_submitted": 32394, + "total_column_articles": 178, "frontend_question_id": "面试题 17.18", "is_new_question": false }, @@ -4380,8 +4380,8 @@ "question__title": "Pairs With Sum LCCI", "question__title_slug": "pairs-with-sum-lcci", "question__hide": false, - "total_acs": 17847, - "total_submitted": 36965, + "total_acs": 17883, + "total_submitted": 37058, "total_column_articles": 248, "frontend_question_id": "面试题 16.24", "is_new_question": false @@ -4401,8 +4401,8 @@ "question__title": "Rank from Stream LCCI", "question__title_slug": "rank-from-stream-lcci", "question__hide": false, - "total_acs": 9823, - "total_submitted": 15830, + "total_acs": 9870, + "total_submitted": 15902, "total_column_articles": 150, "frontend_question_id": "面试题 10.10", "is_new_question": false @@ -4422,9 +4422,9 @@ "question__title": "Group Anagrams LCCI", "question__title_slug": "group-anagrams-lcci", "question__hide": false, - "total_acs": 42052, - "total_submitted": 56604, - "total_column_articles": 482, + "total_acs": 42113, + "total_submitted": 56689, + "total_column_articles": 483, "frontend_question_id": "面试题 10.02", "is_new_question": false }, @@ -4443,8 +4443,8 @@ "question__title": "Find Closest LCCI", "question__title_slug": "find-closest-lcci", "question__hide": false, - "total_acs": 50852, - "total_submitted": 69595, + "total_acs": 50908, + "total_submitted": 69659, "total_column_articles": 667, "frontend_question_id": "面试题 17.11", "is_new_question": false @@ -4464,8 +4464,8 @@ "question__title": "Find Majority Element LCCI", "question__title_slug": "find-majority-element-lcci", "question__hide": false, - "total_acs": 77976, - "total_submitted": 138784, + "total_acs": 78054, + "total_submitted": 138938, "total_column_articles": 1055, "frontend_question_id": "面试题 17.10", "is_new_question": false @@ -4485,9 +4485,9 @@ "question__title": "Get Kth Magic Number LCCI", "question__title_slug": "get-kth-magic-number-lcci", "question__hide": false, - "total_acs": 47688, - "total_submitted": 85094, - "total_column_articles": 432, + "total_acs": 47766, + "total_submitted": 85243, + "total_column_articles": 431, "frontend_question_id": "面试题 17.09", "is_new_question": false }, @@ -4506,9 +4506,9 @@ "question__title": "Circus Tower LCCI", "question__title_slug": "circus-tower-lcci", "question__hide": false, - "total_acs": 12963, - "total_submitted": 45456, - "total_column_articles": 168, + "total_acs": 13011, + "total_submitted": 45633, + "total_column_articles": 169, "frontend_question_id": "面试题 17.08", "is_new_question": false }, @@ -4527,8 +4527,8 @@ "question__title": "Baby Names LCCI", "question__title_slug": "baby-names-lcci", "question__hide": false, - "total_acs": 12953, - "total_submitted": 31132, + "total_acs": 12981, + "total_submitted": 31170, "total_column_articles": 288, "frontend_question_id": "面试题 17.07", "is_new_question": false @@ -4548,8 +4548,8 @@ "question__title": "Number Of 2s In Range LCCI", "question__title_slug": "number-of-2s-in-range-lcci", "question__hide": false, - "total_acs": 10303, - "total_submitted": 20671, + "total_acs": 10364, + "total_submitted": 20797, "total_column_articles": 190, "frontend_question_id": "面试题 17.06", "is_new_question": false @@ -4569,8 +4569,8 @@ "question__title": "Find Longest Subarray LCCI", "question__title_slug": "find-longest-subarray-lcci", "question__hide": false, - "total_acs": 30614, - "total_submitted": 64536, + "total_acs": 30671, + "total_submitted": 64650, "total_column_articles": 284, "frontend_question_id": "面试题 17.05", "is_new_question": false @@ -4590,8 +4590,8 @@ "question__title": "Missing Number LCCI", "question__title_slug": "missing-number-lcci", "question__hide": false, - "total_acs": 54116, - "total_submitted": 91467, + "total_acs": 54349, + "total_submitted": 91857, "total_column_articles": 732, "frontend_question_id": "面试题 17.04", "is_new_question": false @@ -4611,8 +4611,8 @@ "question__title": "Boolean Evaluation LCCI", "question__title_slug": "boolean-evaluation-lcci", "question__hide": false, - "total_acs": 8160, - "total_submitted": 15602, + "total_acs": 8193, + "total_submitted": 15692, "total_column_articles": 117, "frontend_question_id": "面试题 08.14", "is_new_question": false @@ -4632,9 +4632,9 @@ "question__title": "Word Transformer LCCI", "question__title_slug": "word-transformer-lcci", "question__hide": false, - "total_acs": 14631, - "total_submitted": 36264, - "total_column_articles": 206, + "total_acs": 14678, + "total_submitted": 36387, + "total_column_articles": 205, "frontend_question_id": "面试题 17.22", "is_new_question": false }, @@ -4653,8 +4653,8 @@ "question__title": "Volume of Histogram LCCI", "question__title_slug": "volume-of-histogram-lcci", "question__hide": false, - "total_acs": 50992, - "total_submitted": 80035, + "total_acs": 51040, + "total_submitted": 80119, "total_column_articles": 592, "frontend_question_id": "面试题 17.21", "is_new_question": false @@ -4674,9 +4674,9 @@ "question__title": "Continuous Median LCCI", "question__title_slug": "continuous-median-lcci", "question__hide": false, - "total_acs": 7017, - "total_submitted": 12015, - "total_column_articles": 111, + "total_acs": 7055, + "total_submitted": 12085, + "total_column_articles": 112, "frontend_question_id": "面试题 17.20", "is_new_question": false }, @@ -4695,8 +4695,8 @@ "question__title": "Calculator LCCI", "question__title_slug": "calculator-lcci", "question__hide": false, - "total_acs": 24696, - "total_submitted": 62185, + "total_acs": 24772, + "total_submitted": 62346, "total_column_articles": 294, "frontend_question_id": "面试题 16.26", "is_new_question": false @@ -4716,8 +4716,8 @@ "question__title": "LRU Cache LCCI", "question__title_slug": "lru-cache-lcci", "question__hide": false, - "total_acs": 48049, - "total_submitted": 86563, + "total_acs": 48220, + "total_submitted": 86885, "total_column_articles": 353, "frontend_question_id": "面试题 16.25", "is_new_question": false @@ -4737,8 +4737,8 @@ "question__title": "Add Without Plus LCCI", "question__title_slug": "add-without-plus-lcci", "question__hide": false, - "total_acs": 22074, - "total_submitted": 35798, + "total_acs": 22188, + "total_submitted": 35939, "total_column_articles": 239, "frontend_question_id": "面试题 17.01", "is_new_question": false @@ -4758,8 +4758,8 @@ "question__title": "Multi Search LCCI", "question__title_slug": "multi-search-lcci", "question__hide": false, - "total_acs": 13483, - "total_submitted": 30125, + "total_acs": 13520, + "total_submitted": 30215, "total_column_articles": 254, "frontend_question_id": "面试题 17.17", "is_new_question": false @@ -4779,8 +4779,8 @@ "question__title": "The Masseuse LCCI", "question__title_slug": "the-masseuse-lcci", "question__hide": false, - "total_acs": 78772, - "total_submitted": 154285, + "total_acs": 78964, + "total_submitted": 154647, "total_column_articles": 1323, "frontend_question_id": "面试题 17.16", "is_new_question": false @@ -4800,8 +4800,8 @@ "question__title": "Longest Word LCCI", "question__title_slug": "longest-word-lcci", "question__hide": false, - "total_acs": 11847, - "total_submitted": 29001, + "total_acs": 11891, + "total_submitted": 29142, "total_column_articles": 189, "frontend_question_id": "面试题 17.15", "is_new_question": false @@ -4821,9 +4821,9 @@ "question__title": "Smallest K LCCI", "question__title_slug": "smallest-k-lcci", "question__hide": false, - "total_acs": 104150, - "total_submitted": 177055, - "total_column_articles": 937, + "total_acs": 104445, + "total_submitted": 177654, + "total_column_articles": 938, "frontend_question_id": "面试题 17.14", "is_new_question": false }, @@ -4842,8 +4842,8 @@ "question__title": "Re-Space LCCI", "question__title_slug": "re-space-lcci", "question__hide": false, - "total_acs": 29060, - "total_submitted": 52412, + "total_acs": 29083, + "total_submitted": 52460, "total_column_articles": 304, "frontend_question_id": "面试题 17.13", "is_new_question": false @@ -4863,8 +4863,8 @@ "question__title": "BiNode LCCI", "question__title_slug": "binode-lcci", "question__hide": false, - "total_acs": 31537, - "total_submitted": 49327, + "total_acs": 31614, + "total_submitted": 49443, "total_column_articles": 397, "frontend_question_id": "面试题 17.12", "is_new_question": false @@ -4884,8 +4884,8 @@ "question__title": "English Int LCCI", "question__title_slug": "english-int-lcci", "question__hide": false, - "total_acs": 4046, - "total_submitted": 10339, + "total_acs": 4063, + "total_submitted": 10383, "total_column_articles": 80, "frontend_question_id": "面试题 16.08", "is_new_question": false @@ -4905,9 +4905,9 @@ "question__title": "Factorial Zeros LCCI", "question__title_slug": "factorial-zeros-lcci", "question__hide": false, - "total_acs": 18131, - "total_submitted": 41669, - "total_column_articles": 183, + "total_acs": 18230, + "total_submitted": 41932, + "total_column_articles": 184, "frontend_question_id": "面试题 16.05", "is_new_question": false }, @@ -4926,8 +4926,8 @@ "question__title": "Sorted Matrix Search LCCI", "question__title_slug": "sorted-matrix-search-lcci", "question__hide": false, - "total_acs": 21238, - "total_submitted": 47631, + "total_acs": 21330, + "total_submitted": 47828, "total_column_articles": 235, "frontend_question_id": "面试题 10.09", "is_new_question": false @@ -4947,9 +4947,9 @@ "question__title": "Hanota LCCI", "question__title_slug": "hanota-lcci", "question__hide": false, - "total_acs": 44419, - "total_submitted": 68551, - "total_column_articles": 423, + "total_acs": 44724, + "total_submitted": 69064, + "total_column_articles": 426, "frontend_question_id": "面试题 08.06", "is_new_question": false }, @@ -4968,8 +4968,8 @@ "question__title": "Peaks and Valleys LCCI", "question__title_slug": "peaks-and-valleys-lcci", "question__hide": false, - "total_acs": 14490, - "total_submitted": 21954, + "total_acs": 14548, + "total_submitted": 22027, "total_column_articles": 172, "frontend_question_id": "面试题 10.11", "is_new_question": false @@ -4989,9 +4989,9 @@ "question__title": "Sorted Merge LCCI", "question__title_slug": "sorted-merge-lcci", "question__hide": false, - "total_acs": 77972, - "total_submitted": 138991, - "total_column_articles": 2547, + "total_acs": 78163, + "total_submitted": 139335, + "total_column_articles": 2548, "frontend_question_id": "面试题 10.01", "is_new_question": false }, @@ -5010,9 +5010,9 @@ "question__title": "Robot in a Grid LCCI", "question__title_slug": "robot-in-a-grid-lcci", "question__hide": false, - "total_acs": 22122, - "total_submitted": 61180, - "total_column_articles": 312, + "total_acs": 22223, + "total_submitted": 61500, + "total_column_articles": 313, "frontend_question_id": "面试题 08.02", "is_new_question": false }, @@ -5031,9 +5031,9 @@ "question__title": "BST Sequences LCCI", "question__title_slug": "bst-sequences-lcci", "question__hide": false, - "total_acs": 11299, - "total_submitted": 23117, - "total_column_articles": 161, + "total_acs": 11363, + "total_submitted": 23235, + "total_column_articles": 163, "frontend_question_id": "面试题 04.09", "is_new_question": false }, @@ -5052,9 +5052,9 @@ "question__title": "Paths with Sum LCCI", "question__title_slug": "paths-with-sum-lcci", "question__hide": false, - "total_acs": 29912, - "total_submitted": 61060, - "total_column_articles": 355, + "total_acs": 30036, + "total_submitted": 61324, + "total_column_articles": 356, "frontend_question_id": "面试题 04.12", "is_new_question": false }, @@ -5073,9 +5073,9 @@ "question__title": "Partition List LCCI", "question__title_slug": "partition-list-lcci", "question__hide": false, - "total_acs": 44805, - "total_submitted": 73506, - "total_column_articles": 574, + "total_acs": 45004, + "total_submitted": 73870, + "total_column_articles": 579, "frontend_question_id": "面试题 02.04", "is_new_question": false }, @@ -5094,9 +5094,9 @@ "question__title": "Kth Node From End of List LCCI", "question__title_slug": "kth-node-from-end-of-list-lcci", "question__hide": false, - "total_acs": 92254, - "total_submitted": 118175, - "total_column_articles": 1229, + "total_acs": 92568, + "total_submitted": 118541, + "total_column_articles": 1234, "frontend_question_id": "面试题 02.02", "is_new_question": false }, @@ -5115,9 +5115,9 @@ "question__title": "One Away LCCI", "question__title_slug": "one-away-lcci", "question__hide": false, - "total_acs": 89068, - "total_submitted": 253670, - "total_column_articles": 1345, + "total_acs": 89331, + "total_submitted": 254459, + "total_column_articles": 1347, "frontend_question_id": "面试题 01.05", "is_new_question": false }, @@ -5136,8 +5136,8 @@ "question__title": "Pond Sizes LCCI", "question__title_slug": "pond-sizes-lcci", "question__hide": false, - "total_acs": 39458, - "total_submitted": 59549, + "total_acs": 39541, + "total_submitted": 59668, "total_column_articles": 594, "frontend_question_id": "面试题 16.19", "is_new_question": false @@ -5157,8 +5157,8 @@ "question__title": "Pattern Matching LCCI", "question__title_slug": "pattern-matching-lcci", "question__hide": false, - "total_acs": 17952, - "total_submitted": 52980, + "total_acs": 17988, + "total_submitted": 53076, "total_column_articles": 348, "frontend_question_id": "面试题 16.18", "is_new_question": false @@ -5178,8 +5178,8 @@ "question__title": "Contiguous Sequence LCCI", "question__title_slug": "contiguous-sequence-lcci", "question__hide": false, - "total_acs": 49253, - "total_submitted": 83656, + "total_acs": 49384, + "total_submitted": 83903, "total_column_articles": 520, "frontend_question_id": "面试题 16.17", "is_new_question": false @@ -5199,9 +5199,9 @@ "question__title": "Sub Sort LCCI", "question__title_slug": "sub-sort-lcci", "question__hide": false, - "total_acs": 26339, - "total_submitted": 56429, - "total_column_articles": 322, + "total_acs": 26435, + "total_submitted": 56621, + "total_column_articles": 325, "frontend_question_id": "面试题 16.16", "is_new_question": false }, @@ -5220,9 +5220,9 @@ "question__title": "Master Mind LCCI", "question__title_slug": "master-mind-lcci", "question__hide": false, - "total_acs": 16334, - "total_submitted": 35372, - "total_column_articles": 345, + "total_acs": 16447, + "total_submitted": 35713, + "total_column_articles": 346, "frontend_question_id": "面试题 16.15", "is_new_question": false }, @@ -5241,8 +5241,8 @@ "question__title": "Best Line LCCI", "question__title_slug": "best-line-lcci", "question__hide": false, - "total_acs": 6208, - "total_submitted": 11186, + "total_acs": 6245, + "total_submitted": 11247, "total_column_articles": 88, "frontend_question_id": "面试题 16.14", "is_new_question": false @@ -5262,8 +5262,8 @@ "question__title": "Bisect Squares LCCI", "question__title_slug": "bisect-squares-lcci", "question__hide": false, - "total_acs": 3688, - "total_submitted": 8422, + "total_acs": 3700, + "total_submitted": 8453, "total_column_articles": 84, "frontend_question_id": "面试题 16.13", "is_new_question": false @@ -5283,8 +5283,8 @@ "question__title": "Diving Board LCCI", "question__title_slug": "diving-board-lcci", "question__hide": false, - "total_acs": 60015, - "total_submitted": 136900, + "total_acs": 60095, + "total_submitted": 137076, "total_column_articles": 678, "frontend_question_id": "面试题 16.11", "is_new_question": false @@ -5304,8 +5304,8 @@ "question__title": "Living People LCCI", "question__title_slug": "living-people-lcci", "question__hide": false, - "total_acs": 16890, - "total_submitted": 25238, + "total_acs": 16957, + "total_submitted": 25361, "total_column_articles": 269, "frontend_question_id": "面试题 16.10", "is_new_question": false @@ -5325,8 +5325,8 @@ "question__title": "Operations LCCI", "question__title_slug": "operations-lcci", "question__hide": false, - "total_acs": 4076, - "total_submitted": 7206, + "total_acs": 4095, + "total_submitted": 7239, "total_column_articles": 60, "frontend_question_id": "面试题 16.09", "is_new_question": false @@ -5346,9 +5346,9 @@ "question__title": "Maximum LCCI", "question__title_slug": "maximum-lcci", "question__hide": false, - "total_acs": 33582, - "total_submitted": 45499, - "total_column_articles": 436, + "total_acs": 33709, + "total_submitted": 45653, + "total_column_articles": 437, "frontend_question_id": "面试题 16.07", "is_new_question": false }, @@ -5367,9 +5367,9 @@ "question__title": "Permutation II LCCI", "question__title_slug": "permutation-ii-lcci", "question__hide": false, - "total_acs": 31371, - "total_submitted": 45073, - "total_column_articles": 373, + "total_acs": 31559, + "total_submitted": 45420, + "total_column_articles": 374, "frontend_question_id": "面试题 08.08", "is_new_question": false }, @@ -5388,9 +5388,9 @@ "question__title": "二叉树的最近公共祖先 LCOF", "question__title_slug": "er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 221063, - "total_submitted": 314522, - "total_column_articles": 1141, + "total_acs": 222115, + "total_submitted": 316025, + "total_column_articles": 1142, "frontend_question_id": "剑指 Offer 68 - II", "is_new_question": false }, @@ -5409,9 +5409,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": 228804, - "total_submitted": 330547, - "total_column_articles": 1152, + "total_acs": 229895, + "total_submitted": 332185, + "total_column_articles": 1153, "frontend_question_id": "剑指 Offer 68 - I", "is_new_question": false }, @@ -5430,9 +5430,9 @@ "question__title": "求1+2+…+n LCOF", "question__title_slug": "qiu-12n-lcof", "question__hide": false, - "total_acs": 245724, - "total_submitted": 285996, - "total_column_articles": 1814, + "total_acs": 246729, + "total_submitted": 287159, + "total_column_articles": 1816, "frontend_question_id": "剑指 Offer 64", "is_new_question": false }, @@ -5451,9 +5451,9 @@ "question__title": "股票的最大利润 LCOF", "question__title_slug": "gu-piao-de-zui-da-li-run-lcof", "question__hide": false, - "total_acs": 278587, - "total_submitted": 443269, - "total_column_articles": 1646, + "total_acs": 279802, + "total_submitted": 445250, + "total_column_articles": 1651, "frontend_question_id": "剑指 Offer 63", "is_new_question": false }, @@ -5472,9 +5472,9 @@ "question__title": "圆圈中最后剩下的数字 LCOF", "question__title_slug": "yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof", "question__hide": false, - "total_acs": 197110, - "total_submitted": 301458, - "total_column_articles": 1117, + "total_acs": 197974, + "total_submitted": 302764, + "total_column_articles": 1123, "frontend_question_id": "剑指 Offer 62", "is_new_question": false }, @@ -5493,9 +5493,9 @@ "question__title": "平衡二叉树 LCOF", "question__title_slug": "ping-heng-er-cha-shu-lcof", "question__hide": false, - "total_acs": 259748, - "total_submitted": 435593, - "total_column_articles": 1506, + "total_acs": 260935, + "total_submitted": 437662, + "total_column_articles": 1512, "frontend_question_id": "剑指 Offer 55 - II", "is_new_question": false }, @@ -5514,9 +5514,9 @@ "question__title": "扑克牌中的顺子 LCOF", "question__title_slug": "bu-ke-pai-zhong-de-shun-zi-lcof", "question__hide": false, - "total_acs": 220986, - "total_submitted": 488248, - "total_column_articles": 1770, + "total_acs": 222057, + "total_submitted": 490764, + "total_column_articles": 1779, "frontend_question_id": "剑指 Offer 61", "is_new_question": false }, @@ -5535,9 +5535,9 @@ "question__title": "把字符串转换成整数 LCOF", "question__title_slug": "ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof", "question__hide": false, - "total_acs": 143275, - "total_submitted": 507698, - "total_column_articles": 1058, + "total_acs": 144443, + "total_submitted": 512875, + "total_column_articles": 1066, "frontend_question_id": "剑指 Offer 67", "is_new_question": false }, @@ -5556,9 +5556,9 @@ "question__title": "n个骰子的点数 LCOF", "question__title_slug": "nge-tou-zi-de-dian-shu-lcof", "question__hide": false, - "total_acs": 128634, - "total_submitted": 224306, - "total_column_articles": 1017, + "total_acs": 129362, + "total_submitted": 225642, + "total_column_articles": 1019, "frontend_question_id": "剑指 Offer 60", "is_new_question": false }, @@ -5577,9 +5577,9 @@ "question__title": "构建乘积数组 LCOF", "question__title_slug": "gou-jian-cheng-ji-shu-zu-lcof", "question__hide": false, - "total_acs": 150915, - "total_submitted": 258033, - "total_column_articles": 963, + "total_acs": 151660, + "total_submitted": 259374, + "total_column_articles": 966, "frontend_question_id": "剑指 Offer 66", "is_new_question": false }, @@ -5598,9 +5598,9 @@ "question__title": "队列的最大值 LCOF", "question__title_slug": "dui-lie-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 173109, - "total_submitted": 362016, - "total_column_articles": 1476, + "total_acs": 174099, + "total_submitted": 364248, + "total_column_articles": 1481, "frontend_question_id": "剑指 Offer 59 - II", "is_new_question": false }, @@ -5619,9 +5619,9 @@ "question__title": "滑动窗口的最大值 LCOF", "question__title_slug": "hua-dong-chuang-kou-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 232007, - "total_submitted": 516826, - "total_column_articles": 1761, + "total_acs": 233088, + "total_submitted": 519662, + "total_column_articles": 1765, "frontend_question_id": "剑指 Offer 59 - I", "is_new_question": false }, @@ -5640,9 +5640,9 @@ "question__title": "不用加减乘除做加法 LCOF", "question__title_slug": "bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof", "question__hide": false, - "total_acs": 146959, - "total_submitted": 246357, - "total_column_articles": 858, + "total_acs": 147733, + "total_submitted": 247406, + "total_column_articles": 861, "frontend_question_id": "剑指 Offer 65", "is_new_question": false }, @@ -5661,9 +5661,9 @@ "question__title": "丑数 LCOF", "question__title_slug": "chou-shu-lcof", "question__hide": false, - "total_acs": 169772, - "total_submitted": 262889, - "total_column_articles": 887, + "total_acs": 170564, + "total_submitted": 264255, + "total_column_articles": 892, "frontend_question_id": "剑指 Offer 49", "is_new_question": false }, @@ -5682,9 +5682,9 @@ "question__title": "二叉搜索树的第k大节点 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof", "question__hide": false, - "total_acs": 310619, - "total_submitted": 406464, - "total_column_articles": 1902, + "total_acs": 311988, + "total_submitted": 408323, + "total_column_articles": 1903, "frontend_question_id": "剑指 Offer 54", "is_new_question": false }, @@ -5703,9 +5703,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": 310799, - "total_submitted": 674605, - "total_column_articles": 1885, + "total_acs": 312026, + "total_submitted": 677496, + "total_column_articles": 1890, "frontend_question_id": "剑指 Offer 48", "is_new_question": false }, @@ -5724,9 +5724,9 @@ "question__title": "缺失的数字 LCOF", "question__title_slug": "que-shi-de-shu-zi-lcof", "question__hide": false, - "total_acs": 358716, - "total_submitted": 800364, - "total_column_articles": 2576, + "total_acs": 360144, + "total_submitted": 803489, + "total_column_articles": 2581, "frontend_question_id": "剑指 Offer 53 - II", "is_new_question": false }, @@ -5745,9 +5745,9 @@ "question__title": "左旋转字符串 LCOF", "question__title_slug": "zuo-xuan-zhuan-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 504273, - "total_submitted": 588641, - "total_column_articles": 3310, + "total_acs": 507812, + "total_submitted": 592859, + "total_column_articles": 3318, "frontend_question_id": "剑指 Offer 58 - II", "is_new_question": false }, @@ -5766,9 +5766,9 @@ "question__title": "在排序数组中查找数字 LCOF", "question__title_slug": "zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof", "question__hide": false, - "total_acs": 394662, - "total_submitted": 748569, - "total_column_articles": 2678, + "total_acs": 396203, + "total_submitted": 751745, + "total_column_articles": 2684, "frontend_question_id": "剑指 Offer 53 - I", "is_new_question": false }, @@ -5787,9 +5787,9 @@ "question__title": "翻转单词顺序 LCOF", "question__title_slug": "fan-zhuan-dan-ci-shun-xu-lcof", "question__hide": false, - "total_acs": 262742, - "total_submitted": 586732, - "total_column_articles": 1685, + "total_acs": 264025, + "total_submitted": 589383, + "total_column_articles": 1691, "frontend_question_id": "剑指 Offer 58 - I", "is_new_question": false }, @@ -5808,9 +5808,9 @@ "question__title": "礼物的最大价值 LCOF", "question__title_slug": "li-wu-de-zui-da-jie-zhi-lcof", "question__hide": false, - "total_acs": 278043, - "total_submitted": 401235, - "total_column_articles": 1937, + "total_acs": 279178, + "total_submitted": 402933, + "total_column_articles": 1940, "frontend_question_id": "剑指 Offer 47", "is_new_question": false }, @@ -5829,9 +5829,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": 323298, - "total_submitted": 492972, - "total_column_articles": 1620, + "total_acs": 324789, + "total_submitted": 495354, + "total_column_articles": 1622, "frontend_question_id": "剑指 Offer 52", "is_new_question": false }, @@ -5850,9 +5850,9 @@ "question__title": "把数字翻译成字符串 LCOF", "question__title_slug": "ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 255193, - "total_submitted": 498647, - "total_column_articles": 2366, + "total_acs": 256239, + "total_submitted": 501057, + "total_column_articles": 2372, "frontend_question_id": "剑指 Offer 46", "is_new_question": false }, @@ -5871,9 +5871,9 @@ "question__title": "和为s的连续正数序列 LCOF", "question__title_slug": "he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof", "question__hide": false, - "total_acs": 245058, - "total_submitted": 343827, - "total_column_articles": 2487, + "total_acs": 245934, + "total_submitted": 345047, + "total_column_articles": 2492, "frontend_question_id": "剑指 Offer 57 - II", "is_new_question": false }, @@ -5892,9 +5892,9 @@ "question__title": "把数组排成最小的数 LCOF", "question__title_slug": "ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof", "question__hide": false, - "total_acs": 230815, - "total_submitted": 420595, - "total_column_articles": 1497, + "total_acs": 231862, + "total_submitted": 422687, + "total_column_articles": 1500, "frontend_question_id": "剑指 Offer 45", "is_new_question": false }, @@ -5913,9 +5913,9 @@ "question__title": "和为s的两个数字 LCOF", "question__title_slug": "he-wei-sde-liang-ge-shu-zi-lcof", "question__hide": false, - "total_acs": 278037, - "total_submitted": 409540, - "total_column_articles": 1496, + "total_acs": 279520, + "total_submitted": 411732, + "total_column_articles": 1501, "frontend_question_id": "剑指 Offer 57", "is_new_question": false }, @@ -5934,9 +5934,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": 172519, - "total_submitted": 213995, - "total_column_articles": 1116, + "total_acs": 173246, + "total_submitted": 214893, + "total_column_articles": 1120, "frontend_question_id": "剑指 Offer 56 - II", "is_new_question": false }, @@ -5955,9 +5955,9 @@ "question__title": "数组中数字出现的次数 LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 206912, - "total_submitted": 300777, - "total_column_articles": 1587, + "total_acs": 207740, + "total_submitted": 302069, + "total_column_articles": 1594, "frontend_question_id": "剑指 Offer 56 - I", "is_new_question": false }, @@ -5976,9 +5976,9 @@ "question__title": "二叉树的深度 LCOF", "question__title_slug": "er-cha-shu-de-shen-du-lcof", "question__hide": false, - "total_acs": 316447, - "total_submitted": 398204, - "total_column_articles": 1876, + "total_acs": 317803, + "total_submitted": 399858, + "total_column_articles": 1880, "frontend_question_id": "剑指 Offer 55 - I", "is_new_question": false }, @@ -5997,9 +5997,9 @@ "question__title": "数组中的逆序对 LCOF", "question__title_slug": "shu-zu-zhong-de-ni-xu-dui-lcof", "question__hide": false, - "total_acs": 203077, - "total_submitted": 410092, - "total_column_articles": 1499, + "total_acs": 203982, + "total_submitted": 411992, + "total_column_articles": 1505, "frontend_question_id": "剑指 Offer 51", "is_new_question": false }, @@ -6018,9 +6018,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": 269728, - "total_submitted": 456708, - "total_column_articles": 1540, + "total_acs": 270914, + "total_submitted": 458579, + "total_column_articles": 1546, "frontend_question_id": "剑指 Offer 34", "is_new_question": false }, @@ -6039,9 +6039,9 @@ "question__title": "第一个只出现一次的字符 LCOF", "question__title_slug": "di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof", "question__hide": false, - "total_acs": 328721, - "total_submitted": 531226, - "total_column_articles": 1866, + "total_acs": 329937, + "total_submitted": 533278, + "total_column_articles": 1871, "frontend_question_id": "剑指 Offer 50", "is_new_question": false }, @@ -6060,9 +6060,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": 227894, - "total_submitted": 400208, - "total_column_articles": 1682, + "total_acs": 228926, + "total_submitted": 401835, + "total_column_articles": 1690, "frontend_question_id": "剑指 Offer 33", "is_new_question": false }, @@ -6081,9 +6081,9 @@ "question__title": "从上到下打印二叉树 III LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof", "question__hide": false, - "total_acs": 263619, - "total_submitted": 453636, - "total_column_articles": 2154, + "total_acs": 264723, + "total_submitted": 455564, + "total_column_articles": 2158, "frontend_question_id": "剑指 Offer 32 - III", "is_new_question": false }, @@ -6102,9 +6102,9 @@ "question__title": "数字序列中某一位的数字 LCOF", "question__title_slug": "shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof", "question__hide": false, - "total_acs": 109021, - "total_submitted": 253094, - "total_column_articles": 808, + "total_acs": 109476, + "total_submitted": 254112, + "total_column_articles": 810, "frontend_question_id": "剑指 Offer 44", "is_new_question": false }, @@ -6123,9 +6123,9 @@ "question__title": "从上到下打印二叉树 II LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof", "question__hide": false, - "total_acs": 284985, - "total_submitted": 414039, - "total_column_articles": 1938, + "total_acs": 286319, + "total_submitted": 415995, + "total_column_articles": 1941, "frontend_question_id": "剑指 Offer 32 - II", "is_new_question": false }, @@ -6144,9 +6144,9 @@ "question__title": "从上到下打印二叉树 LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-lcof", "question__hide": false, - "total_acs": 289599, - "total_submitted": 459120, - "total_column_articles": 1737, + "total_acs": 290849, + "total_submitted": 461112, + "total_column_articles": 1742, "frontend_question_id": "剑指 Offer 32 - I", "is_new_question": false }, @@ -6165,9 +6165,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": 310356, - "total_submitted": 443311, - "total_column_articles": 1614, + "total_acs": 311525, + "total_submitted": 445028, + "total_column_articles": 1617, "frontend_question_id": "剑指 Offer 39", "is_new_question": false }, @@ -6186,9 +6186,9 @@ "question__title": "1~n整数中1出现的次数 LCOF", "question__title_slug": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 91213, - "total_submitted": 180543, - "total_column_articles": 800, + "total_acs": 91579, + "total_submitted": 181246, + "total_column_articles": 802, "frontend_question_id": "剑指 Offer 43", "is_new_question": false }, @@ -6207,9 +6207,9 @@ "question__title": "字符串的排列 LCOF", "question__title_slug": "zi-fu-chuan-de-pai-lie-lcof", "question__hide": false, - "total_acs": 278883, - "total_submitted": 485262, - "total_column_articles": 1657, + "total_acs": 279994, + "total_submitted": 487304, + "total_column_articles": 1659, "frontend_question_id": "剑指 Offer 38", "is_new_question": false }, @@ -6228,9 +6228,9 @@ "question__title": "序列化二叉树 LCOF", "question__title_slug": "xu-lie-hua-er-cha-shu-lcof", "question__hide": false, - "total_acs": 139299, - "total_submitted": 242795, - "total_column_articles": 877, + "total_acs": 139897, + "total_submitted": 243942, + "total_column_articles": 880, "frontend_question_id": "剑指 Offer 37", "is_new_question": false }, @@ -6249,9 +6249,9 @@ "question__title": "栈的压入、弹出序列 LCOF", "question__title_slug": "zhan-de-ya-ru-dan-chu-xu-lie-lcof", "question__hide": false, - "total_acs": 224277, - "total_submitted": 367158, - "total_column_articles": 1581, + "total_acs": 225346, + "total_submitted": 368857, + "total_column_articles": 1587, "frontend_question_id": "剑指 Offer 31", "is_new_question": false }, @@ -6270,9 +6270,9 @@ "question__title": "二叉搜索树与双向链表 LCOF", "question__title_slug": "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof", "question__hide": false, - "total_acs": 219282, - "total_submitted": 338399, - "total_column_articles": 1681, + "total_acs": 220228, + "total_submitted": 340000, + "total_column_articles": 1683, "frontend_question_id": "剑指 Offer 36", "is_new_question": false }, @@ -6291,9 +6291,9 @@ "question__title": "连续子数组的最大和 LCOF", "question__title_slug": "lian-xu-zi-shu-zu-de-zui-da-he-lcof", "question__hide": false, - "total_acs": 413685, - "total_submitted": 686061, - "total_column_articles": 2319, + "total_acs": 415354, + "total_submitted": 688962, + "total_column_articles": 2328, "frontend_question_id": "剑指 Offer 42", "is_new_question": false }, @@ -6312,9 +6312,9 @@ "question__title": "数据流中的中位数 LCOF", "question__title_slug": "shu-ju-liu-zhong-de-zhong-wei-shu-lcof", "question__hide": false, - "total_acs": 138616, - "total_submitted": 238136, - "total_column_articles": 899, + "total_acs": 139227, + "total_submitted": 239185, + "total_column_articles": 900, "frontend_question_id": "剑指 Offer 41", "is_new_question": false }, @@ -6333,9 +6333,9 @@ "question__title": "包含min函数的栈 LCOF", "question__title_slug": "bao-han-minhan-shu-de-zhan-lcof", "question__hide": false, - "total_acs": 360013, - "total_submitted": 650867, - "total_column_articles": 2059, + "total_acs": 361482, + "total_submitted": 653536, + "total_column_articles": 2065, "frontend_question_id": "剑指 Offer 30", "is_new_question": false }, @@ -6354,9 +6354,9 @@ "question__title": "最小的k个数 LCOF", "question__title_slug": "zui-xiao-de-kge-shu-lcof", "question__hide": false, - "total_acs": 448828, - "total_submitted": 777640, - "total_column_articles": 2596, + "total_acs": 450538, + "total_submitted": 780510, + "total_column_articles": 2600, "frontend_question_id": "剑指 Offer 40", "is_new_question": false }, @@ -6375,9 +6375,9 @@ "question__title": "复杂链表的复制 LCOF", "question__title_slug": "fu-za-lian-biao-de-fu-zhi-lcof", "question__hide": false, - "total_acs": 294030, - "total_submitted": 411269, - "total_column_articles": 1832, + "total_acs": 295381, + "total_submitted": 413178, + "total_column_articles": 1842, "frontend_question_id": "剑指 Offer 35", "is_new_question": false }, @@ -6396,9 +6396,9 @@ "question__title": "删除链表的节点 LCOF", "question__title_slug": "shan-chu-lian-biao-de-jie-dian-lcof", "question__hide": false, - "total_acs": 369612, - "total_submitted": 617484, - "total_column_articles": 2353, + "total_acs": 371478, + "total_submitted": 620956, + "total_column_articles": 2359, "frontend_question_id": "剑指 Offer 18", "is_new_question": false }, @@ -6417,9 +6417,9 @@ "question__title": "反转链表 LCOF", "question__title_slug": "fan-zhuan-lian-biao-lcof", "question__hide": false, - "total_acs": 582743, - "total_submitted": 785831, - "total_column_articles": 3009, + "total_acs": 585272, + "total_submitted": 789231, + "total_column_articles": 3017, "frontend_question_id": "剑指 Offer 24", "is_new_question": false }, @@ -6438,9 +6438,9 @@ "question__title": "正则表达式匹配 LCOF", "question__title_slug": "zheng-ze-biao-da-shi-pi-pei-lcof", "question__hide": false, - "total_acs": 123843, - "total_submitted": 322294, - "total_column_articles": 732, + "total_acs": 124382, + "total_submitted": 323838, + "total_column_articles": 734, "frontend_question_id": "剑指 Offer 19", "is_new_question": false }, @@ -6459,9 +6459,9 @@ "question__title": "打印从1到最大的n位数 LCOF", "question__title_slug": "da-yin-cong-1dao-zui-da-de-nwei-shu-lcof", "question__hide": false, - "total_acs": 265375, - "total_submitted": 341807, - "total_column_articles": 1607, + "total_acs": 266498, + "total_submitted": 343301, + "total_column_articles": 1610, "frontend_question_id": "剑指 Offer 17", "is_new_question": false }, @@ -6480,9 +6480,9 @@ "question__title": "数值的整数次方 LCOF", "question__title_slug": "shu-zhi-de-zheng-shu-ci-fang-lcof", "question__hide": false, - "total_acs": 243724, - "total_submitted": 698974, - "total_column_articles": 1299, + "total_acs": 244736, + "total_submitted": 701403, + "total_column_articles": 1301, "frontend_question_id": "剑指 Offer 16", "is_new_question": false }, @@ -6501,9 +6501,9 @@ "question__title": "链表中倒数第k个节点 LCOF", "question__title_slug": "lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof", "question__hide": false, - "total_acs": 478508, - "total_submitted": 597396, - "total_column_articles": 3654, + "total_acs": 480795, + "total_submitted": 600429, + "total_column_articles": 3663, "frontend_question_id": "剑指 Offer 22", "is_new_question": false }, @@ -6522,9 +6522,9 @@ "question__title": "顺时针打印矩阵 LCOF", "question__title_slug": "shun-shi-zhen-da-yin-ju-zhen-lcof", "question__hide": false, - "total_acs": 267472, - "total_submitted": 622257, - "total_column_articles": 2238, + "total_acs": 268801, + "total_submitted": 625236, + "total_column_articles": 2244, "frontend_question_id": "剑指 Offer 29", "is_new_question": false }, @@ -6543,9 +6543,9 @@ "question__title": "二进制中1的个数 LCOF", "question__title_slug": "er-jin-zhi-zhong-1de-ge-shu-lcof", "question__hide": false, - "total_acs": 340841, - "total_submitted": 449969, - "total_column_articles": 1853, + "total_acs": 341947, + "total_submitted": 451266, + "total_column_articles": 1857, "frontend_question_id": "剑指 Offer 15", "is_new_question": false }, @@ -6564,9 +6564,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": 385911, - "total_submitted": 593392, - "total_column_articles": 2691, + "total_acs": 387656, + "total_submitted": 596189, + "total_column_articles": 2697, "frontend_question_id": "剑指 Offer 21", "is_new_question": false }, @@ -6585,9 +6585,9 @@ "question__title": "表示数值的字符串 LCOF", "question__title_slug": "biao-shi-shu-zhi-de-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 150019, - "total_submitted": 599932, - "total_column_articles": 1601, + "total_acs": 151114, + "total_submitted": 604807, + "total_column_articles": 1610, "frontend_question_id": "剑指 Offer 20", "is_new_question": false }, @@ -6606,9 +6606,9 @@ "question__title": "对称的二叉树 LCOF", "question__title_slug": "dui-cheng-de-er-cha-shu-lcof", "question__hide": false, - "total_acs": 302090, - "total_submitted": 523961, - "total_column_articles": 1898, + "total_acs": 303324, + "total_submitted": 525928, + "total_column_articles": 1900, "frontend_question_id": "剑指 Offer 28", "is_new_question": false }, @@ -6627,9 +6627,9 @@ "question__title": "二叉树的镜像 LCOF", "question__title_slug": "er-cha-shu-de-jing-xiang-lcof", "question__hide": false, - "total_acs": 367710, - "total_submitted": 461745, - "total_column_articles": 2258, + "total_acs": 369105, + "total_submitted": 463434, + "total_column_articles": 2261, "frontend_question_id": "剑指 Offer 27", "is_new_question": false }, @@ -6648,9 +6648,9 @@ "question__title": "树的子结构 LCOF", "question__title_slug": "shu-de-zi-jie-gou-lcof", "question__hide": false, - "total_acs": 314579, - "total_submitted": 678145, - "total_column_articles": 2122, + "total_acs": 315997, + "total_submitted": 681178, + "total_column_articles": 2127, "frontend_question_id": "剑指 Offer 26", "is_new_question": false }, @@ -6669,9 +6669,9 @@ "question__title": "合并两个排序的链表 LCOF", "question__title_slug": "he-bing-liang-ge-pai-xu-de-lian-biao-lcof", "question__hide": false, - "total_acs": 368149, - "total_submitted": 510720, - "total_column_articles": 1967, + "total_acs": 369963, + "total_submitted": 513384, + "total_column_articles": 1970, "frontend_question_id": "剑指 Offer 25", "is_new_question": false }, @@ -6690,8 +6690,8 @@ "question__title": "剪绳子 II LCOF", "question__title_slug": "jian-sheng-zi-ii-lcof", "question__hide": false, - "total_acs": 153614, - "total_submitted": 489425, + "total_acs": 154235, + "total_submitted": 491531, "total_column_articles": 790, "frontend_question_id": "剑指 Offer 14- II", "is_new_question": false @@ -6711,9 +6711,9 @@ "question__title": "剪绳子 LCOF", "question__title_slug": "jian-sheng-zi-lcof", "question__hide": false, - "total_acs": 294711, - "total_submitted": 513054, - "total_column_articles": 2054, + "total_acs": 295881, + "total_submitted": 515093, + "total_column_articles": 2057, "frontend_question_id": "剑指 Offer 14- I", "is_new_question": false }, @@ -6732,9 +6732,9 @@ "question__title": "重建二叉树 LCOF", "question__title_slug": "zhong-jian-er-cha-shu-lcof", "question__hide": false, - "total_acs": 342766, - "total_submitted": 488249, - "total_column_articles": 2192, + "total_acs": 344042, + "total_submitted": 490069, + "total_column_articles": 2194, "frontend_question_id": "剑指 Offer 07", "is_new_question": false }, @@ -6753,9 +6753,9 @@ "question__title": "从尾到头打印链表 LCOF", "question__title_slug": "cong-wei-dao-tou-da-yin-lian-biao-lcof", "question__hide": false, - "total_acs": 642354, - "total_submitted": 864070, - "total_column_articles": 3683, + "total_acs": 645387, + "total_submitted": 868319, + "total_column_articles": 3694, "frontend_question_id": "剑指 Offer 06", "is_new_question": false }, @@ -6774,9 +6774,9 @@ "question__title": "机器人的运动范围 LCOF", "question__title_slug": "ji-qi-ren-de-yun-dong-fan-wei-lcof", "question__hide": false, - "total_acs": 325206, - "total_submitted": 606608, - "total_column_articles": 2584, + "total_acs": 326568, + "total_submitted": 609308, + "total_column_articles": 2587, "frontend_question_id": "剑指 Offer 13", "is_new_question": false }, @@ -6795,9 +6795,9 @@ "question__title": "替换空格 LCOF", "question__title_slug": "ti-huan-kong-ge-lcof", "question__hide": false, - "total_acs": 705290, - "total_submitted": 940134, - "total_column_articles": 3613, + "total_acs": 710223, + "total_submitted": 947162, + "total_column_articles": 3619, "frontend_question_id": "剑指 Offer 05", "is_new_question": false }, @@ -6816,9 +6816,9 @@ "question__title": "矩阵中的路径 LCOF", "question__title_slug": "ju-zhen-zhong-de-lu-jing-lcof", "question__hide": false, - "total_acs": 344778, - "total_submitted": 754968, - "total_column_articles": 1880, + "total_acs": 346146, + "total_submitted": 757818, + "total_column_articles": 1884, "frontend_question_id": "剑指 Offer 12", "is_new_question": false }, @@ -6837,9 +6837,9 @@ "question__title": "旋转数组的最小数字 LCOF", "question__title_slug": "xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof", "question__hide": false, - "total_acs": 499741, - "total_submitted": 1009900, - "total_column_articles": 2632, + "total_acs": 501449, + "total_submitted": 1012987, + "total_column_articles": 2636, "frontend_question_id": "剑指 Offer 11", "is_new_question": false }, @@ -6858,9 +6858,9 @@ "question__title": "青蛙跳台阶问题 LCOF", "question__title_slug": "qing-wa-tiao-tai-jie-wen-ti-lcof", "question__hide": false, - "total_acs": 390515, - "total_submitted": 854373, - "total_column_articles": 2092, + "total_acs": 392031, + "total_submitted": 857560, + "total_column_articles": 2097, "frontend_question_id": "剑指 Offer 10- II", "is_new_question": false }, @@ -6879,9 +6879,9 @@ "question__title": "二维数组中的查找 LCOF", "question__title_slug": "er-wei-shu-zu-zhong-de-cha-zhao-lcof", "question__hide": false, - "total_acs": 527988, - "total_submitted": 1336193, - "total_column_articles": 3565, + "total_acs": 530063, + "total_submitted": 1341780, + "total_column_articles": 3571, "frontend_question_id": "剑指 Offer 04", "is_new_question": false }, @@ -6900,9 +6900,9 @@ "question__title": "数组中重复的数字 LCOF", "question__title_slug": "shu-zu-zhong-zhong-fu-de-shu-zi-lcof", "question__hide": false, - "total_acs": 767782, - "total_submitted": 1146412, - "total_column_articles": 4421, + "total_acs": 770705, + "total_submitted": 1151096, + "total_column_articles": 4434, "frontend_question_id": "剑指 Offer 03", "is_new_question": false }, @@ -6921,9 +6921,9 @@ "question__title": "斐波那契数列 LCOF", "question__title_slug": "fei-bo-na-qi-shu-lie-lcof", "question__hide": false, - "total_acs": 500781, - "total_submitted": 1395664, - "total_column_articles": 2860, + "total_acs": 502643, + "total_submitted": 1401085, + "total_column_articles": 2863, "frontend_question_id": "剑指 Offer 10- I", "is_new_question": false }, @@ -6942,9 +6942,9 @@ "question__title": "用两个栈实现队列 LCOF", "question__title_slug": "yong-liang-ge-zhan-shi-xian-dui-lie-lcof", "question__hide": false, - "total_acs": 579619, - "total_submitted": 824069, - "total_column_articles": 3040, + "total_acs": 581668, + "total_submitted": 826915, + "total_column_articles": 3043, "frontend_question_id": "剑指 Offer 09", "is_new_question": false }, @@ -6963,9 +6963,9 @@ "question__title": "Smallest Difference LCCI", "question__title_slug": "smallest-difference-lcci", "question__hide": false, - "total_acs": 22396, - "total_submitted": 52444, - "total_column_articles": 290, + "total_acs": 22484, + "total_submitted": 52663, + "total_column_articles": 291, "frontend_question_id": "面试题 16.06", "is_new_question": false }, @@ -6984,9 +6984,9 @@ "question__title": "Tic-Tac-Toe LCCI", "question__title_slug": "tic-tac-toe-lcci", "question__hide": false, - "total_acs": 11780, - "total_submitted": 25070, - "total_column_articles": 221, + "total_acs": 11836, + "total_submitted": 25185, + "total_column_articles": 222, "frontend_question_id": "面试题 16.04", "is_new_question": false }, @@ -7005,9 +7005,9 @@ "question__title": "Intersection LCCI", "question__title_slug": "intersection-lcci", "question__hide": false, - "total_acs": 11174, - "total_submitted": 25446, - "total_column_articles": 254, + "total_acs": 11197, + "total_submitted": 25489, + "total_column_articles": 255, "frontend_question_id": "面试题 16.03", "is_new_question": false }, @@ -7026,9 +7026,9 @@ "question__title": "Words Frequency LCCI", "question__title_slug": "words-frequency-lcci", "question__hide": false, - "total_acs": 24035, - "total_submitted": 31260, - "total_column_articles": 275, + "total_acs": 24109, + "total_submitted": 31347, + "total_column_articles": 276, "frontend_question_id": "面试题 16.02", "is_new_question": false }, @@ -7047,9 +7047,9 @@ "question__title": "Swap Numbers LCCI", "question__title_slug": "swap-numbers-lcci", "question__hide": false, - "total_acs": 39976, - "total_submitted": 49101, - "total_column_articles": 559, + "total_acs": 40115, + "total_submitted": 49277, + "total_column_articles": 560, "frontend_question_id": "面试题 16.01", "is_new_question": false }, @@ -7068,9 +7068,9 @@ "question__title": "Sparse Array Search LCCI", "question__title_slug": "sparse-array-search-lcci", "question__hide": false, - "total_acs": 30752, - "total_submitted": 54065, - "total_column_articles": 369, + "total_acs": 30842, + "total_submitted": 54254, + "total_column_articles": 372, "frontend_question_id": "面试题 10.05", "is_new_question": false }, @@ -7089,8 +7089,8 @@ "question__title": "Permutation I LCCI", "question__title_slug": "permutation-i-lcci", "question__hide": false, - "total_acs": 32952, - "total_submitted": 40695, + "total_acs": 33069, + "total_submitted": 40865, "total_column_articles": 468, "frontend_question_id": "面试题 08.07", "is_new_question": false @@ -7110,8 +7110,8 @@ "question__title": "Magic Index LCCI", "question__title_slug": "magic-index-lcci", "question__hide": false, - "total_acs": 62499, - "total_submitted": 92742, + "total_acs": 62586, + "total_submitted": 92886, "total_column_articles": 491, "frontend_question_id": "面试题 08.03", "is_new_question": false @@ -7131,9 +7131,9 @@ "question__title": "Eight Queens LCCI", "question__title_slug": "eight-queens-lcci", "question__hide": false, - "total_acs": 29125, - "total_submitted": 38115, - "total_column_articles": 424, + "total_acs": 29264, + "total_submitted": 38276, + "total_column_articles": 426, "frontend_question_id": "面试题 08.12", "is_new_question": false }, @@ -7152,9 +7152,9 @@ "question__title": "Search Rotate Array LCCI", "question__title_slug": "search-rotate-array-lcci", "question__hide": false, - "total_acs": 26566, - "total_submitted": 69099, - "total_column_articles": 305, + "total_acs": 26714, + "total_submitted": 69498, + "total_column_articles": 306, "frontend_question_id": "面试题 10.03", "is_new_question": false }, @@ -7173,9 +7173,9 @@ "question__title": "Coin LCCI", "question__title_slug": "coin-lcci", "question__hide": false, - "total_acs": 44038, - "total_submitted": 88615, - "total_column_articles": 376, + "total_acs": 44156, + "total_submitted": 88890, + "total_column_articles": 377, "frontend_question_id": "面试题 08.11", "is_new_question": false }, @@ -7194,9 +7194,9 @@ "question__title": "Reverse Bits LCCI", "question__title_slug": "reverse-bits-lcci", "question__hide": false, - "total_acs": 22008, - "total_submitted": 58462, - "total_column_articles": 362, + "total_acs": 22115, + "total_submitted": 58690, + "total_column_articles": 363, "frontend_question_id": "面试题 05.03", "is_new_question": false }, @@ -7215,9 +7215,9 @@ "question__title": "Check SubTree LCCI", "question__title_slug": "check-subtree-lcci", "question__hide": false, - "total_acs": 27416, - "total_submitted": 40844, - "total_column_articles": 386, + "total_acs": 27515, + "total_submitted": 41070, + "total_column_articles": 387, "frontend_question_id": "面试题 04.10", "is_new_question": false }, @@ -7236,9 +7236,9 @@ "question__title": "Animal Shelter LCCI", "question__title_slug": "animal-shelter-lcci", "question__hide": false, - "total_acs": 19536, - "total_submitted": 33503, - "total_column_articles": 260, + "total_acs": 19603, + "total_submitted": 33616, + "total_column_articles": 263, "frontend_question_id": "面试题 03.06", "is_new_question": false }, @@ -7257,8 +7257,8 @@ "question__title": "Binary Number to String LCCI", "question__title_slug": "binary-number-to-string-lcci", "question__hide": false, - "total_acs": 37751, - "total_submitted": 49124, + "total_acs": 37820, + "total_submitted": 49227, "total_column_articles": 426, "frontend_question_id": "面试题 05.02", "is_new_question": false @@ -7278,8 +7278,8 @@ "question__title": "Pile Box LCCI", "question__title_slug": "pile-box-lcci", "question__hide": false, - "total_acs": 12175, - "total_submitted": 23748, + "total_acs": 12235, + "total_submitted": 23865, "total_column_articles": 134, "frontend_question_id": "面试题 08.13", "is_new_question": false @@ -7299,8 +7299,8 @@ "question__title": "Color Fill LCCI", "question__title_slug": "color-fill-lcci", "question__hide": false, - "total_acs": 23105, - "total_submitted": 41398, + "total_acs": 23364, + "total_submitted": 41791, "total_column_articles": 339, "frontend_question_id": "面试题 08.10", "is_new_question": false @@ -7320,8 +7320,8 @@ "question__title": "Bracket LCCI", "question__title_slug": "bracket-lcci", "question__hide": false, - "total_acs": 33633, - "total_submitted": 40943, + "total_acs": 33712, + "total_submitted": 41027, "total_column_articles": 500, "frontend_question_id": "面试题 08.09", "is_new_question": false @@ -7341,9 +7341,9 @@ "question__title": "Recursive Mulitply LCCI", "question__title_slug": "recursive-mulitply-lcci", "question__hide": false, - "total_acs": 45665, - "total_submitted": 69655, - "total_column_articles": 760, + "total_acs": 45858, + "total_submitted": 69942, + "total_column_articles": 761, "frontend_question_id": "面试题 08.05", "is_new_question": false }, @@ -7362,8 +7362,8 @@ "question__title": "Power Set LCCI", "question__title_slug": "power-set-lcci", "question__hide": false, - "total_acs": 31677, - "total_submitted": 38585, + "total_acs": 31768, + "total_submitted": 38687, "total_column_articles": 465, "frontend_question_id": "面试题 08.04", "is_new_question": false @@ -7383,9 +7383,9 @@ "question__title": "Three Steps Problem LCCI", "question__title_slug": "three-steps-problem-lcci", "question__hide": false, - "total_acs": 64824, - "total_submitted": 176706, - "total_column_articles": 670, + "total_acs": 65143, + "total_submitted": 177618, + "total_column_articles": 671, "frontend_question_id": "面试题 08.01", "is_new_question": false }, @@ -7404,8 +7404,8 @@ "question__title": "Draw Line LCCI", "question__title_slug": "draw-line-lcci", "question__hide": false, - "total_acs": 6769, - "total_submitted": 12639, + "total_acs": 6801, + "total_submitted": 12718, "total_column_articles": 134, "frontend_question_id": "面试题 05.08", "is_new_question": false @@ -7425,8 +7425,8 @@ "question__title": "Stack of Plates LCCI", "question__title_slug": "stack-of-plates-lcci", "question__hide": false, - "total_acs": 16189, - "total_submitted": 42050, + "total_acs": 16248, + "total_submitted": 42258, "total_column_articles": 211, "frontend_question_id": "面试题 03.03", "is_new_question": false @@ -7446,9 +7446,9 @@ "question__title": "Sum Lists LCCI", "question__title_slug": "sum-lists-lcci", "question__hide": false, - "total_acs": 64366, - "total_submitted": 137148, - "total_column_articles": 765, + "total_acs": 64646, + "total_submitted": 137820, + "total_column_articles": 767, "frontend_question_id": "面试题 02.05", "is_new_question": false }, @@ -7467,9 +7467,9 @@ "question__title": "Delete Middle Node LCCI", "question__title_slug": "delete-middle-node-lcci", "question__hide": false, - "total_acs": 95246, - "total_submitted": 110793, - "total_column_articles": 865, + "total_acs": 95461, + "total_submitted": 111055, + "total_column_articles": 868, "frontend_question_id": "面试题 02.03", "is_new_question": false }, @@ -7488,9 +7488,9 @@ "question__title": "Zero Matrix LCCI", "question__title_slug": "zero-matrix-lcci", "question__hide": false, - "total_acs": 115673, - "total_submitted": 180275, - "total_column_articles": 1004, + "total_acs": 116175, + "total_submitted": 181089, + "total_column_articles": 1006, "frontend_question_id": "面试题 01.08", "is_new_question": false }, @@ -7509,9 +7509,9 @@ "question__title": "Rotate Matrix LCCI", "question__title_slug": "rotate-matrix-lcci", "question__hide": false, - "total_acs": 113778, - "total_submitted": 155746, - "total_column_articles": 1233, + "total_acs": 114367, + "total_submitted": 156620, + "total_column_articles": 1235, "frontend_question_id": "面试题 01.07", "is_new_question": false }, @@ -7530,9 +7530,9 @@ "question__title": "Palindrome Permutation LCCI", "question__title_slug": "palindrome-permutation-lcci", "question__hide": false, - "total_acs": 69626, - "total_submitted": 129878, - "total_column_articles": 1157, + "total_acs": 69862, + "total_submitted": 130369, + "total_column_articles": 1163, "frontend_question_id": "面试题 01.04", "is_new_question": false }, @@ -7551,8 +7551,8 @@ "question__title": "Closed Number LCCI", "question__title_slug": "closed-number-lcci", "question__hide": false, - "total_acs": 9104, - "total_submitted": 25619, + "total_acs": 9139, + "total_submitted": 25713, "total_column_articles": 200, "frontend_question_id": "面试题 05.04", "is_new_question": false @@ -7572,9 +7572,9 @@ "question__title": "Exchange LCCI", "question__title_slug": "exchange-lcci", "question__hide": false, - "total_acs": 18808, - "total_submitted": 26494, - "total_column_articles": 300, + "total_acs": 18886, + "total_submitted": 26601, + "total_column_articles": 301, "frontend_question_id": "面试题 05.07", "is_new_question": false }, @@ -7593,8 +7593,8 @@ "question__title": "Convert Integer LCCI", "question__title_slug": "convert-integer-lcci", "question__hide": false, - "total_acs": 20985, - "total_submitted": 40766, + "total_acs": 21223, + "total_submitted": 41273, "total_column_articles": 336, "frontend_question_id": "面试题 05.06", "is_new_question": false @@ -7614,9 +7614,9 @@ "question__title": "Insert Into Bits LCCI", "question__title_slug": "insert-into-bits-lcci", "question__hide": false, - "total_acs": 17229, - "total_submitted": 33453, - "total_column_articles": 304, + "total_acs": 17305, + "total_submitted": 33585, + "total_column_articles": 305, "frontend_question_id": "面试题 05.01", "is_new_question": false }, @@ -7635,8 +7635,8 @@ "question__title": "First Common Ancestor LCCI", "question__title_slug": "first-common-ancestor-lcci", "question__hide": false, - "total_acs": 28107, - "total_submitted": 39289, + "total_acs": 28200, + "total_submitted": 39430, "total_column_articles": 274, "frontend_question_id": "面试题 04.08", "is_new_question": false @@ -7656,8 +7656,8 @@ "question__title": "Successor LCCI", "question__title_slug": "successor-lcci", "question__hide": false, - "total_acs": 65850, - "total_submitted": 105236, + "total_acs": 65974, + "total_submitted": 105448, "total_column_articles": 671, "frontend_question_id": "面试题 04.06", "is_new_question": false @@ -7677,9 +7677,9 @@ "question__title": "Legal Binary Search Tree LCCI", "question__title_slug": "legal-binary-search-tree-lcci", "question__hide": false, - "total_acs": 39533, - "total_submitted": 110635, - "total_column_articles": 448, + "total_acs": 39650, + "total_submitted": 110945, + "total_column_articles": 451, "frontend_question_id": "面试题 04.05", "is_new_question": false }, @@ -7698,9 +7698,9 @@ "question__title": "Check Balance LCCI", "question__title_slug": "check-balance-lcci", "question__hide": false, - "total_acs": 46148, - "total_submitted": 77212, - "total_column_articles": 473, + "total_acs": 46254, + "total_submitted": 77397, + "total_column_articles": 474, "frontend_question_id": "面试题 04.04", "is_new_question": false }, @@ -7719,8 +7719,8 @@ "question__title": "List of Depth LCCI", "question__title_slug": "list-of-depth-lcci", "question__hide": false, - "total_acs": 35572, - "total_submitted": 44034, + "total_acs": 35679, + "total_submitted": 44169, "total_column_articles": 720, "frontend_question_id": "面试题 04.03", "is_new_question": false @@ -7740,9 +7740,9 @@ "question__title": "Minimum Height Tree LCCI", "question__title_slug": "minimum-height-tree-lcci", "question__hide": false, - "total_acs": 48764, - "total_submitted": 61767, - "total_column_articles": 565, + "total_acs": 48868, + "total_submitted": 61895, + "total_column_articles": 567, "frontend_question_id": "面试题 04.02", "is_new_question": false }, @@ -7761,9 +7761,9 @@ "question__title": "Sort of Stacks LCCI", "question__title_slug": "sort-of-stacks-lcci", "question__hide": false, - "total_acs": 27240, - "total_submitted": 50802, - "total_column_articles": 350, + "total_acs": 27316, + "total_submitted": 50936, + "total_column_articles": 351, "frontend_question_id": "面试题 03.05", "is_new_question": false }, @@ -7782,9 +7782,9 @@ "question__title": "Three in One LCCI", "question__title_slug": "three-in-one-lcci", "question__hide": false, - "total_acs": 21057, - "total_submitted": 39444, - "total_column_articles": 287, + "total_acs": 21150, + "total_submitted": 39590, + "total_column_articles": 292, "frontend_question_id": "面试题 03.01", "is_new_question": false }, @@ -7803,9 +7803,9 @@ "question__title": "Route Between Nodes LCCI ", "question__title_slug": "route-between-nodes-lcci", "question__hide": false, - "total_acs": 31124, - "total_submitted": 58278, - "total_column_articles": 390, + "total_acs": 31221, + "total_submitted": 58530, + "total_column_articles": 392, "frontend_question_id": "面试题 04.01", "is_new_question": false }, @@ -7824,8 +7824,8 @@ "question__title": "Implement Queue using Stacks LCCI", "question__title_slug": "implement-queue-using-stacks-lcci", "question__hide": false, - "total_acs": 34612, - "total_submitted": 48218, + "total_acs": 34732, + "total_submitted": 48363, "total_column_articles": 442, "frontend_question_id": "面试题 03.04", "is_new_question": false @@ -7845,9 +7845,9 @@ "question__title": "Min Stack LCCI", "question__title_slug": "min-stack-lcci", "question__hide": false, - "total_acs": 40153, - "total_submitted": 64664, - "total_column_articles": 415, + "total_acs": 40277, + "total_submitted": 64837, + "total_column_articles": 416, "frontend_question_id": "面试题 03.02", "is_new_question": false }, @@ -7866,9 +7866,9 @@ "question__title": "Linked List Cycle LCCI", "question__title_slug": "linked-list-cycle-lcci", "question__hide": false, - "total_acs": 43345, - "total_submitted": 78469, - "total_column_articles": 412, + "total_acs": 43484, + "total_submitted": 78684, + "total_column_articles": 413, "frontend_question_id": "面试题 02.08", "is_new_question": false }, @@ -7887,9 +7887,9 @@ "question__title": "Intersection of Two Linked Lists LCCI", "question__title_slug": "intersection-of-two-linked-lists-lcci", "question__hide": false, - "total_acs": 181546, - "total_submitted": 274185, - "total_column_articles": 1177, + "total_acs": 183446, + "total_submitted": 276957, + "total_column_articles": 1185, "frontend_question_id": "面试题 02.07", "is_new_question": false }, @@ -7908,9 +7908,9 @@ "question__title": "Palindrome Linked List LCCI", "question__title_slug": "palindrome-linked-list-lcci", "question__hide": false, - "total_acs": 62447, - "total_submitted": 127964, - "total_column_articles": 693, + "total_acs": 62653, + "total_submitted": 128353, + "total_column_articles": 695, "frontend_question_id": "面试题 02.06", "is_new_question": false }, @@ -7929,9 +7929,9 @@ "question__title": "Remove Duplicate Node LCCI", "question__title_slug": "remove-duplicate-node-lcci", "question__hide": false, - "total_acs": 92872, - "total_submitted": 139118, - "total_column_articles": 889, + "total_acs": 93167, + "total_submitted": 139595, + "total_column_articles": 891, "frontend_question_id": "面试题 02.01", "is_new_question": false }, @@ -7950,9 +7950,9 @@ "question__title": "String Rotation LCCI", "question__title_slug": "string-rotation-lcci", "question__hide": false, - "total_acs": 87022, - "total_submitted": 160923, - "total_column_articles": 853, + "total_acs": 87196, + "total_submitted": 161316, + "total_column_articles": 856, "frontend_question_id": "面试题 01.09", "is_new_question": false }, @@ -7971,9 +7971,9 @@ "question__title": "Compress String LCCI", "question__title_slug": "compress-string-lcci", "question__hide": false, - "total_acs": 109076, - "total_submitted": 236376, - "total_column_articles": 1475, + "total_acs": 109404, + "total_submitted": 237166, + "total_column_articles": 1478, "frontend_question_id": "面试题 01.06", "is_new_question": false }, @@ -7992,9 +7992,9 @@ "question__title": "String to URL LCCI", "question__title_slug": "string-to-url-lcci", "question__hide": false, - "total_acs": 77264, - "total_submitted": 134737, - "total_column_articles": 746, + "total_acs": 77544, + "total_submitted": 135185, + "total_column_articles": 750, "frontend_question_id": "面试题 01.03", "is_new_question": false }, @@ -8013,9 +8013,9 @@ "question__title": "Check Permutation LCCI", "question__title_slug": "check-permutation-lcci", "question__hide": false, - "total_acs": 129623, - "total_submitted": 197570, - "total_column_articles": 1879, + "total_acs": 129909, + "total_submitted": 198004, + "total_column_articles": 1881, "frontend_question_id": "面试题 01.02", "is_new_question": false }, @@ -8034,9 +8034,9 @@ "question__title": "Is Unique LCCI", "question__title_slug": "is-unique-lcci", "question__hide": false, - "total_acs": 155741, - "total_submitted": 219352, - "total_column_articles": 2213, + "total_acs": 156232, + "total_submitted": 220010, + "total_column_articles": 2218, "frontend_question_id": "面试题 01.01", "is_new_question": false }, @@ -8055,9 +8055,9 @@ "question__title": "Guess Numbers", "question__title_slug": "guess-numbers", "question__hide": false, - "total_acs": 99518, - "total_submitted": 117546, - "total_column_articles": 809, + "total_acs": 99677, + "total_submitted": 117746, + "total_column_articles": 812, "frontend_question_id": "LCP 01", "is_new_question": false }, @@ -8076,8 +8076,8 @@ "question__title": "Programmable Robot", "question__title_slug": "programmable-robot", "question__hide": false, - "total_acs": 15795, - "total_submitted": 67973, + "total_acs": 15835, + "total_submitted": 68087, "total_column_articles": 244, "frontend_question_id": "LCP 03", "is_new_question": false @@ -8097,8 +8097,8 @@ "question__title": "Coin Bonus", "question__title_slug": "coin-bonus", "question__hide": false, - "total_acs": 3112, - "total_submitted": 13872, + "total_acs": 3119, + "total_submitted": 13893, "total_column_articles": 70, "frontend_question_id": "LCP 05", "is_new_question": false @@ -8118,8 +8118,8 @@ "question__title": "Broken Board Dominoes", "question__title_slug": "broken-board-dominoes", "question__hide": false, - "total_acs": 4212, - "total_submitted": 10219, + "total_acs": 4221, + "total_submitted": 10239, "total_column_articles": 93, "frontend_question_id": "LCP 04", "is_new_question": false @@ -8139,8 +8139,8 @@ "question__title": "Deep Dark Fraction", "question__title_slug": "deep-dark-fraction", "question__hide": false, - "total_acs": 19941, - "total_submitted": 28373, + "total_acs": 19992, + "total_submitted": 28437, "total_column_articles": 331, "frontend_question_id": "LCP 02", "is_new_question": false @@ -8154,17 +8154,59 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3078, + "question__title": "Election Results", + "question__title_slug": "election-results", + "question__hide": false, + "total_acs": 28, + "total_submitted": 36, + "total_column_articles": 3, + "frontend_question_id": "2820", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3077, + "question__title": "Minimum Relative Loss After Buying Chocolates", + "question__title_slug": "minimum-relative-loss-after-buying-chocolates", + "question__hide": false, + "total_acs": 11, + "total_submitted": 15, + "total_column_articles": 2, + "frontend_question_id": "2819", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3043, "question__title": "Minimum Time Takes to Reach Destination Without Drowning", "question__title_slug": "minimum-time-takes-to-reach-destination-without-drowning", "question__hide": false, - "total_acs": 19, - "total_submitted": 31, + "total_acs": 39, + "total_submitted": 61, "total_column_articles": 0, "frontend_question_id": "2814", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -8181,8 +8223,8 @@ "question__title": "Find The K-th Lucky Number", "question__title_slug": "find-the-k-th-lucky-number", "question__hide": false, - "total_acs": 54, - "total_submitted": 67, + "total_acs": 68, + "total_submitted": 96, "total_column_articles": 5, "frontend_question_id": "2802", "is_new_question": false @@ -8196,14 +8238,56 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3018, + "question__title": "Make String a Subsequence Using Cyclic Increments", + "question__title_slug": "make-string-a-subsequence-using-cyclic-increments", + "question__hide": false, + "total_acs": 2355, + "total_submitted": 4746, + "total_column_articles": 16, + "frontend_question_id": "8014", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3017, + "question__title": "Number of Beautiful Integers in the Range", + "question__title_slug": "number-of-beautiful-integers-in-the-range", + "question__hide": false, + "total_acs": 1036, + "total_submitted": 4343, + "total_column_articles": 6, + "frontend_question_id": "8013", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3016, "question__title": "Count Nodes That Are Great Enough", "question__title_slug": "count-nodes-that-are-great-enough", "question__hide": false, - "total_acs": 53, - "total_submitted": 77, + "total_acs": 61, + "total_submitted": 97, "total_column_articles": 1, "frontend_question_id": "2792", "is_new_question": false @@ -8223,9 +8307,9 @@ "question__title": "Status of Flight Tickets", "question__title_slug": "status-of-flight-tickets", "question__hide": false, - "total_acs": 46, - "total_submitted": 106, - "total_column_articles": 4, + "total_acs": 81, + "total_submitted": 161, + "total_column_articles": 6, "frontend_question_id": "2793", "is_new_question": false }, @@ -8244,9 +8328,9 @@ "question__title": "Flight Occupancy and Waitlist Analysis", "question__title_slug": "flight-occupancy-and-waitlist-analysis", "question__hide": false, - "total_acs": 75, - "total_submitted": 170, - "total_column_articles": 5, + "total_acs": 99, + "total_submitted": 244, + "total_column_articles": 8, "frontend_question_id": "2783", "is_new_question": false }, @@ -8259,14 +8343,56 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3001, + "question__title": "Apply Operations to Maximize Score", + "question__title_slug": "apply-operations-to-maximize-score", + "question__hide": false, + "total_acs": 2451, + "total_submitted": 6132, + "total_column_articles": 44, + "frontend_question_id": "2818", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3000, + "question__title": "Minimum Absolute Difference Between Elements With Constraint", + "question__title_slug": "minimum-absolute-difference-between-elements-with-constraint", + "question__hide": false, + "total_acs": 4174, + "total_submitted": 13857, + "total_column_articles": 59, + "frontend_question_id": "2817", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2995, "question__title": "Number of Unique Categories", "question__title_slug": "number-of-unique-categories", "question__hide": false, - "total_acs": 69, - "total_submitted": 83, + "total_acs": 78, + "total_submitted": 93, "total_column_articles": 2, "frontend_question_id": "2782", "is_new_question": false @@ -8280,15 +8406,57 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2979, + "question__title": "Maximize the Profit as the Salesman", + "question__title_slug": "maximize-the-profit-as-the-salesman", + "question__hide": false, + "total_acs": 2487, + "total_submitted": 7729, + "total_column_articles": 30, + "frontend_question_id": "7006", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2977, + "question__title": "Check if a String Is an Acronym of Words", + "question__title_slug": "check-if-a-string-is-an-acronym-of-words", + "question__hide": false, + "total_acs": 4244, + "total_submitted": 5015, + "total_column_articles": 16, + "frontend_question_id": "7004", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2955, "question__title": "Account Balance After Rounded Purchase", "question__title_slug": "account-balance-after-rounded-purchase", "question__hide": false, - "total_acs": 3073, - "total_submitted": 4951, - "total_column_articles": 15, + "total_acs": 3437, + "total_submitted": 5491, + "total_column_articles": 16, "frontend_question_id": "2806", "is_new_question": false }, @@ -8307,9 +8475,9 @@ "question__title": "Minimum Time to Make Array Sum At Most x", "question__title_slug": "minimum-time-to-make-array-sum-at-most-x", "question__hide": false, - "total_acs": 944, - "total_submitted": 2640, - "total_column_articles": 15, + "total_acs": 1133, + "total_submitted": 2943, + "total_column_articles": 16, "frontend_question_id": "2809", "is_new_question": false }, @@ -8328,8 +8496,8 @@ "question__title": "Height of Special Binary Tree", "question__title_slug": "height-of-special-binary-tree", "question__hide": false, - "total_acs": 49, - "total_submitted": 65, + "total_acs": 55, + "total_submitted": 71, "total_column_articles": 2, "frontend_question_id": "2773", "is_new_question": false @@ -8343,14 +8511,35 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2925, + "question__title": "Inversion of Object", + "question__title_slug": "inversion-of-object", + "question__hide": false, + "total_acs": 23, + "total_submitted": 33, + "total_column_articles": 1, + "frontend_question_id": "2822", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2921, "question__title": "Count Stepping Numbers in Range", "question__title_slug": "count-stepping-numbers-in-range", "question__hide": false, - "total_acs": 2320, - "total_submitted": 5636, + "total_acs": 2403, + "total_submitted": 5863, "total_column_articles": 44, "frontend_question_id": "2801", "is_new_question": false @@ -8370,9 +8559,9 @@ "question__title": "Minimum Seconds to Equalize a Circular Array", "question__title_slug": "minimum-seconds-to-equalize-a-circular-array", "question__hide": false, - "total_acs": 2279, - "total_submitted": 7010, - "total_column_articles": 40, + "total_acs": 2571, + "total_submitted": 7541, + "total_column_articles": 47, "frontend_question_id": "2808", "is_new_question": false }, @@ -8391,9 +8580,9 @@ "question__title": "Maximum Number of Groups With Increasing Length", "question__title_slug": "maximum-number-of-groups-with-increasing-length", "question__hide": false, - "total_acs": 2346, - "total_submitted": 11232, - "total_column_articles": 44, + "total_acs": 2401, + "total_submitted": 11463, + "total_column_articles": 46, "frontend_question_id": "2790", "is_new_question": false }, @@ -8412,9 +8601,9 @@ "question__title": "is Array a Preorder of Some ‌Binary Tree", "question__title_slug": "is-array-a-preorder-of-some-binary-tree", "question__hide": false, - "total_acs": 74, - "total_submitted": 109, - "total_column_articles": 2, + "total_acs": 81, + "total_submitted": 119, + "total_column_articles": 3, "frontend_question_id": "2764", "is_new_question": false }, @@ -8427,15 +8616,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2917, + "question__title": "Count Pairs Whose Sum is Less than Target", + "question__title_slug": "count-pairs-whose-sum-is-less-than-target", + "question__hide": false, + "total_acs": 2642, + "total_submitted": 2894, + "total_column_articles": 7, + "frontend_question_id": "6954", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2916, "question__title": "Check if it is Possible to Split Array", "question__title_slug": "check-if-it-is-possible-to-split-array", "question__hide": false, - "total_acs": 5001, - "total_submitted": 16335, - "total_column_articles": 58, + "total_acs": 5705, + "total_submitted": 18273, + "total_column_articles": 64, "frontend_question_id": "2811", "is_new_question": false }, @@ -8454,9 +8664,9 @@ "question__title": "Find the Safest Path in a Grid", "question__title_slug": "find-the-safest-path-in-a-grid", "question__hide": false, - "total_acs": 2997, - "total_submitted": 11753, - "total_column_articles": 47, + "total_acs": 3521, + "total_submitted": 13377, + "total_column_articles": 52, "frontend_question_id": "2812", "is_new_question": false }, @@ -8469,14 +8679,56 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2912, + "question__title": "Deep Object Filter", + "question__title_slug": "deep-object-filter", + "question__hide": false, + "total_acs": 15, + "total_submitted": 42, + "total_column_articles": 0, + "frontend_question_id": "2823", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2909, + "question__title": "Delay the Resolution of Each Promise", + "question__title_slug": "delay-the-resolution-of-each-promise", + "question__hide": false, + "total_acs": 23, + "total_submitted": 33, + "total_column_articles": 1, + "frontend_question_id": "2821", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2908, "question__title": "Custom Interval", "question__title_slug": "custom-interval", "question__hide": false, - "total_acs": 36, - "total_submitted": 41, + "total_acs": 40, + "total_submitted": 47, "total_column_articles": 2, "frontend_question_id": "2805", "is_new_question": false @@ -8496,8 +8748,8 @@ "question__title": "Array Prototype ForEach", "question__title_slug": "array-prototype-foreach", "question__hide": false, - "total_acs": 38, - "total_submitted": 45, + "total_acs": 50, + "total_submitted": 58, "total_column_articles": 2, "frontend_question_id": "2804", "is_new_question": false @@ -8517,9 +8769,9 @@ "question__title": "Count Paths That Can Form a Palindrome in a Tree", "question__title_slug": "count-paths-that-can-form-a-palindrome-in-a-tree", "question__hide": false, - "total_acs": 1975, - "total_submitted": 3974, - "total_column_articles": 29, + "total_acs": 2024, + "total_submitted": 4083, + "total_column_articles": 30, "frontend_question_id": "2791", "is_new_question": false }, @@ -8532,15 +8784,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2904, + "question__title": "Sorting Three Groups", + "question__title_slug": "sorting-three-groups", + "question__hide": false, + "total_acs": 1856, + "total_submitted": 4172, + "total_column_articles": 16, + "frontend_question_id": "6941", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2903, "question__title": "Insert Greatest Common Divisors in Linked List", "question__title_slug": "insert-greatest-common-divisors-in-linked-list", "question__hide": false, - "total_acs": 3149, - "total_submitted": 3478, - "total_column_articles": 30, + "total_acs": 3568, + "total_submitted": 3962, + "total_column_articles": 32, "frontend_question_id": "2807", "is_new_question": false }, @@ -8553,15 +8826,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2902, + "question__title": "Max Pair Sum in an Array", + "question__title_slug": "max-pair-sum-in-an-array", + "question__hide": false, + "total_acs": 6289, + "total_submitted": 9186, + "total_column_articles": 43, + "frontend_question_id": "2815", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2901, "question__title": "Factorial Generator", "question__title_slug": "factorial-generator", "question__hide": false, - "total_acs": 39, - "total_submitted": 44, - "total_column_articles": 1, + "total_acs": 53, + "total_submitted": 64, + "total_column_articles": 2, "frontend_question_id": "2803", "is_new_question": false }, @@ -8580,9 +8874,9 @@ "question__title": "Partial Function with Placeholders", "question__title_slug": "partial-function-with-placeholders", "question__hide": false, - "total_acs": 46, - "total_submitted": 52, - "total_column_articles": 2, + "total_acs": 57, + "total_submitted": 63, + "total_column_articles": 3, "frontend_question_id": "2797", "is_new_question": false }, @@ -8601,8 +8895,8 @@ "question__title": "Repeat String", "question__title_slug": "repeat-string", "question__hide": false, - "total_acs": 54, - "total_submitted": 59, + "total_acs": 74, + "total_submitted": 79, "total_column_articles": 3, "frontend_question_id": "2796", "is_new_question": false @@ -8622,8 +8916,8 @@ "question__title": "Parallel Execution of Promises for Individual Results Retrieval", "question__title_slug": "parallel-execution-of-promises-for-individual-results-retrieval", "question__hide": false, - "total_acs": 40, - "total_submitted": 44, + "total_acs": 50, + "total_submitted": 54, "total_column_articles": 2, "frontend_question_id": "2795", "is_new_question": false @@ -8643,8 +8937,8 @@ "question__title": "Count Houses in a Circular Street II", "question__title_slug": "count-houses-in-a-circular-street-ii", "question__hide": false, - "total_acs": 149, - "total_submitted": 171, + "total_acs": 157, + "total_submitted": 180, "total_column_articles": 8, "frontend_question_id": "2753", "is_new_question": false @@ -8664,9 +8958,9 @@ "question__title": "Maximum Elegance of a K-Length Subsequence", "question__title_slug": "maximum-elegance-of-a-k-length-subsequence", "question__hide": false, - "total_acs": 1622, - "total_submitted": 4142, - "total_column_articles": 27, + "total_acs": 1925, + "total_submitted": 4746, + "total_column_articles": 28, "frontend_question_id": "2813", "is_new_question": false }, @@ -8685,9 +8979,9 @@ "question__title": "Visit Array Positions to Maximize Score", "question__title_slug": "visit-array-positions-to-maximize-score", "question__hide": false, - "total_acs": 3161, - "total_submitted": 7997, - "total_column_articles": 50, + "total_acs": 3236, + "total_submitted": 8147, + "total_column_articles": 51, "frontend_question_id": "2786", "is_new_question": false }, @@ -8706,9 +9000,9 @@ "question__title": "Check if Array is Good", "question__title_slug": "check-if-array-is-good", "question__hide": false, - "total_acs": 3465, - "total_submitted": 5592, - "total_column_articles": 42, + "total_acs": 3567, + "total_submitted": 5746, + "total_column_articles": 44, "frontend_question_id": "2784", "is_new_question": false }, @@ -8727,8 +9021,8 @@ "question__title": "Maximum Beauty of an Array After Applying Operation", "question__title_slug": "maximum-beauty-of-an-array-after-applying-operation", "question__hide": false, - "total_acs": 5783, - "total_submitted": 15116, + "total_acs": 5906, + "total_submitted": 15330, "total_column_articles": 81, "frontend_question_id": "2779", "is_new_question": false @@ -8748,8 +9042,8 @@ "question__title": "Count Substrings Without Repeating Character", "question__title_slug": "count-substrings-without-repeating-character", "question__hide": false, - "total_acs": 88, - "total_submitted": 129, + "total_acs": 98, + "total_submitted": 143, "total_column_articles": 3, "frontend_question_id": "2743", "is_new_question": false @@ -8769,8 +9063,8 @@ "question__title": "Number of Black Blocks", "question__title_slug": "number-of-black-blocks", "question__hide": false, - "total_acs": 2454, - "total_submitted": 5533, + "total_acs": 2505, + "total_submitted": 5616, "total_column_articles": 28, "frontend_question_id": "2768", "is_new_question": false @@ -8790,8 +9084,8 @@ "question__title": "Minimum Index of a Valid Split", "question__title_slug": "minimum-index-of-a-valid-split", "question__hide": false, - "total_acs": 4429, - "total_submitted": 6851, + "total_acs": 4484, + "total_submitted": 6913, "total_column_articles": 50, "frontend_question_id": "2780", "is_new_question": false @@ -8811,9 +9105,9 @@ "question__title": "Sort Vowels in a String", "question__title_slug": "sort-vowels-in-a-string", "question__hide": false, - "total_acs": 3333, - "total_submitted": 4364, - "total_column_articles": 32, + "total_acs": 3420, + "total_submitted": 4472, + "total_column_articles": 33, "frontend_question_id": "2785", "is_new_question": false }, @@ -8832,9 +9126,9 @@ "question__title": "Faulty Keyboard", "question__title_slug": "faulty-keyboard", "question__hide": false, - "total_acs": 6026, - "total_submitted": 7198, - "total_column_articles": 35, + "total_acs": 6860, + "total_submitted": 8266, + "total_column_articles": 38, "frontend_question_id": "2810", "is_new_question": false }, @@ -8853,8 +9147,8 @@ "question__title": "Count Occurrences in Text", "question__title_slug": "count-occurrences-in-text", "question__hide": false, - "total_acs": 90, - "total_submitted": 229, + "total_acs": 126, + "total_submitted": 270, "total_column_articles": 5, "frontend_question_id": "2738", "is_new_question": false @@ -8874,8 +9168,8 @@ "question__title": "Length of the Longest Valid Substring", "question__title_slug": "length-of-the-longest-valid-substring", "question__hide": false, - "total_acs": 3355, - "total_submitted": 8954, + "total_acs": 3398, + "total_submitted": 9046, "total_column_articles": 44, "frontend_question_id": "2781", "is_new_question": false @@ -8895,9 +9189,9 @@ "question__title": "Partition String Into Minimum Beautiful Substrings", "question__title_slug": "partition-string-into-minimum-beautiful-substrings", "question__hide": false, - "total_acs": 2671, - "total_submitted": 4774, - "total_column_articles": 32, + "total_acs": 2728, + "total_submitted": 4887, + "total_column_articles": 33, "frontend_question_id": "2767", "is_new_question": false }, @@ -8916,8 +9210,8 @@ "question__title": "Ways to Express an Integer as Sum of Powers", "question__title_slug": "ways-to-express-an-integer-as-sum-of-powers", "question__hide": false, - "total_acs": 2731, - "total_submitted": 6330, + "total_acs": 2795, + "total_submitted": 6450, "total_column_articles": 28, "frontend_question_id": "2787", "is_new_question": false @@ -8937,9 +9231,9 @@ "question__title": "Split Strings by Separator", "question__title_slug": "split-strings-by-separator", "question__hide": false, - "total_acs": 5918, - "total_submitted": 8272, - "total_column_articles": 52, + "total_acs": 6077, + "total_submitted": 8521, + "total_column_articles": 54, "frontend_question_id": "2788", "is_new_question": false }, @@ -8958,8 +9252,8 @@ "question__title": "Find the Closest Marked Node", "question__title_slug": "find-the-closest-marked-node", "question__hide": false, - "total_acs": 137, - "total_submitted": 284, + "total_acs": 144, + "total_submitted": 297, "total_column_articles": 5, "frontend_question_id": "2737", "is_new_question": false @@ -8979,9 +9273,9 @@ "question__title": "Apply Operations to Make All Array Elements Equal to Zero", "question__title_slug": "apply-operations-to-make-all-array-elements-equal-to-zero", "question__hide": false, - "total_acs": 4329, - "total_submitted": 12374, - "total_column_articles": 51, + "total_acs": 4388, + "total_submitted": 12492, + "total_column_articles": 53, "frontend_question_id": "2772", "is_new_question": false }, @@ -9000,8 +9294,8 @@ "question__title": "Shortest String That Contains Three Strings", "question__title_slug": "shortest-string-that-contains-three-strings", "question__hide": false, - "total_acs": 4109, - "total_submitted": 12040, + "total_acs": 4186, + "total_submitted": 12240, "total_column_articles": 57, "frontend_question_id": "2800", "is_new_question": false @@ -9021,8 +9315,8 @@ "question__title": "Number of Employees Who Met the Target", "question__title_slug": "number-of-employees-who-met-the-target", "question__hide": false, - "total_acs": 6529, - "total_submitted": 7326, + "total_acs": 7000, + "total_submitted": 7891, "total_column_articles": 32, "frontend_question_id": "2798", "is_new_question": false @@ -9042,9 +9336,9 @@ "question__title": "Count Houses in a Circular Street", "question__title_slug": "count-houses-in-a-circular-street", "question__hide": false, - "total_acs": 128, - "total_submitted": 144, - "total_column_articles": 7, + "total_acs": 137, + "total_submitted": 160, + "total_column_articles": 8, "frontend_question_id": "2728", "is_new_question": false }, @@ -9063,9 +9357,9 @@ "question__title": "Popularity Percentage", "question__title_slug": "popularity-percentage", "question__hide": false, - "total_acs": 122, - "total_submitted": 190, - "total_column_articles": 5, + "total_acs": 131, + "total_submitted": 227, + "total_column_articles": 6, "frontend_question_id": "2720", "is_new_question": false }, @@ -9084,9 +9378,9 @@ "question__title": "Prime Pairs With Target Sum", "question__title_slug": "prime-pairs-with-target-sum", "question__hide": false, - "total_acs": 5407, - "total_submitted": 15749, - "total_column_articles": 39, + "total_acs": 5475, + "total_submitted": 15966, + "total_column_articles": 40, "frontend_question_id": "2761", "is_new_question": false }, @@ -9105,9 +9399,9 @@ "question__title": "Largest Element in an Array after Merge Operations", "question__title_slug": "largest-element-in-an-array-after-merge-operations", "question__hide": false, - "total_acs": 5353, - "total_submitted": 11085, - "total_column_articles": 75, + "total_acs": 5489, + "total_submitted": 11303, + "total_column_articles": 76, "frontend_question_id": "2789", "is_new_question": false }, @@ -9120,15 +9414,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2871, + "question__title": "Double a Number Represented as a Linked List", + "question__title_slug": "double-a-number-represented-as-a-linked-list", + "question__hide": false, + "total_acs": 5649, + "total_submitted": 10196, + "total_column_articles": 63, + "frontend_question_id": "2816", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2870, "question__title": "Longest Alternating Subarray", "question__title_slug": "longest-alternating-subarray", "question__hide": false, - "total_acs": 3437, - "total_submitted": 8005, - "total_column_articles": 33, + "total_acs": 3520, + "total_submitted": 8207, + "total_column_articles": 34, "frontend_question_id": "2765", "is_new_question": false }, @@ -9147,9 +9462,9 @@ "question__title": "Longest Non-decreasing Subarray From Two Arrays", "question__title_slug": "longest-non-decreasing-subarray-from-two-arrays", "question__hide": false, - "total_acs": 4763, - "total_submitted": 14018, - "total_column_articles": 53, + "total_acs": 4836, + "total_submitted": 14197, + "total_column_articles": 54, "frontend_question_id": "2771", "is_new_question": false }, @@ -9168,8 +9483,8 @@ "question__title": "Continuous Subarrays", "question__title_slug": "continuous-subarrays", "question__hide": false, - "total_acs": 4180, - "total_submitted": 8828, + "total_acs": 4230, + "total_submitted": 8938, "total_column_articles": 56, "frontend_question_id": "2762", "is_new_question": false @@ -9189,8 +9504,8 @@ "question__title": "Ways to Split Array Into Good Subarrays", "question__title_slug": "ways-to-split-array-into-good-subarrays", "question__hide": false, - "total_acs": 3616, - "total_submitted": 9283, + "total_acs": 3662, + "total_submitted": 9415, "total_column_articles": 41, "frontend_question_id": "2750", "is_new_question": false @@ -9210,9 +9525,9 @@ "question__title": "Longest Even Odd Subarray With Threshold", "question__title_slug": "longest-even-odd-subarray-with-threshold", "question__hide": false, - "total_acs": 5734, - "total_submitted": 15361, - "total_column_articles": 54, + "total_acs": 5808, + "total_submitted": 15560, + "total_column_articles": 55, "frontend_question_id": "2760", "is_new_question": false }, @@ -9231,8 +9546,8 @@ "question__title": "Find Shortest Path with K Hops", "question__title_slug": "find-shortest-path-with-k-hops", "question__hide": false, - "total_acs": 98, - "total_submitted": 155, + "total_acs": 104, + "total_submitted": 165, "total_column_articles": 4, "frontend_question_id": "2714", "is_new_question": false @@ -9252,9 +9567,9 @@ "question__title": "Is Object Empty", "question__title_slug": "is-object-empty", "question__hide": false, - "total_acs": 2380, - "total_submitted": 3304, - "total_column_articles": 22, + "total_acs": 2623, + "total_submitted": 3633, + "total_column_articles": 23, "frontend_question_id": "2727", "is_new_question": false }, @@ -9273,8 +9588,8 @@ "question__title": "Calculator with Method Chaining", "question__title_slug": "calculator-with-method-chaining", "question__hide": false, - "total_acs": 1069, - "total_submitted": 1715, + "total_acs": 1187, + "total_submitted": 1885, "total_column_articles": 12, "frontend_question_id": "2726", "is_new_question": false @@ -9294,9 +9609,9 @@ "question__title": "Interval Cancellation", "question__title_slug": "interval-cancellation", "question__hide": false, - "total_acs": 1484, - "total_submitted": 2034, - "total_column_articles": 14, + "total_acs": 1589, + "total_submitted": 2166, + "total_column_articles": 15, "frontend_question_id": "2725", "is_new_question": false }, @@ -9315,8 +9630,8 @@ "question__title": "Create Object from Two Arrays", "question__title_slug": "create-object-from-two-arrays", "question__hide": false, - "total_acs": 52, - "total_submitted": 73, + "total_acs": 66, + "total_submitted": 91, "total_column_articles": 2, "frontend_question_id": "2794", "is_new_question": false @@ -9336,9 +9651,9 @@ "question__title": "Sort By", "question__title_slug": "sort-by", "question__hide": false, - "total_acs": 1551, - "total_submitted": 2012, - "total_column_articles": 10, + "total_acs": 1697, + "total_submitted": 2247, + "total_column_articles": 12, "frontend_question_id": "2724", "is_new_question": false }, @@ -9357,9 +9672,9 @@ "question__title": "Add Two Promises", "question__title_slug": "add-two-promises", "question__hide": false, - "total_acs": 2447, - "total_submitted": 2750, - "total_column_articles": 22, + "total_acs": 2649, + "total_submitted": 2978, + "total_column_articles": 23, "frontend_question_id": "2723", "is_new_question": false }, @@ -9378,9 +9693,9 @@ "question__title": "Join Two Arrays by ID", "question__title_slug": "join-two-arrays-by-id", "question__hide": false, - "total_acs": 1351, - "total_submitted": 2869, - "total_column_articles": 27, + "total_acs": 1502, + "total_submitted": 3179, + "total_column_articles": 29, "frontend_question_id": "2722", "is_new_question": false }, @@ -9399,9 +9714,9 @@ "question__title": "Total Distance Traveled", "question__title_slug": "total-distance-traveled", "question__hide": false, - "total_acs": 5828, - "total_submitted": 10996, - "total_column_articles": 49, + "total_acs": 5895, + "total_submitted": 11140, + "total_column_articles": 50, "frontend_question_id": "2739", "is_new_question": false }, @@ -9420,9 +9735,9 @@ "question__title": "Count Complete Subarrays in an Array", "question__title_slug": "count-complete-subarrays-in-an-array", "question__hide": false, - "total_acs": 6197, - "total_submitted": 10954, - "total_column_articles": 67, + "total_acs": 6326, + "total_submitted": 11147, + "total_column_articles": 68, "frontend_question_id": "2799", "is_new_question": false }, @@ -9441,9 +9756,9 @@ "question__title": "Maximum Number of Jumps to Reach the Last Index", "question__title_slug": "maximum-number-of-jumps-to-reach-the-last-index", "question__hide": false, - "total_acs": 6037, - "total_submitted": 17311, - "total_column_articles": 53, + "total_acs": 6112, + "total_submitted": 17462, + "total_column_articles": 54, "frontend_question_id": "2770", "is_new_question": false }, @@ -9462,8 +9777,8 @@ "question__title": "Decremental String Concatenation", "question__title_slug": "decremental-string-concatenation", "question__hide": false, - "total_acs": 2213, - "total_submitted": 5583, + "total_acs": 2249, + "total_submitted": 5650, "total_column_articles": 36, "frontend_question_id": "2746", "is_new_question": false @@ -9483,8 +9798,8 @@ "question__title": "Consecutive Transactions with Increasing Amounts", "question__title_slug": "consecutive-transactions-with-increasing-amounts", "question__hide": false, - "total_acs": 145, - "total_submitted": 601, + "total_acs": 170, + "total_submitted": 723, "total_column_articles": 9, "frontend_question_id": "2701", "is_new_question": false @@ -9504,9 +9819,9 @@ "question__title": "Customers with Maximum Number of Transactions on Consecutive Days", "question__title_slug": "customers-with-maximum-number-of-transactions-on-consecutive-days", "question__hide": false, - "total_acs": 95, - "total_submitted": 176, - "total_column_articles": 3, + "total_acs": 119, + "total_submitted": 290, + "total_column_articles": 5, "frontend_question_id": "2752", "is_new_question": false }, @@ -9525,8 +9840,8 @@ "question__title": "Convert JSON String to Object", "question__title_slug": "convert-json-string-to-object", "question__hide": false, - "total_acs": 42, - "total_submitted": 93, + "total_acs": 47, + "total_submitted": 98, "total_column_articles": 2, "frontend_question_id": "2759", "is_new_question": false @@ -9546,9 +9861,9 @@ "question__title": "Construct the Longest New String", "question__title_slug": "construct-the-longest-new-string", "question__hide": false, - "total_acs": 2945, - "total_submitted": 5137, - "total_column_articles": 37, + "total_acs": 2995, + "total_submitted": 5206, + "total_column_articles": 38, "frontend_question_id": "2745", "is_new_question": false }, @@ -9567,9 +9882,9 @@ "question__title": "Sum of Imbalance Numbers of All Subarrays", "question__title_slug": "sum-of-imbalance-numbers-of-all-subarrays", "question__hide": false, - "total_acs": 2503, - "total_submitted": 4003, - "total_column_articles": 20, + "total_acs": 2548, + "total_submitted": 4077, + "total_column_articles": 21, "frontend_question_id": "2763", "is_new_question": false }, @@ -9588,8 +9903,8 @@ "question__title": "Special Permutations", "question__title_slug": "special-permutations", "question__hide": false, - "total_acs": 4081, - "total_submitted": 11378, + "total_acs": 4110, + "total_submitted": 11440, "total_column_articles": 49, "frontend_question_id": "2741", "is_new_question": false @@ -9609,8 +9924,8 @@ "question__title": "Find Maximum Number of String Pairs", "question__title_slug": "find-maximum-number-of-string-pairs", "question__hide": false, - "total_acs": 3766, - "total_submitted": 4472, + "total_acs": 3913, + "total_submitted": 4677, "total_column_articles": 39, "frontend_question_id": "2744", "is_new_question": false @@ -9630,8 +9945,8 @@ "question__title": "Robot Collisions", "question__title_slug": "robot-collisions", "question__hide": false, - "total_acs": 2264, - "total_submitted": 4601, + "total_acs": 2299, + "total_submitted": 4657, "total_column_articles": 34, "frontend_question_id": "2751", "is_new_question": false @@ -9651,8 +9966,8 @@ "question__title": "Find the Value of the Partition", "question__title_slug": "find-the-value-of-the-partition", "question__hide": false, - "total_acs": 5468, - "total_submitted": 7380, + "total_acs": 5533, + "total_submitted": 7458, "total_column_articles": 42, "frontend_question_id": "2740", "is_new_question": false @@ -9672,9 +9987,9 @@ "question__title": "Sum of Squares of Special Elements ", "question__title_slug": "sum-of-squares-of-special-elements", "question__hide": false, - "total_acs": 6356, - "total_submitted": 7893, - "total_column_articles": 28, + "total_acs": 6488, + "total_submitted": 8127, + "total_column_articles": 31, "frontend_question_id": "2778", "is_new_question": false }, @@ -9693,8 +10008,8 @@ "question__title": "Extract Kth Character From The Rope Tree", "question__title_slug": "extract-kth-character-from-the-rope-tree", "question__hide": false, - "total_acs": 125, - "total_submitted": 164, + "total_acs": 132, + "total_submitted": 172, "total_column_articles": 5, "frontend_question_id": "2689", "is_new_question": false @@ -9714,9 +10029,9 @@ "question__title": "Find Active Users", "question__title_slug": "find-active-users", "question__hide": false, - "total_acs": 216, - "total_submitted": 481, - "total_column_articles": 9, + "total_acs": 255, + "total_submitted": 565, + "total_column_articles": 10, "frontend_question_id": "2688", "is_new_question": false }, @@ -9735,9 +10050,9 @@ "question__title": "Bikes Last Time Used ", "question__title_slug": "bikes-last-time-used", "question__hide": false, - "total_acs": 362, - "total_submitted": 410, - "total_column_articles": 3, + "total_acs": 387, + "total_submitted": 435, + "total_column_articles": 4, "frontend_question_id": "2687", "is_new_question": false }, @@ -9756,9 +10071,9 @@ "question__title": "Immediate Food Delivery III", "question__title_slug": "immediate-food-delivery-iii", "question__hide": false, - "total_acs": 222, - "total_submitted": 312, - "total_column_articles": 6, + "total_acs": 238, + "total_submitted": 346, + "total_column_articles": 7, "frontend_question_id": "2686", "is_new_question": false }, @@ -9777,8 +10092,8 @@ "question__title": "Maximum Sum Queries", "question__title_slug": "maximum-sum-queries", "question__hide": false, - "total_acs": 2300, - "total_submitted": 5767, + "total_acs": 2326, + "total_submitted": 5809, "total_column_articles": 50, "frontend_question_id": "2736", "is_new_question": false @@ -9798,9 +10113,9 @@ "question__title": "Sum of Matrix After Queries", "question__title_slug": "sum-of-matrix-after-queries", "question__hide": false, - "total_acs": 4991, - "total_submitted": 14838, - "total_column_articles": 90, + "total_acs": 5026, + "total_submitted": 14910, + "total_column_articles": 91, "frontend_question_id": "2718", "is_new_question": false }, @@ -9819,8 +10134,8 @@ "question__title": "Minimum Operations to Make the Integer Zero", "question__title_slug": "minimum-operations-to-make-the-integer-zero", "question__hide": false, - "total_acs": 3237, - "total_submitted": 9949, + "total_acs": 3281, + "total_submitted": 10042, "total_column_articles": 28, "frontend_question_id": "2749", "is_new_question": false @@ -9840,8 +10155,8 @@ "question__title": "Neither Minimum nor Maximum", "question__title_slug": "neither-minimum-nor-maximum", "question__hide": false, - "total_acs": 7021, - "total_submitted": 8869, + "total_acs": 7176, + "total_submitted": 9122, "total_column_articles": 46, "frontend_question_id": "2733", "is_new_question": false @@ -9861,8 +10176,8 @@ "question__title": "Split a Circular Linked List", "question__title_slug": "split-a-circular-linked-list", "question__hide": false, - "total_acs": 98, - "total_submitted": 115, + "total_acs": 104, + "total_submitted": 122, "total_column_articles": 6, "frontend_question_id": "2674", "is_new_question": false @@ -9882,8 +10197,8 @@ "question__title": "Relocate Marbles", "question__title_slug": "relocate-marbles", "question__hide": false, - "total_acs": 3115, - "total_submitted": 5698, + "total_acs": 3179, + "total_submitted": 5811, "total_column_articles": 17, "frontend_question_id": "2766", "is_new_question": false @@ -9903,8 +10218,8 @@ "question__title": "Count Zero Request Servers", "question__title_slug": "count-zero-request-servers", "question__hide": false, - "total_acs": 1686, - "total_submitted": 4353, + "total_acs": 1707, + "total_submitted": 4393, "total_column_articles": 29, "frontend_question_id": "2747", "is_new_question": false @@ -9918,15 +10233,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2832, + "question__title": "Find the Longest Equal Subarray", + "question__title_slug": "find-the-longest-equal-subarray", + "question__hide": false, + "total_acs": 1995, + "total_submitted": 6088, + "total_column_articles": 29, + "frontend_question_id": "6467", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2831, "question__title": "Number of Beautiful Pairs", "question__title_slug": "number-of-beautiful-pairs", "question__hide": false, - "total_acs": 4629, - "total_submitted": 8169, - "total_column_articles": 32, + "total_acs": 4695, + "total_submitted": 8273, + "total_column_articles": 33, "frontend_question_id": "2748", "is_new_question": false }, @@ -9945,9 +10281,9 @@ "question__title": "Count Artist Occurrences On Spotify Ranking List", "question__title_slug": "count-artist-occurrences-on-spotify-ranking-list", "question__hide": false, - "total_acs": 264, - "total_submitted": 359, - "total_column_articles": 2, + "total_acs": 281, + "total_submitted": 384, + "total_column_articles": 3, "frontend_question_id": "2669", "is_new_question": false }, @@ -9966,9 +10302,9 @@ "question__title": "Find Latest Salaries", "question__title_slug": "find-latest-salaries", "question__hide": false, - "total_acs": 282, - "total_submitted": 395, - "total_column_articles": 5, + "total_acs": 301, + "total_submitted": 422, + "total_column_articles": 6, "frontend_question_id": "2668", "is_new_question": false }, @@ -9987,8 +10323,8 @@ "question__title": "Lexicographically Smallest String After Substring Operation", "question__title_slug": "lexicographically-smallest-string-after-substring-operation", "question__hide": false, - "total_acs": 5342, - "total_submitted": 16092, + "total_acs": 5370, + "total_submitted": 16161, "total_column_articles": 43, "frontend_question_id": "2734", "is_new_question": false @@ -10008,9 +10344,9 @@ "question__title": "Greatest Common Divisor Traversal", "question__title_slug": "greatest-common-divisor-traversal", "question__hide": false, - "total_acs": 2579, - "total_submitted": 10605, - "total_column_articles": 35, + "total_acs": 2602, + "total_submitted": 10727, + "total_column_articles": 36, "frontend_question_id": "2709", "is_new_question": false }, @@ -10029,8 +10365,8 @@ "question__title": "Find a Good Subset of the Matrix", "question__title_slug": "find-a-good-subset-of-the-matrix", "question__hide": false, - "total_acs": 1566, - "total_submitted": 2743, + "total_acs": 1577, + "total_submitted": 2756, "total_column_articles": 16, "frontend_question_id": "2732", "is_new_question": false @@ -10050,9 +10386,9 @@ "question__title": "Minimize String Length", "question__title_slug": "minimize-string-length", "question__hide": false, - "total_acs": 6229, - "total_submitted": 8613, - "total_column_articles": 46, + "total_acs": 6283, + "total_submitted": 8684, + "total_column_articles": 47, "frontend_question_id": "2716", "is_new_question": false }, @@ -10071,9 +10407,9 @@ "question__title": "Check if The Number is Fascinating", "question__title_slug": "check-if-the-number-is-fascinating", "question__hide": false, - "total_acs": 4017, - "total_submitted": 6460, - "total_column_articles": 42, + "total_acs": 4091, + "total_submitted": 6618, + "total_column_articles": 43, "frontend_question_id": "2729", "is_new_question": false }, @@ -10092,8 +10428,8 @@ "question__title": "The Knight’s Tour", "question__title_slug": "the-knights-tour", "question__hide": false, - "total_acs": 94, - "total_submitted": 139, + "total_acs": 98, + "total_submitted": 147, "total_column_articles": 6, "frontend_question_id": "2664", "is_new_question": false @@ -10113,9 +10449,9 @@ "question__title": "Next Day", "question__title_slug": "next-day", "question__hide": false, - "total_acs": 76, - "total_submitted": 102, - "total_column_articles": 3, + "total_acs": 88, + "total_submitted": 114, + "total_column_articles": 4, "frontend_question_id": "2758", "is_new_question": false }, @@ -10134,8 +10470,8 @@ "question__title": "Execute Cancellable Function With Delay", "question__title_slug": "execute-cancellable-function-with-delay", "question__hide": false, - "total_acs": 1556, - "total_submitted": 2007, + "total_acs": 1674, + "total_submitted": 2143, "total_column_articles": 13, "frontend_question_id": "2715", "is_new_question": false @@ -10155,8 +10491,8 @@ "question__title": "Return Length of Arguments Passed", "question__title_slug": "return-length-of-arguments-passed", "question__hide": false, - "total_acs": 3533, - "total_submitted": 3763, + "total_acs": 3807, + "total_submitted": 4070, "total_column_articles": 18, "frontend_question_id": "2703", "is_new_question": false @@ -10176,9 +10512,9 @@ "question__title": "Remove Trailing Zeros From a String", "question__title_slug": "remove-trailing-zeros-from-a-string", "question__hide": false, - "total_acs": 7270, - "total_submitted": 8774, - "total_column_articles": 62, + "total_acs": 7389, + "total_submitted": 8931, + "total_column_articles": 63, "frontend_question_id": "2710", "is_new_question": false }, @@ -10197,8 +10533,8 @@ "question__title": "Maximum Strictly Increasing Cells in a Matrix", "question__title_slug": "maximum-strictly-increasing-cells-in-a-matrix", "question__hide": false, - "total_acs": 2673, - "total_submitted": 7447, + "total_acs": 2687, + "total_submitted": 7481, "total_column_articles": 31, "frontend_question_id": "2713", "is_new_question": false @@ -10218,8 +10554,8 @@ "question__title": "Minimum Cost to Make All Characters Equal", "question__title_slug": "minimum-cost-to-make-all-characters-equal", "question__hide": false, - "total_acs": 4327, - "total_submitted": 7721, + "total_acs": 4356, + "total_submitted": 7766, "total_column_articles": 59, "frontend_question_id": "2712", "is_new_question": false @@ -10239,9 +10575,9 @@ "question__title": "Lexicographically Smallest Palindrome", "question__title_slug": "lexicographically-smallest-palindrome", "question__hide": false, - "total_acs": 7080, - "total_submitted": 8595, - "total_column_articles": 71, + "total_acs": 7169, + "total_submitted": 8690, + "total_column_articles": 72, "frontend_question_id": "2697", "is_new_question": false }, @@ -10260,8 +10596,8 @@ "question__title": "Find Maximal Uncovered Ranges", "question__title_slug": "find-maximal-uncovered-ranges", "question__hide": false, - "total_acs": 94, - "total_submitted": 161, + "total_acs": 98, + "total_submitted": 166, "total_column_articles": 5, "frontend_question_id": "2655", "is_new_question": false @@ -10281,9 +10617,9 @@ "question__title": "Generate Circular Array Values", "question__title_slug": "generate-circular-array-values", "question__hide": false, - "total_acs": 58, - "total_submitted": 96, - "total_column_articles": 2, + "total_acs": 67, + "total_submitted": 105, + "total_column_articles": 3, "frontend_question_id": "2757", "is_new_question": false }, @@ -10302,8 +10638,8 @@ "question__title": "To Be Or Not To Be", "question__title_slug": "to-be-or-not-to-be", "question__hide": false, - "total_acs": 3873, - "total_submitted": 7732, + "total_acs": 4131, + "total_submitted": 8150, "total_column_articles": 27, "frontend_question_id": "2704", "is_new_question": false @@ -10323,9 +10659,9 @@ "question__title": "Find the Maximum Achievable Number", "question__title_slug": "find-the-maximum-achievable-number", "question__hide": false, - "total_acs": 8201, - "total_submitted": 8855, - "total_column_articles": 37, + "total_acs": 8707, + "total_submitted": 9425, + "total_column_articles": 40, "frontend_question_id": "2769", "is_new_question": false }, @@ -10338,15 +10674,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2811, + "question__title": "Determine the Minimum Sum of a k-avoiding Array", + "question__title_slug": "determine-the-minimum-sum-of-a-k-avoiding-array", + "question__hide": false, + "total_acs": 3946, + "total_submitted": 6997, + "total_column_articles": 23, + "frontend_question_id": "6450", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2810, "question__title": "Collecting Chocolates", "question__title_slug": "collecting-chocolates", "question__hide": false, - "total_acs": 4348, - "total_submitted": 9980, - "total_column_articles": 48, + "total_acs": 4374, + "total_submitted": 10040, + "total_column_articles": 49, "frontend_question_id": "2735", "is_new_question": false }, @@ -10365,9 +10722,9 @@ "question__title": "Create Hello World Function", "question__title_slug": "create-hello-world-function", "question__hide": false, - "total_acs": 9345, - "total_submitted": 11177, - "total_column_articles": 38, + "total_acs": 9674, + "total_submitted": 11560, + "total_column_articles": 39, "frontend_question_id": "2667", "is_new_question": false }, @@ -10386,8 +10743,8 @@ "question__title": "Painting the Walls", "question__title_slug": "painting-the-walls", "question__hide": false, - "total_acs": 2773, - "total_submitted": 7784, + "total_acs": 2799, + "total_submitted": 7843, "total_column_articles": 28, "frontend_question_id": "2742", "is_new_question": false @@ -10407,8 +10764,8 @@ "question__title": "Execute Asynchronous Functions in Parallel", "question__title_slug": "execute-asynchronous-functions-in-parallel", "question__hide": false, - "total_acs": 1161, - "total_submitted": 2029, + "total_acs": 1240, + "total_submitted": 2126, "total_column_articles": 15, "frontend_question_id": "2721", "is_new_question": false @@ -10428,8 +10785,8 @@ "question__title": "Query Batching", "question__title_slug": "query-batching", "question__hide": false, - "total_acs": 25, - "total_submitted": 122, + "total_acs": 28, + "total_submitted": 125, "total_column_articles": 2, "frontend_question_id": "2756", "is_new_question": false @@ -10449,8 +10806,8 @@ "question__title": "Array Wrapper", "question__title_slug": "array-wrapper", "question__hide": false, - "total_acs": 1520, - "total_submitted": 2068, + "total_acs": 1661, + "total_submitted": 2224, "total_column_articles": 18, "frontend_question_id": "2695", "is_new_question": false @@ -10470,9 +10827,9 @@ "question__title": "Compact Object", "question__title_slug": "compact-object", "question__hide": false, - "total_acs": 1240, - "total_submitted": 2098, - "total_column_articles": 22, + "total_acs": 1367, + "total_submitted": 2305, + "total_column_articles": 24, "frontend_question_id": "2705", "is_new_question": false }, @@ -10491,8 +10848,8 @@ "question__title": "Modify Graph Edge Weights", "question__title_slug": "modify-graph-edge-weights", "question__hide": false, - "total_acs": 9442, - "total_submitted": 17994, + "total_acs": 9454, + "total_submitted": 18035, "total_column_articles": 58, "frontend_question_id": "2699", "is_new_question": false @@ -10512,9 +10869,9 @@ "question__title": "Find the Punishment Number of an Integer", "question__title_slug": "find-the-punishment-number-of-an-integer", "question__hide": false, - "total_acs": 6112, - "total_submitted": 9038, - "total_column_articles": 83, + "total_acs": 6210, + "total_submitted": 9178, + "total_column_articles": 86, "frontend_question_id": "2698", "is_new_question": false }, @@ -10533,9 +10890,9 @@ "question__title": "Difference of Number of Distinct Values on Diagonals", "question__title_slug": "difference-of-number-of-distinct-values-on-diagonals", "question__hide": false, - "total_acs": 4860, - "total_submitted": 6765, - "total_column_articles": 57, + "total_acs": 4892, + "total_submitted": 6814, + "total_column_articles": 58, "frontend_question_id": "2711", "is_new_question": false }, @@ -10554,9 +10911,9 @@ "question__title": "Minimum String Length After Removing Substrings", "question__title_slug": "minimum-string-length-after-removing-substrings", "question__hide": false, - "total_acs": 7775, - "total_submitted": 10768, - "total_column_articles": 74, + "total_acs": 7904, + "total_submitted": 10923, + "total_column_articles": 75, "frontend_question_id": "2696", "is_new_question": false }, @@ -10575,8 +10932,8 @@ "question__title": "Date Range Generator", "question__title_slug": "date-range-generator", "question__hide": false, - "total_acs": 47, - "total_submitted": 73, + "total_acs": 54, + "total_submitted": 80, "total_column_articles": 2, "frontend_question_id": "2777", "is_new_question": false @@ -10596,9 +10953,9 @@ "question__title": "Chunk Array", "question__title_slug": "chunk-array", "question__hide": false, - "total_acs": 2639, - "total_submitted": 3673, - "total_column_articles": 59, + "total_acs": 2844, + "total_submitted": 3944, + "total_column_articles": 63, "frontend_question_id": "2677", "is_new_question": false }, @@ -10617,9 +10974,9 @@ "question__title": "Event Emitter", "question__title_slug": "event-emitter", "question__hide": false, - "total_acs": 915, - "total_submitted": 1493, - "total_column_articles": 16, + "total_acs": 1008, + "total_submitted": 1624, + "total_column_articles": 17, "frontend_question_id": "2694", "is_new_question": false }, @@ -10638,9 +10995,9 @@ "question__title": "Allow One Function Call", "question__title_slug": "allow-one-function-call", "question__hide": false, - "total_acs": 3910, - "total_submitted": 4876, - "total_column_articles": 47, + "total_acs": 4121, + "total_submitted": 5130, + "total_column_articles": 49, "frontend_question_id": "2666", "is_new_question": false }, @@ -10659,8 +11016,8 @@ "question__title": "Deep Merge of Two Objects", "question__title_slug": "deep-merge-of-two-objects", "question__hide": false, - "total_acs": 86, - "total_submitted": 126, + "total_acs": 91, + "total_submitted": 131, "total_column_articles": 3, "frontend_question_id": "2755", "is_new_question": false @@ -10680,8 +11037,8 @@ "question__title": "Maximum Number of Moves in a Grid", "question__title_slug": "maximum-number-of-moves-in-a-grid", "question__hide": false, - "total_acs": 6138, - "total_submitted": 14988, + "total_acs": 6240, + "total_submitted": 15218, "total_column_articles": 65, "frontend_question_id": "2684", "is_new_question": false @@ -10701,8 +11058,8 @@ "question__title": "Count the Number of Complete Components", "question__title_slug": "count-the-number-of-complete-components", "question__hide": false, - "total_acs": 4504, - "total_submitted": 6680, + "total_acs": 4622, + "total_submitted": 6824, "total_column_articles": 50, "frontend_question_id": "2685", "is_new_question": false @@ -10722,9 +11079,9 @@ "question__title": "Neighboring Bitwise XOR", "question__title_slug": "neighboring-bitwise-xor", "question__hide": false, - "total_acs": 5744, - "total_submitted": 8300, - "total_column_articles": 46, + "total_acs": 5911, + "total_submitted": 8529, + "total_column_articles": 50, "frontend_question_id": "2683", "is_new_question": false }, @@ -10743,9 +11100,9 @@ "question__title": "Find the Losers of the Circular Game", "question__title_slug": "find-the-losers-of-the-circular-game", "question__hide": false, - "total_acs": 6565, - "total_submitted": 12102, - "total_column_articles": 41, + "total_acs": 28671, + "total_submitted": 46472, + "total_column_articles": 208, "frontend_question_id": "2682", "is_new_question": false }, @@ -10764,8 +11121,8 @@ "question__title": "Call Function with Custom Context", "question__title_slug": "call-function-with-custom-context", "question__hide": false, - "total_acs": 963, - "total_submitted": 1373, + "total_acs": 1022, + "total_submitted": 1460, "total_column_articles": 21, "frontend_question_id": "2693", "is_new_question": false @@ -10785,9 +11142,9 @@ "question__title": "Counter II", "question__title_slug": "counter-ii", "question__hide": false, - "total_acs": 5956, - "total_submitted": 9672, - "total_column_articles": 53, + "total_acs": 6223, + "total_submitted": 10021, + "total_column_articles": 55, "frontend_question_id": "2665", "is_new_question": false }, @@ -10806,8 +11163,8 @@ "question__title": "Design Cancellable Function", "question__title_slug": "design-cancellable-function", "question__hide": false, - "total_acs": 475, - "total_submitted": 876, + "total_acs": 495, + "total_submitted": 900, "total_column_articles": 17, "frontend_question_id": "2650", "is_new_question": false @@ -10827,8 +11184,8 @@ "question__title": "Movement of Robots", "question__title_slug": "movement-of-robots", "question__hide": false, - "total_acs": 2458, - "total_submitted": 7177, + "total_acs": 2484, + "total_submitted": 7253, "total_column_articles": 29, "frontend_question_id": "2731", "is_new_question": false @@ -10848,9 +11205,9 @@ "question__title": "Find the Longest Semi-Repetitive Substring", "question__title_slug": "find-the-longest-semi-repetitive-substring", "question__hide": false, - "total_acs": 3652, - "total_submitted": 7920, - "total_column_articles": 33, + "total_acs": 3711, + "total_submitted": 8007, + "total_column_articles": 35, "frontend_question_id": "2730", "is_new_question": false }, @@ -10869,8 +11226,8 @@ "question__title": "Semi-Ordered Permutation", "question__title_slug": "semi-ordered-permutation", "question__hide": false, - "total_acs": 5978, - "total_submitted": 8192, + "total_acs": 6014, + "total_submitted": 8243, "total_column_articles": 43, "frontend_question_id": "2717", "is_new_question": false @@ -10890,9 +11247,9 @@ "question__title": "Power of Heroes", "question__title_slug": "power-of-heroes", "question__hide": false, - "total_acs": 17218, - "total_submitted": 40393, - "total_column_articles": 112, + "total_acs": 17571, + "total_submitted": 41531, + "total_column_articles": 114, "frontend_question_id": "2681", "is_new_question": false }, @@ -10911,9 +11268,9 @@ "question__title": "Nested Array Generator", "question__title_slug": "nested-array-generator", "question__hide": false, - "total_acs": 1235, - "total_submitted": 1607, - "total_column_articles": 30, + "total_acs": 1273, + "total_submitted": 1668, + "total_column_articles": 31, "frontend_question_id": "2649", "is_new_question": false }, @@ -10932,8 +11289,8 @@ "question__title": "Convert Callback Based Function to Promise Based Function", "question__title_slug": "convert-callback-based-function-to-promise-based-function", "question__hide": false, - "total_acs": 41, - "total_submitted": 46, + "total_acs": 49, + "total_submitted": 55, "total_column_articles": 4, "frontend_question_id": "2776", "is_new_question": false @@ -10953,8 +11310,8 @@ "question__title": "Undefined to Null", "question__title_slug": "undefined-to-null", "question__hide": false, - "total_acs": 57, - "total_submitted": 81, + "total_acs": 73, + "total_submitted": 99, "total_column_articles": 4, "frontend_question_id": "2775", "is_new_question": false @@ -10974,8 +11331,8 @@ "question__title": "Make Costs of Paths Equal in a Binary Tree", "question__title_slug": "make-costs-of-paths-equal-in-a-binary-tree", "question__hide": false, - "total_acs": 4274, - "total_submitted": 6493, + "total_acs": 4302, + "total_submitted": 6534, "total_column_articles": 67, "frontend_question_id": "2673", "is_new_question": false @@ -10995,8 +11352,8 @@ "question__title": "Number of Adjacent Elements With the Same Color", "question__title_slug": "number-of-adjacent-elements-with-the-same-color", "question__hide": false, - "total_acs": 4811, - "total_submitted": 8262, + "total_acs": 4848, + "total_submitted": 8331, "total_column_articles": 50, "frontend_question_id": "2672", "is_new_question": false @@ -11016,8 +11373,8 @@ "question__title": "Frequency Tracker", "question__title_slug": "frequency-tracker", "question__hide": false, - "total_acs": 5493, - "total_submitted": 16868, + "total_acs": 5515, + "total_submitted": 16927, "total_column_articles": 53, "frontend_question_id": "2671", "is_new_question": false @@ -11037,8 +11394,8 @@ "question__title": "Find the Distinct Difference Array", "question__title_slug": "find-the-distinct-difference-array", "question__hide": false, - "total_acs": 6722, - "total_submitted": 8842, + "total_acs": 6771, + "total_submitted": 8892, "total_column_articles": 54, "frontend_question_id": "2670", "is_new_question": false @@ -11058,8 +11415,8 @@ "question__title": "Make Object Immutable", "question__title_slug": "make-object-immutable", "question__hide": false, - "total_acs": 89, - "total_submitted": 163, + "total_acs": 93, + "total_submitted": 168, "total_column_articles": 5, "frontend_question_id": "2692", "is_new_question": false @@ -11079,9 +11436,9 @@ "question__title": "Generate Fibonacci Sequence", "question__title_slug": "generate-fibonacci-sequence", "question__hide": false, - "total_acs": 2175, - "total_submitted": 2674, - "total_column_articles": 37, + "total_acs": 2289, + "total_submitted": 2817, + "total_column_articles": 38, "frontend_question_id": "2648", "is_new_question": false }, @@ -11100,9 +11457,9 @@ "question__title": "Differences Between Two Objects", "question__title_slug": "differences-between-two-objects", "question__hide": false, - "total_acs": 512, - "total_submitted": 908, - "total_column_articles": 21, + "total_acs": 530, + "total_submitted": 931, + "total_column_articles": 23, "frontend_question_id": "2700", "is_new_question": false }, @@ -11121,8 +11478,8 @@ "question__title": "Immutability Helper", "question__title_slug": "immutability-helper", "question__hide": false, - "total_acs": 45, - "total_submitted": 216, + "total_acs": 46, + "total_submitted": 217, "total_column_articles": 2, "frontend_question_id": "2691", "is_new_question": false @@ -11142,8 +11499,8 @@ "question__title": "Infinite Method Object", "question__title_slug": "infinite-method-object", "question__hide": false, - "total_acs": 130, - "total_submitted": 142, + "total_acs": 139, + "total_submitted": 153, "total_column_articles": 3, "frontend_question_id": "2690", "is_new_question": false @@ -11163,8 +11520,8 @@ "question__title": "Throttle", "question__title_slug": "throttle", "question__hide": false, - "total_acs": 850, - "total_submitted": 1913, + "total_acs": 860, + "total_submitted": 1931, "total_column_articles": 26, "frontend_question_id": "2676", "is_new_question": false @@ -11184,8 +11541,8 @@ "question__title": "Bind Function to Context", "question__title_slug": "bind-function-to-context", "question__hide": false, - "total_acs": 63, - "total_submitted": 77, + "total_acs": 68, + "total_submitted": 82, "total_column_articles": 5, "frontend_question_id": "2754", "is_new_question": false @@ -11205,9 +11562,9 @@ "question__title": "Array of Objects to Matrix", "question__title_slug": "array-of-objects-to-matrix", "question__hide": false, - "total_acs": 658, - "total_submitted": 1145, - "total_column_articles": 22, + "total_acs": 669, + "total_submitted": 1162, + "total_column_articles": 24, "frontend_question_id": "2675", "is_new_question": false }, @@ -11226,8 +11583,8 @@ "question__title": "Array Upper Bound", "question__title_slug": "array-upper-bound", "question__hide": false, - "total_acs": 72, - "total_submitted": 88, + "total_acs": 88, + "total_submitted": 106, "total_column_articles": 5, "frontend_question_id": "2774", "is_new_question": false @@ -11247,9 +11604,9 @@ "question__title": "Maximum Sum With Exactly K Elements ", "question__title_slug": "maximum-sum-with-exactly-k-elements", "question__hide": false, - "total_acs": 5678, - "total_submitted": 6783, - "total_column_articles": 63, + "total_acs": 5807, + "total_submitted": 6961, + "total_column_articles": 65, "frontend_question_id": "2656", "is_new_question": false }, @@ -11268,8 +11625,8 @@ "question__title": "Find the Prefix Common Array of Two Arrays", "question__title_slug": "find-the-prefix-common-array-of-two-arrays", "question__hide": false, - "total_acs": 3792, - "total_submitted": 4591, + "total_acs": 3848, + "total_submitted": 4650, "total_column_articles": 37, "frontend_question_id": "2657", "is_new_question": false @@ -11289,8 +11646,8 @@ "question__title": "Make Array Empty", "question__title_slug": "make-array-empty", "question__hide": false, - "total_acs": 2199, - "total_submitted": 5612, + "total_acs": 2224, + "total_submitted": 5669, "total_column_articles": 28, "frontend_question_id": "2659", "is_new_question": false @@ -11310,8 +11667,8 @@ "question__title": "Maximum Number of Fish in a Grid", "question__title_slug": "maximum-number-of-fish-in-a-grid", "question__hide": false, - "total_acs": 3473, - "total_submitted": 5745, + "total_acs": 3519, + "total_submitted": 5840, "total_column_articles": 37, "frontend_question_id": "2658", "is_new_question": false @@ -11331,9 +11688,9 @@ "question__title": "Cache With Time Limit", "question__title_slug": "cache-with-time-limit", "question__hide": false, - "total_acs": 2957, - "total_submitted": 5346, - "total_column_articles": 70, + "total_acs": 3093, + "total_submitted": 5588, + "total_column_articles": 72, "frontend_question_id": "2622", "is_new_question": false }, @@ -11352,9 +11709,9 @@ "question__title": "Array Reduce Transformation", "question__title_slug": "array-reduce-transformation", "question__hide": false, - "total_acs": 6318, - "total_submitted": 8217, - "total_column_articles": 58, + "total_acs": 6638, + "total_submitted": 8634, + "total_column_articles": 61, "frontend_question_id": "2626", "is_new_question": false }, @@ -11373,9 +11730,9 @@ "question__title": "Snail Traversal", "question__title_slug": "snail-traversal", "question__hide": false, - "total_acs": 1923, - "total_submitted": 3132, - "total_column_articles": 61, + "total_acs": 2037, + "total_submitted": 3328, + "total_column_articles": 64, "frontend_question_id": "2624", "is_new_question": false }, @@ -11394,9 +11751,9 @@ "question__title": "Flatten Deeply Nested Array", "question__title_slug": "flatten-deeply-nested-array", "question__hide": false, - "total_acs": 3660, - "total_submitted": 7244, - "total_column_articles": 65, + "total_acs": 3852, + "total_submitted": 7587, + "total_column_articles": 67, "frontend_question_id": "2625", "is_new_question": false }, @@ -11415,8 +11772,8 @@ "question__title": "Check if Object Instance of Class", "question__title_slug": "check-if-object-instance-of-class", "question__hide": false, - "total_acs": 3757, - "total_submitted": 11096, + "total_acs": 3918, + "total_submitted": 11552, "total_column_articles": 54, "frontend_question_id": "2618", "is_new_question": false @@ -11436,8 +11793,8 @@ "question__title": "Count of Integers", "question__title_slug": "count-of-integers", "question__hide": false, - "total_acs": 3184, - "total_submitted": 6699, + "total_acs": 3203, + "total_submitted": 6746, "total_column_articles": 39, "frontend_question_id": "2719", "is_new_question": false @@ -11457,9 +11814,9 @@ "question__title": "Buy Two Chocolates", "question__title_slug": "buy-two-chocolates", "question__hide": false, - "total_acs": 4883, - "total_submitted": 6205, - "total_column_articles": 42, + "total_acs": 5031, + "total_submitted": 6404, + "total_column_articles": 47, "frontend_question_id": "2706", "is_new_question": false }, @@ -11478,9 +11835,9 @@ "question__title": "Extra Characters in a String", "question__title_slug": "extra-characters-in-a-string", "question__hide": false, - "total_acs": 3337, - "total_submitted": 7777, - "total_column_articles": 41, + "total_acs": 3398, + "total_submitted": 7902, + "total_column_articles": 42, "frontend_question_id": "2707", "is_new_question": false }, @@ -11499,9 +11856,9 @@ "question__title": "Maximum Strength of a Group", "question__title_slug": "maximum-strength-of-a-group", "question__hide": false, - "total_acs": 3997, - "total_submitted": 13174, - "total_column_articles": 59, + "total_acs": 4064, + "total_submitted": 13363, + "total_column_articles": 60, "frontend_question_id": "2708", "is_new_question": false }, @@ -11520,8 +11877,8 @@ "question__title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "question__title_slug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1", "question__hide": false, - "total_acs": 3519, - "total_submitted": 8727, + "total_acs": 3536, + "total_submitted": 8767, "total_column_articles": 28, "frontend_question_id": "2654", "is_new_question": false @@ -11541,8 +11898,8 @@ "question__title": "Sum Multiples", "question__title_slug": "sum-multiples", "question__hide": false, - "total_acs": 7742, - "total_submitted": 9451, + "total_acs": 7917, + "total_submitted": 9790, "total_column_articles": 48, "frontend_question_id": "2652", "is_new_question": false @@ -11562,8 +11919,8 @@ "question__title": "Sliding Subarray Beauty", "question__title_slug": "sliding-subarray-beauty", "question__hide": false, - "total_acs": 5017, - "total_submitted": 14216, + "total_acs": 5053, + "total_submitted": 14330, "total_column_articles": 65, "frontend_question_id": "2653", "is_new_question": false @@ -11583,8 +11940,8 @@ "question__title": "Promise Pool", "question__title_slug": "promise-pool", "question__hide": false, - "total_acs": 1130, - "total_submitted": 1817, + "total_acs": 1143, + "total_submitted": 1844, "total_column_articles": 28, "frontend_question_id": "2636", "is_new_question": false @@ -11604,15 +11961,15 @@ "question__title": "Promise Time Limit", "question__title_slug": "promise-time-limit", "question__hide": false, - "total_acs": 3005, - "total_submitted": 4855, + "total_acs": 3121, + "total_submitted": 5029, "total_column_articles": 33, "frontend_question_id": "2637", "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -11625,8 +11982,8 @@ "question__title": "Calculate Delayed Arrival Time", "question__title_slug": "calculate-delayed-arrival-time", "question__hide": false, - "total_acs": 9267, - "total_submitted": 10948, + "total_acs": 9468, + "total_submitted": 11264, "total_column_articles": 45, "frontend_question_id": "2651", "is_new_question": false @@ -11646,8 +12003,8 @@ "question__title": "Apply Transform Over Each Element in Array", "question__title_slug": "apply-transform-over-each-element-in-array", "question__hide": false, - "total_acs": 6418, - "total_submitted": 8657, + "total_acs": 6709, + "total_submitted": 8996, "total_column_articles": 48, "frontend_question_id": "2635", "is_new_question": false @@ -11667,9 +12024,9 @@ "question__title": "Filter Elements from Array", "question__title_slug": "filter-elements-from-array", "question__hide": false, - "total_acs": 5953, - "total_submitted": 8357, - "total_column_articles": 56, + "total_acs": 6260, + "total_submitted": 8764, + "total_column_articles": 57, "frontend_question_id": "2634", "is_new_question": false }, @@ -11688,9 +12045,9 @@ "question__title": "Convert Object to JSON String", "question__title_slug": "convert-object-to-json-string", "question__hide": false, - "total_acs": 1152, - "total_submitted": 2002, - "total_column_articles": 40, + "total_acs": 1175, + "total_submitted": 2033, + "total_column_articles": 44, "frontend_question_id": "2633", "is_new_question": false }, @@ -11709,8 +12066,8 @@ "question__title": "Memoize II", "question__title_slug": "memoize-ii", "question__hide": false, - "total_acs": 917, - "total_submitted": 2266, + "total_acs": 972, + "total_submitted": 2462, "total_column_articles": 17, "frontend_question_id": "2630", "is_new_question": false @@ -11730,9 +12087,9 @@ "question__title": "Debounce", "question__title_slug": "debounce", "question__hide": false, - "total_acs": 3243, - "total_submitted": 4173, - "total_column_articles": 32, + "total_acs": 3421, + "total_submitted": 4378, + "total_column_articles": 33, "frontend_question_id": "2627", "is_new_question": false }, @@ -11751,9 +12108,9 @@ "question__title": "Group By", "question__title_slug": "group-by", "question__hide": false, - "total_acs": 2401, - "total_submitted": 3047, - "total_column_articles": 39, + "total_acs": 2543, + "total_submitted": 3216, + "total_column_articles": 41, "frontend_question_id": "2631", "is_new_question": false }, @@ -11772,9 +12129,9 @@ "question__title": "Function Composition", "question__title_slug": "function-composition", "question__hide": false, - "total_acs": 5705, - "total_submitted": 6980, - "total_column_articles": 65, + "total_acs": 6037, + "total_submitted": 7412, + "total_column_articles": 66, "frontend_question_id": "2629", "is_new_question": false }, @@ -11793,8 +12150,8 @@ "question__title": "Curry", "question__title_slug": "curry", "question__hide": false, - "total_acs": 1662, - "total_submitted": 2045, + "total_acs": 1685, + "total_submitted": 2072, "total_column_articles": 35, "frontend_question_id": "2632", "is_new_question": false @@ -11814,8 +12171,8 @@ "question__title": "Minimize the Total Price of the Trips", "question__title_slug": "minimize-the-total-price-of-the-trips", "question__hide": false, - "total_acs": 3232, - "total_submitted": 6408, + "total_acs": 3256, + "total_submitted": 6448, "total_column_articles": 51, "frontend_question_id": "2646", "is_new_question": false @@ -11835,8 +12192,8 @@ "question__title": "Count the Number of K-Free Subsets", "question__title_slug": "count-the-number-of-k-free-subsets", "question__hide": false, - "total_acs": 89, - "total_submitted": 151, + "total_acs": 90, + "total_submitted": 153, "total_column_articles": 5, "frontend_question_id": "2638", "is_new_question": false @@ -11856,8 +12213,8 @@ "question__title": "Row With Maximum Ones", "question__title_slug": "row-with-maximum-ones", "question__hide": false, - "total_acs": 8213, - "total_submitted": 10266, + "total_acs": 8296, + "total_submitted": 10363, "total_column_articles": 44, "frontend_question_id": "2643", "is_new_question": false @@ -11877,9 +12234,9 @@ "question__title": "Minimum Additions to Make Valid String", "question__title_slug": "minimum-additions-to-make-valid-string", "question__hide": false, - "total_acs": 7019, - "total_submitted": 12463, - "total_column_articles": 103, + "total_acs": 7061, + "total_submitted": 12526, + "total_column_articles": 104, "frontend_question_id": "2645", "is_new_question": false }, @@ -11898,9 +12255,9 @@ "question__title": "JSON Deep Equal", "question__title_slug": "json-deep-equal", "question__hide": false, - "total_acs": 1419, - "total_submitted": 4366, - "total_column_articles": 42, + "total_acs": 1451, + "total_submitted": 4440, + "total_column_articles": 43, "frontend_question_id": "2628", "is_new_question": false }, @@ -11919,9 +12276,9 @@ "question__title": "Array Prototype Last", "question__title_slug": "array-prototype-last", "question__hide": false, - "total_acs": 10352, - "total_submitted": 14769, - "total_column_articles": 85, + "total_acs": 10940, + "total_submitted": 15621, + "total_column_articles": 88, "frontend_question_id": "2619", "is_new_question": false }, @@ -11940,9 +12297,9 @@ "question__title": "Sleep", "question__title_slug": "sleep", "question__hide": false, - "total_acs": 7828, - "total_submitted": 9339, - "total_column_articles": 47, + "total_acs": 8277, + "total_submitted": 9901, + "total_column_articles": 51, "frontend_question_id": "2621", "is_new_question": false }, @@ -11961,9 +12318,9 @@ "question__title": "Counter", "question__title_slug": "counter", "question__hide": false, - "total_acs": 15173, - "total_submitted": 18773, - "total_column_articles": 74, + "total_acs": 15837, + "total_submitted": 19606, + "total_column_articles": 78, "frontend_question_id": "2620", "is_new_question": false }, @@ -11982,8 +12339,8 @@ "question__title": "Memoize", "question__title_slug": "memoize", "question__hide": false, - "total_acs": 4011, - "total_submitted": 6622, + "total_acs": 4231, + "total_submitted": 6931, "total_column_articles": 44, "frontend_question_id": "2623", "is_new_question": false @@ -12003,8 +12360,8 @@ "question__title": "Maximum OR", "question__title_slug": "maximum-or", "question__hide": false, - "total_acs": 3005, - "total_submitted": 7045, + "total_acs": 3036, + "total_submitted": 7128, "total_column_articles": 34, "frontend_question_id": "2680", "is_new_question": false @@ -12024,9 +12381,9 @@ "question__title": "Minimum Operations to Make Numbers Non-positive", "question__title_slug": "minimum-operations-to-make-numbers-non-positive", "question__hide": false, - "total_acs": 90, - "total_submitted": 181, - "total_column_articles": 3, + "total_acs": 93, + "total_submitted": 184, + "total_column_articles": 4, "frontend_question_id": "2702", "is_new_question": false }, @@ -12045,9 +12402,9 @@ "question__title": "Sum in a Matrix", "question__title_slug": "sum-in-a-matrix", "question__hide": false, - "total_acs": 24434, - "total_submitted": 31168, - "total_column_articles": 200, + "total_acs": 24544, + "total_submitted": 31303, + "total_column_articles": 201, "frontend_question_id": "2679", "is_new_question": false }, @@ -12066,9 +12423,9 @@ "question__title": "Number of Senior Citizens", "question__title_slug": "number-of-senior-citizens", "question__hide": false, - "total_acs": 5227, - "total_submitted": 6374, - "total_column_articles": 46, + "total_acs": 5414, + "total_submitted": 6598, + "total_column_articles": 48, "frontend_question_id": "2678", "is_new_question": false }, @@ -12087,8 +12444,8 @@ "question__title": "Minimum Reverse Operations", "question__title_slug": "minimum-reverse-operations", "question__hide": false, - "total_acs": 2453, - "total_submitted": 11720, + "total_acs": 2464, + "total_submitted": 11754, "total_column_articles": 34, "frontend_question_id": "2612", "is_new_question": false @@ -12108,8 +12465,8 @@ "question__title": "Mice and Cheese", "question__title_slug": "mice-and-cheese", "question__hide": false, - "total_acs": 26825, - "total_submitted": 45733, + "total_acs": 26892, + "total_submitted": 45837, "total_column_articles": 293, "frontend_question_id": "2611", "is_new_question": false @@ -12129,9 +12486,9 @@ "question__title": "Convert an Array Into a 2D Array With Conditions", "question__title_slug": "convert-an-array-into-a-2d-array-with-conditions", "question__hide": false, - "total_acs": 8037, - "total_submitted": 9455, - "total_column_articles": 88, + "total_acs": 8124, + "total_submitted": 9549, + "total_column_articles": 89, "frontend_question_id": "2610", "is_new_question": false }, @@ -12150,9 +12507,9 @@ "question__title": "Find the Longest Balanced Substring of a Binary String", "question__title_slug": "find-the-longest-balanced-substring-of-a-binary-string", "question__hide": false, - "total_acs": 8257, - "total_submitted": 16794, - "total_column_articles": 103, + "total_acs": 8340, + "total_submitted": 16924, + "total_column_articles": 104, "frontend_question_id": "2609", "is_new_question": false }, @@ -12171,9 +12528,9 @@ "question__title": "Prime In Diagonal", "question__title_slug": "prime-in-diagonal", "question__hide": false, - "total_acs": 8107, - "total_submitted": 24408, - "total_column_articles": 52, + "total_acs": 8171, + "total_submitted": 24586, + "total_column_articles": 53, "frontend_question_id": "2614", "is_new_question": false }, @@ -12192,8 +12549,8 @@ "question__title": "Sum of Distances", "question__title_slug": "sum-of-distances", "question__hide": false, - "total_acs": 5631, - "total_submitted": 15798, + "total_acs": 5667, + "total_submitted": 15898, "total_column_articles": 66, "frontend_question_id": "2615", "is_new_question": false @@ -12213,9 +12570,9 @@ "question__title": "Minimize the Maximum Difference of Pairs", "question__title_slug": "minimize-the-maximum-difference-of-pairs", "question__hide": false, - "total_acs": 3946, - "total_submitted": 9973, - "total_column_articles": 35, + "total_acs": 3985, + "total_submitted": 10058, + "total_column_articles": 36, "frontend_question_id": "2616", "is_new_question": false }, @@ -12234,9 +12591,9 @@ "question__title": "Beautiful Pairs", "question__title_slug": "beautiful-pairs", "question__hide": false, - "total_acs": 73, - "total_submitted": 179, - "total_column_articles": 4, + "total_acs": 79, + "total_submitted": 192, + "total_column_articles": 5, "frontend_question_id": "2613", "is_new_question": false }, @@ -12255,8 +12612,8 @@ "question__title": "Minimum Operations to Make All Array Elements Equal", "question__title_slug": "minimum-operations-to-make-all-array-elements-equal", "question__hide": false, - "total_acs": 6860, - "total_submitted": 20395, + "total_acs": 6907, + "total_submitted": 20515, "total_column_articles": 100, "frontend_question_id": "2602", "is_new_question": false @@ -12276,9 +12633,9 @@ "question__title": "Collect Coins in a Tree", "question__title_slug": "collect-coins-in-a-tree", "question__hide": false, - "total_acs": 2540, - "total_submitted": 5863, - "total_column_articles": 43, + "total_acs": 2559, + "total_submitted": 5893, + "total_column_articles": 44, "frontend_question_id": "2603", "is_new_question": false }, @@ -12297,9 +12654,9 @@ "question__title": "Prime Subtraction Operation", "question__title_slug": "prime-subtraction-operation", "question__hide": false, - "total_acs": 7226, - "total_submitted": 18711, - "total_column_articles": 86, + "total_acs": 7277, + "total_submitted": 18819, + "total_column_articles": 85, "frontend_question_id": "2601", "is_new_question": false }, @@ -12318,9 +12675,9 @@ "question__title": "K Items With the Maximum Sum", "question__title_slug": "k-items-with-the-maximum-sum", "question__hide": false, - "total_acs": 32027, - "total_submitted": 47240, - "total_column_articles": 220, + "total_acs": 32102, + "total_submitted": 47355, + "total_column_articles": 221, "frontend_question_id": "2600", "is_new_question": false }, @@ -12339,8 +12696,8 @@ "question__title": "Left and Right Sum Differences", "question__title_slug": "left-and-right-sum-differences", "question__hide": false, - "total_acs": 11685, - "total_submitted": 13820, + "total_acs": 11782, + "total_submitted": 13933, "total_column_articles": 112, "frontend_question_id": "2574", "is_new_question": false @@ -12360,8 +12717,8 @@ "question__title": "Find the Divisibility Array of a String", "question__title_slug": "find-the-divisibility-array-of-a-string", "question__hide": false, - "total_acs": 8004, - "total_submitted": 24273, + "total_acs": 8038, + "total_submitted": 24352, "total_column_articles": 75, "frontend_question_id": "2575", "is_new_question": false @@ -12381,8 +12738,8 @@ "question__title": "Find the Maximum Number of Marked Indices", "question__title_slug": "find-the-maximum-number-of-marked-indices", "question__hide": false, - "total_acs": 6913, - "total_submitted": 18592, + "total_acs": 6953, + "total_submitted": 18696, "total_column_articles": 79, "frontend_question_id": "2576", "is_new_question": false @@ -12402,9 +12759,9 @@ "question__title": "Minimum Time to Visit a Cell In a Grid", "question__title_slug": "minimum-time-to-visit-a-cell-in-a-grid", "question__hide": false, - "total_acs": 3864, - "total_submitted": 9731, - "total_column_articles": 47, + "total_acs": 3910, + "total_submitted": 9850, + "total_column_articles": 48, "frontend_question_id": "2577", "is_new_question": false }, @@ -12423,9 +12780,9 @@ "question__title": "Minimum Operations to Reduce an Integer to 0", "question__title_slug": "minimum-operations-to-reduce-an-integer-to-0", "question__hide": false, - "total_acs": 7230, - "total_submitted": 13317, - "total_column_articles": 120, + "total_acs": 7268, + "total_submitted": 13381, + "total_column_articles": 121, "frontend_question_id": "2571", "is_new_question": false }, @@ -12444,9 +12801,9 @@ "question__title": "Count the Number of Square-Free Subsets", "question__title_slug": "count-the-number-of-square-free-subsets", "question__hide": false, - "total_acs": 3648, - "total_submitted": 12132, - "total_column_articles": 42, + "total_acs": 3667, + "total_submitted": 12195, + "total_column_articles": 44, "frontend_question_id": "2572", "is_new_question": false }, @@ -12465,8 +12822,8 @@ "question__title": "Find the String with LCP", "question__title_slug": "find-the-string-with-lcp", "question__hide": false, - "total_acs": 1806, - "total_submitted": 5076, + "total_acs": 1817, + "total_submitted": 5110, "total_column_articles": 32, "frontend_question_id": "2573", "is_new_question": false @@ -12486,8 +12843,8 @@ "question__title": "Merge Two 2D Arrays by Summing Values", "question__title_slug": "merge-two-2d-arrays-by-summing-values", "question__hide": false, - "total_acs": 8705, - "total_submitted": 12471, + "total_acs": 8749, + "total_submitted": 12543, "total_column_articles": 77, "frontend_question_id": "2570", "is_new_question": false @@ -12507,8 +12864,8 @@ "question__title": "Minimum Score by Changing Two Elements", "question__title_slug": "minimum-score-by-changing-two-elements", "question__hide": false, - "total_acs": 3976, - "total_submitted": 7616, + "total_acs": 4009, + "total_submitted": 7694, "total_column_articles": 36, "frontend_question_id": "2567", "is_new_question": false @@ -12528,9 +12885,9 @@ "question__title": "Minimum Impossible OR", "question__title_slug": "minimum-impossible-or", "question__hide": false, - "total_acs": 3681, - "total_submitted": 6092, - "total_column_articles": 31, + "total_acs": 3721, + "total_submitted": 6159, + "total_column_articles": 32, "frontend_question_id": "2568", "is_new_question": false }, @@ -12549,8 +12906,8 @@ "question__title": "Maximum Difference by Remapping a Digit", "question__title_slug": "maximum-difference-by-remapping-a-digit", "question__hide": false, - "total_acs": 5280, - "total_submitted": 8251, + "total_acs": 5342, + "total_submitted": 8350, "total_column_articles": 59, "frontend_question_id": "2566", "is_new_question": false @@ -12570,8 +12927,8 @@ "question__title": "Handling Sum Queries After Update", "question__title_slug": "handling-sum-queries-after-update", "question__hide": false, - "total_acs": 12448, - "total_submitted": 29020, + "total_acs": 12496, + "total_submitted": 29228, "total_column_articles": 105, "frontend_question_id": "2569", "is_new_question": false @@ -12591,8 +12948,8 @@ "question__title": "Maximum Number of Integers to Choose From a Range II", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-ii", "question__hide": false, - "total_acs": 188, - "total_submitted": 447, + "total_acs": 192, + "total_submitted": 457, "total_column_articles": 8, "frontend_question_id": "2557", "is_new_question": false @@ -12612,8 +12969,8 @@ "question__title": "Subsequence With the Minimum Score", "question__title_slug": "subsequence-with-the-minimum-score", "question__hide": false, - "total_acs": 2868, - "total_submitted": 7962, + "total_acs": 2878, + "total_submitted": 7997, "total_column_articles": 35, "frontend_question_id": "2565", "is_new_question": false @@ -12633,8 +12990,8 @@ "question__title": "Substring XOR Queries", "question__title_slug": "substring-xor-queries", "question__hide": false, - "total_acs": 4802, - "total_submitted": 13112, + "total_acs": 4832, + "total_submitted": 13208, "total_column_articles": 63, "frontend_question_id": "2564", "is_new_question": false @@ -12654,9 +13011,9 @@ "question__title": "Count the Number of Fair Pairs", "question__title_slug": "count-the-number-of-fair-pairs", "question__hide": false, - "total_acs": 7376, - "total_submitted": 21649, - "total_column_articles": 82, + "total_acs": 7459, + "total_submitted": 21896, + "total_column_articles": 83, "frontend_question_id": "2563", "is_new_question": false }, @@ -12675,8 +13032,8 @@ "question__title": "Find the Array Concatenation Value", "question__title_slug": "find-the-array-concatenation-value", "question__hide": false, - "total_acs": 8714, - "total_submitted": 11954, + "total_acs": 8769, + "total_submitted": 12023, "total_column_articles": 84, "frontend_question_id": "2562", "is_new_question": false @@ -12696,8 +13053,8 @@ "question__title": "Minimum Number of Visited Cells in a Grid", "question__title_slug": "minimum-number-of-visited-cells-in-a-grid", "question__hide": false, - "total_acs": 3449, - "total_submitted": 10594, + "total_acs": 3466, + "total_submitted": 10645, "total_column_articles": 63, "frontend_question_id": "2617", "is_new_question": false @@ -12717,8 +13074,8 @@ "question__title": "The Number of Beautiful Subsets", "question__title_slug": "the-number-of-beautiful-subsets", "question__hide": false, - "total_acs": 6948, - "total_submitted": 19942, + "total_acs": 6980, + "total_submitted": 20024, "total_column_articles": 57, "frontend_question_id": "2597", "is_new_question": false @@ -12738,8 +13095,8 @@ "question__title": "Find Score of an Array After Marking All Elements", "question__title_slug": "find-score-of-an-array-after-marking-all-elements", "question__hide": false, - "total_acs": 4245, - "total_submitted": 8200, + "total_acs": 4282, + "total_submitted": 8303, "total_column_articles": 51, "frontend_question_id": "2593", "is_new_question": false @@ -12759,9 +13116,9 @@ "question__title": "Find the Maximum Divisibility Score", "question__title_slug": "find-the-maximum-divisibility-score", "question__hide": false, - "total_acs": 7117, - "total_submitted": 14177, - "total_column_articles": 30, + "total_acs": 7156, + "total_submitted": 14251, + "total_column_articles": 31, "frontend_question_id": "2644", "is_new_question": false }, @@ -12780,8 +13137,8 @@ "question__title": "Maximum Price to Fill a Bag", "question__title_slug": "maximum-price-to-fill-a-bag", "question__hide": false, - "total_acs": 144, - "total_submitted": 281, + "total_acs": 147, + "total_submitted": 287, "total_column_articles": 4, "frontend_question_id": "2548", "is_new_question": false @@ -12801,8 +13158,8 @@ "question__title": "Take Gifts From the Richest Pile", "question__title_slug": "take-gifts-from-the-richest-pile", "question__hide": false, - "total_acs": 8087, - "total_submitted": 11923, + "total_acs": 8138, + "total_submitted": 12013, "total_column_articles": 75, "frontend_question_id": "2558", "is_new_question": false @@ -12822,8 +13179,8 @@ "question__title": "Count Vowel Strings in Ranges", "question__title_slug": "count-vowel-strings-in-ranges", "question__hide": false, - "total_acs": 23550, - "total_submitted": 36733, + "total_acs": 23678, + "total_submitted": 37095, "total_column_articles": 261, "frontend_question_id": "2559", "is_new_question": false @@ -12843,9 +13200,9 @@ "question__title": "House Robber IV", "question__title_slug": "house-robber-iv", "question__hide": false, - "total_acs": 6021, - "total_submitted": 11993, - "total_column_articles": 68, + "total_acs": 6160, + "total_submitted": 12251, + "total_column_articles": 70, "frontend_question_id": "2560", "is_new_question": false }, @@ -12864,8 +13221,8 @@ "question__title": "Rearranging Fruits", "question__title_slug": "rearranging-fruits", "question__hide": false, - "total_acs": 3069, - "total_submitted": 8361, + "total_acs": 3091, + "total_submitted": 8404, "total_column_articles": 36, "frontend_question_id": "2561", "is_new_question": false @@ -12885,8 +13242,8 @@ "question__title": "Design a Todo List", "question__title_slug": "design-a-todo-list", "question__hide": false, - "total_acs": 88, - "total_submitted": 158, + "total_acs": 89, + "total_submitted": 159, "total_column_articles": 4, "frontend_question_id": "2590", "is_new_question": false @@ -12906,8 +13263,8 @@ "question__title": "Lexicographically Smallest Beautiful String", "question__title_slug": "lexicographically-smallest-beautiful-string", "question__hide": false, - "total_acs": 1797, - "total_submitted": 3900, + "total_acs": 1816, + "total_submitted": 3936, "total_column_articles": 34, "frontend_question_id": "2663", "is_new_question": false @@ -12927,8 +13284,8 @@ "question__title": "Minimum Cost of a Path With Special Roads", "question__title_slug": "minimum-cost-of-a-path-with-special-roads", "question__hide": false, - "total_acs": 3410, - "total_submitted": 9265, + "total_acs": 3427, + "total_submitted": 9302, "total_column_articles": 56, "frontend_question_id": "2662", "is_new_question": false @@ -12948,8 +13305,8 @@ "question__title": "First Completely Painted Row or Column", "question__title_slug": "first-completely-painted-row-or-column", "question__hide": false, - "total_acs": 4761, - "total_submitted": 9229, + "total_acs": 4790, + "total_submitted": 9300, "total_column_articles": 49, "frontend_question_id": "2661", "is_new_question": false @@ -12969,9 +13326,9 @@ "question__title": "Determine the Winner of a Bowling Game", "question__title_slug": "determine-the-winner-of-a-bowling-game", "question__hide": false, - "total_acs": 5712, - "total_submitted": 16837, - "total_column_articles": 43, + "total_acs": 5769, + "total_submitted": 16964, + "total_column_articles": 44, "frontend_question_id": "2660", "is_new_question": false }, @@ -12990,8 +13347,8 @@ "question__title": "Count the Number of Good Subsequences", "question__title_slug": "count-the-number-of-good-subsequences", "question__hide": false, - "total_acs": 167, - "total_submitted": 269, + "total_acs": 168, + "total_submitted": 271, "total_column_articles": 5, "frontend_question_id": "2539", "is_new_question": false @@ -13011,9 +13368,9 @@ "question__title": "Count Increasing Quadruplets", "question__title_slug": "count-increasing-quadruplets", "question__hide": false, - "total_acs": 3448, - "total_submitted": 8263, - "total_column_articles": 39, + "total_acs": 3507, + "total_submitted": 8557, + "total_column_articles": 40, "frontend_question_id": "2552", "is_new_question": false }, @@ -13032,8 +13389,8 @@ "question__title": "Put Marbles in Bags", "question__title_slug": "put-marbles-in-bags", "question__hide": false, - "total_acs": 3742, - "total_submitted": 6671, + "total_acs": 3779, + "total_submitted": 6752, "total_column_articles": 40, "frontend_question_id": "2551", "is_new_question": false @@ -13053,8 +13410,8 @@ "question__title": "Count Collisions of Monkeys on a Polygon", "question__title_slug": "count-collisions-of-monkeys-on-a-polygon", "question__hide": false, - "total_acs": 5471, - "total_submitted": 18863, + "total_acs": 5504, + "total_submitted": 18962, "total_column_articles": 45, "frontend_question_id": "2550", "is_new_question": false @@ -13074,8 +13431,8 @@ "question__title": "Count Distinct Numbers on Board", "question__title_slug": "count-distinct-numbers-on-board", "question__hide": false, - "total_acs": 7315, - "total_submitted": 11652, + "total_acs": 7355, + "total_submitted": 11705, "total_column_articles": 48, "frontend_question_id": "2549", "is_new_question": false @@ -13095,9 +13452,9 @@ "question__title": "Design Graph With Shortest Path Calculator", "question__title_slug": "design-graph-with-shortest-path-calculator", "question__hide": false, - "total_acs": 3995, - "total_submitted": 7081, - "total_column_articles": 49, + "total_acs": 4058, + "total_submitted": 7184, + "total_column_articles": 50, "frontend_question_id": "2642", "is_new_question": false }, @@ -13116,8 +13473,8 @@ "question__title": "Cousins in Binary Tree II", "question__title_slug": "cousins-in-binary-tree-ii", "question__hide": false, - "total_acs": 3803, - "total_submitted": 5392, + "total_acs": 3842, + "total_submitted": 5446, "total_column_articles": 40, "frontend_question_id": "2641", "is_new_question": false @@ -13137,8 +13494,8 @@ "question__title": "Find the Score of All Prefixes of an Array", "question__title_slug": "find-the-score-of-all-prefixes-of-an-array", "question__hide": false, - "total_acs": 4531, - "total_submitted": 5714, + "total_acs": 4577, + "total_submitted": 5769, "total_column_articles": 33, "frontend_question_id": "2640", "is_new_question": false @@ -13158,8 +13515,8 @@ "question__title": "Find the Width of Columns of a Grid", "question__title_slug": "find-the-width-of-columns-of-a-grid", "question__hide": false, - "total_acs": 4671, - "total_submitted": 6133, + "total_acs": 4702, + "total_submitted": 6175, "total_column_articles": 37, "frontend_question_id": "2639", "is_new_question": false @@ -13179,8 +13536,8 @@ "question__title": "Make the Prefix Sum Non-negative", "question__title_slug": "make-the-prefix-sum-non-negative", "question__hide": false, - "total_acs": 120, - "total_submitted": 220, + "total_acs": 125, + "total_submitted": 233, "total_column_articles": 5, "frontend_question_id": "2599", "is_new_question": false @@ -13200,8 +13557,8 @@ "question__title": "Maximize Win From Two Segments", "question__title_slug": "maximize-win-from-two-segments", "question__hide": false, - "total_acs": 3129, - "total_submitted": 7785, + "total_acs": 3146, + "total_submitted": 7864, "total_column_articles": 32, "frontend_question_id": "2555", "is_new_question": false @@ -13221,8 +13578,8 @@ "question__title": "Number of Good Binary Strings", "question__title_slug": "number-of-good-binary-strings", "question__hide": false, - "total_acs": 138, - "total_submitted": 214, + "total_acs": 145, + "total_submitted": 222, "total_column_articles": 4, "frontend_question_id": "2533", "is_new_question": false @@ -13242,8 +13599,8 @@ "question__title": "Shortest Cycle in a Graph", "question__title_slug": "shortest-cycle-in-a-graph", "question__hide": false, - "total_acs": 3015, - "total_submitted": 7454, + "total_acs": 3051, + "total_submitted": 7580, "total_column_articles": 31, "frontend_question_id": "2608", "is_new_question": false @@ -13263,9 +13620,9 @@ "question__title": "Make K-Subarray Sums Equal", "question__title_slug": "make-k-subarray-sums-equal", "question__hide": false, - "total_acs": 2817, - "total_submitted": 7224, - "total_column_articles": 24, + "total_acs": 2841, + "total_submitted": 7276, + "total_column_articles": 23, "frontend_question_id": "2607", "is_new_question": false }, @@ -13284,8 +13641,8 @@ "question__title": "Find the Substring With Maximum Cost", "question__title_slug": "find-the-substring-with-maximum-cost", "question__hide": false, - "total_acs": 4936, - "total_submitted": 9019, + "total_acs": 5008, + "total_submitted": 9108, "total_column_articles": 41, "frontend_question_id": "2606", "is_new_question": false @@ -13305,8 +13662,8 @@ "question__title": "Form Smallest Number From Two Digit Arrays", "question__title_slug": "form-smallest-number-from-two-digit-arrays", "question__hide": false, - "total_acs": 5736, - "total_submitted": 9220, + "total_acs": 5806, + "total_submitted": 9325, "total_column_articles": 52, "frontend_question_id": "2605", "is_new_question": false @@ -13326,9 +13683,9 @@ "question__title": "Maximum Frequency Score of a Subarray", "question__title_slug": "maximum-frequency-score-of-a-subarray", "question__hide": false, - "total_acs": 163, - "total_submitted": 340, - "total_column_articles": 3, + "total_acs": 169, + "total_submitted": 359, + "total_column_articles": 5, "frontend_question_id": "2524", "is_new_question": false }, @@ -13347,9 +13704,9 @@ "question__title": "Minimum Time to Eat All Grains", "question__title_slug": "minimum-time-to-eat-all-grains", "question__hide": false, - "total_acs": 110, - "total_submitted": 323, - "total_column_articles": 4, + "total_acs": 112, + "total_submitted": 329, + "total_column_articles": 5, "frontend_question_id": "2604", "is_new_question": false }, @@ -13368,8 +13725,8 @@ "question__title": "Minimum Time to Repair Cars", "question__title_slug": "minimum-time-to-repair-cars", "question__hide": false, - "total_acs": 4073, - "total_submitted": 8974, + "total_acs": 4115, + "total_submitted": 9059, "total_column_articles": 33, "frontend_question_id": "2594", "is_new_question": false @@ -13389,9 +13746,9 @@ "question__title": "Maximize Greatness of an Array", "question__title_slug": "maximize-greatness-of-an-array", "question__hide": false, - "total_acs": 5038, - "total_submitted": 8741, - "total_column_articles": 57, + "total_acs": 5080, + "total_submitted": 8799, + "total_column_articles": 56, "frontend_question_id": "2592", "is_new_question": false }, @@ -13410,8 +13767,8 @@ "question__title": "Distribute Money to Maximum Children", "question__title_slug": "distribute-money-to-maximum-children", "question__hide": false, - "total_acs": 6295, - "total_submitted": 29941, + "total_acs": 6418, + "total_submitted": 30431, "total_column_articles": 63, "frontend_question_id": "2591", "is_new_question": false @@ -13431,8 +13788,8 @@ "question__title": "Check Knight Tour Configuration", "question__title_slug": "check-knight-tour-configuration", "question__hide": false, - "total_acs": 7773, - "total_submitted": 14891, + "total_acs": 7795, + "total_submitted": 14946, "total_column_articles": 101, "frontend_question_id": "2596", "is_new_question": false @@ -13452,8 +13809,8 @@ "question__title": "Smallest Missing Non-negative Integer After Operations", "question__title_slug": "smallest-missing-non-negative-integer-after-operations", "question__hide": false, - "total_acs": 5223, - "total_submitted": 13408, + "total_acs": 5257, + "total_submitted": 13475, "total_column_articles": 55, "frontend_question_id": "2598", "is_new_question": false @@ -13473,8 +13830,8 @@ "question__title": "Number of Even and Odd Bits", "question__title_slug": "number-of-even-and-odd-bits", "question__hide": false, - "total_acs": 9866, - "total_submitted": 13553, + "total_acs": 9931, + "total_submitted": 13634, "total_column_articles": 59, "frontend_question_id": "2595", "is_new_question": false @@ -13494,9 +13851,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": 197, - "total_submitted": 271, - "total_column_articles": 12, + "total_acs": 202, + "total_submitted": 283, + "total_column_articles": 13, "frontend_question_id": "2519", "is_new_question": false }, @@ -13515,8 +13872,8 @@ "question__title": "Minimum Time to Complete All Tasks", "question__title_slug": "minimum-time-to-complete-all-tasks", "question__hide": false, - "total_acs": 3939, - "total_submitted": 9203, + "total_acs": 3951, + "total_submitted": 9227, "total_column_articles": 36, "frontend_question_id": "2589", "is_new_question": false @@ -13536,8 +13893,8 @@ "question__title": "Count the Number of Beautiful Subarrays", "question__title_slug": "count-the-number-of-beautiful-subarrays", "question__hide": false, - "total_acs": 6207, - "total_submitted": 14710, + "total_acs": 6221, + "total_submitted": 14757, "total_column_articles": 59, "frontend_question_id": "2588", "is_new_question": false @@ -13557,8 +13914,8 @@ "question__title": "Rearrange Array to Maximize Prefix Score", "question__title_slug": "rearrange-array-to-maximize-prefix-score", "question__hide": false, - "total_acs": 8481, - "total_submitted": 20800, + "total_acs": 8513, + "total_submitted": 20855, "total_column_articles": 44, "frontend_question_id": "2587", "is_new_question": false @@ -13578,9 +13935,9 @@ "question__title": "Count the Number of Vowel Strings in Range", "question__title_slug": "count-the-number-of-vowel-strings-in-range", "question__hide": false, - "total_acs": 11358, - "total_submitted": 14150, - "total_column_articles": 66, + "total_acs": 11545, + "total_submitted": 14373, + "total_column_articles": 70, "frontend_question_id": "2586", "is_new_question": false }, @@ -13599,8 +13956,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": 267, - "total_submitted": 395, + "total_acs": 270, + "total_submitted": 399, "total_column_articles": 7, "frontend_question_id": "2510", "is_new_question": false @@ -13620,8 +13977,8 @@ "question__title": "Count Number of Possible Root Nodes", "question__title_slug": "count-number-of-possible-root-nodes", "question__hide": false, - "total_acs": 2552, - "total_submitted": 4402, + "total_acs": 2559, + "total_submitted": 4411, "total_column_articles": 30, "frontend_question_id": "2581", "is_new_question": false @@ -13641,8 +13998,8 @@ "question__title": "Count Ways to Group Overlapping Ranges", "question__title_slug": "count-ways-to-group-overlapping-ranges", "question__hide": false, - "total_acs": 4887, - "total_submitted": 13775, + "total_acs": 4911, + "total_submitted": 13824, "total_column_articles": 51, "frontend_question_id": "2580", "is_new_question": false @@ -13662,8 +14019,8 @@ "question__title": "Split With Minimum Sum", "question__title_slug": "split-with-minimum-sum", "question__hide": false, - "total_acs": 6414, - "total_submitted": 8434, + "total_acs": 6470, + "total_submitted": 8504, "total_column_articles": 76, "frontend_question_id": "2578", "is_new_question": false @@ -13683,8 +14040,8 @@ "question__title": "Count Total Number of Colored Cells", "question__title_slug": "count-total-number-of-colored-cells", "question__hide": false, - "total_acs": 5422, - "total_submitted": 8209, + "total_acs": 5463, + "total_submitted": 8273, "total_column_articles": 37, "frontend_question_id": "2579", "is_new_question": false @@ -13704,8 +14061,8 @@ "question__title": "Number of Ways to Earn Points", "question__title_slug": "number-of-ways-to-earn-points", "question__hide": false, - "total_acs": 5335, - "total_submitted": 8254, + "total_acs": 5366, + "total_submitted": 8302, "total_column_articles": 56, "frontend_question_id": "2585", "is_new_question": false @@ -13725,8 +14082,8 @@ "question__title": "Split the Array to Make Coprime Products", "question__title_slug": "split-the-array-to-make-coprime-products", "question__hide": false, - "total_acs": 5688, - "total_submitted": 22341, + "total_acs": 5706, + "total_submitted": 22410, "total_column_articles": 72, "frontend_question_id": "2584", "is_new_question": false @@ -13746,8 +14103,8 @@ "question__title": "Kth Largest Sum in a Binary Tree", "question__title_slug": "kth-largest-sum-in-a-binary-tree", "question__hide": false, - "total_acs": 8464, - "total_submitted": 19249, + "total_acs": 8482, + "total_submitted": 19281, "total_column_articles": 68, "frontend_question_id": "2583", "is_new_question": false @@ -13767,8 +14124,8 @@ "question__title": "Pass the Pillow", "question__title_slug": "pass-the-pillow", "question__hide": false, - "total_acs": 10181, - "total_submitted": 18253, + "total_acs": 10260, + "total_submitted": 18376, "total_column_articles": 94, "frontend_question_id": "2582", "is_new_question": false @@ -13788,8 +14145,8 @@ "question__title": "Bitwise OR of All Subsequence Sums", "question__title_slug": "bitwise-or-of-all-subsequence-sums", "question__hide": false, - "total_acs": 166, - "total_submitted": 278, + "total_acs": 168, + "total_submitted": 281, "total_column_articles": 5, "frontend_question_id": "2505", "is_new_question": false @@ -13809,9 +14166,9 @@ "question__title": "Concatenate the Name and the Profession", "question__title_slug": "concatenate-the-name-and-the-profession", "question__hide": false, - "total_acs": 723, - "total_submitted": 934, - "total_column_articles": 8, + "total_acs": 749, + "total_submitted": 962, + "total_column_articles": 9, "frontend_question_id": "2504", "is_new_question": false }, @@ -13830,8 +14187,8 @@ "question__title": "Time to Cross a Bridge", "question__title_slug": "time-to-cross-a-bridge", "question__hide": false, - "total_acs": 10252, - "total_submitted": 14895, + "total_acs": 10260, + "total_submitted": 14908, "total_column_articles": 99, "frontend_question_id": "2532", "is_new_question": false @@ -13851,8 +14208,8 @@ "question__title": "Disconnect Path in a Binary Matrix by at Most One Flip", "question__title_slug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "question__hide": false, - "total_acs": 3007, - "total_submitted": 9844, + "total_acs": 3027, + "total_submitted": 9924, "total_column_articles": 48, "frontend_question_id": "2556", "is_new_question": false @@ -13872,8 +14229,8 @@ "question__title": "Maximum Number of Integers to Choose From a Range I", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-i", "question__hide": false, - "total_acs": 4486, - "total_submitted": 7712, + "total_acs": 4527, + "total_submitted": 7802, "total_column_articles": 44, "frontend_question_id": "2554", "is_new_question": false @@ -13893,8 +14250,8 @@ "question__title": "Separate the Digits in an Array", "question__title_slug": "separate-the-digits-in-an-array", "question__hide": false, - "total_acs": 6409, - "total_submitted": 7770, + "total_acs": 6466, + "total_submitted": 7844, "total_column_articles": 67, "frontend_question_id": "2553", "is_new_question": false @@ -13914,8 +14271,8 @@ "question__title": "Number of Subarrays Having Even Product", "question__title_slug": "number-of-subarrays-having-even-product", "question__hide": false, - "total_acs": 235, - "total_submitted": 358, + "total_acs": 236, + "total_submitted": 359, "total_column_articles": 12, "frontend_question_id": "2495", "is_new_question": false @@ -13935,8 +14292,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": 392, - "total_submitted": 996, + "total_acs": 420, + "total_submitted": 1035, "total_column_articles": 7, "frontend_question_id": "2494", "is_new_question": false @@ -13956,9 +14313,9 @@ "question__title": "Maximum Subsequence Score", "question__title_slug": "maximum-subsequence-score", "question__hide": false, - "total_acs": 4236, - "total_submitted": 8176, - "total_column_articles": 45, + "total_acs": 4432, + "total_submitted": 8571, + "total_column_articles": 46, "frontend_question_id": "2542", "is_new_question": false }, @@ -13977,8 +14334,8 @@ "question__title": "Check if Point Is Reachable", "question__title_slug": "check-if-point-is-reachable", "question__hide": false, - "total_acs": 1928, - "total_submitted": 4120, + "total_acs": 1940, + "total_submitted": 4150, "total_column_articles": 18, "frontend_question_id": "2543", "is_new_question": false @@ -13998,8 +14355,8 @@ "question__title": "Minimum Common Value", "question__title_slug": "minimum-common-value", "question__hide": false, - "total_acs": 6195, - "total_submitted": 10326, + "total_acs": 6313, + "total_submitted": 10523, "total_column_articles": 72, "frontend_question_id": "2540", "is_new_question": false @@ -14019,9 +14376,9 @@ "question__title": "Minimum Cost to Split an Array", "question__title_slug": "minimum-cost-to-split-an-array", "question__hide": false, - "total_acs": 3422, - "total_submitted": 6053, - "total_column_articles": 38, + "total_acs": 3439, + "total_submitted": 6093, + "total_column_articles": 39, "frontend_question_id": "2547", "is_new_question": false }, @@ -14040,8 +14397,8 @@ "question__title": "Apply Bitwise Operations to Make Strings Equal", "question__title_slug": "apply-bitwise-operations-to-make-strings-equal", "question__hide": false, - "total_acs": 4297, - "total_submitted": 10078, + "total_acs": 4315, + "total_submitted": 10117, "total_column_articles": 50, "frontend_question_id": "2546", "is_new_question": false @@ -14061,8 +14418,8 @@ "question__title": "Sort the Students by Their Kth Score", "question__title_slug": "sort-the-students-by-their-kth-score", "question__hide": false, - "total_acs": 6852, - "total_submitted": 7942, + "total_acs": 6910, + "total_submitted": 8031, "total_column_articles": 73, "frontend_question_id": "2545", "is_new_question": false @@ -14082,9 +14439,9 @@ "question__title": "Alternating Digit Sum", "question__title_slug": "alternating-digit-sum", "question__hide": false, - "total_acs": 30785, - "total_submitted": 38457, - "total_column_articles": 287, + "total_acs": 30945, + "total_submitted": 38688, + "total_column_articles": 289, "frontend_question_id": "2544", "is_new_question": false }, @@ -14103,8 +14460,8 @@ "question__title": "Number of Substrings With Fixed Ratio", "question__title_slug": "number-of-substrings-with-fixed-ratio", "question__hide": false, - "total_acs": 133, - "total_submitted": 196, + "total_acs": 134, + "total_submitted": 197, "total_column_articles": 3, "frontend_question_id": "2489", "is_new_question": false @@ -14124,8 +14481,8 @@ "question__title": "Minimize the Maximum of Two Arrays", "question__title_slug": "minimize-the-maximum-of-two-arrays", "question__hide": false, - "total_acs": 2644, - "total_submitted": 7600, + "total_acs": 2665, + "total_submitted": 7644, "total_column_articles": 36, "frontend_question_id": "2513", "is_new_question": false @@ -14145,8 +14502,8 @@ "question__title": "Difference Between Maximum and Minimum Price Sum", "question__title_slug": "difference-between-maximum-and-minimum-price-sum", "question__hide": false, - "total_acs": 3311, - "total_submitted": 6849, + "total_acs": 3334, + "total_submitted": 6913, "total_column_articles": 44, "frontend_question_id": "2538", "is_new_question": false @@ -14166,8 +14523,8 @@ "question__title": "Count the Number of Good Subarrays", "question__title_slug": "count-the-number-of-good-subarrays", "question__hide": false, - "total_acs": 5414, - "total_submitted": 11030, + "total_acs": 5501, + "total_submitted": 11224, "total_column_articles": 84, "frontend_question_id": "2537", "is_new_question": false @@ -14187,9 +14544,9 @@ "question__title": "Increment Submatrices by One", "question__title_slug": "increment-submatrices-by-one", "question__hide": false, - "total_acs": 7040, - "total_submitted": 11560, - "total_column_articles": 79, + "total_acs": 7073, + "total_submitted": 11656, + "total_column_articles": 78, "frontend_question_id": "2536", "is_new_question": false }, @@ -14208,9 +14565,9 @@ "question__title": "Difference Between Element Sum and Digit Sum of an Array", "question__title_slug": "difference-between-element-sum-and-digit-sum-of-an-array", "question__hide": false, - "total_acs": 11055, - "total_submitted": 13178, - "total_column_articles": 117, + "total_acs": 11187, + "total_submitted": 13337, + "total_column_articles": 118, "frontend_question_id": "2535", "is_new_question": false }, @@ -14229,9 +14586,9 @@ "question__title": "Maximum XOR of Two Non-Overlapping Subtrees", "question__title_slug": "maximum-xor-of-two-non-overlapping-subtrees", "question__hide": false, - "total_acs": 207, - "total_submitted": 303, - "total_column_articles": 8, + "total_acs": 208, + "total_submitted": 305, + "total_column_articles": 9, "frontend_question_id": "2479", "is_new_question": false }, @@ -14250,9 +14607,9 @@ "question__title": "Form a Chemical Bond", "question__title_slug": "form-a-chemical-bond", "question__hide": false, - "total_acs": 783, - "total_submitted": 915, - "total_column_articles": 5, + "total_acs": 801, + "total_submitted": 935, + "total_column_articles": 6, "frontend_question_id": "2480", "is_new_question": false }, @@ -14271,8 +14628,8 @@ "question__title": "Find Xor-Beauty of Array", "question__title_slug": "find-xor-beauty-of-array", "question__hide": false, - "total_acs": 3609, - "total_submitted": 5101, + "total_acs": 3633, + "total_submitted": 5175, "total_column_articles": 40, "frontend_question_id": "2527", "is_new_question": false @@ -14292,8 +14649,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": 4615, - "total_submitted": 8509, + "total_acs": 4650, + "total_submitted": 8564, "total_column_articles": 45, "frontend_question_id": "2526", "is_new_question": false @@ -14313,8 +14670,8 @@ "question__title": "Categorize Box According to Criteria", "question__title_slug": "categorize-box-according-to-criteria", "question__hide": false, - "total_acs": 4829, - "total_submitted": 10205, + "total_acs": 4858, + "total_submitted": 10278, "total_column_articles": 40, "frontend_question_id": "2525", "is_new_question": false @@ -14334,8 +14691,8 @@ "question__title": "Maximize the Minimum Powered City", "question__title_slug": "maximize-the-minimum-powered-city", "question__hide": false, - "total_acs": 3509, - "total_submitted": 8575, + "total_acs": 3539, + "total_submitted": 8621, "total_column_articles": 38, "frontend_question_id": "2528", "is_new_question": false @@ -14355,9 +14712,9 @@ "question__title": "Time Taken to Cross the Door", "question__title_slug": "time-taken-to-cross-the-door", "question__hide": false, - "total_acs": 153, - "total_submitted": 248, - "total_column_articles": 8, + "total_acs": 217, + "total_submitted": 333, + "total_column_articles": 9, "frontend_question_id": "2534", "is_new_question": false }, @@ -14376,8 +14733,8 @@ "question__title": "Maximal Score After Applying K Operations", "question__title_slug": "maximal-score-after-applying-k-operations", "question__hide": false, - "total_acs": 6647, - "total_submitted": 14720, + "total_acs": 6674, + "total_submitted": 14762, "total_column_articles": 71, "frontend_question_id": "2530", "is_new_question": false @@ -14397,8 +14754,8 @@ "question__title": "Make Number of Distinct Characters Equal", "question__title_slug": "make-number-of-distinct-characters-equal", "question__hide": false, - "total_acs": 5687, - "total_submitted": 19130, + "total_acs": 5714, + "total_submitted": 19197, "total_column_articles": 88, "frontend_question_id": "2531", "is_new_question": false @@ -14418,9 +14775,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": 9635, - "total_submitted": 12685, - "total_column_articles": 80, + "total_acs": 9763, + "total_submitted": 12886, + "total_column_articles": 82, "frontend_question_id": "2529", "is_new_question": false }, @@ -14439,9 +14796,9 @@ "question__title": "Customers With Strictly Increasing Purchases", "question__title_slug": "customers-with-strictly-increasing-purchases", "question__hide": false, - "total_acs": 522, - "total_submitted": 1028, - "total_column_articles": 14, + "total_acs": 550, + "total_submitted": 1158, + "total_column_articles": 16, "frontend_question_id": "2474", "is_new_question": false }, @@ -14460,8 +14817,8 @@ "question__title": "Minimum Cost to Buy Apples", "question__title_slug": "minimum-cost-to-buy-apples", "question__hide": false, - "total_acs": 160, - "total_submitted": 272, + "total_acs": 162, + "total_submitted": 275, "total_column_articles": 9, "frontend_question_id": "2473", "is_new_question": false @@ -14481,8 +14838,8 @@ "question__title": "Closest Prime Numbers in Range", "question__title_slug": "closest-prime-numbers-in-range", "question__hide": false, - "total_acs": 6767, - "total_submitted": 16321, + "total_acs": 6807, + "total_submitted": 16428, "total_column_articles": 64, "frontend_question_id": "2523", "is_new_question": false @@ -14502,8 +14859,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": 6885, - "total_submitted": 10950, + "total_acs": 6932, + "total_submitted": 11045, "total_column_articles": 63, "frontend_question_id": "2521", "is_new_question": false @@ -14523,9 +14880,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": 9397, - "total_submitted": 11374, - "total_column_articles": 87, + "total_acs": 9570, + "total_submitted": 11632, + "total_column_articles": 88, "frontend_question_id": "2520", "is_new_question": false }, @@ -14544,8 +14901,8 @@ "question__title": "Minimum Subarrays in a Valid Split", "question__title_slug": "minimum-subarrays-in-a-valid-split", "question__hide": false, - "total_acs": 176, - "total_submitted": 274, + "total_acs": 183, + "total_submitted": 286, "total_column_articles": 8, "frontend_question_id": "2464", "is_new_question": false @@ -14565,8 +14922,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": 5412, - "total_submitted": 6629, + "total_acs": 5436, + "total_submitted": 6657, "total_column_articles": 64, "frontend_question_id": "2482", "is_new_question": false @@ -14586,9 +14943,9 @@ "question__title": "Count Anagrams", "question__title_slug": "count-anagrams", "question__hide": false, - "total_acs": 2394, - "total_submitted": 5170, - "total_column_articles": 38, + "total_acs": 2410, + "total_submitted": 5202, + "total_column_articles": 39, "frontend_question_id": "2514", "is_new_question": false }, @@ -14607,8 +14964,8 @@ "question__title": "Minimum Operations to Make Array Equal II", "question__title_slug": "minimum-operations-to-make-array-equal-ii", "question__hide": false, - "total_acs": 3382, - "total_submitted": 10721, + "total_acs": 3410, + "total_submitted": 10835, "total_column_articles": 34, "frontend_question_id": "2541", "is_new_question": false @@ -14628,8 +14985,8 @@ "question__title": "Reward Top K Students", "question__title_slug": "reward-top-k-students", "question__hide": false, - "total_acs": 3733, - "total_submitted": 8035, + "total_acs": 3757, + "total_submitted": 8126, "total_column_articles": 53, "frontend_question_id": "2512", "is_new_question": false @@ -14649,8 +15006,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": 4380, - "total_submitted": 8958, + "total_acs": 4447, + "total_submitted": 9075, "total_column_articles": 71, "frontend_question_id": "2511", "is_new_question": false @@ -14670,8 +15027,8 @@ "question__title": "Number of Great Partitions", "question__title_slug": "number-of-great-partitions", "question__hide": false, - "total_acs": 2782, - "total_submitted": 6520, + "total_acs": 2789, + "total_submitted": 6535, "total_column_articles": 31, "frontend_question_id": "2518", "is_new_question": false @@ -14691,8 +15048,8 @@ "question__title": "Maximum Tastiness of Candy Basket", "question__title_slug": "maximum-tastiness-of-candy-basket", "question__hide": false, - "total_acs": 20168, - "total_submitted": 28075, + "total_acs": 20229, + "total_submitted": 28207, "total_column_articles": 135, "frontend_question_id": "2517", "is_new_question": false @@ -14712,8 +15069,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": 5593, - "total_submitted": 14886, + "total_acs": 5638, + "total_submitted": 14995, "total_column_articles": 81, "frontend_question_id": "2516", "is_new_question": false @@ -14733,8 +15090,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": 6892, - "total_submitted": 12431, + "total_acs": 6930, + "total_submitted": 12514, "total_column_articles": 76, "frontend_question_id": "2515", "is_new_question": false @@ -14754,8 +15111,8 @@ "question__title": "Cycle Length Queries in a Tree", "question__title_slug": "cycle-length-queries-in-a-tree", "question__hide": false, - "total_acs": 4131, - "total_submitted": 6355, + "total_acs": 4152, + "total_submitted": 6387, "total_column_articles": 62, "frontend_question_id": "2509", "is_new_question": false @@ -14775,8 +15132,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": 3475, - "total_submitted": 11746, + "total_acs": 3486, + "total_submitted": 11769, "total_column_articles": 54, "frontend_question_id": "2508", "is_new_question": false @@ -14796,8 +15153,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": 6023, - "total_submitted": 12027, + "total_acs": 6054, + "total_submitted": 12081, "total_column_articles": 61, "frontend_question_id": "2507", "is_new_question": false @@ -14817,9 +15174,9 @@ "question__title": "Count Pairs Of Similar Strings", "question__title_slug": "count-pairs-of-similar-strings", "question__hide": false, - "total_acs": 7985, - "total_submitted": 10184, - "total_column_articles": 91, + "total_acs": 8044, + "total_submitted": 10257, + "total_column_articles": 90, "frontend_question_id": "2506", "is_new_question": false }, @@ -14859,9 +15216,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": 1713, - "total_submitted": 4074, - "total_column_articles": 28, + "total_acs": 1722, + "total_submitted": 4090, + "total_column_articles": 29, "frontend_question_id": "2499", "is_new_question": false }, @@ -14880,8 +15237,8 @@ "question__title": "Frog Jump II", "question__title_slug": "frog-jump-ii", "question__hide": false, - "total_acs": 3799, - "total_submitted": 5875, + "total_acs": 3832, + "total_submitted": 5927, "total_column_articles": 50, "frontend_question_id": "2498", "is_new_question": false @@ -14901,9 +15258,9 @@ "question__title": "Maximum Star Sum of a Graph", "question__title_slug": "maximum-star-sum-of-a-graph", "question__hide": false, - "total_acs": 4009, - "total_submitted": 10426, - "total_column_articles": 51, + "total_acs": 4032, + "total_submitted": 10464, + "total_column_articles": 52, "frontend_question_id": "2497", "is_new_question": false }, @@ -14922,8 +15279,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": 19098, - "total_submitted": 24123, + "total_acs": 19167, + "total_submitted": 24214, "total_column_articles": 201, "frontend_question_id": "2496", "is_new_question": false @@ -14943,8 +15300,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": 4279, - "total_submitted": 9684, + "total_acs": 4286, + "total_submitted": 9698, "total_column_articles": 67, "frontend_question_id": "2503", "is_new_question": false @@ -14964,8 +15321,8 @@ "question__title": "Design Memory Allocator", "question__title_slug": "design-memory-allocator", "question__hide": false, - "total_acs": 5391, - "total_submitted": 10314, + "total_acs": 5412, + "total_submitted": 10366, "total_column_articles": 74, "frontend_question_id": "2502", "is_new_question": false @@ -14985,8 +15342,8 @@ "question__title": "Longest Square Streak in an Array", "question__title_slug": "longest-square-streak-in-an-array", "question__hide": false, - "total_acs": 7730, - "total_submitted": 18686, + "total_acs": 7764, + "total_submitted": 18751, "total_column_articles": 87, "frontend_question_id": "2501", "is_new_question": false @@ -15006,9 +15363,9 @@ "question__title": "Delete Greatest Value in Each Row", "question__title_slug": "delete-greatest-value-in-each-row", "question__hide": false, - "total_acs": 29835, - "total_submitted": 35088, - "total_column_articles": 235, + "total_acs": 30118, + "total_submitted": 35509, + "total_column_articles": 238, "frontend_question_id": "2500", "is_new_question": false }, @@ -15027,9 +15384,9 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 264, - "total_submitted": 339, - "total_column_articles": 15, + "total_acs": 270, + "total_submitted": 347, + "total_column_articles": 16, "frontend_question_id": "2445", "is_new_question": false }, @@ -15048,8 +15405,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": 3021, - "total_submitted": 6880, + "total_acs": 3025, + "total_submitted": 6887, "total_column_articles": 44, "frontend_question_id": "2493", "is_new_question": false @@ -15069,8 +15426,8 @@ "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": 7206, - "total_submitted": 17378, + "total_acs": 7234, + "total_submitted": 17445, "total_column_articles": 121, "frontend_question_id": "2492", "is_new_question": false @@ -15090,9 +15447,9 @@ "question__title": "Divide Players Into Teams of Equal Skill", "question__title_slug": "divide-players-into-teams-of-equal-skill", "question__hide": false, - "total_acs": 8721, - "total_submitted": 15746, - "total_column_articles": 112, + "total_acs": 8745, + "total_submitted": 15806, + "total_column_articles": 111, "frontend_question_id": "2491", "is_new_question": false }, @@ -15111,8 +15468,8 @@ "question__title": "Circular Sentence", "question__title_slug": "circular-sentence", "question__hide": false, - "total_acs": 26098, - "total_submitted": 35478, + "total_acs": 26145, + "total_submitted": 35540, "total_column_articles": 234, "frontend_question_id": "2490", "is_new_question": false @@ -15132,9 +15489,9 @@ "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": 217, - "total_submitted": 285, - "total_column_articles": 11, + "total_acs": 224, + "total_submitted": 293, + "total_column_articles": 12, "frontend_question_id": "2436", "is_new_question": false }, @@ -15153,8 +15510,8 @@ "question__title": "Count Palindromic Subsequences", "question__title_slug": "count-palindromic-subsequences", "question__hide": false, - "total_acs": 2803, - "total_submitted": 5921, + "total_acs": 2815, + "total_submitted": 5955, "total_column_articles": 49, "frontend_question_id": "2484", "is_new_question": false @@ -15174,8 +15531,8 @@ "question__title": "Minimum Penalty for a Shop", "question__title_slug": "minimum-penalty-for-a-shop", "question__hide": false, - "total_acs": 5808, - "total_submitted": 9170, + "total_acs": 5843, + "total_submitted": 9216, "total_column_articles": 79, "frontend_question_id": "2483", "is_new_question": false @@ -15195,8 +15552,8 @@ "question__title": "Minimum Cuts to Divide a Circle", "question__title_slug": "minimum-cuts-to-divide-a-circle", "question__hide": false, - "total_acs": 18310, - "total_submitted": 31256, + "total_acs": 18352, + "total_submitted": 31318, "total_column_articles": 135, "frontend_question_id": "2481", "is_new_question": false @@ -15216,8 +15573,8 @@ "question__title": "Count Subarrays With Median K", "question__title_slug": "count-subarrays-with-median-k", "question__hide": false, - "total_acs": 20377, - "total_submitted": 40150, + "total_acs": 20395, + "total_submitted": 40188, "total_column_articles": 202, "frontend_question_id": "2488", "is_new_question": false @@ -15237,9 +15594,9 @@ "question__title": "Remove Nodes From Linked List", "question__title_slug": "remove-nodes-from-linked-list", "question__hide": false, - "total_acs": 9376, - "total_submitted": 13614, - "total_column_articles": 127, + "total_acs": 9468, + "total_submitted": 13729, + "total_column_articles": 128, "frontend_question_id": "2487", "is_new_question": false }, @@ -15258,9 +15615,9 @@ "question__title": "Append Characters to String to Make Subsequence", "question__title_slug": "append-characters-to-string-to-make-subsequence", "question__hide": false, - "total_acs": 8012, - "total_submitted": 12278, - "total_column_articles": 88, + "total_acs": 8041, + "total_submitted": 12321, + "total_column_articles": 87, "frontend_question_id": "2486", "is_new_question": false }, @@ -15279,8 +15636,8 @@ "question__title": "Find the Pivot Integer", "question__title_slug": "find-the-pivot-integer", "question__hide": false, - "total_acs": 30176, - "total_submitted": 37486, + "total_acs": 30325, + "total_submitted": 37716, "total_column_articles": 295, "frontend_question_id": "2485", "is_new_question": false @@ -15300,8 +15657,8 @@ "question__title": "Maximize Total Tastiness of Purchased Fruits", "question__title_slug": "maximize-total-tastiness-of-purchased-fruits", "question__hide": false, - "total_acs": 179, - "total_submitted": 309, + "total_acs": 182, + "total_submitted": 314, "total_column_articles": 11, "frontend_question_id": "2431", "is_new_question": false @@ -15321,8 +15678,8 @@ "question__title": "Number of Beautiful Partitions", "question__title_slug": "number-of-beautiful-partitions", "question__hide": false, - "total_acs": 4214, - "total_submitted": 10541, + "total_acs": 4219, + "total_submitted": 10565, "total_column_articles": 50, "frontend_question_id": "2478", "is_new_question": false @@ -15342,8 +15699,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": 4947, - "total_submitted": 9301, + "total_acs": 4962, + "total_submitted": 9333, "total_column_articles": 75, "frontend_question_id": "2477", "is_new_question": false @@ -15363,9 +15720,9 @@ "question__title": "Closest Nodes Queries in a Binary Search Tree", "question__title_slug": "closest-nodes-queries-in-a-binary-search-tree", "question__hide": false, - "total_acs": 7006, - "total_submitted": 16825, - "total_column_articles": 102, + "total_acs": 7030, + "total_submitted": 16869, + "total_column_articles": 101, "frontend_question_id": "2476", "is_new_question": false }, @@ -15384,8 +15741,8 @@ "question__title": "Number of Unequal Triplets in Array", "question__title_slug": "number-of-unequal-triplets-in-array", "question__hide": false, - "total_acs": 27951, - "total_submitted": 35937, + "total_acs": 28016, + "total_submitted": 36032, "total_column_articles": 165, "frontend_question_id": "2475", "is_new_question": false @@ -15405,8 +15762,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": 249, - "total_submitted": 351, + "total_acs": 253, + "total_submitted": 356, "total_column_articles": 12, "frontend_question_id": "2422", "is_new_question": false @@ -15426,8 +15783,8 @@ "question__title": "Most Profitable Path in a Tree", "question__title_slug": "most-profitable-path-in-a-tree", "question__hide": false, - "total_acs": 3046, - "total_submitted": 6039, + "total_acs": 3062, + "total_submitted": 6089, "total_column_articles": 47, "frontend_question_id": "2467", "is_new_question": false @@ -15447,8 +15804,8 @@ "question__title": "Split Message Based on Limit", "question__title_slug": "split-message-based-on-limit", "question__hide": false, - "total_acs": 2233, - "total_submitted": 5035, + "total_acs": 2235, + "total_submitted": 5040, "total_column_articles": 54, "frontend_question_id": "2468", "is_new_question": false @@ -15468,8 +15825,8 @@ "question__title": "Count Ways To Build Good Strings", "question__title_slug": "count-ways-to-build-good-strings", "question__hide": false, - "total_acs": 5635, - "total_submitted": 12123, + "total_acs": 5771, + "total_submitted": 12404, "total_column_articles": 75, "frontend_question_id": "2466", "is_new_question": false @@ -15489,8 +15846,8 @@ "question__title": "Number of Distinct Averages", "question__title_slug": "number-of-distinct-averages", "question__hide": false, - "total_acs": 21939, - "total_submitted": 30329, + "total_acs": 21984, + "total_submitted": 30391, "total_column_articles": 220, "frontend_question_id": "2465", "is_new_question": false @@ -15531,8 +15888,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": 5276, - "total_submitted": 11974, + "total_acs": 5297, + "total_submitted": 12018, "total_column_articles": 86, "frontend_question_id": "2472", "is_new_question": false @@ -15552,8 +15909,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": 6852, - "total_submitted": 12264, + "total_acs": 6875, + "total_submitted": 12311, "total_column_articles": 91, "frontend_question_id": "2471", "is_new_question": false @@ -15573,9 +15930,9 @@ "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": 8081, - "total_submitted": 19839, - "total_column_articles": 89, + "total_acs": 8118, + "total_submitted": 19939, + "total_column_articles": 88, "frontend_question_id": "2470", "is_new_question": false }, @@ -15594,9 +15951,9 @@ "question__title": "Convert the Temperature", "question__title_slug": "convert-the-temperature", "question__hide": false, - "total_acs": 48748, - "total_submitted": 57764, - "total_column_articles": 195, + "total_acs": 49416, + "total_submitted": 58758, + "total_column_articles": 196, "frontend_question_id": "2469", "is_new_question": false }, @@ -15615,8 +15972,8 @@ "question__title": "Design SQL", "question__title_slug": "design-sql", "question__hide": false, - "total_acs": 184, - "total_submitted": 280, + "total_acs": 187, + "total_submitted": 284, "total_column_articles": 9, "frontend_question_id": "2408", "is_new_question": false @@ -15636,8 +15993,8 @@ "question__title": "Minimum Total Distance Traveled", "question__title_slug": "minimum-total-distance-traveled", "question__hide": false, - "total_acs": 3800, - "total_submitted": 8195, + "total_acs": 3812, + "total_submitted": 8229, "total_column_articles": 59, "frontend_question_id": "2463", "is_new_question": false @@ -15657,9 +16014,9 @@ "question__title": "Total Cost to Hire K Workers", "question__title_slug": "total-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 7568, - "total_submitted": 19935, - "total_column_articles": 127, + "total_acs": 7795, + "total_submitted": 20478, + "total_column_articles": 131, "frontend_question_id": "2462", "is_new_question": false }, @@ -15678,9 +16035,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": 8635, - "total_submitted": 28018, - "total_column_articles": 143, + "total_acs": 8680, + "total_submitted": 28171, + "total_column_articles": 144, "frontend_question_id": "2461", "is_new_question": false }, @@ -15699,8 +16056,8 @@ "question__title": "Apply Operations to an Array", "question__title_slug": "apply-operations-to-an-array", "question__hide": false, - "total_acs": 29943, - "total_submitted": 43945, + "total_acs": 29997, + "total_submitted": 44024, "total_column_articles": 253, "frontend_question_id": "2460", "is_new_question": false @@ -15720,8 +16077,8 @@ "question__title": "Words Within Two Edits of Dictionary", "question__title_slug": "words-within-two-edits-of-dictionary", "question__hide": false, - "total_acs": 4749, - "total_submitted": 7307, + "total_acs": 4773, + "total_submitted": 7364, "total_column_articles": 44, "frontend_question_id": "2452", "is_new_question": false @@ -15741,9 +16098,9 @@ "question__title": "Next Greater Element IV", "question__title_slug": "next-greater-element-iv", "question__hide": false, - "total_acs": 4226, - "total_submitted": 8606, - "total_column_articles": 86, + "total_acs": 4282, + "total_submitted": 8734, + "total_column_articles": 87, "frontend_question_id": "2454", "is_new_question": false }, @@ -15762,8 +16119,8 @@ "question__title": "Destroy Sequential Targets", "question__title_slug": "destroy-sequential-targets", "question__hide": false, - "total_acs": 4560, - "total_submitted": 12673, + "total_acs": 4584, + "total_submitted": 12762, "total_column_articles": 69, "frontend_question_id": "2453", "is_new_question": false @@ -15783,9 +16140,9 @@ "question__title": "Odd String Difference", "question__title_slug": "odd-string-difference", "question__hide": false, - "total_acs": 20866, - "total_submitted": 31456, - "total_column_articles": 242, + "total_acs": 20909, + "total_submitted": 31532, + "total_column_articles": 243, "frontend_question_id": "2451", "is_new_question": false }, @@ -15804,9 +16161,9 @@ "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": 7896, - "total_submitted": 19025, - "total_column_articles": 66, + "total_acs": 7923, + "total_submitted": 19070, + "total_column_articles": 68, "frontend_question_id": "2447", "is_new_question": false }, @@ -15825,8 +16182,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": 4563, - "total_submitted": 11086, + "total_acs": 4592, + "total_submitted": 11151, "total_column_articles": 82, "frontend_question_id": "2458", "is_new_question": false @@ -15846,8 +16203,8 @@ "question__title": "Minimum Addition to Make Integer Beautiful", "question__title_slug": "minimum-addition-to-make-integer-beautiful", "question__hide": false, - "total_acs": 6909, - "total_submitted": 17474, + "total_acs": 6939, + "total_submitted": 17549, "total_column_articles": 124, "frontend_question_id": "2457", "is_new_question": false @@ -15867,9 +16224,9 @@ "question__title": "Most Popular Video Creator", "question__title_slug": "most-popular-video-creator", "question__hide": false, - "total_acs": 8421, - "total_submitted": 21820, - "total_column_articles": 119, + "total_acs": 8457, + "total_submitted": 21895, + "total_column_articles": 121, "frontend_question_id": "2456", "is_new_question": false }, @@ -15888,9 +16245,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": 31479, - "total_submitted": 49587, - "total_column_articles": 180, + "total_acs": 31526, + "total_submitted": 49670, + "total_column_articles": 179, "frontend_question_id": "2455", "is_new_question": false }, @@ -15909,8 +16266,8 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 9788, - "total_submitted": 21017, + "total_acs": 9811, + "total_submitted": 21048, "total_column_articles": 78, "frontend_question_id": "2443", "is_new_question": false @@ -15951,8 +16308,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": 3953, - "total_submitted": 6027, + "total_acs": 3985, + "total_submitted": 6087, "total_column_articles": 49, "frontend_question_id": "2449", "is_new_question": false @@ -15972,8 +16329,8 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 5640, - "total_submitted": 15578, + "total_acs": 5662, + "total_submitted": 15644, "total_column_articles": 83, "frontend_question_id": "2448", "is_new_question": false @@ -15993,8 +16350,8 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 334, - "total_submitted": 481, + "total_acs": 344, + "total_submitted": 493, "total_column_articles": 17, "frontend_question_id": "2403", "is_new_question": false @@ -16014,8 +16371,8 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 30007, - "total_submitted": 47200, + "total_acs": 30035, + "total_submitted": 47239, "total_column_articles": 218, "frontend_question_id": "2446", "is_new_question": false @@ -16035,8 +16392,8 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 443, - "total_submitted": 567, + "total_acs": 447, + "total_submitted": 572, "total_column_articles": 14, "frontend_question_id": "2393", "is_new_question": false @@ -16056,9 +16413,9 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 794, - "total_submitted": 1510, - "total_column_articles": 14, + "total_acs": 808, + "total_submitted": 1545, + "total_column_articles": 15, "frontend_question_id": "2394", "is_new_question": false }, @@ -16077,9 +16434,9 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 5318, - "total_submitted": 8203, - "total_column_articles": 72, + "total_acs": 5350, + "total_submitted": 8285, + "total_column_articles": 73, "frontend_question_id": "2425", "is_new_question": false }, @@ -16098,8 +16455,8 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 20225, - "total_submitted": 80605, + "total_acs": 20269, + "total_submitted": 80800, "total_column_articles": 278, "frontend_question_id": "2423", "is_new_question": false @@ -16119,9 +16476,9 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 2266, - "total_submitted": 3678, - "total_column_articles": 32, + "total_acs": 2284, + "total_submitted": 3708, + "total_column_articles": 33, "frontend_question_id": "2440", "is_new_question": false }, @@ -16140,8 +16497,8 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 6550, - "total_submitted": 16582, + "total_acs": 6616, + "total_submitted": 16743, "total_column_articles": 121, "frontend_question_id": "2439", "is_new_question": false @@ -16161,8 +16518,8 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 4859, - "total_submitted": 11749, + "total_acs": 4878, + "total_submitted": 11783, "total_column_articles": 84, "frontend_question_id": "2438", "is_new_question": false @@ -16182,8 +16539,8 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 24989, - "total_submitted": 49518, + "total_acs": 25024, + "total_submitted": 49598, "total_column_articles": 287, "frontend_question_id": "2437", "is_new_question": false @@ -16203,8 +16560,8 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 6866, - "total_submitted": 15346, + "total_acs": 6887, + "total_submitted": 15395, "total_column_articles": 100, "frontend_question_id": "2444", "is_new_question": false @@ -16224,9 +16581,9 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 5642, - "total_submitted": 18343, - "total_column_articles": 94, + "total_acs": 5707, + "total_submitted": 18505, + "total_column_articles": 95, "frontend_question_id": "2407", "is_new_question": false }, @@ -16245,9 +16602,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": 10620, - "total_submitted": 14125, - "total_column_articles": 96, + "total_acs": 10668, + "total_submitted": 14187, + "total_column_articles": 97, "frontend_question_id": "2442", "is_new_question": false }, @@ -16266,8 +16623,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": 30010, - "total_submitted": 41351, + "total_acs": 30051, + "total_submitted": 41416, "total_column_articles": 275, "frontend_question_id": "2441", "is_new_question": false @@ -16288,7 +16645,7 @@ "question__title_slug": "change-null-values-in-a-table-to-the-previous-value", "question__hide": false, "total_acs": 745, - "total_submitted": 1162, + "total_submitted": 1210, "total_column_articles": 13, "frontend_question_id": "2388", "is_new_question": false @@ -16308,8 +16665,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": 225, - "total_submitted": 294, + "total_acs": 226, + "total_submitted": 295, "total_column_articles": 5, "frontend_question_id": "2387", "is_new_question": false @@ -16329,8 +16686,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": 6139, - "total_submitted": 11878, + "total_acs": 6161, + "total_submitted": 11909, "total_column_articles": 97, "frontend_question_id": "2435", "is_new_question": false @@ -16350,8 +16707,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": 6690, - "total_submitted": 15881, + "total_acs": 6711, + "total_submitted": 15923, "total_column_articles": 115, "frontend_question_id": "2434", "is_new_question": false @@ -16371,8 +16728,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": 8383, - "total_submitted": 9868, + "total_acs": 8415, + "total_submitted": 9915, "total_column_articles": 86, "frontend_question_id": "2433", "is_new_question": false @@ -16392,9 +16749,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": 29965, - "total_submitted": 54361, - "total_column_articles": 229, + "total_acs": 30008, + "total_submitted": 54441, + "total_column_articles": 230, "frontend_question_id": "2432", "is_new_question": false }, @@ -16413,8 +16770,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": 245, - "total_submitted": 363, + "total_acs": 247, + "total_submitted": 367, "total_column_articles": 10, "frontend_question_id": "2378", "is_new_question": false @@ -16434,9 +16791,9 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 883, - "total_submitted": 1090, - "total_column_articles": 9, + "total_acs": 899, + "total_submitted": 1113, + "total_column_articles": 10, "frontend_question_id": "2377", "is_new_question": false }, @@ -16455,9 +16812,9 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 862, - "total_submitted": 1100, - "total_column_articles": 8, + "total_acs": 872, + "total_submitted": 1110, + "total_column_articles": 9, "frontend_question_id": "2372", "is_new_question": false }, @@ -16476,8 +16833,8 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 4319, - "total_submitted": 9345, + "total_acs": 4341, + "total_submitted": 9397, "total_column_articles": 84, "frontend_question_id": "2426", "is_new_question": false @@ -16497,8 +16854,8 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 5798, - "total_submitted": 10334, + "total_acs": 5829, + "total_submitted": 10378, "total_column_articles": 92, "frontend_question_id": "2424", "is_new_question": false @@ -16518,8 +16875,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": 6129, - "total_submitted": 12363, + "total_acs": 6179, + "total_submitted": 12465, "total_column_articles": 63, "frontend_question_id": "2522", "is_new_question": false @@ -16539,8 +16896,8 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 6910, - "total_submitted": 14448, + "total_acs": 6923, + "total_submitted": 14471, "total_column_articles": 105, "frontend_question_id": "2430", "is_new_question": false @@ -16560,8 +16917,8 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 7468, - "total_submitted": 16744, + "total_acs": 7481, + "total_submitted": 16765, "total_column_articles": 111, "frontend_question_id": "2429", "is_new_question": false @@ -16581,8 +16938,8 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 8579, - "total_submitted": 11476, + "total_acs": 8612, + "total_submitted": 11515, "total_column_articles": 97, "frontend_question_id": "2428", "is_new_question": false @@ -16602,9 +16959,9 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 33817, - "total_submitted": 41550, - "total_column_articles": 244, + "total_acs": 33990, + "total_submitted": 41807, + "total_column_articles": 245, "frontend_question_id": "2427", "is_new_question": false }, @@ -16623,9 +16980,9 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 281, - "total_submitted": 378, - "total_column_articles": 11, + "total_acs": 294, + "total_submitted": 394, + "total_column_articles": 13, "frontend_question_id": "2371", "is_new_question": false }, @@ -16644,8 +17001,8 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 4059, - "total_submitted": 9481, + "total_acs": 4080, + "total_submitted": 9508, "total_column_articles": 52, "frontend_question_id": "2421", "is_new_question": false @@ -16665,8 +17022,8 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 7953, - "total_submitted": 25204, + "total_acs": 7981, + "total_submitted": 25298, "total_column_articles": 142, "frontend_question_id": "2420", "is_new_question": false @@ -16686,8 +17043,8 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 8739, - "total_submitted": 20481, + "total_acs": 8752, + "total_submitted": 20518, "total_column_articles": 107, "frontend_question_id": "2419", "is_new_question": false @@ -16707,9 +17064,9 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 37354, - "total_submitted": 47131, - "total_column_articles": 382, + "total_acs": 37452, + "total_submitted": 47265, + "total_column_articles": 383, "frontend_question_id": "2418", "is_new_question": false }, @@ -16728,9 +17085,9 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 647, - "total_submitted": 879, - "total_column_articles": 15, + "total_acs": 655, + "total_submitted": 899, + "total_column_articles": 16, "frontend_question_id": "2362", "is_new_question": false }, @@ -16749,8 +17106,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 361, - "total_submitted": 456, + "total_acs": 387, + "total_submitted": 497, "total_column_articles": 14, "frontend_question_id": "2361", "is_new_question": false @@ -16770,8 +17127,8 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 3611, - "total_submitted": 7454, + "total_acs": 3625, + "total_submitted": 7479, "total_column_articles": 62, "frontend_question_id": "2412", "is_new_question": false @@ -16791,8 +17148,8 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 4857, - "total_submitted": 11155, + "total_acs": 4874, + "total_submitted": 11184, "total_column_articles": 63, "frontend_question_id": "2411", "is_new_question": false @@ -16812,9 +17169,9 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 7147, - "total_submitted": 11009, - "total_column_articles": 83, + "total_acs": 7184, + "total_submitted": 11068, + "total_column_articles": 84, "frontend_question_id": "2410", "is_new_question": false }, @@ -16833,8 +17190,8 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 25481, - "total_submitted": 45560, + "total_acs": 25504, + "total_submitted": 45601, "total_column_articles": 318, "frontend_question_id": "2409", "is_new_question": false @@ -16854,9 +17211,9 @@ "question__title": "Number of Unique Subjects Taught by Each Teacher", "question__title_slug": "number-of-unique-subjects-taught-by-each-teacher", "question__hide": false, - "total_acs": 7177, - "total_submitted": 8773, - "total_column_articles": 43, + "total_acs": 8061, + "total_submitted": 9859, + "total_column_articles": 50, "frontend_question_id": "2356", "is_new_question": false }, @@ -16875,9 +17232,9 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 9131, - "total_submitted": 22409, - "total_column_articles": 124, + "total_acs": 9144, + "total_submitted": 22460, + "total_column_articles": 125, "frontend_question_id": "2416", "is_new_question": false }, @@ -16896,8 +17253,8 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 10648, - "total_submitted": 15196, + "total_acs": 10697, + "total_submitted": 15257, "total_column_articles": 140, "frontend_question_id": "2415", "is_new_question": false @@ -16917,8 +17274,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": 12157, - "total_submitted": 20154, + "total_acs": 12220, + "total_submitted": 20234, "total_column_articles": 125, "frontend_question_id": "2414", "is_new_question": false @@ -16938,9 +17295,9 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 51978, - "total_submitted": 60341, - "total_column_articles": 310, + "total_acs": 52832, + "total_submitted": 61533, + "total_column_articles": 311, "frontend_question_id": "2413", "is_new_question": false }, @@ -16959,9 +17316,9 @@ "question__title": "Maximum Number of Books You Can Take", "question__title_slug": "maximum-number-of-books-you-can-take", "question__hide": false, - "total_acs": 398, - "total_submitted": 685, - "total_column_articles": 10, + "total_acs": 401, + "total_submitted": 688, + "total_column_articles": 11, "frontend_question_id": "2355", "is_new_question": false }, @@ -16982,7 +17339,7 @@ "question__hide": false, "total_acs": 176, "total_submitted": 299, - "total_column_articles": 3, + "total_column_articles": 4, "frontend_question_id": "2459", "is_new_question": false }, @@ -17001,8 +17358,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": 8681, - "total_submitted": 19363, + "total_acs": 8693, + "total_submitted": 19393, "total_column_articles": 131, "frontend_question_id": "2406", "is_new_question": false @@ -17022,9 +17379,9 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 10899, - "total_submitted": 14562, - "total_column_articles": 131, + "total_acs": 10937, + "total_submitted": 14614, + "total_column_articles": 133, "frontend_question_id": "2405", "is_new_question": false }, @@ -17043,8 +17400,8 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 36340, - "total_submitted": 62281, + "total_acs": 36380, + "total_submitted": 62341, "total_column_articles": 346, "frontend_question_id": "2404", "is_new_question": false @@ -17085,9 +17442,9 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 847, - "total_submitted": 2230, - "total_column_articles": 10, + "total_acs": 871, + "total_submitted": 2270, + "total_column_articles": 11, "frontend_question_id": "2346", "is_new_question": false }, @@ -17106,9 +17463,9 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 6347, - "total_submitted": 13187, - "total_column_articles": 82, + "total_acs": 6390, + "total_submitted": 13253, + "total_column_articles": 83, "frontend_question_id": "2365", "is_new_question": false }, @@ -17127,8 +17484,8 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 6140, - "total_submitted": 11098, + "total_acs": 6181, + "total_submitted": 11180, "total_column_articles": 108, "frontend_question_id": "2397", "is_new_question": false @@ -17148,8 +17505,8 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 11539, - "total_submitted": 13121, + "total_acs": 11618, + "total_submitted": 13205, "total_column_articles": 117, "frontend_question_id": "2396", "is_new_question": false @@ -17169,8 +17526,8 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 28133, - "total_submitted": 36927, + "total_acs": 28180, + "total_submitted": 36989, "total_column_articles": 242, "frontend_question_id": "2395", "is_new_question": false @@ -17190,8 +17547,8 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 6499, - "total_submitted": 19892, + "total_acs": 6514, + "total_submitted": 19946, "total_column_articles": 120, "frontend_question_id": "2402", "is_new_question": false @@ -17211,9 +17568,9 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 10555, - "total_submitted": 21224, - "total_column_articles": 164, + "total_acs": 10606, + "total_submitted": 21330, + "total_column_articles": 165, "frontend_question_id": "2401", "is_new_question": false }, @@ -17232,8 +17589,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": 11222, - "total_submitted": 34317, + "total_acs": 11271, + "total_submitted": 34418, "total_column_articles": 156, "frontend_question_id": "2400", "is_new_question": false @@ -17253,8 +17610,8 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 31150, - "total_submitted": 41449, + "total_acs": 31200, + "total_submitted": 41534, "total_column_articles": 308, "frontend_question_id": "2399", "is_new_question": false @@ -17274,8 +17631,8 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 10188, - "total_submitted": 32638, + "total_acs": 10259, + "total_submitted": 32809, "total_column_articles": 152, "frontend_question_id": "2384", "is_new_question": false @@ -17295,8 +17652,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": 339, - "total_submitted": 452, + "total_acs": 343, + "total_submitted": 457, "total_column_articles": 10, "frontend_question_id": "2340", "is_new_question": false @@ -17316,8 +17673,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": 11612, - "total_submitted": 21640, + "total_acs": 11669, + "total_submitted": 21736, "total_column_articles": 144, "frontend_question_id": "2342", "is_new_question": false @@ -17337,8 +17694,8 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 5638, - "total_submitted": 10080, + "total_acs": 5648, + "total_submitted": 10095, "total_column_articles": 96, "frontend_question_id": "2392", "is_new_question": false @@ -17358,8 +17715,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": 10354, - "total_submitted": 12119, + "total_acs": 10387, + "total_submitted": 12156, "total_column_articles": 165, "frontend_question_id": "2391", "is_new_question": false @@ -17379,9 +17736,9 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 18409, - "total_submitted": 26229, - "total_column_articles": 193, + "total_acs": 19141, + "total_submitted": 27287, + "total_column_articles": 202, "frontend_question_id": "2390", "is_new_question": false }, @@ -17400,8 +17757,8 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 35284, - "total_submitted": 49763, + "total_acs": 35375, + "total_submitted": 49918, "total_column_articles": 349, "frontend_question_id": "2389", "is_new_question": false @@ -17421,9 +17778,9 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 409, - "total_submitted": 501, - "total_column_articles": 15, + "total_acs": 417, + "total_submitted": 511, + "total_column_articles": 16, "frontend_question_id": "2330", "is_new_question": false }, @@ -17442,9 +17799,9 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 4018, - "total_submitted": 7129, - "total_column_articles": 94, + "total_acs": 4044, + "total_submitted": 7193, + "total_column_articles": 95, "frontend_question_id": "2382", "is_new_question": false }, @@ -17463,8 +17820,8 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 5680, - "total_submitted": 15327, + "total_acs": 5711, + "total_submitted": 15421, "total_column_articles": 100, "frontend_question_id": "2381", "is_new_question": false @@ -17484,8 +17841,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": 6719, - "total_submitted": 12017, + "total_acs": 6736, + "total_submitted": 12048, "total_column_articles": 73, "frontend_question_id": "2380", "is_new_question": false @@ -17505,9 +17862,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": 36536, - "total_submitted": 59181, - "total_column_articles": 432, + "total_acs": 36601, + "total_submitted": 59279, + "total_column_articles": 431, "frontend_question_id": "2379", "is_new_question": false }, @@ -17526,8 +17883,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": 4117, - "total_submitted": 9742, + "total_acs": 4135, + "total_submitted": 9796, "total_column_articles": 51, "frontend_question_id": "2386", "is_new_question": false @@ -17547,8 +17904,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": 8538, - "total_submitted": 18490, + "total_acs": 8563, + "total_submitted": 18526, "total_column_articles": 162, "frontend_question_id": "2385", "is_new_question": false @@ -17568,8 +17925,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": 35572, - "total_submitted": 75361, + "total_acs": 35597, + "total_submitted": 75409, "total_column_articles": 365, "frontend_question_id": "2383", "is_new_question": false @@ -17589,8 +17946,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": 279, - "total_submitted": 396, + "total_acs": 281, + "total_submitted": 398, "total_column_articles": 10, "frontend_question_id": "2323", "is_new_question": false @@ -17610,8 +17967,8 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 8750, - "total_submitted": 16696, + "total_acs": 8824, + "total_submitted": 16826, "total_column_articles": 123, "frontend_question_id": "2376", "is_new_question": false @@ -17631,8 +17988,8 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 9902, - "total_submitted": 14134, + "total_acs": 9932, + "total_submitted": 14184, "total_column_articles": 212, "frontend_question_id": "2375", "is_new_question": false @@ -17652,8 +18009,8 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 9888, - "total_submitted": 23346, + "total_acs": 9926, + "total_submitted": 23404, "total_column_articles": 106, "frontend_question_id": "2374", "is_new_question": false @@ -17673,9 +18030,9 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 37594, - "total_submitted": 44155, - "total_column_articles": 312, + "total_acs": 37683, + "total_submitted": 44292, + "total_column_articles": 313, "frontend_question_id": "2373", "is_new_question": false }, @@ -17694,9 +18051,9 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 1086, - "total_submitted": 1423, - "total_column_articles": 11, + "total_acs": 1115, + "total_submitted": 1458, + "total_column_articles": 12, "frontend_question_id": "2339", "is_new_question": false }, @@ -17715,9 +18072,9 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 1151, - "total_submitted": 1585, - "total_column_articles": 10, + "total_acs": 1167, + "total_submitted": 1608, + "total_column_articles": 11, "frontend_question_id": "2329", "is_new_question": false }, @@ -17736,9 +18093,9 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 936, - "total_submitted": 1301, - "total_column_articles": 11, + "total_acs": 945, + "total_submitted": 1310, + "total_column_articles": 12, "frontend_question_id": "2324", "is_new_question": false }, @@ -17757,8 +18114,8 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 4306, - "total_submitted": 10042, + "total_acs": 4319, + "total_submitted": 10071, "total_column_articles": 50, "frontend_question_id": "2366", "is_new_question": false @@ -17778,8 +18135,8 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 4329, - "total_submitted": 12564, + "total_acs": 4340, + "total_submitted": 12589, "total_column_articles": 85, "frontend_question_id": "2398", "is_new_question": false @@ -17799,8 +18156,8 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 6478, - "total_submitted": 15275, + "total_acs": 6498, + "total_submitted": 15345, "total_column_articles": 86, "frontend_question_id": "2364", "is_new_question": false @@ -17820,8 +18177,8 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 35006, - "total_submitted": 44803, + "total_acs": 35057, + "total_submitted": 44867, "total_column_articles": 301, "frontend_question_id": "2363", "is_new_question": false @@ -17841,9 +18198,9 @@ "question__title": "The First Day of the Maximum Recorded Degree in Each City", "question__title_slug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", "question__hide": false, - "total_acs": 932, - "total_submitted": 1302, - "total_column_articles": 12, + "total_acs": 942, + "total_submitted": 1320, + "total_column_articles": 13, "frontend_question_id": "2314", "is_new_question": false }, @@ -17862,8 +18219,8 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 10042, - "total_submitted": 21722, + "total_acs": 10063, + "total_submitted": 21752, "total_column_articles": 148, "frontend_question_id": "2368", "is_new_question": false @@ -17883,9 +18240,9 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 8583, - "total_submitted": 19855, - "total_column_articles": 117, + "total_acs": 8614, + "total_submitted": 19954, + "total_column_articles": 118, "frontend_question_id": "2370", "is_new_question": false }, @@ -17904,9 +18261,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": 8954, - "total_submitted": 23182, - "total_column_articles": 117, + "total_acs": 9062, + "total_submitted": 23342, + "total_column_articles": 119, "frontend_question_id": "2369", "is_new_question": false }, @@ -17925,9 +18282,9 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 41810, - "total_submitted": 50153, - "total_column_articles": 387, + "total_acs": 41922, + "total_submitted": 50304, + "total_column_articles": 388, "frontend_question_id": "2367", "is_new_question": false }, @@ -17946,9 +18303,9 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 1007, - "total_submitted": 1316, - "total_column_articles": 14, + "total_acs": 1024, + "total_submitted": 1350, + "total_column_articles": 15, "frontend_question_id": "2308", "is_new_question": false }, @@ -17967,8 +18324,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 1080, - "total_submitted": 1374, + "total_acs": 1103, + "total_submitted": 1402, "total_column_articles": 11, "frontend_question_id": "2298", "is_new_question": false @@ -17988,9 +18345,9 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 8387, - "total_submitted": 22044, - "total_column_articles": 140, + "total_acs": 8410, + "total_submitted": 22134, + "total_column_articles": 141, "frontend_question_id": "2360", "is_new_question": false }, @@ -18009,8 +18366,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": 8082, - "total_submitted": 26590, + "total_acs": 8105, + "total_submitted": 26669, "total_column_articles": 112, "frontend_question_id": "2359", "is_new_question": false @@ -18030,9 +18387,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": 10729, - "total_submitted": 16671, - "total_column_articles": 174, + "total_acs": 10763, + "total_submitted": 16722, + "total_column_articles": 175, "frontend_question_id": "2358", "is_new_question": false }, @@ -18051,9 +18408,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": 42671, - "total_submitted": 56271, - "total_column_articles": 479, + "total_acs": 42757, + "total_submitted": 56402, + "total_column_articles": 481, "frontend_question_id": "2357", "is_new_question": false }, @@ -18072,8 +18429,8 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 4147, - "total_submitted": 6368, + "total_acs": 4164, + "total_submitted": 6402, "total_column_articles": 74, "frontend_question_id": "2350", "is_new_question": false @@ -18093,8 +18450,8 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 6611, - "total_submitted": 17722, + "total_acs": 6636, + "total_submitted": 17773, "total_column_articles": 96, "frontend_question_id": "2349", "is_new_question": false @@ -18114,9 +18471,9 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 32433, - "total_submitted": 54730, - "total_column_articles": 286, + "total_acs": 32475, + "total_submitted": 54800, + "total_column_articles": 287, "frontend_question_id": "2347", "is_new_question": false }, @@ -18135,8 +18492,8 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 8336, - "total_submitted": 14751, + "total_acs": 8371, + "total_submitted": 14806, "total_column_articles": 119, "frontend_question_id": "2348", "is_new_question": false @@ -18156,9 +18513,9 @@ "question__title": "Products With Three or More Orders in Two Consecutive Years", "question__title_slug": "products-with-three-or-more-orders-in-two-consecutive-years", "question__hide": false, - "total_acs": 1073, - "total_submitted": 2431, - "total_column_articles": 14, + "total_acs": 1089, + "total_submitted": 2484, + "total_column_articles": 15, "frontend_question_id": "2292", "is_new_question": false }, @@ -18177,8 +18534,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 6416, - "total_submitted": 14325, + "total_acs": 6429, + "total_submitted": 14345, "total_column_articles": 77, "frontend_question_id": "2354", "is_new_question": false @@ -18198,9 +18555,9 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 7964, - "total_submitted": 25940, - "total_column_articles": 120, + "total_acs": 7992, + "total_submitted": 26000, + "total_column_articles": 121, "frontend_question_id": "2353", "is_new_question": false }, @@ -18219,9 +18576,9 @@ "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 36213, - "total_submitted": 49133, - "total_column_articles": 356, + "total_acs": 36760, + "total_submitted": 49908, + "total_column_articles": 359, "frontend_question_id": "2352", "is_new_question": false }, @@ -18240,9 +18597,9 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 40784, - "total_submitted": 48203, - "total_column_articles": 415, + "total_acs": 40901, + "total_submitted": 48370, + "total_column_articles": 417, "frontend_question_id": "2351", "is_new_question": false }, @@ -18261,8 +18618,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 473, - "total_submitted": 810, + "total_acs": 480, + "total_submitted": 821, "total_column_articles": 14, "frontend_question_id": "2291", "is_new_question": false @@ -18282,8 +18639,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": 238, - "total_submitted": 493, + "total_acs": 239, + "total_submitted": 495, "total_column_articles": 10, "frontend_question_id": "2282", "is_new_question": false @@ -18303,8 +18660,8 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 8622, - "total_submitted": 16178, + "total_acs": 8637, + "total_submitted": 16202, "total_column_articles": 119, "frontend_question_id": "2344", "is_new_question": false @@ -18324,8 +18681,8 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 9602, - "total_submitted": 23118, + "total_acs": 9628, + "total_submitted": 23156, "total_column_articles": 144, "frontend_question_id": "2343", "is_new_question": false @@ -18345,8 +18702,8 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 39979, - "total_submitted": 49290, + "total_acs": 40043, + "total_submitted": 49371, "total_column_articles": 476, "frontend_question_id": "2341", "is_new_question": false @@ -18368,7 +18725,7 @@ "question__hide": false, "total_acs": 390, "total_submitted": 561, - "total_column_articles": 13, + "total_column_articles": 14, "frontend_question_id": "2277", "is_new_question": false }, @@ -18387,9 +18744,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": 3396, - "total_submitted": 7156, - "total_column_articles": 57, + "total_acs": 3417, + "total_submitted": 7219, + "total_column_articles": 58, "frontend_question_id": "2334", "is_new_question": false }, @@ -18408,9 +18765,9 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 4994, - "total_submitted": 18646, - "total_column_articles": 76, + "total_acs": 5028, + "total_submitted": 18731, + "total_column_articles": 77, "frontend_question_id": "2333", "is_new_question": false }, @@ -18429,8 +18786,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": 5659, - "total_submitted": 23052, + "total_acs": 5732, + "total_submitted": 23260, "total_column_articles": 94, "frontend_question_id": "2332", "is_new_question": false @@ -18450,8 +18807,8 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 32787, - "total_submitted": 39098, + "total_acs": 32958, + "total_submitted": 39314, "total_column_articles": 366, "frontend_question_id": "2331", "is_new_question": false @@ -18471,8 +18828,8 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 2915, - "total_submitted": 9472, + "total_acs": 2930, + "total_submitted": 9504, "total_column_articles": 46, "frontend_question_id": "2338", "is_new_question": false @@ -18492,8 +18849,8 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 8326, - "total_submitted": 21180, + "total_acs": 8345, + "total_submitted": 21222, "total_column_articles": 125, "frontend_question_id": "2337", "is_new_question": false @@ -18513,9 +18870,9 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 11969, - "total_submitted": 17165, - "total_column_articles": 155, + "total_acs": 12225, + "total_submitted": 17550, + "total_column_articles": 156, "frontend_question_id": "2336", "is_new_question": false }, @@ -18534,9 +18891,9 @@ "question__title": "Minimum Amount of Time to Fill Cups", "question__title_slug": "minimum-amount-of-time-to-fill-cups", "question__hide": false, - "total_acs": 33748, - "total_submitted": 52299, - "total_column_articles": 399, + "total_acs": 33805, + "total_submitted": 52382, + "total_column_articles": 400, "frontend_question_id": "2335", "is_new_question": false }, @@ -18555,9 +18912,9 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 10388, - "total_submitted": 15552, - "total_column_articles": 143, + "total_acs": 10421, + "total_submitted": 15597, + "total_column_articles": 144, "frontend_question_id": "2326", "is_new_question": false }, @@ -18576,9 +18933,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": 6640, - "total_submitted": 12979, - "total_column_articles": 118, + "total_acs": 6670, + "total_submitted": 13023, + "total_column_articles": 120, "frontend_question_id": "2328", "is_new_question": false }, @@ -18597,9 +18954,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": 10202, - "total_submitted": 22226, - "total_column_articles": 198, + "total_acs": 10247, + "total_submitted": 22312, + "total_column_articles": 199, "frontend_question_id": "2327", "is_new_question": false }, @@ -18618,8 +18975,8 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 43836, - "total_submitted": 51283, + "total_acs": 43915, + "total_submitted": 51420, "total_column_articles": 437, "frontend_question_id": "2325", "is_new_question": false @@ -18639,8 +18996,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 503, - "total_submitted": 736, + "total_acs": 507, + "total_submitted": 740, "total_column_articles": 18, "frontend_question_id": "2268", "is_new_question": false @@ -18660,8 +19017,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 3745, - "total_submitted": 6547, + "total_acs": 3760, + "total_submitted": 6570, "total_column_articles": 70, "frontend_question_id": "2318", "is_new_question": false @@ -18681,8 +19038,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": 7283, - "total_submitted": 18670, + "total_acs": 7331, + "total_submitted": 18769, "total_column_articles": 120, "frontend_question_id": "2316", "is_new_question": false @@ -18702,8 +19059,8 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 5585, - "total_submitted": 6559, + "total_acs": 5614, + "total_submitted": 6610, "total_column_articles": 71, "frontend_question_id": "2317", "is_new_question": false @@ -18723,9 +19080,9 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 35934, - "total_submitted": 41969, - "total_column_articles": 474, + "total_acs": 36062, + "total_submitted": 42140, + "total_column_articles": 475, "frontend_question_id": "2315", "is_new_question": false }, @@ -18744,8 +19101,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": 3543, - "total_submitted": 6014, + "total_acs": 3560, + "total_submitted": 6048, "total_column_articles": 56, "frontend_question_id": "2322", "is_new_question": false @@ -18765,9 +19122,9 @@ "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": 248, - "total_submitted": 358, - "total_column_articles": 15, + "total_acs": 253, + "total_submitted": 367, + "total_column_articles": 17, "frontend_question_id": "2313", "is_new_question": false }, @@ -18786,8 +19143,8 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 36666, - "total_submitted": 48146, + "total_acs": 36744, + "total_submitted": 48257, "total_column_articles": 340, "frontend_question_id": "2319", "is_new_question": false @@ -18807,8 +19164,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": 8709, - "total_submitted": 21479, + "total_acs": 8731, + "total_submitted": 21513, "total_column_articles": 94, "frontend_question_id": "2320", "is_new_question": false @@ -18830,7 +19187,7 @@ "question__hide": false, "total_acs": 173, "total_submitted": 287, - "total_column_articles": 8, + "total_column_articles": 9, "frontend_question_id": "2254", "is_new_question": false }, @@ -18849,8 +19206,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": 7500, - "total_submitted": 20244, + "total_acs": 7530, + "total_submitted": 20317, "total_column_articles": 134, "frontend_question_id": "2311", "is_new_question": false @@ -18870,8 +19227,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": 5570, - "total_submitted": 10899, + "total_acs": 5594, + "total_submitted": 10943, "total_column_articles": 84, "frontend_question_id": "2302", "is_new_question": false @@ -18891,8 +19248,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 4452, - "total_submitted": 9790, + "total_acs": 4467, + "total_submitted": 9818, "total_column_articles": 67, "frontend_question_id": "2301", "is_new_question": false @@ -18912,9 +19269,9 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 10531, - "total_submitted": 26469, - "total_column_articles": 127, + "total_acs": 10907, + "total_submitted": 27426, + "total_column_articles": 128, "frontend_question_id": "2300", "is_new_question": false }, @@ -18933,8 +19290,8 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 25394, - "total_submitted": 38744, + "total_acs": 25429, + "total_submitted": 38817, "total_column_articles": 294, "frontend_question_id": "2299", "is_new_question": false @@ -18954,8 +19311,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 4730, - "total_submitted": 10584, + "total_acs": 4739, + "total_submitted": 10601, "total_column_articles": 68, "frontend_question_id": "2306", "is_new_question": false @@ -18975,8 +19332,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 7174, - "total_submitted": 16348, + "total_acs": 7183, + "total_submitted": 16362, "total_column_articles": 124, "frontend_question_id": "2296", "is_new_question": false @@ -18996,9 +19353,9 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 8918, - "total_submitted": 15404, - "total_column_articles": 117, + "total_acs": 8937, + "total_submitted": 15452, + "total_column_articles": 118, "frontend_question_id": "2295", "is_new_question": false }, @@ -19017,8 +19374,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": 8710, - "total_submitted": 12783, + "total_acs": 8727, + "total_submitted": 12803, "total_column_articles": 114, "frontend_question_id": "2294", "is_new_question": false @@ -19038,8 +19395,8 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 29426, - "total_submitted": 40348, + "total_acs": 29465, + "total_submitted": 40413, "total_column_articles": 318, "frontend_question_id": "2293", "is_new_question": false @@ -19059,8 +19416,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": 323, - "total_submitted": 433, + "total_acs": 330, + "total_submitted": 442, "total_column_articles": 16, "frontend_question_id": "2237", "is_new_question": false @@ -19080,9 +19437,9 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 25938, - "total_submitted": 30865, - "total_column_articles": 171, + "total_acs": 39579, + "total_submitted": 45690, + "total_column_articles": 211, "frontend_question_id": "2236", "is_new_question": false }, @@ -19101,9 +19458,9 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 41962, - "total_submitted": 51843, - "total_column_articles": 178, + "total_acs": 60604, + "total_submitted": 72277, + "total_column_articles": 227, "frontend_question_id": "2235", "is_new_question": false }, @@ -19122,8 +19479,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 273, - "total_submitted": 389, + "total_acs": 276, + "total_submitted": 393, "total_column_articles": 4, "frontend_question_id": "2253", "is_new_question": false @@ -19143,8 +19500,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 304, - "total_submitted": 527, + "total_acs": 307, + "total_submitted": 538, "total_column_articles": 4, "frontend_question_id": "2252", "is_new_question": false @@ -19164,8 +19521,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 3258, - "total_submitted": 13782, + "total_acs": 3264, + "total_submitted": 13794, "total_column_articles": 59, "frontend_question_id": "2286", "is_new_question": false @@ -19185,8 +19542,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 6301, - "total_submitted": 10927, + "total_acs": 6329, + "total_submitted": 10966, "total_column_articles": 89, "frontend_question_id": "2285", "is_new_question": false @@ -19206,9 +19563,9 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 6678, - "total_submitted": 11748, - "total_column_articles": 93, + "total_acs": 6702, + "total_submitted": 11780, + "total_column_articles": 94, "frontend_question_id": "2284", "is_new_question": false }, @@ -19227,9 +19584,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": 31891, - "total_submitted": 40436, - "total_column_articles": 384, + "total_acs": 31957, + "total_submitted": 40524, + "total_column_articles": 383, "frontend_question_id": "2283", "is_new_question": false }, @@ -19248,9 +19605,9 @@ "question__title": "Number of Times a Driver Was a Passenger", "question__title_slug": "number-of-times-a-driver-was-a-passenger", "question__hide": false, - "total_acs": 1227, - "total_submitted": 1737, - "total_column_articles": 14, + "total_acs": 1237, + "total_submitted": 1758, + "total_column_articles": 15, "frontend_question_id": "2238", "is_new_question": false }, @@ -19269,8 +19626,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 6233, - "total_submitted": 11060, + "total_acs": 6254, + "total_submitted": 11098, "total_column_articles": 98, "frontend_question_id": "2290", "is_new_question": false @@ -19290,9 +19647,9 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 6030, - "total_submitted": 27503, - "total_column_articles": 100, + "total_acs": 6059, + "total_submitted": 27655, + "total_column_articles": 99, "frontend_question_id": "2289", "is_new_question": false }, @@ -19311,8 +19668,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 8373, - "total_submitted": 26577, + "total_acs": 8396, + "total_submitted": 26623, "total_column_articles": 114, "frontend_question_id": "2288", "is_new_question": false @@ -19332,8 +19689,8 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 32177, - "total_submitted": 49459, + "total_acs": 32202, + "total_submitted": 49491, "total_column_articles": 425, "frontend_question_id": "2287", "is_new_question": false @@ -19353,8 +19710,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": 1138, - "total_submitted": 2285, + "total_acs": 1175, + "total_submitted": 2336, "total_column_articles": 9, "frontend_question_id": "2230", "is_new_question": false @@ -19374,9 +19731,9 @@ "question__title": "Users With Two Purchases Within Seven Days", "question__title_slug": "users-with-two-purchases-within-seven-days", "question__hide": false, - "total_acs": 1259, - "total_submitted": 2647, - "total_column_articles": 19, + "total_acs": 1282, + "total_submitted": 2684, + "total_column_articles": 20, "frontend_question_id": "2228", "is_new_question": false }, @@ -19395,9 +19752,9 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 344, - "total_submitted": 542, - "total_column_articles": 17, + "total_acs": 351, + "total_submitted": 552, + "total_column_articles": 18, "frontend_question_id": "2219", "is_new_question": false }, @@ -19416,8 +19773,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 4280, - "total_submitted": 15825, + "total_acs": 4340, + "total_submitted": 15992, "total_column_articles": 74, "frontend_question_id": "2281", "is_new_question": false @@ -19437,8 +19794,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": 9841, - "total_submitted": 43527, + "total_acs": 9865, + "total_submitted": 43580, "total_column_articles": 157, "frontend_question_id": "2280", "is_new_question": false @@ -19458,8 +19815,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": 13852, - "total_submitted": 21804, + "total_acs": 13929, + "total_submitted": 21942, "total_column_articles": 144, "frontend_question_id": "2279", "is_new_question": false @@ -19479,8 +19836,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 15445, - "total_submitted": 19172, + "total_acs": 15538, + "total_submitted": 19313, "total_column_articles": 139, "frontend_question_id": "2278", "is_new_question": false @@ -19500,9 +19857,9 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 6141, - "total_submitted": 13018, - "total_column_articles": 72, + "total_acs": 6289, + "total_submitted": 13285, + "total_column_articles": 73, "frontend_question_id": "2246", "is_new_question": false }, @@ -19521,8 +19878,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": 4749, - "total_submitted": 13056, + "total_acs": 4754, + "total_submitted": 13079, "total_column_articles": 98, "frontend_question_id": "2245", "is_new_question": false @@ -19542,8 +19899,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 11136, - "total_submitted": 19499, + "total_acs": 11199, + "total_submitted": 19614, "total_column_articles": 162, "frontend_question_id": "2244", "is_new_question": false @@ -19563,9 +19920,9 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 12522, - "total_submitted": 19757, - "total_column_articles": 170, + "total_acs": 12631, + "total_submitted": 19928, + "total_column_articles": 171, "frontend_question_id": "2243", "is_new_question": false }, @@ -19584,9 +19941,9 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 3905, - "total_submitted": 9942, - "total_column_articles": 42, + "total_acs": 3911, + "total_submitted": 9965, + "total_column_articles": 43, "frontend_question_id": "2272", "is_new_question": false }, @@ -19605,9 +19962,9 @@ "question__title": "Maximum White Tiles Covered by a Carpet", "question__title_slug": "maximum-white-tiles-covered-by-a-carpet", "question__hide": false, - "total_acs": 6162, - "total_submitted": 18708, - "total_column_articles": 101, + "total_acs": 6190, + "total_submitted": 18775, + "total_column_articles": 102, "frontend_question_id": "2271", "is_new_question": false }, @@ -19626,8 +19983,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 6948, - "total_submitted": 14960, + "total_acs": 6969, + "total_submitted": 15006, "total_column_articles": 76, "frontend_question_id": "2270", "is_new_question": false @@ -19647,8 +20004,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 6361, - "total_submitted": 17108, + "total_acs": 6367, + "total_submitted": 17114, "total_column_articles": 104, "frontend_question_id": "2276", "is_new_question": false @@ -19668,8 +20025,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": 8239, - "total_submitted": 13659, + "total_acs": 8251, + "total_submitted": 13685, "total_column_articles": 104, "frontend_question_id": "2275", "is_new_question": false @@ -19689,8 +20046,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 10137, - "total_submitted": 19272, + "total_acs": 10159, + "total_submitted": 19352, "total_column_articles": 111, "frontend_question_id": "2274", "is_new_question": false @@ -19710,8 +20067,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 704, - "total_submitted": 1266, + "total_acs": 706, + "total_submitted": 1268, "total_column_articles": 11, "frontend_question_id": "2214", "is_new_question": false @@ -19731,8 +20088,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 3270, - "total_submitted": 9546, + "total_acs": 3276, + "total_submitted": 9558, "total_column_articles": 46, "frontend_question_id": "2242", "is_new_question": false @@ -19752,9 +20109,9 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 6910, - "total_submitted": 19043, - "total_column_articles": 80, + "total_acs": 6962, + "total_submitted": 19170, + "total_column_articles": 81, "frontend_question_id": "2241", "is_new_question": false }, @@ -19773,9 +20130,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": 7272, - "total_submitted": 12593, - "total_column_articles": 83, + "total_acs": 7396, + "total_submitted": 12849, + "total_column_articles": 84, "frontend_question_id": "2240", "is_new_question": false }, @@ -19794,9 +20151,9 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 11881, - "total_submitted": 22253, - "total_column_articles": 141, + "total_acs": 12126, + "total_submitted": 22750, + "total_column_articles": 145, "frontend_question_id": "2239", "is_new_question": false }, @@ -19815,8 +20172,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": 8199, - "total_submitted": 21564, + "total_acs": 8215, + "total_submitted": 21595, "total_column_articles": 134, "frontend_question_id": "2267", "is_new_question": false @@ -19836,9 +20193,9 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 7883, - "total_submitted": 18048, - "total_column_articles": 138, + "total_acs": 7902, + "total_submitted": 18080, + "total_column_articles": 139, "frontend_question_id": "2266", "is_new_question": false }, @@ -19857,8 +20214,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": 11057, - "total_submitted": 13370, + "total_acs": 11099, + "total_submitted": 13426, "total_column_articles": 202, "frontend_question_id": "2265", "is_new_question": false @@ -19878,8 +20235,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": 13405, - "total_submitted": 21669, + "total_acs": 13444, + "total_submitted": 21733, "total_column_articles": 175, "frontend_question_id": "2264", "is_new_question": false @@ -19899,8 +20256,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": 12644, - "total_submitted": 18217, + "total_acs": 12706, + "total_submitted": 18337, "total_column_articles": 166, "frontend_question_id": "2224", "is_new_question": false @@ -19920,8 +20277,8 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 3145, - "total_submitted": 8692, + "total_acs": 3167, + "total_submitted": 8720, "total_column_articles": 89, "frontend_question_id": "2258", "is_new_question": false @@ -19941,8 +20298,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 5363, - "total_submitted": 10137, + "total_acs": 5378, + "total_submitted": 10177, "total_column_articles": 109, "frontend_question_id": "2257", "is_new_question": false @@ -19962,8 +20319,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 6618, - "total_submitted": 17957, + "total_acs": 6654, + "total_submitted": 18048, "total_column_articles": 81, "frontend_question_id": "2256", "is_new_question": false @@ -19983,8 +20340,8 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 10428, - "total_submitted": 13298, + "total_acs": 10483, + "total_submitted": 13386, "total_column_articles": 154, "frontend_question_id": "2255", "is_new_question": false @@ -20004,8 +20361,8 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 6858, - "total_submitted": 11890, + "total_acs": 6876, + "total_submitted": 11928, "total_column_articles": 121, "frontend_question_id": "2262", "is_new_question": false @@ -20025,8 +20382,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 8533, - "total_submitted": 16097, + "total_acs": 8552, + "total_submitted": 16146, "total_column_articles": 132, "frontend_question_id": "2261", "is_new_question": false @@ -20046,8 +20403,8 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 10880, - "total_submitted": 21244, + "total_acs": 10905, + "total_submitted": 21290, "total_column_articles": 153, "frontend_question_id": "2260", "is_new_question": false @@ -20067,9 +20424,9 @@ "question__title": "Remove Digit From Number to Maximize Result", "question__title_slug": "remove-digit-from-number-to-maximize-result", "question__hide": false, - "total_acs": 13196, - "total_submitted": 26335, - "total_column_articles": 158, + "total_acs": 13247, + "total_submitted": 26423, + "total_column_articles": 159, "frontend_question_id": "2259", "is_new_question": false }, @@ -20088,8 +20445,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": 1248, - "total_submitted": 2764, + "total_acs": 1269, + "total_submitted": 2798, "total_column_articles": 14, "frontend_question_id": "2205", "is_new_question": false @@ -20109,9 +20466,9 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 796, - "total_submitted": 1330, - "total_column_articles": 12, + "total_acs": 812, + "total_submitted": 1363, + "total_column_articles": 13, "frontend_question_id": "2199", "is_new_question": false }, @@ -20130,8 +20487,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 6881, - "total_submitted": 13978, + "total_acs": 6915, + "total_submitted": 14052, "total_column_articles": 133, "frontend_question_id": "2251", "is_new_question": false @@ -20151,8 +20508,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": 6779, - "total_submitted": 19368, + "total_acs": 6799, + "total_submitted": 19454, "total_column_articles": 119, "frontend_question_id": "2250", "is_new_question": false @@ -20172,8 +20529,8 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 9877, - "total_submitted": 18500, + "total_acs": 9912, + "total_submitted": 18559, "total_column_articles": 133, "frontend_question_id": "2249", "is_new_question": false @@ -20193,8 +20550,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 15788, - "total_submitted": 23529, + "total_acs": 15887, + "total_submitted": 23679, "total_column_articles": 198, "frontend_question_id": "2248", "is_new_question": false @@ -20214,8 +20571,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 3215, - "total_submitted": 11485, + "total_acs": 3239, + "total_submitted": 11535, "total_column_articles": 76, "frontend_question_id": "2234", "is_new_question": false @@ -20235,8 +20592,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 8920, - "total_submitted": 24274, + "total_acs": 8981, + "total_submitted": 24466, "total_column_articles": 172, "frontend_question_id": "2233", "is_new_question": false @@ -20256,8 +20613,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": 7474, - "total_submitted": 12186, + "total_acs": 7495, + "total_submitted": 12213, "total_column_articles": 135, "frontend_question_id": "2232", "is_new_question": false @@ -20277,8 +20634,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": 12011, - "total_submitted": 18651, + "total_acs": 12087, + "total_submitted": 18779, "total_column_articles": 198, "frontend_question_id": "2231", "is_new_question": false @@ -20298,8 +20655,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 3860, - "total_submitted": 9997, + "total_acs": 3877, + "total_submitted": 10030, "total_column_articles": 57, "frontend_question_id": "2223", "is_new_question": false @@ -20319,8 +20676,8 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 6698, - "total_submitted": 13400, + "total_acs": 6738, + "total_submitted": 13487, "total_column_articles": 142, "frontend_question_id": "2222", "is_new_question": false @@ -20340,9 +20697,9 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 9810, - "total_submitted": 12374, - "total_column_articles": 123, + "total_acs": 9851, + "total_submitted": 12449, + "total_column_articles": 122, "frontend_question_id": "2221", "is_new_question": false }, @@ -20361,9 +20718,9 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 10640, - "total_submitted": 12881, - "total_column_articles": 161, + "total_acs": 10682, + "total_submitted": 12929, + "total_column_articles": 160, "frontend_question_id": "2220", "is_new_question": false }, @@ -20403,8 +20760,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": 4404, - "total_submitted": 11655, + "total_acs": 4414, + "total_submitted": 11675, "total_column_articles": 72, "frontend_question_id": "2203", "is_new_question": false @@ -20424,8 +20781,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": 12508, - "total_submitted": 23232, + "total_acs": 12553, + "total_submitted": 23292, "total_column_articles": 150, "frontend_question_id": "2200", "is_new_question": false @@ -20445,8 +20802,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 3213, - "total_submitted": 7858, + "total_acs": 3220, + "total_submitted": 7881, "total_column_articles": 86, "frontend_question_id": "2213", "is_new_question": false @@ -20466,8 +20823,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 7608, - "total_submitted": 15840, + "total_acs": 7623, + "total_submitted": 15880, "total_column_articles": 166, "frontend_question_id": "2212", "is_new_question": false @@ -20487,8 +20844,8 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 10130, - "total_submitted": 24570, + "total_acs": 10161, + "total_submitted": 24659, "total_column_articles": 148, "frontend_question_id": "2211", "is_new_question": false @@ -20508,8 +20865,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": 12492, - "total_submitted": 21294, + "total_acs": 12531, + "total_submitted": 21362, "total_column_articles": 166, "frontend_question_id": "2210", "is_new_question": false @@ -20529,9 +20886,9 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 1192, - "total_submitted": 2153, - "total_column_articles": 12, + "total_acs": 1212, + "total_submitted": 2208, + "total_column_articles": 14, "frontend_question_id": "2175", "is_new_question": false }, @@ -20571,9 +20928,9 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 1346, - "total_submitted": 2412, - "total_column_articles": 28, + "total_acs": 1370, + "total_submitted": 2476, + "total_column_articles": 29, "frontend_question_id": "2173", "is_new_question": false }, @@ -20592,8 +20949,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": 9529, - "total_submitted": 16245, + "total_acs": 9566, + "total_submitted": 16316, "total_column_articles": 119, "frontend_question_id": "2190", "is_new_question": false @@ -20613,8 +20970,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": 4742, - "total_submitted": 12037, + "total_acs": 4750, + "total_submitted": 12062, "total_column_articles": 52, "frontend_question_id": "2209", "is_new_question": false @@ -20634,8 +20991,8 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 26242, - "total_submitted": 56975, + "total_acs": 26514, + "total_submitted": 57695, "total_column_articles": 273, "frontend_question_id": "2208", "is_new_question": false @@ -20655,8 +21012,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": 7073, - "total_submitted": 22300, + "total_acs": 7090, + "total_submitted": 22343, "total_column_articles": 108, "frontend_question_id": "2207", "is_new_question": false @@ -20676,8 +21033,8 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 13860, - "total_submitted": 18838, + "total_acs": 13943, + "total_submitted": 18966, "total_column_articles": 166, "frontend_question_id": "2206", "is_new_question": false @@ -20697,8 +21054,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 5759, - "total_submitted": 16587, + "total_acs": 5771, + "total_submitted": 16640, "total_column_articles": 92, "frontend_question_id": "2197", "is_new_question": false @@ -20718,9 +21075,9 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 9610, - "total_submitted": 13188, - "total_column_articles": 162, + "total_acs": 9647, + "total_submitted": 13229, + "total_column_articles": 163, "frontend_question_id": "2196", "is_new_question": false }, @@ -20739,8 +21096,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 11795, - "total_submitted": 48854, + "total_acs": 11840, + "total_submitted": 48975, "total_column_articles": 231, "frontend_question_id": "2195", "is_new_question": false @@ -20760,8 +21117,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": 14364, - "total_submitted": 17088, + "total_acs": 14396, + "total_submitted": 17140, "total_column_articles": 154, "frontend_question_id": "2194", "is_new_question": false @@ -20781,8 +21138,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 512, - "total_submitted": 810, + "total_acs": 516, + "total_submitted": 816, "total_column_articles": 16, "frontend_question_id": "2168", "is_new_question": false @@ -20802,8 +21159,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 1342, - "total_submitted": 2182, + "total_acs": 1373, + "total_submitted": 2218, "total_column_articles": 11, "frontend_question_id": "2159", "is_new_question": false @@ -20823,8 +21180,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 4958, - "total_submitted": 17479, + "total_acs": 4974, + "total_submitted": 17595, "total_column_articles": 60, "frontend_question_id": "2183", "is_new_question": false @@ -20844,8 +21201,8 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 7083, - "total_submitted": 14557, + "total_acs": 7111, + "total_submitted": 14598, "total_column_articles": 146, "frontend_question_id": "2182", "is_new_question": false @@ -20865,9 +21222,9 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 15248, - "total_submitted": 18002, - "total_column_articles": 216, + "total_acs": 15340, + "total_submitted": 18108, + "total_column_articles": 217, "frontend_question_id": "2181", "is_new_question": false }, @@ -20886,8 +21243,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 34741, - "total_submitted": 51168, + "total_acs": 34855, + "total_submitted": 51352, "total_column_articles": 384, "frontend_question_id": "2180", "is_new_question": false @@ -20908,8 +21265,8 @@ "question__title_slug": "amount-of-new-area-painted-each-day", "question__hide": false, "total_acs": 615, - "total_submitted": 1099, - "total_column_articles": 20, + "total_submitted": 1100, + "total_column_articles": 21, "frontend_question_id": "2158", "is_new_question": false }, @@ -20928,8 +21285,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": 686, - "total_submitted": 1531, + "total_acs": 690, + "total_submitted": 1539, "total_column_articles": 9, "frontend_question_id": "2153", "is_new_question": false @@ -20949,8 +21306,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 4520, - "total_submitted": 10203, + "total_acs": 4539, + "total_submitted": 10238, "total_column_articles": 69, "frontend_question_id": "2188", "is_new_question": false @@ -20970,8 +21327,8 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 13074, - "total_submitted": 45765, + "total_acs": 13147, + "total_submitted": 45950, "total_column_articles": 155, "frontend_question_id": "2187", "is_new_question": false @@ -20991,9 +21348,9 @@ "question__title": "Minimum Number of Steps to Make Two Strings Anagram II", "question__title_slug": "minimum-number-of-steps-to-make-two-strings-anagram-ii", "question__hide": false, - "total_acs": 10786, - "total_submitted": 14823, - "total_column_articles": 127, + "total_acs": 10821, + "total_submitted": 14880, + "total_column_articles": 128, "frontend_question_id": "2186", "is_new_question": false }, @@ -21012,9 +21369,9 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 37145, - "total_submitted": 45560, - "total_column_articles": 385, + "total_acs": 37205, + "total_submitted": 45635, + "total_column_articles": 386, "frontend_question_id": "2185", "is_new_question": false }, @@ -21033,8 +21390,8 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 4832, - "total_submitted": 9444, + "total_acs": 4855, + "total_submitted": 9481, "total_column_articles": 81, "frontend_question_id": "2172", "is_new_question": false @@ -21054,8 +21411,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 9461, - "total_submitted": 23347, + "total_acs": 9510, + "total_submitted": 23498, "total_column_articles": 184, "frontend_question_id": "2171", "is_new_question": false @@ -21075,8 +21432,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": 9599, - "total_submitted": 30724, + "total_acs": 9634, + "total_submitted": 30828, "total_column_articles": 163, "frontend_question_id": "2170", "is_new_question": false @@ -21096,8 +21453,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 17742, - "total_submitted": 24225, + "total_acs": 17814, + "total_submitted": 24325, "total_column_articles": 151, "frontend_question_id": "2169", "is_new_question": false @@ -21117,8 +21474,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": 448, - "total_submitted": 858, + "total_acs": 450, + "total_submitted": 861, "total_column_articles": 18, "frontend_question_id": "2152", "is_new_question": false @@ -21138,8 +21495,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": 4803, - "total_submitted": 9723, + "total_acs": 4815, + "total_submitted": 9745, "total_column_articles": 81, "frontend_question_id": "2167", "is_new_question": false @@ -21159,8 +21516,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 6333, - "total_submitted": 20552, + "total_acs": 6359, + "total_submitted": 20619, "total_column_articles": 161, "frontend_question_id": "2166", "is_new_question": false @@ -21180,8 +21537,8 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 8390, - "total_submitted": 15183, + "total_acs": 8429, + "total_submitted": 15238, "total_column_articles": 142, "frontend_question_id": "2165", "is_new_question": false @@ -21201,9 +21558,9 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 11435, - "total_submitted": 16742, - "total_column_articles": 147, + "total_acs": 11519, + "total_submitted": 16890, + "total_column_articles": 148, "frontend_question_id": "2164", "is_new_question": false }, @@ -21222,9 +21579,9 @@ "question__title": "Choose Numbers From Two Arrays in Range", "question__title_slug": "choose-numbers-from-two-arrays-in-range", "question__hide": false, - "total_acs": 242, - "total_submitted": 439, - "total_column_articles": 11, + "total_acs": 246, + "total_submitted": 444, + "total_column_articles": 12, "frontend_question_id": "2143", "is_new_question": false }, @@ -21243,8 +21600,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": 1421, - "total_submitted": 3022, + "total_acs": 1442, + "total_submitted": 3069, "total_column_articles": 23, "frontend_question_id": "2142", "is_new_question": false @@ -21264,8 +21621,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 3467, - "total_submitted": 9246, + "total_acs": 3477, + "total_submitted": 9265, "total_column_articles": 80, "frontend_question_id": "2179", "is_new_question": false @@ -21285,8 +21642,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 28426, - "total_submitted": 44342, + "total_acs": 28466, + "total_submitted": 44416, "total_column_articles": 328, "frontend_question_id": "2178", "is_new_question": false @@ -21306,9 +21663,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": 9186, - "total_submitted": 13120, - "total_column_articles": 99, + "total_acs": 9243, + "total_submitted": 13197, + "total_column_articles": 100, "frontend_question_id": "2177", "is_new_question": false }, @@ -21327,8 +21684,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": 10704, - "total_submitted": 13581, + "total_acs": 10773, + "total_submitted": 13665, "total_column_articles": 123, "frontend_question_id": "2176", "is_new_question": false @@ -21348,8 +21705,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 3658, - "total_submitted": 11645, + "total_acs": 3673, + "total_submitted": 11695, "total_column_articles": 80, "frontend_question_id": "2157", "is_new_question": false @@ -21369,9 +21726,9 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 5909, - "total_submitted": 23346, - "total_column_articles": 98, + "total_acs": 5930, + "total_submitted": 23403, + "total_column_articles": 99, "frontend_question_id": "2156", "is_new_question": false }, @@ -21390,8 +21747,8 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 16881, - "total_submitted": 22988, + "total_acs": 16977, + "total_submitted": 23137, "total_column_articles": 198, "frontend_question_id": "2154", "is_new_question": false @@ -21411,8 +21768,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": 426, - "total_submitted": 655, + "total_acs": 433, + "total_submitted": 665, "total_column_articles": 14, "frontend_question_id": "2137", "is_new_question": false @@ -21432,8 +21789,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 5389, - "total_submitted": 10675, + "total_acs": 5406, + "total_submitted": 10698, "total_column_articles": 93, "frontend_question_id": "2151", "is_new_question": false @@ -21453,8 +21810,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 12112, - "total_submitted": 15211, + "total_acs": 12149, + "total_submitted": 15255, "total_column_articles": 132, "frontend_question_id": "2149", "is_new_question": false @@ -21474,8 +21831,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": 9745, - "total_submitted": 16408, + "total_acs": 9763, + "total_submitted": 16480, "total_column_articles": 116, "frontend_question_id": "2150", "is_new_question": false @@ -21495,8 +21852,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": 13095, - "total_submitted": 22694, + "total_acs": 13142, + "total_submitted": 22775, "total_column_articles": 174, "frontend_question_id": "2148", "is_new_question": false @@ -21537,8 +21894,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": 3360, - "total_submitted": 6784, + "total_acs": 3373, + "total_submitted": 6802, "total_column_articles": 64, "frontend_question_id": "2163", "is_new_question": false @@ -21558,8 +21915,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 3535, - "total_submitted": 10261, + "total_acs": 3552, + "total_submitted": 10311, "total_column_articles": 82, "frontend_question_id": "2162", "is_new_question": false @@ -21579,8 +21936,8 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 8522, - "total_submitted": 10348, + "total_acs": 8635, + "total_submitted": 10469, "total_column_articles": 121, "frontend_question_id": "2161", "is_new_question": false @@ -21600,9 +21957,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": 14734, - "total_submitted": 17566, - "total_column_articles": 224, + "total_acs": 14829, + "total_submitted": 17675, + "total_column_articles": 225, "frontend_question_id": "2160", "is_new_question": false }, @@ -21621,8 +21978,8 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 5962, - "total_submitted": 14624, + "total_acs": 5983, + "total_submitted": 14670, "total_column_articles": 84, "frontend_question_id": "2141", "is_new_question": false @@ -21642,9 +21999,9 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 10194, - "total_submitted": 23105, - "total_column_articles": 167, + "total_acs": 10309, + "total_submitted": 23330, + "total_column_articles": 168, "frontend_question_id": "2140", "is_new_question": false }, @@ -21663,8 +22020,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": 8360, - "total_submitted": 12944, + "total_acs": 8381, + "total_submitted": 12972, "total_column_articles": 119, "frontend_question_id": "2155", "is_new_question": false @@ -21684,9 +22041,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": 10808, - "total_submitted": 16253, - "total_column_articles": 160, + "total_acs": 10858, + "total_submitted": 16346, + "total_column_articles": 162, "frontend_question_id": "2138", "is_new_question": false }, @@ -21705,9 +22062,9 @@ "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": 279, - "total_submitted": 520, - "total_column_articles": 6, + "total_acs": 280, + "total_submitted": 525, + "total_column_articles": 8, "frontend_question_id": "2123", "is_new_question": false }, @@ -21726,8 +22083,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": 302, - "total_submitted": 486, + "total_acs": 306, + "total_submitted": 490, "total_column_articles": 13, "frontend_question_id": "2113", "is_new_question": false @@ -21747,9 +22104,9 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 4608, - "total_submitted": 6969, - "total_column_articles": 79, + "total_acs": 4626, + "total_submitted": 6992, + "total_column_articles": 80, "frontend_question_id": "2136", "is_new_question": false }, @@ -21768,8 +22125,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": 5575, - "total_submitted": 15399, + "total_acs": 5585, + "total_submitted": 15427, "total_column_articles": 106, "frontend_question_id": "2135", "is_new_question": false @@ -21789,8 +22146,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": 7798, - "total_submitted": 15911, + "total_acs": 7846, + "total_submitted": 15973, "total_column_articles": 174, "frontend_question_id": "2134", "is_new_question": false @@ -21810,8 +22167,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": 11058, - "total_submitted": 19909, + "total_acs": 11087, + "total_submitted": 19952, "total_column_articles": 161, "frontend_question_id": "2133", "is_new_question": false @@ -21831,9 +22188,9 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 794, - "total_submitted": 1450, - "total_column_articles": 15, + "total_acs": 809, + "total_submitted": 1482, + "total_column_articles": 16, "frontend_question_id": "2118", "is_new_question": false }, @@ -21852,9 +22209,9 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 1481, - "total_submitted": 2155, - "total_column_articles": 24, + "total_acs": 1502, + "total_submitted": 2219, + "total_column_articles": 25, "frontend_question_id": "2112", "is_new_question": false }, @@ -21873,8 +22230,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": 4000, - "total_submitted": 9598, + "total_acs": 4024, + "total_submitted": 9636, "total_column_articles": 91, "frontend_question_id": "2147", "is_new_question": false @@ -21894,8 +22251,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": 4378, - "total_submitted": 10861, + "total_acs": 4395, + "total_submitted": 10898, "total_column_articles": 98, "frontend_question_id": "2146", "is_new_question": false @@ -21915,8 +22272,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 5624, - "total_submitted": 15635, + "total_acs": 5637, + "total_submitted": 15669, "total_column_articles": 119, "frontend_question_id": "2145", "is_new_question": false @@ -21936,9 +22293,9 @@ "question__title": "Minimum Cost of Buying Candies With Discount", "question__title_slug": "minimum-cost-of-buying-candies-with-discount", "question__hide": false, - "total_acs": 10807, - "total_submitted": 16188, - "total_column_articles": 177, + "total_acs": 10854, + "total_submitted": 16254, + "total_column_articles": 179, "frontend_question_id": "2144", "is_new_question": false }, @@ -21957,8 +22314,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": 491, - "total_submitted": 1246, + "total_acs": 497, + "total_submitted": 1252, "total_column_articles": 14, "frontend_question_id": "2107", "is_new_question": false @@ -21978,8 +22335,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": 3740, - "total_submitted": 10856, + "total_acs": 3763, + "total_submitted": 10932, "total_column_articles": 69, "frontend_question_id": "2127", "is_new_question": false @@ -21999,8 +22356,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 9111, - "total_submitted": 18571, + "total_acs": 9177, + "total_submitted": 18702, "total_column_articles": 114, "frontend_question_id": "2126", "is_new_question": false @@ -22020,9 +22377,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": 10291, - "total_submitted": 12373, - "total_column_articles": 132, + "total_acs": 10329, + "total_submitted": 12446, + "total_column_articles": 133, "frontend_question_id": "2125", "is_new_question": false }, @@ -22041,9 +22398,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": 13097, - "total_submitted": 18926, - "total_column_articles": 222, + "total_acs": 13157, + "total_submitted": 19018, + "total_column_articles": 223, "frontend_question_id": "2124", "is_new_question": false }, @@ -22062,8 +22419,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": 359, - "total_submitted": 1027, + "total_acs": 363, + "total_submitted": 1034, "total_column_articles": 12, "frontend_question_id": "2098", "is_new_question": false @@ -22083,8 +22440,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 4145, - "total_submitted": 9820, + "total_acs": 4156, + "total_submitted": 9851, "total_column_articles": 70, "frontend_question_id": "2122", "is_new_question": false @@ -22104,8 +22461,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 6914, - "total_submitted": 17816, + "total_acs": 6931, + "total_submitted": 17890, "total_column_articles": 162, "frontend_question_id": "2121", "is_new_question": false @@ -22125,8 +22482,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": 8238, - "total_submitted": 9988, + "total_acs": 8256, + "total_submitted": 10009, "total_column_articles": 124, "frontend_question_id": "2120", "is_new_question": false @@ -22146,8 +22503,8 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 18546, - "total_submitted": 25187, + "total_acs": 18721, + "total_submitted": 25433, "total_column_articles": 198, "frontend_question_id": "2119", "is_new_question": false @@ -22167,8 +22524,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": 10199, - "total_submitted": 23664, + "total_acs": 10229, + "total_submitted": 23736, "total_column_articles": 153, "frontend_question_id": "2131", "is_new_question": false @@ -22188,9 +22545,9 @@ "question__title": "Maximum Twin Sum of a Linked List", "question__title_slug": "maximum-twin-sum-of-a-linked-list", "question__hide": false, - "total_acs": 14503, - "total_submitted": 18175, - "total_column_articles": 205, + "total_acs": 15014, + "total_submitted": 18831, + "total_column_articles": 212, "frontend_question_id": "2130", "is_new_question": false }, @@ -22209,9 +22566,9 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 9490, - "total_submitted": 15597, - "total_column_articles": 159, + "total_acs": 9522, + "total_submitted": 15649, + "total_column_articles": 160, "frontend_question_id": "2129", "is_new_question": false }, @@ -22230,8 +22587,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": 4674, - "total_submitted": 13326, + "total_acs": 4686, + "total_submitted": 13342, "total_column_articles": 97, "frontend_question_id": "2111", "is_new_question": false @@ -22251,8 +22608,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": 10053, - "total_submitted": 19007, + "total_acs": 10095, + "total_submitted": 19073, "total_column_articles": 165, "frontend_question_id": "2110", "is_new_question": false @@ -22272,9 +22629,9 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 10255, - "total_submitted": 16636, - "total_column_articles": 120, + "total_acs": 10286, + "total_submitted": 16728, + "total_column_articles": 121, "frontend_question_id": "2109", "is_new_question": false }, @@ -22293,9 +22650,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": 14581, - "total_submitted": 18805, - "total_column_articles": 212, + "total_acs": 14636, + "total_submitted": 18881, + "total_column_articles": 213, "frontend_question_id": "2108", "is_new_question": false }, @@ -22314,8 +22671,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": 465, - "total_submitted": 789, + "total_acs": 474, + "total_submitted": 805, "total_column_articles": 20, "frontend_question_id": "2093", "is_new_question": false @@ -22335,9 +22692,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": 17531, - "total_submitted": 38861, - "total_column_articles": 202, + "total_acs": 17547, + "total_submitted": 38927, + "total_column_articles": 203, "frontend_question_id": "2106", "is_new_question": false }, @@ -22356,8 +22713,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 9131, - "total_submitted": 17231, + "total_acs": 9169, + "total_submitted": 17307, "total_column_articles": 142, "frontend_question_id": "2105", "is_new_question": false @@ -22377,9 +22734,9 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 41862, - "total_submitted": 66510, - "total_column_articles": 404, + "total_acs": 41976, + "total_submitted": 66706, + "total_column_articles": 405, "frontend_question_id": "2104", "is_new_question": false }, @@ -22398,8 +22755,8 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 11708, - "total_submitted": 14703, + "total_acs": 11749, + "total_submitted": 14747, "total_column_articles": 200, "frontend_question_id": "2103", "is_new_question": false @@ -22419,8 +22776,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": 504, - "total_submitted": 827, + "total_acs": 505, + "total_submitted": 829, "total_column_articles": 16, "frontend_question_id": "2083", "is_new_question": false @@ -22440,9 +22797,9 @@ "question__title": "Drop Type 1 Orders for Customers With Type 0 Orders", "question__title_slug": "drop-type-1-orders-for-customers-with-type-0-orders", "question__hide": false, - "total_acs": 2253, - "total_submitted": 2737, - "total_column_articles": 41, + "total_acs": 2265, + "total_submitted": 2751, + "total_column_articles": 42, "frontend_question_id": "2084", "is_new_question": false }, @@ -22461,9 +22818,9 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 3667, - "total_submitted": 4875, - "total_column_articles": 33, + "total_acs": 4300, + "total_submitted": 5773, + "total_column_articles": 37, "frontend_question_id": "2082", "is_new_question": false }, @@ -22482,9 +22839,9 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 1537, - "total_submitted": 5029, - "total_column_articles": 27, + "total_acs": 1546, + "total_submitted": 5059, + "total_column_articles": 28, "frontend_question_id": "2117", "is_new_question": false }, @@ -22503,8 +22860,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": 4212, - "total_submitted": 13121, + "total_acs": 4234, + "total_submitted": 13186, "total_column_articles": 75, "frontend_question_id": "2116", "is_new_question": false @@ -22524,9 +22881,9 @@ "question__title": "Find All Possible Recipes from Given Supplies", "question__title_slug": "find-all-possible-recipes-from-given-supplies", "question__hide": false, - "total_acs": 6202, - "total_submitted": 14542, - "total_column_articles": 121, + "total_acs": 6237, + "total_submitted": 14622, + "total_column_articles": 122, "frontend_question_id": "2115", "is_new_question": false }, @@ -22545,9 +22902,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": 19658, - "total_submitted": 23120, - "total_column_articles": 253, + "total_acs": 19771, + "total_submitted": 23265, + "total_column_articles": 259, "frontend_question_id": "2114", "is_new_question": false }, @@ -22566,9 +22923,9 @@ "question__title": "Paths in Maze That Lead to Same Room", "question__title_slug": "paths-in-maze-that-lead-to-same-room", "question__hide": false, - "total_acs": 255, - "total_submitted": 400, - "total_column_articles": 10, + "total_acs": 260, + "total_submitted": 406, + "total_column_articles": 11, "frontend_question_id": "2077", "is_new_question": false }, @@ -22587,9 +22944,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": 8003, - "total_submitted": 17932, - "total_column_articles": 213, + "total_acs": 8028, + "total_submitted": 17998, + "total_column_articles": 214, "frontend_question_id": "2096", "is_new_question": false }, @@ -22608,9 +22965,9 @@ "question__title": "Delete the Middle Node of a Linked List", "question__title_slug": "delete-the-middle-node-of-a-linked-list", "question__hide": false, - "total_acs": 21817, - "total_submitted": 38072, - "total_column_articles": 250, + "total_acs": 22574, + "total_submitted": 39310, + "total_column_articles": 255, "frontend_question_id": "2095", "is_new_question": false }, @@ -22629,9 +22986,9 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 12177, - "total_submitted": 21805, - "total_column_articles": 190, + "total_acs": 12214, + "total_submitted": 21869, + "total_column_articles": 191, "frontend_question_id": "2094", "is_new_question": false }, @@ -22650,9 +23007,9 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 2499, - "total_submitted": 3616, - "total_column_articles": 31, + "total_acs": 2522, + "total_submitted": 3646, + "total_column_articles": 32, "frontend_question_id": "2072", "is_new_question": false }, @@ -22671,8 +23028,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 6134, - "total_submitted": 21079, + "total_acs": 6160, + "total_submitted": 21123, "total_column_articles": 132, "frontend_question_id": "2092", "is_new_question": false @@ -22692,8 +23049,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 8611, - "total_submitted": 15194, + "total_acs": 8643, + "total_submitted": 15245, "total_column_articles": 150, "frontend_question_id": "2091", "is_new_question": false @@ -22713,8 +23070,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 8217, - "total_submitted": 21836, + "total_acs": 8241, + "total_submitted": 21894, "total_column_articles": 121, "frontend_question_id": "2090", "is_new_question": false @@ -22734,8 +23091,8 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 18929, - "total_submitted": 24144, + "total_acs": 19037, + "total_submitted": 24309, "total_column_articles": 250, "frontend_question_id": "2089", "is_new_question": false @@ -22755,8 +23112,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 260, - "total_submitted": 493, + "total_acs": 261, + "total_submitted": 494, "total_column_articles": 12, "frontend_question_id": "2067", "is_new_question": false @@ -22776,9 +23133,9 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 2092, - "total_submitted": 2653, - "total_column_articles": 29, + "total_acs": 2113, + "total_submitted": 2688, + "total_column_articles": 30, "frontend_question_id": "2066", "is_new_question": false }, @@ -22797,9 +23154,9 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 3423, - "total_submitted": 6138, - "total_column_articles": 87, + "total_acs": 3444, + "total_submitted": 6164, + "total_column_articles": 88, "frontend_question_id": "2102", "is_new_question": false }, @@ -22818,9 +23175,9 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 5997, - "total_submitted": 15148, - "total_column_articles": 105, + "total_acs": 6037, + "total_submitted": 15240, + "total_column_articles": 107, "frontend_question_id": "2101", "is_new_question": false }, @@ -22839,8 +23196,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": 34601, - "total_submitted": 71099, + "total_acs": 34644, + "total_submitted": 71193, "total_column_articles": 436, "frontend_question_id": "2100", "is_new_question": false @@ -22860,8 +23217,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": 9771, - "total_submitted": 20228, + "total_acs": 9800, + "total_submitted": 20285, "total_column_articles": 191, "frontend_question_id": "2099", "is_new_question": false @@ -22881,8 +23238,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 677, - "total_submitted": 1375, + "total_acs": 678, + "total_submitted": 1378, "total_column_articles": 27, "frontend_question_id": "2061", "is_new_question": false @@ -22902,8 +23259,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 3350, - "total_submitted": 7672, + "total_acs": 3355, + "total_submitted": 7679, "total_column_articles": 83, "frontend_question_id": "2081", "is_new_question": false @@ -22923,8 +23280,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 2980, - "total_submitted": 7806, + "total_acs": 2994, + "total_submitted": 7836, "total_column_articles": 56, "frontend_question_id": "2097", "is_new_question": false @@ -22944,8 +23301,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 2829, - "total_submitted": 9130, + "total_acs": 2844, + "total_submitted": 9159, "total_column_articles": 70, "frontend_question_id": "2132", "is_new_question": false @@ -22965,8 +23322,8 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 13379, - "total_submitted": 18541, + "total_acs": 13437, + "total_submitted": 18622, "total_column_articles": 213, "frontend_question_id": "2078", "is_new_question": false @@ -22986,8 +23343,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 3838, - "total_submitted": 7493, + "total_acs": 3853, + "total_submitted": 7517, "total_column_articles": 89, "frontend_question_id": "2076", "is_new_question": false @@ -23007,8 +23364,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 4757, - "total_submitted": 10086, + "total_acs": 4768, + "total_submitted": 10108, "total_column_articles": 88, "frontend_question_id": "2075", "is_new_question": false @@ -23028,8 +23385,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 6798, - "total_submitted": 14825, + "total_acs": 6819, + "total_submitted": 14857, "total_column_articles": 161, "frontend_question_id": "2074", "is_new_question": false @@ -23049,9 +23406,9 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 13907, - "total_submitted": 22487, - "total_column_articles": 224, + "total_acs": 14017, + "total_submitted": 22649, + "total_column_articles": 226, "frontend_question_id": "2073", "is_new_question": false }, @@ -23070,9 +23427,9 @@ "question__title": "The Category of Each Member in the Store", "question__title_slug": "the-category-of-each-member-in-the-store", "question__hide": false, - "total_acs": 1580, - "total_submitted": 2410, - "total_column_articles": 22, + "total_acs": 1599, + "total_submitted": 2430, + "total_column_articles": 23, "frontend_question_id": "2051", "is_new_question": false }, @@ -23091,8 +23448,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 2552, - "total_submitted": 4015, + "total_acs": 2565, + "total_submitted": 4035, "total_column_articles": 57, "frontend_question_id": "2088", "is_new_question": false @@ -23112,8 +23469,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": 4170, - "total_submitted": 8280, + "total_acs": 4196, + "total_submitted": 8343, "total_column_articles": 88, "frontend_question_id": "2087", "is_new_question": false @@ -23133,8 +23490,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": 5871, - "total_submitted": 12519, + "total_acs": 5902, + "total_submitted": 12598, "total_column_articles": 111, "frontend_question_id": "2086", "is_new_question": false @@ -23154,8 +23511,8 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 9379, - "total_submitted": 13149, + "total_acs": 9402, + "total_submitted": 13172, "total_column_articles": 148, "frontend_question_id": "2085", "is_new_question": false @@ -23175,8 +23532,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 3158, - "total_submitted": 5823, + "total_acs": 3179, + "total_submitted": 5853, "total_column_articles": 68, "frontend_question_id": "2065", "is_new_question": false @@ -23196,8 +23553,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": 6259, - "total_submitted": 13799, + "total_acs": 6280, + "total_submitted": 13839, "total_column_articles": 106, "frontend_question_id": "2064", "is_new_question": false @@ -23217,8 +23574,8 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 7015, - "total_submitted": 13537, + "total_acs": 7042, + "total_submitted": 13578, "total_column_articles": 137, "frontend_question_id": "2063", "is_new_question": false @@ -23238,8 +23595,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 9214, - "total_submitted": 14721, + "total_acs": 9232, + "total_submitted": 14744, "total_column_articles": 160, "frontend_question_id": "2062", "is_new_question": false @@ -23259,9 +23616,9 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 2142, - "total_submitted": 2823, - "total_column_articles": 30, + "total_acs": 2157, + "total_submitted": 2841, + "total_column_articles": 32, "frontend_question_id": "2041", "is_new_question": false }, @@ -23280,8 +23637,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": 1640, - "total_submitted": 4042, + "total_acs": 1653, + "total_submitted": 4101, "total_column_articles": 27, "frontend_question_id": "2060", "is_new_question": false @@ -23301,8 +23658,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 7180, - "total_submitted": 14876, + "total_acs": 7197, + "total_submitted": 14924, "total_column_articles": 123, "frontend_question_id": "2059", "is_new_question": false @@ -23322,8 +23679,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": 8310, - "total_submitted": 14685, + "total_acs": 8344, + "total_submitted": 14738, "total_column_articles": 124, "frontend_question_id": "2058", "is_new_question": false @@ -23343,8 +23700,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 13089, - "total_submitted": 17394, + "total_acs": 13140, + "total_submitted": 17464, "total_column_articles": 124, "frontend_question_id": "2057", "is_new_question": false @@ -23364,8 +23721,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": 3469, - "total_submitted": 11553, + "total_acs": 3481, + "total_submitted": 11588, "total_column_articles": 51, "frontend_question_id": "2071", "is_new_question": false @@ -23385,8 +23742,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 4474, - "total_submitted": 9882, + "total_acs": 4492, + "total_submitted": 9930, "total_column_articles": 119, "frontend_question_id": "2070", "is_new_question": false @@ -23406,8 +23763,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 4961, - "total_submitted": 22190, + "total_acs": 4976, + "total_submitted": 22236, "total_column_articles": 115, "frontend_question_id": "2069", "is_new_question": false @@ -23427,8 +23784,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": 10000, - "total_submitted": 14321, + "total_acs": 10041, + "total_submitted": 14389, "total_column_articles": 162, "frontend_question_id": "2068", "is_new_question": false @@ -23448,8 +23805,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 15636, - "total_submitted": 24267, + "total_acs": 15709, + "total_submitted": 24413, "total_column_articles": 214, "frontend_question_id": "2050", "is_new_question": false @@ -23469,8 +23826,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 27860, - "total_submitted": 53795, + "total_acs": 27880, + "total_submitted": 53844, "total_column_articles": 319, "frontend_question_id": "2049", "is_new_question": false @@ -23490,8 +23847,8 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 6252, - "total_submitted": 13690, + "total_acs": 6276, + "total_submitted": 13725, "total_column_articles": 123, "frontend_question_id": "2048", "is_new_question": false @@ -23511,8 +23868,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": 28701, - "total_submitted": 74411, + "total_acs": 28729, + "total_submitted": 74542, "total_column_articles": 441, "frontend_question_id": "2047", "is_new_question": false @@ -23532,8 +23889,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 3659, - "total_submitted": 4566, + "total_acs": 3681, + "total_submitted": 4594, "total_column_articles": 34, "frontend_question_id": "2026", "is_new_question": false @@ -23553,8 +23910,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 16979, - "total_submitted": 31872, + "total_acs": 16989, + "total_submitted": 31898, "total_column_articles": 166, "frontend_question_id": "2045", "is_new_question": false @@ -23574,8 +23931,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": 36319, - "total_submitted": 44412, + "total_acs": 36348, + "total_submitted": 44452, "total_column_articles": 402, "frontend_question_id": "2044", "is_new_question": false @@ -23595,8 +23952,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 36545, - "total_submitted": 55518, + "total_acs": 36590, + "total_submitted": 55581, "total_column_articles": 313, "frontend_question_id": "2043", "is_new_question": false @@ -23616,8 +23973,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": 36709, - "total_submitted": 51050, + "total_acs": 36743, + "total_submitted": 51087, "total_column_articles": 506, "frontend_question_id": "2042", "is_new_question": false @@ -23637,8 +23994,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": 2004, - "total_submitted": 2837, + "total_acs": 2021, + "total_submitted": 2866, "total_column_articles": 34, "frontend_question_id": "2020", "is_new_question": false @@ -23658,8 +24015,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": 1157, - "total_submitted": 1963, + "total_acs": 1163, + "total_submitted": 1975, "total_column_articles": 24, "frontend_question_id": "2056", "is_new_question": false @@ -23679,8 +24036,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 34417, - "total_submitted": 79222, + "total_acs": 34448, + "total_submitted": 79322, "total_column_articles": 439, "frontend_question_id": "2055", "is_new_question": false @@ -23700,8 +24057,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 4801, - "total_submitted": 12486, + "total_acs": 4825, + "total_submitted": 12532, "total_column_articles": 92, "frontend_question_id": "2054", "is_new_question": false @@ -23721,9 +24078,9 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 10407, - "total_submitted": 14625, - "total_column_articles": 177, + "total_acs": 10465, + "total_submitted": 14697, + "total_column_articles": 178, "frontend_question_id": "2053", "is_new_question": false }, @@ -23742,8 +24099,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": 4052, - "total_submitted": 11607, + "total_acs": 4071, + "total_submitted": 11668, "total_column_articles": 73, "frontend_question_id": "2035", "is_new_question": false @@ -23763,9 +24120,9 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 24384, - "total_submitted": 53259, - "total_column_articles": 244, + "total_acs": 24408, + "total_submitted": 53333, + "total_column_articles": 245, "frontend_question_id": "2034", "is_new_question": false }, @@ -23784,8 +24141,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": 6686, - "total_submitted": 15400, + "total_acs": 6720, + "total_submitted": 15486, "total_column_articles": 124, "frontend_question_id": "2033", "is_new_question": false @@ -23805,8 +24162,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 32639, - "total_submitted": 44713, + "total_acs": 32686, + "total_submitted": 44775, "total_column_articles": 415, "frontend_question_id": "2032", "is_new_question": false @@ -23826,9 +24183,9 @@ "question__title": "The Number of Seniors and Juniors to Join the Company II", "question__title_slug": "the-number-of-seniors-and-juniors-to-join-the-company-ii", "question__hide": false, - "total_acs": 2027, - "total_submitted": 3293, - "total_column_articles": 45, + "total_acs": 2066, + "total_submitted": 3340, + "total_column_articles": 46, "frontend_question_id": "2010", "is_new_question": false }, @@ -23847,9 +24204,9 @@ "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": 2306, - "total_submitted": 6312, - "total_column_articles": 54, + "total_acs": 2316, + "total_submitted": 6339, + "total_column_articles": 57, "frontend_question_id": "2030", "is_new_question": false }, @@ -23868,8 +24225,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 20324, - "total_submitted": 43315, + "total_acs": 20341, + "total_submitted": 43361, "total_column_articles": 199, "frontend_question_id": "2029", "is_new_question": false @@ -23889,9 +24246,9 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 35031, - "total_submitted": 69137, - "total_column_articles": 401, + "total_acs": 35058, + "total_submitted": 69177, + "total_column_articles": 402, "frontend_question_id": "2028", "is_new_question": false }, @@ -23910,8 +24267,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 28189, - "total_submitted": 42108, + "total_acs": 28220, + "total_submitted": 42150, "total_column_articles": 308, "frontend_question_id": "2027", "is_new_question": false @@ -23931,8 +24288,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 184, - "total_submitted": 360, + "total_acs": 185, + "total_submitted": 363, "total_column_articles": 11, "frontend_question_id": "2005", "is_new_question": false @@ -23952,9 +24309,9 @@ "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": 1410, - "total_submitted": 3337, - "total_column_articles": 33, + "total_acs": 1436, + "total_submitted": 3398, + "total_column_articles": 35, "frontend_question_id": "2004", "is_new_question": false }, @@ -23973,8 +24330,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": 20612, - "total_submitted": 36902, + "total_acs": 20622, + "total_submitted": 36920, "total_column_articles": 181, "frontend_question_id": "2039", "is_new_question": false @@ -23994,8 +24351,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": 2101, - "total_submitted": 6235, + "total_acs": 2112, + "total_submitted": 6256, "total_column_articles": 36, "frontend_question_id": "2040", "is_new_question": false @@ -24015,9 +24372,9 @@ "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": 34969, - "total_submitted": 55187, - "total_column_articles": 453, + "total_acs": 34986, + "total_submitted": 55223, + "total_column_articles": 452, "frontend_question_id": "2038", "is_new_question": false }, @@ -24036,8 +24393,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": 23828, - "total_submitted": 28043, + "total_acs": 23880, + "total_submitted": 28097, "total_column_articles": 263, "frontend_question_id": "2037", "is_new_question": false @@ -24057,8 +24414,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": 1936, - "total_submitted": 5135, + "total_acs": 1943, + "total_submitted": 5144, "total_column_articles": 45, "frontend_question_id": "2019", "is_new_question": false @@ -24078,8 +24435,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": 3248, - "total_submitted": 7659, + "total_acs": 3253, + "total_submitted": 7693, "total_column_articles": 70, "frontend_question_id": "2018", "is_new_question": false @@ -24099,8 +24456,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 5851, - "total_submitted": 15109, + "total_acs": 5868, + "total_submitted": 15139, "total_column_articles": 128, "frontend_question_id": "2017", "is_new_question": false @@ -24120,8 +24477,8 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 45270, - "total_submitted": 75828, + "total_acs": 45322, + "total_submitted": 75909, "total_column_articles": 508, "frontend_question_id": "2016", "is_new_question": false @@ -24141,9 +24498,9 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 2493, - "total_submitted": 5273, - "total_column_articles": 28, + "total_acs": 2506, + "total_submitted": 5295, + "total_column_articles": 29, "frontend_question_id": "1990", "is_new_question": false }, @@ -24162,8 +24519,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": 369, - "total_submitted": 646, + "total_acs": 370, + "total_submitted": 647, "total_column_articles": 16, "frontend_question_id": "2015", "is_new_question": false @@ -24183,8 +24540,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": 319, - "total_submitted": 688, + "total_acs": 321, + "total_submitted": 692, "total_column_articles": 14, "frontend_question_id": "1999", "is_new_question": false @@ -24204,8 +24561,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 2389, - "total_submitted": 4383, + "total_acs": 2395, + "total_submitted": 4400, "total_column_articles": 31, "frontend_question_id": "2014", "is_new_question": false @@ -24225,8 +24582,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 21781, - "total_submitted": 38432, + "total_acs": 21803, + "total_submitted": 38473, "total_column_articles": 245, "frontend_question_id": "2013", "is_new_question": false @@ -24246,8 +24603,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 6188, - "total_submitted": 15796, + "total_acs": 6213, + "total_submitted": 15843, "total_column_articles": 105, "frontend_question_id": "2012", "is_new_question": false @@ -24267,8 +24624,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": 47572, - "total_submitted": 54879, + "total_acs": 47802, + "total_submitted": 55160, "total_column_articles": 415, "frontend_question_id": "2011", "is_new_question": false @@ -24288,8 +24645,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 4902, - "total_submitted": 7572, + "total_acs": 4916, + "total_submitted": 7601, "total_column_articles": 60, "frontend_question_id": "1988", "is_new_question": false @@ -24309,8 +24666,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": 2499, - "total_submitted": 8186, + "total_acs": 2511, + "total_submitted": 8265, "total_column_articles": 63, "frontend_question_id": "2025", "is_new_question": false @@ -24330,9 +24687,9 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 38849, - "total_submitted": 67774, - "total_column_articles": 444, + "total_acs": 38922, + "total_submitted": 67879, + "total_column_articles": 445, "frontend_question_id": "2024", "is_new_question": false }, @@ -24351,8 +24708,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": 6658, - "total_submitted": 8980, + "total_acs": 6707, + "total_submitted": 9048, "total_column_articles": 105, "frontend_question_id": "2023", "is_new_question": false @@ -24372,8 +24729,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 41008, - "total_submitted": 62662, + "total_acs": 41083, + "total_submitted": 62769, "total_column_articles": 490, "frontend_question_id": "2022", "is_new_question": false @@ -24393,8 +24750,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": 3198, - "total_submitted": 7300, + "total_acs": 3210, + "total_submitted": 7315, "total_column_articles": 60, "frontend_question_id": "2003", "is_new_question": false @@ -24414,8 +24771,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": 5991, - "total_submitted": 9901, + "total_acs": 6014, + "total_submitted": 9935, "total_column_articles": 125, "frontend_question_id": "2002", "is_new_question": false @@ -24435,8 +24792,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 8482, - "total_submitted": 21721, + "total_acs": 8496, + "total_submitted": 21759, "total_column_articles": 168, "frontend_question_id": "2001", "is_new_question": false @@ -24456,8 +24813,8 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 38883, - "total_submitted": 50268, + "total_acs": 38955, + "total_submitted": 50361, "total_column_articles": 484, "frontend_question_id": "2000", "is_new_question": false @@ -24477,9 +24834,9 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 7187, - "total_submitted": 14523, - "total_column_articles": 60, + "total_acs": 7681, + "total_submitted": 15641, + "total_column_articles": 64, "frontend_question_id": "1978", "is_new_question": false }, @@ -24498,8 +24855,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": 536, - "total_submitted": 889, + "total_acs": 544, + "total_submitted": 903, "total_column_articles": 21, "frontend_question_id": "1973", "is_new_question": false @@ -24519,8 +24876,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 3092, - "total_submitted": 6727, + "total_acs": 3098, + "total_submitted": 6746, "total_column_articles": 59, "frontend_question_id": "1998", "is_new_question": false @@ -24540,8 +24897,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": 3598, - "total_submitted": 10209, + "total_acs": 3605, + "total_submitted": 10220, "total_column_articles": 54, "frontend_question_id": "1997", "is_new_question": false @@ -24561,8 +24918,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": 29722, - "total_submitted": 71568, + "total_acs": 29766, + "total_submitted": 71647, "total_column_articles": 308, "frontend_question_id": "1996", "is_new_question": false @@ -24582,8 +24939,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 37722, - "total_submitted": 56935, + "total_acs": 37786, + "total_submitted": 57038, "total_column_articles": 291, "frontend_question_id": "1995", "is_new_question": false @@ -24603,9 +24960,9 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 29340, - "total_submitted": 54427, - "total_column_articles": 322, + "total_acs": 29550, + "total_submitted": 54850, + "total_column_articles": 323, "frontend_question_id": "1971", "is_new_question": false }, @@ -24624,9 +24981,9 @@ "question__title": "First and Last Call On the Same Day", "question__title_slug": "first-and-last-call-on-the-same-day", "question__hide": false, - "total_acs": 2801, - "total_submitted": 6603, - "total_column_articles": 45, + "total_acs": 2808, + "total_submitted": 6647, + "total_column_articles": 46, "frontend_question_id": "1972", "is_new_question": false }, @@ -24645,8 +25002,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": 3121, - "total_submitted": 7213, + "total_acs": 3132, + "total_submitted": 7235, "total_column_articles": 77, "frontend_question_id": "2009", "is_new_question": false @@ -24666,8 +25023,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 6253, - "total_submitted": 13552, + "total_acs": 6383, + "total_submitted": 13752, "total_column_articles": 105, "frontend_question_id": "2008", "is_new_question": false @@ -24687,8 +25044,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 6943, - "total_submitted": 20530, + "total_acs": 6967, + "total_submitted": 20620, "total_column_articles": 128, "frontend_question_id": "2007", "is_new_question": false @@ -24708,8 +25065,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": 54348, - "total_submitted": 64811, + "total_acs": 54492, + "total_submitted": 64978, "total_column_articles": 531, "frontend_question_id": "2006", "is_new_question": false @@ -24729,8 +25086,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 2501, - "total_submitted": 4988, + "total_acs": 2508, + "total_submitted": 4999, "total_column_articles": 43, "frontend_question_id": "1987", "is_new_question": false @@ -24750,8 +25107,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": 6933, - "total_submitted": 20730, + "total_acs": 6955, + "total_submitted": 20766, "total_column_articles": 121, "frontend_question_id": "1986", "is_new_question": false @@ -24771,8 +25128,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": 11459, - "total_submitted": 27217, + "total_acs": 11496, + "total_submitted": 27298, "total_column_articles": 154, "frontend_question_id": "1985", "is_new_question": false @@ -24792,8 +25149,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": 46959, - "total_submitted": 76049, + "total_acs": 47071, + "total_submitted": 76215, "total_column_articles": 555, "frontend_question_id": "1984", "is_new_question": false @@ -24813,8 +25170,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": 256, - "total_submitted": 400, + "total_acs": 258, + "total_submitted": 402, "total_column_articles": 10, "frontend_question_id": "1966", "is_new_question": false @@ -24834,9 +25191,9 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 46764, - "total_submitted": 65858, - "total_column_articles": 302, + "total_acs": 46968, + "total_submitted": 66175, + "total_column_articles": 304, "frontend_question_id": "1965", "is_new_question": false }, @@ -24855,8 +25212,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 1556, - "total_submitted": 3210, + "total_acs": 1559, + "total_submitted": 3214, "total_column_articles": 28, "frontend_question_id": "1982", "is_new_question": false @@ -24876,8 +25233,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": 7405, - "total_submitted": 22225, + "total_acs": 7427, + "total_submitted": 22296, "total_column_articles": 108, "frontend_question_id": "1981", "is_new_question": false @@ -24897,8 +25254,8 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 8894, - "total_submitted": 14871, + "total_acs": 8908, + "total_submitted": 14889, "total_column_articles": 150, "frontend_question_id": "1980", "is_new_question": false @@ -24918,9 +25275,9 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 22304, - "total_submitted": 28960, - "total_column_articles": 275, + "total_acs": 22451, + "total_submitted": 29150, + "total_column_articles": 276, "frontend_question_id": "1979", "is_new_question": false }, @@ -24939,8 +25296,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 16621, - "total_submitted": 29561, + "total_acs": 16629, + "total_submitted": 29580, "total_column_articles": 190, "frontend_question_id": "1994", "is_new_question": false @@ -24960,8 +25317,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 3410, - "total_submitted": 8505, + "total_acs": 3418, + "total_submitted": 8525, "total_column_articles": 69, "frontend_question_id": "1993", "is_new_question": false @@ -24981,9 +25338,9 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 5851, - "total_submitted": 9539, - "total_column_articles": 117, + "total_acs": 5936, + "total_submitted": 9669, + "total_column_articles": 121, "frontend_question_id": "1992", "is_new_question": false }, @@ -25002,9 +25359,9 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 22546, - "total_submitted": 35380, - "total_column_articles": 311, + "total_acs": 22776, + "total_submitted": 35746, + "total_column_articles": 312, "frontend_question_id": "1991", "is_new_question": false }, @@ -25023,8 +25380,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": 3716, - "total_submitted": 7337, + "total_acs": 3728, + "total_submitted": 7355, "total_column_articles": 73, "frontend_question_id": "1970", "is_new_question": false @@ -25044,8 +25401,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": 3954, - "total_submitted": 13177, + "total_acs": 3970, + "total_submitted": 13225, "total_column_articles": 57, "frontend_question_id": "1969", "is_new_question": false @@ -25065,8 +25422,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": 12153, - "total_submitted": 15311, + "total_acs": 12208, + "total_submitted": 15375, "total_column_articles": 162, "frontend_question_id": "1967", "is_new_question": false @@ -25086,9 +25443,9 @@ "question__title": "All the Pairs With the Maximum Number of Common Followers", "question__title_slug": "all-the-pairs-with-the-maximum-number-of-common-followers", "question__hide": false, - "total_acs": 4119, - "total_submitted": 6302, - "total_column_articles": 53, + "total_acs": 4134, + "total_submitted": 6320, + "total_column_articles": 54, "frontend_question_id": "1951", "is_new_question": false }, @@ -25107,9 +25464,9 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 3752, - "total_submitted": 7160, - "total_column_articles": 48, + "total_acs": 3772, + "total_submitted": 7203, + "total_column_articles": 49, "frontend_question_id": "1949", "is_new_question": false }, @@ -25128,8 +25485,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": 5489, - "total_submitted": 12493, + "total_acs": 5538, + "total_submitted": 12606, "total_column_articles": 75, "frontend_question_id": "1964", "is_new_question": false @@ -25149,9 +25506,9 @@ "question__title": "Minimum Number of Swaps to Make the String Balanced", "question__title_slug": "minimum-number-of-swaps-to-make-the-string-balanced", "question__hide": false, - "total_acs": 7047, - "total_submitted": 10882, - "total_column_articles": 85, + "total_acs": 7075, + "total_submitted": 10920, + "total_column_articles": 88, "frontend_question_id": "1963", "is_new_question": false }, @@ -25170,9 +25527,9 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 8481, - "total_submitted": 18105, - "total_column_articles": 106, + "total_acs": 8507, + "total_submitted": 18142, + "total_column_articles": 108, "frontend_question_id": "1962", "is_new_question": false }, @@ -25191,9 +25548,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": 12982, - "total_submitted": 24661, - "total_column_articles": 154, + "total_acs": 13029, + "total_submitted": 24738, + "total_column_articles": 155, "frontend_question_id": "1961", "is_new_question": false }, @@ -25212,9 +25569,9 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 2906, - "total_submitted": 4851, - "total_column_articles": 28, + "total_acs": 2921, + "total_submitted": 4876, + "total_column_articles": 29, "frontend_question_id": "1939", "is_new_question": false }, @@ -25233,8 +25590,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 1666, - "total_submitted": 5531, + "total_acs": 1669, + "total_submitted": 5547, "total_column_articles": 28, "frontend_question_id": "1977", "is_new_question": false @@ -25254,8 +25611,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": 6343, - "total_submitted": 17319, + "total_acs": 6469, + "total_submitted": 17503, "total_column_articles": 108, "frontend_question_id": "1976", "is_new_question": false @@ -25275,8 +25632,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 5261, - "total_submitted": 12598, + "total_acs": 5277, + "total_submitted": 12628, "total_column_articles": 78, "frontend_question_id": "1975", "is_new_question": false @@ -25296,8 +25653,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": 9885, - "total_submitted": 13880, + "total_acs": 9934, + "total_submitted": 13946, "total_column_articles": 148, "frontend_question_id": "1974", "is_new_question": false @@ -25317,9 +25674,9 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 8509, - "total_submitted": 13198, - "total_column_articles": 96, + "total_acs": 9267, + "total_submitted": 14540, + "total_column_articles": 101, "frontend_question_id": "1934", "is_new_question": false }, @@ -25338,8 +25695,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 3970, - "total_submitted": 7532, + "total_acs": 3984, + "total_submitted": 7562, "total_column_articles": 61, "frontend_question_id": "1955", "is_new_question": false @@ -25359,8 +25716,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": 6646, - "total_submitted": 16852, + "total_acs": 6671, + "total_submitted": 16886, "total_column_articles": 97, "frontend_question_id": "1968", "is_new_question": false @@ -25380,8 +25737,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": 6689, - "total_submitted": 17898, + "total_acs": 6705, + "total_submitted": 17936, "total_column_articles": 116, "frontend_question_id": "1953", "is_new_question": false @@ -25401,8 +25758,8 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 14783, - "total_submitted": 26949, + "total_acs": 14903, + "total_submitted": 27164, "total_column_articles": 183, "frontend_question_id": "1952", "is_new_question": false @@ -25443,8 +25800,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": 2574, - "total_submitted": 5573, + "total_acs": 2581, + "total_submitted": 5583, "total_column_articles": 52, "frontend_question_id": "1959", "is_new_question": false @@ -25464,8 +25821,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 3693, - "total_submitted": 8223, + "total_acs": 3710, + "total_submitted": 8260, "total_column_articles": 67, "frontend_question_id": "1958", "is_new_question": false @@ -25485,8 +25842,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 1724, - "total_submitted": 3170, + "total_acs": 1734, + "total_submitted": 3183, "total_column_articles": 29, "frontend_question_id": "1948", "is_new_question": false @@ -25506,9 +25863,9 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 6832, - "total_submitted": 11749, - "total_column_articles": 130, + "total_acs": 6853, + "total_submitted": 11775, + "total_column_articles": 131, "frontend_question_id": "1947", "is_new_question": false }, @@ -25527,8 +25884,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 7717, - "total_submitted": 23867, + "total_acs": 7748, + "total_submitted": 23938, "total_column_articles": 114, "frontend_question_id": "1946", "is_new_question": false @@ -25548,8 +25905,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": 31471, - "total_submitted": 44708, + "total_acs": 31499, + "total_submitted": 44756, "total_column_articles": 384, "frontend_question_id": "1945", "is_new_question": false @@ -25569,8 +25926,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 639, - "total_submitted": 1032, + "total_acs": 643, + "total_submitted": 1037, "total_column_articles": 23, "frontend_question_id": "2021", "is_new_question": false @@ -25632,8 +25989,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": 454, - "total_submitted": 915, + "total_acs": 457, + "total_submitted": 922, "total_column_articles": 17, "frontend_question_id": "1950", "is_new_question": false @@ -25653,8 +26010,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 930, - "total_submitted": 1257, + "total_acs": 932, + "total_submitted": 1259, "total_column_articles": 40, "frontend_question_id": "1940", "is_new_question": false @@ -25674,8 +26031,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": 1122, - "total_submitted": 2271, + "total_acs": 1124, + "total_submitted": 2273, "total_column_articles": 42, "frontend_question_id": "1933", "is_new_question": false @@ -25695,8 +26052,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 743, - "total_submitted": 1547, + "total_acs": 747, + "total_submitted": 1552, "total_column_articles": 11, "frontend_question_id": "1918", "is_new_question": false @@ -25716,8 +26073,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 1886, - "total_submitted": 4670, + "total_acs": 1896, + "total_submitted": 4686, "total_column_articles": 52, "frontend_question_id": "1938", "is_new_question": false @@ -25737,8 +26094,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 5216, - "total_submitted": 17949, + "total_acs": 5236, + "total_submitted": 17985, "total_column_articles": 91, "frontend_question_id": "1937", "is_new_question": false @@ -25758,8 +26115,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 8645, - "total_submitted": 18643, + "total_acs": 8674, + "total_submitted": 18692, "total_column_articles": 119, "frontend_question_id": "1936", "is_new_question": false @@ -25779,9 +26136,9 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 211, - "total_submitted": 465, - "total_column_articles": 6, + "total_acs": 212, + "total_submitted": 467, + "total_column_articles": 7, "frontend_question_id": "2307", "is_new_question": false }, @@ -25800,9 +26157,9 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 1969, - "total_submitted": 4540, - "total_column_articles": 39, + "total_acs": 1985, + "total_submitted": 4597, + "total_column_articles": 40, "frontend_question_id": "1919", "is_new_question": false }, @@ -25821,8 +26178,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 2174, - "total_submitted": 6905, + "total_acs": 2192, + "total_submitted": 7016, "total_column_articles": 30, "frontend_question_id": "1917", "is_new_question": false @@ -25863,8 +26220,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": 3305, - "total_submitted": 5552, + "total_acs": 3313, + "total_submitted": 5561, "total_column_articles": 94, "frontend_question_id": "1931", "is_new_question": false @@ -25884,8 +26241,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 2057, - "total_submitted": 6162, + "total_acs": 2062, + "total_submitted": 6182, "total_column_articles": 54, "frontend_question_id": "1932", "is_new_question": false @@ -25905,8 +26262,8 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 8892, - "total_submitted": 17182, + "total_acs": 8922, + "total_submitted": 17224, "total_column_articles": 153, "frontend_question_id": "1930", "is_new_question": false @@ -25926,8 +26283,8 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 39230, - "total_submitted": 45603, + "total_acs": 39412, + "total_submitted": 45827, "total_column_articles": 359, "frontend_question_id": "1929", "is_new_question": false @@ -25947,9 +26304,9 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 6472, - "total_submitted": 10046, - "total_column_articles": 83, + "total_acs": 7223, + "total_submitted": 11318, + "total_column_articles": 89, "frontend_question_id": "1907", "is_new_question": false }, @@ -25968,8 +26325,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 245, - "total_submitted": 421, + "total_acs": 254, + "total_submitted": 430, "total_column_articles": 15, "frontend_question_id": "2297", "is_new_question": false @@ -25989,9 +26346,9 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 3195, - "total_submitted": 7266, - "total_column_articles": 76, + "total_acs": 3282, + "total_submitted": 7449, + "total_column_articles": 78, "frontend_question_id": "1943", "is_new_question": false }, @@ -26010,9 +26367,9 @@ "question__title": "The Number of the Smallest Unoccupied Chair", "question__title_slug": "the-number-of-the-smallest-unoccupied-chair", "question__hide": false, - "total_acs": 5373, - "total_submitted": 12764, - "total_column_articles": 111, + "total_acs": 5395, + "total_submitted": 12800, + "total_column_articles": 113, "frontend_question_id": "1942", "is_new_question": false }, @@ -26031,8 +26388,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": 13083, - "total_submitted": 17783, + "total_acs": 13147, + "total_submitted": 17886, "total_column_articles": 199, "frontend_question_id": "1941", "is_new_question": false @@ -26052,8 +26409,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 455, - "total_submitted": 889, + "total_acs": 462, + "total_submitted": 903, "total_column_articles": 14, "frontend_question_id": "1902", "is_new_question": false @@ -26073,8 +26430,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 2767, - "total_submitted": 10287, + "total_acs": 2785, + "total_submitted": 10342, "total_column_articles": 48, "frontend_question_id": "1923", "is_new_question": false @@ -26094,8 +26451,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 7031, - "total_submitted": 19391, + "total_acs": 7056, + "total_submitted": 19455, "total_column_articles": 104, "frontend_question_id": "1922", "is_new_question": false @@ -26115,9 +26472,9 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 8326, - "total_submitted": 22390, - "total_column_articles": 125, + "total_acs": 8446, + "total_submitted": 22615, + "total_column_articles": 131, "frontend_question_id": "1921", "is_new_question": false }, @@ -26136,8 +26493,8 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 35337, - "total_submitted": 40830, + "total_acs": 35480, + "total_submitted": 41017, "total_column_articles": 330, "frontend_question_id": "1920", "is_new_question": false @@ -26157,9 +26514,9 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 7431, - "total_submitted": 12639, - "total_column_articles": 134, + "total_acs": 7462, + "total_submitted": 12686, + "total_column_articles": 135, "frontend_question_id": "1901", "is_new_question": false }, @@ -26178,9 +26535,9 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 2219, - "total_submitted": 5857, - "total_column_articles": 34, + "total_acs": 2230, + "total_submitted": 5891, + "total_column_articles": 35, "frontend_question_id": "1892", "is_new_question": false }, @@ -26199,9 +26556,9 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 4417, - "total_submitted": 10476, - "total_column_articles": 51, + "total_acs": 4431, + "total_submitted": 10518, + "total_column_articles": 52, "frontend_question_id": "1891", "is_new_question": false }, @@ -26220,8 +26577,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 4823, - "total_submitted": 10762, + "total_acs": 4863, + "total_submitted": 10826, "total_column_articles": 85, "frontend_question_id": "1915", "is_new_question": false @@ -26241,9 +26598,9 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 4378, - "total_submitted": 9370, - "total_column_articles": 100, + "total_acs": 4403, + "total_submitted": 9417, + "total_column_articles": 102, "frontend_question_id": "1914", "is_new_question": false }, @@ -26262,8 +26619,8 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 20225, - "total_submitted": 24877, + "total_acs": 20330, + "total_submitted": 25023, "total_column_articles": 246, "frontend_question_id": "1913", "is_new_question": false @@ -26283,9 +26640,9 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 30464, - "total_submitted": 43607, - "total_column_articles": 204, + "total_acs": 30711, + "total_submitted": 43982, + "total_column_articles": 203, "frontend_question_id": "1890", "is_new_question": false }, @@ -26304,8 +26661,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": 5544, - "total_submitted": 12067, + "total_acs": 5574, + "total_submitted": 12128, "total_column_articles": 85, "frontend_question_id": "1928", "is_new_question": false @@ -26325,8 +26682,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 3141, - "total_submitted": 7206, + "total_acs": 3155, + "total_submitted": 7228, "total_column_articles": 67, "frontend_question_id": "1927", "is_new_question": false @@ -26346,9 +26703,9 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 14833, - "total_submitted": 37682, - "total_column_articles": 200, + "total_acs": 15207, + "total_submitted": 38686, + "total_column_articles": 202, "frontend_question_id": "1926", "is_new_question": false }, @@ -26367,8 +26724,8 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 12510, - "total_submitted": 17989, + "total_acs": 12640, + "total_submitted": 18151, "total_column_articles": 147, "frontend_question_id": "1925", "is_new_question": false @@ -26388,9 +26745,9 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 1244, - "total_submitted": 2103, - "total_column_articles": 30, + "total_acs": 1251, + "total_submitted": 2116, + "total_column_articles": 31, "frontend_question_id": "1885", "is_new_question": false }, @@ -26409,9 +26766,9 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 26729, - "total_submitted": 39781, - "total_column_articles": 427, + "total_acs": 26912, + "total_submitted": 40082, + "total_column_articles": 429, "frontend_question_id": "1905", "is_new_question": false }, @@ -26430,8 +26787,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 4069, - "total_submitted": 9004, + "total_acs": 4087, + "total_submitted": 9036, "total_column_articles": 73, "frontend_question_id": "1906", "is_new_question": false @@ -26451,8 +26808,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": 5788, - "total_submitted": 18375, + "total_acs": 5800, + "total_submitted": 18411, "total_column_articles": 109, "frontend_question_id": "1904", "is_new_question": false @@ -26472,8 +26829,8 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 16922, - "total_submitted": 27997, + "total_acs": 17016, + "total_submitted": 28143, "total_column_articles": 210, "frontend_question_id": "1903", "is_new_question": false @@ -26493,9 +26850,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": 8264, - "total_submitted": 11701, - "total_column_articles": 112, + "total_acs": 8326, + "total_submitted": 11790, + "total_column_articles": 113, "frontend_question_id": "1884", "is_new_question": false }, @@ -26514,9 +26871,9 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 2427, - "total_submitted": 3758, - "total_column_articles": 45, + "total_acs": 2445, + "total_submitted": 3799, + "total_column_articles": 46, "frontend_question_id": "1875", "is_new_question": false }, @@ -26535,9 +26892,9 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 1133, - "total_submitted": 1304, - "total_column_articles": 38, + "total_acs": 1137, + "total_submitted": 1308, + "total_column_articles": 39, "frontend_question_id": "1874", "is_new_question": false }, @@ -26556,8 +26913,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": 1884, - "total_submitted": 4092, + "total_acs": 1895, + "total_submitted": 4103, "total_column_articles": 48, "frontend_question_id": "1900", "is_new_question": false @@ -26577,8 +26934,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 8977, - "total_submitted": 23562, + "total_acs": 8998, + "total_submitted": 23596, "total_column_articles": 121, "frontend_question_id": "1898", "is_new_question": false @@ -26598,8 +26955,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 5792, - "total_submitted": 8838, + "total_acs": 5812, + "total_submitted": 8870, "total_column_articles": 84, "frontend_question_id": "1899", "is_new_question": false @@ -26619,8 +26976,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": 11097, - "total_submitted": 20097, + "total_acs": 11138, + "total_submitted": 20174, "total_column_articles": 145, "frontend_question_id": "1897", "is_new_question": false @@ -26640,9 +26997,9 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 82785, - "total_submitted": 132453, - "total_column_articles": 415, + "total_acs": 83806, + "total_submitted": 134295, + "total_column_articles": 419, "frontend_question_id": "1873", "is_new_question": false }, @@ -26661,8 +27018,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 4428, - "total_submitted": 18332, + "total_acs": 4432, + "total_submitted": 18352, "total_column_articles": 84, "frontend_question_id": "1912", "is_new_question": false @@ -26682,9 +27039,9 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 25664, - "total_submitted": 38038, - "total_column_articles": 305, + "total_acs": 25730, + "total_submitted": 38132, + "total_column_articles": 306, "frontend_question_id": "1911", "is_new_question": false }, @@ -26703,9 +27060,9 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 7064, - "total_submitted": 10630, - "total_column_articles": 125, + "total_acs": 7085, + "total_submitted": 10659, + "total_column_articles": 126, "frontend_question_id": "1910", "is_new_question": false }, @@ -26724,8 +27081,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": 10809, - "total_submitted": 36117, + "total_acs": 10865, + "total_submitted": 36289, "total_column_articles": 174, "frontend_question_id": "1909", "is_new_question": false @@ -26745,8 +27102,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": 2309, - "total_submitted": 4722, + "total_acs": 2310, + "total_submitted": 4724, "total_column_articles": 50, "frontend_question_id": "1868", "is_new_question": false @@ -26766,8 +27123,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 3808, - "total_submitted": 12840, + "total_acs": 3816, + "total_submitted": 12862, "total_column_articles": 67, "frontend_question_id": "1889", "is_new_question": false @@ -26787,8 +27144,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": 4379, - "total_submitted": 11932, + "total_acs": 4402, + "total_submitted": 11970, "total_column_articles": 96, "frontend_question_id": "1888", "is_new_question": false @@ -26808,8 +27165,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": 8113, - "total_submitted": 12356, + "total_acs": 8134, + "total_submitted": 12381, "total_column_articles": 112, "frontend_question_id": "1887", "is_new_question": false @@ -26829,8 +27186,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": 11330, - "total_submitted": 19070, + "total_acs": 11363, + "total_submitted": 19121, "total_column_articles": 175, "frontend_question_id": "1886", "is_new_question": false @@ -26850,8 +27207,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 5062, - "total_submitted": 7417, + "total_acs": 5080, + "total_submitted": 7460, "total_column_articles": 58, "frontend_question_id": "1867", "is_new_question": false @@ -26871,8 +27228,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": 2549, - "total_submitted": 6314, + "total_acs": 2597, + "total_submitted": 6365, "total_column_articles": 39, "frontend_question_id": "1883", "is_new_question": false @@ -26892,8 +27249,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 5687, - "total_submitted": 18424, + "total_acs": 5696, + "total_submitted": 18441, "total_column_articles": 147, "frontend_question_id": "1882", "is_new_question": false @@ -26913,8 +27270,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 9437, - "total_submitted": 24921, + "total_acs": 9459, + "total_submitted": 24961, "total_column_articles": 100, "frontend_question_id": "1881", "is_new_question": false @@ -26934,8 +27291,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": 13078, - "total_submitted": 17148, + "total_acs": 13144, + "total_submitted": 17251, "total_column_articles": 212, "frontend_question_id": "1880", "is_new_question": false @@ -26955,8 +27312,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 1194, - "total_submitted": 1781, + "total_acs": 1198, + "total_submitted": 1785, "total_column_articles": 47, "frontend_question_id": "1858", "is_new_question": false @@ -26976,8 +27333,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": 1391, - "total_submitted": 2691, + "total_acs": 1404, + "total_submitted": 2729, "total_column_articles": 36, "frontend_question_id": "1896", "is_new_question": false @@ -26997,9 +27354,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": 333, - "total_submitted": 587, - "total_column_articles": 14, + "total_acs": 334, + "total_submitted": 588, + "total_column_articles": 15, "frontend_question_id": "2247", "is_new_question": false }, @@ -27018,8 +27375,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": 48521, - "total_submitted": 105748, + "total_acs": 48549, + "total_submitted": 105822, "total_column_articles": 619, "frontend_question_id": "1894", "is_new_question": false @@ -27039,9 +27396,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": 39652, - "total_submitted": 67375, - "total_column_articles": 533, + "total_acs": 39726, + "total_submitted": 67494, + "total_column_articles": 534, "frontend_question_id": "1893", "is_new_question": false }, @@ -27060,8 +27417,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 3436, - "total_submitted": 5457, + "total_acs": 3456, + "total_submitted": 5483, "total_column_articles": 32, "frontend_question_id": "1853", "is_new_question": false @@ -27081,8 +27438,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 860, - "total_submitted": 1442, + "total_acs": 861, + "total_submitted": 1443, "total_column_articles": 21, "frontend_question_id": "1852", "is_new_question": false @@ -27102,8 +27459,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 3403, - "total_submitted": 5544, + "total_acs": 3413, + "total_submitted": 5555, "total_column_articles": 48, "frontend_question_id": "1872", "is_new_question": false @@ -27123,8 +27480,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 9407, - "total_submitted": 33156, + "total_acs": 9453, + "total_submitted": 33254, "total_column_articles": 181, "frontend_question_id": "1871", "is_new_question": false @@ -27144,8 +27501,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 13728, - "total_submitted": 32560, + "total_acs": 13764, + "total_submitted": 32632, "total_column_articles": 143, "frontend_question_id": "1870", "is_new_question": false @@ -27165,8 +27522,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": 18884, - "total_submitted": 26808, + "total_acs": 18941, + "total_submitted": 26891, "total_column_articles": 263, "frontend_question_id": "1869", "is_new_question": false @@ -27186,8 +27543,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 2959, - "total_submitted": 6747, + "total_acs": 2988, + "total_submitted": 6793, "total_column_articles": 49, "frontend_question_id": "1843", "is_new_question": false @@ -27207,8 +27564,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 387, - "total_submitted": 712, + "total_acs": 388, + "total_submitted": 713, "total_column_articles": 19, "frontend_question_id": "1842", "is_new_question": false @@ -27228,8 +27585,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": 3820, - "total_submitted": 6165, + "total_acs": 3827, + "total_submitted": 6172, "total_column_articles": 73, "frontend_question_id": "1866", "is_new_question": false @@ -27249,8 +27606,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 7368, - "total_submitted": 14481, + "total_acs": 7381, + "total_submitted": 14513, "total_column_articles": 86, "frontend_question_id": "1865", "is_new_question": false @@ -27270,9 +27627,9 @@ "question__title": "Minimum Number of Swaps to Make the Binary String Alternating", "question__title_slug": "minimum-number-of-swaps-to-make-the-binary-string-alternating", "question__hide": false, - "total_acs": 7217, - "total_submitted": 17731, - "total_column_articles": 161, + "total_acs": 7257, + "total_submitted": 17804, + "total_column_articles": 163, "frontend_question_id": "1864", "is_new_question": false }, @@ -27291,9 +27648,9 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 22288, - "total_submitted": 26530, - "total_column_articles": 271, + "total_acs": 22451, + "total_submitted": 26748, + "total_column_articles": 272, "frontend_question_id": "1863", "is_new_question": false }, @@ -27312,8 +27669,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": 803, - "total_submitted": 1248, + "total_acs": 811, + "total_submitted": 1260, "total_column_articles": 32, "frontend_question_id": "2046", "is_new_question": false @@ -27333,8 +27690,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 2923, - "total_submitted": 5524, + "total_acs": 2947, + "total_submitted": 5581, "total_column_articles": 65, "frontend_question_id": "1841", "is_new_question": false @@ -27354,8 +27711,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": 3156, - "total_submitted": 6909, + "total_acs": 3161, + "total_submitted": 6916, "total_column_articles": 76, "frontend_question_id": "1878", "is_new_question": false @@ -27375,9 +27732,9 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 4133, - "total_submitted": 8157, - "total_column_articles": 71, + "total_acs": 4148, + "total_submitted": 8173, + "total_column_articles": 70, "frontend_question_id": "1879", "is_new_question": false }, @@ -27396,8 +27753,8 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 38593, - "total_submitted": 47596, + "total_acs": 38648, + "total_submitted": 47658, "total_column_articles": 487, "frontend_question_id": "1877", "is_new_question": false @@ -27417,9 +27774,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": 16976, - "total_submitted": 24091, - "total_column_articles": 272, + "total_acs": 17106, + "total_submitted": 24269, + "total_column_articles": 271, "frontend_question_id": "1876", "is_new_question": false }, @@ -27438,8 +27795,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": 4451, - "total_submitted": 9075, + "total_acs": 4482, + "total_submitted": 9159, "total_column_articles": 68, "frontend_question_id": "1857", "is_new_question": false @@ -27459,8 +27816,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 9813, - "total_submitted": 26042, + "total_acs": 9912, + "total_submitted": 26272, "total_column_articles": 148, "frontend_question_id": "1856", "is_new_question": false @@ -27480,8 +27837,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": 21644, - "total_submitted": 36460, + "total_acs": 21682, + "total_submitted": 36515, "total_column_articles": 242, "frontend_question_id": "1855", "is_new_question": false @@ -27501,8 +27858,8 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 17990, - "total_submitted": 24883, + "total_acs": 18048, + "total_submitted": 24971, "total_column_articles": 227, "frontend_question_id": "1854", "is_new_question": false @@ -27522,8 +27879,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": 2062, - "total_submitted": 2806, + "total_acs": 2071, + "total_submitted": 2815, "total_column_articles": 60, "frontend_question_id": "1836", "is_new_question": false @@ -27543,9 +27900,9 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 5192, - "total_submitted": 6686, - "total_column_articles": 70, + "total_acs": 5253, + "total_submitted": 6766, + "total_column_articles": 73, "frontend_question_id": "1831", "is_new_question": false }, @@ -27564,8 +27921,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 863, - "total_submitted": 2060, + "total_acs": 867, + "total_submitted": 2068, "total_column_articles": 40, "frontend_question_id": "1826", "is_new_question": false @@ -27585,8 +27942,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": 335, - "total_submitted": 596, + "total_acs": 338, + "total_submitted": 601, "total_column_articles": 15, "frontend_question_id": "1989", "is_new_question": false @@ -27606,8 +27963,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": 3626, - "total_submitted": 5765, + "total_acs": 3632, + "total_submitted": 5782, "total_column_articles": 69, "frontend_question_id": "1850", "is_new_question": false @@ -27627,9 +27984,9 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 14878, - "total_submitted": 28643, - "total_column_articles": 168, + "total_acs": 14930, + "total_submitted": 28742, + "total_column_articles": 169, "frontend_question_id": "1851", "is_new_question": false }, @@ -27648,8 +28005,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": 7680, - "total_submitted": 23046, + "total_acs": 7698, + "total_submitted": 23109, "total_column_articles": 139, "frontend_question_id": "1849", "is_new_question": false @@ -27669,8 +28026,8 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 14120, - "total_submitted": 21379, + "total_acs": 14177, + "total_submitted": 21460, "total_column_articles": 186, "frontend_question_id": "1848", "is_new_question": false @@ -27690,9 +28047,9 @@ "question__title": "Find Customers With Positive Revenue this Year", "question__title_slug": "find-customers-with-positive-revenue-this-year", "question__hide": false, - "total_acs": 7480, - "total_submitted": 8509, - "total_column_articles": 45, + "total_acs": 7729, + "total_submitted": 8814, + "total_column_articles": 48, "frontend_question_id": "1821", "is_new_question": false }, @@ -27711,8 +28068,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 5952, - "total_submitted": 9396, + "total_acs": 5969, + "total_submitted": 9413, "total_column_articles": 116, "frontend_question_id": "1861", "is_new_question": false @@ -27732,8 +28089,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 6835, - "total_submitted": 8992, + "total_acs": 6848, + "total_submitted": 9007, "total_column_articles": 129, "frontend_question_id": "1860", "is_new_question": false @@ -27753,9 +28110,9 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 16096, - "total_submitted": 22073, - "total_column_articles": 330, + "total_acs": 16158, + "total_submitted": 22143, + "total_column_articles": 332, "frontend_question_id": "1859", "is_new_question": false }, @@ -27774,8 +28131,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 412, - "total_submitted": 905, + "total_acs": 414, + "total_submitted": 908, "total_column_articles": 17, "frontend_question_id": "1820", "is_new_question": false @@ -27795,8 +28152,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 2974, - "total_submitted": 7507, + "total_acs": 2988, + "total_submitted": 7541, "total_column_articles": 64, "frontend_question_id": "1840", "is_new_question": false @@ -27816,9 +28173,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": 12416, - "total_submitted": 25438, - "total_column_articles": 213, + "total_acs": 12498, + "total_submitted": 25597, + "total_column_articles": 216, "frontend_question_id": "1839", "is_new_question": false }, @@ -27837,8 +28194,8 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 36875, - "total_submitted": 85610, + "total_acs": 36904, + "total_submitted": 85670, "total_column_articles": 384, "frontend_question_id": "1838", "is_new_question": false @@ -27858,8 +28215,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 15677, - "total_submitted": 19851, + "total_acs": 15830, + "total_submitted": 20062, "total_column_articles": 176, "frontend_question_id": "1837", "is_new_question": false @@ -27879,9 +28236,9 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 3323, - "total_submitted": 5167, - "total_column_articles": 55, + "total_acs": 3348, + "total_submitted": 5222, + "total_column_articles": 56, "frontend_question_id": "1811", "is_new_question": false }, @@ -27900,8 +28257,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": 5200, - "total_submitted": 9274, + "total_acs": 5211, + "total_submitted": 9295, "total_column_articles": 77, "frontend_question_id": "1835", "is_new_question": false @@ -27921,8 +28278,8 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 10497, - "total_submitted": 27601, + "total_acs": 10520, + "total_submitted": 27674, "total_column_articles": 181, "frontend_question_id": "1834", "is_new_question": false @@ -27942,8 +28299,8 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 49432, - "total_submitted": 72613, + "total_acs": 49473, + "total_submitted": 72668, "total_column_articles": 466, "frontend_question_id": "1833", "is_new_question": false @@ -27963,9 +28320,9 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 51654, - "total_submitted": 60969, - "total_column_articles": 616, + "total_acs": 51800, + "total_submitted": 61132, + "total_column_articles": 615, "frontend_question_id": "1832", "is_new_question": false }, @@ -28005,8 +28362,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 4648, - "total_submitted": 7613, + "total_acs": 4672, + "total_submitted": 7652, "total_column_articles": 51, "frontend_question_id": "1809", "is_new_question": false @@ -28026,8 +28383,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 3993, - "total_submitted": 9982, + "total_acs": 3999, + "total_submitted": 9988, "total_column_articles": 75, "frontend_question_id": "1847", "is_new_question": false @@ -28047,9 +28404,9 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 31112, - "total_submitted": 49358, - "total_column_articles": 416, + "total_acs": 31132, + "total_submitted": 49397, + "total_column_articles": 417, "frontend_question_id": "1846", "is_new_question": false }, @@ -28068,9 +28425,9 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 15962, - "total_submitted": 33177, - "total_column_articles": 167, + "total_acs": 16004, + "total_submitted": 33240, + "total_column_articles": 168, "frontend_question_id": "1845", "is_new_question": false }, @@ -28089,8 +28446,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 13726, - "total_submitted": 17446, + "total_acs": 13774, + "total_submitted": 17511, "total_column_articles": 218, "frontend_question_id": "1844", "is_new_question": false @@ -28110,8 +28467,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 13710, - "total_submitted": 31528, + "total_acs": 13727, + "total_submitted": 31560, "total_column_articles": 191, "frontend_question_id": "1825", "is_new_question": false @@ -28131,8 +28488,8 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 23332, - "total_submitted": 34132, + "total_acs": 23368, + "total_submitted": 34176, "total_column_articles": 333, "frontend_question_id": "1824", "is_new_question": false @@ -28152,9 +28509,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": 54433, - "total_submitted": 69345, - "total_column_articles": 581, + "total_acs": 54506, + "total_submitted": 69458, + "total_column_articles": 583, "frontend_question_id": "1823", "is_new_question": false }, @@ -28173,9 +28530,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": 75525, - "total_submitted": 105491, - "total_column_articles": 738, + "total_acs": 75904, + "total_submitted": 106118, + "total_column_articles": 743, "frontend_question_id": "1822", "is_new_question": false }, @@ -28194,8 +28551,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 2409, - "total_submitted": 4197, + "total_acs": 2420, + "total_submitted": 4214, "total_column_articles": 61, "frontend_question_id": "1804", "is_new_question": false @@ -28215,9 +28572,9 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 42132, - "total_submitted": 53803, - "total_column_articles": 196, + "total_acs": 42717, + "total_submitted": 54660, + "total_column_articles": 199, "frontend_question_id": "1795", "is_new_question": false }, @@ -28236,8 +28593,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 16083, - "total_submitted": 25383, + "total_acs": 16094, + "total_submitted": 25398, "total_column_articles": 108, "frontend_question_id": "1819", "is_new_question": false @@ -28257,8 +28614,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 31812, - "total_submitted": 84701, + "total_acs": 31829, + "total_submitted": 84767, "total_column_articles": 395, "frontend_question_id": "1818", "is_new_question": false @@ -28278,8 +28635,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 24607, - "total_submitted": 31005, + "total_acs": 24628, + "total_submitted": 31028, "total_column_articles": 315, "frontend_question_id": "1817", "is_new_question": false @@ -28299,8 +28656,8 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 55403, - "total_submitted": 76609, + "total_acs": 55471, + "total_submitted": 76691, "total_column_articles": 740, "frontend_question_id": "1816", "is_new_question": false @@ -28320,8 +28677,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": 385, - "total_submitted": 692, + "total_acs": 387, + "total_submitted": 694, "total_column_articles": 13, "frontend_question_id": "1794", "is_new_question": false @@ -28341,9 +28698,9 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 9034, - "total_submitted": 12867, - "total_column_articles": 100, + "total_acs": 9505, + "total_submitted": 13679, + "total_column_articles": 105, "frontend_question_id": "1789", "is_new_question": false }, @@ -28362,8 +28719,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": 1518, - "total_submitted": 2856, + "total_acs": 1521, + "total_submitted": 2864, "total_column_articles": 31, "frontend_question_id": "1830", "is_new_question": false @@ -28383,8 +28740,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 6442, - "total_submitted": 8903, + "total_acs": 6456, + "total_submitted": 8920, "total_column_articles": 119, "frontend_question_id": "1829", "is_new_question": false @@ -28404,8 +28761,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": 30212, - "total_submitted": 34184, + "total_acs": 30285, + "total_submitted": 34268, "total_column_articles": 325, "frontend_question_id": "1828", "is_new_question": false @@ -28425,9 +28782,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": 39507, - "total_submitted": 48648, - "total_column_articles": 422, + "total_acs": 39599, + "total_submitted": 48759, + "total_column_articles": 424, "frontend_question_id": "1827", "is_new_question": false }, @@ -28446,8 +28803,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 692, - "total_submitted": 1056, + "total_acs": 695, + "total_submitted": 1059, "total_column_articles": 32, "frontend_question_id": "1788", "is_new_question": false @@ -28467,8 +28824,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 3390, - "total_submitted": 11801, + "total_acs": 3396, + "total_submitted": 11812, "total_column_articles": 62, "frontend_question_id": "1808", "is_new_question": false @@ -28488,9 +28845,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": 25927, - "total_submitted": 33789, - "total_column_articles": 304, + "total_acs": 25945, + "total_submitted": 33811, + "total_column_articles": 303, "frontend_question_id": "1806", "is_new_question": false }, @@ -28509,9 +28866,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": 31266, - "total_submitted": 46323, - "total_column_articles": 435, + "total_acs": 31284, + "total_submitted": 46348, + "total_column_articles": 434, "frontend_question_id": "1807", "is_new_question": false }, @@ -28530,9 +28887,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": 39716, - "total_submitted": 92115, - "total_column_articles": 555, + "total_acs": 39769, + "total_submitted": 92236, + "total_column_articles": 554, "frontend_question_id": "1805", "is_new_question": false }, @@ -28551,9 +28908,9 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 6666, - "total_submitted": 8279, - "total_column_articles": 88, + "total_acs": 6748, + "total_submitted": 8408, + "total_column_articles": 91, "frontend_question_id": "1783", "is_new_question": false }, @@ -28593,8 +28950,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": 23098, - "total_submitted": 32544, + "total_acs": 23116, + "total_submitted": 32574, "total_column_articles": 242, "frontend_question_id": "1798", "is_new_question": false @@ -28614,8 +28971,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": 25395, - "total_submitted": 66617, + "total_acs": 25412, + "total_submitted": 66669, "total_column_articles": 387, "frontend_question_id": "1802", "is_new_question": false @@ -28635,9 +28992,9 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 20727, - "total_submitted": 38923, - "total_column_articles": 299, + "total_acs": 20748, + "total_submitted": 38946, + "total_column_articles": 300, "frontend_question_id": "1801", "is_new_question": false }, @@ -28656,8 +29013,8 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 44386, - "total_submitted": 64666, + "total_acs": 44463, + "total_submitted": 64775, "total_column_articles": 642, "frontend_question_id": "1800", "is_new_question": false @@ -28677,9 +29034,9 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 8783, - "total_submitted": 11211, - "total_column_articles": 85, + "total_acs": 8818, + "total_submitted": 11257, + "total_column_articles": 86, "frontend_question_id": "1777", "is_new_question": false }, @@ -28698,8 +29055,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 25536, - "total_submitted": 54211, + "total_acs": 25553, + "total_submitted": 54239, "total_column_articles": 314, "frontend_question_id": "1814", "is_new_question": false @@ -28719,8 +29076,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": 11154, - "total_submitted": 20905, + "total_acs": 11162, + "total_submitted": 20929, "total_column_articles": 93, "frontend_question_id": "1815", "is_new_question": false @@ -28740,9 +29097,9 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 25562, - "total_submitted": 61412, - "total_column_articles": 333, + "total_acs": 25578, + "total_submitted": 61452, + "total_column_articles": 334, "frontend_question_id": "1813", "is_new_question": false }, @@ -28761,9 +29118,9 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 42518, - "total_submitted": 52102, - "total_column_articles": 705, + "total_acs": 42612, + "total_submitted": 52243, + "total_column_articles": 704, "frontend_question_id": "1812", "is_new_question": false }, @@ -28782,8 +29139,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 829, - "total_submitted": 1750, + "total_acs": 833, + "total_submitted": 1757, "total_column_articles": 21, "frontend_question_id": "1772", "is_new_question": false @@ -28803,9 +29160,9 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 6005, - "total_submitted": 13154, - "total_column_articles": 130, + "total_acs": 6018, + "total_submitted": 13173, + "total_column_articles": 132, "frontend_question_id": "1793", "is_new_question": false }, @@ -28824,9 +29181,9 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 24471, - "total_submitted": 41585, - "total_column_articles": 255, + "total_acs": 24501, + "total_submitted": 41648, + "total_column_articles": 256, "frontend_question_id": "1792", "is_new_question": false }, @@ -28845,8 +29202,8 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 56673, - "total_submitted": 68238, + "total_acs": 56833, + "total_submitted": 68432, "total_column_articles": 510, "frontend_question_id": "1791", "is_new_question": false @@ -28866,8 +29223,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": 65387, - "total_submitted": 124567, + "total_acs": 65430, + "total_submitted": 124681, "total_column_articles": 872, "frontend_question_id": "1790", "is_new_question": false @@ -28887,9 +29244,9 @@ "question__title": "Find the Subtasks That Did Not Execute", "question__title_slug": "find-the-subtasks-that-did-not-execute", "question__hide": false, - "total_acs": 3889, - "total_submitted": 4868, - "total_column_articles": 62, + "total_acs": 3938, + "total_submitted": 4935, + "total_column_articles": 68, "frontend_question_id": "1767", "is_new_question": false }, @@ -28908,8 +29265,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": 12782, - "total_submitted": 19883, + "total_acs": 12791, + "total_submitted": 19903, "total_column_articles": 66, "frontend_question_id": "1787", "is_new_question": false @@ -28929,8 +29286,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": 5936, - "total_submitted": 16264, + "total_acs": 5968, + "total_submitted": 16346, "total_column_articles": 133, "frontend_question_id": "1786", "is_new_question": false @@ -28950,8 +29307,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": 27273, - "total_submitted": 62608, + "total_acs": 27294, + "total_submitted": 62652, "total_column_articles": 292, "frontend_question_id": "1785", "is_new_question": false @@ -28971,9 +29328,9 @@ "question__title": "Check if Binary String Has at Most One Segment of Ones", "question__title_slug": "check-if-binary-string-has-at-most-one-segment-of-ones", "question__hide": false, - "total_acs": 39878, - "total_submitted": 67037, - "total_column_articles": 543, + "total_acs": 39921, + "total_submitted": 67095, + "total_column_articles": 544, "frontend_question_id": "1784", "is_new_question": false }, @@ -28992,8 +29349,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 2843, - "total_submitted": 3974, + "total_acs": 2857, + "total_submitted": 3990, "total_column_articles": 49, "frontend_question_id": "1762", "is_new_question": false @@ -29013,9 +29370,9 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 132302, - "total_submitted": 151740, - "total_column_articles": 310, + "total_acs": 135064, + "total_submitted": 155223, + "total_column_articles": 316, "frontend_question_id": "1757", "is_new_question": false }, @@ -29034,9 +29391,9 @@ "question__title": "Count Pairs With XOR in a Range", "question__title_slug": "count-pairs-with-xor-in-a-range", "question__hide": false, - "total_acs": 16156, - "total_submitted": 28671, - "total_column_articles": 157, + "total_acs": 16179, + "total_submitted": 28696, + "total_column_articles": 158, "frontend_question_id": "1803", "is_new_question": false }, @@ -29055,8 +29412,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 13862, - "total_submitted": 21127, + "total_acs": 13911, + "total_submitted": 21190, "total_column_articles": 165, "frontend_question_id": "1799", "is_new_question": false @@ -29076,8 +29433,8 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 32724, - "total_submitted": 50502, + "total_acs": 32746, + "total_submitted": 50540, "total_column_articles": 347, "frontend_question_id": "1797", "is_new_question": false @@ -29097,8 +29454,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 37176, - "total_submitted": 67760, + "total_acs": 37234, + "total_submitted": 67862, "total_column_articles": 459, "frontend_question_id": "1796", "is_new_question": false @@ -29118,8 +29475,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 1484, - "total_submitted": 1800, + "total_acs": 1489, + "total_submitted": 1805, "total_column_articles": 35, "frontend_question_id": "1756", "is_new_question": false @@ -29139,8 +29496,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 3122, - "total_submitted": 6410, + "total_acs": 3132, + "total_submitted": 6428, "total_column_articles": 66, "frontend_question_id": "1776", "is_new_question": false @@ -29160,8 +29517,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": 25093, - "total_submitted": 44446, + "total_acs": 25110, + "total_submitted": 44474, "total_column_articles": 362, "frontend_question_id": "1775", "is_new_question": false @@ -29181,8 +29538,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 26855, - "total_submitted": 46772, + "total_acs": 26877, + "total_submitted": 46809, "total_column_articles": 305, "frontend_question_id": "1774", "is_new_question": false @@ -29202,8 +29559,8 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 50816, - "total_submitted": 58822, + "total_acs": 50944, + "total_submitted": 59003, "total_column_articles": 512, "frontend_question_id": "1773", "is_new_question": false @@ -29223,9 +29580,9 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 6504, - "total_submitted": 9955, - "total_column_articles": 88, + "total_acs": 6583, + "total_submitted": 10078, + "total_column_articles": 89, "frontend_question_id": "1747", "is_new_question": false }, @@ -29244,8 +29601,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 3548, - "total_submitted": 9139, + "total_acs": 3568, + "total_submitted": 9177, "total_column_articles": 65, "frontend_question_id": "1771", "is_new_question": false @@ -29265,9 +29622,9 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 6327, - "total_submitted": 15855, - "total_column_articles": 136, + "total_acs": 6353, + "total_submitted": 15893, + "total_column_articles": 137, "frontend_question_id": "1770", "is_new_question": false }, @@ -29286,9 +29643,9 @@ "question__title": "Minimum Number of Operations to Move All Balls to Each Box", "question__title_slug": "minimum-number-of-operations-to-move-all-balls-to-each-box", "question__hide": false, - "total_acs": 41245, - "total_submitted": 46971, - "total_column_articles": 562, + "total_acs": 41293, + "total_submitted": 47024, + "total_column_articles": 561, "frontend_question_id": "1769", "is_new_question": false }, @@ -29307,9 +29664,9 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 77515, - "total_submitted": 102814, - "total_column_articles": 900, + "total_acs": 79978, + "total_submitted": 106241, + "total_column_articles": 912, "frontend_question_id": "1768", "is_new_question": false }, @@ -29328,8 +29685,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 2890, - "total_submitted": 4771, + "total_acs": 2932, + "total_submitted": 4834, "total_column_articles": 76, "frontend_question_id": "1746", "is_new_question": false @@ -29349,9 +29706,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": 31751, - "total_submitted": 37559, - "total_column_articles": 195, + "total_acs": 32365, + "total_submitted": 38381, + "total_column_articles": 196, "frontend_question_id": "1741", "is_new_question": false }, @@ -29370,8 +29727,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 2131, - "total_submitted": 5862, + "total_acs": 2152, + "total_submitted": 5888, "total_column_articles": 52, "frontend_question_id": "1782", "is_new_question": false @@ -29391,9 +29748,9 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 24861, - "total_submitted": 37386, - "total_column_articles": 227, + "total_acs": 24872, + "total_submitted": 37407, + "total_column_articles": 226, "frontend_question_id": "1781", "is_new_question": false }, @@ -29412,9 +29769,9 @@ "question__title": "Check if Number is a Sum of Powers of Three", "question__title_slug": "check-if-number-is-a-sum-of-powers-of-three", "question__hide": false, - "total_acs": 31481, - "total_submitted": 42102, - "total_column_articles": 507, + "total_acs": 31548, + "total_submitted": 42177, + "total_column_articles": 506, "frontend_question_id": "1780", "is_new_question": false }, @@ -29433,9 +29790,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": 46487, - "total_submitted": 67504, - "total_column_articles": 550, + "total_acs": 46534, + "total_submitted": 67564, + "total_column_articles": 549, "frontend_question_id": "1779", "is_new_question": false }, @@ -29454,9 +29811,9 @@ "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": 4087, - "total_submitted": 8852, - "total_column_articles": 53, + "total_acs": 4155, + "total_submitted": 8932, + "total_column_articles": 54, "frontend_question_id": "1761", "is_new_question": false }, @@ -29475,8 +29832,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": 25327, - "total_submitted": 39519, + "total_acs": 25360, + "total_submitted": 39572, "total_column_articles": 281, "frontend_question_id": "1760", "is_new_question": false @@ -29496,8 +29853,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 23909, - "total_submitted": 46794, + "total_acs": 23934, + "total_submitted": 46835, "total_column_articles": 273, "frontend_question_id": "1759", "is_new_question": false @@ -29517,9 +29874,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": 36862, - "total_submitted": 52960, - "total_column_articles": 456, + "total_acs": 36924, + "total_submitted": 53038, + "total_column_articles": 455, "frontend_question_id": "1758", "is_new_question": false }, @@ -29538,8 +29895,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 1729, - "total_submitted": 2563, + "total_acs": 1732, + "total_submitted": 2566, "total_column_articles": 56, "frontend_question_id": "1740", "is_new_question": false @@ -29559,9 +29916,9 @@ "question__title": "The Number of Employees Which Report to Each Employee", "question__title_slug": "the-number-of-employees-which-report-to-each-employee", "question__hide": false, - "total_acs": 12517, - "total_submitted": 26626, - "total_column_articles": 122, + "total_acs": 13046, + "total_submitted": 27786, + "total_column_articles": 125, "frontend_question_id": "1731", "is_new_question": false }, @@ -29580,8 +29937,8 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 6375, - "total_submitted": 14029, + "total_acs": 6426, + "total_submitted": 14121, "total_column_articles": 93, "frontend_question_id": "1755", "is_new_question": false @@ -29601,8 +29958,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 19032, - "total_submitted": 33818, + "total_acs": 19056, + "total_submitted": 33848, "total_column_articles": 209, "frontend_question_id": "1754", "is_new_question": false @@ -29622,8 +29979,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 26863, - "total_submitted": 38029, + "total_acs": 26889, + "total_submitted": 38064, "total_column_articles": 338, "frontend_question_id": "1753", "is_new_question": false @@ -29643,9 +30000,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": 32724, - "total_submitted": 56447, - "total_column_articles": 413, + "total_acs": 32764, + "total_submitted": 56537, + "total_column_articles": 414, "frontend_question_id": "1752", "is_new_question": false }, @@ -29664,9 +30021,9 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 33961, - "total_submitted": 55663, - "total_column_articles": 145, + "total_acs": 34439, + "total_submitted": 56530, + "total_column_articles": 144, "frontend_question_id": "1729", "is_new_question": false }, @@ -29685,8 +30042,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 24637, - "total_submitted": 37143, + "total_acs": 24657, + "total_submitted": 37171, "total_column_articles": 329, "frontend_question_id": "1765", "is_new_question": false @@ -29706,8 +30063,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 2476, - "total_submitted": 6136, + "total_acs": 2485, + "total_submitted": 6155, "total_column_articles": 47, "frontend_question_id": "1766", "is_new_question": false @@ -29727,8 +30084,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": 18392, - "total_submitted": 33036, + "total_acs": 18407, + "total_submitted": 33102, "total_column_articles": 259, "frontend_question_id": "1764", "is_new_question": false @@ -29748,9 +30105,9 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 28876, - "total_submitted": 42985, - "total_column_articles": 308, + "total_acs": 29001, + "total_submitted": 43210, + "total_column_articles": 309, "frontend_question_id": "1763", "is_new_question": false }, @@ -29769,9 +30126,9 @@ "question__title": "Can You Eat Your Favorite Candy on Your Favorite Day?", "question__title_slug": "can-you-eat-your-favorite-candy-on-your-favorite-day", "question__hide": false, - "total_acs": 30787, - "total_submitted": 84617, - "total_column_articles": 393, + "total_acs": 30807, + "total_submitted": 84656, + "total_column_articles": 394, "frontend_question_id": "1744", "is_new_question": false }, @@ -29790,8 +30147,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 5688, - "total_submitted": 11285, + "total_acs": 5739, + "total_submitted": 11370, "total_column_articles": 111, "frontend_question_id": "1745", "is_new_question": false @@ -29811,8 +30168,8 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 24703, - "total_submitted": 35496, + "total_acs": 24719, + "total_submitted": 35520, "total_column_articles": 358, "frontend_question_id": "1743", "is_new_question": false @@ -29832,8 +30189,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": 704, - "total_submitted": 1230, + "total_acs": 705, + "total_submitted": 1231, "total_column_articles": 22, "frontend_question_id": "1724", "is_new_question": false @@ -29853,9 +30210,9 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 4195, - "total_submitted": 5841, - "total_column_articles": 58, + "total_acs": 4220, + "total_submitted": 5878, + "total_column_articles": 59, "frontend_question_id": "1715", "is_new_question": false }, @@ -29874,8 +30231,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 12950, - "total_submitted": 20139, + "total_acs": 12971, + "total_submitted": 20185, "total_column_articles": 133, "frontend_question_id": "1739", "is_new_question": false @@ -29895,8 +30252,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 31854, - "total_submitted": 48934, + "total_acs": 31875, + "total_submitted": 48964, "total_column_articles": 433, "frontend_question_id": "1738", "is_new_question": false @@ -29916,8 +30273,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": 5921, - "total_submitted": 16463, + "total_acs": 5931, + "total_submitted": 16482, "total_column_articles": 131, "frontend_question_id": "1737", "is_new_question": false @@ -29937,8 +30294,8 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 34131, - "total_submitted": 76858, + "total_acs": 34176, + "total_submitted": 76962, "total_column_articles": 424, "frontend_question_id": "1736", "is_new_question": false @@ -29958,9 +30315,9 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 6185, - "total_submitted": 9001, - "total_column_articles": 84, + "total_acs": 6241, + "total_submitted": 9109, + "total_column_articles": 86, "frontend_question_id": "1709", "is_new_question": false }, @@ -29979,8 +30336,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": 6899, - "total_submitted": 12686, + "total_acs": 6931, + "total_submitted": 12733, "total_column_articles": 90, "frontend_question_id": "1751", "is_new_question": false @@ -30000,8 +30357,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": 24434, - "total_submitted": 48278, + "total_acs": 24457, + "total_submitted": 48322, "total_column_articles": 295, "frontend_question_id": "1750", "is_new_question": false @@ -30021,9 +30378,9 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 29321, - "total_submitted": 47994, - "total_column_articles": 319, + "total_acs": 29986, + "total_submitted": 49179, + "total_column_articles": 324, "frontend_question_id": "1749", "is_new_question": false }, @@ -30042,9 +30399,9 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 48897, - "total_submitted": 63812, - "total_column_articles": 653, + "total_acs": 49039, + "total_submitted": 64023, + "total_column_articles": 655, "frontend_question_id": "1748", "is_new_question": false }, @@ -30063,8 +30420,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 1810, - "total_submitted": 2692, + "total_acs": 1819, + "total_submitted": 2707, "total_column_articles": 53, "frontend_question_id": "1708", "is_new_question": false @@ -30084,8 +30441,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 4948, - "total_submitted": 8336, + "total_acs": 4953, + "total_submitted": 8343, "total_column_articles": 95, "frontend_question_id": "1727", "is_new_question": false @@ -30105,8 +30462,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": 39491, - "total_submitted": 52130, + "total_acs": 39538, + "total_submitted": 52186, "total_column_articles": 393, "frontend_question_id": "1742", "is_new_question": false @@ -30126,8 +30483,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": 39276, - "total_submitted": 47453, + "total_acs": 39324, + "total_submitted": 47515, "total_column_articles": 486, "frontend_question_id": "1725", "is_new_question": false @@ -30147,9 +30504,9 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 12535, - "total_submitted": 16373, - "total_column_articles": 129, + "total_acs": 12644, + "total_submitted": 16503, + "total_column_articles": 130, "frontend_question_id": "1699", "is_new_question": false }, @@ -30168,8 +30525,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 6333, - "total_submitted": 12428, + "total_acs": 6340, + "total_submitted": 12444, "total_column_articles": 149, "frontend_question_id": "1722", "is_new_question": false @@ -30189,8 +30546,8 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 56280, - "total_submitted": 65522, + "total_acs": 56371, + "total_submitted": 65635, "total_column_articles": 600, "frontend_question_id": "1720", "is_new_question": false @@ -30210,8 +30567,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": 1027, - "total_submitted": 1850, + "total_acs": 1035, + "total_submitted": 1859, "total_column_articles": 28, "frontend_question_id": "1698", "is_new_question": false @@ -30231,9 +30588,9 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 30757, - "total_submitted": 37524, - "total_column_articles": 177, + "total_acs": 31242, + "total_submitted": 38124, + "total_column_articles": 179, "frontend_question_id": "1693", "is_new_question": false }, @@ -30252,8 +30609,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": 1972, - "total_submitted": 3736, + "total_acs": 1980, + "total_submitted": 3746, "total_column_articles": 51, "frontend_question_id": "1735", "is_new_question": false @@ -30273,8 +30630,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 29854, - "total_submitted": 41217, + "total_acs": 29861, + "total_submitted": 41230, "total_column_articles": 387, "frontend_question_id": "1734", "is_new_question": false @@ -30294,9 +30651,9 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 3661, - "total_submitted": 7533, - "total_column_articles": 80, + "total_acs": 3699, + "total_submitted": 7591, + "total_column_articles": 81, "frontend_question_id": "1733", "is_new_question": false }, @@ -30315,9 +30672,9 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 51686, - "total_submitted": 63612, - "total_column_articles": 573, + "total_acs": 52458, + "total_submitted": 64540, + "total_column_articles": 576, "frontend_question_id": "1732", "is_new_question": false }, @@ -30336,8 +30693,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 18871, - "total_submitted": 37781, + "total_acs": 18901, + "total_submitted": 37858, "total_column_articles": 199, "frontend_question_id": "1713", "is_new_question": false @@ -30357,8 +30714,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": 13045, - "total_submitted": 45669, + "total_acs": 13072, + "total_submitted": 45749, "total_column_articles": 177, "frontend_question_id": "1712", "is_new_question": false @@ -30378,8 +30735,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 33255, - "total_submitted": 92469, + "total_acs": 33280, + "total_submitted": 92560, "total_column_articles": 390, "frontend_question_id": "1711", "is_new_question": false @@ -30399,8 +30756,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 50363, - "total_submitted": 68600, + "total_acs": 50504, + "total_submitted": 68782, "total_column_articles": 587, "frontend_question_id": "1710", "is_new_question": false @@ -30441,9 +30798,9 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 21379, - "total_submitted": 24719, - "total_column_articles": 103, + "total_acs": 23292, + "total_submitted": 27080, + "total_column_articles": 111, "frontend_question_id": "1683", "is_new_question": false }, @@ -30462,9 +30819,9 @@ "question__title": "Maximum XOR With an Element From Array", "question__title_slug": "maximum-xor-with-an-element-from-array", "question__hide": false, - "total_acs": 16845, - "total_submitted": 33057, - "total_column_articles": 176, + "total_acs": 16865, + "total_submitted": 33114, + "total_column_articles": 177, "frontend_question_id": "1707", "is_new_question": false }, @@ -30483,8 +30840,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": 31753, - "total_submitted": 62433, + "total_acs": 31837, + "total_submitted": 62599, "total_column_articles": 225, "frontend_question_id": "1723", "is_new_question": false @@ -30504,8 +30861,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 29946, - "total_submitted": 65964, + "total_acs": 29974, + "total_submitted": 66025, "total_column_articles": 394, "frontend_question_id": "1705", "is_new_question": false @@ -30525,8 +30882,8 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 49093, - "total_submitted": 62688, + "total_acs": 49168, + "total_submitted": 62804, "total_column_articles": 578, "frontend_question_id": "1704", "is_new_question": false @@ -30546,8 +30903,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 1186, - "total_submitted": 2078, + "total_acs": 1188, + "total_submitted": 2084, "total_column_articles": 42, "frontend_question_id": "1682", "is_new_question": false @@ -30567,9 +30924,9 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 4614, - "total_submitted": 13061, - "total_column_articles": 54, + "total_acs": 4637, + "total_submitted": 13124, + "total_column_articles": 57, "frontend_question_id": "1677", "is_new_question": false }, @@ -30588,8 +30945,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": 13076, - "total_submitted": 18964, + "total_acs": 13082, + "total_submitted": 18975, "total_column_articles": 93, "frontend_question_id": "1719", "is_new_question": false @@ -30609,8 +30966,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 3492, - "total_submitted": 6872, + "total_acs": 3503, + "total_submitted": 6888, "total_column_articles": 79, "frontend_question_id": "1718", "is_new_question": false @@ -30630,9 +30987,9 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 3913, - "total_submitted": 8447, - "total_column_articles": 85, + "total_acs": 3928, + "total_submitted": 8481, + "total_column_articles": 86, "frontend_question_id": "1717", "is_new_question": false }, @@ -30651,8 +31008,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 42851, - "total_submitted": 62056, + "total_acs": 42918, + "total_submitted": 62158, "total_column_articles": 751, "frontend_question_id": "1716", "is_new_question": false @@ -30672,8 +31029,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": 3418, - "total_submitted": 4271, + "total_acs": 3437, + "total_submitted": 4290, "total_column_articles": 53, "frontend_question_id": "1676", "is_new_question": false @@ -30693,8 +31050,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": 15009, - "total_submitted": 23136, + "total_acs": 15021, + "total_submitted": 23159, "total_column_articles": 164, "frontend_question_id": "1697", "is_new_question": false @@ -30714,8 +31071,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 13023, - "total_submitted": 32410, + "total_acs": 13118, + "total_submitted": 32566, "total_column_articles": 195, "frontend_question_id": "1696", "is_new_question": false @@ -30735,9 +31092,9 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 14446, - "total_submitted": 27735, - "total_column_articles": 233, + "total_acs": 14537, + "total_submitted": 27872, + "total_column_articles": 234, "frontend_question_id": "1695", "is_new_question": false }, @@ -30756,9 +31113,9 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 37925, - "total_submitted": 57438, - "total_column_articles": 575, + "total_acs": 37948, + "total_submitted": 57467, + "total_column_articles": 574, "frontend_question_id": "1694", "is_new_question": false }, @@ -30777,9 +31134,9 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 56482, - "total_submitted": 88824, - "total_column_articles": 309, + "total_acs": 57550, + "total_submitted": 90637, + "total_column_articles": 315, "frontend_question_id": "1667", "is_new_question": false }, @@ -30798,8 +31155,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": 532, - "total_submitted": 791, + "total_acs": 536, + "total_submitted": 797, "total_column_articles": 24, "frontend_question_id": "1666", "is_new_question": false @@ -30821,7 +31178,7 @@ "question__hide": false, "total_acs": 498, "total_submitted": 831, - "total_column_articles": 14, + "total_column_articles": 15, "frontend_question_id": "1714", "is_new_question": false }, @@ -30840,8 +31197,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 6637, - "total_submitted": 11877, + "total_acs": 6653, + "total_submitted": 11905, "total_column_articles": 136, "frontend_question_id": "1690", "is_new_question": false @@ -30861,8 +31218,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": 22392, - "total_submitted": 25865, + "total_acs": 22454, + "total_submitted": 25932, "total_column_articles": 300, "frontend_question_id": "1689", "is_new_question": false @@ -30882,8 +31239,8 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 61162, - "total_submitted": 73132, + "total_acs": 61388, + "total_submitted": 73419, "total_column_articles": 645, "frontend_question_id": "1688", "is_new_question": false @@ -30903,8 +31260,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": 11736, - "total_submitted": 20750, + "total_acs": 11740, + "total_submitted": 20760, "total_column_articles": 87, "frontend_question_id": "1703", "is_new_question": false @@ -30924,8 +31281,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 5078, - "total_submitted": 10521, + "total_acs": 5102, + "total_submitted": 10563, "total_column_articles": 101, "frontend_question_id": "1702", "is_new_question": false @@ -30945,9 +31302,9 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 7444, - "total_submitted": 12264, - "total_column_articles": 147, + "total_acs": 7479, + "total_submitted": 12319, + "total_column_articles": 148, "frontend_question_id": "1701", "is_new_question": false }, @@ -30966,9 +31323,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": 51019, - "total_submitted": 69793, - "total_column_articles": 767, + "total_acs": 51169, + "total_submitted": 69987, + "total_column_articles": 770, "frontend_question_id": "1700", "is_new_question": false }, @@ -30987,9 +31344,9 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 14612, - "total_submitted": 20488, - "total_column_articles": 159, + "total_acs": 15589, + "total_submitted": 21932, + "total_column_articles": 172, "frontend_question_id": "1661", "is_new_question": false }, @@ -31008,8 +31365,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 8143, - "total_submitted": 16283, + "total_acs": 8165, + "total_submitted": 16318, "total_column_articles": 94, "frontend_question_id": "1680", "is_new_question": false @@ -31029,9 +31386,9 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 12106, - "total_submitted": 20574, - "total_column_articles": 111, + "total_acs": 12118, + "total_submitted": 20598, + "total_column_articles": 112, "frontend_question_id": "1681", "is_new_question": false }, @@ -31050,9 +31407,9 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 19217, - "total_submitted": 35060, - "total_column_articles": 247, + "total_acs": 20082, + "total_submitted": 36492, + "total_column_articles": 254, "frontend_question_id": "1679", "is_new_question": false }, @@ -31071,8 +31428,8 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 57164, - "total_submitted": 66449, + "total_acs": 57262, + "total_submitted": 66629, "total_column_articles": 772, "frontend_question_id": "1678", "is_new_question": false @@ -31092,8 +31449,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 949, - "total_submitted": 1244, + "total_acs": 953, + "total_submitted": 1249, "total_column_articles": 36, "frontend_question_id": "1660", "is_new_question": false @@ -31113,8 +31470,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 1991, - "total_submitted": 3131, + "total_acs": 2008, + "total_submitted": 3152, "total_column_articles": 38, "frontend_question_id": "1651", "is_new_question": false @@ -31134,8 +31491,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 6553, - "total_submitted": 14369, + "total_acs": 6595, + "total_submitted": 14495, "total_column_articles": 73, "frontend_question_id": "1675", "is_new_question": false @@ -31155,8 +31512,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 4343, - "total_submitted": 10296, + "total_acs": 4357, + "total_submitted": 10313, "total_column_articles": 81, "frontend_question_id": "1674", "is_new_question": false @@ -31176,9 +31533,9 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 12054, - "total_submitted": 30367, - "total_column_articles": 229, + "total_acs": 12099, + "total_submitted": 30443, + "total_column_articles": 230, "frontend_question_id": "1673", "is_new_question": false }, @@ -31197,9 +31554,9 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 146816, - "total_submitted": 175508, - "total_column_articles": 1387, + "total_acs": 147296, + "total_submitted": 176108, + "total_column_articles": 1394, "frontend_question_id": "1672", "is_new_question": false }, @@ -31218,8 +31575,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": 5165, - "total_submitted": 6441, + "total_acs": 5191, + "total_submitted": 6469, "total_column_articles": 66, "frontend_question_id": "1650", "is_new_question": false @@ -31239,8 +31596,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 12667, - "total_submitted": 21551, + "total_acs": 12692, + "total_submitted": 21596, "total_column_articles": 99, "frontend_question_id": "1687", "is_new_question": false @@ -31260,8 +31617,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 4963, - "total_submitted": 9878, + "total_acs": 4988, + "total_submitted": 9910, "total_column_articles": 80, "frontend_question_id": "1686", "is_new_question": false @@ -31281,9 +31638,9 @@ "question__title": "Sum of Absolute Differences in a Sorted Array", "question__title_slug": "sum-of-absolute-differences-in-a-sorted-array", "question__hide": false, - "total_acs": 8095, - "total_submitted": 12443, - "total_column_articles": 174, + "total_acs": 8132, + "total_submitted": 12491, + "total_column_articles": 177, "frontend_question_id": "1685", "is_new_question": false }, @@ -31302,9 +31659,9 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 62124, - "total_submitted": 72919, - "total_column_articles": 848, + "total_acs": 62244, + "total_submitted": 73086, + "total_column_articles": 849, "frontend_question_id": "1684", "is_new_question": false }, @@ -31323,8 +31680,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 1951, - "total_submitted": 4734, + "total_acs": 1962, + "total_submitted": 4757, "total_column_articles": 37, "frontend_question_id": "1645", "is_new_question": false @@ -31344,8 +31701,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 7915, - "total_submitted": 12076, + "total_acs": 7946, + "total_submitted": 12116, "total_column_articles": 125, "frontend_question_id": "1665", "is_new_question": false @@ -31365,8 +31722,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 25103, - "total_submitted": 37735, + "total_acs": 25126, + "total_submitted": 37763, "total_column_articles": 399, "frontend_question_id": "1664", "is_new_question": false @@ -31386,8 +31743,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": 26793, - "total_submitted": 41185, + "total_acs": 26809, + "total_submitted": 41209, "total_column_articles": 350, "frontend_question_id": "1663", "is_new_question": false @@ -31407,9 +31764,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": 69235, - "total_submitted": 85488, - "total_column_articles": 710, + "total_acs": 69322, + "total_submitted": 85596, + "total_column_articles": 709, "frontend_question_id": "1662", "is_new_question": false }, @@ -31428,8 +31785,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": 4446, - "total_submitted": 7870, + "total_acs": 4486, + "total_submitted": 7922, "total_column_articles": 57, "frontend_question_id": "1644", "is_new_question": false @@ -31449,8 +31806,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 2858, - "total_submitted": 5840, + "total_acs": 2868, + "total_submitted": 5856, "total_column_articles": 55, "frontend_question_id": "1635", "is_new_question": false @@ -31470,8 +31827,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 8201, - "total_submitted": 12651, + "total_acs": 8214, + "total_submitted": 12666, "total_column_articles": 70, "frontend_question_id": "1659", "is_new_question": false @@ -31491,9 +31848,9 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 14116, - "total_submitted": 29836, - "total_column_articles": 188, + "total_acs": 14747, + "total_submitted": 31093, + "total_column_articles": 195, "frontend_question_id": "1657", "is_new_question": false }, @@ -31512,9 +31869,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": 39630, - "total_submitted": 100868, - "total_column_articles": 441, + "total_acs": 39838, + "total_submitted": 101515, + "total_column_articles": 443, "frontend_question_id": "1658", "is_new_question": false }, @@ -31533,8 +31890,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 39853, - "total_submitted": 47403, + "total_acs": 39892, + "total_submitted": 47448, "total_column_articles": 369, "frontend_question_id": "1656", "is_new_question": false @@ -31554,8 +31911,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": 1978, - "total_submitted": 3283, + "total_acs": 1979, + "total_submitted": 3284, "total_column_articles": 56, "frontend_question_id": "1634", "is_new_question": false @@ -31575,9 +31932,9 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 16321, - "total_submitted": 26524, - "total_column_articles": 115, + "total_acs": 17043, + "total_submitted": 27871, + "total_column_articles": 117, "frontend_question_id": "1633", "is_new_question": false }, @@ -31596,8 +31953,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 4339, - "total_submitted": 8794, + "total_acs": 4355, + "total_submitted": 8829, "total_column_articles": 99, "frontend_question_id": "1649", "is_new_question": false @@ -31617,9 +31974,9 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 7577, - "total_submitted": 23941, - "total_column_articles": 147, + "total_acs": 7607, + "total_submitted": 24015, + "total_column_articles": 148, "frontend_question_id": "1648", "is_new_question": false }, @@ -31638,8 +31995,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": 12721, - "total_submitted": 23312, + "total_acs": 12747, + "total_submitted": 23351, "total_column_articles": 189, "frontend_question_id": "1647", "is_new_question": false @@ -31659,8 +32016,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 50737, - "total_submitted": 97932, + "total_acs": 50889, + "total_submitted": 98231, "total_column_articles": 510, "frontend_question_id": "1646", "is_new_question": false @@ -31701,9 +32058,9 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 7971, - "total_submitted": 15333, - "total_column_articles": 149, + "total_acs": 8002, + "total_submitted": 15394, + "total_column_articles": 148, "frontend_question_id": "1670", "is_new_question": false }, @@ -31722,9 +32079,9 @@ "question__title": "Minimum Number of Removals to Make Mountain Array", "question__title_slug": "minimum-number-of-removals-to-make-mountain-array", "question__hide": false, - "total_acs": 4132, - "total_submitted": 8859, - "total_column_articles": 78, + "total_acs": 4163, + "total_submitted": 8924, + "total_column_articles": 79, "frontend_question_id": "1671", "is_new_question": false }, @@ -31743,9 +32100,9 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 46302, - "total_submitted": 59963, - "total_column_articles": 630, + "total_acs": 46451, + "total_submitted": 60179, + "total_column_articles": 632, "frontend_question_id": "1669", "is_new_question": false }, @@ -31764,9 +32121,9 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 43977, - "total_submitted": 93570, - "total_column_articles": 595, + "total_acs": 44051, + "total_submitted": 93775, + "total_column_articles": 598, "frontend_question_id": "1668", "is_new_question": false }, @@ -31785,9 +32142,9 @@ "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": 6266, - "total_submitted": 7977, - "total_column_articles": 61, + "total_acs": 6287, + "total_submitted": 8001, + "total_column_articles": 64, "frontend_question_id": "1623", "is_new_question": false }, @@ -31806,9 +32163,9 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 10882, - "total_submitted": 23994, - "total_column_articles": 173, + "total_acs": 10927, + "total_submitted": 24168, + "total_column_articles": 174, "frontend_question_id": "1642", "is_new_question": false }, @@ -31827,8 +32184,8 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 39513, - "total_submitted": 47960, + "total_acs": 39569, + "total_submitted": 48020, "total_column_articles": 600, "frontend_question_id": "1641", "is_new_question": false @@ -31848,9 +32205,9 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 44957, - "total_submitted": 73746, - "total_column_articles": 663, + "total_acs": 44995, + "total_submitted": 73790, + "total_column_articles": 664, "frontend_question_id": "1640", "is_new_question": false }, @@ -31869,9 +32226,9 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 5535, - "total_submitted": 7576, - "total_column_articles": 66, + "total_acs": 5553, + "total_submitted": 7600, + "total_column_articles": 67, "frontend_question_id": "1613", "is_new_question": false }, @@ -31890,8 +32247,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 4086, - "total_submitted": 10356, + "total_acs": 4135, + "total_submitted": 10424, "total_column_articles": 63, "frontend_question_id": "1655", "is_new_question": false @@ -31911,8 +32268,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 9075, - "total_submitted": 29132, + "total_acs": 9087, + "total_submitted": 29169, "total_column_articles": 116, "frontend_question_id": "1654", "is_new_question": false @@ -31932,8 +32289,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 34654, - "total_submitted": 56831, + "total_acs": 34723, + "total_submitted": 56927, "total_column_articles": 357, "frontend_question_id": "1653", "is_new_question": false @@ -31953,8 +32310,8 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 37768, - "total_submitted": 56868, + "total_acs": 37826, + "total_submitted": 56936, "total_column_articles": 610, "frontend_question_id": "1652", "is_new_question": false @@ -31974,9 +32331,9 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 43676, - "total_submitted": 85765, - "total_column_articles": 452, + "total_acs": 43905, + "total_submitted": 86266, + "total_column_articles": 454, "frontend_question_id": "1631", "is_new_question": false }, @@ -31995,8 +32352,8 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 33875, - "total_submitted": 44473, + "total_acs": 33886, + "total_submitted": 44485, "total_column_articles": 448, "frontend_question_id": "1630", "is_new_question": false @@ -32016,9 +32373,9 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 37487, - "total_submitted": 67152, - "total_column_articles": 451, + "total_acs": 37548, + "total_submitted": 67259, + "total_column_articles": 452, "frontend_question_id": "1629", "is_new_question": false }, @@ -32037,8 +32394,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": 901, - "total_submitted": 1209, + "total_acs": 911, + "total_submitted": 1220, "total_column_articles": 35, "frontend_question_id": "1612", "is_new_question": false @@ -32058,9 +32415,9 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 11015, - "total_submitted": 20314, - "total_column_articles": 93, + "total_acs": 11186, + "total_submitted": 20621, + "total_column_articles": 94, "frontend_question_id": "1607", "is_new_question": false }, @@ -32079,8 +32436,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 25224, - "total_submitted": 46998, + "total_acs": 25259, + "total_submitted": 47076, "total_column_articles": 249, "frontend_question_id": "1626", "is_new_question": false @@ -32100,8 +32457,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 17371, - "total_submitted": 26043, + "total_acs": 17386, + "total_submitted": 26060, "total_column_articles": 150, "frontend_question_id": "1625", "is_new_question": false @@ -32121,9 +32478,9 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 47080, - "total_submitted": 73094, - "total_column_articles": 697, + "total_acs": 47161, + "total_submitted": 73219, + "total_column_articles": 699, "frontend_question_id": "1624", "is_new_question": false }, @@ -32142,9 +32499,9 @@ "question__title": "Find Nearest Right Node in Binary Tree", "question__title_slug": "find-nearest-right-node-in-binary-tree", "question__hide": false, - "total_acs": 2050, - "total_submitted": 2781, - "total_column_articles": 61, + "total_acs": 2062, + "total_submitted": 2795, + "total_column_articles": 62, "frontend_question_id": "1602", "is_new_question": false }, @@ -32163,9 +32520,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": 2680, - "total_submitted": 5690, - "total_column_articles": 60, + "total_acs": 2699, + "total_submitted": 5720, + "total_column_articles": 61, "frontend_question_id": "1639", "is_new_question": false }, @@ -32184,8 +32541,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": 22749, - "total_submitted": 29308, + "total_acs": 22778, + "total_submitted": 29351, "total_column_articles": 194, "frontend_question_id": "1638", "is_new_question": false @@ -32205,8 +32562,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": 30225, - "total_submitted": 35838, + "total_acs": 30268, + "total_submitted": 35882, "total_column_articles": 275, "frontend_question_id": "1637", "is_new_question": false @@ -32226,9 +32583,9 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 48570, - "total_submitted": 64985, - "total_column_articles": 611, + "total_acs": 48719, + "total_submitted": 65156, + "total_column_articles": 612, "frontend_question_id": "1636", "is_new_question": false }, @@ -32247,8 +32604,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": 12683, - "total_submitted": 16015, + "total_acs": 12703, + "total_submitted": 16044, "total_column_articles": 101, "frontend_question_id": "1617", "is_new_question": false @@ -32268,8 +32625,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 24108, - "total_submitted": 64209, + "total_acs": 24132, + "total_submitted": 64258, "total_column_articles": 261, "frontend_question_id": "1616", "is_new_question": false @@ -32289,9 +32646,9 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 32684, - "total_submitted": 54303, - "total_column_articles": 294, + "total_acs": 32784, + "total_submitted": 54443, + "total_column_articles": 293, "frontend_question_id": "1615", "is_new_question": false }, @@ -32310,8 +32667,8 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 65194, - "total_submitted": 79284, + "total_acs": 65463, + "total_submitted": 79633, "total_column_articles": 848, "frontend_question_id": "1614", "is_new_question": false @@ -32352,9 +32709,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": 7915, - "total_submitted": 10820, - "total_column_articles": 94, + "total_acs": 7993, + "total_submitted": 10931, + "total_column_articles": 96, "frontend_question_id": "1596", "is_new_question": false }, @@ -32373,8 +32730,8 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 30309, - "total_submitted": 37990, + "total_acs": 30566, + "total_submitted": 38341, "total_column_articles": 164, "frontend_question_id": "1587", "is_new_question": false @@ -32394,8 +32751,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 17668, - "total_submitted": 39789, + "total_acs": 17673, + "total_submitted": 39810, "total_column_articles": 161, "frontend_question_id": "1610", "is_new_question": false @@ -32415,8 +32772,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": 3321, - "total_submitted": 5484, + "total_acs": 3325, + "total_submitted": 5492, "total_column_articles": 75, "frontend_question_id": "1611", "is_new_question": false @@ -32436,8 +32793,8 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 33460, - "total_submitted": 57615, + "total_acs": 33565, + "total_submitted": 57763, "total_column_articles": 504, "frontend_question_id": "1609", "is_new_question": false @@ -32457,9 +32814,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": 54843, - "total_submitted": 89394, - "total_column_articles": 815, + "total_acs": 54924, + "total_submitted": 89524, + "total_column_articles": 814, "frontend_question_id": "1608", "is_new_question": false }, @@ -32478,8 +32835,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 877, - "total_submitted": 1384, + "total_acs": 881, + "total_submitted": 1388, "total_column_articles": 40, "frontend_question_id": "1586", "is_new_question": false @@ -32499,8 +32856,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 5204, - "total_submitted": 30007, + "total_acs": 5211, + "total_submitted": 30095, "total_column_articles": 108, "frontend_question_id": "1622", "is_new_question": false @@ -32541,9 +32898,9 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 29133, - "total_submitted": 63307, - "total_column_articles": 283, + "total_acs": 29157, + "total_submitted": 63350, + "total_column_articles": 284, "frontend_question_id": "1620", "is_new_question": false }, @@ -32562,8 +32919,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": 3114, - "total_submitted": 6488, + "total_acs": 3125, + "total_submitted": 6514, "total_column_articles": 55, "frontend_question_id": "1621", "is_new_question": false @@ -32583,9 +32940,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": 51345, - "total_submitted": 65435, - "total_column_articles": 305, + "total_acs": 52451, + "total_submitted": 67019, + "total_column_articles": 309, "frontend_question_id": "1581", "is_new_question": false }, @@ -32604,9 +32961,9 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 22380, - "total_submitted": 36152, - "total_column_articles": 244, + "total_acs": 22414, + "total_submitted": 36200, + "total_column_articles": 245, "frontend_question_id": "1601", "is_new_question": false }, @@ -32625,9 +32982,9 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 19352, - "total_submitted": 29463, - "total_column_articles": 235, + "total_acs": 19409, + "total_submitted": 29538, + "total_column_articles": 236, "frontend_question_id": "1600", "is_new_question": false }, @@ -32646,8 +33003,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": 22417, - "total_submitted": 43570, + "total_acs": 22450, + "total_submitted": 43624, "total_column_articles": 269, "frontend_question_id": "1599", "is_new_question": false @@ -32667,9 +33024,9 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 44622, - "total_submitted": 64189, - "total_column_articles": 563, + "total_acs": 44664, + "total_submitted": 64244, + "total_column_articles": 562, "frontend_question_id": "1598", "is_new_question": false }, @@ -32709,9 +33066,9 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 11910, - "total_submitted": 15337, - "total_column_articles": 97, + "total_acs": 12004, + "total_submitted": 15469, + "total_column_articles": 98, "frontend_question_id": "1571", "is_new_question": false }, @@ -32730,9 +33087,9 @@ "question__title": "Minimum Cost to Connect Two Groups of Points", "question__title_slug": "minimum-cost-to-connect-two-groups-of-points", "question__hide": false, - "total_acs": 10746, - "total_submitted": 16352, - "total_column_articles": 90, + "total_acs": 10757, + "total_submitted": 16368, + "total_column_articles": 91, "frontend_question_id": "1595", "is_new_question": false }, @@ -32751,9 +33108,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": 6648, - "total_submitted": 19572, - "total_column_articles": 136, + "total_acs": 6671, + "total_submitted": 19614, + "total_column_articles": 137, "frontend_question_id": "1594", "is_new_question": false }, @@ -32772,9 +33129,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": 9249, - "total_submitted": 16048, - "total_column_articles": 143, + "total_acs": 9277, + "total_submitted": 16096, + "total_column_articles": 144, "frontend_question_id": "1593", "is_new_question": false }, @@ -32793,8 +33150,8 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 41186, - "total_submitted": 88240, + "total_acs": 41237, + "total_submitted": 88346, "total_column_articles": 581, "frontend_question_id": "1592", "is_new_question": false @@ -32814,8 +33171,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 4318, - "total_submitted": 4860, + "total_acs": 4327, + "total_submitted": 4869, "total_column_articles": 59, "frontend_question_id": "1570", "is_new_question": false @@ -32835,9 +33192,9 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 6229, - "total_submitted": 8412, - "total_column_articles": 54, + "total_acs": 6250, + "total_submitted": 8439, + "total_column_articles": 57, "frontend_question_id": "1565", "is_new_question": false }, @@ -32856,8 +33213,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": 27542, - "total_submitted": 34055, + "total_acs": 27571, + "total_submitted": 34092, "total_column_articles": 276, "frontend_question_id": "1605", "is_new_question": false @@ -32877,8 +33234,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": 21297, - "total_submitted": 43981, + "total_acs": 21311, + "total_submitted": 44003, "total_column_articles": 204, "frontend_question_id": "1606", "is_new_question": false @@ -32898,9 +33255,9 @@ "question__title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "question__title_slug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "question__hide": false, - "total_acs": 28990, - "total_submitted": 57549, - "total_column_articles": 346, + "total_acs": 29039, + "total_submitted": 57641, + "total_column_articles": 347, "frontend_question_id": "1604", "is_new_question": false }, @@ -32919,8 +33276,8 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 77258, - "total_submitted": 92325, + "total_acs": 77413, + "total_submitted": 92509, "total_column_articles": 589, "frontend_question_id": "1603", "is_new_question": false @@ -32940,8 +33297,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": 3419, - "total_submitted": 7883, + "total_acs": 3426, + "total_submitted": 7907, "total_column_articles": 54, "frontend_question_id": "1585", "is_new_question": false @@ -32961,9 +33318,9 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 52429, - "total_submitted": 80001, - "total_column_articles": 653, + "total_acs": 52658, + "total_submitted": 80341, + "total_column_articles": 655, "frontend_question_id": "1584", "is_new_question": false }, @@ -32982,8 +33339,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 20694, - "total_submitted": 30471, + "total_acs": 20714, + "total_submitted": 30504, "total_column_articles": 257, "frontend_question_id": "1583", "is_new_question": false @@ -33003,9 +33360,9 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 41652, - "total_submitted": 60004, - "total_column_articles": 471, + "total_acs": 41759, + "total_submitted": 60190, + "total_column_articles": 475, "frontend_question_id": "1582", "is_new_question": false }, @@ -33024,8 +33381,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 1186, - "total_submitted": 2012, + "total_acs": 1188, + "total_submitted": 2016, "total_column_articles": 41, "frontend_question_id": "1564", "is_new_question": false @@ -33045,9 +33402,9 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 5494, - "total_submitted": 12211, - "total_column_articles": 76, + "total_acs": 5520, + "total_submitted": 12274, + "total_column_articles": 77, "frontend_question_id": "1555", "is_new_question": false }, @@ -33066,8 +33423,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": 18831, - "total_submitted": 30338, + "total_acs": 18852, + "total_submitted": 30362, "total_column_articles": 329, "frontend_question_id": "1579", "is_new_question": false @@ -33087,9 +33444,9 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 15647, - "total_submitted": 26258, - "total_column_articles": 267, + "total_acs": 15696, + "total_submitted": 26328, + "total_column_articles": 269, "frontend_question_id": "1578", "is_new_question": false }, @@ -33108,8 +33465,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": 7051, - "total_submitted": 20287, + "total_acs": 7063, + "total_submitted": 20303, "total_column_articles": 112, "frontend_question_id": "1577", "is_new_question": false @@ -33129,9 +33486,9 @@ "question__title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "question__title_slug": "replace-all-s-to-avoid-consecutive-repeating-characters", "question__hide": false, - "total_acs": 53094, - "total_submitted": 104345, - "total_column_articles": 654, + "total_acs": 53185, + "total_submitted": 104557, + "total_column_articles": 657, "frontend_question_id": "1576", "is_new_question": false }, @@ -33150,8 +33507,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 1263, - "total_submitted": 2556, + "total_acs": 1264, + "total_submitted": 2579, "total_column_articles": 34, "frontend_question_id": "1554", "is_new_question": false @@ -33171,8 +33528,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 2453, - "total_submitted": 3829, + "total_acs": 2465, + "total_submitted": 3847, "total_column_articles": 68, "frontend_question_id": "1591", "is_new_question": false @@ -33192,8 +33549,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 6669, - "total_submitted": 20552, + "total_acs": 6700, + "total_submitted": 20615, "total_column_articles": 97, "frontend_question_id": "1589", "is_new_question": false @@ -33213,8 +33570,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 25860, - "total_submitted": 71112, + "total_acs": 25882, + "total_submitted": 71161, "total_column_articles": 200, "frontend_question_id": "1590", "is_new_question": false @@ -33234,9 +33591,9 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 66851, - "total_submitted": 80431, - "total_column_articles": 991, + "total_acs": 67080, + "total_submitted": 80723, + "total_column_articles": 993, "frontend_question_id": "1588", "is_new_question": false }, @@ -33255,8 +33612,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": 3387, - "total_submitted": 6903, + "total_acs": 3408, + "total_submitted": 6941, "total_column_articles": 66, "frontend_question_id": "1569", "is_new_question": false @@ -33276,8 +33633,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": 4013, - "total_submitted": 8913, + "total_acs": 4030, + "total_submitted": 8969, "total_column_articles": 84, "frontend_question_id": "1568", "is_new_question": false @@ -33297,8 +33654,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": 34639, - "total_submitted": 81149, + "total_acs": 34725, + "total_submitted": 81284, "total_column_articles": 462, "frontend_question_id": "1567", "is_new_question": false @@ -33318,8 +33675,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": 12735, - "total_submitted": 28718, + "total_acs": 12809, + "total_submitted": 28855, "total_column_articles": 184, "frontend_question_id": "1566", "is_new_question": false @@ -33339,9 +33696,9 @@ "question__title": "The Most Recent Orders for Each Product", "question__title_slug": "the-most-recent-orders-for-each-product", "question__hide": false, - "total_acs": 9732, - "total_submitted": 14385, - "total_column_articles": 122, + "total_acs": 9794, + "total_submitted": 14497, + "total_column_articles": 124, "frontend_question_id": "1549", "is_new_question": false }, @@ -33360,8 +33717,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": 736, - "total_submitted": 1077, + "total_acs": 737, + "total_submitted": 1078, "total_column_articles": 24, "frontend_question_id": "1548", "is_new_question": false @@ -33381,9 +33738,9 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 5801, - "total_submitted": 10442, - "total_column_articles": 56, + "total_acs": 5821, + "total_submitted": 10472, + "total_column_articles": 57, "frontend_question_id": "1543", "is_new_question": false }, @@ -33402,8 +33759,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 5905, - "total_submitted": 14865, + "total_acs": 5944, + "total_submitted": 14961, "total_column_articles": 80, "frontend_question_id": "1563", "is_new_question": false @@ -33423,9 +33780,9 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 7046, - "total_submitted": 19191, - "total_column_articles": 133, + "total_acs": 7056, + "total_submitted": 19210, + "total_column_articles": 134, "frontend_question_id": "1562", "is_new_question": false }, @@ -33444,8 +33801,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": 16980, - "total_submitted": 21867, + "total_acs": 17036, + "total_submitted": 21932, "total_column_articles": 254, "frontend_question_id": "1561", "is_new_question": false @@ -33465,8 +33822,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": 12120, - "total_submitted": 21093, + "total_acs": 12197, + "total_submitted": 21205, "total_column_articles": 131, "frontend_question_id": "1560", "is_new_question": false @@ -33486,9 +33843,9 @@ "question__title": "Guess the Majority in a Hidden Array", "question__title_slug": "guess-the-majority-in-a-hidden-array", "question__hide": false, - "total_acs": 450, - "total_submitted": 758, - "total_column_articles": 15, + "total_acs": 459, + "total_submitted": 771, + "total_column_articles": 16, "frontend_question_id": "1538", "is_new_question": false }, @@ -33507,8 +33864,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 12326, - "total_submitted": 21515, + "total_acs": 12399, + "total_submitted": 21649, "total_column_articles": 127, "frontend_question_id": "1575", "is_new_question": false @@ -33528,8 +33885,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": 26778, - "total_submitted": 62035, + "total_acs": 26823, + "total_submitted": 62144, "total_column_articles": 291, "frontend_question_id": "1574", "is_new_question": false @@ -33549,8 +33906,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": 6943, - "total_submitted": 22231, + "total_acs": 6981, + "total_submitted": 22381, "total_column_articles": 96, "frontend_question_id": "1573", "is_new_question": false @@ -33570,9 +33927,9 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 59603, - "total_submitted": 71556, - "total_column_articles": 750, + "total_acs": 61989, + "total_submitted": 74364, + "total_column_articles": 766, "frontend_question_id": "1572", "is_new_question": false }, @@ -33591,8 +33948,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": 11056, - "total_submitted": 34080, + "total_acs": 11080, + "total_submitted": 34158, "total_column_articles": 151, "frontend_question_id": "1553", "is_new_question": false @@ -33612,9 +33969,9 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 18197, - "total_submitted": 31915, - "total_column_articles": 230, + "total_acs": 18264, + "total_submitted": 32023, + "total_column_articles": 232, "frontend_question_id": "1552", "is_new_question": false }, @@ -33633,8 +33990,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 15473, - "total_submitted": 18829, + "total_acs": 15517, + "total_submitted": 18880, "total_column_articles": 226, "frontend_question_id": "1551", "is_new_question": false @@ -33654,9 +34011,9 @@ "question__title": "Find the Index of the Large Integer", "question__title_slug": "find-the-index-of-the-large-integer", "question__hide": false, - "total_acs": 1298, - "total_submitted": 2211, - "total_column_articles": 44, + "total_acs": 1354, + "total_submitted": 2318, + "total_column_articles": 47, "frontend_question_id": "1533", "is_new_question": false }, @@ -33675,9 +34032,9 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 8024, - "total_submitted": 12699, - "total_column_articles": 98, + "total_acs": 8089, + "total_submitted": 12803, + "total_column_articles": 100, "frontend_question_id": "1532", "is_new_question": false }, @@ -33696,9 +34053,9 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 57484, - "total_submitted": 123061, - "total_column_articles": 283, + "total_acs": 58473, + "total_submitted": 125025, + "total_column_articles": 288, "frontend_question_id": "1527", "is_new_question": false }, @@ -33717,9 +34074,9 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 6877, - "total_submitted": 12112, - "total_column_articles": 112, + "total_acs": 6909, + "total_submitted": 12152, + "total_column_articles": 113, "frontend_question_id": "1547", "is_new_question": false }, @@ -33738,8 +34095,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 4441, - "total_submitted": 10066, + "total_acs": 4450, + "total_submitted": 10079, "total_column_articles": 78, "frontend_question_id": "1542", "is_new_question": false @@ -33759,8 +34116,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": 15130, - "total_submitted": 25669, + "total_acs": 15154, + "total_submitted": 25705, "total_column_articles": 189, "frontend_question_id": "1545", "is_new_question": false @@ -33780,9 +34137,9 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 29169, - "total_submitted": 52147, - "total_column_articles": 460, + "total_acs": 29247, + "total_submitted": 52248, + "total_column_articles": 461, "frontend_question_id": "1544", "is_new_question": false }, @@ -33801,9 +34158,9 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 2689, - "total_submitted": 3747, - "total_column_articles": 65, + "total_acs": 2722, + "total_submitted": 3789, + "total_column_articles": 66, "frontend_question_id": "1522", "is_new_question": false }, @@ -33822,9 +34179,9 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 10715, - "total_submitted": 20862, - "total_column_articles": 88, + "total_acs": 11661, + "total_submitted": 22656, + "total_column_articles": 95, "frontend_question_id": "1517", "is_new_question": false }, @@ -33843,9 +34200,9 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 7117, - "total_submitted": 17519, - "total_column_articles": 116, + "total_acs": 7141, + "total_submitted": 17556, + "total_column_articles": 117, "frontend_question_id": "1559", "is_new_question": false }, @@ -33864,8 +34221,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": 6511, - "total_submitted": 10354, + "total_acs": 6521, + "total_submitted": 10367, "total_column_articles": 97, "frontend_question_id": "1558", "is_new_question": false @@ -33885,8 +34242,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": 18991, - "total_submitted": 23278, + "total_acs": 19038, + "total_submitted": 23340, "total_column_articles": 238, "frontend_question_id": "1557", "is_new_question": false @@ -33906,8 +34263,8 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 20304, - "total_submitted": 36188, + "total_acs": 20425, + "total_submitted": 36388, "total_column_articles": 307, "frontend_question_id": "1556", "is_new_question": false @@ -33927,8 +34284,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 6954, - "total_submitted": 17319, + "total_acs": 6972, + "total_submitted": 17348, "total_column_articles": 133, "frontend_question_id": "1537", "is_new_question": false @@ -33948,9 +34305,9 @@ "question__title": "Minimum Swaps to Arrange a Binary Grid", "question__title_slug": "minimum-swaps-to-arrange-a-binary-grid", "question__hide": false, - "total_acs": 5407, - "total_submitted": 11661, - "total_column_articles": 97, + "total_acs": 5421, + "total_submitted": 11685, + "total_column_articles": 98, "frontend_question_id": "1536", "is_new_question": false }, @@ -33969,8 +34326,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": 16916, - "total_submitted": 36599, + "total_acs": 16942, + "total_submitted": 36646, "total_column_articles": 225, "frontend_question_id": "1535", "is_new_question": false @@ -33990,8 +34347,8 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 28933, - "total_submitted": 37854, + "total_acs": 29366, + "total_submitted": 38533, "total_column_articles": 264, "frontend_question_id": "1534", "is_new_question": false @@ -34032,9 +34389,9 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 8932, - "total_submitted": 13043, - "total_column_articles": 102, + "total_acs": 9022, + "total_submitted": 13303, + "total_column_articles": 104, "frontend_question_id": "1511", "is_new_question": false }, @@ -34053,9 +34410,9 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 11551, - "total_submitted": 19735, - "total_column_articles": 206, + "total_acs": 11597, + "total_submitted": 19809, + "total_column_articles": 207, "frontend_question_id": "1530", "is_new_question": false }, @@ -34074,8 +34431,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 11628, - "total_submitted": 16523, + "total_acs": 11659, + "total_submitted": 16558, "total_column_articles": 187, "frontend_question_id": "1529", "is_new_question": false @@ -34095,9 +34452,9 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 39584, - "total_submitted": 50454, - "total_column_articles": 490, + "total_acs": 39706, + "total_submitted": 50615, + "total_column_articles": 491, "frontend_question_id": "1528", "is_new_question": false }, @@ -34116,8 +34473,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 1449, - "total_submitted": 1791, + "total_acs": 1484, + "total_submitted": 1836, "total_column_articles": 33, "frontend_question_id": "1506", "is_new_question": false @@ -34137,8 +34494,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": 7501, - "total_submitted": 16677, + "total_acs": 7518, + "total_submitted": 16709, "total_column_articles": 111, "frontend_question_id": "1546", "is_new_question": false @@ -34158,9 +34515,9 @@ "question__title": "Minimum Insertions to Balance a Parentheses String", "question__title_slug": "minimum-insertions-to-balance-a-parentheses-string", "question__hide": false, - "total_acs": 19169, - "total_submitted": 39268, - "total_column_articles": 227, + "total_acs": 19286, + "total_submitted": 39462, + "total_column_articles": 230, "frontend_question_id": "1541", "is_new_question": false }, @@ -34179,8 +34536,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 6830, - "total_submitted": 20379, + "total_acs": 6861, + "total_submitted": 20496, "total_column_articles": 113, "frontend_question_id": "1540", "is_new_question": false @@ -34200,9 +34557,9 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 42320, - "total_submitted": 78324, - "total_column_articles": 574, + "total_acs": 42526, + "total_submitted": 78699, + "total_column_articles": 577, "frontend_question_id": "1539", "is_new_question": false }, @@ -34221,8 +34578,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": 4237, - "total_submitted": 9666, + "total_acs": 4250, + "total_submitted": 9690, "total_column_articles": 80, "frontend_question_id": "1521", "is_new_question": false @@ -34242,8 +34599,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 3439, - "total_submitted": 9616, + "total_acs": 3454, + "total_submitted": 9635, "total_column_articles": 88, "frontend_question_id": "1520", "is_new_question": false @@ -34263,8 +34620,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": 7547, - "total_submitted": 22608, + "total_acs": 7571, + "total_submitted": 22650, "total_column_articles": 151, "frontend_question_id": "1519", "is_new_question": false @@ -34284,8 +34641,8 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 62466, - "total_submitted": 89801, + "total_acs": 62557, + "total_submitted": 89950, "total_column_articles": 917, "frontend_question_id": "1518", "is_new_question": false @@ -34305,8 +34662,8 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 13710, - "total_submitted": 24027, + "total_acs": 13805, + "total_submitted": 24278, "total_column_articles": 149, "frontend_question_id": "1501", "is_new_question": false @@ -34326,8 +34683,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 1966, - "total_submitted": 6606, + "total_acs": 1967, + "total_submitted": 6607, "total_column_articles": 52, "frontend_question_id": "1500", "is_new_question": false @@ -34347,9 +34704,9 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 7725, - "total_submitted": 14420, - "total_column_articles": 51, + "total_acs": 7792, + "total_submitted": 14540, + "total_column_articles": 52, "frontend_question_id": "1495", "is_new_question": false }, @@ -34368,8 +34725,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 4631, - "total_submitted": 13120, + "total_acs": 4638, + "total_submitted": 13132, "total_column_articles": 72, "frontend_question_id": "1515", "is_new_question": false @@ -34389,8 +34746,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 2908, - "total_submitted": 7609, + "total_acs": 2920, + "total_submitted": 7636, "total_column_articles": 49, "frontend_question_id": "1531", "is_new_question": false @@ -34410,8 +34767,8 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 14747, - "total_submitted": 37237, + "total_acs": 14781, + "total_submitted": 37313, "total_column_articles": 207, "frontend_question_id": "1513", "is_new_question": false @@ -34431,9 +34788,9 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 79369, - "total_submitted": 94423, - "total_column_articles": 986, + "total_acs": 79956, + "total_submitted": 95216, + "total_column_articles": 990, "frontend_question_id": "1512", "is_new_question": false }, @@ -34452,9 +34809,9 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 2330, - "total_submitted": 2808, - "total_column_articles": 53, + "total_acs": 2390, + "total_submitted": 2870, + "total_column_articles": 54, "frontend_question_id": "1490", "is_new_question": false }, @@ -34473,8 +34830,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": 5239, - "total_submitted": 8048, + "total_acs": 5254, + "total_submitted": 8066, "total_column_articles": 95, "frontend_question_id": "1526", "is_new_question": false @@ -34494,8 +34851,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": 8733, - "total_submitted": 13207, + "total_acs": 8761, + "total_submitted": 13239, "total_column_articles": 160, "frontend_question_id": "1525", "is_new_question": false @@ -34515,8 +34872,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": 9756, - "total_submitted": 21240, + "total_acs": 9788, + "total_submitted": 21288, "total_column_articles": 170, "frontend_question_id": "1524", "is_new_question": false @@ -34536,9 +34893,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": 49937, - "total_submitted": 101458, - "total_column_articles": 715, + "total_acs": 50304, + "total_submitted": 102223, + "total_column_articles": 720, "frontend_question_id": "1523", "is_new_question": false }, @@ -34557,8 +34914,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": 4749, - "total_submitted": 11846, + "total_acs": 4760, + "total_submitted": 11864, "total_column_articles": 97, "frontend_question_id": "1505", "is_new_question": false @@ -34578,8 +34935,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 11934, - "total_submitted": 19074, + "total_acs": 12035, + "total_submitted": 19229, "total_column_articles": 176, "frontend_question_id": "1504", "is_new_question": false @@ -34599,8 +34956,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": 12065, - "total_submitted": 22319, + "total_acs": 12110, + "total_submitted": 22368, "total_column_articles": 125, "frontend_question_id": "1503", "is_new_question": false @@ -34620,9 +34977,9 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 47202, - "total_submitted": 68091, - "total_column_articles": 602, + "total_acs": 47535, + "total_submitted": 68624, + "total_column_articles": 605, "frontend_question_id": "1502", "is_new_question": false }, @@ -34641,9 +34998,9 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 56815, - "total_submitted": 83684, - "total_column_articles": 322, + "total_acs": 57535, + "total_submitted": 84659, + "total_column_articles": 325, "frontend_question_id": "1484", "is_new_question": false }, @@ -34662,8 +35019,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 1536, - "total_submitted": 1953, + "total_acs": 1540, + "total_submitted": 1957, "total_column_articles": 39, "frontend_question_id": "1485", "is_new_question": false @@ -34683,9 +35040,9 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 3960, - "total_submitted": 7093, - "total_column_articles": 65, + "total_acs": 3982, + "total_submitted": 7122, + "total_column_articles": 66, "frontend_question_id": "1479", "is_new_question": false }, @@ -34704,8 +35061,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 16362, - "total_submitted": 33919, + "total_acs": 16421, + "total_submitted": 34128, "total_column_articles": 174, "frontend_question_id": "1499", "is_new_question": false @@ -34725,8 +35082,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": 10762, - "total_submitted": 28013, + "total_acs": 10817, + "total_submitted": 28138, "total_column_articles": 136, "frontend_question_id": "1498", "is_new_question": false @@ -34746,9 +35103,9 @@ "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": 13267, - "total_submitted": 33003, - "total_column_articles": 152, + "total_acs": 13330, + "total_submitted": 33145, + "total_column_articles": 153, "frontend_question_id": "1497", "is_new_question": false }, @@ -34767,9 +35124,9 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 16904, - "total_submitted": 31622, - "total_column_articles": 251, + "total_acs": 16982, + "total_submitted": 31726, + "total_column_articles": 254, "frontend_question_id": "1496", "is_new_question": false }, @@ -34788,9 +35145,9 @@ "question__title": "Delete N Nodes After M Nodes of a Linked List", "question__title_slug": "delete-n-nodes-after-m-nodes-of-a-linked-list", "question__hide": false, - "total_acs": 4030, - "total_submitted": 5793, - "total_column_articles": 113, + "total_acs": 4092, + "total_submitted": 5869, + "total_column_articles": 114, "frontend_question_id": "1474", "is_new_question": false }, @@ -34809,8 +35166,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 8557, - "total_submitted": 14201, + "total_acs": 8589, + "total_submitted": 14245, "total_column_articles": 108, "frontend_question_id": "1510", "is_new_question": false @@ -34830,8 +35187,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": 8086, - "total_submitted": 14582, + "total_acs": 8112, + "total_submitted": 14618, "total_column_articles": 139, "frontend_question_id": "1509", "is_new_question": false @@ -34851,8 +35208,8 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 11035, - "total_submitted": 19090, + "total_acs": 11067, + "total_submitted": 19136, "total_column_articles": 114, "frontend_question_id": "1508", "is_new_question": false @@ -34872,9 +35229,9 @@ "question__title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "question__title_slug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree", "question__hide": false, - "total_acs": 13615, - "total_submitted": 20483, - "total_column_articles": 151, + "total_acs": 13671, + "total_submitted": 20565, + "total_column_articles": 152, "frontend_question_id": "1489", "is_new_question": false }, @@ -34893,9 +35250,9 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 12657, - "total_submitted": 48090, - "total_column_articles": 172, + "total_acs": 12683, + "total_submitted": 48217, + "total_column_articles": 173, "frontend_question_id": "1488", "is_new_question": false }, @@ -34914,8 +35271,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 35911, - "total_submitted": 86556, + "total_acs": 35972, + "total_submitted": 86775, "total_column_articles": 337, "frontend_question_id": "1487", "is_new_question": false @@ -34935,9 +35292,9 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 86580, - "total_submitted": 101785, - "total_column_articles": 807, + "total_acs": 87021, + "total_submitted": 102365, + "total_column_articles": 809, "frontend_question_id": "1486", "is_new_question": false }, @@ -34956,9 +35313,9 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 5125, - "total_submitted": 6231, - "total_column_articles": 139, + "total_acs": 5134, + "total_submitted": 6241, + "total_column_articles": 140, "frontend_question_id": "1469", "is_new_question": false }, @@ -34977,9 +35334,9 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 5665, - "total_submitted": 8084, - "total_column_articles": 65, + "total_acs": 5696, + "total_submitted": 8133, + "total_column_articles": 66, "frontend_question_id": "1468", "is_new_question": false }, @@ -34998,9 +35355,9 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 6482, - "total_submitted": 10346, - "total_column_articles": 99, + "total_acs": 6510, + "total_submitted": 10402, + "total_column_articles": 100, "frontend_question_id": "1459", "is_new_question": false }, @@ -35019,9 +35376,9 @@ "question__title": "Minimum Number of Days to Make m Bouquets", "question__title_slug": "minimum-number-of-days-to-make-m-bouquets", "question__hide": false, - "total_acs": 41767, - "total_submitted": 73689, - "total_column_articles": 511, + "total_acs": 41827, + "total_submitted": 73793, + "total_column_articles": 513, "frontend_question_id": "1482", "is_new_question": false }, @@ -35040,9 +35397,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": 20027, - "total_submitted": 44162, - "total_column_articles": 257, + "total_acs": 20083, + "total_submitted": 44260, + "total_column_articles": 258, "frontend_question_id": "1481", "is_new_question": false }, @@ -35061,9 +35418,9 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 323276, - "total_submitted": 422866, - "total_column_articles": 2542, + "total_acs": 323945, + "total_submitted": 423784, + "total_column_articles": 2552, "frontend_question_id": "1480", "is_new_question": false }, @@ -35082,8 +35439,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 12296, - "total_submitted": 23701, + "total_acs": 12312, + "total_submitted": 23726, "total_column_articles": 102, "frontend_question_id": "1494", "is_new_question": false @@ -35103,9 +35460,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": 22932, - "total_submitted": 38080, - "total_column_articles": 346, + "total_acs": 23637, + "total_submitted": 39090, + "total_column_articles": 354, "frontend_question_id": "1493", "is_new_question": false }, @@ -35124,8 +35481,8 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 15873, - "total_submitted": 26121, + "total_acs": 15966, + "total_submitted": 26252, "total_column_articles": 160, "frontend_question_id": "1492", "is_new_question": false @@ -35145,9 +35502,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": 53682, - "total_submitted": 85713, - "total_column_articles": 704, + "total_acs": 53995, + "total_submitted": 86198, + "total_column_articles": 709, "frontend_question_id": "1491", "is_new_question": false }, @@ -35166,8 +35523,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 17701, - "total_submitted": 26703, + "total_acs": 17724, + "total_submitted": 26739, "total_column_articles": 195, "frontend_question_id": "1473", "is_new_question": false @@ -35187,8 +35544,8 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 17229, - "total_submitted": 27981, + "total_acs": 17277, + "total_submitted": 28063, "total_column_articles": 266, "frontend_question_id": "1472", "is_new_question": false @@ -35208,8 +35565,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": 9999, - "total_submitted": 17978, + "total_acs": 10022, + "total_submitted": 18012, "total_column_articles": 145, "frontend_question_id": "1471", "is_new_question": false @@ -35229,9 +35586,9 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 102694, - "total_submitted": 121372, - "total_column_articles": 1161, + "total_acs": 103075, + "total_submitted": 121853, + "total_column_articles": 1163, "frontend_question_id": "1470", "is_new_question": false }, @@ -35250,9 +35607,9 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 10839, - "total_submitted": 28333, - "total_column_articles": 126, + "total_acs": 10894, + "total_submitted": 28455, + "total_column_articles": 128, "frontend_question_id": "1454", "is_new_question": false }, @@ -35271,8 +35628,8 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 13578, - "total_submitted": 16156, + "total_acs": 13684, + "total_submitted": 16299, "total_column_articles": 133, "frontend_question_id": "1445", "is_new_question": false @@ -35292,8 +35649,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": 2659, - "total_submitted": 4216, + "total_acs": 2675, + "total_submitted": 4240, "total_column_articles": 70, "frontend_question_id": "1467", "is_new_question": false @@ -35313,9 +35670,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": 14217, - "total_submitted": 27683, - "total_column_articles": 250, + "total_acs": 14522, + "total_submitted": 28235, + "total_column_articles": 256, "frontend_question_id": "1466", "is_new_question": false }, @@ -35334,8 +35691,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": 9098, - "total_submitted": 27594, + "total_acs": 9147, + "total_submitted": 27696, "total_column_articles": 106, "frontend_question_id": "1465", "is_new_question": false @@ -35355,9 +35712,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": 76595, - "total_submitted": 97540, - "total_column_articles": 866, + "total_acs": 76878, + "total_submitted": 97935, + "total_column_articles": 869, "frontend_question_id": "1464", "is_new_question": false }, @@ -35376,9 +35733,9 @@ "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": 9036, - "total_submitted": 29040, - "total_column_articles": 147, + "total_acs": 9082, + "total_submitted": 29140, + "total_column_articles": 148, "frontend_question_id": "1477", "is_new_question": false }, @@ -35397,8 +35754,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 16198, - "total_submitted": 18705, + "total_acs": 16230, + "total_submitted": 18741, "total_column_articles": 147, "frontend_question_id": "1476", "is_new_question": false @@ -35418,8 +35775,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 5761, - "total_submitted": 9171, + "total_acs": 5778, + "total_submitted": 9205, "total_column_articles": 97, "frontend_question_id": "1478", "is_new_question": false @@ -35439,9 +35796,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": 68625, - "total_submitted": 93632, - "total_column_articles": 865, + "total_acs": 68848, + "total_submitted": 93923, + "total_column_articles": 867, "frontend_question_id": "1475", "is_new_question": false }, @@ -35460,9 +35817,9 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 8056, - "total_submitted": 17130, - "total_column_articles": 128, + "total_acs": 8120, + "total_submitted": 17213, + "total_column_articles": 130, "frontend_question_id": "1458", "is_new_question": false }, @@ -35481,9 +35838,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": 11741, - "total_submitted": 18895, - "total_column_articles": 190, + "total_acs": 11782, + "total_submitted": 18959, + "total_column_articles": 191, "frontend_question_id": "1457", "is_new_question": false }, @@ -35502,9 +35859,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": 33712, - "total_submitted": 60968, - "total_column_articles": 395, + "total_acs": 34599, + "total_submitted": 62326, + "total_column_articles": 400, "frontend_question_id": "1456", "is_new_question": false }, @@ -35523,9 +35880,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": 42051, - "total_submitted": 64904, - "total_column_articles": 706, + "total_acs": 42134, + "total_submitted": 65041, + "total_column_articles": 708, "frontend_question_id": "1455", "is_new_question": false }, @@ -35544,9 +35901,9 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 9084, - "total_submitted": 13030, - "total_column_articles": 91, + "total_acs": 9210, + "total_submitted": 13222, + "total_column_articles": 92, "frontend_question_id": "1440", "is_new_question": false }, @@ -35565,9 +35922,9 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 7219, - "total_submitted": 11301, - "total_column_articles": 61, + "total_acs": 7271, + "total_submitted": 11375, + "total_column_articles": 64, "frontend_question_id": "1435", "is_new_question": false }, @@ -35586,8 +35943,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": 2300, - "total_submitted": 6066, + "total_acs": 2304, + "total_submitted": 6075, "total_column_articles": 43, "frontend_question_id": "1453", "is_new_question": false @@ -35607,8 +35964,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": 8030, - "total_submitted": 15695, + "total_acs": 8055, + "total_submitted": 15755, "total_column_articles": 121, "frontend_question_id": "1452", "is_new_question": false @@ -35628,8 +35985,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 14106, - "total_submitted": 26123, + "total_acs": 14159, + "total_submitted": 26203, "total_column_articles": 214, "frontend_question_id": "1451", "is_new_question": false @@ -35649,9 +36006,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": 61062, - "total_submitted": 74191, - "total_column_articles": 689, + "total_acs": 61195, + "total_submitted": 74368, + "total_column_articles": 690, "frontend_question_id": "1450", "is_new_question": false }, @@ -35670,9 +36027,9 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 4912, - "total_submitted": 7908, - "total_column_articles": 108, + "total_acs": 4939, + "total_submitted": 7948, + "total_column_articles": 109, "frontend_question_id": "1463", "is_new_question": false }, @@ -35691,8 +36048,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 12637, - "total_submitted": 27544, + "total_acs": 12707, + "total_submitted": 27729, "total_column_articles": 225, "frontend_question_id": "1462", "is_new_question": false @@ -35712,8 +36069,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": 9839, - "total_submitted": 18742, + "total_acs": 9885, + "total_submitted": 18843, "total_column_articles": 133, "frontend_question_id": "1461", "is_new_question": false @@ -35733,9 +36090,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": 54227, - "total_submitted": 70268, - "total_column_articles": 757, + "total_acs": 54318, + "total_submitted": 70373, + "total_column_articles": 759, "frontend_question_id": "1460", "is_new_question": false }, @@ -35754,9 +36111,9 @@ "question__title": "Number of Ways of Cutting a Pizza", "question__title_slug": "number-of-ways-of-cutting-a-pizza", "question__hide": false, - "total_acs": 6021, - "total_submitted": 11064, - "total_column_articles": 100, + "total_acs": 17135, + "total_submitted": 27565, + "total_column_articles": 158, "frontend_question_id": "1444", "is_new_question": false }, @@ -35775,8 +36132,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": 8113, - "total_submitted": 18787, + "total_acs": 8178, + "total_submitted": 18914, "total_column_articles": 197, "frontend_question_id": "1443", "is_new_question": false @@ -35796,8 +36153,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": 39148, - "total_submitted": 49343, + "total_acs": 39189, + "total_submitted": 49396, "total_column_articles": 415, "frontend_question_id": "1442", "is_new_question": false @@ -35817,9 +36174,9 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 49110, - "total_submitted": 68633, - "total_column_articles": 900, + "total_acs": 49202, + "total_submitted": 68751, + "total_column_articles": 902, "frontend_question_id": "1441", "is_new_question": false }, @@ -35838,9 +36195,9 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 6114, - "total_submitted": 8604, - "total_column_articles": 48, + "total_acs": 6172, + "total_submitted": 8675, + "total_column_articles": 50, "frontend_question_id": "1421", "is_new_question": false }, @@ -35859,8 +36216,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": 16627, - "total_submitted": 25057, + "total_acs": 16671, + "total_submitted": 25122, "total_column_articles": 138, "frontend_question_id": "1439", "is_new_question": false @@ -35880,8 +36237,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": 46547, - "total_submitted": 93572, + "total_acs": 46670, + "total_submitted": 93786, "total_column_articles": 592, "frontend_question_id": "1438", "is_new_question": false @@ -35901,9 +36258,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": 17010, - "total_submitted": 30654, - "total_column_articles": 261, + "total_acs": 17104, + "total_submitted": 30816, + "total_column_articles": 264, "frontend_question_id": "1437", "is_new_question": false }, @@ -35922,9 +36279,9 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 53891, - "total_submitted": 65914, - "total_column_articles": 770, + "total_acs": 53973, + "total_submitted": 66019, + "total_column_articles": 773, "frontend_question_id": "1436", "is_new_question": false }, @@ -35943,9 +36300,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": 7092, - "total_submitted": 13106, - "total_column_articles": 127, + "total_acs": 7176, + "total_submitted": 13378, + "total_column_articles": 129, "frontend_question_id": "1412", "is_new_question": false }, @@ -35964,9 +36321,9 @@ "question__title": "Form Largest Integer With Digits That Add up to Target", "question__title_slug": "form-largest-integer-with-digits-that-add-up-to-target", "question__hide": false, - "total_acs": 19412, - "total_submitted": 31167, - "total_column_articles": 233, + "total_acs": 19448, + "total_submitted": 31219, + "total_column_articles": 234, "frontend_question_id": "1449", "is_new_question": false }, @@ -35985,9 +36342,9 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 23715, - "total_submitted": 33344, - "total_column_articles": 337, + "total_acs": 24293, + "total_submitted": 34185, + "total_column_articles": 339, "frontend_question_id": "1448", "is_new_question": false }, @@ -36006,9 +36363,9 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 41894, - "total_submitted": 62092, - "total_column_articles": 531, + "total_acs": 41963, + "total_submitted": 62194, + "total_column_articles": 532, "frontend_question_id": "1447", "is_new_question": false }, @@ -36027,9 +36384,9 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 60036, - "total_submitted": 99686, - "total_column_articles": 801, + "total_acs": 60213, + "total_submitted": 99981, + "total_column_articles": 805, "frontend_question_id": "1446", "is_new_question": false }, @@ -36048,9 +36405,9 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 37520, - "total_submitted": 66224, - "total_column_articles": 269, + "total_acs": 37853, + "total_submitted": 66864, + "total_column_articles": 268, "frontend_question_id": "1407", "is_new_question": false }, @@ -36069,9 +36426,9 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 10684, - "total_submitted": 25251, - "total_column_articles": 214, + "total_acs": 10704, + "total_submitted": 25296, + "total_column_articles": 215, "frontend_question_id": "1424", "is_new_question": false }, @@ -36090,8 +36447,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": 48143, - "total_submitted": 87574, + "total_acs": 48290, + "total_submitted": 87832, "total_column_articles": 657, "frontend_question_id": "1423", "is_new_question": false @@ -36111,9 +36468,9 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 43540, - "total_submitted": 76808, - "total_column_articles": 699, + "total_acs": 43832, + "total_submitted": 77290, + "total_column_articles": 701, "frontend_question_id": "1422", "is_new_question": false }, @@ -36132,9 +36489,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": 13287, - "total_submitted": 18499, - "total_column_articles": 150, + "total_acs": 13485, + "total_submitted": 18782, + "total_column_articles": 152, "frontend_question_id": "1398", "is_new_question": false }, @@ -36153,8 +36510,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": 3887, - "total_submitted": 6098, + "total_acs": 3899, + "total_submitted": 6117, "total_column_articles": 68, "frontend_question_id": "1420", "is_new_question": false @@ -36174,9 +36531,9 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 32285, - "total_submitted": 64283, - "total_column_articles": 441, + "total_acs": 32381, + "total_submitted": 64492, + "total_column_articles": 440, "frontend_question_id": "1419", "is_new_question": false }, @@ -36195,9 +36552,9 @@ "question__title": "Display Table of Food Orders in a Restaurant", "question__title_slug": "display-table-of-food-orders-in-a-restaurant", "question__hide": false, - "total_acs": 29143, - "total_submitted": 39838, - "total_column_articles": 454, + "total_acs": 29169, + "total_submitted": 39872, + "total_column_articles": 455, "frontend_question_id": "1418", "is_new_question": false }, @@ -36216,9 +36573,9 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 47189, - "total_submitted": 85574, - "total_column_articles": 626, + "total_acs": 47238, + "total_submitted": 85664, + "total_column_articles": 627, "frontend_question_id": "1417", "is_new_question": false }, @@ -36237,8 +36594,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": 4324, - "total_submitted": 8361, + "total_acs": 4343, + "total_submitted": 8389, "total_column_articles": 72, "frontend_question_id": "1434", "is_new_question": false @@ -36258,8 +36615,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": 8687, - "total_submitted": 13412, + "total_acs": 8711, + "total_submitted": 13444, "total_column_articles": 148, "frontend_question_id": "1433", "is_new_question": false @@ -36279,8 +36636,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": 6509, - "total_submitted": 16311, + "total_acs": 6530, + "total_submitted": 16365, "total_column_articles": 138, "frontend_question_id": "1432", "is_new_question": false @@ -36300,9 +36657,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": 102850, - "total_submitted": 121613, - "total_column_articles": 1246, + "total_acs": 104092, + "total_submitted": 123076, + "total_column_articles": 1252, "frontend_question_id": "1431", "is_new_question": false }, @@ -36321,8 +36678,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": 10023, - "total_submitted": 17483, + "total_acs": 10051, + "total_submitted": 17513, "total_column_articles": 168, "frontend_question_id": "1411", "is_new_question": false @@ -36342,9 +36699,9 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 9608, - "total_submitted": 20442, - "total_column_articles": 145, + "total_acs": 9625, + "total_submitted": 20489, + "total_column_articles": 146, "frontend_question_id": "1410", "is_new_question": false }, @@ -36363,8 +36720,8 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 11409, - "total_submitted": 14013, + "total_acs": 11432, + "total_submitted": 14040, "total_column_articles": 200, "frontend_question_id": "1409", "is_new_question": false @@ -36384,9 +36741,9 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 45653, - "total_submitted": 70918, - "total_column_articles": 563, + "total_acs": 45736, + "total_submitted": 71050, + "total_column_articles": 564, "frontend_question_id": "1408", "is_new_question": false }, @@ -36405,8 +36762,8 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 31508, - "total_submitted": 37674, + "total_acs": 31683, + "total_submitted": 37903, "total_column_articles": 264, "frontend_question_id": "1393", "is_new_question": false @@ -36426,8 +36783,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 8238, - "total_submitted": 13938, + "total_acs": 8273, + "total_submitted": 13994, "total_column_articles": 127, "frontend_question_id": "1406", "is_new_question": false @@ -36447,8 +36804,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": 10073, - "total_submitted": 19722, + "total_acs": 10099, + "total_submitted": 19762, "total_column_articles": 200, "frontend_question_id": "1404", "is_new_question": false @@ -36468,9 +36825,9 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 56569, - "total_submitted": 77141, - "total_column_articles": 764, + "total_acs": 56669, + "total_submitted": 77273, + "total_column_articles": 765, "frontend_question_id": "1403", "is_new_question": false }, @@ -36489,9 +36846,9 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 5087, - "total_submitted": 8820, - "total_column_articles": 101, + "total_acs": 5117, + "total_submitted": 8860, + "total_column_articles": 103, "frontend_question_id": "1384", "is_new_question": false }, @@ -36510,8 +36867,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 4859, - "total_submitted": 11431, + "total_acs": 4886, + "total_submitted": 11478, "total_column_articles": 82, "frontend_question_id": "1416", "is_new_question": false @@ -36531,9 +36888,9 @@ "question__title": "The k-th Lexicographical String of All Happy Strings of Length n", "question__title_slug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "question__hide": false, - "total_acs": 9261, - "total_submitted": 13512, - "total_column_articles": 238, + "total_acs": 9283, + "total_submitted": 13537, + "total_column_articles": 239, "frontend_question_id": "1415", "is_new_question": false }, @@ -36552,8 +36909,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": 30579, - "total_submitted": 43485, + "total_acs": 30624, + "total_submitted": 43563, "total_column_articles": 456, "frontend_question_id": "1414", "is_new_question": false @@ -36573,9 +36930,9 @@ "question__title": "Minimum Value to Get Positive Step by Step Sum", "question__title_slug": "minimum-value-to-get-positive-step-by-step-sum", "question__hide": false, - "total_acs": 47484, - "total_submitted": 64986, - "total_column_articles": 705, + "total_acs": 47621, + "total_submitted": 65168, + "total_column_articles": 706, "frontend_question_id": "1413", "is_new_question": false }, @@ -36594,8 +36951,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 2251, - "total_submitted": 5110, + "total_acs": 2260, + "total_submitted": 5127, "total_column_articles": 71, "frontend_question_id": "1397", "is_new_question": false @@ -36615,9 +36972,9 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 21852, - "total_submitted": 52018, - "total_column_articles": 275, + "total_acs": 21895, + "total_submitted": 52142, + "total_column_articles": 276, "frontend_question_id": "1396", "is_new_question": false }, @@ -36636,8 +36993,8 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 20102, - "total_submitted": 28246, + "total_acs": 20173, + "total_submitted": 28365, "total_column_articles": 295, "frontend_question_id": "1395", "is_new_question": false @@ -36657,9 +37014,9 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 26701, - "total_submitted": 40720, - "total_column_articles": 432, + "total_acs": 26877, + "total_submitted": 40949, + "total_column_articles": 434, "frontend_question_id": "1394", "is_new_question": false }, @@ -36678,9 +37035,9 @@ "question__title": "Replace Employee ID With The Unique Identifier", "question__title_slug": "replace-employee-id-with-the-unique-identifier", "question__hide": false, - "total_acs": 23595, - "total_submitted": 27966, - "total_column_articles": 123, + "total_acs": 25141, + "total_submitted": 29876, + "total_column_articles": 129, "frontend_question_id": "1378", "is_new_question": false }, @@ -36699,8 +37056,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 14474, - "total_submitted": 32456, + "total_acs": 14509, + "total_submitted": 32532, "total_column_articles": 234, "frontend_question_id": "1392", "is_new_question": false @@ -36720,9 +37077,9 @@ "question__title": "Check if There is a Valid Path in a Grid", "question__title_slug": "check-if-there-is-a-valid-path-in-a-grid", "question__hide": false, - "total_acs": 8897, - "total_submitted": 21187, - "total_column_articles": 268, + "total_acs": 8940, + "total_submitted": 21250, + "total_column_articles": 269, "frontend_question_id": "1391", "is_new_question": false }, @@ -36741,9 +37098,9 @@ "question__title": "Create Target Array in the Given Order", "question__title_slug": "create-target-array-in-the-given-order", "question__hide": false, - "total_acs": 35717, - "total_submitted": 43051, - "total_column_articles": 583, + "total_acs": 35823, + "total_submitted": 43184, + "total_column_articles": 586, "frontend_question_id": "1389", "is_new_question": false }, @@ -36762,9 +37119,9 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 6761, - "total_submitted": 10969, - "total_column_articles": 83, + "total_acs": 6788, + "total_submitted": 11016, + "total_column_articles": 85, "frontend_question_id": "1369", "is_new_question": false }, @@ -36783,9 +37140,9 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 14968, - "total_submitted": 19660, - "total_column_articles": 249, + "total_acs": 15011, + "total_submitted": 19711, + "total_column_articles": 250, "frontend_question_id": "1402", "is_new_question": false }, @@ -36804,9 +37161,9 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 9772, - "total_submitted": 15941, - "total_column_articles": 155, + "total_acs": 9796, + "total_submitted": 15983, + "total_column_articles": 156, "frontend_question_id": "1400", "is_new_question": false }, @@ -36825,8 +37182,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 18006, - "total_submitted": 34785, + "total_acs": 18037, + "total_submitted": 34841, "total_column_articles": 253, "frontend_question_id": "1401", "is_new_question": false @@ -36846,9 +37203,9 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 14338, - "total_submitted": 21384, - "total_column_articles": 213, + "total_acs": 14382, + "total_submitted": 21461, + "total_column_articles": 214, "frontend_question_id": "1399", "is_new_question": false }, @@ -36867,8 +37224,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 6920, - "total_submitted": 19550, + "total_acs": 6948, + "total_submitted": 19616, "total_column_articles": 131, "frontend_question_id": "1383", "is_new_question": false @@ -36888,8 +37245,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": 17964, - "total_submitted": 21572, + "total_acs": 18035, + "total_submitted": 21651, "total_column_articles": 252, "frontend_question_id": "1379", "is_new_question": false @@ -36909,9 +37266,9 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 18281, - "total_submitted": 25223, - "total_column_articles": 230, + "total_acs": 18323, + "total_submitted": 25278, + "total_column_articles": 231, "frontend_question_id": "1381", "is_new_question": false }, @@ -36930,8 +37287,8 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 56679, - "total_submitted": 74284, + "total_acs": 56793, + "total_submitted": 74433, "total_column_articles": 762, "frontend_question_id": "1380", "is_new_question": false @@ -36951,9 +37308,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": 6247, - "total_submitted": 9145, - "total_column_articles": 90, + "total_acs": 6274, + "total_submitted": 9192, + "total_column_articles": 91, "frontend_question_id": "1364", "is_new_question": false }, @@ -36972,9 +37329,9 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 7267, - "total_submitted": 10865, - "total_column_articles": 86, + "total_acs": 7300, + "total_submitted": 10919, + "total_column_articles": 87, "frontend_question_id": "1355", "is_new_question": false }, @@ -36993,9 +37350,9 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 18633, - "total_submitted": 43686, - "total_column_articles": 273, + "total_acs": 18692, + "total_submitted": 43847, + "total_column_articles": 274, "frontend_question_id": "1377", "is_new_question": false }, @@ -37014,9 +37371,9 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 32492, - "total_submitted": 54066, - "total_column_articles": 436, + "total_acs": 32597, + "total_submitted": 54226, + "total_column_articles": 439, "frontend_question_id": "1376", "is_new_question": false }, @@ -37035,8 +37392,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": 27994, - "total_submitted": 41108, + "total_acs": 28009, + "total_submitted": 41142, "total_column_articles": 424, "frontend_question_id": "1375", "is_new_question": false @@ -37056,9 +37413,9 @@ "question__title": "Generate a String With Characters That Have Odd Counts", "question__title_slug": "generate-a-string-with-characters-that-have-odd-counts", "question__hide": false, - "total_acs": 54050, - "total_submitted": 69581, - "total_column_articles": 553, + "total_acs": 54111, + "total_submitted": 69654, + "total_column_articles": 554, "frontend_question_id": "1374", "is_new_question": false }, @@ -37077,9 +37434,9 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 7161, - "total_submitted": 12665, - "total_column_articles": 77, + "total_acs": 17619, + "total_submitted": 27184, + "total_column_articles": 117, "frontend_question_id": "1388", "is_new_question": false }, @@ -37098,8 +37455,8 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 15528, - "total_submitted": 22363, + "total_acs": 15600, + "total_submitted": 22463, "total_column_articles": 270, "frontend_question_id": "1387", "is_new_question": false @@ -37119,8 +37476,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 10226, - "total_submitted": 28738, + "total_acs": 10264, + "total_submitted": 28800, "total_column_articles": 176, "frontend_question_id": "1386", "is_new_question": false @@ -37140,9 +37497,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": 40151, - "total_submitted": 62611, - "total_column_articles": 518, + "total_acs": 40322, + "total_submitted": 62840, + "total_column_articles": 517, "frontend_question_id": "1385", "is_new_question": false }, @@ -37161,8 +37518,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": 7880, - "total_submitted": 13166, + "total_acs": 7908, + "total_submitted": 13210, "total_column_articles": 155, "frontend_question_id": "1368", "is_new_question": false @@ -37182,8 +37539,8 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 24905, - "total_submitted": 56865, + "total_acs": 24989, + "total_submitted": 57029, "total_column_articles": 355, "frontend_question_id": "1367", "is_new_question": false @@ -37203,8 +37560,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 12875, - "total_submitted": 25165, + "total_acs": 12925, + "total_submitted": 25229, "total_column_articles": 214, "frontend_question_id": "1366", "is_new_question": false @@ -37224,9 +37581,9 @@ "question__title": "How Many Numbers Are Smaller Than the Current Number", "question__title_slug": "how-many-numbers-are-smaller-than-the-current-number", "question__hide": false, - "total_acs": 118071, - "total_submitted": 143333, - "total_column_articles": 1325, + "total_acs": 118462, + "total_submitted": 143810, + "total_column_articles": 1327, "frontend_question_id": "1365", "is_new_question": false }, @@ -37245,9 +37602,9 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 13052, - "total_submitted": 15326, - "total_column_articles": 105, + "total_acs": 13140, + "total_submitted": 15423, + "total_column_articles": 107, "frontend_question_id": "1350", "is_new_question": false }, @@ -37266,9 +37623,9 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 11887, - "total_submitted": 30804, - "total_column_articles": 134, + "total_acs": 12236, + "total_submitted": 32043, + "total_column_articles": 138, "frontend_question_id": "1341", "is_new_question": false }, @@ -37287,9 +37644,9 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 4336, - "total_submitted": 14979, - "total_column_articles": 93, + "total_acs": 4360, + "total_submitted": 15032, + "total_column_articles": 94, "frontend_question_id": "1354", "is_new_question": false }, @@ -37308,8 +37665,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": 18840, - "total_submitted": 63969, + "total_acs": 18922, + "total_submitted": 64163, "total_column_articles": 219, "frontend_question_id": "1353", "is_new_question": false @@ -37329,9 +37686,9 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 12663, - "total_submitted": 26165, - "total_column_articles": 132, + "total_acs": 12745, + "total_submitted": 26318, + "total_column_articles": 133, "frontend_question_id": "1352", "is_new_question": false }, @@ -37350,9 +37707,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": 52959, - "total_submitted": 71363, - "total_column_articles": 805, + "total_acs": 53294, + "total_submitted": 71797, + "total_column_articles": 811, "frontend_question_id": "1351", "is_new_question": false }, @@ -37371,9 +37728,9 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 29034, - "total_submitted": 60573, - "total_column_articles": 411, + "total_acs": 29156, + "total_submitted": 60814, + "total_column_articles": 412, "frontend_question_id": "1373", "is_new_question": false }, @@ -37392,9 +37749,9 @@ "question__title": "Longest ZigZag Path in a Binary Tree", "question__title_slug": "longest-zigzag-path-in-a-binary-tree", "question__hide": false, - "total_acs": 18501, - "total_submitted": 33708, - "total_column_articles": 286, + "total_acs": 18968, + "total_submitted": 34462, + "total_column_articles": 288, "frontend_question_id": "1372", "is_new_question": false }, @@ -37413,8 +37770,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": 26860, - "total_submitted": 45408, + "total_acs": 26895, + "total_submitted": 45459, "total_column_articles": 329, "frontend_question_id": "1371", "is_new_question": false @@ -37434,8 +37791,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 55032, - "total_submitted": 69683, + "total_acs": 55116, + "total_submitted": 69790, "total_column_articles": 672, "frontend_question_id": "1370", "is_new_question": false @@ -37455,8 +37812,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 5938, - "total_submitted": 10921, + "total_acs": 5981, + "total_submitted": 10983, "total_column_articles": 138, "frontend_question_id": "1349", "is_new_question": false @@ -37476,8 +37833,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 5497, - "total_submitted": 15663, + "total_acs": 5517, + "total_submitted": 15700, "total_column_articles": 80, "frontend_question_id": "1348", "is_new_question": false @@ -37497,8 +37854,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": 12303, - "total_submitted": 16135, + "total_acs": 12356, + "total_submitted": 16198, "total_column_articles": 178, "frontend_question_id": "1347", "is_new_question": false @@ -37518,9 +37875,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": 35956, - "total_submitted": 85860, - "total_column_articles": 546, + "total_acs": 36119, + "total_submitted": 86316, + "total_column_articles": 549, "frontend_question_id": "1346", "is_new_question": false }, @@ -37539,9 +37896,9 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 3855, - "total_submitted": 8475, - "total_column_articles": 82, + "total_acs": 3869, + "total_submitted": 8498, + "total_column_articles": 83, "frontend_question_id": "1336", "is_new_question": false }, @@ -37560,8 +37917,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 7283, - "total_submitted": 12241, + "total_acs": 7309, + "total_submitted": 12280, "total_column_articles": 138, "frontend_question_id": "1340", "is_new_question": false @@ -37581,9 +37938,9 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 13599, - "total_submitted": 32678, - "total_column_articles": 191, + "total_acs": 13668, + "total_submitted": 32839, + "total_column_articles": 192, "frontend_question_id": "1339", "is_new_question": false }, @@ -37602,8 +37959,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 13501, - "total_submitted": 20800, + "total_acs": 13555, + "total_submitted": 20888, "total_column_articles": 187, "frontend_question_id": "1338", "is_new_question": false @@ -37623,9 +37980,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": 58309, - "total_submitted": 85024, - "total_column_articles": 917, + "total_acs": 58438, + "total_submitted": 85224, + "total_column_articles": 918, "frontend_question_id": "1337", "is_new_question": false }, @@ -37644,9 +38001,9 @@ "question__title": "List the Products Ordered in a Period", "question__title_slug": "list-the-products-ordered-in-a-period", "question__hide": false, - "total_acs": 13596, - "total_submitted": 19676, - "total_column_articles": 103, + "total_acs": 14053, + "total_submitted": 20379, + "total_column_articles": 108, "frontend_question_id": "1327", "is_new_question": false }, @@ -37665,8 +38022,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": 5762, - "total_submitted": 9862, + "total_acs": 5776, + "total_submitted": 9890, "total_column_articles": 123, "frontend_question_id": "1359", "is_new_question": false @@ -37686,8 +38043,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": 11231, - "total_submitted": 21156, + "total_acs": 11283, + "total_submitted": 21244, "total_column_articles": 189, "frontend_question_id": "1358", "is_new_question": false @@ -37707,8 +38064,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 7013, - "total_submitted": 12844, + "total_acs": 7032, + "total_submitted": 12872, "total_column_articles": 71, "frontend_question_id": "1357", "is_new_question": false @@ -37728,8 +38085,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": 63605, - "total_submitted": 86544, + "total_acs": 63787, + "total_submitted": 86758, "total_column_articles": 688, "frontend_question_id": "1356", "is_new_question": false @@ -37749,8 +38106,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 18044, - "total_submitted": 27049, + "total_acs": 18089, + "total_submitted": 27108, "total_column_articles": 176, "frontend_question_id": "1335", "is_new_question": false @@ -37770,8 +38127,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": 11818, - "total_submitted": 22334, + "total_acs": 11857, + "total_submitted": 22404, "total_column_articles": 169, "frontend_question_id": "1334", "is_new_question": false @@ -37791,8 +38148,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": 8254, - "total_submitted": 14498, + "total_acs": 8273, + "total_submitted": 14522, "total_column_articles": 167, "frontend_question_id": "1333", "is_new_question": false @@ -37812,8 +38169,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 36127, - "total_submitted": 46473, + "total_acs": 36187, + "total_submitted": 46543, "total_column_articles": 380, "frontend_question_id": "1332", "is_new_question": false @@ -37833,9 +38190,9 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 9320, - "total_submitted": 15620, - "total_column_articles": 85, + "total_acs": 9350, + "total_submitted": 15687, + "total_column_articles": 88, "frontend_question_id": "1322", "is_new_question": false }, @@ -37854,9 +38211,9 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 14200, - "total_submitted": 24110, - "total_column_articles": 196, + "total_acs": 14591, + "total_submitted": 25483, + "total_column_articles": 197, "frontend_question_id": "1321", "is_new_question": false }, @@ -37875,8 +38232,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": 26492, - "total_submitted": 48923, + "total_acs": 26538, + "total_submitted": 49025, "total_column_articles": 262, "frontend_question_id": "1326", "is_new_question": false @@ -37896,8 +38253,8 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 17632, - "total_submitted": 24060, + "total_acs": 17697, + "total_submitted": 24153, "total_column_articles": 267, "frontend_question_id": "1325", "is_new_question": false @@ -37917,8 +38274,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 9448, - "total_submitted": 15905, + "total_acs": 9489, + "total_submitted": 15947, "total_column_articles": 179, "frontend_question_id": "1324", "is_new_question": false @@ -37938,9 +38295,9 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 37725, - "total_submitted": 50374, - "total_column_articles": 649, + "total_acs": 37958, + "total_submitted": 50678, + "total_column_articles": 652, "frontend_question_id": "1323", "is_new_question": false }, @@ -37959,9 +38316,9 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 29434, - "total_submitted": 64519, - "total_column_articles": 316, + "total_acs": 29516, + "total_submitted": 64683, + "total_column_articles": 317, "frontend_question_id": "1345", "is_new_question": false }, @@ -37980,8 +38337,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 11780, - "total_submitted": 19573, + "total_acs": 11822, + "total_submitted": 19640, "total_column_articles": 182, "frontend_question_id": "1344", "is_new_question": false @@ -38001,8 +38358,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": 19934, - "total_submitted": 34647, + "total_acs": 19998, + "total_submitted": 34737, "total_column_articles": 306, "frontend_question_id": "1343", "is_new_question": false @@ -38022,9 +38379,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": 140482, - "total_submitted": 185209, - "total_column_articles": 1603, + "total_acs": 141023, + "total_submitted": 185988, + "total_column_articles": 1608, "frontend_question_id": "1342", "is_new_question": false }, @@ -38043,8 +38400,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": 3883, - "total_submitted": 6376, + "total_acs": 3914, + "total_submitted": 6414, "total_column_articles": 79, "frontend_question_id": "1320", "is_new_question": false @@ -38064,8 +38421,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": 45217, - "total_submitted": 72553, + "total_acs": 45297, + "total_submitted": 72667, "total_column_articles": 689, "frontend_question_id": "1319", "is_new_question": false @@ -38085,8 +38442,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": 10984, - "total_submitted": 16416, + "total_acs": 11215, + "total_submitted": 16742, "total_column_articles": 187, "frontend_question_id": "1318", "is_new_question": false @@ -38106,8 +38463,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": 15162, - "total_submitted": 24493, + "total_acs": 15263, + "total_submitted": 24642, "total_column_articles": 262, "frontend_question_id": "1317", "is_new_question": false @@ -38127,8 +38484,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 13190, - "total_submitted": 17922, + "total_acs": 13244, + "total_submitted": 17980, "total_column_articles": 102, "frontend_question_id": "1308", "is_new_question": false @@ -38148,9 +38505,9 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 22246, - "total_submitted": 26957, - "total_column_articles": 170, + "total_acs": 22333, + "total_submitted": 27052, + "total_column_articles": 171, "frontend_question_id": "1303", "is_new_question": false }, @@ -38169,9 +38526,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": 25925, - "total_submitted": 37457, - "total_column_articles": 261, + "total_acs": 26191, + "total_submitted": 37780, + "total_column_articles": 262, "frontend_question_id": "1312", "is_new_question": false }, @@ -38190,9 +38547,9 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 8031, - "total_submitted": 20037, - "total_column_articles": 118, + "total_acs": 8058, + "total_submitted": 20078, + "total_column_articles": 119, "frontend_question_id": "1311", "is_new_question": false }, @@ -38211,8 +38568,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 42839, - "total_submitted": 59461, + "total_acs": 42867, + "total_submitted": 59497, "total_column_articles": 560, "frontend_question_id": "1310", "is_new_question": false @@ -38232,9 +38589,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": 28245, - "total_submitted": 36777, - "total_column_articles": 488, + "total_acs": 28305, + "total_submitted": 36859, + "total_column_articles": 489, "frontend_question_id": "1309", "is_new_question": false }, @@ -38253,8 +38610,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 5648, - "total_submitted": 14263, + "total_acs": 5669, + "total_submitted": 14302, "total_column_articles": 90, "frontend_question_id": "2227", "is_new_question": false @@ -38274,8 +38631,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": 1436, - "total_submitted": 2630, + "total_acs": 1448, + "total_submitted": 2651, "total_column_articles": 54, "frontend_question_id": "1430", "is_new_question": false @@ -38295,9 +38652,9 @@ "question__title": "All Ancestors of a Node in a Directed Acyclic Graph", "question__title_slug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "question__hide": false, - "total_acs": 6427, - "total_submitted": 14218, - "total_column_articles": 116, + "total_acs": 6482, + "total_submitted": 14309, + "total_column_articles": 117, "frontend_question_id": "2192", "is_new_question": false }, @@ -38316,9 +38673,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": 10257, - "total_submitted": 16343, - "total_column_articles": 128, + "total_acs": 10318, + "total_submitted": 16444, + "total_column_articles": 127, "frontend_question_id": "2269", "is_new_question": false }, @@ -38337,8 +38694,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 2869, - "total_submitted": 8205, + "total_acs": 2980, + "total_submitted": 8513, "total_column_articles": 75, "frontend_question_id": "1307", "is_new_question": false @@ -38358,8 +38715,8 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 32165, - "total_submitted": 55331, + "total_acs": 32288, + "total_submitted": 55517, "total_column_articles": 456, "frontend_question_id": "1306", "is_new_question": false @@ -38379,9 +38736,9 @@ "question__title": "All Elements in Two Binary Search Trees", "question__title_slug": "all-elements-in-two-binary-search-trees", "question__hide": false, - "total_acs": 51269, - "total_submitted": 65681, - "total_column_articles": 696, + "total_acs": 51333, + "total_submitted": 65755, + "total_column_articles": 698, "frontend_question_id": "1305", "is_new_question": false }, @@ -38400,8 +38757,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": 29552, - "total_submitted": 42081, + "total_acs": 29678, + "total_submitted": 42274, "total_column_articles": 493, "frontend_question_id": "1304", "is_new_question": false @@ -38421,9 +38778,9 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 15074, - "total_submitted": 22968, - "total_column_articles": 132, + "total_acs": 15120, + "total_submitted": 23031, + "total_column_articles": 133, "frontend_question_id": "1294", "is_new_question": false }, @@ -38442,8 +38799,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": 3973, - "total_submitted": 6666, + "total_acs": 3987, + "total_submitted": 6690, "total_column_articles": 122, "frontend_question_id": "1298", "is_new_question": false @@ -38463,8 +38820,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": 10517, - "total_submitted": 21723, + "total_acs": 10552, + "total_submitted": 21795, "total_column_articles": 130, "frontend_question_id": "1297", "is_new_question": false @@ -38484,9 +38841,9 @@ "question__title": "Divide Array in Sets of K Consecutive Numbers", "question__title_slug": "divide-array-in-sets-of-k-consecutive-numbers", "question__hide": false, - "total_acs": 12720, - "total_submitted": 25844, - "total_column_articles": 169, + "total_acs": 12769, + "total_submitted": 25916, + "total_column_articles": 170, "frontend_question_id": "1296", "is_new_question": false }, @@ -38505,9 +38862,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": 59658, - "total_submitted": 74591, - "total_column_articles": 774, + "total_acs": 59853, + "total_submitted": 74849, + "total_column_articles": 775, "frontend_question_id": "1295", "is_new_question": false }, @@ -38526,9 +38883,9 @@ "question__title": "Find the Start and End Number of Continuous Ranges", "question__title_slug": "find-the-start-and-end-number-of-continuous-ranges", "question__hide": false, - "total_acs": 11503, - "total_submitted": 14213, - "total_column_articles": 113, + "total_acs": 11572, + "total_submitted": 14300, + "total_column_articles": 116, "frontend_question_id": "1285", "is_new_question": false }, @@ -38547,9 +38904,9 @@ "question__title": "Make Array Non-decreasing or Non-increasing", "question__title_slug": "make-array-non-decreasing-or-non-increasing", "question__hide": false, - "total_acs": 290, - "total_submitted": 385, - "total_column_articles": 16, + "total_acs": 292, + "total_submitted": 388, + "total_column_articles": 17, "frontend_question_id": "2263", "is_new_question": false }, @@ -38568,8 +38925,8 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 12780, - "total_submitted": 17536, + "total_acs": 12868, + "total_submitted": 17662, "total_column_articles": 140, "frontend_question_id": "2305", "is_new_question": false @@ -38589,8 +38946,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 684, - "total_submitted": 980, + "total_acs": 696, + "total_submitted": 999, "total_column_articles": 29, "frontend_question_id": "2229", "is_new_question": false @@ -38610,9 +38967,9 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 24104, - "total_submitted": 49158, - "total_column_articles": 193, + "total_acs": 25268, + "total_submitted": 51570, + "total_column_articles": 198, "frontend_question_id": "1280", "is_new_question": false }, @@ -38631,9 +38988,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": 22246, - "total_submitted": 57951, - "total_column_articles": 199, + "total_acs": 22315, + "total_submitted": 58088, + "total_column_articles": 200, "frontend_question_id": "1293", "is_new_question": false }, @@ -38652,8 +39009,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": 11557, - "total_submitted": 22766, + "total_acs": 11588, + "total_submitted": 22818, "total_column_articles": 162, "frontend_question_id": "1292", "is_new_question": false @@ -38673,9 +39030,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": 81571, - "total_submitted": 101439, - "total_column_articles": 996, + "total_acs": 81787, + "total_submitted": 101720, + "total_column_articles": 999, "frontend_question_id": "1290", "is_new_question": false }, @@ -38694,8 +39051,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 2490, - "total_submitted": 4355, + "total_acs": 2500, + "total_submitted": 4382, "total_column_articles": 28, "frontend_question_id": "1279", "is_new_question": false @@ -38715,8 +39072,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": 4108, - "total_submitted": 6025, + "total_acs": 4136, + "total_submitted": 6057, "total_column_articles": 100, "frontend_question_id": "1284", "is_new_question": false @@ -38736,8 +39093,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": 14822, - "total_submitted": 30100, + "total_acs": 14858, + "total_submitted": 30164, "total_column_articles": 191, "frontend_question_id": "1283", "is_new_question": false @@ -38757,9 +39114,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": 49904, - "total_submitted": 57711, - "total_column_articles": 810, + "total_acs": 49954, + "total_submitted": 57770, + "total_column_articles": 811, "frontend_question_id": "1282", "is_new_question": false }, @@ -38778,9 +39135,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": 98035, - "total_submitted": 117030, - "total_column_articles": 1060, + "total_acs": 99097, + "total_submitted": 118313, + "total_column_articles": 1067, "frontend_question_id": "1281", "is_new_question": false }, @@ -38799,9 +39156,9 @@ "question__title": "All People Report to the Given Manager", "question__title_slug": "all-people-report-to-the-given-manager", "question__hide": false, - "total_acs": 12552, - "total_submitted": 15742, - "total_column_articles": 134, + "total_acs": 12635, + "total_submitted": 15840, + "total_column_articles": 137, "frontend_question_id": "1270", "is_new_question": false }, @@ -38820,8 +39177,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 5384, - "total_submitted": 5930, + "total_acs": 5453, + "total_submitted": 6000, "total_column_articles": 109, "frontend_question_id": "1265", "is_new_question": false @@ -38841,9 +39198,9 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 6350, - "total_submitted": 10172, - "total_column_articles": 98, + "total_acs": 6372, + "total_submitted": 10225, + "total_column_articles": 97, "frontend_question_id": "1278", "is_new_question": false }, @@ -38862,9 +39219,9 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 31298, - "total_submitted": 42540, - "total_column_articles": 349, + "total_acs": 31512, + "total_submitted": 42825, + "total_column_articles": 352, "frontend_question_id": "1277", "is_new_question": false }, @@ -38883,8 +39240,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": 9009, - "total_submitted": 17907, + "total_acs": 9023, + "total_submitted": 17941, "total_column_articles": 133, "frontend_question_id": "1276", "is_new_question": false @@ -38904,9 +39261,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": 12818, - "total_submitted": 23291, - "total_column_articles": 247, + "total_acs": 13028, + "total_submitted": 23651, + "total_column_articles": 248, "frontend_question_id": "1275", "is_new_question": false }, @@ -38925,9 +39282,9 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 13176, - "total_submitted": 23167, - "total_column_articles": 165, + "total_acs": 13276, + "total_submitted": 23325, + "total_column_articles": 168, "frontend_question_id": "1264", "is_new_question": false }, @@ -38946,8 +39303,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": 32908, - "total_submitted": 67110, + "total_acs": 32944, + "total_submitted": 67169, "total_column_articles": 351, "frontend_question_id": "1269", "is_new_question": false @@ -38967,9 +39324,9 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 16747, - "total_submitted": 28035, - "total_column_articles": 258, + "total_acs": 17000, + "total_submitted": 28487, + "total_column_articles": 261, "frontend_question_id": "1268", "is_new_question": false }, @@ -38988,8 +39345,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 13742, - "total_submitted": 22187, + "total_acs": 13784, + "total_submitted": 22248, "total_column_articles": 210, "frontend_question_id": "1267", "is_new_question": false @@ -39009,8 +39366,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 36189, - "total_submitted": 43719, + "total_acs": 36301, + "total_submitted": 43849, "total_column_articles": 534, "frontend_question_id": "1266", "is_new_question": false @@ -39030,8 +39387,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 7144, - "total_submitted": 11092, + "total_acs": 7173, + "total_submitted": 11125, "total_column_articles": 126, "frontend_question_id": "2304", "is_new_question": false @@ -39051,8 +39408,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": 6617, - "total_submitted": 11870, + "total_acs": 6647, + "total_submitted": 11925, "total_column_articles": 96, "frontend_question_id": "2218", "is_new_question": false @@ -39072,9 +39429,9 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 20959, - "total_submitted": 30990, - "total_column_articles": 213, + "total_acs": 21724, + "total_submitted": 32081, + "total_column_articles": 223, "frontend_question_id": "2215", "is_new_question": false }, @@ -39093,9 +39450,9 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 3340, - "total_submitted": 4835, - "total_column_articles": 87, + "total_acs": 3403, + "total_submitted": 4932, + "total_column_articles": 88, "frontend_question_id": "1426", "is_new_question": false }, @@ -39114,9 +39471,9 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 27476, - "total_submitted": 36955, - "total_column_articles": 224, + "total_acs": 28276, + "total_submitted": 38133, + "total_column_articles": 228, "frontend_question_id": "1251", "is_new_question": false }, @@ -39135,8 +39492,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": 14981, - "total_submitted": 27601, + "total_acs": 15012, + "total_submitted": 27668, "total_column_articles": 157, "frontend_question_id": "1263", "is_new_question": false @@ -39156,8 +39513,8 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 38169, - "total_submitted": 67774, + "total_acs": 38248, + "total_submitted": 67905, "total_column_articles": 417, "frontend_question_id": "1262", "is_new_question": false @@ -39177,8 +39534,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": 12354, - "total_submitted": 16808, + "total_acs": 12404, + "total_submitted": 16866, "total_column_articles": 169, "frontend_question_id": "1261", "is_new_question": false @@ -39198,9 +39555,9 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 43652, - "total_submitted": 66796, - "total_column_articles": 671, + "total_acs": 43757, + "total_submitted": 66955, + "total_column_articles": 670, "frontend_question_id": "1260", "is_new_question": false }, @@ -39282,8 +39639,8 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 24068, - "total_submitted": 34218, + "total_acs": 24119, + "total_submitted": 34288, "total_column_articles": 212, "frontend_question_id": "2303", "is_new_question": false @@ -39303,8 +39660,8 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 18008, - "total_submitted": 22547, + "total_acs": 18046, + "total_submitted": 22596, "total_column_articles": 247, "frontend_question_id": "1255", "is_new_question": false @@ -39324,9 +39681,9 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 57457, - "total_submitted": 89567, - "total_column_articles": 822, + "total_acs": 57830, + "total_submitted": 90168, + "total_column_articles": 821, "frontend_question_id": "1254", "is_new_question": false }, @@ -39345,8 +39702,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 22467, - "total_submitted": 46521, + "total_acs": 22496, + "total_submitted": 46568, "total_column_articles": 262, "frontend_question_id": "1253", "is_new_question": false @@ -39366,9 +39723,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": 51043, - "total_submitted": 64165, - "total_column_articles": 664, + "total_acs": 51186, + "total_submitted": 64359, + "total_column_articles": 665, "frontend_question_id": "1252", "is_new_question": false }, @@ -39387,9 +39744,9 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 11369, - "total_submitted": 19033, - "total_column_articles": 93, + "total_acs": 11417, + "total_submitted": 19097, + "total_column_articles": 95, "frontend_question_id": "1241", "is_new_question": false }, @@ -39408,8 +39765,8 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 4690, - "total_submitted": 8719, + "total_acs": 4700, + "total_submitted": 8735, "total_column_articles": 60, "frontend_question_id": "2312", "is_new_question": false @@ -39429,8 +39786,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 7388, - "total_submitted": 21864, + "total_acs": 7433, + "total_submitted": 21960, "total_column_articles": 154, "frontend_question_id": "2217", "is_new_question": false @@ -39450,8 +39807,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": 2320, - "total_submitted": 3778, + "total_acs": 2322, + "total_submitted": 3780, "total_column_articles": 38, "frontend_question_id": "1428", "is_new_question": false @@ -39471,8 +39828,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": 21384, - "total_submitted": 30112, + "total_acs": 21406, + "total_submitted": 30166, "total_column_articles": 154, "frontend_question_id": "1250", "is_new_question": false @@ -39492,8 +39849,8 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 43927, - "total_submitted": 73943, + "total_acs": 44022, + "total_submitted": 74077, "total_column_articles": 569, "frontend_question_id": "1249", "is_new_question": false @@ -39513,9 +39870,9 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 51908, - "total_submitted": 89450, - "total_column_articles": 643, + "total_acs": 52074, + "total_submitted": 89674, + "total_column_articles": 644, "frontend_question_id": "1248", "is_new_question": false }, @@ -39534,8 +39891,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 31595, - "total_submitted": 45753, + "total_acs": 31626, + "total_submitted": 45803, "total_column_articles": 443, "frontend_question_id": "1247", "is_new_question": false @@ -39555,8 +39912,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 2213, - "total_submitted": 4598, + "total_acs": 2219, + "total_submitted": 4614, "total_column_articles": 29, "frontend_question_id": "1242", "is_new_question": false @@ -39576,8 +39933,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 14983, - "total_submitted": 23052, + "total_acs": 14991, + "total_submitted": 23062, "total_column_articles": 177, "frontend_question_id": "1691", "is_new_question": false @@ -39597,8 +39954,8 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 3612, - "total_submitted": 6810, + "total_acs": 3694, + "total_submitted": 6935, "total_column_articles": 93, "frontend_question_id": "1429", "is_new_question": false @@ -39618,8 +39975,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 8226, - "total_submitted": 15733, + "total_acs": 8256, + "total_submitted": 15799, "total_column_articles": 143, "frontend_question_id": "1726", "is_new_question": false @@ -39639,9 +39996,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": 29133, - "total_submitted": 40612, - "total_column_articles": 330, + "total_acs": 29204, + "total_submitted": 40705, + "total_column_articles": 331, "frontend_question_id": "2309", "is_new_question": false }, @@ -39660,8 +40017,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 14455, - "total_submitted": 21584, + "total_acs": 14502, + "total_submitted": 21642, "total_column_articles": 193, "frontend_question_id": "1227", "is_new_question": false @@ -39681,8 +40038,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": 14208, - "total_submitted": 21995, + "total_acs": 14269, + "total_submitted": 22132, "total_column_articles": 118, "frontend_question_id": "1240", "is_new_question": false @@ -39702,8 +40059,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": 40957, - "total_submitted": 83430, + "total_acs": 41053, + "total_submitted": 83610, "total_column_articles": 452, "frontend_question_id": "1239", "is_new_question": false @@ -39723,9 +40080,9 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 21715, - "total_submitted": 28002, - "total_column_articles": 227, + "total_acs": 21736, + "total_submitted": 28030, + "total_column_articles": 228, "frontend_question_id": "1238", "is_new_question": false }, @@ -39744,8 +40101,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": 31881, - "total_submitted": 40806, + "total_acs": 31905, + "total_submitted": 40832, "total_column_articles": 320, "frontend_question_id": "1237", "is_new_question": false @@ -39765,9 +40122,9 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 8037, - "total_submitted": 15014, - "total_column_articles": 139, + "total_acs": 8087, + "total_submitted": 15106, + "total_column_articles": 140, "frontend_question_id": "1225", "is_new_question": false }, @@ -39786,8 +40143,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": 3373, - "total_submitted": 6873, + "total_acs": 3394, + "total_submitted": 6908, "total_column_articles": 65, "frontend_question_id": "2193", "is_new_question": false @@ -39807,9 +40164,9 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 9594, - "total_submitted": 19692, - "total_column_articles": 173, + "total_acs": 9634, + "total_submitted": 19750, + "total_column_articles": 174, "frontend_question_id": "2216", "is_new_question": false }, @@ -39828,8 +40185,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": 10788, - "total_submitted": 17113, + "total_acs": 10815, + "total_submitted": 17160, "total_column_articles": 121, "frontend_question_id": "2225", "is_new_question": false @@ -39849,9 +40206,9 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 12076, - "total_submitted": 20214, - "total_column_articles": 160, + "total_acs": 12178, + "total_submitted": 20409, + "total_column_articles": 163, "frontend_question_id": "2273", "is_new_question": false }, @@ -39870,9 +40227,9 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 31905, - "total_submitted": 55274, - "total_column_articles": 382, + "total_acs": 32032, + "total_submitted": 55489, + "total_column_articles": 383, "frontend_question_id": "1235", "is_new_question": false }, @@ -39891,9 +40248,9 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 31186, - "total_submitted": 69403, - "total_column_articles": 328, + "total_acs": 31266, + "total_submitted": 69622, + "total_column_articles": 329, "frontend_question_id": "1234", "is_new_question": false }, @@ -39912,9 +40269,9 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 36621, - "total_submitted": 59496, - "total_column_articles": 451, + "total_acs": 36662, + "total_submitted": 59568, + "total_column_articles": 452, "frontend_question_id": "1233", "is_new_question": false }, @@ -39933,9 +40290,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": 48732, - "total_submitted": 107363, - "total_column_articles": 606, + "total_acs": 48964, + "total_submitted": 107982, + "total_column_articles": 607, "frontend_question_id": "1232", "is_new_question": false }, @@ -39954,8 +40311,8 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 6780, - "total_submitted": 13078, + "total_acs": 6812, + "total_submitted": 13130, "total_column_articles": 107, "frontend_question_id": "2321", "is_new_question": false @@ -39975,9 +40332,9 @@ "question__title": "Distance to a Cycle in Undirected Graph", "question__title_slug": "distance-to-a-cycle-in-undirected-graph", "question__hide": false, - "total_acs": 363, - "total_submitted": 485, - "total_column_articles": 18, + "total_acs": 365, + "total_submitted": 487, + "total_column_articles": 19, "frontend_question_id": "2204", "is_new_question": false }, @@ -39996,9 +40353,9 @@ "question__title": "Maximize the Topmost Element After K Moves", "question__title_slug": "maximize-the-topmost-element-after-k-moves", "question__hide": false, - "total_acs": 9355, - "total_submitted": 43001, - "total_column_articles": 152, + "total_acs": 9383, + "total_submitted": 43086, + "total_column_articles": 151, "frontend_question_id": "2202", "is_new_question": false }, @@ -40017,9 +40374,9 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 5304, - "total_submitted": 9144, - "total_column_articles": 148, + "total_acs": 5403, + "total_submitted": 9297, + "total_column_articles": 150, "frontend_question_id": "1427", "is_new_question": false }, @@ -40038,8 +40395,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 27117, - "total_submitted": 62093, + "total_acs": 27133, + "total_submitted": 62130, "total_column_articles": 300, "frontend_question_id": "1224", "is_new_question": false @@ -40059,8 +40416,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 17828, - "total_submitted": 28809, + "total_acs": 17845, + "total_submitted": 28830, "total_column_articles": 187, "frontend_question_id": "1223", "is_new_question": false @@ -40080,8 +40437,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 9454, - "total_submitted": 13586, + "total_acs": 9499, + "total_submitted": 13651, "total_column_articles": 202, "frontend_question_id": "1222", "is_new_question": false @@ -40101,9 +40458,9 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 101916, - "total_submitted": 119840, - "total_column_articles": 1370, + "total_acs": 102142, + "total_submitted": 120112, + "total_column_articles": 1373, "frontend_question_id": "1221", "is_new_question": false }, @@ -40122,8 +40479,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 18862, - "total_submitted": 31741, + "total_acs": 18952, + "total_submitted": 31871, "total_column_articles": 185, "frontend_question_id": "1226", "is_new_question": false @@ -40143,9 +40500,9 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 10499, - "total_submitted": 20491, - "total_column_articles": 169, + "total_acs": 10641, + "total_submitted": 20818, + "total_column_articles": 172, "frontend_question_id": "1212", "is_new_question": false }, @@ -40164,9 +40521,9 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 24152, - "total_submitted": 36077, - "total_column_articles": 159, + "total_acs": 24874, + "total_submitted": 37157, + "total_column_articles": 163, "frontend_question_id": "1211", "is_new_question": false }, @@ -40185,8 +40542,8 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 30235, - "total_submitted": 44317, + "total_acs": 30361, + "total_submitted": 44506, "total_column_articles": 257, "frontend_question_id": "1206", "is_new_question": false @@ -40206,8 +40563,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": 1220, - "total_submitted": 3756, + "total_acs": 1223, + "total_submitted": 3771, "total_column_articles": 37, "frontend_question_id": "1960", "is_new_question": false @@ -40227,9 +40584,9 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 11918, - "total_submitted": 34726, - "total_column_articles": 182, + "total_acs": 11978, + "total_submitted": 34884, + "total_column_articles": 184, "frontend_question_id": "2226", "is_new_question": false }, @@ -40248,8 +40605,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": 8985, - "total_submitted": 32387, + "total_acs": 9015, + "total_submitted": 32463, "total_column_articles": 129, "frontend_question_id": "2310", "is_new_question": false @@ -40269,8 +40626,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 7069, - "total_submitted": 16178, + "total_acs": 7097, + "total_submitted": 16224, "total_column_articles": 112, "frontend_question_id": "2191", "is_new_question": false @@ -40290,8 +40647,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 26974, - "total_submitted": 44411, + "total_acs": 27002, + "total_submitted": 44468, "total_column_articles": 379, "frontend_question_id": "1220", "is_new_question": false @@ -40311,8 +40668,8 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 40890, - "total_submitted": 59212, + "total_acs": 40986, + "total_submitted": 59396, "total_column_articles": 527, "frontend_question_id": "1219", "is_new_question": false @@ -40332,8 +40689,8 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 45400, - "total_submitted": 88072, + "total_acs": 45565, + "total_submitted": 88442, "total_column_articles": 422, "frontend_question_id": "1218", "is_new_question": false @@ -40353,9 +40710,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": 58384, - "total_submitted": 78194, - "total_column_articles": 756, + "total_acs": 58606, + "total_submitted": 78489, + "total_column_articles": 759, "frontend_question_id": "1217", "is_new_question": false }, @@ -40374,9 +40731,9 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 9202, - "total_submitted": 20100, - "total_column_articles": 111, + "total_acs": 9243, + "total_submitted": 20170, + "total_column_articles": 112, "frontend_question_id": "1205", "is_new_question": false }, @@ -40395,9 +40752,9 @@ "question__title": "Last Person to Fit in the Bus", "question__title_slug": "last-person-to-fit-in-the-bus", "question__hide": false, - "total_acs": 14202, - "total_submitted": 19548, - "total_column_articles": 146, + "total_acs": 14691, + "total_submitted": 20277, + "total_column_articles": 149, "frontend_question_id": "1204", "is_new_question": false }, @@ -40416,8 +40773,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 3918, - "total_submitted": 11257, + "total_acs": 3924, + "total_submitted": 11278, "total_column_articles": 64, "frontend_question_id": "1862", "is_new_question": false @@ -40437,9 +40794,9 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 20229, - "total_submitted": 49512, - "total_column_articles": 272, + "total_acs": 20350, + "total_submitted": 49748, + "total_column_articles": 274, "frontend_question_id": "1514", "is_new_question": false }, @@ -40458,8 +40815,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 40015, - "total_submitted": 57935, + "total_acs": 40038, + "total_submitted": 57962, "total_column_articles": 692, "frontend_question_id": "1706", "is_new_question": false @@ -40479,9 +40836,9 @@ "question__title": "Minimum Moves to Reach Target with Rotations", "question__title_slug": "minimum-moves-to-reach-target-with-rotations", "question__hide": false, - "total_acs": 15184, - "total_submitted": 23636, - "total_column_articles": 182, + "total_acs": 15201, + "total_submitted": 23666, + "total_column_articles": 183, "frontend_question_id": "1210", "is_new_question": false }, @@ -40500,8 +40857,8 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 69820, - "total_submitted": 139614, + "total_acs": 69980, + "total_submitted": 139948, "total_column_articles": 782, "frontend_question_id": "1208", "is_new_question": false @@ -40521,8 +40878,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": 20446, - "total_submitted": 40358, + "total_acs": 20549, + "total_submitted": 40522, "total_column_articles": 231, "frontend_question_id": "1209", "is_new_question": false @@ -40542,9 +40899,9 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 88552, - "total_submitted": 121491, - "total_column_articles": 1104, + "total_acs": 89399, + "total_submitted": 122662, + "total_column_articles": 1113, "frontend_question_id": "1207", "is_new_question": false }, @@ -40563,9 +40920,9 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 6991, - "total_submitted": 13711, - "total_column_articles": 100, + "total_acs": 7018, + "total_submitted": 13747, + "total_column_articles": 102, "frontend_question_id": "1194", "is_new_question": false }, @@ -40584,9 +40941,9 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 20915, - "total_submitted": 34348, - "total_column_articles": 173, + "total_acs": 21599, + "total_submitted": 35455, + "total_column_articles": 178, "frontend_question_id": "1193", "is_new_question": false }, @@ -40605,8 +40962,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 21561, - "total_submitted": 33210, + "total_acs": 21647, + "total_submitted": 33328, "total_column_articles": 367, "frontend_question_id": "1195", "is_new_question": false @@ -40626,8 +40983,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": 1991, - "total_submitted": 3569, + "total_acs": 2004, + "total_submitted": 3585, "total_column_articles": 32, "frontend_question_id": "1916", "is_new_question": false @@ -40647,8 +41004,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 8619, - "total_submitted": 17383, + "total_acs": 8633, + "total_submitted": 17400, "total_column_articles": 138, "frontend_question_id": "2201", "is_new_question": false @@ -40668,8 +41025,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 3288, - "total_submitted": 5827, + "total_acs": 3303, + "total_submitted": 5849, "total_column_articles": 63, "frontend_question_id": "1895", "is_new_question": false @@ -40689,8 +41046,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 8907, - "total_submitted": 11494, + "total_acs": 8950, + "total_submitted": 11553, "total_column_articles": 165, "frontend_question_id": "2079", "is_new_question": false @@ -40710,8 +41067,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 14258, - "total_submitted": 23460, + "total_acs": 14316, + "total_submitted": 23541, "total_column_articles": 177, "frontend_question_id": "1203", "is_new_question": false @@ -40731,8 +41088,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 32296, - "total_submitted": 62849, + "total_acs": 32341, + "total_submitted": 62926, "total_column_articles": 373, "frontend_question_id": "1202", "is_new_question": false @@ -40752,9 +41109,9 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 12053, - "total_submitted": 42344, - "total_column_articles": 158, + "total_acs": 12108, + "total_submitted": 42518, + "total_column_articles": 159, "frontend_question_id": "1201", "is_new_question": false }, @@ -40773,9 +41130,9 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 58435, - "total_submitted": 80688, - "total_column_articles": 631, + "total_acs": 58626, + "total_submitted": 80966, + "total_column_articles": 633, "frontend_question_id": "1200", "is_new_question": false }, @@ -40794,9 +41151,9 @@ "question__title": "Number of Visible People in a Queue", "question__title_slug": "number-of-visible-people-in-a-queue", "question__hide": false, - "total_acs": 5960, - "total_submitted": 9403, - "total_column_articles": 112, + "total_acs": 5983, + "total_submitted": 9429, + "total_column_articles": 113, "frontend_question_id": "1944", "is_new_question": false }, @@ -40815,9 +41172,9 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 29955, - "total_submitted": 47152, - "total_column_articles": 521, + "total_acs": 29982, + "total_submitted": 47191, + "total_column_articles": 522, "frontend_question_id": "1405", "is_new_question": false }, @@ -40836,9 +41193,9 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 9319, - "total_submitted": 18060, - "total_column_articles": 164, + "total_acs": 9353, + "total_submitted": 18120, + "total_column_articles": 165, "frontend_question_id": "2139", "is_new_question": false }, @@ -40857,8 +41214,8 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 11027, - "total_submitted": 18403, + "total_acs": 11079, + "total_submitted": 18466, "total_column_articles": 145, "frontend_question_id": "1957", "is_new_question": false @@ -40878,9 +41235,9 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 48094, - "total_submitted": 74088, - "total_column_articles": 278, + "total_acs": 48332, + "total_submitted": 74421, + "total_column_articles": 280, "frontend_question_id": "1179", "is_new_question": false }, @@ -40899,9 +41256,9 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 8600, - "total_submitted": 15761, - "total_column_articles": 114, + "total_acs": 8641, + "total_submitted": 15812, + "total_column_articles": 115, "frontend_question_id": "1192", "is_new_question": false }, @@ -40920,8 +41277,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 8549, - "total_submitted": 31699, + "total_acs": 8578, + "total_submitted": 31793, "total_column_articles": 136, "frontend_question_id": "1191", "is_new_question": false @@ -40941,8 +41298,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": 60608, - "total_submitted": 93672, + "total_acs": 60711, + "total_submitted": 93798, "total_column_articles": 752, "frontend_question_id": "1190", "is_new_question": false @@ -40962,9 +41319,9 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 60072, - "total_submitted": 88006, - "total_column_articles": 821, + "total_acs": 60175, + "total_submitted": 88157, + "total_column_articles": 823, "frontend_question_id": "1189", "is_new_question": false }, @@ -40983,9 +41340,9 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 15016, - "total_submitted": 33410, - "total_column_articles": 158, + "total_acs": 15036, + "total_submitted": 33462, + "total_column_articles": 157, "frontend_question_id": "1483", "is_new_question": false }, @@ -41004,8 +41361,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": 6266, - "total_submitted": 12543, + "total_acs": 6295, + "total_submitted": 12588, "total_column_articles": 93, "frontend_question_id": "1954", "is_new_question": false @@ -41025,8 +41382,8 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 8855, - "total_submitted": 28070, + "total_acs": 8883, + "total_submitted": 28121, "total_column_articles": 181, "frontend_question_id": "2080", "is_new_question": false @@ -41046,9 +41403,9 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 29787, - "total_submitted": 45390, - "total_column_articles": 402, + "total_acs": 29952, + "total_submitted": 45633, + "total_column_articles": 404, "frontend_question_id": "1550", "is_new_question": false }, @@ -41067,9 +41424,9 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 14731, - "total_submitted": 24530, - "total_column_articles": 148, + "total_acs": 15332, + "total_submitted": 25715, + "total_column_articles": 156, "frontend_question_id": "1174", "is_new_question": false }, @@ -41088,9 +41445,9 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 21211, - "total_submitted": 27640, - "total_column_articles": 151, + "total_acs": 22019, + "total_submitted": 28743, + "total_column_articles": 155, "frontend_question_id": "1173", "is_new_question": false }, @@ -41109,8 +41466,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 14134, - "total_submitted": 23641, + "total_acs": 14385, + "total_submitted": 24080, "total_column_articles": 116, "frontend_question_id": "1187", "is_new_question": false @@ -41130,8 +41487,8 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 39749, - "total_submitted": 63928, + "total_acs": 39828, + "total_submitted": 64062, "total_column_articles": 532, "frontend_question_id": "1185", "is_new_question": false @@ -41151,8 +41508,8 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 27385, - "total_submitted": 56939, + "total_acs": 27456, + "total_submitted": 57055, "total_column_articles": 280, "frontend_question_id": "1186", "is_new_question": false @@ -41172,9 +41529,9 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 42221, - "total_submitted": 68405, - "total_column_articles": 624, + "total_acs": 42425, + "total_submitted": 68756, + "total_column_articles": 626, "frontend_question_id": "1184", "is_new_question": false }, @@ -41193,8 +41550,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 6688, - "total_submitted": 14019, + "total_acs": 6726, + "total_submitted": 14090, "total_column_articles": 117, "frontend_question_id": "1425", "is_new_question": false @@ -41214,9 +41571,9 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 24783, - "total_submitted": 33602, - "total_column_articles": 304, + "total_acs": 24939, + "total_submitted": 33806, + "total_column_articles": 305, "frontend_question_id": "1382", "is_new_question": false }, @@ -41235,8 +41592,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 9536, - "total_submitted": 24473, + "total_acs": 9594, + "total_submitted": 24606, "total_column_articles": 149, "frontend_question_id": "1390", "is_new_question": false @@ -41256,9 +41613,9 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 15647, - "total_submitted": 26487, - "total_column_articles": 215, + "total_acs": 15719, + "total_submitted": 26610, + "total_column_articles": 216, "frontend_question_id": "1507", "is_new_question": false }, @@ -41277,8 +41634,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": 20494, - "total_submitted": 43820, + "total_acs": 20525, + "total_submitted": 43863, "total_column_articles": 201, "frontend_question_id": "1178", "is_new_question": false @@ -41298,9 +41655,9 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 22698, - "total_submitted": 54103, - "total_column_articles": 244, + "total_acs": 22739, + "total_submitted": 54201, + "total_column_articles": 243, "frontend_question_id": "1177", "is_new_question": false }, @@ -41319,8 +41676,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 5974, - "total_submitted": 12275, + "total_acs": 5984, + "total_submitted": 12288, "total_column_articles": 96, "frontend_question_id": "1176", "is_new_question": false @@ -41340,8 +41697,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 32841, - "total_submitted": 58340, + "total_acs": 32919, + "total_submitted": 58467, "total_column_articles": 381, "frontend_question_id": "1175", "is_new_question": false @@ -41361,9 +41718,9 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 18663, - "total_submitted": 32118, - "total_column_articles": 209, + "total_acs": 19151, + "total_submitted": 33184, + "total_column_articles": 213, "frontend_question_id": "1164", "is_new_question": false }, @@ -41382,8 +41739,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 7917, - "total_submitted": 21985, + "total_acs": 7942, + "total_submitted": 22053, "total_column_articles": 134, "frontend_question_id": "1363", "is_new_question": false @@ -41403,9 +41760,9 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 8121, - "total_submitted": 14818, - "total_column_articles": 98, + "total_acs": 8163, + "total_submitted": 14874, + "total_column_articles": 99, "frontend_question_id": "1362", "is_new_question": false }, @@ -41424,8 +41781,8 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 12471, - "total_submitted": 31231, + "total_acs": 12514, + "total_submitted": 31323, "total_column_articles": 305, "frontend_question_id": "1361", "is_new_question": false @@ -41445,9 +41802,9 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 15592, - "total_submitted": 30480, - "total_column_articles": 243, + "total_acs": 15646, + "total_submitted": 30588, + "total_column_articles": 244, "frontend_question_id": "1360", "is_new_question": false }, @@ -41466,8 +41823,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": 31683, - "total_submitted": 47814, + "total_acs": 31728, + "total_submitted": 47874, "total_column_articles": 435, "frontend_question_id": "1170", "is_new_question": false @@ -41487,9 +41844,9 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 9469, - "total_submitted": 28647, - "total_column_articles": 112, + "total_acs": 9485, + "total_submitted": 28695, + "total_column_articles": 113, "frontend_question_id": "1169", "is_new_question": false }, @@ -41508,9 +41865,9 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 1999, - "total_submitted": 3492, - "total_column_articles": 44, + "total_acs": 2026, + "total_submitted": 3542, + "total_column_articles": 45, "frontend_question_id": "1236", "is_new_question": false }, @@ -41529,8 +41886,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 13386, - "total_submitted": 33494, + "total_acs": 13406, + "total_submitted": 33526, "total_column_articles": 158, "frontend_question_id": "1172", "is_new_question": false @@ -41550,9 +41907,9 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 7370, - "total_submitted": 14541, - "total_column_articles": 125, + "total_acs": 7406, + "total_submitted": 14638, + "total_column_articles": 127, "frontend_question_id": "1159", "is_new_question": false }, @@ -41571,8 +41928,8 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 38730, - "total_submitted": 71184, + "total_acs": 38978, + "total_submitted": 71658, "total_column_articles": 286, "frontend_question_id": "1158", "is_new_question": false @@ -41592,8 +41949,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": 33920, - "total_submitted": 63919, + "total_acs": 34022, + "total_submitted": 64131, "total_column_articles": 334, "frontend_question_id": "1171", "is_new_question": false @@ -41613,8 +41970,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": 13982, - "total_submitted": 19763, + "total_acs": 14020, + "total_submitted": 19810, "total_column_articles": 241, "frontend_question_id": "1935", "is_new_question": false @@ -41634,8 +41991,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": 19552, - "total_submitted": 38253, + "total_acs": 19623, + "total_submitted": 38354, "total_column_articles": 207, "frontend_question_id": "1155", "is_new_question": false @@ -41655,8 +42012,8 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 14081, - "total_submitted": 30551, + "total_acs": 14114, + "total_submitted": 30624, "total_column_articles": 126, "frontend_question_id": "1157", "is_new_question": false @@ -41676,9 +42033,9 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 22029, - "total_submitted": 43009, - "total_column_articles": 302, + "total_acs": 22075, + "total_submitted": 43089, + "total_column_articles": 304, "frontend_question_id": "1156", "is_new_question": false }, @@ -41697,8 +42054,8 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 57260, - "total_submitted": 91830, + "total_acs": 57408, + "total_submitted": 92143, "total_column_articles": 646, "frontend_question_id": "1154", "is_new_question": false @@ -41718,9 +42075,9 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 10593, - "total_submitted": 23807, - "total_column_articles": 75, + "total_acs": 10661, + "total_submitted": 23938, + "total_column_articles": 76, "frontend_question_id": "1149", "is_new_question": false }, @@ -41739,9 +42096,9 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 63915, - "total_submitted": 90214, - "total_column_articles": 228, + "total_acs": 66004, + "total_submitted": 93357, + "total_column_articles": 233, "frontend_question_id": "1148", "is_new_question": false }, @@ -41760,8 +42117,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 10463, - "total_submitted": 18212, + "total_acs": 10497, + "total_submitted": 18266, "total_column_articles": 97, "frontend_question_id": "1632", "is_new_question": false @@ -41781,9 +42138,9 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 46503, - "total_submitted": 77052, - "total_column_articles": 534, + "total_acs": 46582, + "total_submitted": 77177, + "total_column_articles": 535, "frontend_question_id": "1331", "is_new_question": false }, @@ -41802,8 +42159,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 10719, - "total_submitted": 18570, + "total_acs": 10724, + "total_submitted": 18581, "total_column_articles": 83, "frontend_question_id": "1330", "is_new_question": false @@ -41823,9 +42180,9 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 63854, - "total_submitted": 74705, - "total_column_articles": 777, + "total_acs": 63960, + "total_submitted": 74831, + "total_column_articles": 779, "frontend_question_id": "1302", "is_new_question": false }, @@ -41844,8 +42201,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 11860, - "total_submitted": 15238, + "total_acs": 11890, + "total_submitted": 15274, "total_column_articles": 242, "frontend_question_id": "1329", "is_new_question": false @@ -41865,8 +42222,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 9502, - "total_submitted": 20173, + "total_acs": 9532, + "total_submitted": 20243, "total_column_articles": 174, "frontend_question_id": "1328", "is_new_question": false @@ -41886,8 +42243,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 23112, - "total_submitted": 39165, + "total_acs": 23161, + "total_submitted": 39228, "total_column_articles": 362, "frontend_question_id": "1147", "is_new_question": false @@ -41907,9 +42264,9 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 358894, - "total_submitted": 552910, - "total_column_articles": 1909, + "total_acs": 362382, + "total_submitted": 558211, + "total_column_articles": 1921, "frontend_question_id": "1143", "is_new_question": false }, @@ -41928,8 +42285,8 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 9679, - "total_submitted": 28735, + "total_acs": 9726, + "total_submitted": 28846, "total_column_articles": 119, "frontend_question_id": "1146", "is_new_question": false @@ -41949,8 +42306,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 26586, - "total_submitted": 47975, + "total_acs": 26620, + "total_submitted": 48039, "total_column_articles": 383, "frontend_question_id": "1145", "is_new_question": false @@ -41970,8 +42327,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 32411, - "total_submitted": 64113, + "total_acs": 32431, + "total_submitted": 64147, "total_column_articles": 340, "frontend_question_id": "1144", "is_new_question": false @@ -41991,9 +42348,9 @@ "question__title": "User Activity for the Past 30 Days II", "question__title_slug": "user-activity-for-the-past-30-days-ii", "question__hide": false, - "total_acs": 12646, - "total_submitted": 34010, - "total_column_articles": 72, + "total_acs": 12683, + "total_submitted": 34110, + "total_column_articles": 74, "frontend_question_id": "1142", "is_new_question": false }, @@ -42012,9 +42369,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": 57040, - "total_submitted": 127163, - "total_column_articles": 340, + "total_acs": 57743, + "total_submitted": 128802, + "total_column_articles": 342, "frontend_question_id": "1141", "is_new_question": false }, @@ -42033,8 +42390,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 5115, - "total_submitted": 10521, + "total_acs": 5137, + "total_submitted": 10554, "total_column_articles": 89, "frontend_question_id": "1316", "is_new_question": false @@ -42054,8 +42411,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": 18370, - "total_submitted": 22514, + "total_acs": 18423, + "total_submitted": 22576, "total_column_articles": 383, "frontend_question_id": "1315", "is_new_question": false @@ -42075,8 +42432,8 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 24379, - "total_submitted": 32309, + "total_acs": 24459, + "total_submitted": 32435, "total_column_articles": 379, "frontend_question_id": "1314", "is_new_question": false @@ -42096,9 +42453,9 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 43770, - "total_submitted": 52591, - "total_column_articles": 650, + "total_acs": 43916, + "total_submitted": 52756, + "total_column_articles": 652, "frontend_question_id": "1313", "is_new_question": false }, @@ -42117,8 +42474,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 25574, - "total_submitted": 36323, + "total_acs": 25613, + "total_submitted": 36384, "total_column_articles": 223, "frontend_question_id": "1140", "is_new_question": false @@ -42138,9 +42495,9 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 31428, - "total_submitted": 56019, - "total_column_articles": 373, + "total_acs": 31483, + "total_submitted": 56122, + "total_column_articles": 374, "frontend_question_id": "1139", "is_new_question": false }, @@ -42159,8 +42516,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 26179, - "total_submitted": 50594, + "total_acs": 26195, + "total_submitted": 50629, "total_column_articles": 441, "frontend_question_id": "1138", "is_new_question": false @@ -42180,9 +42537,9 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 9225, - "total_submitted": 23849, - "total_column_articles": 79, + "total_acs": 9259, + "total_submitted": 23983, + "total_column_articles": 80, "frontend_question_id": "1132", "is_new_question": false }, @@ -42201,9 +42558,9 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 163098, - "total_submitted": 267256, - "total_column_articles": 1460, + "total_acs": 164252, + "total_submitted": 269205, + "total_column_articles": 1465, "frontend_question_id": "1137", "is_new_question": false }, @@ -42222,9 +42579,9 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 7205, - "total_submitted": 19121, - "total_column_articles": 150, + "total_acs": 7246, + "total_submitted": 19189, + "total_column_articles": 152, "frontend_question_id": "1301", "is_new_question": false }, @@ -42243,8 +42600,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 1651, - "total_submitted": 2544, + "total_acs": 1657, + "total_submitted": 2552, "total_column_articles": 37, "frontend_question_id": "1274", "is_new_question": false @@ -42264,8 +42621,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": 31138, - "total_submitted": 66603, + "total_acs": 31190, + "total_submitted": 66708, "total_column_articles": 452, "frontend_question_id": "1300", "is_new_question": false @@ -42285,8 +42642,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": 41460, - "total_submitted": 53979, + "total_acs": 41555, + "total_submitted": 54119, "total_column_articles": 563, "frontend_question_id": "1299", "is_new_question": false @@ -42306,8 +42663,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 4689, - "total_submitted": 9882, + "total_acs": 4705, + "total_submitted": 9927, "total_column_articles": 69, "frontend_question_id": "1131", "is_new_question": false @@ -42327,9 +42684,9 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 29038, - "total_submitted": 59770, - "total_column_articles": 401, + "total_acs": 29110, + "total_submitted": 59944, + "total_column_articles": 402, "frontend_question_id": "1129", "is_new_question": false }, @@ -42348,8 +42705,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 21005, - "total_submitted": 29686, + "total_acs": 21031, + "total_submitted": 29727, "total_column_articles": 253, "frontend_question_id": "1130", "is_new_question": false @@ -42369,9 +42726,9 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 44341, - "total_submitted": 81884, - "total_column_articles": 550, + "total_acs": 44423, + "total_submitted": 82004, + "total_column_articles": 551, "frontend_question_id": "1128", "is_new_question": false }, @@ -42390,9 +42747,9 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 7986, - "total_submitted": 18589, - "total_column_articles": 108, + "total_acs": 8036, + "total_submitted": 18738, + "total_column_articles": 111, "frontend_question_id": "1127", "is_new_question": false }, @@ -42411,9 +42768,9 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 14019, - "total_submitted": 20593, - "total_column_articles": 150, + "total_acs": 14063, + "total_submitted": 20680, + "total_column_articles": 151, "frontend_question_id": "1126", "is_new_question": false }, @@ -42432,9 +42789,9 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 33443, - "total_submitted": 54117, - "total_column_articles": 326, + "total_acs": 34278, + "total_submitted": 55467, + "total_column_articles": 329, "frontend_question_id": "1289", "is_new_question": false }, @@ -42453,8 +42810,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 4169, - "total_submitted": 9848, + "total_acs": 4185, + "total_submitted": 9881, "total_column_articles": 66, "frontend_question_id": "1627", "is_new_question": false @@ -42474,8 +42831,8 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 28327, - "total_submitted": 50561, + "total_acs": 28467, + "total_submitted": 50805, "total_column_articles": 294, "frontend_question_id": "1288", "is_new_question": false @@ -42495,8 +42852,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": 25322, - "total_submitted": 43251, + "total_acs": 25417, + "total_submitted": 43430, "total_column_articles": 349, "frontend_question_id": "1287", "is_new_question": false @@ -42516,8 +42873,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 16183, - "total_submitted": 26559, + "total_acs": 16214, + "total_submitted": 26629, "total_column_articles": 152, "frontend_question_id": "1125", "is_new_question": false @@ -42537,8 +42894,8 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 42972, - "total_submitted": 109492, + "total_acs": 43078, + "total_submitted": 109746, "total_column_articles": 376, "frontend_question_id": "1124", "is_new_question": false @@ -42558,9 +42915,9 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 13547, - "total_submitted": 18852, - "total_column_articles": 177, + "total_acs": 13607, + "total_submitted": 18932, + "total_column_articles": 179, "frontend_question_id": "1123", "is_new_question": false }, @@ -42579,9 +42936,9 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 88474, - "total_submitted": 125621, - "total_column_articles": 1126, + "total_acs": 88689, + "total_submitted": 125891, + "total_column_articles": 1128, "frontend_question_id": "1122", "is_new_question": false }, @@ -42600,8 +42957,8 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 34698, - "total_submitted": 63713, + "total_acs": 34859, + "total_submitted": 63982, "total_column_articles": 471, "frontend_question_id": "1116", "is_new_question": false @@ -42621,9 +42978,9 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 12687, - "total_submitted": 23723, - "total_column_articles": 74, + "total_acs": 12740, + "total_submitted": 23836, + "total_column_articles": 75, "frontend_question_id": "1113", "is_new_question": false }, @@ -42642,9 +42999,9 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 19260, - "total_submitted": 29250, - "total_column_articles": 172, + "total_acs": 19475, + "total_submitted": 29614, + "total_column_articles": 173, "frontend_question_id": "1112", "is_new_question": false }, @@ -42663,8 +43020,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 3696, - "total_submitted": 6956, + "total_acs": 3747, + "total_submitted": 7048, "total_column_articles": 73, "frontend_question_id": "1259", "is_new_question": false @@ -42684,9 +43041,9 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 10979, - "total_submitted": 20425, - "total_column_articles": 219, + "total_acs": 11002, + "total_submitted": 20462, + "total_column_articles": 220, "frontend_question_id": "1291", "is_new_question": false }, @@ -42705,8 +43062,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 7147, - "total_submitted": 10972, + "total_acs": 7160, + "total_submitted": 10989, "total_column_articles": 145, "frontend_question_id": "1286", "is_new_question": false @@ -42726,8 +43083,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": 45084, - "total_submitted": 62838, + "total_acs": 45138, + "total_submitted": 62912, "total_column_articles": 452, "frontend_question_id": "1619", "is_new_question": false @@ -42747,8 +43104,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 5407, - "total_submitted": 7685, + "total_acs": 5437, + "total_submitted": 7740, "total_column_articles": 89, "frontend_question_id": "1188", "is_new_question": false @@ -42768,8 +43125,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": 27766, - "total_submitted": 36151, + "total_acs": 27797, + "total_submitted": 36195, "total_column_articles": 446, "frontend_question_id": "1111", "is_new_question": false @@ -42789,8 +43146,8 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 36297, - "total_submitted": 52349, + "total_acs": 36415, + "total_submitted": 52538, "total_column_articles": 517, "frontend_question_id": "1110", "is_new_question": false @@ -42810,9 +43167,9 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 113174, - "total_submitted": 177533, - "total_column_articles": 1680, + "total_acs": 113521, + "total_submitted": 177972, + "total_column_articles": 1681, "frontend_question_id": "1109", "is_new_question": false }, @@ -42831,9 +43188,9 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 113955, - "total_submitted": 133465, - "total_column_articles": 1019, + "total_acs": 114125, + "total_submitted": 133660, + "total_column_articles": 1021, "frontend_question_id": "1108", "is_new_question": false }, @@ -42852,9 +43209,9 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 13173, - "total_submitted": 31987, - "total_column_articles": 135, + "total_acs": 13232, + "total_submitted": 32151, + "total_column_articles": 137, "frontend_question_id": "1107", "is_new_question": false }, @@ -42873,8 +43230,8 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 113367, - "total_submitted": 173936, + "total_acs": 113750, + "total_submitted": 174519, "total_column_articles": 758, "frontend_question_id": "1114", "is_new_question": false @@ -42894,8 +43251,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 4011, - "total_submitted": 7982, + "total_acs": 4013, + "total_submitted": 7984, "total_column_articles": 62, "frontend_question_id": "1246", "is_new_question": false @@ -42915,8 +43272,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 2583, - "total_submitted": 4538, + "total_acs": 2588, + "total_submitted": 4543, "total_column_articles": 70, "frontend_question_id": "1273", "is_new_question": false @@ -42936,9 +43293,9 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 3432, - "total_submitted": 6001, - "total_column_articles": 59, + "total_acs": 3494, + "total_submitted": 6086, + "total_column_articles": 60, "frontend_question_id": "1272", "is_new_question": false }, @@ -42957,8 +43314,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 3268, - "total_submitted": 6239, + "total_acs": 3276, + "total_submitted": 6250, "total_column_articles": 67, "frontend_question_id": "1271", "is_new_question": false @@ -42978,9 +43335,9 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 13783, - "total_submitted": 29223, - "total_column_articles": 135, + "total_acs": 13832, + "total_submitted": 29416, + "total_column_articles": 138, "frontend_question_id": "1098", "is_new_question": false }, @@ -42999,9 +43356,9 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 27044, - "total_submitted": 39455, - "total_column_articles": 573, + "total_acs": 27062, + "total_submitted": 39481, + "total_column_articles": 574, "frontend_question_id": "1106", "is_new_question": false }, @@ -43020,8 +43377,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 21596, - "total_submitted": 32092, + "total_acs": 21630, + "total_submitted": 32134, "total_column_articles": 207, "frontend_question_id": "1105", "is_new_question": false @@ -43041,9 +43398,9 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 44775, - "total_submitted": 70251, - "total_column_articles": 1244, + "total_acs": 44860, + "total_submitted": 70398, + "total_column_articles": 1245, "frontend_question_id": "1103", "is_new_question": false }, @@ -43062,8 +43419,8 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 32922, - "total_submitted": 43395, + "total_acs": 32955, + "total_submitted": 43453, "total_column_articles": 780, "frontend_question_id": "1104", "is_new_question": false @@ -43083,9 +43440,9 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 11899, - "total_submitted": 22689, - "total_column_articles": 169, + "total_acs": 11964, + "total_submitted": 22913, + "total_column_articles": 170, "frontend_question_id": "1097", "is_new_question": false }, @@ -43104,8 +43461,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 7475, - "total_submitted": 12666, + "total_acs": 7538, + "total_submitted": 12754, "total_column_articles": 103, "frontend_question_id": "1231", "is_new_question": false @@ -43125,8 +43482,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 2118, - "total_submitted": 3571, + "total_acs": 2119, + "total_submitted": 3576, "total_column_articles": 78, "frontend_question_id": "1258", "is_new_question": false @@ -43146,8 +43503,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 2731, - "total_submitted": 4610, + "total_acs": 2734, + "total_submitted": 4614, "total_column_articles": 68, "frontend_question_id": "1257", "is_new_question": false @@ -43167,8 +43524,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 2103, - "total_submitted": 3053, + "total_acs": 2106, + "total_submitted": 3057, "total_column_articles": 55, "frontend_question_id": "1256", "is_new_question": false @@ -43188,8 +43545,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 15307, - "total_submitted": 20844, + "total_acs": 15318, + "total_submitted": 20860, "total_column_articles": 155, "frontend_question_id": "1096", "is_new_question": false @@ -43209,8 +43566,8 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 66306, - "total_submitted": 116066, + "total_acs": 66599, + "total_submitted": 116519, "total_column_articles": 614, "frontend_question_id": "1115", "is_new_question": false @@ -43230,8 +43587,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 26989, - "total_submitted": 49940, + "total_acs": 27106, + "total_submitted": 50129, "total_column_articles": 338, "frontend_question_id": "1117", "is_new_question": false @@ -43251,8 +43608,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 27226, - "total_submitted": 72176, + "total_acs": 27273, + "total_submitted": 72302, "total_column_articles": 472, "frontend_question_id": "1095", "is_new_question": false @@ -43272,9 +43629,9 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 76525, - "total_submitted": 148215, - "total_column_articles": 1398, + "total_acs": 76886, + "total_submitted": 149052, + "total_column_articles": 1401, "frontend_question_id": "1094", "is_new_question": false }, @@ -43293,8 +43650,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 17009, - "total_submitted": 40625, + "total_acs": 17041, + "total_submitted": 40679, "total_column_articles": 207, "frontend_question_id": "1093", "is_new_question": false @@ -43314,9 +43671,9 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 36214, - "total_submitted": 84613, - "total_column_articles": 371, + "total_acs": 36992, + "total_submitted": 86989, + "total_column_articles": 375, "frontend_question_id": "550", "is_new_question": false }, @@ -43335,9 +43692,9 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 29560, - "total_submitted": 42780, - "total_column_articles": 201, + "total_acs": 29694, + "total_submitted": 42936, + "total_column_articles": 203, "frontend_question_id": "534", "is_new_question": false }, @@ -43356,9 +43713,9 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 36205, - "total_submitted": 66832, - "total_column_articles": 232, + "total_acs": 36353, + "total_submitted": 67107, + "total_column_articles": 235, "frontend_question_id": "512", "is_new_question": false }, @@ -43377,9 +43734,9 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 94238, - "total_submitted": 133404, - "total_column_articles": 400, + "total_acs": 95332, + "total_submitted": 134923, + "total_column_articles": 404, "frontend_question_id": "511", "is_new_question": false }, @@ -43398,8 +43755,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 2876, - "total_submitted": 5001, + "total_acs": 2882, + "total_submitted": 5012, "total_column_articles": 58, "frontend_question_id": "1216", "is_new_question": false @@ -43419,9 +43776,9 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 6325, - "total_submitted": 11609, - "total_column_articles": 117, + "total_acs": 6367, + "total_submitted": 11679, + "total_column_articles": 118, "frontend_question_id": "1245", "is_new_question": false }, @@ -43440,8 +43797,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 4476, - "total_submitted": 7048, + "total_acs": 4503, + "total_submitted": 7080, "total_column_articles": 70, "frontend_question_id": "1244", "is_new_question": false @@ -43461,8 +43818,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 3600, - "total_submitted": 6705, + "total_acs": 3607, + "total_submitted": 6717, "total_column_articles": 87, "frontend_question_id": "1243", "is_new_question": false @@ -43482,9 +43839,9 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 54151, - "total_submitted": 104199, - "total_column_articles": 378, + "total_acs": 54902, + "total_submitted": 105765, + "total_column_articles": 384, "frontend_question_id": "1084", "is_new_question": false }, @@ -43503,9 +43860,9 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 18465, - "total_submitted": 34821, - "total_column_articles": 155, + "total_acs": 18535, + "total_submitted": 34952, + "total_column_articles": 158, "frontend_question_id": "1083", "is_new_question": false }, @@ -43524,9 +43881,9 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 19600, - "total_submitted": 25579, - "total_column_articles": 138, + "total_acs": 19657, + "total_submitted": 25655, + "total_column_articles": 139, "frontend_question_id": "1082", "is_new_question": false }, @@ -43545,9 +43902,9 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 78131, - "total_submitted": 193462, - "total_column_articles": 739, + "total_acs": 78297, + "total_submitted": 193831, + "total_column_articles": 740, "frontend_question_id": "1091", "is_new_question": false }, @@ -43566,8 +43923,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 18192, - "total_submitted": 31154, + "total_acs": 18225, + "total_submitted": 31246, "total_column_articles": 173, "frontend_question_id": "1092", "is_new_question": false @@ -43587,9 +43944,9 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 22166, - "total_submitted": 33148, - "total_column_articles": 313, + "total_acs": 22240, + "total_submitted": 33235, + "total_column_articles": 314, "frontend_question_id": "1090", "is_new_question": false }, @@ -43608,9 +43965,9 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 59415, - "total_submitted": 99355, - "total_column_articles": 769, + "total_acs": 59632, + "total_submitted": 99818, + "total_column_articles": 774, "frontend_question_id": "1089", "is_new_question": false }, @@ -43629,8 +43986,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 1115, - "total_submitted": 2359, + "total_acs": 1117, + "total_submitted": 2363, "total_column_articles": 31, "frontend_question_id": "1199", "is_new_question": false @@ -43650,8 +44007,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 6556, - "total_submitted": 12050, + "total_acs": 6577, + "total_submitted": 12080, "total_column_articles": 116, "frontend_question_id": "1230", "is_new_question": false @@ -43671,8 +44028,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 6425, - "total_submitted": 13797, + "total_acs": 6446, + "total_submitted": 13832, "total_column_articles": 124, "frontend_question_id": "1229", "is_new_question": false @@ -43692,9 +44049,9 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 4752, - "total_submitted": 8781, - "total_column_articles": 89, + "total_acs": 4822, + "total_submitted": 8907, + "total_column_articles": 90, "frontend_question_id": "1228", "is_new_question": false }, @@ -43713,9 +44070,9 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 17634, - "total_submitted": 24380, - "total_column_articles": 147, + "total_acs": 17748, + "total_submitted": 24557, + "total_column_articles": 150, "frontend_question_id": "1077", "is_new_question": false }, @@ -43734,9 +44091,9 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 18533, - "total_submitted": 37521, - "total_column_articles": 131, + "total_acs": 18609, + "total_submitted": 37685, + "total_column_articles": 134, "frontend_question_id": "1076", "is_new_question": false }, @@ -43755,9 +44112,9 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 25447, - "total_submitted": 36624, - "total_column_articles": 150, + "total_acs": 26350, + "total_submitted": 38079, + "total_column_articles": 154, "frontend_question_id": "1075", "is_new_question": false }, @@ -43776,8 +44133,8 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 32592, - "total_submitted": 41211, + "total_acs": 32633, + "total_submitted": 41260, "total_column_articles": 404, "frontend_question_id": "1079", "is_new_question": false @@ -43797,8 +44154,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 26992, - "total_submitted": 46158, + "total_acs": 27084, + "total_submitted": 46319, "total_column_articles": 248, "frontend_question_id": "1081", "is_new_question": false @@ -43818,9 +44175,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": 22556, - "total_submitted": 36702, - "total_column_articles": 272, + "total_acs": 22629, + "total_submitted": 36793, + "total_column_articles": 273, "frontend_question_id": "1080", "is_new_question": false }, @@ -43839,9 +44196,9 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 37928, - "total_submitted": 58264, - "total_column_articles": 524, + "total_acs": 38002, + "total_submitted": 58377, + "total_column_articles": 526, "frontend_question_id": "1078", "is_new_question": false }, @@ -43860,9 +44217,9 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 17029, - "total_submitted": 35758, - "total_column_articles": 110, + "total_acs": 17318, + "total_submitted": 36453, + "total_column_articles": 113, "frontend_question_id": "1070", "is_new_question": false }, @@ -43881,9 +44238,9 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 18611, - "total_submitted": 22737, - "total_column_articles": 85, + "total_acs": 18680, + "total_submitted": 22819, + "total_column_articles": 86, "frontend_question_id": "1069", "is_new_question": false }, @@ -43902,9 +44259,9 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 36319, - "total_submitted": 41871, - "total_column_articles": 124, + "total_acs": 37766, + "total_submitted": 43523, + "total_column_articles": 127, "frontend_question_id": "1068", "is_new_question": false }, @@ -43923,8 +44280,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 1080, - "total_submitted": 1722, + "total_acs": 1091, + "total_submitted": 1736, "total_column_articles": 28, "frontend_question_id": "1183", "is_new_question": false @@ -43945,7 +44302,7 @@ "question__title_slug": "stepping-numbers", "question__hide": false, "total_acs": 2618, - "total_submitted": 6035, + "total_submitted": 6038, "total_column_articles": 54, "frontend_question_id": "1215", "is_new_question": false @@ -43965,9 +44322,9 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 5555, - "total_submitted": 8392, - "total_column_articles": 104, + "total_acs": 5607, + "total_submitted": 8465, + "total_column_articles": 105, "frontend_question_id": "1214", "is_new_question": false }, @@ -43986,8 +44343,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 8838, - "total_submitted": 11286, + "total_acs": 8854, + "total_submitted": 11308, "total_column_articles": 184, "frontend_question_id": "1213", "is_new_question": false @@ -44007,8 +44364,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 16492, - "total_submitted": 39611, + "total_acs": 16502, + "total_submitted": 39653, "total_column_articles": 193, "frontend_question_id": "1073", "is_new_question": false @@ -44028,8 +44385,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": 21351, - "total_submitted": 29929, + "total_acs": 21384, + "total_submitted": 29969, "total_column_articles": 208, "frontend_question_id": "1072", "is_new_question": false @@ -44049,9 +44406,9 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 57860, - "total_submitted": 100240, - "total_column_articles": 856, + "total_acs": 59184, + "total_submitted": 102458, + "total_column_articles": 864, "frontend_question_id": "1071", "is_new_question": false }, @@ -44070,8 +44427,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": 22086, - "total_submitted": 32763, + "total_acs": 22108, + "total_submitted": 32789, "total_column_articles": 223, "frontend_question_id": "1074", "is_new_question": false @@ -44091,8 +44448,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 2947, - "total_submitted": 4703, + "total_acs": 2951, + "total_submitted": 4711, "total_column_articles": 57, "frontend_question_id": "1168", "is_new_question": false @@ -44112,9 +44469,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": 6870, - "total_submitted": 9274, - "total_column_articles": 99, + "total_acs": 6963, + "total_submitted": 9392, + "total_column_articles": 101, "frontend_question_id": "1198", "is_new_question": false }, @@ -44133,9 +44490,9 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 7734, - "total_submitted": 19667, - "total_column_articles": 88, + "total_acs": 7793, + "total_submitted": 19807, + "total_column_articles": 89, "frontend_question_id": "1197", "is_new_question": false }, @@ -44154,8 +44511,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": 5040, - "total_submitted": 7374, + "total_acs": 5047, + "total_submitted": 7384, "total_column_articles": 83, "frontend_question_id": "1196", "is_new_question": false @@ -44175,8 +44532,8 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 25711, - "total_submitted": 57344, + "total_acs": 25755, + "total_submitted": 57422, "total_column_articles": 314, "frontend_question_id": "1054", "is_new_question": false @@ -44196,9 +44553,9 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 28084, - "total_submitted": 58146, - "total_column_articles": 304, + "total_acs": 28111, + "total_submitted": 58230, + "total_column_articles": 305, "frontend_question_id": "1053", "is_new_question": false }, @@ -44217,8 +44574,8 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 63334, - "total_submitted": 109169, + "total_acs": 63599, + "total_submitted": 109634, "total_column_articles": 913, "frontend_question_id": "1052", "is_new_question": false @@ -44238,8 +44595,8 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 70187, - "total_submitted": 87653, + "total_acs": 70311, + "total_submitted": 87796, "total_column_articles": 690, "frontend_question_id": "1051", "is_new_question": false @@ -44259,9 +44616,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": 55416, - "total_submitted": 72404, - "total_column_articles": 219, + "total_acs": 56157, + "total_submitted": 73405, + "total_column_articles": 221, "frontend_question_id": "1050", "is_new_question": false }, @@ -44280,9 +44637,9 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 25205, - "total_submitted": 41482, - "total_column_articles": 219, + "total_acs": 25886, + "total_submitted": 42698, + "total_column_articles": 223, "frontend_question_id": "1045", "is_new_question": false }, @@ -44301,8 +44658,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 5589, - "total_submitted": 11716, + "total_acs": 5593, + "total_submitted": 11722, "total_column_articles": 99, "frontend_question_id": "1182", "is_new_question": false @@ -44322,9 +44679,9 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 22071, - "total_submitted": 62624, - "total_column_articles": 239, + "total_acs": 22109, + "total_submitted": 62730, + "total_column_articles": 241, "frontend_question_id": "1163", "is_new_question": false }, @@ -44364,9 +44721,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": 4728, - "total_submitted": 6035, - "total_column_articles": 107, + "total_acs": 4775, + "total_submitted": 6092, + "total_column_articles": 109, "frontend_question_id": "1180", "is_new_question": false }, @@ -44385,9 +44742,9 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 134510, - "total_submitted": 193979, - "total_column_articles": 852, + "total_acs": 136359, + "total_submitted": 196443, + "total_column_articles": 855, "frontend_question_id": "1049", "is_new_question": false }, @@ -44406,8 +44763,8 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 35089, - "total_submitted": 62883, + "total_acs": 35185, + "total_submitted": 63068, "total_column_articles": 401, "frontend_question_id": "1048", "is_new_question": false @@ -44427,9 +44784,9 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 249325, - "total_submitted": 344622, - "total_column_articles": 1645, + "total_acs": 251207, + "total_submitted": 347247, + "total_column_articles": 1650, "frontend_question_id": "1047", "is_new_question": false }, @@ -44448,9 +44805,9 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 94119, - "total_submitted": 143695, - "total_column_articles": 1229, + "total_acs": 94377, + "total_submitted": 144108, + "total_column_articles": 1234, "frontend_question_id": "1046", "is_new_question": false }, @@ -44469,9 +44826,9 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 4095, - "total_submitted": 7905, - "total_column_articles": 57, + "total_acs": 4153, + "total_submitted": 7981, + "total_column_articles": 58, "frontend_question_id": "1167", "is_new_question": false }, @@ -44490,8 +44847,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 4856, - "total_submitted": 9745, + "total_acs": 4869, + "total_submitted": 9762, "total_column_articles": 87, "frontend_question_id": "1166", "is_new_question": false @@ -44511,8 +44868,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 2332, - "total_submitted": 6162, + "total_acs": 2335, + "total_submitted": 6169, "total_column_articles": 31, "frontend_question_id": "1153", "is_new_question": false @@ -44532,8 +44889,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 10343, - "total_submitted": 12258, + "total_acs": 10417, + "total_submitted": 12336, "total_column_articles": 160, "frontend_question_id": "1165", "is_new_question": false @@ -44553,8 +44910,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 28612, - "total_submitted": 80722, + "total_acs": 28673, + "total_submitted": 80867, "total_column_articles": 240, "frontend_question_id": "1044", "is_new_question": false @@ -44574,9 +44931,9 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 31068, - "total_submitted": 41141, - "total_column_articles": 299, + "total_acs": 31129, + "total_submitted": 41210, + "total_column_articles": 300, "frontend_question_id": "1043", "is_new_question": false }, @@ -44595,8 +44952,8 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 31771, - "total_submitted": 52032, + "total_acs": 31802, + "total_submitted": 52077, "total_column_articles": 344, "frontend_question_id": "1042", "is_new_question": false @@ -44616,9 +44973,9 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 32299, - "total_submitted": 56591, - "total_column_articles": 435, + "total_acs": 32506, + "total_submitted": 56962, + "total_column_articles": 438, "frontend_question_id": "1041", "is_new_question": false }, @@ -44637,8 +44994,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 1606, - "total_submitted": 2644, + "total_acs": 1611, + "total_submitted": 2649, "total_column_articles": 27, "frontend_question_id": "1121", "is_new_question": false @@ -44658,9 +45015,9 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 54676, - "total_submitted": 117056, - "total_column_articles": 678, + "total_acs": 54764, + "total_submitted": 117294, + "total_column_articles": 681, "frontend_question_id": "1162", "is_new_question": false }, @@ -44679,9 +45036,9 @@ "question__title": "Maximum Level Sum of a Binary Tree", "question__title_slug": "maximum-level-sum-of-a-binary-tree", "question__hide": false, - "total_acs": 39429, - "total_submitted": 59797, - "total_column_articles": 518, + "total_acs": 39850, + "total_submitted": 60521, + "total_column_articles": 523, "frontend_question_id": "1161", "is_new_question": false }, @@ -44700,8 +45057,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 41657, - "total_submitted": 85843, + "total_acs": 41718, + "total_submitted": 86010, "total_column_articles": 425, "frontend_question_id": "1037", "is_new_question": false @@ -44721,9 +45078,9 @@ "question__title": "Binary Search Tree to Greater Sum Tree", "question__title_slug": "binary-search-tree-to-greater-sum-tree", "question__hide": false, - "total_acs": 45518, - "total_submitted": 55950, - "total_column_articles": 539, + "total_acs": 45733, + "total_submitted": 56206, + "total_column_articles": 541, "frontend_question_id": "1038", "is_new_question": false }, @@ -44742,8 +45099,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 14709, - "total_submitted": 22244, + "total_acs": 14716, + "total_submitted": 22258, "total_column_articles": 95, "frontend_question_id": "1040", "is_new_question": false @@ -44763,8 +45120,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": 75929, - "total_submitted": 111382, + "total_acs": 76066, + "total_submitted": 111649, "total_column_articles": 1070, "frontend_question_id": "1160", "is_new_question": false @@ -44784,8 +45141,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 22389, - "total_submitted": 34629, + "total_acs": 22472, + "total_submitted": 34732, "total_column_articles": 150, "frontend_question_id": "1039", "is_new_question": false @@ -44805,8 +45162,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 2757, - "total_submitted": 6656, + "total_acs": 2801, + "total_submitted": 6705, "total_column_articles": 58, "frontend_question_id": "1152", "is_new_question": false @@ -44826,8 +45183,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": 9486, - "total_submitted": 17938, + "total_acs": 9507, + "total_submitted": 17969, "total_column_articles": 139, "frontend_question_id": "1151", "is_new_question": false @@ -44847,9 +45204,9 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 21080, - "total_submitted": 45055, - "total_column_articles": 218, + "total_acs": 21104, + "total_submitted": 45099, + "total_column_articles": 219, "frontend_question_id": "1036", "is_new_question": false }, @@ -44868,9 +45225,9 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 85006, - "total_submitted": 120488, - "total_column_articles": 620, + "total_acs": 85790, + "total_submitted": 121479, + "total_column_articles": 623, "frontend_question_id": "1035", "is_new_question": false }, @@ -44889,9 +45246,9 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 33976, - "total_submitted": 61636, - "total_column_articles": 536, + "total_acs": 34027, + "total_submitted": 61721, + "total_column_articles": 537, "frontend_question_id": "1034", "is_new_question": false }, @@ -44910,8 +45267,8 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 24811, - "total_submitted": 50270, + "total_acs": 24841, + "total_submitted": 50317, "total_column_articles": 302, "frontend_question_id": "1033", "is_new_question": false @@ -44931,9 +45288,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": 7555, - "total_submitted": 12686, - "total_column_articles": 128, + "total_acs": 7621, + "total_submitted": 12795, + "total_column_articles": 129, "frontend_question_id": "1150", "is_new_question": false }, @@ -44952,8 +45309,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 6508, - "total_submitted": 10787, + "total_acs": 6581, + "total_submitted": 10908, "total_column_articles": 104, "frontend_question_id": "1136", "is_new_question": false @@ -44973,8 +45330,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 13435, - "total_submitted": 23194, + "total_acs": 13487, + "total_submitted": 23277, "total_column_articles": 155, "frontend_question_id": "1135", "is_new_question": false @@ -44994,9 +45351,9 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 8648, - "total_submitted": 21489, - "total_column_articles": 112, + "total_acs": 8675, + "total_submitted": 21538, + "total_column_articles": 113, "frontend_question_id": "1102", "is_new_question": false }, @@ -45015,8 +45372,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 5539, - "total_submitted": 8332, + "total_acs": 5606, + "total_submitted": 8418, "total_column_articles": 110, "frontend_question_id": "1133", "is_new_question": false @@ -45036,9 +45393,9 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 19286, - "total_submitted": 34068, - "total_column_articles": 259, + "total_acs": 19302, + "total_submitted": 34084, + "total_column_articles": 260, "frontend_question_id": "1032", "is_new_question": false }, @@ -45057,9 +45414,9 @@ "question__title": "Maximum Sum of Two Non-Overlapping Subarrays", "question__title_slug": "maximum-sum-of-two-non-overlapping-subarrays", "question__hide": false, - "total_acs": 26129, - "total_submitted": 39832, - "total_column_articles": 303, + "total_acs": 26174, + "total_submitted": 39906, + "total_column_articles": 304, "frontend_question_id": "1031", "is_new_question": false }, @@ -45078,8 +45435,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 25379, - "total_submitted": 36848, + "total_acs": 25449, + "total_submitted": 36956, "total_column_articles": 281, "frontend_question_id": "1029", "is_new_question": false @@ -45099,8 +45456,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 48250, - "total_submitted": 68349, + "total_acs": 48327, + "total_submitted": 68441, "total_column_articles": 532, "frontend_question_id": "1030", "is_new_question": false @@ -45120,8 +45477,8 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 25624, - "total_submitted": 35239, + "total_acs": 25669, + "total_submitted": 35304, "total_column_articles": 538, "frontend_question_id": "1028", "is_new_question": false @@ -45141,9 +45498,9 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 35827, - "total_submitted": 47659, - "total_column_articles": 481, + "total_acs": 35920, + "total_submitted": 47787, + "total_column_articles": 482, "frontend_question_id": "1026", "is_new_question": false }, @@ -45162,9 +45519,9 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 4453, - "total_submitted": 7048, - "total_column_articles": 86, + "total_acs": 4514, + "total_submitted": 7156, + "total_column_articles": 88, "frontend_question_id": "1120", "is_new_question": false }, @@ -45183,9 +45540,9 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 4954, - "total_submitted": 6418, - "total_column_articles": 78, + "total_acs": 4993, + "total_submitted": 6465, + "total_column_articles": 80, "frontend_question_id": "1134", "is_new_question": false }, @@ -45204,8 +45561,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 10482, - "total_submitted": 12025, + "total_acs": 10502, + "total_submitted": 12047, "total_column_articles": 186, "frontend_question_id": "1119", "is_new_question": false @@ -45225,8 +45582,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 3811, - "total_submitted": 5867, + "total_acs": 3817, + "total_submitted": 5874, "total_column_articles": 68, "frontend_question_id": "1118", "is_new_question": false @@ -45246,8 +45603,8 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 39225, - "total_submitted": 79527, + "total_acs": 39397, + "total_submitted": 79929, "total_column_articles": 320, "frontend_question_id": "1027", "is_new_question": false @@ -45267,8 +45624,8 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 98903, - "total_submitted": 140038, + "total_acs": 99110, + "total_submitted": 140352, "total_column_articles": 805, "frontend_question_id": "1025", "is_new_question": false @@ -45288,8 +45645,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": 4336, - "total_submitted": 6324, + "total_acs": 4342, + "total_submitted": 6334, "total_column_articles": 108, "frontend_question_id": "1101", "is_new_question": false @@ -45309,8 +45666,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": 10260, - "total_submitted": 14665, + "total_acs": 10368, + "total_submitted": 14809, "total_column_articles": 188, "frontend_question_id": "1100", "is_new_question": false @@ -45330,9 +45687,9 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 9145, - "total_submitted": 15275, - "total_column_articles": 146, + "total_acs": 9175, + "total_submitted": 15325, + "total_column_articles": 147, "frontend_question_id": "1099", "is_new_question": false }, @@ -45351,8 +45708,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": 4880, - "total_submitted": 6263, + "total_acs": 4892, + "total_submitted": 6275, "total_column_articles": 110, "frontend_question_id": "1085", "is_new_question": false @@ -45372,8 +45729,8 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 47252, - "total_submitted": 89102, + "total_acs": 47393, + "total_submitted": 89399, "total_column_articles": 551, "frontend_question_id": "1024", "is_new_question": false @@ -45393,8 +45750,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 29213, - "total_submitted": 45257, + "total_acs": 29264, + "total_submitted": 45335, "total_column_articles": 477, "frontend_question_id": "1023", "is_new_question": false @@ -45414,8 +45771,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": 56618, - "total_submitted": 75800, + "total_acs": 56725, + "total_submitted": 75969, "total_column_articles": 654, "frontend_question_id": "1022", "is_new_question": false @@ -45435,9 +45792,9 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 98166, - "total_submitted": 120629, - "total_column_articles": 1079, + "total_acs": 98268, + "total_submitted": 120741, + "total_column_articles": 1078, "frontend_question_id": "1021", "is_new_question": false }, @@ -45477,8 +45834,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 3629, - "total_submitted": 6365, + "total_acs": 3687, + "total_submitted": 6475, "total_column_articles": 90, "frontend_question_id": "1087", "is_new_question": false @@ -45498,8 +45855,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 3635, - "total_submitted": 6454, + "total_acs": 3639, + "total_submitted": 6466, "total_column_articles": 111, "frontend_question_id": "1065", "is_new_question": false @@ -45519,9 +45876,9 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 7171, - "total_submitted": 10550, - "total_column_articles": 122, + "total_acs": 7242, + "total_submitted": 10641, + "total_column_articles": 125, "frontend_question_id": "1086", "is_new_question": false }, @@ -45540,9 +45897,9 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 61393, - "total_submitted": 98530, - "total_column_articles": 848, + "total_acs": 61734, + "total_submitted": 99044, + "total_column_articles": 852, "frontend_question_id": "1020", "is_new_question": false }, @@ -45561,9 +45918,9 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 54465, - "total_submitted": 84737, - "total_column_articles": 662, + "total_acs": 54592, + "total_submitted": 84926, + "total_column_articles": 664, "frontend_question_id": "1019", "is_new_question": false }, @@ -45582,8 +45939,8 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 51485, - "total_submitted": 101803, + "total_acs": 51530, + "total_submitted": 101903, "total_column_articles": 452, "frontend_question_id": "1018", "is_new_question": false @@ -45603,8 +45960,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 23333, - "total_submitted": 35896, + "total_acs": 23357, + "total_submitted": 35934, "total_column_articles": 256, "frontend_question_id": "1017", "is_new_question": false @@ -45624,8 +45981,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 7251, - "total_submitted": 16449, + "total_acs": 7336, + "total_submitted": 16641, "total_column_articles": 130, "frontend_question_id": "1056", "is_new_question": false @@ -45645,8 +46002,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 1954, - "total_submitted": 4044, + "total_acs": 1960, + "total_submitted": 4056, "total_column_articles": 52, "frontend_question_id": "1067", "is_new_question": false @@ -45666,8 +46023,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 3310, - "total_submitted": 6464, + "total_acs": 3311, + "total_submitted": 6465, "total_column_articles": 71, "frontend_question_id": "1066", "is_new_question": false @@ -45687,8 +46044,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 6431, - "total_submitted": 9944, + "total_acs": 6450, + "total_submitted": 9975, "total_column_articles": 105, "frontend_question_id": "1064", "is_new_question": false @@ -45708,8 +46065,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": 25770, - "total_submitted": 40713, + "total_acs": 25785, + "total_submitted": 40747, "total_column_articles": 268, "frontend_question_id": "1016", "is_new_question": false @@ -45729,8 +46086,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 25665, - "total_submitted": 55142, + "total_acs": 25693, + "total_submitted": 55193, "total_column_articles": 170, "frontend_question_id": "1015", "is_new_question": false @@ -45750,8 +46107,8 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 62139, - "total_submitted": 108766, + "total_acs": 62192, + "total_submitted": 108839, "total_column_articles": 719, "frontend_question_id": "1014", "is_new_question": false @@ -45771,8 +46128,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": 60711, - "total_submitted": 157600, + "total_acs": 60836, + "total_submitted": 157954, "total_column_articles": 1052, "frontend_question_id": "1013", "is_new_question": false @@ -45793,7 +46150,7 @@ "question__title_slug": "number-of-valid-subarrays", "question__hide": false, "total_acs": 3013, - "total_submitted": 4080, + "total_submitted": 4082, "total_column_articles": 62, "frontend_question_id": "1063", "is_new_question": false @@ -45813,8 +46170,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 6539, - "total_submitted": 11492, + "total_acs": 6562, + "total_submitted": 11545, "total_column_articles": 87, "frontend_question_id": "1062", "is_new_question": false @@ -45834,9 +46191,9 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 11852, - "total_submitted": 21644, - "total_column_articles": 162, + "total_acs": 11913, + "total_submitted": 21729, + "total_column_articles": 163, "frontend_question_id": "1060", "is_new_question": false }, @@ -45855,8 +46212,8 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 5591, - "total_submitted": 8659, + "total_acs": 5630, + "total_submitted": 8707, "total_column_articles": 122, "frontend_question_id": "1061", "is_new_question": false @@ -45876,8 +46233,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 19887, - "total_submitted": 37762, + "total_acs": 19925, + "total_submitted": 37819, "total_column_articles": 193, "frontend_question_id": "1012", "is_new_question": false @@ -45897,9 +46254,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": 96668, - "total_submitted": 155865, - "total_column_articles": 862, + "total_acs": 96890, + "total_submitted": 156232, + "total_column_articles": 865, "frontend_question_id": "1011", "is_new_question": false }, @@ -45918,8 +46275,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": 42699, - "total_submitted": 86020, + "total_acs": 42750, + "total_submitted": 86118, "total_column_articles": 490, "frontend_question_id": "1010", "is_new_question": false @@ -45939,8 +46296,8 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 24322, - "total_submitted": 41513, + "total_acs": 24400, + "total_submitted": 41653, "total_column_articles": 344, "frontend_question_id": "1009", "is_new_question": false @@ -45960,9 +46317,9 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 1963, - "total_submitted": 5236, - "total_column_articles": 50, + "total_acs": 1968, + "total_submitted": 5245, + "total_column_articles": 51, "frontend_question_id": "1058", "is_new_question": false }, @@ -45981,9 +46338,9 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 4553, - "total_submitted": 8861, - "total_column_articles": 60, + "total_acs": 4615, + "total_submitted": 8937, + "total_column_articles": 61, "frontend_question_id": "1057", "is_new_question": false }, @@ -46002,8 +46359,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 10475, - "total_submitted": 17280, + "total_acs": 10554, + "total_submitted": 17406, "total_column_articles": 159, "frontend_question_id": "1055", "is_new_question": false @@ -46023,9 +46380,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": 31001, - "total_submitted": 43275, - "total_column_articles": 404, + "total_acs": 31196, + "total_submitted": 43559, + "total_column_articles": 405, "frontend_question_id": "1008", "is_new_question": false }, @@ -46044,8 +46401,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 9194, - "total_submitted": 19219, + "total_acs": 9218, + "total_submitted": 19283, "total_column_articles": 127, "frontend_question_id": "1007", "is_new_question": false @@ -46065,9 +46422,9 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 48221, - "total_submitted": 76856, - "total_column_articles": 669, + "total_acs": 48332, + "total_submitted": 77020, + "total_column_articles": 670, "frontend_question_id": "1006", "is_new_question": false }, @@ -46086,9 +46443,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": 137175, - "total_submitted": 270071, - "total_column_articles": 1512, + "total_acs": 138289, + "total_submitted": 272152, + "total_column_articles": 1520, "frontend_question_id": "1005", "is_new_question": false }, @@ -46107,9 +46464,9 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 131937, - "total_submitted": 222023, - "total_column_articles": 1130, + "total_acs": 133186, + "total_submitted": 224159, + "total_column_articles": 1134, "frontend_question_id": "1004", "is_new_question": false }, @@ -46128,8 +46485,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": 35351, - "total_submitted": 55540, + "total_acs": 35397, + "total_submitted": 55606, "total_column_articles": 442, "frontend_question_id": "1003", "is_new_question": false @@ -46149,9 +46506,9 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 87583, - "total_submitted": 124318, - "total_column_articles": 851, + "total_acs": 87886, + "total_submitted": 124740, + "total_column_articles": 855, "frontend_question_id": "1002", "is_new_question": false }, @@ -46170,8 +46527,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 19474, - "total_submitted": 43425, + "total_acs": 19530, + "total_submitted": 43489, "total_column_articles": 283, "frontend_question_id": "1001", "is_new_question": false @@ -46191,8 +46548,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 19031, - "total_submitted": 35500, + "total_acs": 19093, + "total_submitted": 35579, "total_column_articles": 110, "frontend_question_id": "1000", "is_new_question": false @@ -46212,8 +46569,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 35523, - "total_submitted": 51242, + "total_acs": 35569, + "total_submitted": 51325, "total_column_articles": 642, "frontend_question_id": "999", "is_new_question": false @@ -46233,9 +46590,9 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 32949, - "total_submitted": 47931, - "total_column_articles": 438, + "total_acs": 33010, + "total_submitted": 48003, + "total_column_articles": 441, "frontend_question_id": "998", "is_new_question": false }, @@ -46254,9 +46611,9 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 89781, - "total_submitted": 173246, - "total_column_articles": 870, + "total_acs": 89997, + "total_submitted": 173687, + "total_column_articles": 872, "frontend_question_id": "997", "is_new_question": false }, @@ -46275,8 +46632,8 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 7256, - "total_submitted": 14345, + "total_acs": 7272, + "total_submitted": 14371, "total_column_articles": 142, "frontend_question_id": "996", "is_new_question": false @@ -46296,8 +46653,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": 26032, - "total_submitted": 48271, + "total_acs": 26072, + "total_submitted": 48336, "total_column_articles": 287, "frontend_question_id": "995", "is_new_question": false @@ -46317,9 +46674,9 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 119593, - "total_submitted": 234434, - "total_column_articles": 2144, + "total_acs": 120867, + "total_submitted": 236901, + "total_column_articles": 2149, "frontend_question_id": "994", "is_new_question": false }, @@ -46338,9 +46695,9 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 64996, - "total_submitted": 116467, - "total_column_articles": 1016, + "total_acs": 65122, + "total_submitted": 116685, + "total_column_articles": 1019, "frontend_question_id": "993", "is_new_question": false }, @@ -46359,8 +46716,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 31337, - "total_submitted": 65944, + "total_acs": 31396, + "total_submitted": 66089, "total_column_articles": 338, "frontend_question_id": "992", "is_new_question": false @@ -46380,8 +46737,8 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 12619, - "total_submitted": 24106, + "total_acs": 12650, + "total_submitted": 24173, "total_column_articles": 149, "frontend_question_id": "991", "is_new_question": false @@ -46401,9 +46758,9 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 54167, - "total_submitted": 101285, - "total_column_articles": 910, + "total_acs": 54388, + "total_submitted": 101627, + "total_column_articles": 916, "frontend_question_id": "990", "is_new_question": false }, @@ -46422,9 +46779,9 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 72439, - "total_submitted": 158124, - "total_column_articles": 790, + "total_acs": 72602, + "total_submitted": 158520, + "total_column_articles": 791, "frontend_question_id": "989", "is_new_question": false }, @@ -46443,8 +46800,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 16146, - "total_submitted": 31466, + "total_acs": 16244, + "total_submitted": 31596, "total_column_articles": 196, "frontend_question_id": "988", "is_new_question": false @@ -46464,8 +46821,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": 32427, - "total_submitted": 60323, + "total_acs": 32487, + "total_submitted": 60410, "total_column_articles": 513, "frontend_question_id": "987", "is_new_question": false @@ -46485,8 +46842,8 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 63770, - "total_submitted": 93136, + "total_acs": 63973, + "total_submitted": 93406, "total_column_articles": 593, "frontend_question_id": "986", "is_new_question": false @@ -46506,8 +46863,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 19845, - "total_submitted": 32404, + "total_acs": 19866, + "total_submitted": 32438, "total_column_articles": 228, "frontend_question_id": "985", "is_new_question": false @@ -46527,8 +46884,8 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 13488, - "total_submitted": 31066, + "total_acs": 13525, + "total_submitted": 31135, "total_column_articles": 220, "frontend_question_id": "984", "is_new_question": false @@ -46548,9 +46905,9 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 42786, - "total_submitted": 67423, - "total_column_articles": 551, + "total_acs": 42912, + "total_submitted": 67628, + "total_column_articles": 553, "frontend_question_id": "983", "is_new_question": false }, @@ -46569,8 +46926,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": 21162, - "total_submitted": 31444, + "total_acs": 21186, + "total_submitted": 31483, "total_column_articles": 151, "frontend_question_id": "982", "is_new_question": false @@ -46590,9 +46947,9 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 30937, - "total_submitted": 58603, - "total_column_articles": 389, + "total_acs": 31038, + "total_submitted": 58798, + "total_column_articles": 390, "frontend_question_id": "981", "is_new_question": false }, @@ -46611,8 +46968,8 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 34510, - "total_submitted": 44047, + "total_acs": 34946, + "total_submitted": 44598, "total_column_articles": 410, "frontend_question_id": "980", "is_new_question": false @@ -46632,9 +46989,9 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 28511, - "total_submitted": 37468, - "total_column_articles": 349, + "total_acs": 28619, + "total_submitted": 37608, + "total_column_articles": 350, "frontend_question_id": "979", "is_new_question": false }, @@ -46653,8 +47010,8 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 52408, - "total_submitted": 110224, + "total_acs": 52551, + "total_submitted": 110532, "total_column_articles": 692, "frontend_question_id": "978", "is_new_question": false @@ -46674,9 +47031,9 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 563122, - "total_submitted": 829304, - "total_column_articles": 3450, + "total_acs": 566743, + "total_submitted": 834673, + "total_column_articles": 3462, "frontend_question_id": "977", "is_new_question": false }, @@ -46695,8 +47052,8 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 86116, - "total_submitted": 149817, + "total_acs": 86435, + "total_submitted": 150392, "total_column_articles": 851, "frontend_question_id": "976", "is_new_question": false @@ -46716,9 +47073,9 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 5650, - "total_submitted": 11781, - "total_column_articles": 91, + "total_acs": 5666, + "total_submitted": 11816, + "total_column_articles": 92, "frontend_question_id": "975", "is_new_question": false }, @@ -46737,9 +47094,9 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 59768, - "total_submitted": 124676, - "total_column_articles": 553, + "total_acs": 59969, + "total_submitted": 125015, + "total_column_articles": 555, "frontend_question_id": "974", "is_new_question": false }, @@ -46758,8 +47115,8 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 96284, - "total_submitted": 147520, + "total_acs": 96459, + "total_submitted": 147780, "total_column_articles": 828, "frontend_question_id": "973", "is_new_question": false @@ -46779,9 +47136,9 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 580304, - "total_submitted": 877521, - "total_column_articles": 3194, + "total_acs": 584335, + "total_submitted": 883738, + "total_column_articles": 3208, "frontend_question_id": "509", "is_new_question": false }, @@ -46800,8 +47157,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 2189, - "total_submitted": 5258, + "total_acs": 2194, + "total_submitted": 5266, "total_column_articles": 53, "frontend_question_id": "972", "is_new_question": false @@ -46821,8 +47178,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": 10844, - "total_submitted": 23751, + "total_acs": 10898, + "total_submitted": 23825, "total_column_articles": 166, "frontend_question_id": "971", "is_new_question": false @@ -46842,8 +47199,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 29143, - "total_submitted": 62016, + "total_acs": 29203, + "total_submitted": 62114, "total_column_articles": 308, "frontend_question_id": "970", "is_new_question": false @@ -46863,9 +47220,9 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 47881, - "total_submitted": 70857, - "total_column_articles": 690, + "total_acs": 47970, + "total_submitted": 70973, + "total_column_articles": 694, "frontend_question_id": "969", "is_new_question": false }, @@ -46884,8 +47241,8 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 63392, - "total_submitted": 121128, + "total_acs": 63993, + "total_submitted": 122237, "total_column_articles": 626, "frontend_question_id": "968", "is_new_question": false @@ -46905,9 +47262,9 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 12432, - "total_submitted": 24556, - "total_column_articles": 238, + "total_acs": 12508, + "total_submitted": 24702, + "total_column_articles": 239, "frontend_question_id": "967", "is_new_question": false }, @@ -46926,8 +47283,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 4832, - "total_submitted": 11206, + "total_acs": 4852, + "total_submitted": 11244, "total_column_articles": 70, "frontend_question_id": "966", "is_new_question": false @@ -46947,8 +47304,8 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 82309, - "total_submitted": 116638, + "total_acs": 82554, + "total_submitted": 116991, "total_column_articles": 888, "frontend_question_id": "965", "is_new_question": false @@ -46968,8 +47325,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 2316, - "total_submitted": 4995, + "total_acs": 2330, + "total_submitted": 5012, "total_column_articles": 42, "frontend_question_id": "964", "is_new_question": false @@ -46989,8 +47346,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 3858, - "total_submitted": 7544, + "total_acs": 3877, + "total_submitted": 7569, "total_column_articles": 53, "frontend_question_id": "963", "is_new_question": false @@ -47010,8 +47367,8 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 24624, - "total_submitted": 51971, + "total_acs": 24706, + "total_submitted": 52105, "total_column_articles": 232, "frontend_question_id": "962", "is_new_question": false @@ -47031,9 +47388,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": 80835, - "total_submitted": 115081, - "total_column_articles": 730, + "total_acs": 81014, + "total_submitted": 115324, + "total_column_articles": 732, "frontend_question_id": "961", "is_new_question": false }, @@ -47052,8 +47409,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 3690, - "total_submitted": 6275, + "total_acs": 3701, + "total_submitted": 6294, "total_column_articles": 62, "frontend_question_id": "960", "is_new_question": false @@ -47073,8 +47430,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 23247, - "total_submitted": 31314, + "total_acs": 23280, + "total_submitted": 31352, "total_column_articles": 355, "frontend_question_id": "959", "is_new_question": false @@ -47094,9 +47451,9 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 50972, - "total_submitted": 93512, - "total_column_articles": 465, + "total_acs": 51226, + "total_submitted": 93946, + "total_column_articles": 467, "frontend_question_id": "958", "is_new_question": false }, @@ -47115,8 +47472,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 19634, - "total_submitted": 52925, + "total_acs": 19684, + "total_submitted": 53007, "total_column_articles": 193, "frontend_question_id": "957", "is_new_question": false @@ -47136,8 +47493,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 6722, - "total_submitted": 14393, + "total_acs": 6786, + "total_submitted": 14512, "total_column_articles": 81, "frontend_question_id": "956", "is_new_question": false @@ -47157,8 +47514,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 5614, - "total_submitted": 15754, + "total_acs": 5640, + "total_submitted": 15800, "total_column_articles": 93, "frontend_question_id": "955", "is_new_question": false @@ -47178,8 +47535,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 42968, - "total_submitted": 109938, + "total_acs": 42994, + "total_submitted": 109988, "total_column_articles": 480, "frontend_question_id": "954", "is_new_question": false @@ -47199,8 +47556,8 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 55604, - "total_submitted": 96423, + "total_acs": 55680, + "total_submitted": 96548, "total_column_articles": 703, "frontend_question_id": "953", "is_new_question": false @@ -47220,8 +47577,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 19332, - "total_submitted": 37883, + "total_acs": 19345, + "total_submitted": 37922, "total_column_articles": 184, "frontend_question_id": "952", "is_new_question": false @@ -47241,9 +47598,9 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 17744, - "total_submitted": 26514, - "total_column_articles": 254, + "total_acs": 17814, + "total_submitted": 26622, + "total_column_articles": 255, "frontend_question_id": "951", "is_new_question": false }, @@ -47262,8 +47619,8 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 14609, - "total_submitted": 18547, + "total_acs": 14641, + "total_submitted": 18592, "total_column_articles": 237, "frontend_question_id": "950", "is_new_question": false @@ -47283,8 +47640,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 11848, - "total_submitted": 31285, + "total_acs": 11901, + "total_submitted": 31391, "total_column_articles": 187, "frontend_question_id": "949", "is_new_question": false @@ -47304,8 +47661,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 10345, - "total_submitted": 25483, + "total_acs": 10368, + "total_submitted": 25530, "total_column_articles": 160, "frontend_question_id": "948", "is_new_question": false @@ -47325,8 +47682,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": 34389, - "total_submitted": 55905, + "total_acs": 34416, + "total_submitted": 55962, "total_column_articles": 428, "frontend_question_id": "947", "is_new_question": false @@ -47346,8 +47703,8 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 81162, - "total_submitted": 121887, + "total_acs": 81459, + "total_submitted": 122332, "total_column_articles": 863, "frontend_question_id": "946", "is_new_question": false @@ -47367,8 +47724,8 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 43014, - "total_submitted": 89588, + "total_acs": 43075, + "total_submitted": 89715, "total_column_articles": 623, "frontend_question_id": "945", "is_new_question": false @@ -47388,9 +47745,9 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 57572, - "total_submitted": 83445, - "total_column_articles": 506, + "total_acs": 57658, + "total_submitted": 83578, + "total_column_articles": 507, "frontend_question_id": "944", "is_new_question": false }, @@ -47409,8 +47766,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 3693, - "total_submitted": 7742, + "total_acs": 3705, + "total_submitted": 7769, "total_column_articles": 79, "frontend_question_id": "943", "is_new_question": false @@ -47430,8 +47787,8 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 66974, - "total_submitted": 86702, + "total_acs": 67077, + "total_submitted": 86821, "total_column_articles": 799, "frontend_question_id": "942", "is_new_question": false @@ -47451,9 +47808,9 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 86849, - "total_submitted": 219704, - "total_column_articles": 810, + "total_acs": 87156, + "total_submitted": 220387, + "total_column_articles": 812, "frontend_question_id": "941", "is_new_question": false }, @@ -47472,8 +47829,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 30600, - "total_submitted": 57336, + "total_acs": 30650, + "total_submitted": 57469, "total_column_articles": 283, "frontend_question_id": "940", "is_new_question": false @@ -47493,9 +47850,9 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 9019, - "total_submitted": 18603, - "total_column_articles": 108, + "total_acs": 9054, + "total_submitted": 18658, + "total_column_articles": 109, "frontend_question_id": "939", "is_new_question": false }, @@ -47514,9 +47871,9 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 122816, - "total_submitted": 149519, - "total_column_articles": 1001, + "total_acs": 123121, + "total_submitted": 149903, + "total_column_articles": 1003, "frontend_question_id": "938", "is_new_question": false }, @@ -47535,8 +47892,8 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 41941, - "total_submitted": 66119, + "total_acs": 41963, + "total_submitted": 66148, "total_column_articles": 508, "frontend_question_id": "937", "is_new_question": false @@ -47556,8 +47913,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 2758, - "total_submitted": 6501, + "total_acs": 2765, + "total_submitted": 6512, "total_column_articles": 39, "frontend_question_id": "936", "is_new_question": false @@ -47577,8 +47934,8 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 10052, - "total_submitted": 19361, + "total_acs": 10081, + "total_submitted": 19392, "total_column_articles": 134, "frontend_question_id": "935", "is_new_question": false @@ -47598,9 +47955,9 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 68269, - "total_submitted": 130372, - "total_column_articles": 739, + "total_acs": 68467, + "total_submitted": 130703, + "total_column_articles": 740, "frontend_question_id": "934", "is_new_question": false }, @@ -47619,9 +47976,9 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 102660, - "total_submitted": 133684, - "total_column_articles": 850, + "total_acs": 103551, + "total_submitted": 134828, + "total_column_articles": 849, "frontend_question_id": "933", "is_new_question": false }, @@ -47640,9 +47997,9 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 13752, - "total_submitted": 20922, - "total_column_articles": 130, + "total_acs": 13786, + "total_submitted": 20964, + "total_column_articles": 131, "frontend_question_id": "932", "is_new_question": false }, @@ -47661,9 +48018,9 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 84106, - "total_submitted": 123768, - "total_column_articles": 1247, + "total_acs": 84795, + "total_submitted": 124867, + "total_column_articles": 1266, "frontend_question_id": "931", "is_new_question": false }, @@ -47682,8 +48039,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 45342, - "total_submitted": 82237, + "total_acs": 45604, + "total_submitted": 82704, "total_column_articles": 441, "frontend_question_id": "930", "is_new_question": false @@ -47703,9 +48060,9 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 56484, - "total_submitted": 82374, - "total_column_articles": 542, + "total_acs": 56581, + "total_submitted": 82525, + "total_column_articles": 544, "frontend_question_id": "929", "is_new_question": false }, @@ -47724,8 +48081,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 4185, - "total_submitted": 9563, + "total_acs": 4197, + "total_submitted": 9585, "total_column_articles": 75, "frontend_question_id": "928", "is_new_question": false @@ -47745,9 +48102,9 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 23899, - "total_submitted": 54543, - "total_column_articles": 366, + "total_acs": 23913, + "total_submitted": 54570, + "total_column_articles": 367, "frontend_question_id": "927", "is_new_question": false }, @@ -47766,9 +48123,9 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 37795, - "total_submitted": 59561, - "total_column_articles": 521, + "total_acs": 37871, + "total_submitted": 59667, + "total_column_articles": 522, "frontend_question_id": "926", "is_new_question": false }, @@ -47787,9 +48144,9 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 67841, - "total_submitted": 181298, - "total_column_articles": 834, + "total_acs": 68074, + "total_submitted": 181950, + "total_column_articles": 835, "frontend_question_id": "925", "is_new_question": false }, @@ -47808,9 +48165,9 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 10286, - "total_submitted": 28750, - "total_column_articles": 149, + "total_acs": 10313, + "total_submitted": 28818, + "total_column_articles": 150, "frontend_question_id": "924", "is_new_question": false }, @@ -47829,9 +48186,9 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 10207, - "total_submitted": 27545, - "total_column_articles": 121, + "total_acs": 10232, + "total_submitted": 27592, + "total_column_articles": 122, "frontend_question_id": "923", "is_new_question": false }, @@ -47850,9 +48207,9 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 118324, - "total_submitted": 165844, - "total_column_articles": 1078, + "total_acs": 118621, + "total_submitted": 166212, + "total_column_articles": 1079, "frontend_question_id": "922", "is_new_question": false }, @@ -47871,9 +48228,9 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 67539, - "total_submitted": 92502, - "total_column_articles": 924, + "total_acs": 67700, + "total_submitted": 92719, + "total_column_articles": 925, "frontend_question_id": "921", "is_new_question": false }, @@ -47892,8 +48249,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 3536, - "total_submitted": 6721, + "total_acs": 3565, + "total_submitted": 6782, "total_column_articles": 41, "frontend_question_id": "920", "is_new_question": false @@ -47913,8 +48270,8 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 32268, - "total_submitted": 48217, + "total_acs": 32311, + "total_submitted": 48271, "total_column_articles": 416, "frontend_question_id": "919", "is_new_question": false @@ -47934,9 +48291,9 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 70910, - "total_submitted": 176735, - "total_column_articles": 613, + "total_acs": 71400, + "total_submitted": 177680, + "total_column_articles": 614, "frontend_question_id": "918", "is_new_question": false }, @@ -47955,9 +48312,9 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 78550, - "total_submitted": 132309, - "total_column_articles": 1082, + "total_acs": 78713, + "total_submitted": 132578, + "total_column_articles": 1084, "frontend_question_id": "917", "is_new_question": false }, @@ -47976,8 +48333,8 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 9548, - "total_submitted": 20615, + "total_acs": 9592, + "total_submitted": 20678, "total_column_articles": 123, "frontend_question_id": "916", "is_new_question": false @@ -47997,8 +48354,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 48783, - "total_submitted": 97318, + "total_acs": 48870, + "total_submitted": 97458, "total_column_articles": 562, "frontend_question_id": "915", "is_new_question": false @@ -48018,9 +48375,9 @@ "question__title": "X of a Kind in a Deck of Cards", "question__title_slug": "x-of-a-kind-in-a-deck-of-cards", "question__hide": false, - "total_acs": 60568, - "total_submitted": 161803, - "total_column_articles": 754, + "total_acs": 60686, + "total_submitted": 162197, + "total_column_articles": 756, "frontend_question_id": "914", "is_new_question": false }, @@ -48039,8 +48396,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 18155, - "total_submitted": 33760, + "total_acs": 18209, + "total_submitted": 33939, "total_column_articles": 141, "frontend_question_id": "913", "is_new_question": false @@ -48060,9 +48417,9 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 559168, - "total_submitted": 1090968, - "total_column_articles": 2165, + "total_acs": 562314, + "total_submitted": 1099309, + "total_column_articles": 2174, "frontend_question_id": "912", "is_new_question": false }, @@ -48081,9 +48438,9 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 32238, - "total_submitted": 59972, - "total_column_articles": 369, + "total_acs": 32276, + "total_submitted": 60032, + "total_column_articles": 371, "frontend_question_id": "911", "is_new_question": false }, @@ -48102,8 +48459,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 12046, - "total_submitted": 33718, + "total_acs": 12081, + "total_submitted": 33769, "total_column_articles": 124, "frontend_question_id": "910", "is_new_question": false @@ -48123,9 +48480,9 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 20581, - "total_submitted": 45000, - "total_column_articles": 223, + "total_acs": 20747, + "total_submitted": 45409, + "total_column_articles": 225, "frontend_question_id": "909", "is_new_question": false }, @@ -48144,8 +48501,8 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 56228, - "total_submitted": 75583, + "total_acs": 56347, + "total_submitted": 75724, "total_column_articles": 583, "frontend_question_id": "908", "is_new_question": false @@ -48165,8 +48522,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 47171, - "total_submitted": 123090, + "total_acs": 47444, + "total_submitted": 123677, "total_column_articles": 444, "frontend_question_id": "907", "is_new_question": false @@ -48186,9 +48543,9 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 4368, - "total_submitted": 13728, - "total_column_articles": 79, + "total_acs": 4393, + "total_submitted": 13799, + "total_column_articles": 80, "frontend_question_id": "906", "is_new_question": false }, @@ -48207,9 +48564,9 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 122643, - "total_submitted": 172722, - "total_column_articles": 1448, + "total_acs": 122946, + "total_submitted": 173121, + "total_column_articles": 1452, "frontend_question_id": "905", "is_new_question": false }, @@ -48228,9 +48585,9 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 135417, - "total_submitted": 302044, - "total_column_articles": 1483, + "total_acs": 136266, + "total_submitted": 303914, + "total_column_articles": 1485, "frontend_question_id": "904", "is_new_question": false }, @@ -48249,8 +48606,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 4349, - "total_submitted": 7702, + "total_acs": 4376, + "total_submitted": 7731, "total_column_articles": 66, "frontend_question_id": "903", "is_new_question": false @@ -48270,9 +48627,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": 27899, - "total_submitted": 60038, - "total_column_articles": 405, + "total_acs": 27987, + "total_submitted": 60219, + "total_column_articles": 406, "frontend_question_id": "902", "is_new_question": false }, @@ -48291,9 +48648,9 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 62505, - "total_submitted": 100462, - "total_column_articles": 675, + "total_acs": 62868, + "total_submitted": 101058, + "total_column_articles": 676, "frontend_question_id": "901", "is_new_question": false }, @@ -48312,8 +48669,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 5825, - "total_submitted": 11340, + "total_acs": 5841, + "total_submitted": 11368, "total_column_articles": 89, "frontend_question_id": "900", "is_new_question": false @@ -48333,8 +48690,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 28362, - "total_submitted": 44330, + "total_acs": 28423, + "total_submitted": 44414, "total_column_articles": 280, "frontend_question_id": "899", "is_new_question": false @@ -48354,8 +48711,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 9027, - "total_submitted": 22985, + "total_acs": 9064, + "total_submitted": 23057, "total_column_articles": 65, "frontend_question_id": "898", "is_new_question": false @@ -48375,8 +48732,8 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 79033, - "total_submitted": 106797, + "total_acs": 79136, + "total_submitted": 106918, "total_column_articles": 899, "frontend_question_id": "897", "is_new_question": false @@ -48396,9 +48753,9 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 84652, - "total_submitted": 148420, - "total_column_articles": 992, + "total_acs": 85085, + "total_submitted": 149193, + "total_column_articles": 995, "frontend_question_id": "896", "is_new_question": false }, @@ -48417,9 +48774,9 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 31998, - "total_submitted": 49739, - "total_column_articles": 324, + "total_acs": 32080, + "total_submitted": 49894, + "total_column_articles": 323, "frontend_question_id": "895", "is_new_question": false }, @@ -48438,8 +48795,8 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 19686, - "total_submitted": 25347, + "total_acs": 19749, + "total_submitted": 25421, "total_column_articles": 199, "frontend_question_id": "894", "is_new_question": false @@ -48459,9 +48816,9 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 13161, - "total_submitted": 18012, - "total_column_articles": 145, + "total_acs": 13186, + "total_submitted": 18041, + "total_column_articles": 146, "frontend_question_id": "893", "is_new_question": false }, @@ -48480,8 +48837,8 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 38887, - "total_submitted": 60295, + "total_acs": 38924, + "total_submitted": 60349, "total_column_articles": 780, "frontend_question_id": "892", "is_new_question": false @@ -48501,9 +48858,9 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 20618, - "total_submitted": 44267, - "total_column_articles": 202, + "total_acs": 20633, + "total_submitted": 44295, + "total_column_articles": 201, "frontend_question_id": "891", "is_new_question": false }, @@ -48522,8 +48879,8 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 31990, - "total_submitted": 40706, + "total_acs": 32032, + "total_submitted": 40754, "total_column_articles": 477, "frontend_question_id": "890", "is_new_question": false @@ -48543,9 +48900,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": 40160, - "total_submitted": 59063, - "total_column_articles": 370, + "total_acs": 40373, + "total_submitted": 59396, + "total_column_articles": 373, "frontend_question_id": "889", "is_new_question": false }, @@ -48564,9 +48921,9 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 69071, - "total_submitted": 108698, - "total_column_articles": 602, + "total_acs": 69230, + "total_submitted": 108959, + "total_column_articles": 604, "frontend_question_id": "888", "is_new_question": false }, @@ -48585,8 +48942,8 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 78931, - "total_submitted": 257351, + "total_acs": 79089, + "total_submitted": 257821, "total_column_articles": 471, "frontend_question_id": "887", "is_new_question": false @@ -48606,9 +48963,9 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 49199, - "total_submitted": 94300, - "total_column_articles": 623, + "total_acs": 49391, + "total_submitted": 94653, + "total_column_articles": 624, "frontend_question_id": "886", "is_new_question": false }, @@ -48627,9 +48984,9 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 8525, - "total_submitted": 11946, - "total_column_articles": 135, + "total_acs": 8561, + "total_submitted": 11997, + "total_column_articles": 136, "frontend_question_id": "885", "is_new_question": false }, @@ -48648,9 +49005,9 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 51040, - "total_submitted": 71649, - "total_column_articles": 647, + "total_acs": 51166, + "total_submitted": 71824, + "total_column_articles": 649, "frontend_question_id": "884", "is_new_question": false }, @@ -48669,8 +49026,8 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 45963, - "total_submitted": 60164, + "total_acs": 46043, + "total_submitted": 60259, "total_column_articles": 568, "frontend_question_id": "883", "is_new_question": false @@ -48690,9 +49047,9 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 15722, - "total_submitted": 24604, - "total_column_articles": 143, + "total_acs": 15750, + "total_submitted": 24660, + "total_column_articles": 144, "frontend_question_id": "882", "is_new_question": false }, @@ -48711,9 +49068,9 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 68451, - "total_submitted": 127360, - "total_column_articles": 767, + "total_acs": 68711, + "total_submitted": 127726, + "total_column_articles": 769, "frontend_question_id": "881", "is_new_question": false }, @@ -48732,8 +49089,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 8736, - "total_submitted": 32420, + "total_acs": 8763, + "total_submitted": 32483, "total_column_articles": 115, "frontend_question_id": "880", "is_new_question": false @@ -48753,8 +49110,8 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 29789, - "total_submitted": 61712, + "total_acs": 29845, + "total_submitted": 61811, "total_column_articles": 189, "frontend_question_id": "478", "is_new_question": false @@ -48774,9 +49131,9 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 24265, - "total_submitted": 57995, - "total_column_articles": 214, + "total_acs": 24294, + "total_submitted": 58072, + "total_column_articles": 215, "frontend_question_id": "497", "is_new_question": false }, @@ -48795,8 +49152,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 22127, - "total_submitted": 47855, + "total_acs": 22211, + "total_submitted": 47971, "total_column_articles": 214, "frontend_question_id": "519", "is_new_question": false @@ -48816,9 +49173,9 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 58168, - "total_submitted": 120190, - "total_column_articles": 490, + "total_acs": 58385, + "total_submitted": 120579, + "total_column_articles": 489, "frontend_question_id": "528", "is_new_question": false }, @@ -48837,8 +49194,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 27987, - "total_submitted": 51214, + "total_acs": 28232, + "total_submitted": 51599, "total_column_articles": 238, "frontend_question_id": "879", "is_new_question": false @@ -48858,8 +49215,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 24085, - "total_submitted": 60284, + "total_acs": 24127, + "total_submitted": 60374, "total_column_articles": 227, "frontend_question_id": "878", "is_new_question": false @@ -48879,9 +49236,9 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 96474, - "total_submitted": 126149, - "total_column_articles": 672, + "total_acs": 96723, + "total_submitted": 126464, + "total_column_articles": 673, "frontend_question_id": "877", "is_new_question": false }, @@ -48900,9 +49257,9 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 408663, - "total_submitted": 581359, - "total_column_articles": 3611, + "total_acs": 410168, + "total_submitted": 583331, + "total_column_articles": 3615, "frontend_question_id": "876", "is_new_question": false }, @@ -48921,9 +49278,9 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 134117, - "total_submitted": 271501, - "total_column_articles": 982, + "total_acs": 134793, + "total_submitted": 272866, + "total_column_articles": 990, "frontend_question_id": "875", "is_new_question": false }, @@ -48942,9 +49299,9 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 43577, - "total_submitted": 92345, - "total_column_articles": 500, + "total_acs": 43756, + "total_submitted": 92721, + "total_column_articles": 502, "frontend_question_id": "874", "is_new_question": false }, @@ -48963,8 +49320,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 50151, - "total_submitted": 89150, + "total_acs": 50276, + "total_submitted": 89390, "total_column_articles": 382, "frontend_question_id": "873", "is_new_question": false @@ -48984,9 +49341,9 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 76998, - "total_submitted": 118434, - "total_column_articles": 900, + "total_acs": 77610, + "total_submitted": 119401, + "total_column_articles": 907, "frontend_question_id": "872", "is_new_question": false }, @@ -49005,9 +49362,9 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 103137, - "total_submitted": 186935, - "total_column_articles": 471, + "total_acs": 103430, + "total_submitted": 187500, + "total_column_articles": 472, "frontend_question_id": "470", "is_new_question": false }, @@ -49026,8 +49383,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 34303, - "total_submitted": 79390, + "total_acs": 34332, + "total_submitted": 79469, "total_column_articles": 369, "frontend_question_id": "871", "is_new_question": false @@ -49047,9 +49404,9 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 66503, - "total_submitted": 131680, - "total_column_articles": 768, + "total_acs": 66692, + "total_submitted": 131953, + "total_column_articles": 770, "frontend_question_id": "870", "is_new_question": false }, @@ -49068,8 +49425,8 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 37324, - "total_submitted": 58724, + "total_acs": 37361, + "total_submitted": 58776, "total_column_articles": 541, "frontend_question_id": "869", "is_new_question": false @@ -49089,9 +49446,9 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 52346, - "total_submitted": 75485, - "total_column_articles": 694, + "total_acs": 52425, + "total_submitted": 75585, + "total_column_articles": 695, "frontend_question_id": "868", "is_new_question": false }, @@ -49110,8 +49467,8 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 100148, - "total_submitted": 150044, + "total_acs": 100524, + "total_submitted": 150589, "total_column_articles": 878, "frontend_question_id": "867", "is_new_question": false @@ -49131,8 +49488,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 11432, - "total_submitted": 47835, + "total_acs": 11456, + "total_submitted": 47943, "total_column_articles": 128, "frontend_question_id": "866", "is_new_question": false @@ -49152,9 +49509,9 @@ "question__title": "Smallest Subtree with all the Deepest Nodes", "question__title_slug": "smallest-subtree-with-all-the-deepest-nodes", "question__hide": false, - "total_acs": 15973, - "total_submitted": 23212, - "total_column_articles": 231, + "total_acs": 16045, + "total_submitted": 23302, + "total_column_articles": 232, "frontend_question_id": "865", "is_new_question": false }, @@ -49173,8 +49530,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 21219, - "total_submitted": 35696, + "total_acs": 21254, + "total_submitted": 35753, "total_column_articles": 249, "frontend_question_id": "864", "is_new_question": false @@ -49194,8 +49551,8 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 30355, - "total_submitted": 69521, + "total_acs": 30440, + "total_submitted": 69759, "total_column_articles": 448, "frontend_question_id": "710", "is_new_question": false @@ -49215,9 +49572,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": 53716, - "total_submitted": 87461, - "total_column_articles": 763, + "total_acs": 53852, + "total_submitted": 87700, + "total_column_articles": 764, "frontend_question_id": "863", "is_new_question": false }, @@ -49236,8 +49593,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": 48760, - "total_submitted": 183029, + "total_acs": 48914, + "total_submitted": 183457, "total_column_articles": 390, "frontend_question_id": "862", "is_new_question": false @@ -49257,9 +49614,9 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 36231, - "total_submitted": 44895, - "total_column_articles": 523, + "total_acs": 36277, + "total_submitted": 44954, + "total_column_articles": 524, "frontend_question_id": "861", "is_new_question": false }, @@ -49278,9 +49635,9 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 196005, - "total_submitted": 332466, - "total_column_articles": 1458, + "total_acs": 197679, + "total_submitted": 335208, + "total_column_articles": 1469, "frontend_question_id": "860", "is_new_question": false }, @@ -49299,9 +49656,9 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 70811, - "total_submitted": 205021, - "total_column_articles": 903, + "total_acs": 70958, + "total_submitted": 205336, + "total_column_articles": 906, "frontend_question_id": "859", "is_new_question": false }, @@ -49320,9 +49677,9 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 5006, - "total_submitted": 8704, - "total_column_articles": 82, + "total_acs": 5032, + "total_submitted": 8760, + "total_column_articles": 83, "frontend_question_id": "858", "is_new_question": false }, @@ -49341,8 +49698,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 20370, - "total_submitted": 32057, + "total_acs": 20393, + "total_submitted": 32111, "total_column_articles": 218, "frontend_question_id": "857", "is_new_question": false @@ -49362,8 +49719,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 54357, - "total_submitted": 79423, + "total_acs": 54456, + "total_submitted": 79561, "total_column_articles": 709, "frontend_question_id": "856", "is_new_question": false @@ -49383,9 +49740,9 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 21728, - "total_submitted": 45599, - "total_column_articles": 217, + "total_acs": 21770, + "total_submitted": 45705, + "total_column_articles": 221, "frontend_question_id": "855", "is_new_question": false }, @@ -49404,8 +49761,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 26017, - "total_submitted": 55682, + "total_acs": 26057, + "total_submitted": 55802, "total_column_articles": 249, "frontend_question_id": "854", "is_new_question": false @@ -49425,9 +49782,9 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 18445, - "total_submitted": 44382, - "total_column_articles": 213, + "total_acs": 18529, + "total_submitted": 44531, + "total_column_articles": 215, "frontend_question_id": "853", "is_new_question": false }, @@ -49446,9 +49803,9 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 141334, - "total_submitted": 206066, - "total_column_articles": 1159, + "total_acs": 141975, + "total_submitted": 207033, + "total_column_articles": 1160, "frontend_question_id": "852", "is_new_question": false }, @@ -49467,9 +49824,9 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 30780, - "total_submitted": 48800, - "total_column_articles": 335, + "total_acs": 30859, + "total_submitted": 48931, + "total_column_articles": 336, "frontend_question_id": "851", "is_new_question": false }, @@ -49488,8 +49845,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 19142, - "total_submitted": 30435, + "total_acs": 19164, + "total_submitted": 30471, "total_column_articles": 179, "frontend_question_id": "850", "is_new_question": false @@ -49509,9 +49866,9 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 22098, - "total_submitted": 49943, - "total_column_articles": 270, + "total_acs": 22160, + "total_submitted": 50039, + "total_column_articles": 271, "frontend_question_id": "849", "is_new_question": false }, @@ -49530,8 +49887,8 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 14403, - "total_submitted": 31122, + "total_acs": 14457, + "total_submitted": 31216, "total_column_articles": 154, "frontend_question_id": "848", "is_new_question": false @@ -49551,8 +49908,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 26750, - "total_submitted": 39610, + "total_acs": 26786, + "total_submitted": 39680, "total_column_articles": 236, "frontend_question_id": "847", "is_new_question": false @@ -49572,9 +49929,9 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 40840, - "total_submitted": 71380, - "total_column_articles": 542, + "total_acs": 40900, + "total_submitted": 71489, + "total_column_articles": 543, "frontend_question_id": "846", "is_new_question": false }, @@ -49593,9 +49950,9 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 49425, - "total_submitted": 116904, - "total_column_articles": 716, + "total_acs": 49546, + "total_submitted": 117184, + "total_column_articles": 718, "frontend_question_id": "845", "is_new_question": false }, @@ -49614,9 +49971,9 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 209274, - "total_submitted": 437065, - "total_column_articles": 1938, + "total_acs": 210051, + "total_submitted": 438607, + "total_column_articles": 1943, "frontend_question_id": "844", "is_new_question": false }, @@ -49635,8 +49992,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 4655, - "total_submitted": 12765, + "total_acs": 4677, + "total_submitted": 12809, "total_column_articles": 69, "frontend_question_id": "843", "is_new_question": false @@ -49656,8 +50013,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 34092, - "total_submitted": 70573, + "total_acs": 34139, + "total_submitted": 70666, "total_column_articles": 384, "frontend_question_id": "842", "is_new_question": false @@ -49677,9 +50034,9 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 93146, - "total_submitted": 136861, - "total_column_articles": 834, + "total_acs": 93867, + "total_submitted": 137857, + "total_column_articles": 839, "frontend_question_id": "841", "is_new_question": false }, @@ -49698,9 +50055,9 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 11705, - "total_submitted": 31834, - "total_column_articles": 150, + "total_acs": 11730, + "total_submitted": 31947, + "total_column_articles": 151, "frontend_question_id": "840", "is_new_question": false }, @@ -49719,9 +50076,9 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 24685, - "total_submitted": 41943, - "total_column_articles": 335, + "total_acs": 24727, + "total_submitted": 41998, + "total_column_articles": 336, "frontend_question_id": "839", "is_new_question": false }, @@ -49740,9 +50097,9 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 39685, - "total_submitted": 71353, - "total_column_articles": 561, + "total_acs": 39731, + "total_submitted": 71408, + "total_column_articles": 562, "frontend_question_id": "838", "is_new_question": false }, @@ -49761,9 +50118,9 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 22691, - "total_submitted": 57003, - "total_column_articles": 275, + "total_acs": 22732, + "total_submitted": 57125, + "total_column_articles": 276, "frontend_question_id": "837", "is_new_question": false }, @@ -49782,9 +50139,9 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 49803, - "total_submitted": 101544, - "total_column_articles": 778, + "total_acs": 49954, + "total_submitted": 101777, + "total_column_articles": 779, "frontend_question_id": "836", "is_new_question": false }, @@ -49803,8 +50160,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 3540, - "total_submitted": 4775, + "total_acs": 3549, + "total_submitted": 4787, "total_column_articles": 38, "frontend_question_id": "489", "is_new_question": false @@ -49824,8 +50181,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 6546, - "total_submitted": 11239, + "total_acs": 6578, + "total_submitted": 11325, "total_column_articles": 74, "frontend_question_id": "835", "is_new_question": false @@ -49845,8 +50202,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 26155, - "total_submitted": 43611, + "total_acs": 26266, + "total_submitted": 43773, "total_column_articles": 234, "frontend_question_id": "834", "is_new_question": false @@ -49866,9 +50223,9 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 8436, - "total_submitted": 19099, - "total_column_articles": 140, + "total_acs": 27223, + "total_submitted": 52243, + "total_column_articles": 334, "frontend_question_id": "833", "is_new_question": false }, @@ -49887,9 +50244,9 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 101631, - "total_submitted": 127836, - "total_column_articles": 1132, + "total_acs": 101815, + "total_submitted": 128100, + "total_column_articles": 1135, "frontend_question_id": "832", "is_new_question": false }, @@ -49908,8 +50265,8 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 132370, - "total_submitted": 281430, + "total_acs": 132766, + "total_submitted": 282498, "total_column_articles": 1012, "frontend_question_id": "622", "is_new_question": false @@ -49929,9 +50286,9 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 60197, - "total_submitted": 105566, - "total_column_articles": 652, + "total_acs": 60407, + "total_submitted": 105915, + "total_column_articles": 653, "frontend_question_id": "641", "is_new_question": false }, @@ -49950,8 +50307,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 27972, - "total_submitted": 51970, + "total_acs": 28023, + "total_submitted": 52114, "total_column_articles": 280, "frontend_question_id": "831", "is_new_question": false @@ -49971,9 +50328,9 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 60681, - "total_submitted": 112107, - "total_column_articles": 706, + "total_acs": 60797, + "total_submitted": 112318, + "total_column_articles": 709, "frontend_question_id": "830", "is_new_question": false }, @@ -49992,9 +50349,9 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 31978, - "total_submitted": 69196, - "total_column_articles": 377, + "total_acs": 32028, + "total_submitted": 69309, + "total_column_articles": 378, "frontend_question_id": "829", "is_new_question": false }, @@ -50013,9 +50370,9 @@ "question__title": "Count Unique Characters of All Substrings of a Given String", "question__title_slug": "count-unique-characters-of-all-substrings-of-a-given-string", "question__hide": false, - "total_acs": 28264, - "total_submitted": 43122, - "total_column_articles": 313, + "total_acs": 28304, + "total_submitted": 43179, + "total_column_articles": 315, "frontend_question_id": "828", "is_new_question": false }, @@ -50034,9 +50391,9 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 40353, - "total_submitted": 85796, - "total_column_articles": 549, + "total_acs": 40598, + "total_submitted": 86228, + "total_column_articles": 551, "frontend_question_id": "827", "is_new_question": false }, @@ -50055,8 +50412,8 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 16659, - "total_submitted": 39040, + "total_acs": 16697, + "total_submitted": 39129, "total_column_articles": 234, "frontend_question_id": "826", "is_new_question": false @@ -50076,8 +50433,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 37192, - "total_submitted": 82038, + "total_acs": 37255, + "total_submitted": 82162, "total_column_articles": 363, "frontend_question_id": "825", "is_new_question": false @@ -50097,9 +50454,9 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 55183, - "total_submitted": 84797, - "total_column_articles": 751, + "total_acs": 55281, + "total_submitted": 84935, + "total_column_articles": 753, "frontend_question_id": "824", "is_new_question": false }, @@ -50118,8 +50475,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": 5610, - "total_submitted": 15001, + "total_acs": 5673, + "total_submitted": 15141, "total_column_articles": 104, "frontend_question_id": "708", "is_new_question": false @@ -50139,8 +50496,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 6077, - "total_submitted": 13981, + "total_acs": 6137, + "total_submitted": 14086, "total_column_articles": 82, "frontend_question_id": "823", "is_new_question": false @@ -50160,9 +50517,9 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 23849, - "total_submitted": 39952, - "total_column_articles": 239, + "total_acs": 24157, + "total_submitted": 40506, + "total_column_articles": 241, "frontend_question_id": "822", "is_new_question": false }, @@ -50181,9 +50538,9 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 75132, - "total_submitted": 103151, - "total_column_articles": 1005, + "total_acs": 75268, + "total_submitted": 103350, + "total_column_articles": 1007, "frontend_question_id": "821", "is_new_question": false }, @@ -50202,9 +50559,9 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 70499, - "total_submitted": 135291, - "total_column_articles": 741, + "total_acs": 70600, + "total_submitted": 135467, + "total_column_articles": 742, "frontend_question_id": "820", "is_new_question": false }, @@ -50223,9 +50580,9 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 247067, - "total_submitted": 713990, - "total_column_articles": 1444, + "total_acs": 249130, + "total_submitted": 720130, + "total_column_articles": 1448, "frontend_question_id": "707", "is_new_question": false }, @@ -50244,9 +50601,9 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 61087, - "total_submitted": 134085, - "total_column_articles": 735, + "total_acs": 61221, + "total_submitted": 134412, + "total_column_articles": 736, "frontend_question_id": "819", "is_new_question": false }, @@ -50265,9 +50622,9 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 6056, - "total_submitted": 13524, - "total_column_articles": 70, + "total_acs": 6073, + "total_submitted": 13561, + "total_column_articles": 71, "frontend_question_id": "818", "is_new_question": false }, @@ -50286,8 +50643,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 49460, - "total_submitted": 80570, + "total_acs": 49510, + "total_submitted": 80700, "total_column_articles": 589, "frontend_question_id": "817", "is_new_question": false @@ -50307,8 +50664,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 27597, - "total_submitted": 44092, + "total_acs": 27624, + "total_submitted": 44135, "total_column_articles": 393, "frontend_question_id": "816", "is_new_question": false @@ -50328,8 +50685,8 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 38024, - "total_submitted": 85724, + "total_acs": 38087, + "total_submitted": 85873, "total_column_articles": 418, "frontend_question_id": "815", "is_new_question": false @@ -50349,8 +50706,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 59868, - "total_submitted": 82546, + "total_acs": 59995, + "total_submitted": 82730, "total_column_articles": 801, "frontend_question_id": "814", "is_new_question": false @@ -50370,9 +50727,9 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 28205, - "total_submitted": 45708, - "total_column_articles": 272, + "total_acs": 28272, + "total_submitted": 45813, + "total_column_articles": 271, "frontend_question_id": "813", "is_new_question": false }, @@ -50391,9 +50748,9 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 36974, - "total_submitted": 54251, - "total_column_articles": 327, + "total_acs": 37078, + "total_submitted": 54401, + "total_column_articles": 329, "frontend_question_id": "812", "is_new_question": false }, @@ -50412,8 +50769,8 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 44410, - "total_submitted": 57929, + "total_acs": 44464, + "total_submitted": 57987, "total_column_articles": 566, "frontend_question_id": "811", "is_new_question": false @@ -50433,8 +50790,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 19084, - "total_submitted": 26323, + "total_acs": 19126, + "total_submitted": 26371, "total_column_articles": 156, "frontend_question_id": "810", "is_new_question": false @@ -50454,8 +50811,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 25776, - "total_submitted": 52687, + "total_acs": 25807, + "total_submitted": 52746, "total_column_articles": 371, "frontend_question_id": "809", "is_new_question": false @@ -50475,8 +50832,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 22437, - "total_submitted": 38196, + "total_acs": 22474, + "total_submitted": 38253, "total_column_articles": 167, "frontend_question_id": "808", "is_new_question": false @@ -50496,9 +50853,9 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 54870, - "total_submitted": 62336, - "total_column_articles": 764, + "total_acs": 54992, + "total_submitted": 62474, + "total_column_articles": 765, "frontend_question_id": "807", "is_new_question": false }, @@ -50517,9 +50874,9 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 53110, - "total_submitted": 77615, - "total_column_articles": 648, + "total_acs": 53198, + "total_submitted": 77747, + "total_column_articles": 650, "frontend_question_id": "806", "is_new_question": false }, @@ -50538,8 +50895,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 22070, - "total_submitted": 51406, + "total_acs": 22094, + "total_submitted": 51483, "total_column_articles": 191, "frontend_question_id": "805", "is_new_question": false @@ -50559,9 +50916,9 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 79883, - "total_submitted": 97148, - "total_column_articles": 847, + "total_acs": 80015, + "total_submitted": 97303, + "total_column_articles": 851, "frontend_question_id": "804", "is_new_question": false }, @@ -50580,8 +50937,8 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 14714, - "total_submitted": 31394, + "total_acs": 14731, + "total_submitted": 31437, "total_column_articles": 155, "frontend_question_id": "803", "is_new_question": false @@ -50601,9 +50958,9 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 45601, - "total_submitted": 77132, - "total_column_articles": 470, + "total_acs": 45872, + "total_submitted": 77549, + "total_column_articles": 471, "frontend_question_id": "802", "is_new_question": false }, @@ -50622,8 +50979,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 31147, - "total_submitted": 61528, + "total_acs": 31199, + "total_submitted": 61626, "total_column_articles": 318, "frontend_question_id": "801", "is_new_question": false @@ -50643,8 +51000,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 2441, - "total_submitted": 3476, + "total_acs": 2446, + "total_submitted": 3482, "total_column_articles": 56, "frontend_question_id": "800", "is_new_question": false @@ -50664,8 +51021,8 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 98764, - "total_submitted": 155229, + "total_acs": 98941, + "total_submitted": 155519, "total_column_articles": 604, "frontend_question_id": "706", "is_new_question": false @@ -50685,9 +51042,9 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 105551, - "total_submitted": 166622, - "total_column_articles": 623, + "total_acs": 105800, + "total_submitted": 166972, + "total_column_articles": 626, "frontend_question_id": "705", "is_new_question": false }, @@ -50706,9 +51063,9 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 29011, - "total_submitted": 54719, - "total_column_articles": 312, + "total_acs": 29091, + "total_submitted": 54850, + "total_column_articles": 311, "frontend_question_id": "799", "is_new_question": false }, @@ -50727,8 +51084,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 21388, - "total_submitted": 34759, + "total_acs": 21402, + "total_submitted": 34781, "total_column_articles": 227, "frontend_question_id": "798", "is_new_question": false @@ -50748,9 +51105,9 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 106405, - "total_submitted": 134896, - "total_column_articles": 1891, + "total_acs": 107188, + "total_submitted": 135925, + "total_column_articles": 1892, "frontend_question_id": "797", "is_new_question": false }, @@ -50769,9 +51126,9 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 81073, - "total_submitted": 128060, - "total_column_articles": 906, + "total_acs": 81241, + "total_submitted": 128312, + "total_column_articles": 909, "frontend_question_id": "796", "is_new_question": false }, @@ -50790,9 +51147,9 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 36200, - "total_submitted": 62669, - "total_column_articles": 353, + "total_acs": 36280, + "total_submitted": 62830, + "total_column_articles": 354, "frontend_question_id": "795", "is_new_question": false }, @@ -50811,8 +51168,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 31478, - "total_submitted": 81535, + "total_acs": 31501, + "total_submitted": 81613, "total_column_articles": 502, "frontend_question_id": "794", "is_new_question": false @@ -50832,8 +51189,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 27803, - "total_submitted": 57167, + "total_acs": 27851, + "total_submitted": 57281, "total_column_articles": 291, "frontend_question_id": "793", "is_new_question": false @@ -50853,9 +51210,9 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 41042, - "total_submitted": 80501, - "total_column_articles": 450, + "total_acs": 41126, + "total_submitted": 80672, + "total_column_articles": 448, "frontend_question_id": "792", "is_new_question": false }, @@ -50874,9 +51231,9 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 41910, - "total_submitted": 56472, - "total_column_articles": 602, + "total_acs": 41975, + "total_submitted": 56576, + "total_column_articles": 603, "frontend_question_id": "791", "is_new_question": false }, @@ -50895,8 +51252,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 27620, - "total_submitted": 49976, + "total_acs": 27898, + "total_submitted": 50569, "total_column_articles": 292, "frontend_question_id": "790", "is_new_question": false @@ -50916,8 +51273,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 23455, - "total_submitted": 34251, + "total_acs": 23469, + "total_submitted": 34269, "total_column_articles": 329, "frontend_question_id": "789", "is_new_question": false @@ -50937,8 +51294,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 45814, - "total_submitted": 69192, + "total_acs": 45844, + "total_submitted": 69233, "total_column_articles": 521, "frontend_question_id": "788", "is_new_question": false @@ -50958,9 +51315,9 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 68291, - "total_submitted": 172063, - "total_column_articles": 675, + "total_acs": 68611, + "total_submitted": 172782, + "total_column_articles": 677, "frontend_question_id": "787", "is_new_question": false }, @@ -50979,9 +51336,9 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 32844, - "total_submitted": 48612, - "total_column_articles": 318, + "total_acs": 32930, + "total_submitted": 48740, + "total_column_articles": 319, "frontend_question_id": "786", "is_new_question": false }, @@ -51000,8 +51357,8 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 80560, - "total_submitted": 147215, + "total_acs": 80918, + "total_submitted": 147853, "total_column_articles": 1494, "frontend_question_id": "785", "is_new_question": false @@ -51021,9 +51378,9 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 107977, - "total_submitted": 148702, - "total_column_articles": 1189, + "total_acs": 108230, + "total_submitted": 149114, + "total_column_articles": 1191, "frontend_question_id": "784", "is_new_question": false }, @@ -51042,8 +51399,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 86615, - "total_submitted": 143994, + "total_acs": 86752, + "total_submitted": 144250, "total_column_articles": 839, "frontend_question_id": "783", "is_new_question": false @@ -51063,8 +51420,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 14214, - "total_submitted": 23840, + "total_acs": 14217, + "total_submitted": 23844, "total_column_articles": 149, "frontend_question_id": "782", "is_new_question": false @@ -51084,9 +51441,9 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 56058, - "total_submitted": 95275, - "total_column_articles": 802, + "total_acs": 56134, + "total_submitted": 95427, + "total_column_articles": 805, "frontend_question_id": "781", "is_new_question": false }, @@ -51105,9 +51462,9 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 26610, - "total_submitted": 70741, - "total_column_articles": 266, + "total_acs": 26650, + "total_submitted": 70816, + "total_column_articles": 267, "frontend_question_id": "780", "is_new_question": false }, @@ -51126,8 +51483,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 51745, - "total_submitted": 104057, + "total_acs": 51792, + "total_submitted": 104139, "total_column_articles": 757, "frontend_question_id": "779", "is_new_question": false @@ -51147,9 +51504,9 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 33258, - "total_submitted": 56325, - "total_column_articles": 441, + "total_acs": 33359, + "total_submitted": 56473, + "total_column_articles": 444, "frontend_question_id": "778", "is_new_question": false }, @@ -51168,8 +51525,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 28395, - "total_submitted": 73970, + "total_acs": 28409, + "total_submitted": 74005, "total_column_articles": 305, "frontend_question_id": "777", "is_new_question": false @@ -51189,9 +51546,9 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 1041088, - "total_submitted": 1907977, - "total_column_articles": 5090, + "total_acs": 1047404, + "total_submitted": 1918557, + "total_column_articles": 5104, "frontend_question_id": "704", "is_new_question": false }, @@ -51210,8 +51567,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 2735, - "total_submitted": 4569, + "total_acs": 2745, + "total_submitted": 4583, "total_column_articles": 53, "frontend_question_id": "776", "is_new_question": false @@ -51231,9 +51588,9 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 33076, - "total_submitted": 66871, - "total_column_articles": 422, + "total_acs": 33104, + "total_submitted": 66922, + "total_column_articles": 421, "frontend_question_id": "775", "is_new_question": false }, @@ -51252,9 +51609,9 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 91291, - "total_submitted": 173571, - "total_column_articles": 812, + "total_acs": 91565, + "total_submitted": 174094, + "total_column_articles": 814, "frontend_question_id": "703", "is_new_question": false }, @@ -51273,8 +51630,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 2333, - "total_submitted": 3667, + "total_acs": 2335, + "total_submitted": 3669, "total_column_articles": 38, "frontend_question_id": "774", "is_new_question": false @@ -51294,9 +51651,9 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 35582, - "total_submitted": 50746, - "total_column_articles": 517, + "total_acs": 35710, + "total_submitted": 50925, + "total_column_articles": 518, "frontend_question_id": "773", "is_new_question": false }, @@ -51315,9 +51672,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": 8190, - "total_submitted": 10958, - "total_column_articles": 123, + "total_acs": 8211, + "total_submitted": 10981, + "total_column_articles": 122, "frontend_question_id": "702", "is_new_question": false }, @@ -51336,9 +51693,9 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 13504, - "total_submitted": 25427, - "total_column_articles": 208, + "total_acs": 13601, + "total_submitted": 25574, + "total_column_articles": 209, "frontend_question_id": "772", "is_new_question": false }, @@ -51357,9 +51714,9 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 202370, - "total_submitted": 286227, - "total_column_articles": 1386, + "total_acs": 203788, + "total_submitted": 288286, + "total_column_articles": 1393, "frontend_question_id": "701", "is_new_question": false }, @@ -51378,9 +51735,9 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 270710, - "total_submitted": 348768, - "total_column_articles": 1901, + "total_acs": 272914, + "total_submitted": 351466, + "total_column_articles": 1915, "frontend_question_id": "700", "is_new_question": false }, @@ -51399,9 +51756,9 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 208335, - "total_submitted": 243252, - "total_column_articles": 1572, + "total_acs": 208850, + "total_submitted": 243853, + "total_column_articles": 1575, "frontend_question_id": "771", "is_new_question": false }, @@ -51420,8 +51777,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 1945, - "total_submitted": 3452, + "total_acs": 1958, + "total_submitted": 3479, "total_column_articles": 42, "frontend_question_id": "770", "is_new_question": false @@ -51441,8 +51798,8 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 55069, - "total_submitted": 92986, + "total_acs": 55173, + "total_submitted": 93154, "total_column_articles": 754, "frontend_question_id": "769", "is_new_question": false @@ -51462,8 +51819,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 32385, - "total_submitted": 55185, + "total_acs": 32432, + "total_submitted": 55285, "total_column_articles": 389, "frontend_question_id": "768", "is_new_question": false @@ -51483,9 +51840,9 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 52919, - "total_submitted": 109139, - "total_column_articles": 622, + "total_acs": 52995, + "total_submitted": 109283, + "total_column_articles": 623, "frontend_question_id": "767", "is_new_question": false }, @@ -51504,9 +51861,9 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 68322, - "total_submitted": 97293, - "total_column_articles": 775, + "total_acs": 68560, + "total_submitted": 97658, + "total_column_articles": 778, "frontend_question_id": "766", "is_new_question": false }, @@ -51525,9 +51882,9 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 131584, - "total_submitted": 167189, - "total_column_articles": 923, + "total_acs": 131970, + "total_submitted": 167669, + "total_column_articles": 924, "frontend_question_id": "590", "is_new_question": false }, @@ -51546,9 +51903,9 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 190124, - "total_submitted": 248316, - "total_column_articles": 1152, + "total_acs": 190618, + "total_submitted": 248959, + "total_column_articles": 1156, "frontend_question_id": "589", "is_new_question": false }, @@ -51567,8 +51924,8 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 149482, - "total_submitted": 199381, + "total_acs": 150124, + "total_submitted": 200177, "total_column_articles": 1082, "frontend_question_id": "559", "is_new_question": false @@ -51588,8 +51945,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": 18210, - "total_submitted": 29008, + "total_acs": 18222, + "total_submitted": 29033, "total_column_articles": 164, "frontend_question_id": "558", "is_new_question": false @@ -51609,8 +51966,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 26240, - "total_submitted": 36842, + "total_acs": 26412, + "total_submitted": 37103, "total_column_articles": 339, "frontend_question_id": "427", "is_new_question": false @@ -51630,8 +51987,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": 2098, - "total_submitted": 2790, + "total_acs": 2116, + "total_submitted": 2808, "total_column_articles": 49, "frontend_question_id": "431", "is_new_question": false @@ -51651,8 +52008,8 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 38381, - "total_submitted": 58257, + "total_acs": 38548, + "total_submitted": 58550, "total_column_articles": 551, "frontend_question_id": "765", "is_new_question": false @@ -51672,8 +52029,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 29399, - "total_submitted": 54187, + "total_acs": 29448, + "total_submitted": 54330, "total_column_articles": 346, "frontend_question_id": "764", "is_new_question": false @@ -51693,9 +52050,9 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 176570, - "total_submitted": 229979, - "total_column_articles": 1644, + "total_acs": 178199, + "total_submitted": 232081, + "total_column_articles": 1648, "frontend_question_id": "763", "is_new_question": false }, @@ -51714,9 +52071,9 @@ "question__title": "Prime Number of Set Bits in Binary Representation", "question__title_slug": "prime-number-of-set-bits-in-binary-representation", "question__hide": false, - "total_acs": 57021, - "total_submitted": 75767, - "total_column_articles": 499, + "total_acs": 57140, + "total_submitted": 75933, + "total_column_articles": 498, "frontend_question_id": "762", "is_new_question": false }, @@ -51735,9 +52092,9 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 63216, - "total_submitted": 106213, - "total_column_articles": 900, + "total_acs": 63316, + "total_submitted": 106382, + "total_column_articles": 902, "frontend_question_id": "430", "is_new_question": false }, @@ -51756,9 +52113,9 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 5403, - "total_submitted": 7832, - "total_column_articles": 84, + "total_acs": 5439, + "total_submitted": 7880, + "total_column_articles": 85, "frontend_question_id": "428", "is_new_question": false }, @@ -51777,9 +52134,9 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 160030, - "total_submitted": 219494, - "total_column_articles": 1192, + "total_acs": 161038, + "total_submitted": 220829, + "total_column_articles": 1195, "frontend_question_id": "429", "is_new_question": false }, @@ -51798,8 +52155,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 17027, - "total_submitted": 22658, + "total_acs": 17062, + "total_submitted": 22714, "total_column_articles": 150, "frontend_question_id": "761", "is_new_question": false @@ -51819,8 +52176,8 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 6852, - "total_submitted": 8095, + "total_acs": 6941, + "total_submitted": 8200, "total_column_articles": 132, "frontend_question_id": "760", "is_new_question": false @@ -51840,8 +52197,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 4437, - "total_submitted": 6299, + "total_acs": 4446, + "total_submitted": 6310, "total_column_articles": 78, "frontend_question_id": "759", "is_new_question": false @@ -51861,8 +52218,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 4427, - "total_submitted": 9153, + "total_acs": 4428, + "total_submitted": 9159, "total_column_articles": 85, "frontend_question_id": "758", "is_new_question": false @@ -51882,8 +52239,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 18504, - "total_submitted": 33028, + "total_acs": 18510, + "total_submitted": 33040, "total_column_articles": 196, "frontend_question_id": "757", "is_new_question": false @@ -51903,8 +52260,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": 13788, - "total_submitted": 20237, + "total_acs": 13850, + "total_submitted": 20332, "total_column_articles": 194, "frontend_question_id": "426", "is_new_question": false @@ -51924,8 +52281,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 6965, - "total_submitted": 13425, + "total_acs": 7000, + "total_submitted": 13514, "total_column_articles": 106, "frontend_question_id": "756", "is_new_question": false @@ -51945,8 +52302,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 2007, - "total_submitted": 4157, + "total_acs": 2009, + "total_submitted": 4162, "total_column_articles": 43, "frontend_question_id": "755", "is_new_question": false @@ -51966,9 +52323,9 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 36999, - "total_submitted": 71905, - "total_column_articles": 405, + "total_acs": 37033, + "total_submitted": 71987, + "total_column_articles": 404, "frontend_question_id": "754", "is_new_question": false }, @@ -51987,8 +52344,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 16787, - "total_submitted": 22441, + "total_acs": 16836, + "total_submitted": 22518, "total_column_articles": 153, "frontend_question_id": "753", "is_new_question": false @@ -52008,9 +52365,9 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 121762, - "total_submitted": 230976, - "total_column_articles": 1235, + "total_acs": 122168, + "total_submitted": 231789, + "total_column_articles": 1237, "frontend_question_id": "752", "is_new_question": false }, @@ -52029,8 +52386,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 1951, - "total_submitted": 4040, + "total_acs": 1956, + "total_submitted": 4045, "total_column_articles": 39, "frontend_question_id": "751", "is_new_question": false @@ -52050,8 +52407,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 3401, - "total_submitted": 4649, + "total_acs": 3407, + "total_submitted": 4655, "total_column_articles": 61, "frontend_question_id": "750", "is_new_question": false @@ -52071,8 +52428,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 13823, - "total_submitted": 20026, + "total_acs": 13834, + "total_submitted": 20047, "total_column_articles": 140, "frontend_question_id": "749", "is_new_question": false @@ -52092,8 +52449,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 47702, - "total_submitted": 71643, + "total_acs": 47799, + "total_submitted": 71778, "total_column_articles": 574, "frontend_question_id": "748", "is_new_question": false @@ -52113,9 +52470,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": 94421, - "total_submitted": 203480, - "total_column_articles": 946, + "total_acs": 94754, + "total_submitted": 204328, + "total_column_articles": 948, "frontend_question_id": "747", "is_new_question": false }, @@ -52134,9 +52491,9 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 333518, - "total_submitted": 513459, - "total_column_articles": 2457, + "total_acs": 336560, + "total_submitted": 517716, + "total_column_articles": 2464, "frontend_question_id": "746", "is_new_question": false }, @@ -52155,8 +52512,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 25105, - "total_submitted": 57274, + "total_acs": 25138, + "total_submitted": 57365, "total_column_articles": 256, "frontend_question_id": "745", "is_new_question": false @@ -52176,9 +52533,9 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 115613, - "total_submitted": 238747, - "total_column_articles": 998, + "total_acs": 115914, + "total_submitted": 239244, + "total_column_articles": 997, "frontend_question_id": "744", "is_new_question": false }, @@ -52197,9 +52554,9 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 110721, - "total_submitted": 198840, - "total_column_articles": 896, + "total_acs": 111401, + "total_submitted": 200003, + "total_column_articles": 901, "frontend_question_id": "743", "is_new_question": false }, @@ -52218,8 +52575,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 2703, - "total_submitted": 5516, + "total_acs": 2708, + "total_submitted": 5522, "total_column_articles": 81, "frontend_question_id": "742", "is_new_question": false @@ -52239,9 +52596,9 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 127615, - "total_submitted": 166306, - "total_column_articles": 933, + "total_acs": 128199, + "total_submitted": 167158, + "total_column_articles": 934, "frontend_question_id": "709", "is_new_question": false }, @@ -52260,8 +52617,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 19891, - "total_submitted": 39368, + "total_acs": 19942, + "total_submitted": 39440, "total_column_articles": 147, "frontend_question_id": "741", "is_new_question": false @@ -52281,9 +52638,9 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 99568, - "total_submitted": 161054, - "total_column_articles": 992, + "total_acs": 100125, + "total_submitted": 162047, + "total_column_articles": 996, "frontend_question_id": "740", "is_new_question": false }, @@ -52302,9 +52659,9 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 450954, - "total_submitted": 655093, - "total_column_articles": 2737, + "total_acs": 454020, + "total_submitted": 659861, + "total_column_articles": 2747, "frontend_question_id": "739", "is_new_question": false }, @@ -52323,9 +52680,9 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 96921, - "total_submitted": 192404, - "total_column_articles": 963, + "total_acs": 97729, + "total_submitted": 193943, + "total_column_articles": 965, "frontend_question_id": "738", "is_new_question": false }, @@ -52344,8 +52701,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 6271, - "total_submitted": 12948, + "total_acs": 6281, + "total_submitted": 12966, "total_column_articles": 110, "frontend_question_id": "737", "is_new_question": false @@ -52365,8 +52722,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 13553, - "total_submitted": 20439, + "total_acs": 13557, + "total_submitted": 20447, "total_column_articles": 157, "frontend_question_id": "736", "is_new_question": false @@ -52386,9 +52743,9 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 78671, - "total_submitted": 184296, - "total_column_articles": 850, + "total_acs": 79445, + "total_submitted": 186175, + "total_column_articles": 856, "frontend_question_id": "735", "is_new_question": false }, @@ -52407,8 +52764,8 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 4395, - "total_submitted": 9445, + "total_acs": 4468, + "total_submitted": 9598, "total_column_articles": 83, "frontend_question_id": "734", "is_new_question": false @@ -52428,9 +52785,9 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 161558, - "total_submitted": 275280, - "total_column_articles": 1301, + "total_acs": 161824, + "total_submitted": 275668, + "total_column_articles": 1300, "frontend_question_id": "733", "is_new_question": false }, @@ -52449,9 +52806,9 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 25000, - "total_submitted": 35071, - "total_column_articles": 243, + "total_acs": 25101, + "total_submitted": 35217, + "total_column_articles": 245, "frontend_question_id": "732", "is_new_question": false }, @@ -52470,8 +52827,8 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 28551, - "total_submitted": 45545, + "total_acs": 28596, + "total_submitted": 45613, "total_column_articles": 239, "frontend_question_id": "731", "is_new_question": false @@ -52491,8 +52848,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 18121, - "total_submitted": 28275, + "total_acs": 18159, + "total_submitted": 28886, "total_column_articles": 129, "frontend_question_id": "730", "is_new_question": false @@ -52512,8 +52869,8 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 52528, - "total_submitted": 90106, + "total_acs": 52634, + "total_submitted": 90283, "total_column_articles": 448, "frontend_question_id": "729", "is_new_question": false @@ -52533,9 +52890,9 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 80219, - "total_submitted": 104157, - "total_column_articles": 760, + "total_acs": 80466, + "total_submitted": 104758, + "total_column_articles": 761, "frontend_question_id": "728", "is_new_question": false }, @@ -52554,8 +52911,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 6004, - "total_submitted": 14085, + "total_acs": 6019, + "total_submitted": 14108, "total_column_articles": 81, "frontend_question_id": "727", "is_new_question": false @@ -52575,8 +52932,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 27382, - "total_submitted": 49593, + "total_acs": 27424, + "total_submitted": 49681, "total_column_articles": 480, "frontend_question_id": "726", "is_new_question": false @@ -52596,9 +52953,9 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 61312, - "total_submitted": 101426, - "total_column_articles": 750, + "total_acs": 61387, + "total_submitted": 101539, + "total_column_articles": 751, "frontend_question_id": "725", "is_new_question": false }, @@ -52617,9 +52974,9 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 299085, - "total_submitted": 577086, - "total_column_articles": 1600, + "total_acs": 301686, + "total_submitted": 581686, + "total_column_articles": 1606, "frontend_question_id": "724", "is_new_question": false }, @@ -52638,9 +52995,9 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 2789, - "total_submitted": 3768, - "total_column_articles": 66, + "total_acs": 2834, + "total_submitted": 3832, + "total_column_articles": 67, "frontend_question_id": "723", "is_new_question": false }, @@ -52659,8 +53016,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 22813, - "total_submitted": 53807, + "total_acs": 23031, + "total_submitted": 54370, "total_column_articles": 236, "frontend_question_id": "722", "is_new_question": false @@ -52680,8 +53037,8 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 39921, - "total_submitted": 82792, + "total_acs": 39991, + "total_submitted": 82944, "total_column_articles": 443, "frontend_question_id": "721", "is_new_question": false @@ -52701,8 +53058,8 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 66899, - "total_submitted": 128921, + "total_acs": 67000, + "total_submitted": 129152, "total_column_articles": 715, "frontend_question_id": "720", "is_new_question": false @@ -52722,9 +53079,9 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 34408, - "total_submitted": 73719, - "total_column_articles": 276, + "total_acs": 34472, + "total_submitted": 73845, + "total_column_articles": 278, "frontend_question_id": "719", "is_new_question": false }, @@ -52743,9 +53100,9 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 201257, - "total_submitted": 353828, - "total_column_articles": 1072, + "total_acs": 202837, + "total_submitted": 356765, + "total_column_articles": 1074, "frontend_question_id": "718", "is_new_question": false }, @@ -52764,9 +53121,9 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 69464, - "total_submitted": 125731, - "total_column_articles": 833, + "total_acs": 69575, + "total_submitted": 125910, + "total_column_articles": 836, "frontend_question_id": "717", "is_new_question": false }, @@ -52785,9 +53142,9 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 7197, - "total_submitted": 16309, - "total_column_articles": 109, + "total_acs": 7233, + "total_submitted": 16391, + "total_column_articles": 110, "frontend_question_id": "716", "is_new_question": false }, @@ -52806,8 +53163,8 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 19735, - "total_submitted": 37355, + "total_acs": 19768, + "total_submitted": 37436, "total_column_articles": 208, "frontend_question_id": "715", "is_new_question": false @@ -52827,9 +53184,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": 224240, - "total_submitted": 297569, - "total_column_articles": 1293, + "total_acs": 225654, + "total_submitted": 299331, + "total_column_articles": 1301, "frontend_question_id": "714", "is_new_question": false }, @@ -52848,8 +53205,8 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 104140, - "total_submitted": 209516, + "total_acs": 104548, + "total_submitted": 210210, "total_column_articles": 906, "frontend_question_id": "713", "is_new_question": false @@ -52869,9 +53226,9 @@ "question__title": "Minimum ASCII Delete Sum for Two Strings", "question__title_slug": "minimum-ascii-delete-sum-for-two-strings", "question__hide": false, - "total_acs": 33763, - "total_submitted": 48910, - "total_column_articles": 344, + "total_acs": 34172, + "total_submitted": 49442, + "total_column_articles": 348, "frontend_question_id": "712", "is_new_question": false }, @@ -52890,8 +53247,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 1491, - "total_submitted": 2649, + "total_acs": 1493, + "total_submitted": 2651, "total_column_articles": 48, "frontend_question_id": "711", "is_new_question": false @@ -52911,8 +53268,8 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 22946, - "total_submitted": 41931, + "total_acs": 22986, + "total_submitted": 42040, "total_column_articles": 241, "frontend_question_id": "699", "is_new_question": false @@ -52932,9 +53289,9 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 105169, - "total_submitted": 250092, - "total_column_articles": 1423, + "total_acs": 105611, + "total_submitted": 251227, + "total_column_articles": 1431, "frontend_question_id": "698", "is_new_question": false }, @@ -52953,9 +53310,9 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 92925, - "total_submitted": 156713, - "total_column_articles": 1146, + "total_acs": 93161, + "total_submitted": 157109, + "total_column_articles": 1151, "frontend_question_id": "697", "is_new_question": false }, @@ -52974,8 +53331,8 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 72079, - "total_submitted": 113174, + "total_acs": 72238, + "total_submitted": 113468, "total_column_articles": 632, "frontend_question_id": "696", "is_new_question": false @@ -52995,9 +53352,9 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 290703, - "total_submitted": 427139, - "total_column_articles": 2558, + "total_acs": 291884, + "total_submitted": 428864, + "total_column_articles": 2561, "frontend_question_id": "695", "is_new_question": false }, @@ -53016,8 +53373,8 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 11005, - "total_submitted": 19042, + "total_acs": 11099, + "total_submitted": 19194, "total_column_articles": 178, "frontend_question_id": "694", "is_new_question": false @@ -53037,9 +53394,9 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 78647, - "total_submitted": 120729, - "total_column_articles": 845, + "total_acs": 78800, + "total_submitted": 120949, + "total_column_articles": 843, "frontend_question_id": "693", "is_new_question": false }, @@ -53058,9 +53415,9 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 107630, - "total_submitted": 191534, - "total_column_articles": 1072, + "total_acs": 108100, + "total_submitted": 192406, + "total_column_articles": 1075, "frontend_question_id": "692", "is_new_question": false }, @@ -53079,8 +53436,8 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 24545, - "total_submitted": 41833, + "total_acs": 24577, + "total_submitted": 41937, "total_column_articles": 209, "frontend_question_id": "691", "is_new_question": false @@ -53100,9 +53457,9 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 66258, - "total_submitted": 100771, - "total_column_articles": 671, + "total_acs": 66347, + "total_submitted": 100880, + "total_column_articles": 672, "frontend_question_id": "690", "is_new_question": false }, @@ -53121,9 +53478,9 @@ "question__title": "Maximum Sum of 3 Non-Overlapping Subarrays", "question__title_slug": "maximum-sum-of-3-non-overlapping-subarrays", "question__hide": false, - "total_acs": 22838, - "total_submitted": 40670, - "total_column_articles": 295, + "total_acs": 22860, + "total_submitted": 40713, + "total_column_articles": 294, "frontend_question_id": "689", "is_new_question": false }, @@ -53142,8 +53499,8 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 36316, - "total_submitted": 62409, + "total_acs": 36352, + "total_submitted": 62465, "total_column_articles": 396, "frontend_question_id": "688", "is_new_question": false @@ -53163,9 +53520,9 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 82923, - "total_submitted": 173906, - "total_column_articles": 674, + "total_acs": 83091, + "total_submitted": 174222, + "total_column_articles": 676, "frontend_question_id": "687", "is_new_question": false }, @@ -53184,9 +53541,9 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 51236, - "total_submitted": 128790, - "total_column_articles": 647, + "total_acs": 51295, + "total_submitted": 128965, + "total_column_articles": 648, "frontend_question_id": "686", "is_new_question": false }, @@ -53205,9 +53562,9 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 29936, - "total_submitted": 70941, - "total_column_articles": 360, + "total_acs": 30053, + "total_submitted": 71186, + "total_column_articles": 361, "frontend_question_id": "685", "is_new_question": false }, @@ -53226,9 +53583,9 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 100296, - "total_submitted": 148978, - "total_column_articles": 945, + "total_acs": 100725, + "total_submitted": 149606, + "total_column_articles": 946, "frontend_question_id": "684", "is_new_question": false }, @@ -53247,8 +53604,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 4187, - "total_submitted": 9065, + "total_acs": 4197, + "total_submitted": 9077, "total_column_articles": 78, "frontend_question_id": "683", "is_new_question": false @@ -53268,8 +53625,8 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 95676, - "total_submitted": 134283, + "total_acs": 96074, + "total_submitted": 134927, "total_column_articles": 1003, "frontend_question_id": "682", "is_new_question": false @@ -53289,8 +53646,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 4438, - "total_submitted": 8890, + "total_acs": 4440, + "total_submitted": 8892, "total_column_articles": 92, "frontend_question_id": "681", "is_new_question": false @@ -53310,9 +53667,9 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 137338, - "total_submitted": 343369, - "total_column_articles": 1200, + "total_acs": 137779, + "total_submitted": 344480, + "total_column_articles": 1205, "frontend_question_id": "680", "is_new_question": false }, @@ -53331,8 +53688,8 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 40574, - "total_submitted": 75403, + "total_acs": 40657, + "total_submitted": 75546, "total_column_articles": 365, "frontend_question_id": "679", "is_new_question": false @@ -53352,9 +53709,9 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 68971, - "total_submitted": 175717, - "total_column_articles": 679, + "total_acs": 69107, + "total_submitted": 176066, + "total_column_articles": 680, "frontend_question_id": "678", "is_new_question": false }, @@ -53373,9 +53730,9 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 49065, - "total_submitted": 74760, - "total_column_articles": 707, + "total_acs": 49140, + "total_submitted": 74889, + "total_column_articles": 708, "frontend_question_id": "677", "is_new_question": false }, @@ -53394,9 +53751,9 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 39770, - "total_submitted": 60954, - "total_column_articles": 472, + "total_acs": 39848, + "total_submitted": 61076, + "total_column_articles": 473, "frontend_question_id": "676", "is_new_question": false }, @@ -53415,8 +53772,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 21784, - "total_submitted": 41542, + "total_acs": 21810, + "total_submitted": 41606, "total_column_articles": 221, "frontend_question_id": "675", "is_new_question": false @@ -53436,9 +53793,9 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 203166, - "total_submitted": 363801, - "total_column_articles": 1320, + "total_acs": 204822, + "total_submitted": 366408, + "total_column_articles": 1326, "frontend_question_id": "674", "is_new_question": false }, @@ -53457,9 +53814,9 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 89438, - "total_submitted": 200028, - "total_column_articles": 661, + "total_acs": 90024, + "total_submitted": 201328, + "total_column_articles": 663, "frontend_question_id": "673", "is_new_question": false }, @@ -53478,9 +53835,9 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 26648, - "total_submitted": 43860, - "total_column_articles": 264, + "total_acs": 26678, + "total_submitted": 43924, + "total_column_articles": 265, "frontend_question_id": "672", "is_new_question": false }, @@ -53499,8 +53856,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": 70613, - "total_submitted": 147220, + "total_acs": 70755, + "total_submitted": 147518, "total_column_articles": 870, "frontend_question_id": "671", "is_new_question": false @@ -53520,8 +53877,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 67997, - "total_submitted": 141940, + "total_acs": 68131, + "total_submitted": 142191, "total_column_articles": 940, "frontend_question_id": "670", "is_new_question": false @@ -53541,9 +53898,9 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 133271, - "total_submitted": 197868, - "total_column_articles": 952, + "total_acs": 134214, + "total_submitted": 199308, + "total_column_articles": 953, "frontend_question_id": "669", "is_new_question": false }, @@ -53562,8 +53919,8 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 30547, - "total_submitted": 52220, + "total_acs": 30587, + "total_submitted": 52307, "total_column_articles": 279, "frontend_question_id": "668", "is_new_question": false @@ -53583,8 +53940,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 35872, - "total_submitted": 53766, + "total_acs": 35916, + "total_submitted": 53832, "total_column_articles": 519, "frontend_question_id": "667", "is_new_question": false @@ -53604,8 +53961,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 3577, - "total_submitted": 5714, + "total_acs": 3599, + "total_submitted": 5748, "total_column_articles": 110, "frontend_question_id": "666", "is_new_question": false @@ -53625,9 +53982,9 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 101612, - "total_submitted": 366810, - "total_column_articles": 1211, + "total_acs": 101807, + "total_submitted": 367520, + "total_column_articles": 1214, "frontend_question_id": "665", "is_new_question": false }, @@ -53646,8 +54003,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 27488, - "total_submitted": 42106, + "total_acs": 27571, + "total_submitted": 42249, "total_column_articles": 239, "frontend_question_id": "664", "is_new_question": false @@ -53667,8 +54024,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 2901, - "total_submitted": 6311, + "total_acs": 2913, + "total_submitted": 6341, "total_column_articles": 58, "frontend_question_id": "663", "is_new_question": false @@ -53688,9 +54045,9 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 94418, - "total_submitted": 216612, - "total_column_articles": 845, + "total_acs": 94933, + "total_submitted": 217792, + "total_column_articles": 848, "frontend_question_id": "662", "is_new_question": false }, @@ -53709,9 +54066,9 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 54690, - "total_submitted": 85174, - "total_column_articles": 577, + "total_acs": 54835, + "total_submitted": 85425, + "total_column_articles": 576, "frontend_question_id": "661", "is_new_question": false }, @@ -53730,8 +54087,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 1410, - "total_submitted": 2167, + "total_acs": 1418, + "total_submitted": 2182, "total_column_articles": 40, "frontend_question_id": "660", "is_new_question": false @@ -53751,9 +54108,9 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 37145, - "total_submitted": 67805, - "total_column_articles": 400, + "total_acs": 37220, + "total_submitted": 67922, + "total_column_articles": 401, "frontend_question_id": "659", "is_new_question": false }, @@ -53772,8 +54129,8 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 91323, - "total_submitted": 190614, + "total_acs": 91568, + "total_submitted": 191129, "total_column_articles": 831, "frontend_question_id": "658", "is_new_question": false @@ -53793,9 +54150,9 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 107470, - "total_submitted": 135995, - "total_column_articles": 842, + "total_acs": 107940, + "total_submitted": 136565, + "total_column_articles": 844, "frontend_question_id": "657", "is_new_question": false }, @@ -53814,8 +54171,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 1496, - "total_submitted": 4398, + "total_acs": 1497, + "total_submitted": 4401, "total_column_articles": 34, "frontend_question_id": "656", "is_new_question": false @@ -53835,9 +54192,9 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 36149, - "total_submitted": 51900, - "total_column_articles": 512, + "total_acs": 36200, + "total_submitted": 51966, + "total_column_articles": 513, "frontend_question_id": "655", "is_new_question": false }, @@ -53856,9 +54213,9 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 209355, - "total_submitted": 254114, - "total_column_articles": 1627, + "total_acs": 210929, + "total_submitted": 256067, + "total_column_articles": 1634, "frontend_question_id": "654", "is_new_question": false }, @@ -53877,9 +54234,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": 114713, - "total_submitted": 180647, - "total_column_articles": 992, + "total_acs": 114895, + "total_submitted": 180900, + "total_column_articles": 991, "frontend_question_id": "653", "is_new_question": false }, @@ -53898,8 +54255,8 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 97555, - "total_submitted": 159050, + "total_acs": 97837, + "total_submitted": 159503, "total_column_articles": 647, "frontend_question_id": "652", "is_new_question": false @@ -53919,8 +54276,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 7011, - "total_submitted": 11685, + "total_acs": 7081, + "total_submitted": 11773, "total_column_articles": 103, "frontend_question_id": "651", "is_new_question": false @@ -53940,8 +54297,8 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 66725, - "total_submitted": 115599, + "total_acs": 66851, + "total_submitted": 115808, "total_column_articles": 790, "frontend_question_id": "650", "is_new_question": false @@ -53961,9 +54318,9 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 43897, - "total_submitted": 91062, - "total_column_articles": 434, + "total_acs": 44420, + "total_submitted": 92052, + "total_column_articles": 438, "frontend_question_id": "649", "is_new_question": false }, @@ -53982,9 +54339,9 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 73949, - "total_submitted": 116228, - "total_column_articles": 851, + "total_acs": 74188, + "total_submitted": 116621, + "total_column_articles": 852, "frontend_question_id": "648", "is_new_question": false }, @@ -54003,9 +54360,9 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 290576, - "total_submitted": 434354, - "total_column_articles": 1737, + "total_acs": 292618, + "total_submitted": 437187, + "total_column_articles": 1746, "frontend_question_id": "647", "is_new_question": false }, @@ -54024,9 +54381,9 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 68512, - "total_submitted": 109895, - "total_column_articles": 654, + "total_acs": 68772, + "total_submitted": 110270, + "total_column_articles": 655, "frontend_question_id": "646", "is_new_question": false }, @@ -54045,9 +54402,9 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 108470, - "total_submitted": 273853, - "total_column_articles": 1063, + "total_acs": 108970, + "total_submitted": 275793, + "total_column_articles": 1065, "frontend_question_id": "645", "is_new_question": false }, @@ -54066,8 +54423,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 2431, - "total_submitted": 5470, + "total_acs": 2465, + "total_submitted": 5534, "total_column_articles": 41, "frontend_question_id": "644", "is_new_question": false @@ -54087,9 +54444,9 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 112934, - "total_submitted": 261398, - "total_column_articles": 940, + "total_acs": 114400, + "total_submitted": 264676, + "total_column_articles": 947, "frontend_question_id": "643", "is_new_question": false }, @@ -54108,9 +54465,9 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 5462, - "total_submitted": 9710, - "total_column_articles": 94, + "total_acs": 5544, + "total_submitted": 9836, + "total_column_articles": 95, "frontend_question_id": "642", "is_new_question": false }, @@ -54129,8 +54486,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 37376, - "total_submitted": 83867, + "total_acs": 37424, + "total_submitted": 83974, "total_column_articles": 715, "frontend_question_id": "640", "is_new_question": false @@ -54150,8 +54507,8 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 23799, - "total_submitted": 63831, + "total_acs": 23839, + "total_submitted": 63947, "total_column_articles": 327, "frontend_question_id": "639", "is_new_question": false @@ -54171,8 +54528,8 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 35822, - "total_submitted": 57108, + "total_acs": 35925, + "total_submitted": 57276, "total_column_articles": 341, "frontend_question_id": "638", "is_new_question": false @@ -54192,9 +54549,9 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 147627, - "total_submitted": 211421, - "total_column_articles": 1073, + "total_acs": 148865, + "total_submitted": 213163, + "total_column_articles": 1077, "frontend_question_id": "637", "is_new_question": false }, @@ -54213,8 +54570,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 35606, - "total_submitted": 53883, + "total_acs": 35670, + "total_submitted": 53977, "total_column_articles": 349, "frontend_question_id": "636", "is_new_question": false @@ -54234,8 +54591,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 6253, - "total_submitted": 11119, + "total_acs": 6261, + "total_submitted": 11140, "total_column_articles": 109, "frontend_question_id": "635", "is_new_question": false @@ -54255,8 +54612,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 2374, - "total_submitted": 5007, + "total_acs": 2385, + "total_submitted": 5030, "total_column_articles": 35, "frontend_question_id": "634", "is_new_question": false @@ -54276,8 +54633,8 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 133165, - "total_submitted": 348246, + "total_acs": 133405, + "total_submitted": 349029, "total_column_articles": 1038, "frontend_question_id": "633", "is_new_question": false @@ -54297,8 +54654,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": 25919, - "total_submitted": 42642, + "total_acs": 25954, + "total_submitted": 42687, "total_column_articles": 313, "frontend_question_id": "632", "is_new_question": false @@ -54318,8 +54675,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 1730, - "total_submitted": 5191, + "total_acs": 1731, + "total_submitted": 5193, "total_column_articles": 48, "frontend_question_id": "631", "is_new_question": false @@ -54339,8 +54696,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 29848, - "total_submitted": 64695, + "total_acs": 29904, + "total_submitted": 64827, "total_column_articles": 270, "frontend_question_id": "630", "is_new_question": false @@ -54360,9 +54717,9 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 22711, - "total_submitted": 44512, - "total_column_articles": 214, + "total_acs": 22829, + "total_submitted": 44721, + "total_column_articles": 215, "frontend_question_id": "629", "is_new_question": false }, @@ -54381,8 +54738,8 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 121084, - "total_submitted": 232974, + "total_acs": 121486, + "total_submitted": 233827, "total_column_articles": 1102, "frontend_question_id": "628", "is_new_question": false @@ -54402,8 +54759,8 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 180188, - "total_submitted": 219370, + "total_acs": 180633, + "total_submitted": 219917, "total_column_articles": 657, "frontend_question_id": "627", "is_new_question": false @@ -54423,9 +54780,9 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 76434, - "total_submitted": 112374, - "total_column_articles": 625, + "total_acs": 77017, + "total_submitted": 113180, + "total_column_articles": 629, "frontend_question_id": "626", "is_new_question": false }, @@ -54444,9 +54801,9 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 3443, - "total_submitted": 9955, - "total_column_articles": 70, + "total_acs": 3445, + "total_submitted": 9957, + "total_column_articles": 69, "frontend_question_id": "625", "is_new_question": false }, @@ -54465,8 +54822,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 6656, - "total_submitted": 16678, + "total_acs": 6770, + "total_submitted": 16963, "total_column_articles": 110, "frontend_question_id": "624", "is_new_question": false @@ -54486,9 +54843,9 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 45768, - "total_submitted": 76186, - "total_column_articles": 658, + "total_acs": 45863, + "total_submitted": 76353, + "total_column_articles": 659, "frontend_question_id": "623", "is_new_question": false }, @@ -54507,9 +54864,9 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 142276, - "total_submitted": 237948, - "total_column_articles": 850, + "total_acs": 142701, + "total_submitted": 238696, + "total_column_articles": 851, "frontend_question_id": "621", "is_new_question": false }, @@ -54528,9 +54885,9 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 137621, - "total_submitted": 178412, - "total_column_articles": 473, + "total_acs": 138675, + "total_submitted": 179789, + "total_column_articles": 475, "frontend_question_id": "620", "is_new_question": false }, @@ -54549,9 +54906,9 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 35040, - "total_submitted": 71436, - "total_column_articles": 204, + "total_acs": 35912, + "total_submitted": 72844, + "total_column_articles": 207, "frontend_question_id": "619", "is_new_question": false }, @@ -54570,9 +54927,9 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 9901, - "total_submitted": 15915, - "total_column_articles": 86, + "total_acs": 9929, + "total_submitted": 15956, + "total_column_articles": 87, "frontend_question_id": "618", "is_new_question": false }, @@ -54591,9 +54948,9 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 417982, - "total_submitted": 528100, - "total_column_articles": 2379, + "total_acs": 441684, + "total_submitted": 556237, + "total_column_articles": 2478, "frontend_question_id": "617", "is_new_question": false }, @@ -54612,9 +54969,9 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 6108, - "total_submitted": 12352, - "total_column_articles": 102, + "total_acs": 6166, + "total_submitted": 12435, + "total_column_articles": 103, "frontend_question_id": "616", "is_new_question": false }, @@ -54633,9 +54990,9 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 10606, - "total_submitted": 25044, - "total_column_articles": 148, + "total_acs": 10637, + "total_submitted": 25128, + "total_column_articles": 150, "frontend_question_id": "615", "is_new_question": false }, @@ -54654,9 +55011,9 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 15674, - "total_submitted": 41956, - "total_column_articles": 107, + "total_acs": 15713, + "total_submitted": 42028, + "total_column_articles": 110, "frontend_question_id": "614", "is_new_question": false }, @@ -54675,9 +55032,9 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 20280, - "total_submitted": 25483, - "total_column_articles": 121, + "total_acs": 20378, + "total_submitted": 25606, + "total_column_articles": 123, "frontend_question_id": "613", "is_new_question": false }, @@ -54696,9 +55053,9 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 13962, - "total_submitted": 21527, - "total_column_articles": 102, + "total_acs": 13992, + "total_submitted": 21579, + "total_column_articles": 105, "frontend_question_id": "612", "is_new_question": false }, @@ -54717,9 +55074,9 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 91206, - "total_submitted": 169851, - "total_column_articles": 651, + "total_acs": 91674, + "total_submitted": 170713, + "total_column_articles": 655, "frontend_question_id": "611", "is_new_question": false }, @@ -54738,9 +55095,9 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 26826, - "total_submitted": 41193, - "total_column_articles": 142, + "total_acs": 27573, + "total_submitted": 42201, + "total_column_articles": 145, "frontend_question_id": "610", "is_new_question": false }, @@ -54759,9 +55116,9 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 10681, - "total_submitted": 20282, - "total_column_articles": 163, + "total_acs": 10732, + "total_submitted": 20363, + "total_column_articles": 165, "frontend_question_id": "609", "is_new_question": false }, @@ -54780,9 +55137,9 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 58372, - "total_submitted": 95509, - "total_column_articles": 411, + "total_acs": 58724, + "total_submitted": 96051, + "total_column_articles": 414, "frontend_question_id": "608", "is_new_question": false }, @@ -54801,9 +55158,9 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 72291, - "total_submitted": 106343, - "total_column_articles": 415, + "total_acs": 73186, + "total_submitted": 107863, + "total_column_articles": 416, "frontend_question_id": "607", "is_new_question": false }, @@ -54822,9 +55179,9 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 74603, - "total_submitted": 120024, - "total_column_articles": 735, + "total_acs": 74817, + "total_submitted": 120402, + "total_column_articles": 737, "frontend_question_id": "606", "is_new_question": false }, @@ -54843,9 +55200,9 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 179844, - "total_submitted": 559901, - "total_column_articles": 1939, + "total_acs": 181738, + "total_submitted": 566211, + "total_column_articles": 1952, "frontend_question_id": "605", "is_new_question": false }, @@ -54864,9 +55221,9 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 4108, - "total_submitted": 10486, - "total_column_articles": 95, + "total_acs": 4146, + "total_submitted": 10578, + "total_column_articles": 96, "frontend_question_id": "604", "is_new_question": false }, @@ -54885,9 +55242,9 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 27211, - "total_submitted": 42542, - "total_column_articles": 241, + "total_acs": 27305, + "total_submitted": 42685, + "total_column_articles": 242, "frontend_question_id": "603", "is_new_question": false }, @@ -54906,9 +55263,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": 21235, - "total_submitted": 34870, - "total_column_articles": 186, + "total_acs": 21801, + "total_submitted": 35968, + "total_column_articles": 194, "frontend_question_id": "602", "is_new_question": false }, @@ -54927,9 +55284,9 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 50978, - "total_submitted": 106195, - "total_column_articles": 587, + "total_acs": 51248, + "total_submitted": 106879, + "total_column_articles": 595, "frontend_question_id": "601", "is_new_question": false }, @@ -54948,8 +55305,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 25512, - "total_submitted": 51398, + "total_acs": 25572, + "total_submitted": 51503, "total_column_articles": 323, "frontend_question_id": "600", "is_new_question": false @@ -54969,9 +55326,9 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 89323, - "total_submitted": 157515, - "total_column_articles": 743, + "total_acs": 89546, + "total_submitted": 157843, + "total_column_articles": 742, "frontend_question_id": "599", "is_new_question": false }, @@ -54990,9 +55347,9 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 54990, - "total_submitted": 95083, - "total_column_articles": 630, + "total_acs": 55145, + "total_submitted": 95297, + "total_column_articles": 632, "frontend_question_id": "598", "is_new_question": false }, @@ -55011,9 +55368,9 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 19191, - "total_submitted": 44375, - "total_column_articles": 125, + "total_acs": 19234, + "total_submitted": 44454, + "total_column_articles": 127, "frontend_question_id": "597", "is_new_question": false }, @@ -55032,9 +55389,9 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 156884, - "total_submitted": 306449, - "total_column_articles": 495, + "total_acs": 158042, + "total_submitted": 308101, + "total_column_articles": 500, "frontend_question_id": "596", "is_new_question": false }, @@ -55053,9 +55410,9 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 291654, - "total_submitted": 437212, - "total_column_articles": 635, + "total_acs": 294506, + "total_submitted": 441863, + "total_column_articles": 639, "frontend_question_id": "595", "is_new_question": false }, @@ -55074,9 +55431,9 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 84451, - "total_submitted": 150388, - "total_column_articles": 710, + "total_acs": 84720, + "total_submitted": 150814, + "total_column_articles": 712, "frontend_question_id": "594", "is_new_question": false }, @@ -55095,8 +55452,8 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 36141, - "total_submitted": 76727, + "total_acs": 36228, + "total_submitted": 76905, "total_column_articles": 591, "frontend_question_id": "593", "is_new_question": false @@ -55116,8 +55473,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 26904, - "total_submitted": 45045, + "total_acs": 26964, + "total_submitted": 45143, "total_column_articles": 478, "frontend_question_id": "592", "is_new_question": false @@ -55137,8 +55494,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 17946, - "total_submitted": 34473, + "total_acs": 17964, + "total_submitted": 34522, "total_column_articles": 196, "frontend_question_id": "591", "is_new_question": false @@ -55158,9 +55515,9 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 3320, - "total_submitted": 7624, - "total_column_articles": 56, + "total_acs": 3365, + "total_submitted": 7697, + "total_column_articles": 55, "frontend_question_id": "588", "is_new_question": false }, @@ -55179,8 +55536,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 17789, - "total_submitted": 29247, + "total_acs": 17796, + "total_submitted": 29257, "total_column_articles": 139, "frontend_question_id": "587", "is_new_question": false @@ -55200,9 +55557,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": 81158, - "total_submitted": 117338, - "total_column_articles": 378, + "total_acs": 82102, + "total_submitted": 119064, + "total_column_articles": 381, "frontend_question_id": "586", "is_new_question": false }, @@ -55221,9 +55578,9 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 21696, - "total_submitted": 45972, - "total_column_articles": 214, + "total_acs": 22267, + "total_submitted": 47306, + "total_column_articles": 223, "frontend_question_id": "585", "is_new_question": false }, @@ -55242,9 +55599,9 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 162496, - "total_submitted": 248089, - "total_column_articles": 464, + "total_acs": 164411, + "total_submitted": 250883, + "total_column_articles": 465, "frontend_question_id": "584", "is_new_question": false }, @@ -55263,9 +55620,9 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 131146, - "total_submitted": 196590, - "total_column_articles": 931, + "total_acs": 132367, + "total_submitted": 198303, + "total_column_articles": 936, "frontend_question_id": "583", "is_new_question": false }, @@ -55284,8 +55641,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 12843, - "total_submitted": 27773, + "total_acs": 12917, + "total_submitted": 27888, "total_column_articles": 190, "frontend_question_id": "582", "is_new_question": false @@ -55305,9 +55662,9 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 183745, - "total_submitted": 439233, - "total_column_articles": 1361, + "total_acs": 184538, + "total_submitted": 440772, + "total_column_articles": 1366, "frontend_question_id": "581", "is_new_question": false }, @@ -55326,9 +55683,9 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 23355, - "total_submitted": 43548, - "total_column_articles": 155, + "total_acs": 23394, + "total_submitted": 43610, + "total_column_articles": 157, "frontend_question_id": "580", "is_new_question": false }, @@ -55347,9 +55704,9 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 14505, - "total_submitted": 32849, - "total_column_articles": 187, + "total_acs": 14541, + "total_submitted": 32885, + "total_column_articles": 189, "frontend_question_id": "579", "is_new_question": false }, @@ -55368,9 +55725,9 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 19659, - "total_submitted": 46521, - "total_column_articles": 190, + "total_acs": 19713, + "total_submitted": 46657, + "total_column_articles": 193, "frontend_question_id": "578", "is_new_question": false }, @@ -55389,9 +55746,9 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 44023, - "total_submitted": 63627, - "total_column_articles": 186, + "total_acs": 45366, + "total_submitted": 65569, + "total_column_articles": 191, "frontend_question_id": "577", "is_new_question": false }, @@ -55410,8 +55767,8 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 36566, - "total_submitted": 77818, + "total_acs": 36675, + "total_submitted": 78008, "total_column_articles": 387, "frontend_question_id": "576", "is_new_question": false @@ -55431,9 +55788,9 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 114850, - "total_submitted": 163017, - "total_column_articles": 1075, + "total_acs": 115182, + "total_submitted": 163427, + "total_column_articles": 1077, "frontend_question_id": "575", "is_new_question": false }, @@ -55452,9 +55809,9 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 23931, - "total_submitted": 36091, - "total_column_articles": 162, + "total_acs": 23990, + "total_submitted": 36196, + "total_column_articles": 165, "frontend_question_id": "574", "is_new_question": false }, @@ -55494,9 +55851,9 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 180379, - "total_submitted": 379851, - "total_column_articles": 1341, + "total_acs": 181167, + "total_submitted": 381443, + "total_column_articles": 1346, "frontend_question_id": "572", "is_new_question": false }, @@ -55515,9 +55872,9 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 13897, - "total_submitted": 29596, - "total_column_articles": 147, + "total_acs": 13930, + "total_submitted": 29672, + "total_column_articles": 149, "frontend_question_id": "571", "is_new_question": false }, @@ -55536,9 +55893,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": 42081, - "total_submitted": 66404, - "total_column_articles": 257, + "total_acs": 43562, + "total_submitted": 69204, + "total_column_articles": 265, "frontend_question_id": "570", "is_new_question": false }, @@ -55557,9 +55914,9 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 20498, - "total_submitted": 35757, - "total_column_articles": 267, + "total_acs": 20553, + "total_submitted": 35829, + "total_column_articles": 268, "frontend_question_id": "569", "is_new_question": false }, @@ -55578,8 +55935,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 2125, - "total_submitted": 3945, + "total_acs": 2139, + "total_submitted": 3961, "total_column_articles": 42, "frontend_question_id": "568", "is_new_question": false @@ -55599,9 +55956,9 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 268549, - "total_submitted": 602822, - "total_column_articles": 2353, + "total_acs": 269366, + "total_submitted": 604482, + "total_column_articles": 2354, "frontend_question_id": "567", "is_new_question": false }, @@ -55620,9 +55977,9 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 148986, - "total_submitted": 230027, - "total_column_articles": 1343, + "total_acs": 149219, + "total_submitted": 230436, + "total_column_articles": 1346, "frontend_question_id": "566", "is_new_question": false }, @@ -55641,8 +55998,8 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 48560, - "total_submitted": 77855, + "total_acs": 48640, + "total_submitted": 77977, "total_column_articles": 459, "frontend_question_id": "565", "is_new_question": false @@ -55662,8 +56019,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 24858, - "total_submitted": 81830, + "total_acs": 24876, + "total_submitted": 81900, "total_column_articles": 262, "frontend_question_id": "564", "is_new_question": false @@ -55683,9 +56040,9 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 76698, - "total_submitted": 116255, - "total_column_articles": 765, + "total_acs": 77026, + "total_submitted": 116657, + "total_column_articles": 766, "frontend_question_id": "563", "is_new_question": false }, @@ -55704,8 +56061,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": 6057, - "total_submitted": 12177, + "total_acs": 6061, + "total_submitted": 12187, "total_column_articles": 102, "frontend_question_id": "562", "is_new_question": false @@ -55725,9 +56082,9 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 139042, - "total_submitted": 177064, - "total_column_articles": 1139, + "total_acs": 139587, + "total_submitted": 177745, + "total_column_articles": 1140, "frontend_question_id": "561", "is_new_question": false }, @@ -55746,9 +56103,9 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 338710, - "total_submitted": 754363, - "total_column_articles": 1898, + "total_acs": 341743, + "total_submitted": 761843, + "total_column_articles": 1906, "frontend_question_id": "560", "is_new_question": false }, @@ -55767,8 +56124,8 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 310086, - "total_submitted": 420678, + "total_acs": 310641, + "total_submitted": 421496, "total_column_articles": 2581, "frontend_question_id": "557", "is_new_question": false @@ -55788,8 +56145,8 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 46776, - "total_submitted": 127025, + "total_acs": 46914, + "total_submitted": 127430, "total_column_articles": 574, "frontend_question_id": "556", "is_new_question": false @@ -55809,8 +56166,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 1745, - "total_submitted": 4643, + "total_acs": 1747, + "total_submitted": 4648, "total_column_articles": 33, "frontend_question_id": "555", "is_new_question": false @@ -55830,8 +56187,8 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 63917, - "total_submitted": 124013, + "total_acs": 64050, + "total_submitted": 124198, "total_column_articles": 601, "frontend_question_id": "554", "is_new_question": false @@ -55851,8 +56208,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 32176, - "total_submitted": 49684, + "total_acs": 32252, + "total_submitted": 49782, "total_column_articles": 382, "frontend_question_id": "553", "is_new_question": false @@ -55872,8 +56229,8 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 28819, - "total_submitted": 49901, + "total_acs": 28861, + "total_submitted": 49963, "total_column_articles": 346, "frontend_question_id": "552", "is_new_question": false @@ -55893,9 +56250,9 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 80669, - "total_submitted": 142032, - "total_column_articles": 998, + "total_acs": 80866, + "total_submitted": 142328, + "total_column_articles": 1001, "frontend_question_id": "551", "is_new_question": false }, @@ -55914,8 +56271,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 1776, - "total_submitted": 3372, + "total_acs": 1780, + "total_submitted": 3380, "total_column_articles": 41, "frontend_question_id": "1730", "is_new_question": false @@ -55935,8 +56292,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 4787, - "total_submitted": 9560, + "total_acs": 4862, + "total_submitted": 9700, "total_column_articles": 91, "frontend_question_id": "549", "is_new_question": false @@ -55956,8 +56313,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 2453, - "total_submitted": 6289, + "total_acs": 2454, + "total_submitted": 6293, "total_column_articles": 55, "frontend_question_id": "548", "is_new_question": false @@ -55977,8 +56334,8 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 279331, - "total_submitted": 448989, + "total_acs": 280646, + "total_submitted": 451279, "total_column_articles": 1886, "frontend_question_id": "547", "is_new_question": false @@ -55998,9 +56355,9 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 18493, - "total_submitted": 30449, - "total_column_articles": 149, + "total_acs": 18526, + "total_submitted": 30511, + "total_column_articles": 150, "frontend_question_id": "546", "is_new_question": false }, @@ -56019,9 +56376,9 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 5863, - "total_submitted": 12977, - "total_column_articles": 110, + "total_acs": 5906, + "total_submitted": 13054, + "total_column_articles": 111, "frontend_question_id": "545", "is_new_question": false }, @@ -56040,8 +56397,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 3439, - "total_submitted": 4758, + "total_acs": 3447, + "total_submitted": 4768, "total_column_articles": 72, "frontend_question_id": "544", "is_new_question": false @@ -56061,9 +56418,9 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 335554, - "total_submitted": 571060, - "total_column_articles": 2293, + "total_acs": 338123, + "total_submitted": 574865, + "total_column_articles": 2309, "frontend_question_id": "543", "is_new_question": false }, @@ -56082,9 +56439,9 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 135672, - "total_submitted": 291301, - "total_column_articles": 1116, + "total_acs": 136026, + "total_submitted": 291950, + "total_column_articles": 1117, "frontend_question_id": "542", "is_new_question": false }, @@ -56103,9 +56460,9 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 217450, - "total_submitted": 375726, - "total_column_articles": 1595, + "total_acs": 219583, + "total_submitted": 379509, + "total_column_articles": 1603, "frontend_question_id": "541", "is_new_question": false }, @@ -56124,9 +56481,9 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 118627, - "total_submitted": 196161, - "total_column_articles": 1085, + "total_acs": 118993, + "total_submitted": 196725, + "total_column_articles": 1089, "frontend_question_id": "540", "is_new_question": false }, @@ -56145,8 +56502,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 64339, - "total_submitted": 97676, + "total_acs": 64548, + "total_submitted": 97999, "total_column_articles": 677, "frontend_question_id": "539", "is_new_question": false @@ -56166,9 +56523,9 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 243769, - "total_submitted": 317826, - "total_column_articles": 1570, + "total_acs": 245218, + "total_submitted": 319641, + "total_column_articles": 1572, "frontend_question_id": "538", "is_new_question": false }, @@ -56187,8 +56544,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 44803, - "total_submitted": 60122, + "total_acs": 44894, + "total_submitted": 60301, "total_column_articles": 669, "frontend_question_id": "537", "is_new_question": false @@ -56208,8 +56565,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 5801, - "total_submitted": 10493, + "total_acs": 5806, + "total_submitted": 10504, "total_column_articles": 98, "frontend_question_id": "536", "is_new_question": false @@ -56229,8 +56586,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 44948, - "total_submitted": 51339, + "total_acs": 45062, + "total_submitted": 51463, "total_column_articles": 281, "frontend_question_id": "535", "is_new_question": false @@ -56250,8 +56607,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 2731, - "total_submitted": 5181, + "total_acs": 2734, + "total_submitted": 5187, "total_column_articles": 48, "frontend_question_id": "533", "is_new_question": false @@ -56271,8 +56628,8 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 63483, - "total_submitted": 139066, + "total_acs": 63652, + "total_submitted": 139320, "total_column_articles": 712, "frontend_question_id": "532", "is_new_question": false @@ -56292,9 +56649,9 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 7133, - "total_submitted": 11136, - "total_column_articles": 124, + "total_acs": 7207, + "total_submitted": 11266, + "total_column_articles": 125, "frontend_question_id": "531", "is_new_question": false }, @@ -56313,9 +56670,9 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 189320, - "total_submitted": 298610, - "total_column_articles": 1204, + "total_acs": 191120, + "total_submitted": 301566, + "total_column_articles": 1213, "frontend_question_id": "530", "is_new_question": false }, @@ -56334,8 +56691,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 51786, - "total_submitted": 80976, + "total_acs": 51982, + "total_submitted": 81234, "total_column_articles": 605, "frontend_question_id": "529", "is_new_question": false @@ -56355,8 +56712,8 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 20398, - "total_submitted": 32034, + "total_acs": 20494, + "total_submitted": 32167, "total_column_articles": 308, "frontend_question_id": "1721", "is_new_question": false @@ -56376,8 +56733,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 2898, - "total_submitted": 4784, + "total_acs": 2901, + "total_submitted": 4789, "total_column_articles": 42, "frontend_question_id": "527", "is_new_question": false @@ -56397,8 +56754,8 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 48639, - "total_submitted": 66462, + "total_acs": 48849, + "total_submitted": 66768, "total_column_articles": 521, "frontend_question_id": "526", "is_new_question": false @@ -56418,8 +56775,8 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 69759, - "total_submitted": 127545, + "total_acs": 70052, + "total_submitted": 128038, "total_column_articles": 706, "frontend_question_id": "525", "is_new_question": false @@ -56439,9 +56796,9 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 102026, - "total_submitted": 203834, - "total_column_articles": 980, + "total_acs": 102278, + "total_submitted": 204236, + "total_column_articles": 981, "frontend_question_id": "524", "is_new_question": false }, @@ -56460,9 +56817,9 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 98226, - "total_submitted": 344192, - "total_column_articles": 792, + "total_acs": 98587, + "total_submitted": 345155, + "total_column_articles": 794, "frontend_question_id": "523", "is_new_question": false }, @@ -56481,8 +56838,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 32597, - "total_submitted": 66834, + "total_acs": 32726, + "total_submitted": 67016, "total_column_articles": 363, "frontend_question_id": "522", "is_new_question": false @@ -56502,9 +56859,9 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 64428, - "total_submitted": 87479, - "total_column_articles": 577, + "total_acs": 64597, + "total_submitted": 87684, + "total_column_articles": 578, "frontend_question_id": "521", "is_new_question": false }, @@ -56523,9 +56880,9 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 90155, - "total_submitted": 158836, - "total_column_articles": 1346, + "total_acs": 90445, + "total_submitted": 159356, + "total_column_articles": 1351, "frontend_question_id": "520", "is_new_question": false }, @@ -56565,9 +56922,9 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 254311, - "total_submitted": 359835, - "total_column_articles": 1299, + "total_acs": 256880, + "total_submitted": 363284, + "total_column_articles": 1312, "frontend_question_id": "518", "is_new_question": false }, @@ -56586,8 +56943,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 24303, - "total_submitted": 47535, + "total_acs": 24344, + "total_submitted": 47604, "total_column_articles": 188, "frontend_question_id": "517", "is_new_question": false @@ -56607,9 +56964,9 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 192253, - "total_submitted": 286218, - "total_column_articles": 1131, + "total_acs": 193883, + "total_submitted": 288669, + "total_column_articles": 1134, "frontend_question_id": "516", "is_new_question": false }, @@ -56628,9 +56985,9 @@ "question__title": "Find Largest Value in Each Tree Row", "question__title_slug": "find-largest-value-in-each-tree-row", "question__hide": false, - "total_acs": 126119, - "total_submitted": 189834, - "total_column_articles": 1126, + "total_acs": 126981, + "total_submitted": 191121, + "total_column_articles": 1130, "frontend_question_id": "515", "is_new_question": false }, @@ -56649,8 +57006,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 28370, - "total_submitted": 55007, + "total_acs": 28445, + "total_submitted": 55140, "total_column_articles": 359, "frontend_question_id": "514", "is_new_question": false @@ -56670,9 +57027,9 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 199775, - "total_submitted": 272213, - "total_column_articles": 1562, + "total_acs": 201433, + "total_submitted": 274506, + "total_column_articles": 1567, "frontend_question_id": "513", "is_new_question": false }, @@ -56691,8 +57048,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 476, - "total_submitted": 1125, + "total_acs": 479, + "total_submitted": 1135, "total_column_articles": 19, "frontend_question_id": "2036", "is_new_question": false @@ -56712,8 +57069,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": 3976, - "total_submitted": 11142, + "total_acs": 4015, + "total_submitted": 11291, "total_column_articles": 60, "frontend_question_id": "1059", "is_new_question": false @@ -56733,8 +57090,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": 751, - "total_submitted": 1352, + "total_acs": 757, + "total_submitted": 1361, "total_column_articles": 22, "frontend_question_id": "2031", "is_new_question": false @@ -56754,9 +57111,9 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 5776, - "total_submitted": 9559, - "total_column_articles": 74, + "total_acs": 5799, + "total_submitted": 9586, + "total_column_articles": 73, "frontend_question_id": "510", "is_new_question": false }, @@ -56775,9 +57132,9 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 44894, - "total_submitted": 59412, - "total_column_articles": 567, + "total_acs": 44988, + "total_submitted": 59532, + "total_column_articles": 568, "frontend_question_id": "508", "is_new_question": false }, @@ -56796,9 +57153,9 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 78484, - "total_submitted": 159768, - "total_column_articles": 575, + "total_acs": 78761, + "total_submitted": 160340, + "total_column_articles": 577, "frontend_question_id": "507", "is_new_question": false }, @@ -56817,9 +57174,9 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 80349, - "total_submitted": 123347, - "total_column_articles": 990, + "total_acs": 80677, + "total_submitted": 123793, + "total_column_articles": 991, "frontend_question_id": "506", "is_new_question": false }, @@ -56838,9 +57195,9 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 10158, - "total_submitted": 19711, - "total_column_articles": 121, + "total_acs": 10244, + "total_submitted": 19860, + "total_column_articles": 122, "frontend_question_id": "505", "is_new_question": false }, @@ -56859,9 +57216,9 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 88514, - "total_submitted": 170995, - "total_column_articles": 848, + "total_acs": 88718, + "total_submitted": 171401, + "total_column_articles": 850, "frontend_question_id": "504", "is_new_question": false }, @@ -56880,9 +57237,9 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 208346, - "total_submitted": 311209, - "total_column_articles": 1643, + "total_acs": 209484, + "total_submitted": 312947, + "total_column_articles": 1647, "frontend_question_id": "503", "is_new_question": false }, @@ -56901,9 +57258,9 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 36538, - "total_submitted": 81291, - "total_column_articles": 432, + "total_acs": 36685, + "total_submitted": 81650, + "total_column_articles": 434, "frontend_question_id": "502", "is_new_question": false }, @@ -56922,9 +57279,9 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 169492, - "total_submitted": 309940, - "total_column_articles": 1126, + "total_acs": 170836, + "total_submitted": 312373, + "total_column_articles": 1128, "frontend_question_id": "501", "is_new_question": false }, @@ -56943,9 +57300,9 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 71988, - "total_submitted": 97224, - "total_column_articles": 1046, + "total_acs": 72265, + "total_submitted": 97611, + "total_column_articles": 1050, "frontend_question_id": "500", "is_new_question": false }, @@ -56964,8 +57321,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 4835, - "total_submitted": 11151, + "total_acs": 4893, + "total_submitted": 11234, "total_column_articles": 92, "frontend_question_id": "499", "is_new_question": false @@ -56985,9 +57342,9 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 111559, - "total_submitted": 199692, - "total_column_articles": 1141, + "total_acs": 112085, + "total_submitted": 200554, + "total_column_articles": 1143, "frontend_question_id": "498", "is_new_question": false }, @@ -57006,9 +57363,9 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 273897, - "total_submitted": 381406, - "total_column_articles": 2438, + "total_acs": 275333, + "total_submitted": 383445, + "total_column_articles": 2444, "frontend_question_id": "496", "is_new_question": false }, @@ -57027,9 +57384,9 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 96572, - "total_submitted": 162679, - "total_column_articles": 1292, + "total_acs": 96921, + "total_submitted": 163215, + "total_column_articles": 1294, "frontend_question_id": "495", "is_new_question": false }, @@ -57048,9 +57405,9 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 369913, - "total_submitted": 761851, - "total_column_articles": 2014, + "total_acs": 373001, + "total_submitted": 768389, + "total_column_articles": 2022, "frontend_question_id": "494", "is_new_question": false }, @@ -57069,8 +57426,8 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 41367, - "total_submitted": 113090, + "total_acs": 41528, + "total_submitted": 113443, "total_column_articles": 406, "frontend_question_id": "493", "is_new_question": false @@ -57090,9 +57447,9 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 58288, - "total_submitted": 95146, - "total_column_articles": 541, + "total_acs": 58440, + "total_submitted": 95361, + "total_column_articles": 542, "frontend_question_id": "492", "is_new_question": false }, @@ -57111,9 +57468,9 @@ "question__title": "Non-decreasing Subsequences", "question__title_slug": "non-decreasing-subsequences", "question__hide": false, - "total_acs": 145510, - "total_submitted": 280399, - "total_column_articles": 919, + "total_acs": 146818, + "total_submitted": 282939, + "total_column_articles": 928, "frontend_question_id": "491", "is_new_question": false }, @@ -57132,8 +57489,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 12267, - "total_submitted": 24311, + "total_acs": 12344, + "total_submitted": 24472, "total_column_articles": 146, "frontend_question_id": "490", "is_new_question": false @@ -57153,8 +57510,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 3471, - "total_submitted": 7194, + "total_acs": 3496, + "total_submitted": 7236, "total_column_articles": 78, "frontend_question_id": "1643", "is_new_question": false @@ -57174,8 +57531,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 20378, - "total_submitted": 41990, + "total_acs": 20391, + "total_submitted": 42048, "total_column_articles": 188, "frontend_question_id": "488", "is_new_question": false @@ -57195,8 +57552,8 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 14960, - "total_submitted": 26104, + "total_acs": 15096, + "total_submitted": 26412, "total_column_articles": 238, "frontend_question_id": "487", "is_new_question": false @@ -57216,9 +57573,9 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 69951, - "total_submitted": 117544, - "total_column_articles": 578, + "total_acs": 70187, + "total_submitted": 117913, + "total_column_articles": 582, "frontend_question_id": "486", "is_new_question": false }, @@ -57237,9 +57594,9 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 209127, - "total_submitted": 342085, - "total_column_articles": 1640, + "total_acs": 210124, + "total_submitted": 343811, + "total_column_articles": 1647, "frontend_question_id": "485", "is_new_question": false }, @@ -57258,9 +57615,9 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 3255, - "total_submitted": 5456, - "total_column_articles": 63, + "total_acs": 3326, + "total_submitted": 5567, + "total_column_articles": 62, "frontend_question_id": "484", "is_new_question": false }, @@ -57279,8 +57636,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 19388, - "total_submitted": 32756, + "total_acs": 19411, + "total_submitted": 32803, "total_column_articles": 149, "frontend_question_id": "483", "is_new_question": false @@ -57300,8 +57657,8 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 57883, - "total_submitted": 123845, + "total_acs": 58033, + "total_submitted": 124200, "total_column_articles": 605, "frontend_question_id": "482", "is_new_question": false @@ -57321,9 +57678,9 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 36005, - "total_submitted": 56139, - "total_column_articles": 472, + "total_acs": 36070, + "total_submitted": 56251, + "total_column_articles": 473, "frontend_question_id": "481", "is_new_question": false }, @@ -57342,9 +57699,9 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 40011, - "total_submitted": 91412, - "total_column_articles": 524, + "total_acs": 40252, + "total_submitted": 92377, + "total_column_articles": 528, "frontend_question_id": "480", "is_new_question": false }, @@ -57363,8 +57720,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 23305, - "total_submitted": 37301, + "total_acs": 23333, + "total_submitted": 37362, "total_column_articles": 176, "frontend_question_id": "479", "is_new_question": false @@ -57384,8 +57741,8 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 46518, - "total_submitted": 76716, + "total_acs": 46611, + "total_submitted": 76858, "total_column_articles": 390, "frontend_question_id": "477", "is_new_question": false @@ -57405,9 +57762,9 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 83206, - "total_submitted": 119460, - "total_column_articles": 1103, + "total_acs": 83366, + "total_submitted": 119689, + "total_column_articles": 1104, "frontend_question_id": "476", "is_new_question": false }, @@ -57426,9 +57783,9 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 71012, - "total_submitted": 172929, - "total_column_articles": 713, + "total_acs": 71142, + "total_submitted": 173188, + "total_column_articles": 716, "frontend_question_id": "475", "is_new_question": false }, @@ -57447,9 +57804,9 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 169228, - "total_submitted": 258907, - "total_column_articles": 1092, + "total_acs": 170859, + "total_submitted": 261167, + "total_column_articles": 1094, "frontend_question_id": "474", "is_new_question": false }, @@ -57468,9 +57825,9 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 72300, - "total_submitted": 154886, - "total_column_articles": 533, + "total_acs": 72462, + "total_submitted": 155264, + "total_column_articles": 534, "frontend_question_id": "473", "is_new_question": false }, @@ -57489,8 +57846,8 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 27609, - "total_submitted": 52994, + "total_acs": 27656, + "total_submitted": 53092, "total_column_articles": 268, "frontend_question_id": "472", "is_new_question": false @@ -57510,8 +57867,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 2618, - "total_submitted": 4410, + "total_acs": 2634, + "total_submitted": 4435, "total_column_articles": 43, "frontend_question_id": "471", "is_new_question": false @@ -57531,8 +57888,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 2606, - "total_submitted": 6076, + "total_acs": 2612, + "total_submitted": 6091, "total_column_articles": 37, "frontend_question_id": "469", "is_new_question": false @@ -57552,8 +57909,8 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 64289, - "total_submitted": 228358, + "total_acs": 64481, + "total_submitted": 229109, "total_column_articles": 726, "frontend_question_id": "468", "is_new_question": false @@ -57573,8 +57930,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 38128, - "total_submitted": 73787, + "total_acs": 38253, + "total_submitted": 74008, "total_column_articles": 373, "frontend_question_id": "467", "is_new_question": false @@ -57594,8 +57951,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 13999, - "total_submitted": 37132, + "total_acs": 14034, + "total_submitted": 37206, "total_column_articles": 206, "frontend_question_id": "466", "is_new_question": false @@ -57615,9 +57972,9 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 2766, - "total_submitted": 5079, - "total_column_articles": 44, + "total_acs": 2781, + "total_submitted": 5104, + "total_column_articles": 45, "frontend_question_id": "465", "is_new_question": false }, @@ -57636,9 +57993,9 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 38844, - "total_submitted": 94544, - "total_column_articles": 291, + "total_acs": 38942, + "total_submitted": 94860, + "total_column_articles": 293, "frontend_question_id": "464", "is_new_question": false }, @@ -57657,9 +58014,9 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 135329, - "total_submitted": 193314, - "total_column_articles": 1457, + "total_acs": 136045, + "total_submitted": 194354, + "total_column_articles": 1462, "frontend_question_id": "463", "is_new_question": false }, @@ -57678,8 +58035,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": 52696, - "total_submitted": 84538, + "total_acs": 52785, + "total_submitted": 84691, "total_column_articles": 529, "frontend_question_id": "462", "is_new_question": false @@ -57699,9 +58056,9 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 285113, - "total_submitted": 348209, - "total_column_articles": 2099, + "total_acs": 285874, + "total_submitted": 349115, + "total_column_articles": 2100, "frontend_question_id": "461", "is_new_question": false }, @@ -57720,9 +58077,9 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 65984, - "total_submitted": 146729, - "total_column_articles": 652, + "total_acs": 66266, + "total_submitted": 147340, + "total_column_articles": 653, "frontend_question_id": "460", "is_new_question": false }, @@ -57741,9 +58098,9 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 201666, - "total_submitted": 393079, - "total_column_articles": 1355, + "total_acs": 203356, + "total_submitted": 396149, + "total_column_articles": 1358, "frontend_question_id": "459", "is_new_question": false }, @@ -57762,8 +58119,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 27324, - "total_submitted": 40410, + "total_acs": 27396, + "total_submitted": 40545, "total_column_articles": 248, "frontend_question_id": "458", "is_new_question": false @@ -57783,9 +58140,9 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 36289, - "total_submitted": 83683, - "total_column_articles": 377, + "total_acs": 36368, + "total_submitted": 83860, + "total_column_articles": 378, "frontend_question_id": "457", "is_new_question": false }, @@ -57804,8 +58161,8 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 76832, - "total_submitted": 210864, + "total_acs": 76970, + "total_submitted": 211221, "total_column_articles": 617, "frontend_question_id": "456", "is_new_question": false @@ -57825,9 +58182,9 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 336791, - "total_submitted": 597603, - "total_column_articles": 2350, + "total_acs": 339359, + "total_submitted": 602166, + "total_column_articles": 2360, "frontend_question_id": "455", "is_new_question": false }, @@ -57846,9 +58203,9 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 216078, - "total_submitted": 336576, - "total_column_articles": 1239, + "total_acs": 218129, + "total_submitted": 339706, + "total_column_articles": 1245, "frontend_question_id": "454", "is_new_question": false }, @@ -57867,9 +58224,9 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 76862, - "total_submitted": 125217, - "total_column_articles": 874, + "total_acs": 76978, + "total_submitted": 125452, + "total_column_articles": 875, "frontend_question_id": "453", "is_new_question": false }, @@ -57888,9 +58245,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": 215142, - "total_submitted": 424570, - "total_column_articles": 1561, + "total_acs": 216975, + "total_submitted": 428048, + "total_column_articles": 1571, "frontend_question_id": "452", "is_new_question": false }, @@ -57909,9 +58266,9 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 128677, - "total_submitted": 178702, - "total_column_articles": 1346, + "total_acs": 129034, + "total_submitted": 179149, + "total_column_articles": 1349, "frontend_question_id": "451", "is_new_question": false }, @@ -57930,9 +58287,9 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 218516, - "total_submitted": 417572, - "total_column_articles": 2021, + "total_acs": 220232, + "total_submitted": 420664, + "total_column_articles": 2034, "frontend_question_id": "450", "is_new_question": false }, @@ -57951,8 +58308,8 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 49238, - "total_submitted": 81384, + "total_acs": 49306, + "total_submitted": 81489, "total_column_articles": 433, "frontend_question_id": "449", "is_new_question": false @@ -57972,9 +58329,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": 288628, - "total_submitted": 437958, - "total_column_articles": 1963, + "total_acs": 289727, + "total_submitted": 439887, + "total_column_articles": 1966, "frontend_question_id": "448", "is_new_question": false }, @@ -57993,8 +58350,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 56123, - "total_submitted": 84087, + "total_acs": 56167, + "total_submitted": 84153, "total_column_articles": 436, "frontend_question_id": "447", "is_new_question": false @@ -58014,8 +58371,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 24292, - "total_submitted": 44485, + "total_acs": 24338, + "total_submitted": 44601, "total_column_articles": 208, "frontend_question_id": "446", "is_new_question": false @@ -58035,9 +58392,9 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 142787, - "total_submitted": 233889, - "total_column_articles": 1472, + "total_acs": 143273, + "total_submitted": 234756, + "total_column_articles": 1471, "frontend_question_id": "445", "is_new_question": false }, @@ -58056,8 +58413,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 5944, - "total_submitted": 18880, + "total_acs": 5957, + "total_submitted": 18903, "total_column_articles": 86, "frontend_question_id": "444", "is_new_question": false @@ -58077,9 +58434,9 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 86297, - "total_submitted": 179996, - "total_column_articles": 927, + "total_acs": 87235, + "total_submitted": 181831, + "total_column_articles": 936, "frontend_question_id": "443", "is_new_question": false }, @@ -58098,9 +58455,9 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 111810, - "total_submitted": 148917, - "total_column_articles": 1030, + "total_acs": 112099, + "total_submitted": 149323, + "total_column_articles": 1031, "frontend_question_id": "442", "is_new_question": false }, @@ -58119,9 +58476,9 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 122847, - "total_submitted": 271806, - "total_column_articles": 1136, + "total_acs": 123225, + "total_submitted": 272682, + "total_column_articles": 1134, "frontend_question_id": "441", "is_new_question": false }, @@ -58140,9 +58497,9 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 49309, - "total_submitted": 115885, - "total_column_articles": 310, + "total_acs": 49461, + "total_submitted": 116215, + "total_column_articles": 309, "frontend_question_id": "440", "is_new_question": false }, @@ -58161,8 +58518,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 4883, - "total_submitted": 7955, + "total_acs": 4947, + "total_submitted": 8039, "total_column_articles": 107, "frontend_question_id": "439", "is_new_question": false @@ -58182,9 +58539,9 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 308617, - "total_submitted": 565513, - "total_column_articles": 2219, + "total_acs": 311587, + "total_submitted": 571350, + "total_column_articles": 2229, "frontend_question_id": "438", "is_new_question": false }, @@ -58203,9 +58560,9 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 239425, - "total_submitted": 481073, - "total_column_articles": 1561, + "total_acs": 241554, + "total_submitted": 486220, + "total_column_articles": 1567, "frontend_question_id": "437", "is_new_question": false }, @@ -58224,9 +58581,9 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 45445, - "total_submitted": 79963, - "total_column_articles": 577, + "total_acs": 45557, + "total_submitted": 80152, + "total_column_articles": 578, "frontend_question_id": "436", "is_new_question": false }, @@ -58245,9 +58602,9 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 231881, - "total_submitted": 453162, - "total_column_articles": 1672, + "total_acs": 233517, + "total_submitted": 456349, + "total_column_articles": 1679, "frontend_question_id": "435", "is_new_question": false }, @@ -58266,9 +58623,9 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 93181, - "total_submitted": 241583, - "total_column_articles": 1160, + "total_acs": 93507, + "total_submitted": 242628, + "total_column_articles": 1165, "frontend_question_id": "434", "is_new_question": false }, @@ -58287,9 +58644,9 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 53090, - "total_submitted": 96881, - "total_column_articles": 746, + "total_acs": 53338, + "total_submitted": 97325, + "total_column_articles": 748, "frontend_question_id": "433", "is_new_question": false }, @@ -58308,9 +58665,9 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 29041, - "total_submitted": 62007, - "total_column_articles": 312, + "total_acs": 29100, + "total_submitted": 62120, + "total_column_articles": 313, "frontend_question_id": "432", "is_new_question": false }, @@ -58329,8 +58686,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 2477, - "total_submitted": 3937, + "total_acs": 2482, + "total_submitted": 3955, "total_column_articles": 49, "frontend_question_id": "425", "is_new_question": false @@ -58350,9 +58707,9 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 89813, - "total_submitted": 164362, - "total_column_articles": 752, + "total_acs": 90062, + "total_submitted": 164788, + "total_column_articles": 754, "frontend_question_id": "424", "is_new_question": false }, @@ -58371,9 +58728,9 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 39822, - "total_submitted": 65499, - "total_column_articles": 457, + "total_acs": 39897, + "total_submitted": 65623, + "total_column_articles": 458, "frontend_question_id": "423", "is_new_question": false }, @@ -58392,8 +58749,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 4651, - "total_submitted": 10669, + "total_acs": 4733, + "total_submitted": 10851, "total_column_articles": 101, "frontend_question_id": "422", "is_new_question": false @@ -58413,9 +58770,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": 45736, - "total_submitted": 74971, - "total_column_articles": 425, + "total_acs": 45892, + "total_submitted": 75214, + "total_column_articles": 427, "frontend_question_id": "421", "is_new_question": false }, @@ -58434,8 +58791,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 18515, - "total_submitted": 47475, + "total_acs": 18525, + "total_submitted": 47509, "total_column_articles": 163, "frontend_question_id": "420", "is_new_question": false @@ -58455,8 +58812,8 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 45468, - "total_submitted": 58293, + "total_acs": 45566, + "total_submitted": 58415, "total_column_articles": 565, "frontend_question_id": "419", "is_new_question": false @@ -58476,9 +58833,9 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 3985, - "total_submitted": 10153, - "total_column_articles": 59, + "total_acs": 3993, + "total_submitted": 10177, + "total_column_articles": 60, "frontend_question_id": "418", "is_new_question": false }, @@ -58497,9 +58854,9 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 84617, - "total_submitted": 150493, - "total_column_articles": 858, + "total_acs": 84908, + "total_submitted": 151062, + "total_column_articles": 861, "frontend_question_id": "417", "is_new_question": false }, @@ -58518,9 +58875,9 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 438021, - "total_submitted": 839366, - "total_column_articles": 2131, + "total_acs": 442100, + "total_submitted": 846944, + "total_column_articles": 2145, "frontend_question_id": "416", "is_new_question": false }, @@ -58539,9 +58896,9 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 295165, - "total_submitted": 538958, - "total_column_articles": 1896, + "total_acs": 296705, + "total_submitted": 541927, + "total_column_articles": 1900, "frontend_question_id": "415", "is_new_question": false }, @@ -58560,9 +58917,9 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 146731, - "total_submitted": 369603, - "total_column_articles": 1715, + "total_acs": 147345, + "total_submitted": 370957, + "total_column_articles": 1716, "frontend_question_id": "414", "is_new_question": false }, @@ -58581,9 +58938,9 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 121401, - "total_submitted": 174646, - "total_column_articles": 1481, + "total_acs": 121589, + "total_submitted": 174910, + "total_column_articles": 1482, "frontend_question_id": "413", "is_new_question": false }, @@ -58602,9 +58959,9 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 202763, - "total_submitted": 294019, - "total_column_articles": 1276, + "total_acs": 203244, + "total_submitted": 294679, + "total_column_articles": 1280, "frontend_question_id": "412", "is_new_question": false }, @@ -58623,8 +58980,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 1607, - "total_submitted": 3220, + "total_acs": 1608, + "total_submitted": 3224, "total_column_articles": 35, "frontend_question_id": "411", "is_new_question": false @@ -58644,9 +59001,9 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 69293, - "total_submitted": 117176, - "total_column_articles": 550, + "total_acs": 69574, + "total_submitted": 117697, + "total_column_articles": 553, "frontend_question_id": "410", "is_new_question": false }, @@ -58665,9 +59022,9 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 178754, - "total_submitted": 320516, - "total_column_articles": 2080, + "total_acs": 179395, + "total_submitted": 321661, + "total_column_articles": 2083, "frontend_question_id": "409", "is_new_question": false }, @@ -58686,8 +59043,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 6435, - "total_submitted": 18191, + "total_acs": 6450, + "total_submitted": 18245, "total_column_articles": 124, "frontend_question_id": "408", "is_new_question": false @@ -58707,8 +59064,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 35079, - "total_submitted": 60888, + "total_acs": 35210, + "total_submitted": 61166, "total_column_articles": 313, "frontend_question_id": "407", "is_new_question": false @@ -58728,9 +59085,9 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 257540, - "total_submitted": 337480, - "total_column_articles": 1458, + "total_acs": 259003, + "total_submitted": 339353, + "total_column_articles": 1461, "frontend_question_id": "406", "is_new_question": false }, @@ -58749,9 +59106,9 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 66685, - "total_submitted": 121845, - "total_column_articles": 640, + "total_acs": 66831, + "total_submitted": 122119, + "total_column_articles": 641, "frontend_question_id": "405", "is_new_question": false }, @@ -58770,9 +59127,9 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 251404, - "total_submitted": 402426, - "total_column_articles": 2113, + "total_acs": 253263, + "total_submitted": 405315, + "total_column_articles": 2121, "frontend_question_id": "404", "is_new_question": false }, @@ -58791,8 +59148,8 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 62439, - "total_submitted": 135612, + "total_acs": 62563, + "total_submitted": 135902, "total_column_articles": 580, "frontend_question_id": "403", "is_new_question": false @@ -58812,9 +59169,9 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 139979, - "total_submitted": 441302, - "total_column_articles": 962, + "total_acs": 140513, + "total_submitted": 442930, + "total_column_articles": 964, "frontend_question_id": "402", "is_new_question": false }, @@ -58833,9 +59190,9 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 73278, - "total_submitted": 117106, - "total_column_articles": 891, + "total_acs": 73457, + "total_submitted": 117370, + "total_column_articles": 893, "frontend_question_id": "401", "is_new_question": false }, @@ -58854,9 +59211,9 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 59079, - "total_submitted": 129286, - "total_column_articles": 634, + "total_acs": 59230, + "total_submitted": 129576, + "total_column_articles": 636, "frontend_question_id": "400", "is_new_question": false }, @@ -58875,9 +59232,9 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 80879, - "total_submitted": 136907, - "total_column_articles": 917, + "total_acs": 81382, + "total_submitted": 137786, + "total_column_articles": 921, "frontend_question_id": "399", "is_new_question": false }, @@ -58896,8 +59253,8 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 58028, - "total_submitted": 83425, + "total_acs": 58112, + "total_submitted": 83628, "total_column_articles": 477, "frontend_question_id": "398", "is_new_question": false @@ -58917,8 +59274,8 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 68078, - "total_submitted": 160607, + "total_acs": 68238, + "total_submitted": 160987, "total_column_articles": 707, "frontend_question_id": "397", "is_new_question": false @@ -58938,8 +59295,8 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 50815, - "total_submitted": 95557, + "total_acs": 50992, + "total_submitted": 95842, "total_column_articles": 607, "frontend_question_id": "396", "is_new_question": false @@ -58959,9 +59316,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": 85887, - "total_submitted": 163656, - "total_column_articles": 668, + "total_acs": 86103, + "total_submitted": 164061, + "total_column_articles": 669, "frontend_question_id": "395", "is_new_question": false }, @@ -58980,9 +59337,9 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 253635, - "total_submitted": 446849, - "total_column_articles": 2288, + "total_acs": 255794, + "total_submitted": 450482, + "total_column_articles": 2308, "frontend_question_id": "394", "is_new_question": false }, @@ -59001,8 +59358,8 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 39424, - "total_submitted": 90246, + "total_acs": 39473, + "total_submitted": 90364, "total_column_articles": 491, "frontend_question_id": "393", "is_new_question": false @@ -59022,9 +59379,9 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 321572, - "total_submitted": 613562, - "total_column_articles": 2812, + "total_acs": 325047, + "total_submitted": 620152, + "total_column_articles": 2832, "frontend_question_id": "392", "is_new_question": false }, @@ -59043,8 +59400,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 27338, - "total_submitted": 59358, + "total_acs": 27407, + "total_submitted": 59524, "total_column_articles": 329, "frontend_question_id": "391", "is_new_question": false @@ -59064,8 +59421,8 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 37625, - "total_submitted": 62649, + "total_acs": 37709, + "total_submitted": 62811, "total_column_articles": 474, "frontend_question_id": "390", "is_new_question": false @@ -59085,9 +59442,9 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 169982, - "total_submitted": 255569, - "total_column_articles": 1673, + "total_acs": 170925, + "total_submitted": 257208, + "total_column_articles": 1677, "frontend_question_id": "389", "is_new_question": false }, @@ -59106,9 +59463,9 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 34917, - "total_submitted": 54731, - "total_column_articles": 530, + "total_acs": 34961, + "total_submitted": 54787, + "total_column_articles": 532, "frontend_question_id": "388", "is_new_question": false }, @@ -59127,9 +59484,9 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 393141, - "total_submitted": 702708, - "total_column_articles": 2180, + "total_acs": 394002, + "total_submitted": 704075, + "total_column_articles": 2182, "frontend_question_id": "387", "is_new_question": false }, @@ -59148,9 +59505,9 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 71878, - "total_submitted": 96146, - "total_column_articles": 675, + "total_acs": 72017, + "total_submitted": 96346, + "total_column_articles": 677, "frontend_question_id": "386", "is_new_question": false }, @@ -59169,9 +59526,9 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 32062, - "total_submitted": 58465, - "total_column_articles": 304, + "total_acs": 32118, + "total_submitted": 58555, + "total_column_articles": 305, "frontend_question_id": "385", "is_new_question": false }, @@ -59190,8 +59547,8 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 125719, - "total_submitted": 204050, + "total_acs": 125966, + "total_submitted": 204411, "total_column_articles": 605, "frontend_question_id": "384", "is_new_question": false @@ -59211,9 +59568,9 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 359710, - "total_submitted": 591077, - "total_column_articles": 3075, + "total_acs": 362664, + "total_submitted": 595045, + "total_column_articles": 3083, "frontend_question_id": "383", "is_new_question": false }, @@ -59232,8 +59589,8 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 62972, - "total_submitted": 86500, + "total_acs": 63119, + "total_submitted": 86696, "total_column_articles": 453, "frontend_question_id": "382", "is_new_question": false @@ -59253,9 +59610,9 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 26651, - "total_submitted": 62984, - "total_column_articles": 240, + "total_acs": 26787, + "total_submitted": 63271, + "total_column_articles": 241, "frontend_question_id": "381", "is_new_question": false }, @@ -59274,9 +59631,9 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 111583, - "total_submitted": 212253, - "total_column_articles": 1739, + "total_acs": 113158, + "total_submitted": 215344, + "total_column_articles": 1751, "frontend_question_id": "380", "is_new_question": false }, @@ -59295,9 +59652,9 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 5788, - "total_submitted": 9459, - "total_column_articles": 116, + "total_acs": 5803, + "total_submitted": 9476, + "total_column_articles": 117, "frontend_question_id": "379", "is_new_question": false }, @@ -59316,9 +59673,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": 124495, - "total_submitted": 195737, - "total_column_articles": 846, + "total_acs": 124869, + "total_submitted": 196362, + "total_column_articles": 849, "frontend_question_id": "378", "is_new_question": false }, @@ -59337,9 +59694,9 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 152865, - "total_submitted": 289410, - "total_column_articles": 980, + "total_acs": 154454, + "total_submitted": 292338, + "total_column_articles": 986, "frontend_question_id": "377", "is_new_question": false }, @@ -59358,9 +59715,9 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 193311, - "total_submitted": 413098, - "total_column_articles": 1595, + "total_acs": 194816, + "total_submitted": 416304, + "total_column_articles": 1600, "frontend_question_id": "376", "is_new_question": false }, @@ -59379,8 +59736,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 46249, - "total_submitted": 73876, + "total_acs": 46361, + "total_submitted": 74049, "total_column_articles": 354, "frontend_question_id": "375", "is_new_question": false @@ -59400,9 +59757,9 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 165696, - "total_submitted": 317884, - "total_column_articles": 1041, + "total_acs": 166535, + "total_submitted": 319400, + "total_column_articles": 1043, "frontend_question_id": "374", "is_new_question": false }, @@ -59421,9 +59778,9 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 61313, - "total_submitted": 150696, - "total_column_articles": 548, + "total_acs": 61586, + "total_submitted": 151354, + "total_column_articles": 550, "frontend_question_id": "373", "is_new_question": false }, @@ -59442,9 +59799,9 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 46795, - "total_submitted": 81894, - "total_column_articles": 510, + "total_acs": 46905, + "total_submitted": 82104, + "total_column_articles": 511, "frontend_question_id": "372", "is_new_question": false }, @@ -59463,9 +59820,9 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 109992, - "total_submitted": 178593, - "total_column_articles": 697, + "total_acs": 110274, + "total_submitted": 178990, + "total_column_articles": 698, "frontend_question_id": "371", "is_new_question": false }, @@ -59484,8 +59841,8 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 12625, - "total_submitted": 16438, + "total_acs": 12684, + "total_submitted": 16504, "total_column_articles": 285, "frontend_question_id": "370", "is_new_question": false @@ -59505,9 +59862,9 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 8978, - "total_submitted": 14334, - "total_column_articles": 241, + "total_acs": 9058, + "total_submitted": 14475, + "total_column_articles": 242, "frontend_question_id": "369", "is_new_question": false }, @@ -59526,8 +59883,8 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 57549, - "total_submitted": 125235, + "total_acs": 57642, + "total_submitted": 125432, "total_column_articles": 593, "frontend_question_id": "368", "is_new_question": false @@ -59547,9 +59904,9 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 232781, - "total_submitted": 519682, - "total_column_articles": 1709, + "total_acs": 233829, + "total_submitted": 521789, + "total_column_articles": 1714, "frontend_question_id": "367", "is_new_question": false }, @@ -59568,8 +59925,8 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 9745, - "total_submitted": 12118, + "total_acs": 9808, + "total_submitted": 12185, "total_column_articles": 226, "frontend_question_id": "366", "is_new_question": false @@ -59589,8 +59946,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 48556, - "total_submitted": 121470, + "total_acs": 48731, + "total_submitted": 121791, "total_column_articles": 614, "frontend_question_id": "365", "is_new_question": false @@ -59610,8 +59967,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 3333, - "total_submitted": 5007, + "total_acs": 3337, + "total_submitted": 5017, "total_column_articles": 78, "frontend_question_id": "364", "is_new_question": false @@ -59631,8 +59988,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": 41810, - "total_submitted": 86867, + "total_acs": 41930, + "total_submitted": 87115, "total_column_articles": 269, "frontend_question_id": "363", "is_new_question": false @@ -59652,9 +60009,9 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 6926, - "total_submitted": 10080, - "total_column_articles": 126, + "total_acs": 6946, + "total_submitted": 10108, + "total_column_articles": 127, "frontend_question_id": "362", "is_new_question": false }, @@ -59673,8 +60030,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 5996, - "total_submitted": 10071, + "total_acs": 6018, + "total_submitted": 10115, "total_column_articles": 106, "frontend_question_id": "361", "is_new_question": false @@ -59694,8 +60051,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 5219, - "total_submitted": 8386, + "total_acs": 5243, + "total_submitted": 8416, "total_column_articles": 90, "frontend_question_id": "360", "is_new_question": false @@ -59715,9 +60072,9 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 8603, - "total_submitted": 11504, - "total_column_articles": 103, + "total_acs": 8641, + "total_submitted": 11557, + "total_column_articles": 104, "frontend_question_id": "359", "is_new_question": false }, @@ -59736,9 +60093,9 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 7066, - "total_submitted": 19173, - "total_column_articles": 92, + "total_acs": 7128, + "total_submitted": 19291, + "total_column_articles": 94, "frontend_question_id": "358", "is_new_question": false }, @@ -59757,8 +60114,8 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 69165, - "total_submitted": 114318, + "total_acs": 69269, + "total_submitted": 114483, "total_column_articles": 938, "frontend_question_id": "357", "is_new_question": false @@ -59778,8 +60135,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 2659, - "total_submitted": 7252, + "total_acs": 2668, + "total_submitted": 7272, "total_column_articles": 61, "frontend_question_id": "356", "is_new_question": false @@ -59799,8 +60156,8 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 43667, - "total_submitted": 106381, + "total_acs": 43793, + "total_submitted": 106701, "total_column_articles": 714, "frontend_question_id": "355", "is_new_question": false @@ -59820,9 +60177,9 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 104864, - "total_submitted": 280869, - "total_column_articles": 842, + "total_acs": 105237, + "total_submitted": 282260, + "total_column_articles": 845, "frontend_question_id": "354", "is_new_question": false }, @@ -59841,8 +60198,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 4494, - "total_submitted": 10301, + "total_acs": 4574, + "total_submitted": 10429, "total_column_articles": 87, "frontend_question_id": "353", "is_new_question": false @@ -59862,9 +60219,9 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 25633, - "total_submitted": 38130, - "total_column_articles": 414, + "total_acs": 25658, + "total_submitted": 38170, + "total_column_articles": 415, "frontend_question_id": "352", "is_new_question": false }, @@ -59883,8 +60240,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 7518, - "total_submitted": 12240, + "total_acs": 7532, + "total_submitted": 12272, "total_column_articles": 134, "frontend_question_id": "351", "is_new_question": false @@ -59904,9 +60261,9 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 486250, - "total_submitted": 852077, - "total_column_articles": 2848, + "total_acs": 487360, + "total_submitted": 853723, + "total_column_articles": 2850, "frontend_question_id": "350", "is_new_question": false }, @@ -59925,9 +60282,9 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 467502, - "total_submitted": 629641, - "total_column_articles": 3015, + "total_acs": 471047, + "total_submitted": 634673, + "total_column_articles": 3027, "frontend_question_id": "349", "is_new_question": false }, @@ -59946,9 +60303,9 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 9595, - "total_submitted": 16183, - "total_column_articles": 134, + "total_acs": 9658, + "total_submitted": 16289, + "total_column_articles": 135, "frontend_question_id": "348", "is_new_question": false }, @@ -59967,9 +60324,9 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 452503, - "total_submitted": 712217, - "total_column_articles": 2977, + "total_acs": 455752, + "total_submitted": 717318, + "total_column_articles": 2995, "frontend_question_id": "347", "is_new_question": false }, @@ -59988,8 +60345,8 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 20431, - "total_submitted": 28202, + "total_acs": 20524, + "total_submitted": 28308, "total_column_articles": 212, "frontend_question_id": "346", "is_new_question": false @@ -60009,9 +60366,9 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 171682, - "total_submitted": 314967, - "total_column_articles": 1492, + "total_acs": 173128, + "total_submitted": 317535, + "total_column_articles": 1502, "frontend_question_id": "345", "is_new_question": false }, @@ -60030,9 +60387,9 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 799124, - "total_submitted": 1000029, - "total_column_articles": 3842, + "total_acs": 803623, + "total_submitted": 1005574, + "total_column_articles": 3852, "frontend_question_id": "344", "is_new_question": false }, @@ -60051,9 +60408,9 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 273873, - "total_submitted": 440157, - "total_column_articles": 1946, + "total_acs": 276034, + "total_submitted": 443252, + "total_column_articles": 1953, "frontend_question_id": "343", "is_new_question": false }, @@ -60072,9 +60429,9 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 133552, - "total_submitted": 252474, - "total_column_articles": 1108, + "total_acs": 134047, + "total_submitted": 253316, + "total_column_articles": 1109, "frontend_question_id": "342", "is_new_question": false }, @@ -60093,9 +60450,9 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 76082, - "total_submitted": 104566, - "total_column_articles": 667, + "total_acs": 76253, + "total_submitted": 104772, + "total_column_articles": 668, "frontend_question_id": "341", "is_new_question": false }, @@ -60114,9 +60471,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": 26530, - "total_submitted": 51858, - "total_column_articles": 308, + "total_acs": 26657, + "total_submitted": 52107, + "total_column_articles": 309, "frontend_question_id": "340", "is_new_question": false }, @@ -60135,8 +60492,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 6170, - "total_submitted": 7406, + "total_acs": 6178, + "total_submitted": 7414, "total_column_articles": 82, "frontend_question_id": "339", "is_new_question": false @@ -60156,9 +60513,9 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 303741, - "total_submitted": 386306, - "total_column_articles": 2244, + "total_acs": 305192, + "total_submitted": 388111, + "total_column_articles": 2246, "frontend_question_id": "338", "is_new_question": false }, @@ -60177,9 +60534,9 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 286228, - "total_submitted": 468136, - "total_column_articles": 1770, + "total_acs": 288476, + "total_submitted": 471641, + "total_column_articles": 1777, "frontend_question_id": "337", "is_new_question": false }, @@ -60198,9 +60555,9 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 27783, - "total_submitted": 72731, - "total_column_articles": 244, + "total_acs": 27827, + "total_submitted": 72864, + "total_column_articles": 245, "frontend_question_id": "336", "is_new_question": false }, @@ -60219,9 +60576,9 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 18732, - "total_submitted": 44114, - "total_column_articles": 169, + "total_acs": 18762, + "total_submitted": 44184, + "total_column_articles": 170, "frontend_question_id": "335", "is_new_question": false }, @@ -60240,9 +60597,9 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 131668, - "total_submitted": 306883, - "total_column_articles": 846, + "total_acs": 132743, + "total_submitted": 309390, + "total_column_articles": 856, "frontend_question_id": "334", "is_new_question": false }, @@ -60261,8 +60618,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 9332, - "total_submitted": 19131, + "total_acs": 9408, + "total_submitted": 19252, "total_column_articles": 151, "frontend_question_id": "333", "is_new_question": false @@ -60282,9 +60639,9 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 91566, - "total_submitted": 191453, - "total_column_articles": 618, + "total_acs": 92181, + "total_submitted": 192667, + "total_column_articles": 621, "frontend_question_id": "332", "is_new_question": false }, @@ -60303,9 +60660,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": 60600, - "total_submitted": 125846, - "total_column_articles": 650, + "total_acs": 60732, + "total_submitted": 126090, + "total_column_articles": 651, "frontend_question_id": "331", "is_new_question": false }, @@ -60324,9 +60681,9 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 23603, - "total_submitted": 44658, - "total_column_articles": 193, + "total_acs": 23635, + "total_submitted": 44714, + "total_column_articles": 196, "frontend_question_id": "330", "is_new_question": false }, @@ -60345,9 +60702,9 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 99000, - "total_submitted": 191201, - "total_column_articles": 849, + "total_acs": 99415, + "total_submitted": 191881, + "total_column_articles": 851, "frontend_question_id": "329", "is_new_question": false }, @@ -60366,9 +60723,9 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 213468, - "total_submitted": 328921, - "total_column_articles": 1628, + "total_acs": 214610, + "total_submitted": 330866, + "total_column_articles": 1636, "frontend_question_id": "328", "is_new_question": false }, @@ -60387,8 +60744,8 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 42093, - "total_submitted": 103711, + "total_acs": 42252, + "total_submitted": 104100, "total_column_articles": 357, "frontend_question_id": "327", "is_new_question": false @@ -60408,9 +60765,9 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 213515, - "total_submitted": 418614, - "total_column_articles": 938, + "total_acs": 214309, + "total_submitted": 419996, + "total_column_articles": 942, "frontend_question_id": "326", "is_new_question": false }, @@ -60429,9 +60786,9 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 17361, - "total_submitted": 33642, - "total_column_articles": 191, + "total_acs": 17383, + "total_submitted": 33682, + "total_column_articles": 192, "frontend_question_id": "325", "is_new_question": false }, @@ -60450,8 +60807,8 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 63188, - "total_submitted": 154658, + "total_acs": 63318, + "total_submitted": 154998, "total_column_articles": 403, "frontend_question_id": "324", "is_new_question": false @@ -60471,9 +60828,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": 24208, - "total_submitted": 36964, - "total_column_articles": 352, + "total_acs": 24390, + "total_submitted": 37250, + "total_column_articles": 353, "frontend_question_id": "323", "is_new_question": false }, @@ -60492,9 +60849,9 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 659766, - "total_submitted": 1417049, - "total_column_articles": 3665, + "total_acs": 664771, + "total_submitted": 1426297, + "total_column_articles": 3677, "frontend_question_id": "322", "is_new_question": false }, @@ -60513,8 +60870,8 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 36558, - "total_submitted": 86946, + "total_acs": 36661, + "total_submitted": 87186, "total_column_articles": 306, "frontend_question_id": "321", "is_new_question": false @@ -60534,8 +60891,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 4777, - "total_submitted": 6815, + "total_acs": 4782, + "total_submitted": 6822, "total_column_articles": 82, "frontend_question_id": "320", "is_new_question": false @@ -60555,8 +60912,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 61955, - "total_submitted": 107316, + "total_acs": 62097, + "total_submitted": 107538, "total_column_articles": 538, "frontend_question_id": "319", "is_new_question": false @@ -60576,9 +60933,9 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 68618, - "total_submitted": 94521, - "total_column_articles": 621, + "total_acs": 68760, + "total_submitted": 94731, + "total_column_articles": 622, "frontend_question_id": "318", "is_new_question": false }, @@ -60597,9 +60954,9 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 7522, - "total_submitted": 15813, - "total_column_articles": 96, + "total_acs": 7577, + "total_submitted": 15925, + "total_column_articles": 97, "frontend_question_id": "317", "is_new_question": false }, @@ -60618,8 +60975,8 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 121463, - "total_submitted": 251170, + "total_acs": 121921, + "total_submitted": 251979, "total_column_articles": 902, "frontend_question_id": "316", "is_new_question": false @@ -60639,9 +60996,9 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 84572, - "total_submitted": 194697, - "total_column_articles": 816, + "total_acs": 84809, + "total_submitted": 195213, + "total_column_articles": 818, "frontend_question_id": "315", "is_new_question": false }, @@ -60660,9 +61017,9 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 10857, - "total_submitted": 19480, - "total_column_articles": 176, + "total_acs": 10940, + "total_submitted": 19601, + "total_column_articles": 180, "frontend_question_id": "314", "is_new_question": false }, @@ -60681,9 +61038,9 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 59693, - "total_submitted": 105703, - "total_column_articles": 508, + "total_acs": 59848, + "total_submitted": 106011, + "total_column_articles": 509, "frontend_question_id": "313", "is_new_question": false }, @@ -60702,9 +61059,9 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 107724, - "total_submitted": 153945, - "total_column_articles": 669, + "total_acs": 108196, + "total_submitted": 154545, + "total_column_articles": 670, "frontend_question_id": "312", "is_new_question": false }, @@ -60723,9 +61080,9 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 7561, - "total_submitted": 10024, - "total_column_articles": 88, + "total_acs": 7656, + "total_submitted": 10139, + "total_column_articles": 89, "frontend_question_id": "311", "is_new_question": false }, @@ -60744,9 +61101,9 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 60967, - "total_submitted": 143305, - "total_column_articles": 488, + "total_acs": 61231, + "total_submitted": 143880, + "total_column_articles": 487, "frontend_question_id": "310", "is_new_question": false }, @@ -60765,9 +61122,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": 268162, - "total_submitted": 417653, - "total_column_articles": 1950, + "total_acs": 269845, + "total_submitted": 420327, + "total_column_articles": 1957, "frontend_question_id": "309", "is_new_question": false }, @@ -60786,8 +61143,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 4244, - "total_submitted": 6613, + "total_acs": 4250, + "total_submitted": 6622, "total_column_articles": 84, "frontend_question_id": "308", "is_new_question": false @@ -60807,8 +61164,8 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 68122, - "total_submitted": 130653, + "total_acs": 68314, + "total_submitted": 130968, "total_column_articles": 606, "frontend_question_id": "307", "is_new_question": false @@ -60828,8 +61185,8 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 49607, - "total_submitted": 131235, + "total_acs": 49705, + "total_submitted": 131520, "total_column_articles": 691, "frontend_question_id": "306", "is_new_question": false @@ -60849,8 +61206,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 9783, - "total_submitted": 23141, + "total_acs": 9831, + "total_submitted": 23262, "total_column_articles": 131, "frontend_question_id": "305", "is_new_question": false @@ -60870,9 +61227,9 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 129083, - "total_submitted": 209337, - "total_column_articles": 1373, + "total_acs": 129531, + "total_submitted": 210001, + "total_column_articles": 1376, "frontend_question_id": "304", "is_new_question": false }, @@ -60891,9 +61248,9 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 224377, - "total_submitted": 291658, - "total_column_articles": 2227, + "total_acs": 225122, + "total_submitted": 292529, + "total_column_articles": 2230, "frontend_question_id": "303", "is_new_question": false }, @@ -60912,8 +61269,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 3912, - "total_submitted": 5809, + "total_acs": 3922, + "total_submitted": 5822, "total_column_articles": 67, "frontend_question_id": "302", "is_new_question": false @@ -60933,9 +61290,9 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 99934, - "total_submitted": 181020, - "total_column_articles": 594, + "total_acs": 100322, + "total_submitted": 181698, + "total_column_articles": 596, "frontend_question_id": "301", "is_new_question": false }, @@ -60954,9 +61311,9 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 769723, - "total_submitted": 1402006, - "total_column_articles": 4398, + "total_acs": 775440, + "total_submitted": 1411469, + "total_column_articles": 4418, "frontend_question_id": "300", "is_new_question": false }, @@ -60975,8 +61332,8 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 84001, - "total_submitted": 146224, + "total_acs": 84169, + "total_submitted": 146499, "total_column_articles": 900, "frontend_question_id": "299", "is_new_question": false @@ -60996,8 +61353,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 10434, - "total_submitted": 17407, + "total_acs": 10537, + "total_submitted": 17551, "total_column_articles": 151, "frontend_question_id": "298", "is_new_question": false @@ -61017,9 +61374,9 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 220677, - "total_submitted": 374613, - "total_column_articles": 1372, + "total_acs": 221492, + "total_submitted": 375842, + "total_column_articles": 1375, "frontend_question_id": "297", "is_new_question": false }, @@ -61038,8 +61395,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 4378, - "total_submitted": 7166, + "total_acs": 4393, + "total_submitted": 7189, "total_column_articles": 67, "frontend_question_id": "296", "is_new_question": false @@ -61059,9 +61416,9 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 112185, - "total_submitted": 209677, - "total_column_articles": 787, + "total_acs": 112994, + "total_submitted": 211061, + "total_column_articles": 793, "frontend_question_id": "295", "is_new_question": false }, @@ -61080,9 +61437,9 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 6586, - "total_submitted": 11072, - "total_column_articles": 88, + "total_acs": 6614, + "total_submitted": 11117, + "total_column_articles": 87, "frontend_question_id": "294", "is_new_question": false }, @@ -61101,8 +61458,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 8097, - "total_submitted": 11132, + "total_acs": 8108, + "total_submitted": 11152, "total_column_articles": 125, "frontend_question_id": "293", "is_new_question": false @@ -61122,9 +61479,9 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 162183, - "total_submitted": 230273, - "total_column_articles": 1087, + "total_acs": 162593, + "total_submitted": 230863, + "total_column_articles": 1088, "frontend_question_id": "292", "is_new_question": false }, @@ -61143,8 +61500,8 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 5050, - "total_submitted": 9732, + "total_acs": 5062, + "total_submitted": 9780, "total_column_articles": 102, "frontend_question_id": "291", "is_new_question": false @@ -61164,9 +61521,9 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 138469, - "total_submitted": 310366, - "total_column_articles": 1731, + "total_acs": 139377, + "total_submitted": 312444, + "total_column_articles": 1734, "frontend_question_id": "290", "is_new_question": false }, @@ -61185,9 +61542,9 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 80175, - "total_submitted": 105728, - "total_column_articles": 1146, + "total_acs": 80734, + "total_submitted": 106437, + "total_column_articles": 1148, "frontend_question_id": "289", "is_new_question": false }, @@ -61206,8 +61563,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 6427, - "total_submitted": 13011, + "total_acs": 6442, + "total_submitted": 13037, "total_column_articles": 87, "frontend_question_id": "288", "is_new_question": false @@ -61227,9 +61584,9 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 327933, - "total_submitted": 510857, - "total_column_articles": 2030, + "total_acs": 329565, + "total_submitted": 513449, + "total_column_articles": 2039, "frontend_question_id": "287", "is_new_question": false }, @@ -61248,9 +61605,9 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 19699, - "total_submitted": 35832, - "total_column_articles": 239, + "total_acs": 19792, + "total_submitted": 35969, + "total_column_articles": 241, "frontend_question_id": "286", "is_new_question": false }, @@ -61269,9 +61626,9 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 15923, - "total_submitted": 24707, - "total_column_articles": 175, + "total_acs": 15972, + "total_submitted": 24792, + "total_column_articles": 176, "frontend_question_id": "285", "is_new_question": false }, @@ -61290,8 +61647,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 32891, - "total_submitted": 42983, + "total_acs": 32962, + "total_submitted": 43084, "total_column_articles": 260, "frontend_question_id": "284", "is_new_question": false @@ -61311,9 +61668,9 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 1107102, - "total_submitted": 1736111, - "total_column_articles": 6628, + "total_acs": 1114833, + "total_submitted": 1748382, + "total_column_articles": 6668, "frontend_question_id": "283", "is_new_question": false }, @@ -61332,9 +61689,9 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 26876, - "total_submitted": 57386, - "total_column_articles": 215, + "total_acs": 26933, + "total_submitted": 57532, + "total_column_articles": 216, "frontend_question_id": "282", "is_new_question": false }, @@ -61353,9 +61710,9 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 6063, - "total_submitted": 7894, - "total_column_articles": 132, + "total_acs": 6101, + "total_submitted": 7943, + "total_column_articles": 133, "frontend_question_id": "281", "is_new_question": false }, @@ -61374,9 +61731,9 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 12498, - "total_submitted": 18116, - "total_column_articles": 125, + "total_acs": 12611, + "total_submitted": 18265, + "total_column_articles": 127, "frontend_question_id": "280", "is_new_question": false }, @@ -61395,9 +61752,9 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 423305, - "total_submitted": 638919, - "total_column_articles": 2059, + "total_acs": 426745, + "total_submitted": 643832, + "total_column_articles": 2063, "frontend_question_id": "279", "is_new_question": false }, @@ -61416,9 +61773,9 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 474198, - "total_submitted": 1045235, - "total_column_articles": 2551, + "total_acs": 474918, + "total_submitted": 1046529, + "total_column_articles": 2555, "frontend_question_id": "278", "is_new_question": false }, @@ -61437,9 +61794,9 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 14962, - "total_submitted": 25884, - "total_column_articles": 143, + "total_acs": 15058, + "total_submitted": 26060, + "total_column_articles": 145, "frontend_question_id": "277", "is_new_question": false }, @@ -61458,9 +61815,9 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 11402, - "total_submitted": 21158, - "total_column_articles": 197, + "total_acs": 11485, + "total_submitted": 21276, + "total_column_articles": 200, "frontend_question_id": "276", "is_new_question": false }, @@ -61479,9 +61836,9 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 70735, - "total_submitted": 156870, - "total_column_articles": 559, + "total_acs": 70924, + "total_submitted": 157347, + "total_column_articles": 562, "frontend_question_id": "275", "is_new_question": false }, @@ -61500,9 +61857,9 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 86423, - "total_submitted": 194014, - "total_column_articles": 835, + "total_acs": 88540, + "total_submitted": 198504, + "total_column_articles": 849, "frontend_question_id": "274", "is_new_question": false }, @@ -61521,9 +61878,9 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 38398, - "total_submitted": 105275, - "total_column_articles": 446, + "total_acs": 38496, + "total_submitted": 105486, + "total_column_articles": 445, "frontend_question_id": "273", "is_new_question": false }, @@ -61542,9 +61899,9 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 6865, - "total_submitted": 10393, - "total_column_articles": 132, + "total_acs": 6928, + "total_submitted": 10476, + "total_column_articles": 133, "frontend_question_id": "272", "is_new_question": false }, @@ -61563,9 +61920,9 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 5449, - "total_submitted": 9392, - "total_column_articles": 76, + "total_acs": 5490, + "total_submitted": 9445, + "total_column_articles": 77, "frontend_question_id": "271", "is_new_question": false }, @@ -61584,9 +61941,9 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 18655, - "total_submitted": 33282, - "total_column_articles": 210, + "total_acs": 18725, + "total_submitted": 33479, + "total_column_articles": 211, "frontend_question_id": "270", "is_new_question": false }, @@ -61605,9 +61962,9 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 12773, - "total_submitted": 34836, - "total_column_articles": 185, + "total_acs": 12870, + "total_submitted": 35032, + "total_column_articles": 187, "frontend_question_id": "269", "is_new_question": false }, @@ -61626,9 +61983,9 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 315048, - "total_submitted": 474547, - "total_column_articles": 2342, + "total_acs": 316307, + "total_submitted": 476252, + "total_column_articles": 2350, "frontend_question_id": "268", "is_new_question": false }, @@ -61647,8 +62004,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 6353, - "total_submitted": 13563, + "total_acs": 6362, + "total_submitted": 13587, "total_column_articles": 132, "frontend_question_id": "267", "is_new_question": false @@ -61668,9 +62025,9 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 13160, - "total_submitted": 18645, - "total_column_articles": 192, + "total_acs": 13260, + "total_submitted": 18765, + "total_column_articles": 191, "frontend_question_id": "266", "is_new_question": false }, @@ -61689,9 +62046,9 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 14064, - "total_submitted": 22075, - "total_column_articles": 269, + "total_acs": 14153, + "total_submitted": 22195, + "total_column_articles": 270, "frontend_question_id": "265", "is_new_question": false }, @@ -61710,9 +62067,9 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 161216, - "total_submitted": 275192, - "total_column_articles": 970, + "total_acs": 161707, + "total_submitted": 276101, + "total_column_articles": 975, "frontend_question_id": "264", "is_new_question": false }, @@ -61731,9 +62088,9 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 160684, - "total_submitted": 318229, - "total_column_articles": 1166, + "total_acs": 161520, + "total_submitted": 319964, + "total_column_articles": 1168, "frontend_question_id": "263", "is_new_question": false }, @@ -61752,9 +62109,9 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 68781, - "total_submitted": 165916, - "total_column_articles": 645, + "total_acs": 69117, + "total_submitted": 166870, + "total_column_articles": 649, "frontend_question_id": "262", "is_new_question": false }, @@ -61773,9 +62130,9 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 18472, - "total_submitted": 36197, - "total_column_articles": 236, + "total_acs": 18547, + "total_submitted": 36348, + "total_column_articles": 238, "frontend_question_id": "261", "is_new_question": false }, @@ -61794,9 +62151,9 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 114988, - "total_submitted": 160152, - "total_column_articles": 961, + "total_acs": 115425, + "total_submitted": 160857, + "total_column_articles": 966, "frontend_question_id": "260", "is_new_question": false }, @@ -61815,8 +62172,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 13032, - "total_submitted": 23677, + "total_acs": 13054, + "total_submitted": 23706, "total_column_articles": 142, "frontend_question_id": "259", "is_new_question": false @@ -61836,9 +62193,9 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 170123, - "total_submitted": 239880, - "total_column_articles": 1424, + "total_acs": 171023, + "total_submitted": 241300, + "total_column_articles": 1427, "frontend_question_id": "258", "is_new_question": false }, @@ -61857,9 +62214,9 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 330475, - "total_submitted": 467574, - "total_column_articles": 2024, + "total_acs": 332864, + "total_submitted": 470832, + "total_column_articles": 2030, "frontend_question_id": "257", "is_new_question": false }, @@ -61878,8 +62235,8 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 21978, - "total_submitted": 31353, + "total_acs": 22098, + "total_submitted": 31491, "total_column_articles": 318, "frontend_question_id": "256", "is_new_question": false @@ -61899,9 +62256,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": 10174, - "total_submitted": 20530, - "total_column_articles": 118, + "total_acs": 10248, + "total_submitted": 20691, + "total_column_articles": 119, "frontend_question_id": "255", "is_new_question": false }, @@ -61920,8 +62277,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 10919, - "total_submitted": 19121, + "total_acs": 10976, + "total_submitted": 19200, "total_column_articles": 141, "frontend_question_id": "254", "is_new_question": false @@ -61941,9 +62298,9 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 66164, - "total_submitted": 126670, - "total_column_articles": 597, + "total_acs": 66370, + "total_submitted": 127025, + "total_column_articles": 596, "frontend_question_id": "253", "is_new_question": false }, @@ -61962,9 +62319,9 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 24744, - "total_submitted": 42780, - "total_column_articles": 245, + "total_acs": 24867, + "total_submitted": 42982, + "total_column_articles": 244, "frontend_question_id": "252", "is_new_question": false }, @@ -61983,8 +62340,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 7261, - "total_submitted": 13234, + "total_acs": 7276, + "total_submitted": 13262, "total_column_articles": 112, "frontend_question_id": "251", "is_new_question": false @@ -62004,9 +62361,9 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 8653, - "total_submitted": 13589, - "total_column_articles": 164, + "total_acs": 8728, + "total_submitted": 13682, + "total_column_articles": 166, "frontend_question_id": "250", "is_new_question": false }, @@ -62025,9 +62382,9 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 11495, - "total_submitted": 17684, - "total_column_articles": 186, + "total_acs": 11582, + "total_submitted": 17798, + "total_column_articles": 188, "frontend_question_id": "249", "is_new_question": false }, @@ -62046,8 +62403,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 4501, - "total_submitted": 9154, + "total_acs": 4510, + "total_submitted": 9173, "total_column_articles": 84, "frontend_question_id": "248", "is_new_question": false @@ -62067,9 +62424,9 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 8982, - "total_submitted": 16444, - "total_column_articles": 136, + "total_acs": 9042, + "total_submitted": 16562, + "total_column_articles": 137, "frontend_question_id": "247", "is_new_question": false }, @@ -62088,8 +62445,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 10815, - "total_submitted": 22786, + "total_acs": 10842, + "total_submitted": 22834, "total_column_articles": 176, "frontend_question_id": "246", "is_new_question": false @@ -62109,8 +62466,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 7689, - "total_submitted": 13409, + "total_acs": 7695, + "total_submitted": 13418, "total_column_articles": 90, "frontend_question_id": "245", "is_new_question": false @@ -62130,8 +62487,8 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 9992, - "total_submitted": 16715, + "total_acs": 10013, + "total_submitted": 16749, "total_column_articles": 110, "frontend_question_id": "244", "is_new_question": false @@ -62151,8 +62508,8 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 16051, - "total_submitted": 24008, + "total_acs": 16082, + "total_submitted": 24056, "total_column_articles": 185, "frontend_question_id": "243", "is_new_question": false @@ -62172,9 +62529,9 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 635958, - "total_submitted": 965364, - "total_column_articles": 3530, + "total_acs": 640238, + "total_submitted": 971551, + "total_column_articles": 3549, "frontend_question_id": "242", "is_new_question": false }, @@ -62193,9 +62550,9 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 78359, - "total_submitted": 103650, - "total_column_articles": 766, + "total_acs": 78552, + "total_submitted": 103902, + "total_column_articles": 774, "frontend_question_id": "241", "is_new_question": false }, @@ -62214,9 +62571,9 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 383523, - "total_submitted": 724809, - "total_column_articles": 1780, + "total_acs": 385667, + "total_submitted": 728373, + "total_column_articles": 1782, "frontend_question_id": "240", "is_new_question": false }, @@ -62235,9 +62592,9 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 471595, - "total_submitted": 951573, - "total_column_articles": 3442, + "total_acs": 475529, + "total_submitted": 959913, + "total_column_articles": 3474, "frontend_question_id": "239", "is_new_question": false }, @@ -62256,9 +62613,9 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 293679, - "total_submitted": 391893, - "total_column_articles": 1783, + "total_acs": 298104, + "total_submitted": 397853, + "total_column_articles": 1801, "frontend_question_id": "238", "is_new_question": false }, @@ -62277,9 +62634,9 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 348468, - "total_submitted": 404568, - "total_column_articles": 1768, + "total_acs": 349223, + "total_submitted": 405394, + "total_column_articles": 1769, "frontend_question_id": "237", "is_new_question": false }, @@ -62298,9 +62655,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": 571113, - "total_submitted": 817852, - "total_column_articles": 2861, + "total_acs": 575457, + "total_submitted": 823406, + "total_column_articles": 2874, "frontend_question_id": "236", "is_new_question": false }, @@ -62319,9 +62676,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": 357343, - "total_submitted": 521772, - "total_column_articles": 1894, + "total_acs": 359290, + "total_submitted": 524153, + "total_column_articles": 1899, "frontend_question_id": "235", "is_new_question": false }, @@ -62340,9 +62697,9 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 618525, - "total_submitted": 1157951, - "total_column_articles": 3603, + "total_acs": 622289, + "total_submitted": 1163968, + "total_column_articles": 3615, "frontend_question_id": "234", "is_new_question": false }, @@ -62361,9 +62718,9 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 56678, - "total_submitted": 115286, - "total_column_articles": 636, + "total_acs": 56906, + "total_submitted": 115727, + "total_column_articles": 639, "frontend_question_id": "233", "is_new_question": false }, @@ -62382,9 +62739,9 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 372120, - "total_submitted": 545346, - "total_column_articles": 2413, + "total_acs": 374660, + "total_submitted": 549202, + "total_column_articles": 2417, "frontend_question_id": "232", "is_new_question": false }, @@ -62403,9 +62760,9 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 300249, - "total_submitted": 600265, - "total_column_articles": 2138, + "total_acs": 301517, + "total_submitted": 602795, + "total_column_articles": 2143, "frontend_question_id": "231", "is_new_question": false }, @@ -62424,9 +62781,9 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 279666, - "total_submitted": 367404, - "total_column_articles": 1851, + "total_acs": 281791, + "total_submitted": 369987, + "total_column_articles": 1863, "frontend_question_id": "230", "is_new_question": false }, @@ -62445,9 +62802,9 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 97967, - "total_submitted": 181256, - "total_column_articles": 862, + "total_acs": 98229, + "total_submitted": 181770, + "total_column_articles": 864, "frontend_question_id": "229", "is_new_question": false }, @@ -62466,9 +62823,9 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 98764, - "total_submitted": 181562, - "total_column_articles": 1078, + "total_acs": 99721, + "total_submitted": 183472, + "total_column_articles": 1081, "frontend_question_id": "228", "is_new_question": false }, @@ -62487,9 +62844,9 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 152868, - "total_submitted": 343400, - "total_column_articles": 1114, + "total_acs": 153440, + "total_submitted": 344551, + "total_column_articles": 1120, "frontend_question_id": "227", "is_new_question": false }, @@ -62508,9 +62865,9 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 708146, - "total_submitted": 889619, - "total_column_articles": 4332, + "total_acs": 714005, + "total_submitted": 896641, + "total_column_articles": 4367, "frontend_question_id": "226", "is_new_question": false }, @@ -62529,9 +62886,9 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 301976, - "total_submitted": 457665, - "total_column_articles": 5607, + "total_acs": 304353, + "total_submitted": 461658, + "total_column_articles": 5608, "frontend_question_id": "225", "is_new_question": false }, @@ -62550,9 +62907,9 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 120887, - "total_submitted": 284715, - "total_column_articles": 1035, + "total_acs": 121565, + "total_submitted": 286079, + "total_column_articles": 1043, "frontend_question_id": "224", "is_new_question": false }, @@ -62571,9 +62928,9 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 58777, - "total_submitted": 109171, - "total_column_articles": 651, + "total_acs": 59001, + "total_submitted": 109544, + "total_column_articles": 653, "frontend_question_id": "223", "is_new_question": false }, @@ -62592,9 +62949,9 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 306150, - "total_submitted": 377852, - "total_column_articles": 1816, + "total_acs": 308819, + "total_submitted": 381058, + "total_column_articles": 1827, "frontend_question_id": "222", "is_new_question": false }, @@ -62613,9 +62970,9 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 280580, - "total_submitted": 564315, - "total_column_articles": 1715, + "total_acs": 282161, + "total_submitted": 567035, + "total_column_articles": 1717, "frontend_question_id": "221", "is_new_question": false }, @@ -62634,9 +62991,9 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 95669, - "total_submitted": 317618, - "total_column_articles": 637, + "total_acs": 96046, + "total_submitted": 318261, + "total_column_articles": 638, "frontend_question_id": "220", "is_new_question": false }, @@ -62655,9 +63012,9 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 241811, - "total_submitted": 544747, - "total_column_articles": 1848, + "total_acs": 243407, + "total_submitted": 547607, + "total_column_articles": 1855, "frontend_question_id": "219", "is_new_question": false }, @@ -62676,9 +63033,9 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 50311, - "total_submitted": 91206, - "total_column_articles": 445, + "total_acs": 50526, + "total_submitted": 91694, + "total_column_articles": 446, "frontend_question_id": "218", "is_new_question": false }, @@ -62697,9 +63054,9 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 810946, - "total_submitted": 1478141, - "total_column_articles": 3772, + "total_acs": 812653, + "total_submitted": 1480713, + "total_column_articles": 3782, "frontend_question_id": "217", "is_new_question": false }, @@ -62718,9 +63075,9 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 288660, - "total_submitted": 404206, - "total_column_articles": 1998, + "total_acs": 291728, + "total_submitted": 408511, + "total_column_articles": 2007, "frontend_question_id": "216", "is_new_question": false }, @@ -62739,9 +63096,9 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 900996, - "total_submitted": 1415790, - "total_column_articles": 4134, + "total_acs": 906681, + "total_submitted": 1425849, + "total_column_articles": 4152, "frontend_question_id": "215", "is_new_question": false }, @@ -62760,9 +63117,9 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 47122, - "total_submitted": 117727, - "total_column_articles": 481, + "total_acs": 47427, + "total_submitted": 118314, + "total_column_articles": 482, "frontend_question_id": "214", "is_new_question": false }, @@ -62781,9 +63138,9 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 353055, - "total_submitted": 799113, - "total_column_articles": 2749, + "total_acs": 355886, + "total_submitted": 805060, + "total_column_articles": 2764, "frontend_question_id": "213", "is_new_question": false }, @@ -62802,9 +63159,9 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 93591, - "total_submitted": 213654, - "total_column_articles": 756, + "total_acs": 94016, + "total_submitted": 214675, + "total_column_articles": 760, "frontend_question_id": "212", "is_new_question": false }, @@ -62823,9 +63180,9 @@ "question__title": "Design Add and Search Words Data Structure", "question__title_slug": "design-add-and-search-words-data-structure", "question__hide": false, - "total_acs": 74964, - "total_submitted": 151104, - "total_column_articles": 757, + "total_acs": 75317, + "total_submitted": 151760, + "total_column_articles": 763, "frontend_question_id": "211", "is_new_question": false }, @@ -62844,9 +63201,9 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 184892, - "total_submitted": 326052, - "total_column_articles": 1358, + "total_acs": 185902, + "total_submitted": 327752, + "total_column_articles": 1363, "frontend_question_id": "210", "is_new_question": false }, @@ -62865,9 +63222,9 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 584084, - "total_submitted": 1253460, - "total_column_articles": 3553, + "total_acs": 589735, + "total_submitted": 1265648, + "total_column_articles": 3563, "frontend_question_id": "209", "is_new_question": false }, @@ -62886,9 +63243,9 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 275555, - "total_submitted": 383166, - "total_column_articles": 1685, + "total_acs": 277101, + "total_submitted": 385267, + "total_column_articles": 1693, "frontend_question_id": "208", "is_new_question": false }, @@ -62907,9 +63264,9 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 314122, - "total_submitted": 586402, - "total_column_articles": 2238, + "total_acs": 316327, + "total_submitted": 590343, + "total_column_articles": 2246, "frontend_question_id": "207", "is_new_question": false }, @@ -62928,9 +63285,9 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 1562133, - "total_submitted": 2123323, - "total_column_articles": 11737, + "total_acs": 1573155, + "total_submitted": 2137672, + "total_column_articles": 11761, "frontend_question_id": "206", "is_new_question": false }, @@ -62949,9 +63306,9 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 211567, - "total_submitted": 426293, - "total_column_articles": 1582, + "total_acs": 213067, + "total_submitted": 429325, + "total_column_articles": 1589, "frontend_question_id": "205", "is_new_question": false }, @@ -62970,9 +63327,9 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 256582, - "total_submitted": 687885, - "total_column_articles": 1110, + "total_acs": 257307, + "total_submitted": 690048, + "total_column_articles": 1112, "frontend_question_id": "204", "is_new_question": false }, @@ -62991,9 +63348,9 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 595110, - "total_submitted": 1080406, - "total_column_articles": 3334, + "total_acs": 599565, + "total_submitted": 1087172, + "total_column_articles": 3344, "frontend_question_id": "203", "is_new_question": false }, @@ -63012,9 +63369,9 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 406316, - "total_submitted": 641222, - "total_column_articles": 2890, + "total_acs": 409585, + "total_submitted": 646162, + "total_column_articles": 2906, "frontend_question_id": "202", "is_new_question": false }, @@ -63033,9 +63390,9 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 77159, - "total_submitted": 142732, - "total_column_articles": 522, + "total_acs": 77431, + "total_submitted": 143223, + "total_column_articles": 524, "frontend_question_id": "201", "is_new_question": false }, @@ -63054,9 +63411,9 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 681179, - "total_submitted": 1146964, - "total_column_articles": 4072, + "total_acs": 685774, + "total_submitted": 1154015, + "total_column_articles": 4086, "frontend_question_id": "200", "is_new_question": false }, @@ -63075,9 +63432,9 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 306303, - "total_submitted": 464077, - "total_column_articles": 2797, + "total_acs": 309742, + "total_submitted": 469042, + "total_column_articles": 2814, "frontend_question_id": "199", "is_new_question": false }, @@ -63096,9 +63453,9 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 784474, - "total_submitted": 1440548, - "total_column_articles": 4792, + "total_acs": 790617, + "total_submitted": 1451080, + "total_column_articles": 4808, "frontend_question_id": "198", "is_new_question": false }, @@ -63117,9 +63474,9 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 190384, - "total_submitted": 351952, - "total_column_articles": 1049, + "total_acs": 191897, + "total_submitted": 355034, + "total_column_articles": 1055, "frontend_question_id": "197", "is_new_question": false }, @@ -63138,9 +63495,9 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 221975, - "total_submitted": 325746, - "total_column_articles": 826, + "total_acs": 223213, + "total_submitted": 327948, + "total_column_articles": 831, "frontend_question_id": "196", "is_new_question": false }, @@ -63159,8 +63516,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 53481, - "total_submitted": 121757, + "total_acs": 53707, + "total_submitted": 122264, "total_column_articles": 207, "frontend_question_id": "195", "is_new_question": false @@ -63180,8 +63537,8 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 15753, - "total_submitted": 45943, + "total_acs": 15822, + "total_submitted": 46179, "total_column_articles": 106, "frontend_question_id": "194", "is_new_question": false @@ -63201,8 +63558,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 39991, - "total_submitted": 119683, + "total_acs": 40147, + "total_submitted": 120090, "total_column_articles": 201, "frontend_question_id": "193", "is_new_question": false @@ -63222,8 +63579,8 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 31623, - "total_submitted": 88718, + "total_acs": 31752, + "total_submitted": 89166, "total_column_articles": 236, "frontend_question_id": "192", "is_new_question": false @@ -63243,9 +63600,9 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 339039, - "total_submitted": 442688, - "total_column_articles": 2093, + "total_acs": 340012, + "total_submitted": 443852, + "total_column_articles": 2098, "frontend_question_id": "191", "is_new_question": false }, @@ -63264,9 +63621,9 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 217043, - "total_submitted": 301956, - "total_column_articles": 1323, + "total_acs": 217658, + "total_submitted": 302757, + "total_column_articles": 1326, "frontend_question_id": "190", "is_new_question": false }, @@ -63285,9 +63642,9 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 679795, - "total_submitted": 1536904, - "total_column_articles": 3368, + "total_acs": 685316, + "total_submitted": 1548694, + "total_column_articles": 3389, "frontend_question_id": "189", "is_new_question": false }, @@ -63306,9 +63663,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": 198719, - "total_submitted": 431491, - "total_column_articles": 1386, + "total_acs": 200290, + "total_submitted": 433741, + "total_column_articles": 1392, "frontend_question_id": "188", "is_new_question": false }, @@ -63327,9 +63684,9 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 140838, - "total_submitted": 263686, - "total_column_articles": 1016, + "total_acs": 141448, + "total_submitted": 264722, + "total_column_articles": 1018, "frontend_question_id": "187", "is_new_question": false }, @@ -63348,9 +63705,9 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 14465, - "total_submitted": 18924, - "total_column_articles": 194, + "total_acs": 14676, + "total_submitted": 19189, + "total_column_articles": 196, "frontend_question_id": "186", "is_new_question": false }, @@ -63369,9 +63726,9 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 126761, - "total_submitted": 238536, - "total_column_articles": 1050, + "total_acs": 127499, + "total_submitted": 239872, + "total_column_articles": 1056, "frontend_question_id": "185", "is_new_question": false }, @@ -63390,9 +63747,9 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 179348, - "total_submitted": 348590, - "total_column_articles": 1153, + "total_acs": 180524, + "total_submitted": 350813, + "total_column_articles": 1164, "frontend_question_id": "184", "is_new_question": false }, @@ -63411,9 +63768,9 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 345530, - "total_submitted": 521683, - "total_column_articles": 1159, + "total_acs": 347722, + "total_submitted": 525061, + "total_column_articles": 1161, "frontend_question_id": "183", "is_new_question": false }, @@ -63432,9 +63789,9 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 308087, - "total_submitted": 390516, - "total_column_articles": 1036, + "total_acs": 309301, + "total_submitted": 392165, + "total_column_articles": 1039, "frontend_question_id": "182", "is_new_question": false }, @@ -63453,9 +63810,9 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 286006, - "total_submitted": 417049, - "total_column_articles": 1140, + "total_acs": 287214, + "total_submitted": 418889, + "total_column_articles": 1144, "frontend_question_id": "181", "is_new_question": false }, @@ -63474,9 +63831,9 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 156981, - "total_submitted": 329472, - "total_column_articles": 903, + "total_acs": 157956, + "total_submitted": 331702, + "total_column_articles": 908, "frontend_question_id": "180", "is_new_question": false }, @@ -63495,9 +63852,9 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 204914, - "total_submitted": 499809, - "total_column_articles": 1465, + "total_acs": 205603, + "total_submitted": 501578, + "total_column_articles": 1468, "frontend_question_id": "179", "is_new_question": false }, @@ -63516,9 +63873,9 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 208380, - "total_submitted": 340557, - "total_column_articles": 1042, + "total_acs": 209690, + "total_submitted": 342492, + "total_column_articles": 1050, "frontend_question_id": "178", "is_new_question": false }, @@ -63537,9 +63894,9 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 215339, - "total_submitted": 460952, - "total_column_articles": 846, + "total_acs": 216627, + "total_submitted": 463880, + "total_column_articles": 857, "frontend_question_id": "177", "is_new_question": false }, @@ -63558,9 +63915,9 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 425894, - "total_submitted": 1163855, - "total_column_articles": 1731, + "total_acs": 427847, + "total_submitted": 1168567, + "total_column_articles": 1738, "frontend_question_id": "176", "is_new_question": false }, @@ -63579,9 +63936,9 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 512704, - "total_submitted": 691495, - "total_column_articles": 2193, + "total_acs": 514577, + "total_submitted": 693987, + "total_column_articles": 2199, "frontend_question_id": "175", "is_new_question": false }, @@ -63600,9 +63957,9 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 65396, - "total_submitted": 134198, - "total_column_articles": 1420, + "total_acs": 65702, + "total_submitted": 134901, + "total_column_articles": 1439, "frontend_question_id": "174", "is_new_question": false }, @@ -63621,9 +63978,9 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 117597, - "total_submitted": 144120, - "total_column_articles": 904, + "total_acs": 117985, + "total_submitted": 144595, + "total_column_articles": 905, "frontend_question_id": "173", "is_new_question": false }, @@ -63642,9 +63999,9 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 173467, - "total_submitted": 346398, - "total_column_articles": 1132, + "total_acs": 174016, + "total_submitted": 347497, + "total_column_articles": 1133, "frontend_question_id": "172", "is_new_question": false }, @@ -63663,9 +64020,9 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 167911, - "total_submitted": 235455, - "total_column_articles": 1363, + "total_acs": 168440, + "total_submitted": 236187, + "total_column_articles": 1367, "frontend_question_id": "171", "is_new_question": false }, @@ -63684,9 +64041,9 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 16641, - "total_submitted": 38949, - "total_column_articles": 157, + "total_acs": 16687, + "total_submitted": 39058, + "total_column_articles": 158, "frontend_question_id": "170", "is_new_question": false }, @@ -63705,9 +64062,9 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 727256, - "total_submitted": 1088448, - "total_column_articles": 3838, + "total_acs": 734500, + "total_submitted": 1099836, + "total_column_articles": 3863, "frontend_question_id": "169", "is_new_question": false }, @@ -63726,9 +64083,9 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 140647, - "total_submitted": 320427, - "total_column_articles": 1167, + "total_acs": 141141, + "total_submitted": 321342, + "total_column_articles": 1173, "frontend_question_id": "168", "is_new_question": false }, @@ -63747,9 +64104,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": 595545, - "total_submitted": 997176, - "total_column_articles": 3857, + "total_acs": 598002, + "total_submitted": 1000967, + "total_column_articles": 3865, "frontend_question_id": "167", "is_new_question": false }, @@ -63768,8 +64125,8 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 65097, - "total_submitted": 194625, + "total_acs": 65270, + "total_submitted": 195209, "total_column_articles": 536, "frontend_question_id": "166", "is_new_question": false @@ -63789,9 +64146,9 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 154766, - "total_submitted": 298548, - "total_column_articles": 1319, + "total_acs": 155507, + "total_submitted": 299930, + "total_column_articles": 1323, "frontend_question_id": "165", "is_new_question": false }, @@ -63810,9 +64167,9 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 84464, - "total_submitted": 140356, - "total_column_articles": 666, + "total_acs": 84773, + "total_submitted": 140955, + "total_column_articles": 667, "frontend_question_id": "164", "is_new_question": false }, @@ -63831,9 +64188,9 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 19407, - "total_submitted": 54409, - "total_column_articles": 264, + "total_acs": 19517, + "total_submitted": 54653, + "total_column_articles": 265, "frontend_question_id": "163", "is_new_question": false }, @@ -63852,9 +64209,9 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 315085, - "total_submitted": 639260, - "total_column_articles": 1988, + "total_acs": 316938, + "total_submitted": 642797, + "total_column_articles": 1996, "frontend_question_id": "162", "is_new_question": false }, @@ -63873,9 +64230,9 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 15184, - "total_submitted": 45022, - "total_column_articles": 197, + "total_acs": 15287, + "total_submitted": 45358, + "total_column_articles": 201, "frontend_question_id": "161", "is_new_question": false }, @@ -63894,9 +64251,9 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 697355, - "total_submitted": 1093294, - "total_column_articles": 3824, + "total_acs": 701898, + "total_submitted": 1099849, + "total_column_articles": 3835, "frontend_question_id": "160", "is_new_question": false }, @@ -63915,9 +64272,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": 32852, - "total_submitted": 59023, - "total_column_articles": 348, + "total_acs": 33036, + "total_submitted": 59326, + "total_column_articles": 351, "frontend_question_id": "159", "is_new_question": false }, @@ -63936,9 +64293,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": 5068, - "total_submitted": 8463, - "total_column_articles": 104, + "total_acs": 5087, + "total_submitted": 8484, + "total_column_articles": 105, "frontend_question_id": "158", "is_new_question": false }, @@ -63957,9 +64314,9 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 10252, - "total_submitted": 18853, - "total_column_articles": 135, + "total_acs": 10281, + "total_submitted": 18894, + "total_column_articles": 136, "frontend_question_id": "157", "is_new_question": false }, @@ -63978,9 +64335,9 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 13954, - "total_submitted": 19261, - "total_column_articles": 240, + "total_acs": 13999, + "total_submitted": 19319, + "total_column_articles": 242, "frontend_question_id": "156", "is_new_question": false }, @@ -63999,9 +64356,9 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 496170, - "total_submitted": 840118, - "total_column_articles": 2584, + "total_acs": 498551, + "total_submitted": 843788, + "total_column_articles": 2598, "frontend_question_id": "155", "is_new_question": false }, @@ -64020,9 +64377,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": 176511, - "total_submitted": 336421, - "total_column_articles": 1304, + "total_acs": 177122, + "total_submitted": 337588, + "total_column_articles": 1308, "frontend_question_id": "154", "is_new_question": false }, @@ -64041,9 +64398,9 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 384743, - "total_submitted": 674376, - "total_column_articles": 2502, + "total_acs": 387042, + "total_submitted": 678083, + "total_column_articles": 2506, "frontend_question_id": "153", "is_new_question": false }, @@ -64062,9 +64419,9 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 371745, - "total_submitted": 860673, - "total_column_articles": 2159, + "total_acs": 373591, + "total_submitted": 864814, + "total_column_articles": 2166, "frontend_question_id": "152", "is_new_question": false }, @@ -64083,9 +64440,9 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 424257, - "total_submitted": 814393, - "total_column_articles": 3179, + "total_acs": 429150, + "total_submitted": 821991, + "total_column_articles": 3200, "frontend_question_id": "151", "is_new_question": false }, @@ -64104,9 +64461,9 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 293777, - "total_submitted": 556611, - "total_column_articles": 2004, + "total_acs": 296189, + "total_submitted": 560499, + "total_column_articles": 2015, "frontend_question_id": "150", "is_new_question": false }, @@ -64125,9 +64482,9 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 81101, - "total_submitted": 205793, - "total_column_articles": 797, + "total_acs": 81391, + "total_submitted": 206341, + "total_column_articles": 799, "frontend_question_id": "149", "is_new_question": false }, @@ -64146,9 +64503,9 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 419844, - "total_submitted": 639388, - "total_column_articles": 2230, + "total_acs": 422767, + "total_submitted": 643759, + "total_column_articles": 2237, "frontend_question_id": "148", "is_new_question": false }, @@ -64167,9 +64524,9 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 152076, - "total_submitted": 218773, - "total_column_articles": 1120, + "total_acs": 152512, + "total_submitted": 219407, + "total_column_articles": 1123, "frontend_question_id": "147", "is_new_question": false }, @@ -64188,9 +64545,9 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 509154, - "total_submitted": 952229, - "total_column_articles": 3729, + "total_acs": 512963, + "total_submitted": 959488, + "total_column_articles": 3739, "frontend_question_id": "146", "is_new_question": false }, @@ -64209,9 +64566,9 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 655706, - "total_submitted": 859328, - "total_column_articles": 2764, + "total_acs": 659981, + "total_submitted": 864833, + "total_column_articles": 2774, "frontend_question_id": "145", "is_new_question": false }, @@ -64230,9 +64587,9 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 905155, - "total_submitted": 1269563, - "total_column_articles": 3623, + "total_acs": 911065, + "total_submitted": 1277378, + "total_column_articles": 3645, "frontend_question_id": "144", "is_new_question": false }, @@ -64251,9 +64608,9 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 279446, - "total_submitted": 425429, - "total_column_articles": 1992, + "total_acs": 280842, + "total_submitted": 427369, + "total_column_articles": 2001, "frontend_question_id": "143", "is_new_question": false }, @@ -64272,9 +64629,9 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 721524, - "total_submitted": 1255794, - "total_column_articles": 3988, + "total_acs": 727232, + "total_submitted": 1264553, + "total_column_articles": 4001, "frontend_question_id": "142", "is_new_question": false }, @@ -64293,9 +64650,9 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 1047936, - "total_submitted": 2024406, - "total_column_articles": 5187, + "total_acs": 1054132, + "total_submitted": 2035298, + "total_column_articles": 5209, "frontend_question_id": "141", "is_new_question": false }, @@ -64314,9 +64671,9 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 91088, - "total_submitted": 158611, - "total_column_articles": 1012, + "total_acs": 91478, + "total_submitted": 159061, + "total_column_articles": 1017, "frontend_question_id": "140", "is_new_question": false }, @@ -64335,9 +64692,9 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 466562, - "total_submitted": 859677, - "total_column_articles": 2536, + "total_acs": 470499, + "total_submitted": 866221, + "total_column_articles": 2550, "frontend_question_id": "139", "is_new_question": false }, @@ -64356,9 +64713,9 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 208169, - "total_submitted": 315296, - "total_column_articles": 1433, + "total_acs": 210076, + "total_submitted": 318264, + "total_column_articles": 1441, "frontend_question_id": "138", "is_new_question": false }, @@ -64377,9 +64734,9 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 156597, - "total_submitted": 218247, - "total_column_articles": 1102, + "total_acs": 157271, + "total_submitted": 219182, + "total_column_articles": 1108, "frontend_question_id": "137", "is_new_question": false }, @@ -64398,9 +64755,9 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 931976, - "total_submitted": 1287335, - "total_column_articles": 4130, + "total_acs": 935657, + "total_submitted": 1291829, + "total_column_articles": 4142, "frontend_question_id": "136", "is_new_question": false }, @@ -64419,9 +64776,9 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 236763, - "total_submitted": 469835, - "total_column_articles": 1589, + "total_acs": 238953, + "total_submitted": 474554, + "total_column_articles": 1599, "frontend_question_id": "135", "is_new_question": false }, @@ -64440,9 +64797,9 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 267900, - "total_submitted": 526591, - "total_column_articles": 1773, + "total_acs": 271150, + "total_submitted": 534538, + "total_column_articles": 1782, "frontend_question_id": "134", "is_new_question": false }, @@ -64461,9 +64818,9 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 120162, - "total_submitted": 174031, - "total_column_articles": 814, + "total_acs": 120949, + "total_submitted": 175067, + "total_column_articles": 818, "frontend_question_id": "133", "is_new_question": false }, @@ -64482,9 +64839,9 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 79427, - "total_submitted": 158994, - "total_column_articles": 628, + "total_acs": 79811, + "total_submitted": 159765, + "total_column_articles": 630, "frontend_question_id": "132", "is_new_question": false }, @@ -64503,9 +64860,9 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 312156, - "total_submitted": 425192, - "total_column_articles": 1774, + "total_acs": 315068, + "total_submitted": 429109, + "total_column_articles": 1784, "frontend_question_id": "131", "is_new_question": false }, @@ -64524,9 +64881,9 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 235955, - "total_submitted": 510029, - "total_column_articles": 2240, + "total_acs": 237056, + "total_submitted": 512383, + "total_column_articles": 2247, "frontend_question_id": "130", "is_new_question": false }, @@ -64545,9 +64902,9 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 220397, - "total_submitted": 314491, - "total_column_articles": 1800, + "total_acs": 221654, + "total_submitted": 316246, + "total_column_articles": 1805, "frontend_question_id": "129", "is_new_question": false }, @@ -64566,9 +64923,9 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 421251, - "total_submitted": 773827, - "total_column_articles": 2429, + "total_acs": 426235, + "total_submitted": 784055, + "total_column_articles": 2445, "frontend_question_id": "128", "is_new_question": false }, @@ -64587,9 +64944,9 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 189593, - "total_submitted": 392895, - "total_column_articles": 1024, + "total_acs": 190215, + "total_submitted": 394121, + "total_column_articles": 1028, "frontend_question_id": "127", "is_new_question": false }, @@ -64608,8 +64965,8 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 55253, - "total_submitted": 146606, + "total_acs": 55392, + "total_submitted": 147078, "total_column_articles": 499, "frontend_question_id": "126", "is_new_question": false @@ -64629,9 +64986,9 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 488585, - "total_submitted": 1052427, - "total_column_articles": 3024, + "total_acs": 491786, + "total_submitted": 1058858, + "total_column_articles": 3040, "frontend_question_id": "125", "is_new_question": false }, @@ -64650,9 +65007,9 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 336655, - "total_submitted": 743263, - "total_column_articles": 1993, + "total_acs": 339180, + "total_submitted": 748626, + "total_column_articles": 2004, "frontend_question_id": "124", "is_new_question": false }, @@ -64671,9 +65028,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": 269995, - "total_submitted": 457347, - "total_column_articles": 1509, + "total_acs": 271940, + "total_submitted": 460154, + "total_column_articles": 1515, "frontend_question_id": "123", "is_new_question": false }, @@ -64692,9 +65049,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": 901399, - "total_submitted": 1249575, - "total_column_articles": 4722, + "total_acs": 907553, + "total_submitted": 1257186, + "total_column_articles": 4749, "frontend_question_id": "122", "is_new_question": false }, @@ -64713,9 +65070,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": 1148606, - "total_submitted": 1981005, - "total_column_articles": 6273, + "total_acs": 1156917, + "total_submitted": 1996182, + "total_column_articles": 6309, "frontend_question_id": "121", "is_new_question": false }, @@ -64734,9 +65091,9 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 301167, - "total_submitted": 438704, - "total_column_articles": 2444, + "total_acs": 302480, + "total_submitted": 440588, + "total_column_articles": 2445, "frontend_question_id": "120", "is_new_question": false }, @@ -64755,9 +65112,9 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 277975, - "total_submitted": 403334, - "total_column_articles": 2091, + "total_acs": 279027, + "total_submitted": 404865, + "total_column_articles": 2096, "frontend_question_id": "119", "is_new_question": false }, @@ -64776,9 +65133,9 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 431770, - "total_submitted": 571838, - "total_column_articles": 3246, + "total_acs": 434138, + "total_submitted": 574894, + "total_column_articles": 3262, "frontend_question_id": "118", "is_new_question": false }, @@ -64797,9 +65154,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": 193367, - "total_submitted": 292831, - "total_column_articles": 1397, + "total_acs": 194601, + "total_submitted": 294430, + "total_column_articles": 1402, "frontend_question_id": "117", "is_new_question": false }, @@ -64818,9 +65175,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": 362129, - "total_submitted": 498420, - "total_column_articles": 2685, + "total_acs": 363831, + "total_submitted": 500590, + "total_column_articles": 2699, "frontend_question_id": "116", "is_new_question": false }, @@ -64839,9 +65196,9 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 146202, - "total_submitted": 280146, - "total_column_articles": 1282, + "total_acs": 147406, + "total_submitted": 282524, + "total_column_articles": 1294, "frontend_question_id": "115", "is_new_question": false }, @@ -64860,9 +65217,9 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 375758, - "total_submitted": 514332, - "total_column_articles": 2985, + "total_acs": 378365, + "total_submitted": 517815, + "total_column_articles": 3009, "frontend_question_id": "114", "is_new_question": false }, @@ -64881,9 +65238,9 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 359479, - "total_submitted": 568732, - "total_column_articles": 2242, + "total_acs": 361223, + "total_submitted": 571405, + "total_column_articles": 2249, "frontend_question_id": "113", "is_new_question": false }, @@ -64902,9 +65259,9 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 571207, - "total_submitted": 1066029, - "total_column_articles": 3173, + "total_acs": 574774, + "total_submitted": 1072245, + "total_column_articles": 3181, "frontend_question_id": "112", "is_new_question": false }, @@ -64923,9 +65280,9 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 585414, - "total_submitted": 1117230, - "total_column_articles": 3936, + "total_acs": 589532, + "total_submitted": 1123445, + "total_column_articles": 3949, "frontend_question_id": "111", "is_new_question": false }, @@ -64944,9 +65301,9 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 525821, - "total_submitted": 912941, - "total_column_articles": 2637, + "total_acs": 529027, + "total_submitted": 917824, + "total_column_articles": 2645, "frontend_question_id": "110", "is_new_question": false }, @@ -64965,9 +65322,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": 149255, - "total_submitted": 195192, - "total_column_articles": 1130, + "total_acs": 149716, + "total_submitted": 195792, + "total_column_articles": 1135, "frontend_question_id": "109", "is_new_question": false }, @@ -64986,9 +65343,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": 376952, - "total_submitted": 486119, - "total_column_articles": 2125, + "total_acs": 379821, + "total_submitted": 489625, + "total_column_articles": 2132, "frontend_question_id": "108", "is_new_question": false }, @@ -65007,9 +65364,9 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 282373, - "total_submitted": 388822, - "total_column_articles": 2001, + "total_acs": 283987, + "total_submitted": 390788, + "total_column_articles": 2006, "frontend_question_id": "107", "is_new_question": false }, @@ -65028,9 +65385,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": 298794, - "total_submitted": 414979, - "total_column_articles": 1763, + "total_acs": 301370, + "total_submitted": 418792, + "total_column_articles": 1770, "frontend_question_id": "106", "is_new_question": false }, @@ -65049,9 +65406,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": 518720, - "total_submitted": 728005, - "total_column_articles": 2666, + "total_acs": 522163, + "total_submitted": 732750, + "total_column_articles": 2677, "frontend_question_id": "105", "is_new_question": false }, @@ -65070,9 +65427,9 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 1071209, - "total_submitted": 1388743, - "total_column_articles": 5284, + "total_acs": 1079083, + "total_submitted": 1398842, + "total_column_articles": 5324, "frontend_question_id": "104", "is_new_question": false }, @@ -65091,9 +65448,9 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 314492, - "total_submitted": 546166, - "total_column_articles": 2502, + "total_acs": 316134, + "total_submitted": 548650, + "total_column_articles": 2509, "frontend_question_id": "103", "is_new_question": false }, @@ -65112,9 +65469,9 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 855644, - "total_submitted": 1301076, - "total_column_articles": 4580, + "total_acs": 861961, + "total_submitted": 1309696, + "total_column_articles": 4592, "frontend_question_id": "102", "is_new_question": false }, @@ -65133,9 +65490,9 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 873072, - "total_submitted": 1480930, - "total_column_articles": 4372, + "total_acs": 878834, + "total_submitted": 1489545, + "total_column_articles": 4389, "frontend_question_id": "101", "is_new_question": false }, @@ -65154,9 +65511,9 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 477162, - "total_submitted": 794273, - "total_column_articles": 3189, + "total_acs": 479915, + "total_submitted": 798236, + "total_column_articles": 3199, "frontend_question_id": "100", "is_new_question": false }, @@ -65175,9 +65532,9 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 139146, - "total_submitted": 230895, - "total_column_articles": 1098, + "total_acs": 139682, + "total_submitted": 231672, + "total_column_articles": 1103, "frontend_question_id": "99", "is_new_question": false }, @@ -65196,9 +65553,9 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 756951, - "total_submitted": 2039707, - "total_column_articles": 4119, + "total_acs": 762193, + "total_submitted": 2052086, + "total_column_articles": 4156, "frontend_question_id": "98", "is_new_question": false }, @@ -65217,9 +65574,9 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 120185, - "total_submitted": 269227, - "total_column_articles": 904, + "total_acs": 120945, + "total_submitted": 270903, + "total_column_articles": 910, "frontend_question_id": "97", "is_new_question": false }, @@ -65238,9 +65595,9 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 384183, - "total_submitted": 542141, - "total_column_articles": 2538, + "total_acs": 386654, + "total_submitted": 545517, + "total_column_articles": 2548, "frontend_question_id": "96", "is_new_question": false }, @@ -65259,8 +65616,8 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 172915, - "total_submitted": 235260, + "total_acs": 173575, + "total_submitted": 236146, "total_column_articles": 1075, "frontend_question_id": "95", "is_new_question": false @@ -65280,9 +65637,9 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1209684, - "total_submitted": 1586601, - "total_column_articles": 4352, + "total_acs": 1217634, + "total_submitted": 1596740, + "total_column_articles": 4367, "frontend_question_id": "94", "is_new_question": false }, @@ -65301,9 +65658,9 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 354494, - "total_submitted": 609161, - "total_column_articles": 2519, + "total_acs": 356896, + "total_submitted": 612703, + "total_column_articles": 2537, "frontend_question_id": "93", "is_new_question": false }, @@ -65322,9 +65679,9 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 418303, - "total_submitted": 750703, - "total_column_articles": 3795, + "total_acs": 421355, + "total_submitted": 755958, + "total_column_articles": 3808, "frontend_question_id": "92", "is_new_question": false }, @@ -65343,9 +65700,9 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 277516, - "total_submitted": 835371, - "total_column_articles": 2329, + "total_acs": 278337, + "total_submitted": 837799, + "total_column_articles": 2330, "frontend_question_id": "91", "is_new_question": false }, @@ -65364,9 +65721,9 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 315026, - "total_submitted": 495506, - "total_column_articles": 2304, + "total_acs": 317054, + "total_submitted": 498719, + "total_column_articles": 2312, "frontend_question_id": "90", "is_new_question": false }, @@ -65385,8 +65742,8 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 120478, - "total_submitted": 159541, + "total_acs": 120800, + "total_submitted": 159967, "total_column_articles": 913, "frontend_question_id": "89", "is_new_question": false @@ -65406,9 +65763,9 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 947372, - "total_submitted": 1804648, - "total_column_articles": 6223, + "total_acs": 976539, + "total_submitted": 1849256, + "total_column_articles": 6357, "frontend_question_id": "88", "is_new_question": false }, @@ -65427,9 +65784,9 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 58724, - "total_submitted": 124169, - "total_column_articles": 449, + "total_acs": 58857, + "total_submitted": 124487, + "total_column_articles": 450, "frontend_question_id": "87", "is_new_question": false }, @@ -65448,9 +65805,9 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 227309, - "total_submitted": 353908, - "total_column_articles": 2172, + "total_acs": 228883, + "total_submitted": 356251, + "total_column_articles": 2175, "frontend_question_id": "86", "is_new_question": false }, @@ -65469,9 +65826,9 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 180999, - "total_submitted": 330562, - "total_column_articles": 1205, + "total_acs": 181639, + "total_submitted": 331722, + "total_column_articles": 1208, "frontend_question_id": "85", "is_new_question": false }, @@ -65490,9 +65847,9 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 356669, - "total_submitted": 791249, - "total_column_articles": 2014, + "total_acs": 358596, + "total_submitted": 795226, + "total_column_articles": 2020, "frontend_question_id": "84", "is_new_question": false }, @@ -65511,9 +65868,9 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 598798, - "total_submitted": 1127564, - "total_column_articles": 3684, + "total_acs": 601563, + "total_submitted": 1132440, + "total_column_articles": 3686, "frontend_question_id": "83", "is_new_question": false }, @@ -65532,9 +65889,9 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 352677, - "total_submitted": 658748, - "total_column_articles": 2832, + "total_acs": 354485, + "total_submitted": 662082, + "total_column_articles": 2837, "frontend_question_id": "82", "is_new_question": false }, @@ -65553,9 +65910,9 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 201807, - "total_submitted": 492609, - "total_column_articles": 1476, + "total_acs": 202477, + "total_submitted": 494102, + "total_column_articles": 1477, "frontend_question_id": "81", "is_new_question": false }, @@ -65574,9 +65931,9 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 250838, - "total_submitted": 406806, - "total_column_articles": 2037, + "total_acs": 255554, + "total_submitted": 414538, + "total_column_articles": 2062, "frontend_question_id": "80", "is_new_question": false }, @@ -65595,9 +65952,9 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 443918, - "total_submitted": 959366, - "total_column_articles": 2644, + "total_acs": 446169, + "total_submitted": 963896, + "total_column_articles": 2652, "frontend_question_id": "79", "is_new_question": false }, @@ -65616,9 +65973,9 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 658116, - "total_submitted": 811075, - "total_column_articles": 4363, + "total_acs": 662532, + "total_submitted": 816531, + "total_column_articles": 4379, "frontend_question_id": "78", "is_new_question": false }, @@ -65637,9 +65994,9 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 571438, - "total_submitted": 741391, - "total_column_articles": 2969, + "total_acs": 576611, + "total_submitted": 748035, + "total_column_articles": 2973, "frontend_question_id": "77", "is_new_question": false }, @@ -65658,9 +66015,9 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 448013, - "total_submitted": 990210, - "total_column_articles": 3521, + "total_acs": 451460, + "total_submitted": 997176, + "total_column_articles": 3536, "frontend_question_id": "76", "is_new_question": false }, @@ -65679,9 +66036,9 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 555143, - "total_submitted": 917631, - "total_column_articles": 3637, + "total_acs": 557635, + "total_submitted": 921456, + "total_column_articles": 3649, "frontend_question_id": "75", "is_new_question": false }, @@ -65700,9 +66057,9 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 323793, - "total_submitted": 663377, - "total_column_articles": 2997, + "total_acs": 325875, + "total_submitted": 667274, + "total_column_articles": 3004, "frontend_question_id": "74", "is_new_question": false }, @@ -65721,9 +66078,9 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 265147, - "total_submitted": 417809, - "total_column_articles": 1862, + "total_acs": 267471, + "total_submitted": 420804, + "total_column_articles": 1870, "frontend_question_id": "73", "is_new_question": false }, @@ -65742,9 +66099,9 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 387689, - "total_submitted": 617509, - "total_column_articles": 3182, + "total_acs": 390666, + "total_submitted": 621972, + "total_column_articles": 3203, "frontend_question_id": "72", "is_new_question": false }, @@ -65763,9 +66120,9 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 189453, - "total_submitted": 428564, - "total_column_articles": 1674, + "total_acs": 190539, + "total_submitted": 430684, + "total_column_articles": 1682, "frontend_question_id": "71", "is_new_question": false }, @@ -65784,9 +66141,9 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 1207094, - "total_submitted": 2232117, - "total_column_articles": 6434, + "total_acs": 1215011, + "total_submitted": 2245996, + "total_column_articles": 6459, "frontend_question_id": "70", "is_new_question": false }, @@ -65805,9 +66162,9 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 768989, - "total_submitted": 2001954, - "total_column_articles": 3841, + "total_acs": 772947, + "total_submitted": 2011868, + "total_column_articles": 3853, "frontend_question_id": "69", "is_new_question": false }, @@ -65826,9 +66183,9 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 56970, - "total_submitted": 108720, - "total_column_articles": 820, + "total_acs": 57446, + "total_submitted": 109551, + "total_column_articles": 821, "frontend_question_id": "68", "is_new_question": false }, @@ -65847,9 +66204,9 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 337090, - "total_submitted": 636972, - "total_column_articles": 2995, + "total_acs": 338783, + "total_submitted": 640222, + "total_column_articles": 3013, "frontend_question_id": "67", "is_new_question": false }, @@ -65868,9 +66225,9 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 652785, - "total_submitted": 1446323, - "total_column_articles": 5763, + "total_acs": 655429, + "total_submitted": 1451532, + "total_column_articles": 5787, "frontend_question_id": "66", "is_new_question": false }, @@ -65889,9 +66246,9 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 66888, - "total_submitted": 242045, - "total_column_articles": 933, + "total_acs": 67063, + "total_submitted": 242781, + "total_column_articles": 938, "frontend_question_id": "65", "is_new_question": false }, @@ -65910,9 +66267,9 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 504181, - "total_submitted": 724519, - "total_column_articles": 3453, + "total_acs": 506924, + "total_submitted": 728225, + "total_column_articles": 3463, "frontend_question_id": "64", "is_new_question": false }, @@ -65931,9 +66288,9 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 395513, - "total_submitted": 961585, - "total_column_articles": 3050, + "total_acs": 398904, + "total_submitted": 969297, + "total_column_articles": 3065, "frontend_question_id": "63", "is_new_question": false }, @@ -65952,9 +66309,9 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 652968, - "total_submitted": 962609, - "total_column_articles": 4287, + "total_acs": 657518, + "total_submitted": 969159, + "total_column_articles": 4304, "frontend_question_id": "62", "is_new_question": false }, @@ -65973,9 +66330,9 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 325790, - "total_submitted": 787404, - "total_column_articles": 3121, + "total_acs": 327247, + "total_submitted": 791053, + "total_column_articles": 3127, "frontend_question_id": "61", "is_new_question": false }, @@ -65994,9 +66351,9 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 131155, - "total_submitted": 245324, - "total_column_articles": 1447, + "total_acs": 131507, + "total_submitted": 245898, + "total_column_articles": 1449, "frontend_question_id": "60", "is_new_question": false }, @@ -66015,9 +66372,9 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 340405, - "total_submitted": 469878, - "total_column_articles": 3532, + "total_acs": 343089, + "total_submitted": 473987, + "total_column_articles": 3542, "frontend_question_id": "59", "is_new_question": false }, @@ -66036,9 +66393,9 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 453736, - "total_submitted": 1053876, - "total_column_articles": 4744, + "total_acs": 457139, + "total_submitted": 1059575, + "total_column_articles": 4772, "frontend_question_id": "58", "is_new_question": false }, @@ -66057,9 +66414,9 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 151193, - "total_submitted": 360428, - "total_column_articles": 1441, + "total_acs": 152110, + "total_submitted": 362490, + "total_column_articles": 1447, "frontend_question_id": "57", "is_new_question": false }, @@ -66078,9 +66435,9 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 669747, - "total_submitted": 1355712, - "total_column_articles": 4302, + "total_acs": 674853, + "total_submitted": 1365838, + "total_column_articles": 4317, "frontend_question_id": "56", "is_new_question": false }, @@ -66099,9 +66456,9 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 747380, - "total_submitted": 1716465, - "total_column_articles": 5024, + "total_acs": 754108, + "total_submitted": 1732394, + "total_column_articles": 5069, "frontend_question_id": "55", "is_new_question": false }, @@ -66120,9 +66477,9 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 391392, - "total_submitted": 791319, - "total_column_articles": 3980, + "total_acs": 394802, + "total_submitted": 797400, + "total_column_articles": 4011, "frontend_question_id": "54", "is_new_question": false }, @@ -66141,9 +66498,9 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 1458870, - "total_submitted": 2659441, - "total_column_articles": 7002, + "total_acs": 1466425, + "total_submitted": 2672410, + "total_column_articles": 7021, "frontend_question_id": "53", "is_new_question": false }, @@ -66162,9 +66519,9 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 125058, - "total_submitted": 151848, - "total_column_articles": 952, + "total_acs": 125849, + "total_submitted": 152773, + "total_column_articles": 953, "frontend_question_id": "52", "is_new_question": false }, @@ -66183,9 +66540,9 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 324116, - "total_submitted": 437586, - "total_column_articles": 3070, + "total_acs": 326510, + "total_submitted": 440932, + "total_column_articles": 3074, "frontend_question_id": "51", "is_new_question": false }, @@ -66204,9 +66561,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 389036, - "total_submitted": 1024698, - "total_column_articles": 2152, + "total_acs": 391032, + "total_submitted": 1029855, + "total_column_articles": 2164, "frontend_question_id": "50", "is_new_question": false }, @@ -66225,9 +66582,9 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 497134, - "total_submitted": 732750, - "total_column_articles": 2683, + "total_acs": 501785, + "total_submitted": 739612, + "total_column_articles": 2698, "frontend_question_id": "49", "is_new_question": false }, @@ -66246,9 +66603,9 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 472526, - "total_submitted": 631446, - "total_column_articles": 4569, + "total_acs": 475377, + "total_submitted": 635007, + "total_column_articles": 4585, "frontend_question_id": "48", "is_new_question": false }, @@ -66267,9 +66624,9 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 477639, - "total_submitted": 728389, - "total_column_articles": 2920, + "total_acs": 480337, + "total_submitted": 732540, + "total_column_articles": 2935, "frontend_question_id": "47", "is_new_question": false }, @@ -66288,9 +66645,9 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 905293, - "total_submitted": 1147170, - "total_column_articles": 5899, + "total_acs": 910808, + "total_submitted": 1153976, + "total_column_articles": 5921, "frontend_question_id": "46", "is_new_question": false }, @@ -66309,9 +66666,9 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 525234, - "total_submitted": 1165223, - "total_column_articles": 3466, + "total_acs": 530794, + "total_submitted": 1177803, + "total_column_articles": 3484, "frontend_question_id": "45", "is_new_question": false }, @@ -66330,9 +66687,9 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 141427, - "total_submitted": 418158, - "total_column_articles": 919, + "total_acs": 141954, + "total_submitted": 419638, + "total_column_articles": 924, "frontend_question_id": "44", "is_new_question": false }, @@ -66351,9 +66708,9 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 308041, - "total_submitted": 694430, - "total_column_articles": 2100, + "total_acs": 309313, + "total_submitted": 697301, + "total_column_articles": 2110, "frontend_question_id": "43", "is_new_question": false }, @@ -66372,9 +66729,9 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 741161, - "total_submitted": 1176082, - "total_column_articles": 4569, + "total_acs": 747716, + "total_submitted": 1185948, + "total_column_articles": 4603, "frontend_question_id": "42", "is_new_question": false }, @@ -66393,9 +66750,9 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 309162, - "total_submitted": 715911, - "total_column_articles": 2237, + "total_acs": 311243, + "total_submitted": 719920, + "total_column_articles": 2246, "frontend_question_id": "41", "is_new_question": false }, @@ -66414,9 +66771,9 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 450907, - "total_submitted": 756145, - "total_column_articles": 2781, + "total_acs": 453838, + "total_submitted": 761080, + "total_column_articles": 2795, "frontend_question_id": "40", "is_new_question": false }, @@ -66435,9 +66792,9 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 772575, - "total_submitted": 1068182, - "total_column_articles": 3981, + "total_acs": 777738, + "total_submitted": 1075159, + "total_column_articles": 4001, "frontend_question_id": "39", "is_new_question": false }, @@ -66456,9 +66813,9 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 346033, - "total_submitted": 573015, - "total_column_articles": 3304, + "total_acs": 346847, + "total_submitted": 574146, + "total_column_articles": 3309, "frontend_question_id": "38", "is_new_question": false }, @@ -66477,9 +66834,9 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 215763, - "total_submitted": 319359, - "total_column_articles": 1618, + "total_acs": 216855, + "total_submitted": 320953, + "total_column_articles": 1619, "frontend_question_id": "37", "is_new_question": false }, @@ -66498,9 +66855,9 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 384331, - "total_submitted": 609868, - "total_column_articles": 2684, + "total_acs": 385832, + "total_submitted": 612233, + "total_column_articles": 2690, "frontend_question_id": "36", "is_new_question": false }, @@ -66519,9 +66876,9 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 1205912, - "total_submitted": 2672921, - "total_column_articles": 7743, + "total_acs": 1212410, + "total_submitted": 2685373, + "total_column_articles": 7762, "frontend_question_id": "35", "is_new_question": false }, @@ -66540,9 +66897,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": 829724, - "total_submitted": 1954579, - "total_column_articles": 7632, + "total_acs": 834718, + "total_submitted": 1965021, + "total_column_articles": 7663, "frontend_question_id": "34", "is_new_question": false }, @@ -66561,9 +66918,9 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 761109, - "total_submitted": 1736300, - "total_column_articles": 4714, + "total_acs": 765092, + "total_submitted": 1744577, + "total_column_articles": 4721, "frontend_question_id": "33", "is_new_question": false }, @@ -66582,9 +66939,9 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 387527, - "total_submitted": 1039900, - "total_column_articles": 2345, + "total_acs": 389782, + "total_submitted": 1044907, + "total_column_articles": 2356, "frontend_question_id": "32", "is_new_question": false }, @@ -66603,9 +66960,9 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 447901, - "total_submitted": 1166407, - "total_column_articles": 3265, + "total_acs": 450282, + "total_submitted": 1171550, + "total_column_articles": 3281, "frontend_question_id": "31", "is_new_question": false }, @@ -66624,9 +66981,9 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 169052, - "total_submitted": 427439, - "total_column_articles": 1328, + "total_acs": 170157, + "total_submitted": 430266, + "total_column_articles": 1332, "frontend_question_id": "30", "is_new_question": false }, @@ -66645,9 +67002,9 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 215172, - "total_submitted": 968855, - "total_column_articles": 1588, + "total_acs": 216022, + "total_submitted": 972233, + "total_column_articles": 1592, "frontend_question_id": "29", "is_new_question": false }, @@ -66666,9 +67023,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": 883837, - "total_submitted": 2073641, - "total_column_articles": 5984, + "total_acs": 889673, + "total_submitted": 2085624, + "total_column_articles": 6004, "frontend_question_id": "28", "is_new_question": false }, @@ -66687,9 +67044,9 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 1134735, - "total_submitted": 1919029, - "total_column_articles": 8175, + "total_acs": 1147516, + "total_submitted": 1940921, + "total_column_articles": 8224, "frontend_question_id": "27", "is_new_question": false }, @@ -66708,9 +67065,9 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 1549257, - "total_submitted": 2821475, - "total_column_articles": 8705, + "total_acs": 1559540, + "total_submitted": 2837463, + "total_column_articles": 8754, "frontend_question_id": "26", "is_new_question": false }, @@ -66729,9 +67086,9 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 486640, - "total_submitted": 719380, - "total_column_articles": 3997, + "total_acs": 490134, + "total_submitted": 724378, + "total_column_articles": 4016, "frontend_question_id": "25", "is_new_question": false }, @@ -66750,9 +67107,9 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 684807, - "total_submitted": 956218, - "total_column_articles": 4777, + "total_acs": 690345, + "total_submitted": 963605, + "total_column_articles": 4801, "frontend_question_id": "24", "is_new_question": false }, @@ -66771,9 +67128,9 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 674820, - "total_submitted": 1164630, - "total_column_articles": 4376, + "total_acs": 694115, + "total_submitted": 1190761, + "total_column_articles": 4489, "frontend_question_id": "23", "is_new_question": false }, @@ -66792,9 +67149,9 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 726610, - "total_submitted": 938066, - "total_column_articles": 4816, + "total_acs": 730569, + "total_submitted": 943126, + "total_column_articles": 4839, "frontend_question_id": "22", "is_new_question": false }, @@ -66813,9 +67170,9 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 1454410, - "total_submitted": 2193934, - "total_column_articles": 7466, + "total_acs": 1462398, + "total_submitted": 2205664, + "total_column_articles": 7488, "frontend_question_id": "21", "is_new_question": false }, @@ -66834,9 +67191,9 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 1547898, - "total_submitted": 3518666, - "total_column_articles": 9888, + "total_acs": 1556480, + "total_submitted": 3538155, + "total_column_articles": 9915, "frontend_question_id": "20", "is_new_question": false }, @@ -66855,9 +67212,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": 1184674, - "total_submitted": 2582755, - "total_column_articles": 8114, + "total_acs": 1192352, + "total_submitted": 2595174, + "total_column_articles": 8139, "frontend_question_id": "19", "is_new_question": false }, @@ -66876,9 +67233,9 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 494425, - "total_submitted": 1342253, - "total_column_articles": 3024, + "total_acs": 497903, + "total_submitted": 1352155, + "total_column_articles": 3034, "frontend_question_id": "18", "is_new_question": false }, @@ -66897,9 +67254,9 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 730078, - "total_submitted": 1255250, - "total_column_articles": 5660, + "total_acs": 735004, + "total_submitted": 1262629, + "total_column_articles": 5680, "frontend_question_id": "17", "is_new_question": false }, @@ -66918,9 +67275,9 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 503466, - "total_submitted": 1118215, - "total_column_articles": 2609, + "total_acs": 505604, + "total_submitted": 1123292, + "total_column_articles": 2617, "frontend_question_id": "16", "is_new_question": false }, @@ -66939,9 +67296,9 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 1456817, - "total_submitted": 3911718, - "total_column_articles": 6139, + "total_acs": 1467315, + "total_submitted": 3936979, + "total_column_articles": 6171, "frontend_question_id": "15", "is_new_question": false }, @@ -66960,9 +67317,9 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 1132248, - "total_submitted": 2606335, - "total_column_articles": 6864, + "total_acs": 1137678, + "total_submitted": 2617994, + "total_column_articles": 6891, "frontend_question_id": "14", "is_new_question": false }, @@ -66981,9 +67338,9 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 861029, - "total_submitted": 1388184, - "total_column_articles": 6814, + "total_acs": 865442, + "total_submitted": 1394570, + "total_column_articles": 6846, "frontend_question_id": "13", "is_new_question": false }, @@ -67002,9 +67359,9 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 400267, - "total_submitted": 604963, - "total_column_articles": 3082, + "total_acs": 402547, + "total_submitted": 608038, + "total_column_articles": 3093, "frontend_question_id": "12", "is_new_question": false }, @@ -67023,9 +67380,9 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 1036524, - "total_submitted": 1722450, - "total_column_articles": 5659, + "total_acs": 1043703, + "total_submitted": 1734803, + "total_column_articles": 5692, "frontend_question_id": "11", "is_new_question": false }, @@ -67044,9 +67401,9 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 380675, - "total_submitted": 1239429, - "total_column_articles": 2239, + "total_acs": 382115, + "total_submitted": 1244034, + "total_column_articles": 2244, "frontend_question_id": "10", "is_new_question": false }, @@ -67065,9 +67422,9 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 1419522, - "total_submitted": 2538616, - "total_column_articles": 8574, + "total_acs": 1425850, + "total_submitted": 2549730, + "total_column_articles": 8597, "frontend_question_id": "9", "is_new_question": false }, @@ -67086,9 +67443,9 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 590164, - "total_submitted": 2780525, - "total_column_articles": 4360, + "total_acs": 592334, + "total_submitted": 2790561, + "total_column_articles": 4371, "frontend_question_id": "8", "is_new_question": false }, @@ -67107,9 +67464,9 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 1219655, - "total_submitted": 3446394, - "total_column_articles": 7313, + "total_acs": 1222517, + "total_submitted": 3453956, + "total_column_articles": 7319, "frontend_question_id": "7", "is_new_question": false }, @@ -67128,9 +67485,9 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 585083, - "total_submitted": 1123283, - "total_column_articles": 4723, + "total_acs": 587793, + "total_submitted": 1127991, + "total_column_articles": 4734, "frontend_question_id": "6", "is_new_question": false }, @@ -67149,9 +67506,9 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1481030, - "total_submitted": 3930099, - "total_column_articles": 7826, + "total_acs": 1489175, + "total_submitted": 3949323, + "total_column_articles": 7851, "frontend_question_id": "5", "is_new_question": false }, @@ -67170,9 +67527,9 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 987177, - "total_submitted": 2375461, - "total_column_articles": 7080, + "total_acs": 991592, + "total_submitted": 2384939, + "total_column_articles": 7107, "frontend_question_id": "4", "is_new_question": false }, @@ -67191,9 +67548,9 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 2439877, - "total_submitted": 6230704, - "total_column_articles": 14065, + "total_acs": 2453090, + "total_submitted": 6261844, + "total_column_articles": 14115, "frontend_question_id": "3", "is_new_question": false }, @@ -67212,9 +67569,9 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 1824416, - "total_submitted": 4279347, - "total_column_articles": 12427, + "total_acs": 1832494, + "total_submitted": 4295327, + "total_column_articles": 12463, "frontend_question_id": "2", "is_new_question": false }, @@ -67233,9 +67590,9 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 4690272, - "total_submitted": 8859374, - "total_column_articles": 22357, + "total_acs": 4714012, + "total_submitted": 8902030, + "total_column_articles": 22418, "frontend_question_id": "1", "is_new_question": false }, diff --git a/leetcode-cn/originData/[no content]deep-object-filter.json b/leetcode-cn/originData/[no content]deep-object-filter.json new file mode 100644 index 00000000..807cb9ec --- /dev/null +++ b/leetcode-cn/originData/[no content]deep-object-filter.json @@ -0,0 +1,46 @@ +{ + "data": { + "question": { + "questionId": "2912", + "questionFrontendId": "2823", + "categoryTitle": "JavaScript", + "boundTopicId": 2393590, + "title": "Deep Object Filter", + "titleSlug": "deep-object-filter", + "content": null, + "translatedTitle": "深度对象筛选", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"15\", \"totalSubmission\": \"42\", \"totalAcceptedRaw\": 15, \"totalSubmissionRaw\": 42, \"acRate\": \"35.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[-5,-4,-3,-2,-1,0,1]\n(x) => x > 0", + "metaData": "{\n \"name\": \"deepFilter\",\n \"params\": [\n {\n \"name\": \"obj\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"fn\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"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>\"],\"typescript\":[\"TypeScript\",\"

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

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[-5,-4,-3,-2,-1,0,1]\n(x) => x > 0\n{\"a\":1,\"b\":\"2\",\"c\":3,\"d\":\"4\",\"e\":5,\"f\":6,\"g\":{\"a\":1}}\n(x) => typeof x === \"string\"\n[-1,[-1,-1,5,-1,10],-1,[-1],[-5]]\n(x) => x > 0\n[[[[5]]]]\n(x) => Array.isArray(x)", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]delay-the-resolution-of-each-promise.json b/leetcode-cn/originData/[no content]delay-the-resolution-of-each-promise.json new file mode 100644 index 00000000..bb063856 --- /dev/null +++ b/leetcode-cn/originData/[no content]delay-the-resolution-of-each-promise.json @@ -0,0 +1,46 @@ +{ + "data": { + "question": { + "questionId": "2909", + "questionFrontendId": "2821", + "categoryTitle": "JavaScript", + "boundTopicId": 2393591, + "title": "Delay the Resolution of Each Promise", + "titleSlug": "delay-the-resolution-of-each-promise", + "content": null, + "translatedTitle": "延迟每个 Promise 对象的解析", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"23\", \"totalSubmission\": \"33\", \"totalAcceptedRaw\": 23, \"totalSubmissionRaw\": 33, \"acRate\": \"69.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[() => new Promise((resolve) => setTimeout(resolve, 30))]\n50", + "metaData": "{\n \"name\": \"delayAll\",\n \"params\": [\n {\n \"name\": \"functions\",\n \"type\": \"string\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"ms\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"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>\"],\"typescript\":[\"TypeScript\",\"

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

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[() => new Promise((resolve) => setTimeout(resolve, 30))]\n50\n[() => new Promise((resolve) => setTimeout(resolve, 50)),() => new Promise((resolve) => setTimeout(resolve, 80))]\n70", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]election-results.json b/leetcode-cn/originData/[no content]election-results.json new file mode 100644 index 00000000..321d6b94 --- /dev/null +++ b/leetcode-cn/originData/[no content]election-results.json @@ -0,0 +1,59 @@ +{ + "data": { + "question": { + "questionId": "3078", + "questionFrontendId": "2820", + "categoryTitle": "Database", + "boundTopicId": 2392746, + "title": "Election Results", + "titleSlug": "election-results", + "content": null, + "translatedTitle": "选举结果", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"28\", \"totalSubmission\": \"36\", \"totalAcceptedRaw\": 28, \"totalSubmissionRaw\": 36, \"acRate\": \"77.8%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Votes\":[\"voter\",\"candidate\"]},\"rows\":{\"Votes\":[[\"Kathy\",null],[\"Charles\",\"Ryan\"],[\"Charles\",\"Christine\"],[\"Charles\",\"Kathy\"],[\"Benjamin\",\"Christine\"],[\"Anthony\",\"Ryan\"],[\"Edward\",\"Ryan\"],[\"Terry\",null],[\"Evelyn\",\"Kathy\"],[\"Arthur\",\"Christine\"]]}}", + "metaData": "{\"mysql\":[\"Create table if not exists Votes(voter varchar(30), candidate varchar(30))\"],\"mssql\":[\"Create table Votes(voter varchar(30),candidate varchar(30))\"],\"oraclesql\":[\"Create table Votes(voter varchar(30),candidate varchar(30))\"],\"database\":true,\"languages\":[\"mysql\",\"mssql\",\"oraclesql\"],\"database_schema\":{\"Votes\":{\"voter\":\"VARCHAR(30)\",\"candidate\":\"VARCHAR(30)\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table if not exists Votes(voter varchar(30), candidate varchar(30))", + "Truncate table Votes", + "insert into Votes (voter, candidate) values ('Kathy', 'None')", + "insert into Votes (voter, candidate) values ('Charles', 'Ryan')", + "insert into Votes (voter, candidate) values ('Charles', 'Christine')", + "insert into Votes (voter, candidate) values ('Charles', 'Kathy')", + "insert into Votes (voter, candidate) values ('Benjamin', 'Christine')", + "insert into Votes (voter, candidate) values ('Anthony', 'Ryan')", + "insert into Votes (voter, candidate) values ('Edward', 'Ryan')", + "insert into Votes (voter, candidate) values ('Terry', 'None')", + "insert into Votes (voter, candidate) values ('Evelyn', 'Kathy')", + "insert into Votes (voter, candidate) values ('Arthur', 'Christine')" + ], + "enableRunCode": true, + "envInfo": "{\"mysql\":[\"MySQL\",\"

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

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

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

Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "{\"headers\":{\"Votes\":[\"voter\",\"candidate\"]},\"rows\":{\"Votes\":[[\"Kathy\",null],[\"Charles\",\"Ryan\"],[\"Charles\",\"Christine\"],[\"Charles\",\"Kathy\"],[\"Benjamin\",\"Christine\"],[\"Anthony\",\"Ryan\"],[\"Edward\",\"Ryan\"],[\"Terry\",null],[\"Evelyn\",\"Kathy\"],[\"Arthur\",\"Christine\"]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]inversion-of-object.json b/leetcode-cn/originData/[no content]inversion-of-object.json new file mode 100644 index 00000000..cccc1f93 --- /dev/null +++ b/leetcode-cn/originData/[no content]inversion-of-object.json @@ -0,0 +1,46 @@ +{ + "data": { + "question": { + "questionId": "2925", + "questionFrontendId": "2822", + "categoryTitle": "JavaScript", + "boundTopicId": 2393589, + "title": "Inversion of Object", + "titleSlug": "inversion-of-object", + "content": null, + "translatedTitle": "对象反转", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"23\", \"totalSubmission\": \"33\", \"totalAcceptedRaw\": 23, \"totalSubmissionRaw\": 33, \"acRate\": \"69.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"a\": \"1\",\"b\": \"2\",\"c\": \"3\",\"d\": \"4\" }", + "metaData": "{\n \"name\": \"invertObject\",\n \"params\": [\n {\n \"name\": \"obj\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"typescript\",\n \"javascript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"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>\"],\"typescript\":[\"TypeScript\",\"

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

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.3.0<\\/a> \\u548c datastructures-js\\/queue@4.2.1<\\/a>\\u3002<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "{\"a\": \"1\",\"b\": \"2\",\"c\": \"3\",\"d\": \"4\" }\n{\"a\": \"1\",\"b\": \"2\",\"c\": \"2\",\"d\": \"4\" }\n[\"1\",\"2\",\"3\",\"4\"]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]minimum-relative-loss-after-buying-chocolates.json b/leetcode-cn/originData/[no content]minimum-relative-loss-after-buying-chocolates.json new file mode 100644 index 00000000..52f9b379 --- /dev/null +++ b/leetcode-cn/originData/[no content]minimum-relative-loss-after-buying-chocolates.json @@ -0,0 +1,52 @@ +{ + "data": { + "question": { + "questionId": "3077", + "questionFrontendId": "2819", + "categoryTitle": "Algorithms", + "boundTopicId": 2392948, + "title": "Minimum Relative Loss After Buying Chocolates", + "titleSlug": "minimum-relative-loss-after-buying-chocolates", + "content": null, + "translatedTitle": "购买巧克力后的最小相对损失", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"11\", \"totalSubmission\": \"15\", \"totalAcceptedRaw\": 11, \"totalSubmissionRaw\": 15, \"acRate\": \"73.3%\"}", + "hints": [ + "

First sort prices.
", + "
For one query, imagine mi is 1. It can be shown that Bob should select either the first one (the cheapest one) or the last one (the most expensive).
", + "
Now if mi > 1, separate the chocolates into two parts. The first part is chocolates having a price less than or equal to k, the rest would be in the second part.
", + "
Knowing how many chocolates Bob should pick from the first part is sufficient. Of course, Bob should select a prefix from this part and a suffix from the second part.
", + "
To find the number of chocolates from the first part, do a binary search on the first part.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,9,22,10,19]\n[[18,4],[5,2]]", + "metaData": "{\n \"name\": \"minimumRelativeLosses\",\n \"params\": [\n {\n \"name\": \"prices\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"queries\"\n }\n ],\n \"return\": {\n \"type\": \"long[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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,9,22,10,19]\n[[18,4],[5,2]]\n[1,5,4,3,7,11,9]\n[[5,4],[5,7],[7,3],[4,5]]\n[5,6,7]\n[[10,1],[5,3],[3,3]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/apply-operations-to-maximize-score.json b/leetcode-cn/originData/apply-operations-to-maximize-score.json new file mode 100644 index 00000000..d5f1fcee --- /dev/null +++ b/leetcode-cn/originData/apply-operations-to-maximize-score.json @@ -0,0 +1,205 @@ +{ + "data": { + "question": { + "questionId": "3001", + "questionFrontendId": "2818", + "categoryTitle": "Algorithms", + "boundTopicId": 2383019, + "title": "Apply Operations to Maximize Score", + "titleSlug": "apply-operations-to-maximize-score", + "content": "

You are given an array nums of n positive integers and an integer k.

\n\n

Initially, you start with a score of 1. You have to maximize your score by applying the following operation at most k times:

\n\n
    \n\t
  • Choose any non-empty subarray nums[l, ..., r] that you haven't chosen previously.
  • \n\t
  • Choose an element x of nums[l, ..., r] with the highest prime score. If multiple such elements exist, choose the one with the smallest index.
  • \n\t
  • Multiply your score by x.
  • \n
\n\n

Here, nums[l, ..., r] denotes the subarray of nums starting at index l and ending at the index r, both ends being inclusive.

\n\n

The prime score of an integer x is equal to the number of distinct prime factors of x. For example, the prime score of 300 is 3 since 300 = 2 * 2 * 3 * 5 * 5.

\n\n

Return the maximum possible score after applying at most k operations.

\n\n

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

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [8,3,9,3,8], k = 2\nOutput: 81\nExplanation: To get a score of 81, we can apply the following operations:\n- Choose subarray nums[2, ..., 2]. nums[2] is the only element in this subarray. Hence, we multiply the score by nums[2]. The score becomes 1 * 9 = 9.\n- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 1, but nums[2] has the smaller index. Hence, we multiply the score by nums[2]. The score becomes 9 * 9 = 81.\nIt can be proven that 81 is the highest score one can obtain.
\n\n

Example 2:

\n\n
\nInput: nums = [19,12,14,6,10,18], k = 3\nOutput: 4788\nExplanation: To get a score of 4788, we can apply the following operations: \n- Choose subarray nums[0, ..., 0]. nums[0] is the only element in this subarray. Hence, we multiply the score by nums[0]. The score becomes 1 * 19 = 19.\n- Choose subarray nums[5, ..., 5]. nums[5] is the only element in this subarray. Hence, we multiply the score by nums[5]. The score becomes 19 * 18 = 342.\n- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 2, but nums[2] has the smaller index. Hence, we multipy the score by nums[2]. The score becomes 342 * 14 = 4788.\nIt can be proven that 4788 is the highest score one can obtain.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length == n <= 105
  • \n\t
  • 1 <= nums[i] <= 105
  • \n\t
  • 1 <= k <= min(n * (n + 1) / 2, 109)
  • \n
\n", + "translatedTitle": "操作使得分最大", + "translatedContent": "

给你一个长度为 n 的正整数数组 nums 和一个整数 k 。

\n\n

一开始,你的分数为 1 。你可以进行以下操作至多 k 次,目标是使你的分数最大:

\n\n
    \n\t
  • 选择一个之前没有选过的 非空 子数组 nums[l, ..., r] 。
  • \n\t
  • 从 nums[l, ..., r] 里面选择一个 质数分数 最高的元素 x 。如果多个元素质数分数相同且最高,选择下标最小的一个。
  • \n\t
  • 将你的分数乘以 x 。
  • \n
\n\n

nums[l, ..., r] 表示 nums 中起始下标为 l ,结束下标为 r 的子数组,两个端点都包含。

\n\n

一个整数的 质数分数 等于 x 不同质因子的数目。比方说, 300 的质数分数为 3 ,因为 300 = 2 * 2 * 3 * 5 * 5 。

\n\n

请你返回进行至多 k 次操作后,可以得到的 最大分数 。

\n\n

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

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [8,3,9,3,8], k = 2\n输出:81\n解释:进行以下操作可以得到分数 81 :\n- 选择子数组 nums[2, ..., 2] 。nums[2] 是子数组中唯一的元素。所以我们将分数乘以 nums[2] ,分数变为 1 * 9 = 9 。\n- 选择子数组 nums[2, ..., 3] 。nums[2] 和 nums[3] 质数分数都为 1 ,但是 nums[2] 下标更小。所以我们将分数乘以 nums[2] ,分数变为 9 * 9 = 81 。\n81 是可以得到的最高得分。
\n\n

示例 2:

\n\n
\n输入:nums = [19,12,14,6,10,18], k = 3\n输出:4788\n解释:进行以下操作可以得到分数 4788 :\n- 选择子数组 nums[0, ..., 0] 。nums[0] 是子数组中唯一的元素。所以我们将分数乘以 nums[0] ,分数变为 1 * 19 = 19 。\n- 选择子数组 nums[5, ..., 5] 。nums[5] 是子数组中唯一的元素。所以我们将分数乘以 nums[5] ,分数变为 19 * 18 = 342 。\n- 选择子数组 nums[2, ..., 3] 。nums[2] 和 nums[3] 质数分数都为 2,但是 nums[2] 下标更小。所以我们将分数乘以 nums[2] ,分数变为  342 * 14 = 4788 。\n4788 是可以得到的最高的分。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length == n <= 105
  • \n\t
  • 1 <= nums[i] <= 105
  • \n\t
  • 1 <= k <= min(n * (n + 1) / 2, 109)
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 23, + "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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [ + { + "name": "Stack", + "slug": "stack", + "translatedName": "栈", + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": "贪心", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": "数学", + "__typename": "TopicTagNode" + }, + { + "name": "Number Theory", + "slug": "number-theory", + "translatedName": "数论", + "__typename": "TopicTagNode" + }, + { + "name": "Monotonic Stack", + "slug": "monotonic-stack", + "translatedName": "单调栈", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maximumScore(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maximumScore(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumScore(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 maximumScore(self, nums: List[int], k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int maximumScore(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaximumScore(IList 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 maximumScore = function(nums, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef maximum_score(nums, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumScore(_ nums: [Int], _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumScore(nums []int, k int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumScore(nums: List[Int], k: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumScore(nums: List, k: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximum_score(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 maximumScore($nums, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumScore(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximum-score nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximum_score(Nums :: [integer()], K :: integer()) -> integer().\nmaximum_score(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximum_score(nums :: [integer], k :: integer) :: integer\n def maximum_score(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maximumScore(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 2451, \"totalSubmissionRaw\": 6132, \"acRate\": \"40.0%\"}", + "hints": [ + "
Calculate nums[i]'s prime score s[i] by factoring in O(sqrt(nums[i])) time.
", + "
For each nums[i], find the nearest index left[i] on the left (if any) such that s[left[i]] >= s[i]. if none is found, set left[i] to -1. Similarly, find the nearest index right[i] on the right (if any) such that s[right[i]] > s[i]. If none is found, set right[i] to n.
", + "
Use a monotonic stack to compute right[i] and left[i].
", + "
For each index i, if left[i] + 1 <= l <= i <= r <= right[i] - 1, then s[i] is the maximum value in the range [l, r]. For this particular i, there are ranges[i] = (i - left[i]) * (right[i] - i) ranges where index i will be chosen.
", + "
Loop over all elements of nums by non-increasing prime score, each element will be chosen min(ranges[i], remainingK) times, where reaminingK denotes the number of remaining operations. Therefore, the score will be multiplied by s[i]^min(ranges[i],remainingK).
", + "
Use fast exponentiation to quickly calculate A^B mod C.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[8,3,9,3,8]\n2", + "metaData": "{\n \"name\": \"maximumScore\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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": "[8,3,9,3,8]\n2\n[19,12,14,6,10,18]\n3", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/check-if-a-string-is-an-acronym-of-words.json b/leetcode-cn/originData/check-if-a-string-is-an-acronym-of-words.json new file mode 100644 index 00000000..d96e0d3a --- /dev/null +++ b/leetcode-cn/originData/check-if-a-string-is-an-acronym-of-words.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "2977", + "questionFrontendId": "7004", + "categoryTitle": "Algorithms", + "boundTopicId": 2392179, + "title": "Check if a String Is an Acronym of Words", + "titleSlug": "check-if-a-string-is-an-acronym-of-words", + "content": "

Given an array of strings words and a string s, determine if s is an acronym of words.

\n\n

The string s is considered an acronym of words if it can be formed by concatenating the first character of each string in words in order. For example, "ab" can be formed from ["apple", "banana"], but it can't be formed from ["bear", "aardvark"].

\n\n

Return true if s is an acronym of words, and false otherwise.

\n\n

 

\n

Example 1:

\n\n
\nInput: words = ["alice","bob","charlie"], s = "abc"\nOutput: true\nExplanation: The first character in the words "alice", "bob", and "charlie" are 'a', 'b', and 'c', respectively. Hence, s = "abc" is the acronym. \n
\n\n

Example 2:

\n\n
\nInput: words = ["an","apple"], s = "a"\nOutput: false\nExplanation: The first character in the words "an" and "apple" are 'a' and 'a', respectively. \nThe acronym formed by concatenating these characters is "aa". \nHence, s = "a" is not the acronym.\n
\n\n

Example 3:

\n\n
\nInput: words = ["never","gonna","give","up","on","you"], s = "ngguoy"\nOutput: true\nExplanation: By concatenating the first character of the words in the array, we get the string "ngguoy". \nHence, s = "ngguoy" is the acronym.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= words.length <= 100
  • \n\t
  • 1 <= words[i].length <= 10
  • \n\t
  • 1 <= s.length <= 100
  • \n\t
  • words[i] and s consist of lowercase English letters.
  • \n
\n", + "translatedTitle": "判别首字母缩略词", + "translatedContent": "

给你一个字符串数组 words 和一个字符串 s ,请你判断 s 是不是 words首字母缩略词

\n\n

如果可以按顺序串联 words 中每个字符串的第一个字符形成字符串 s ,则认为 swords 的首字母缩略词。例如,\"ab\" 可以由 [\"apple\", \"banana\"] 形成,但是无法从 [\"bear\", \"aardvark\"] 形成。

\n\n

如果 swords 的首字母缩略词,返回 true ;否则,返回 false

\n\n

 

\n\n

示例 1:

\n\n
\n输入:words = [\"alice\",\"bob\",\"charlie\"], s = \"abc\"\n输出:true\n解释:words 中 \"alice\"、\"bob\" 和 \"charlie\" 的第一个字符分别是 'a'、'b' 和 'c'。因此,s = \"abc\" 是首字母缩略词。 \n
\n\n

示例 2:

\n\n
\n输入:words = [\"an\",\"apple\"], s = \"a\"\n输出:false\n解释:words 中 \"an\" 和 \"apple\" 的第一个字符分别是 'a' 和 'a'。\n串联这些字符形成的首字母缩略词是 \"aa\" 。\n因此,s = \"a\" 不是首字母缩略词。\n
\n\n

示例 3:

\n\n
\n输入:words = [\"never\",\"gonna\",\"give\",\"up\",\"on\",\"you\"], s = \"ngguoy\"\n输出:true\n解释:串联数组 words 中每个字符串的第一个字符,得到字符串 \"ngguoy\" 。\n因此,s = \"ngguoy\" 是首字母缩略词。 \n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= words.length <= 100
  • \n\t
  • 1 <= words[i].length <= 10
  • \n\t
  • 1 <= s.length <= 100
  • \n\t
  • words[i]s 由小写英文字母组成
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 0, + "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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool isAcronym(vector& words, string s) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean isAcronym(List words, String s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def isAcronym(self, words, s):\n \"\"\"\n :type words: List[str]\n :type s: str\n :rtype: bool\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool isAcronym(char ** words, int wordsSize, char * s){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool IsAcronym(IList words, string s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} words\n * @param {string} s\n * @return {boolean}\n */\nvar isAcronym = function(words, s) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} words\n# @param {String} s\n# @return {Boolean}\ndef is_acronym(words, s)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func isAcronym(_ words: [String], _ s: String) -> Bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func isAcronym(words []string, s string) bool {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def isAcronym(words: List[String], s: String): Boolean = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun isAcronym(words: List, s: String): Boolean {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn is_acronym(words: Vec, s: String) -> bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $words\n * @param String $s\n * @return Boolean\n */\n function isAcronym($words, $s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function isAcronym(words: string[], s: string): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (is-acronym words s)\n (-> (listof string?) string? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec is_acronym(Words :: [unicode:unicode_binary()], S :: unicode:unicode_binary()) -> boolean().\nis_acronym(Words, S) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec is_acronym(words :: [String.t], s :: String.t) :: boolean\n def is_acronym(words, s) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool isAcronym(List words, String s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"5K\", \"totalAcceptedRaw\": 4252, \"totalSubmissionRaw\": 5026, \"acRate\": \"84.6%\"}", + "hints": [ + "
Concatenate the first characters of the strings in words, and compare the resulting concatenation to s.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"alice\",\"bob\",\"charlie\"]\n\"abc\"", + "metaData": "{\n \"name\": \"isAcronym\",\n \"params\": [\n {\n \"name\": \"words\",\n \"type\": \"list\"\n },\n {\n \"type\": \"string\",\n \"name\": \"s\"\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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": "[\"alice\",\"bob\",\"charlie\"]\n\"abc\"\n[\"an\",\"apple\"]\n\"a\"\n[\"never\",\"gonna\",\"give\",\"up\",\"on\",\"you\"]\n\"ngguoy\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/count-pairs-whose-sum-is-less-than-target.json b/leetcode-cn/originData/count-pairs-whose-sum-is-less-than-target.json new file mode 100644 index 00000000..58b35fba --- /dev/null +++ b/leetcode-cn/originData/count-pairs-whose-sum-is-less-than-target.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "2917", + "questionFrontendId": "6954", + "categoryTitle": "Algorithms", + "boundTopicId": 2392035, + "title": "Count Pairs Whose Sum is Less than Target", + "titleSlug": "count-pairs-whose-sum-is-less-than-target", + "content": "Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target.\n

 

\n

Example 1:

\n\n
\nInput: nums = [-1,1,2,3,1], target = 2\nOutput: 3\nExplanation: There are 3 pairs of indices that satisfy the conditions in the statement:\n- (0, 1) since 0 < 1 and nums[0] + nums[1] = 0 < target\n- (0, 2) since 0 < 2 and nums[0] + nums[2] = 1 < target \n- (0, 4) since 0 < 4 and nums[0] + nums[4] = 0 < target\nNote that (0, 3) is not counted since nums[0] + nums[3] is not strictly less than the target.\n
\n\n

Example 2:

\n\n
\nInput: nums = [-6,2,5,-2,-7,-1,3], target = -2\nOutput: 10\nExplanation: There are 10 pairs of indices that satisfy the conditions in the statement:\n- (0, 1) since 0 < 1 and nums[0] + nums[1] = -4 < target\n- (0, 3) since 0 < 3 and nums[0] + nums[3] = -8 < target\n- (0, 4) since 0 < 4 and nums[0] + nums[4] = -13 < target\n- (0, 5) since 0 < 5 and nums[0] + nums[5] = -7 < target\n- (0, 6) since 0 < 6 and nums[0] + nums[6] = -3 < target\n- (1, 4) since 1 < 4 and nums[1] + nums[4] = -5 < target\n- (3, 4) since 3 < 4 and nums[3] + nums[4] = -9 < target\n- (3, 5) since 3 < 5 and nums[3] + nums[5] = -3 < target\n- (4, 5) since 4 < 5 and nums[4] + nums[5] = -8 < target\n- (4, 6) since 4 < 6 and nums[4] + nums[6] = -4 < target\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length == n <= 50
  • \n\t
  • -50 <= nums[i], target <= 50
  • \n
\n", + "translatedTitle": "统计和小于目标的下标对数目", + "translatedContent": "给你一个下标从 0 开始长度为 n 的整数数组 nums 和一个整数 target ,请你返回满足 0 <= i < j < nnums[i] + nums[j] < target 的下标对 (i, j) 的数目。\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [-1,1,2,3,1], target = 2\n输出:3\n解释:总共有 3 个下标对满足题目描述:\n- (0, 1) ,0 < 1 且 nums[0] + nums[1] = 0 < target\n- (0, 2) ,0 < 2 且 nums[0] + nums[2] = 1 < target \n- (0, 4) ,0 < 4 且 nums[0] + nums[4] = 0 < target\n注意 (0, 3) 不计入答案因为 nums[0] + nums[3] 不是严格小于 target 。\n
\n\n

示例 2:

\n\n
\n输入:nums = [-6,2,5,-2,-7,-1,3], target = -2\n输出:10\n解释:总共有 10 个下标对满足题目描述:\n- (0, 1) ,0 < 1 且 nums[0] + nums[1] = -4 < target\n- (0, 3) ,0 < 3 且 nums[0] + nums[3] = -8 < target\n- (0, 4) ,0 < 4 且 nums[0] + nums[4] = -13 < target\n- (0, 5) ,0 < 5 且 nums[0] + nums[5] = -7 < target\n- (0, 6) ,0 < 6 且 nums[0] + nums[6] = -3 < target\n- (1, 4) ,1 < 4 且 nums[1] + nums[4] = -5 < target\n- (3, 4) ,3 < 4 且 nums[3] + nums[4] = -9 < target\n- (3, 5) ,3 < 5 且 nums[3] + nums[5] = -3 < target\n- (4, 5) ,4 < 5 且 nums[4] + nums[5] = -8 < target\n- (4, 6) ,4 < 6 且 nums[4] + nums[6] = -4 < target\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length == n <= 50
  • \n\t
  • -50 <= nums[i], target <= 50
  • \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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countPairs(vector& nums, int target) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countPairs(List nums, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countPairs(self, nums, target):\n \"\"\"\n :type nums: List[int]\n :type target: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int countPairs(int* nums, int numsSize, int target){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountPairs(IList nums, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} target\n * @return {number}\n */\nvar countPairs = function(nums, target) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} target\n# @return {Integer}\ndef count_pairs(nums, target)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countPairs(_ nums: [Int], _ target: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countPairs(nums []int, target int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countPairs(nums: List[Int], target: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countPairs(nums: List, target: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_pairs(nums: Vec, target: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $target\n * @return Integer\n */\n function countPairs($nums, $target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countPairs(nums: number[], target: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-pairs nums target)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_pairs(Nums :: [integer()], Target :: integer()) -> integer().\ncount_pairs(Nums, Target) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_pairs(nums :: [integer], target :: integer) :: integer\n def count_pairs(nums, target) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int countPairs(List nums, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"2.9K\", \"totalAcceptedRaw\": 2649, \"totalSubmissionRaw\": 2901, \"acRate\": \"91.3%\"}", + "hints": [ + "The constraints are small enough for a brute-force solution to pass" + ], + "solution": null, + "status": null, + "sampleTestCase": "[-1,1,2,3,1]\n2", + "metaData": "{\n \"name\": \"countPairs\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"target\"\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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,2,3,1]\n2\n[-6,2,5,-2,-7,-1,3]\n-2", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/determine-the-minimum-sum-of-a-k-avoiding-array.json b/leetcode-cn/originData/determine-the-minimum-sum-of-a-k-avoiding-array.json new file mode 100644 index 00000000..04a3f91c --- /dev/null +++ b/leetcode-cn/originData/determine-the-minimum-sum-of-a-k-avoiding-array.json @@ -0,0 +1,166 @@ +{ + "data": { + "question": { + "questionId": "2811", + "questionFrontendId": "6450", + "categoryTitle": "Algorithms", + "boundTopicId": 2392180, + "title": "Determine the Minimum Sum of a k-avoiding Array", + "titleSlug": "determine-the-minimum-sum-of-a-k-avoiding-array", + "content": "

You are given two integers, n and k.

\n\n

An array of distinct positive integers is called a k-avoiding array if there does not exist any pair of distinct elements that sum to k.

\n\n

Return the minimum possible sum of a k-avoiding array of length n.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 5, k = 4\nOutput: 18\nExplanation: Consider the k-avoiding array [1,2,4,5,6], which has a sum of 18.\nIt can be proven that there is no k-avoiding array with a sum less than 18.\n
\n\n

Example 2:

\n\n
\nInput: n = 2, k = 6\nOutput: 3\nExplanation: We can construct the array [1,2], which has a sum of 3.\nIt can be proven that there is no k-avoiding array with a sum less than 3.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n, k <= 50
  • \n
\n", + "translatedTitle": "k-avoiding 数组的最小总和", + "translatedContent": "

给你两个整数 nk

\n\n

对于一个由 不同 正整数组成的数组,如果其中不存在任何求和等于 k 的不同元素对,则称其为 k-avoiding 数组。

\n\n

返回长度为 nk-avoiding 数组的可能的最小总和。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:n = 5, k = 4\n输出:18\n解释:设若 k-avoiding 数组为 [1,2,4,5,6] ,其元素总和为 18 。\n可以证明不存在总和小于 18 的 k-avoiding 数组。\n
\n\n

示例 2:

\n\n
\n输入:n = 2, k = 6\n输出:3\n解释:可以构造数组 [1,2] ,其元素总和为 3 。\n可以证明不存在总和小于 3 的 k-avoiding 数组。 \n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n, k <= 50
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 6, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minimumSum(int n, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumSum(int n, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumSum(self, n, k):\n \"\"\"\n :type n: int\n :type k: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumSum(self, n: int, k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minimumSum(int n, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumSum(int n, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} k\n * @return {number}\n */\nvar minimumSum = function(n, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} k\n# @return {Integer}\ndef minimum_sum(n, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumSum(_ n: Int, _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumSum(n int, k int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumSum(n: Int, k: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumSum(n: Int, k: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_sum(n: i32, k: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $k\n * @return Integer\n */\n function minimumSum($n, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumSum(n: number, k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-sum n k)\n (-> exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_sum(N :: integer(), K :: integer()) -> integer().\nminimum_sum(N, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_sum(n :: integer, k :: integer) :: integer\n def minimum_sum(n, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minimumSum(int n, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"7K\", \"totalAcceptedRaw\": 3957, \"totalSubmissionRaw\": 7016, \"acRate\": \"56.4%\"}", + "hints": [ + "
Try to start with the smallest possible integers.
", + "
Check if the current number can be added to the array.
", + "
To check if the current number can be added, keep track of already added numbers in a set.
", + "
If the number i is added to the array, then i + k can not be added.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "5\n4", + "metaData": "{\n \"name\": \"minimumSum\",\n \"params\": [\n {\n \"name\": \"n\",\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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": "5\n4\n2\n6", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/double-a-number-represented-as-a-linked-list.json b/leetcode-cn/originData/double-a-number-represented-as-a-linked-list.json new file mode 100644 index 00000000..2b3b4711 --- /dev/null +++ b/leetcode-cn/originData/double-a-number-represented-as-a-linked-list.json @@ -0,0 +1,184 @@ +{ + "data": { + "question": { + "questionId": "2871", + "questionFrontendId": "2816", + "categoryTitle": "Algorithms", + "boundTopicId": 2383695, + "title": "Double a Number Represented as a Linked List", + "titleSlug": "double-a-number-represented-as-a-linked-list", + "content": "

You are given the head of a non-empty linked list representing a non-negative integer without leading zeroes.

\n\n

Return the head of the linked list after doubling it.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: head = [1,8,9]\nOutput: [3,7,8]\nExplanation: The figure above corresponds to the given linked list which represents the number 189. Hence, the returned linked list represents the number 189 * 2 = 378.\n
\n\n

Example 2:

\n\"\"\n
\nInput: head = [9,9,9]\nOutput: [1,9,9,8]\nExplanation: The figure above corresponds to the given linked list which represents the number 999. Hence, the returned linked list reprersents the number 999 * 2 = 1998. \n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • The number of nodes in the list is in the range [1, 104]
  • \n\t
  • 0 <= Node.val <= 9
  • \n\t
  • The input is generated such that the list represents a number that does not have leading zeros, except the number 0 itself.
  • \n
\n", + "translatedTitle": "翻倍以链表形式表示的数字", + "translatedContent": "

给你一个 非空 链表的头节点 head ,表示一个不含前导零的非负数整数。

\n\n

将链表 翻倍 后,返回头节点 head

\n\n

 

\n\n

示例 1:

\n\"\"\n
\n输入:head = [1,8,9]\n输出:[3,7,8]\n解释:上图中给出的链表,表示数字 189 。返回的链表表示数字 189 * 2 = 378 。
\n\n

示例 2:

\n\"\"\n
\n输入:head = [9,9,9]\n输出:[1,9,9,8]\n解释:上图中给出的链表,表示数字 999 。返回的链表表示数字 999 * 2 = 1998 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 链表中节点的数目在范围 [1, 104]
  • \n\t
  • 0 <= Node.val <= 9
  • \n\t
  • 生成的输入满足:链表表示一个不含前导零的数字,除了数字 0 本身。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 10, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [ + { + "name": "Stack", + "slug": "stack", + "translatedName": "栈", + "__typename": "TopicTagNode" + }, + { + "name": "Linked List", + "slug": "linked-list", + "translatedName": "链表", + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": "数学", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "/**\n * Definition for singly-linked list.\n * struct ListNode {\n * int val;\n * ListNode *next;\n * ListNode() : val(0), next(nullptr) {}\n * ListNode(int x) : val(x), next(nullptr) {}\n * ListNode(int x, ListNode *next) : val(x), next(next) {}\n * };\n */\nclass Solution {\npublic:\n ListNode* doubleIt(ListNode* head) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * int val;\n * ListNode next;\n * ListNode() {}\n * ListNode(int val) { this.val = val; }\n * ListNode(int val, ListNode next) { this.val = val; this.next = next; }\n * }\n */\nclass Solution {\n public ListNode doubleIt(ListNode head) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "# Definition for singly-linked list.\n# class ListNode(object):\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution(object):\n def doubleIt(self, head):\n \"\"\"\n :type head: Optional[ListNode]\n :rtype: Optional[ListNode]\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def doubleIt(self, head: Optional[ListNode]) -> Optional[ListNode]:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Definition for singly-linked list.\n * struct ListNode {\n * int val;\n * struct ListNode *next;\n * };\n */\nstruct ListNode* doubleIt(struct ListNode* head){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * public int val;\n * public ListNode next;\n * public ListNode(int val=0, ListNode next=null) {\n * this.val = val;\n * this.next = next;\n * }\n * }\n */\npublic class Solution {\n public ListNode DoubleIt(ListNode head) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * Definition for singly-linked list.\n * function ListNode(val, next) {\n * this.val = (val===undefined ? 0 : val)\n * this.next = (next===undefined ? null : next)\n * }\n */\n/**\n * @param {ListNode} head\n * @return {ListNode}\n */\nvar doubleIt = function(head) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# Definition for singly-linked list.\n# class ListNode\n# attr_accessor :val, :next\n# def initialize(val = 0, _next = nil)\n# @val = val\n# @next = _next\n# end\n# end\n# @param {ListNode} head\n# @return {ListNode}\ndef double_it(head)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * public var val: Int\n * public var next: ListNode?\n * public init() { self.val = 0; self.next = nil; }\n * public init(_ val: Int) { self.val = val; self.next = nil; }\n * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }\n * }\n */\nclass Solution {\n func doubleIt(_ head: ListNode?) -> ListNode? {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "/**\n * Definition for singly-linked list.\n * type ListNode struct {\n * Val int\n * Next *ListNode\n * }\n */\nfunc doubleIt(head *ListNode) *ListNode {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode(_x: Int = 0, _next: ListNode = null) {\n * var next: ListNode = _next\n * var x: Int = _x\n * }\n */\nobject Solution {\n def doubleIt(head: ListNode): ListNode = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "/**\n * Example:\n * var li = ListNode(5)\n * var v = li.`val`\n * Definition for singly-linked list.\n * class ListNode(var `val`: Int) {\n * var next: ListNode? = null\n * }\n */\nclass Solution {\n fun doubleIt(head: ListNode?): ListNode? {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "// Definition for singly-linked list.\n// #[derive(PartialEq, Eq, Clone, Debug)]\n// pub struct ListNode {\n// pub val: i32,\n// pub next: Option>\n// }\n//\n// impl ListNode {\n// #[inline]\n// fn new(val: i32) -> Self {\n// ListNode {\n// next: None,\n// val\n// }\n// }\n// }\nimpl Solution {\n pub fn double_it(head: Option>) -> Option> {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "/**\n * Definition for a singly-linked list.\n * class ListNode {\n * public $val = 0;\n * public $next = null;\n * function __construct($val = 0, $next = null) {\n * $this->val = $val;\n * $this->next = $next;\n * }\n * }\n */\nclass Solution {\n\n /**\n * @param ListNode $head\n * @return ListNode\n */\n function doubleIt($head) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode {\n * val: number\n * next: ListNode | null\n * constructor(val?: number, next?: ListNode | null) {\n * this.val = (val===undefined ? 0 : val)\n * this.next = (next===undefined ? null : next)\n * }\n * }\n */\n\nfunction doubleIt(head: ListNode | null): ListNode | null {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "; Definition for singly-linked list:\n#|\n\n; val : integer?\n; next : (or/c list-node? #f)\n(struct list-node\n (val next) #:mutable #:transparent)\n\n; constructor\n(define (make-list-node [val 0])\n (list-node val #f))\n\n|#\n\n(define/contract (double-it head)\n (-> (or/c list-node? #f) (or/c list-node? #f))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "%% Definition for singly-linked list.\n%%\n%% -record(list_node, {val = 0 :: integer(),\n%% next = null :: 'null' | #list_node{}}).\n\n-spec double_it(Head :: #list_node{} | null) -> #list_node{} | null.\ndouble_it(Head) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "# Definition for singly-linked list.\n#\n# defmodule ListNode do\n# @type t :: %__MODULE__{\n# val: integer,\n# next: ListNode.t() | nil\n# }\n# defstruct val: 0, next: nil\n# end\n\ndefmodule Solution do\n @spec double_it(head :: ListNode.t | nil) :: ListNode.t | nil\n def double_it(head) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode {\n * int val;\n * ListNode? next;\n * ListNode([this.val = 0, this.next]);\n * }\n */\nclass Solution {\n ListNode? doubleIt(ListNode? head) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 5649, \"totalSubmissionRaw\": 10196, \"acRate\": \"55.4%\"}", + "hints": [ + "Traverse the linked list from the least significant digit to the most significant digit and multiply each node's value by 2", + "Handle any carry-over digits that may arise during the doubling process.", + "If there is a carry-over digit on the most significant digit, create a new node with that value and point it to the start of the given linked list and return it." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,8,9]", + "metaData": "{\n \"name\": \"doubleIt\",\n \"params\": [\n {\n \"name\": \"head\",\n \"type\": \"ListNode\"\n }\n ],\n \"return\": {\n \"type\": \"ListNode\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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,8,9]\n[9,9,9]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/find-the-longest-equal-subarray.json b/leetcode-cn/originData/find-the-longest-equal-subarray.json new file mode 100644 index 00000000..288fd2a5 --- /dev/null +++ b/leetcode-cn/originData/find-the-longest-equal-subarray.json @@ -0,0 +1,166 @@ +{ + "data": { + "question": { + "questionId": "2832", + "questionFrontendId": "6467", + "categoryTitle": "Algorithms", + "boundTopicId": 2392177, + "title": "Find the Longest Equal Subarray", + "titleSlug": "find-the-longest-equal-subarray", + "content": "

You are given a 0-indexed integer array nums and an integer k.

\n\n

A subarray is called equal if all of its elements are equal. Note that the empty subarray is an equal subarray.

\n\n

Return the length of the longest possible equal subarray after deleting at most k elements from nums.

\n\n

A subarray is a contiguous, possibly empty sequence of elements within an array.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,3,2,3,1,3], k = 3\nOutput: 3\nExplanation: It's optimal to delete the elements at index 2 and index 4.\nAfter deleting them, nums becomes equal to [1, 3, 3, 3].\nThe longest equal subarray starts at i = 1 and ends at j = 3 with length equal to 3.\nIt can be proven that no longer equal subarrays can be created.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,1,2,2,1,1], k = 2\nOutput: 4\nExplanation: It's optimal to delete the elements at index 2 and index 3.\nAfter deleting them, nums becomes equal to [1, 1, 1, 1].\nThe array itself is an equal subarray, so the answer is 4.\nIt can be proven that no longer equal subarrays can be created.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= nums.length
  • \n\t
  • 0 <= k <= nums.length
  • \n
\n", + "translatedTitle": "找出最长等值子数组", + "translatedContent": "

给你一个下标从 0 开始的整数数组 nums 和一个整数 k

\n\n

如果子数组中所有元素都相等,则认为子数组是一个 等值子数组 。注意,空数组是 等值子数组

\n\n

nums 中删除最多 k 个元素后,返回可能的最长等值子数组的长度。

\n\n

子数组 是数组中一个连续且可能为空的元素序列。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [1,3,2,3,1,3], k = 3\n输出:3\n解释:最优的方案是删除下标 2 和下标 4 的元素。\n删除后,nums 等于 [1, 3, 3, 3] 。\n最长等值子数组从 i = 1 开始到 j = 3 结束,长度等于 3 。\n可以证明无法创建更长的等值子数组。\n
\n\n

示例 2:

\n\n
\n输入:nums = [1,1,2,2,1,1], k = 2\n输出:4\n解释:最优的方案是删除下标 2 和下标 3 的元素。 \n删除后,nums 等于 [1, 1, 1, 1] 。 \n数组自身就是等值子数组,长度等于 4 。 \n可以证明无法创建更长的等值子数组。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= nums.length
  • \n\t
  • 0 <= k <= nums.length
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int longestEqualSubarray(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int longestEqualSubarray(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def longestEqualSubarray(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 longestEqualSubarray(self, nums: List[int], k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int longestEqualSubarray(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int LongestEqualSubarray(IList 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 longestEqualSubarray = function(nums, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef longest_equal_subarray(nums, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func longestEqualSubarray(_ nums: [Int], _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func longestEqualSubarray(nums []int, k int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def longestEqualSubarray(nums: List[Int], k: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun longestEqualSubarray(nums: List, k: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn longest_equal_subarray(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 longestEqualSubarray($nums, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function longestEqualSubarray(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (longest-equal-subarray nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec longest_equal_subarray(Nums :: [integer()], K :: integer()) -> integer().\nlongest_equal_subarray(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec longest_equal_subarray(nums :: [integer], k :: integer) :: integer\n def longest_equal_subarray(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int longestEqualSubarray(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 2005, \"totalSubmissionRaw\": 6106, \"acRate\": \"32.8%\"}", + "hints": [ + "
For each number x in nums, create a sorted list indicesx of all indices i such that nums[i] == x.
", + "
On every indicesx, execute a sliding window technique.
", + "
For each indicesx, find i, j such that (indicesx[j] - indicesx[i]) - (j - i) <= k and j - i + 1 is maximized.
", + "
The answer would be the maximum of j - i + 1 for all indicesx.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,2,3,1,3]\n3", + "metaData": "{\n \"name\": \"longestEqualSubarray\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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,2,3,1,3]\n3\n[1,1,2,2,1,1]\n2", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/make-string-a-subsequence-using-cyclic-increments.json b/leetcode-cn/originData/make-string-a-subsequence-using-cyclic-increments.json new file mode 100644 index 00000000..13fca91b --- /dev/null +++ b/leetcode-cn/originData/make-string-a-subsequence-using-cyclic-increments.json @@ -0,0 +1,166 @@ +{ + "data": { + "question": { + "questionId": "3018", + "questionFrontendId": "8014", + "categoryTitle": "Algorithms", + "boundTopicId": 2393665, + "title": "Make String a Subsequence Using Cyclic Increments", + "titleSlug": "make-string-a-subsequence-using-cyclic-increments", + "content": "

You are given two 0-indexed strings str1 and str2.

\n\n

In an operation, you select a set of indices in str1, and for each index i in the set, increment str1[i] to the next character cyclically. That is 'a' becomes 'b', 'b' becomes 'c', and so on, and 'z' becomes 'a'.

\n\n

Return true if it is possible to make str2 a subsequence of str1 by performing the operation at most once, and false otherwise.

\n\n

Note: A subsequence of a string is a new string that is formed from the original string by deleting some (possibly none) of the characters without disturbing the relative positions of the remaining characters.

\n\n

 

\n

Example 1:

\n\n
\nInput: str1 = "abc", str2 = "ad"\nOutput: true\nExplanation: Select index 2 in str1.\nIncrement str1[2] to become 'd'. \nHence, str1 becomes "abd" and str2 is now a subsequence. Therefore, true is returned.
\n\n

Example 2:

\n\n
\nInput: str1 = "zc", str2 = "ad"\nOutput: true\nExplanation: Select indices 0 and 1 in str1. \nIncrement str1[0] to become 'a'. \nIncrement str1[1] to become 'd'. \nHence, str1 becomes "ad" and str2 is now a subsequence. Therefore, true is returned.
\n\n

Example 3:

\n\n
\nInput: str1 = "ab", str2 = "d"\nOutput: false\nExplanation: In this example, it can be shown that it is impossible to make str2 a subsequence of str1 using the operation at most once. \nTherefore, false is returned.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= str1.length <= 105
  • \n\t
  • 1 <= str2.length <= 105
  • \n\t
  • str1 and str2 consist of only lowercase English letters.
  • \n
\n", + "translatedTitle": "循环增长使字符串子序列等于另一个字符串", + "translatedContent": "

给你一个下标从 0 开始的字符串 str1 和 str2 。

\n\n

一次操作中,你选择 str1 中的若干下标。对于选中的每一个下标 i ,你将 str1[i] 循环 递增,变成下一个字符。也就是说 'a' 变成 'b' ,'b' 变成 'c' ,以此类推,'z' 变成 'a' 。

\n\n

如果执行以上操作 至多一次 ,可以让 str2 成为 str1 的子序列,请你返回 true ,否则返回 false 。

\n\n

注意:一个字符串的子序列指的是从原字符串中删除一些(可以一个字符也不删)字符后,剩下字符按照原本先后顺序组成的新字符串。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:str1 = \"abc\", str2 = \"ad\"\n输出:true\n解释:选择 str1 中的下标 2 。\n将 str1[2] 循环递增,得到 'd' 。\n因此,str1 变成 \"abd\" 且 str2 现在是一个子序列。所以返回 true 。
\n\n

示例 2:

\n\n
\n输入:str1 = \"zc\", str2 = \"ad\"\n输出:true\n解释:选择 str1 中的下标 0 和 1 。\n将 str1[0] 循环递增得到 'a' 。\n将 str1[1] 循环递增得到 'd' 。\n因此,str1 变成 \"ad\" 且 str2 现在是一个子序列。所以返回 true 。
\n\n

示例 3:

\n\n
\n输入:str1 = \"ab\", str2 = \"d\"\n输出:false\n解释:这个例子中,没法在执行一次操作的前提下,将 str2 变为 str1 的子序列。\n所以返回 false 。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= str1.length <= 105
  • \n\t
  • 1 <= str2.length <= 105
  • \n\t
  • str1 和 str2 只包含小写英文字母。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 0, + "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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool canMakeSubsequence(string str1, string str2) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean canMakeSubsequence(String str1, String str2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def canMakeSubsequence(self, str1, str2):\n \"\"\"\n :type str1: str\n :type str2: str\n :rtype: bool\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool canMakeSubsequence(char * str1, char * str2){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool CanMakeSubsequence(string str1, string str2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} str1\n * @param {string} str2\n * @return {boolean}\n */\nvar canMakeSubsequence = function(str1, str2) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} str1\n# @param {String} str2\n# @return {Boolean}\ndef can_make_subsequence(str1, str2)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func canMakeSubsequence(_ str1: String, _ str2: String) -> Bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func canMakeSubsequence(str1 string, str2 string) bool {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def canMakeSubsequence(str1: String, str2: String): Boolean = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun canMakeSubsequence(str1: String, str2: String): Boolean {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn can_make_subsequence(str1: String, str2: String) -> bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $str1\n * @param String $str2\n * @return Boolean\n */\n function canMakeSubsequence($str1, $str2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function canMakeSubsequence(str1: string, str2: string): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (can-make-subsequence str1 str2)\n (-> string? string? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec can_make_subsequence(Str1 :: unicode:unicode_binary(), Str2 :: unicode:unicode_binary()) -> boolean().\ncan_make_subsequence(Str1, Str2) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec can_make_subsequence(str1 :: String.t, str2 :: String.t) :: boolean\n def can_make_subsequence(str1, str2) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool canMakeSubsequence(String str1, String str2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.4K\", \"totalSubmission\": \"4.7K\", \"totalAcceptedRaw\": 2357, \"totalSubmissionRaw\": 4749, \"acRate\": \"49.6%\"}", + "hints": [ + "
Consider the indices we will increment separately.
", + "
We can maintain two pointers: pointer i for str1 and pointer j for str2, while ensuring they remain within the bounds of the strings.
", + "
If both str1[i] and str2[j] match, or if incrementing str1[i] matches str2[j], we increase both pointers; otherwise, we increment only pointer i.
", + "
It is possible to make str2 a subsequence of str1 if j is at the end of str2, after we can no longer find a match.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "\"abc\"\n\"ad\"", + "metaData": "{\n \"name\": \"canMakeSubsequence\",\n \"params\": [\n {\n \"name\": \"str1\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"str2\"\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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": "\"abc\"\n\"ad\"\n\"zc\"\n\"ad\"\n\"ab\"\n\"d\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/max-pair-sum-in-an-array.json b/leetcode-cn/originData/max-pair-sum-in-an-array.json new file mode 100644 index 00000000..8ede08a7 --- /dev/null +++ b/leetcode-cn/originData/max-pair-sum-in-an-array.json @@ -0,0 +1,176 @@ +{ + "data": { + "question": { + "questionId": "2902", + "questionFrontendId": "2815", + "categoryTitle": "Algorithms", + "boundTopicId": 2383694, + "title": "Max Pair Sum in an Array", + "titleSlug": "max-pair-sum-in-an-array", + "content": "

You are given a 0-indexed integer array nums. You have to find the maximum sum of a pair of numbers from nums such that the maximum digit in both numbers are equal.

\n\n

Return the maximum sum or -1 if no such pair exists.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [51,71,17,24,42]\nOutput: 88\nExplanation: \nFor i = 1 and j = 2, nums[i] and nums[j] have equal maximum digits with a pair sum of 71 + 17 = 88. \nFor i = 3 and j = 4, nums[i] and nums[j] have equal maximum digits with a pair sum of 24 + 42 = 66.\nIt can be shown that there are no other pairs with equal maximum digits, so the answer is 88.
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,3,4]\nOutput: -1\nExplanation: No pair exists in nums with equal maximum digits.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 2 <= nums.length <= 100
  • \n\t
  • 1 <= nums[i] <= 104
  • \n
\n", + "translatedTitle": "数组中的最大数对和", + "translatedContent": "

给你一个下标从 0 开始的整数数组 nums 。请你从 nums 中找出和 最大 的一对数,且这两个数数位上最大的数字相等。

\n\n

返回最大和,如果不存在满足题意的数字对,返回 -1

\n\n

 

\n\n

示例 1:

\n\n
输入:nums = [51,71,17,24,42]\n输出:88\n解释:\ni = 1 和 j = 2 ,nums[i] 和 nums[j] 数位上最大的数字相等,且这一对的总和 71 + 17 = 88 。 \ni = 3 和 j = 4 ,nums[i] 和 nums[j] 数位上最大的数字相等,且这一对的总和 24 + 42 = 66 。\n可以证明不存在其他数对满足数位上最大的数字相等,所以答案是 88 。
\n\n

示例 2:

\n\n
输入:nums = [1,2,3,4]\n输出:-1\n解释:不存在数对满足数位上最大的数字相等。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 2 <= nums.length <= 100
  • \n\t
  • 1 <= nums[i] <= 104
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 3, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maxSum(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maxSum(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maxSum(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maxSum(self, nums: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int maxSum(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaxSum(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maxSum = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef max_sum(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maxSum(_ nums: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maxSum(nums []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maxSum(nums: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maxSum(nums: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn max_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 maxSum($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maxSum(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (max-sum nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec max_sum(Nums :: [integer()]) -> integer().\nmax_sum(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec max_sum(nums :: [integer]) :: integer\n def max_sum(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maxSum(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"9.2K\", \"totalAcceptedRaw\": 6289, \"totalSubmissionRaw\": 9186, \"acRate\": \"68.5%\"}", + "hints": [ + "Find the largest and second largest element with maximum digits equal to x where 1<=x<=9." + ], + "solution": null, + "status": null, + "sampleTestCase": "[51,71,17,24,42]", + "metaData": "{\n \"name\": \"maxSum\",\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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": "[51,71,17,24,42]\n[1,2,3,4]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/maximize-the-profit-as-the-salesman.json b/leetcode-cn/originData/maximize-the-profit-as-the-salesman.json new file mode 100644 index 00000000..5552e4ce --- /dev/null +++ b/leetcode-cn/originData/maximize-the-profit-as-the-salesman.json @@ -0,0 +1,165 @@ +{ + "data": { + "question": { + "questionId": "2979", + "questionFrontendId": "7006", + "categoryTitle": "Algorithms", + "boundTopicId": 2392181, + "title": "Maximize the Profit as the Salesman", + "titleSlug": "maximize-the-profit-as-the-salesman", + "content": "

You are given an integer n representing the number of houses on a number line, numbered from 0 to n - 1.

\n\n

Additionally, you are given a 2D integer array offers where offers[i] = [starti, endi, goldi], indicating that ith buyer wants to buy all the houses from starti to endi for goldi amount of gold.

\n\n

As a salesman, your goal is to maximize your earnings by strategically selecting and selling houses to buyers.

\n\n

Return the maximum amount of gold you can earn.

\n\n

Note that different buyers can't buy the same house, and some houses may remain unsold.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 5, offers = [[0,0,1],[0,2,2],[1,3,2]]\nOutput: 3\nExplanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.\nWe sell houses in the range [0,0] to 1st buyer for 1 gold and houses in the range [1,3] to 3rd buyer for 2 golds.\nIt can be proven that 3 is the maximum amount of gold we can achieve.\n
\n\n

Example 2:

\n\n
\nInput: n = 5, offers = [[0,0,1],[0,2,10],[1,3,2]]\nOutput: 10\nExplanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.\nWe sell houses in the range [0,2] to 2nd buyer for 10 golds.\nIt can be proven that 10 is the maximum amount of gold we can achieve.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= offers.length <= 105
  • \n\t
  • offers[i].length == 3
  • \n\t
  • 0 <= starti <= endi <= n - 1
  • \n\t
  • 1 <= goldi <= 103
  • \n
\n", + "translatedTitle": "销售利润最大化", + "translatedContent": "

给你一个整数 n 表示数轴上的房屋数量,编号从 0n - 1

\n\n

另给你一个二维整数数组 offers ,其中 offers[i] = [starti, endi, goldi] 表示第 i 个买家想要以 goldi 枚金币的价格购买从 startiendi 的所有房屋。

\n\n

作为一名销售,你需要有策略地选择并销售房屋使自己的收入最大化。

\n\n

返回你可以赚取的金币的最大数目。

\n\n

注意 同一所房屋不能卖给不同的买家,并且允许保留一些房屋不进行出售。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:n = 5, offers = [[0,0,1],[0,2,2],[1,3,2]]\n输出:3\n解释:\n有 5 所房屋,编号从 0 到 4 ,共有 3 个购买要约。\n将位于 [0,0] 范围内的房屋以 1 金币的价格出售给第 1 位买家,并将位于 [1,3] 范围内的房屋以 2 金币的价格出售给第 3 位买家。\n可以证明我们最多只能获得 3 枚金币。
\n\n

示例 2:

\n\n
\n输入:n = 5, offers = [[0,0,1],[0,2,10],[1,3,2]]\n输出:10\n解释:有 5 所房屋,编号从 0 到 4 ,共有 3 个购买要约。\n将位于 [0,2] 范围内的房屋以 10 金币的价格出售给第 2 位买家。\n可以证明我们最多只能获得 10 枚金币。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= offers.length <= 105
  • \n\t
  • offers[i].length == 3
  • \n\t
  • 0 <= starti <= endi <= n - 1
  • \n\t
  • 1 <= goldi <= 103
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 15, + "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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maximizeTheProfit(int n, vector>& offers) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maximizeTheProfit(int n, List> offers) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximizeTheProfit(self, n, offers):\n \"\"\"\n :type n: int\n :type offers: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int maximizeTheProfit(int n, int** offers, int offersSize, int* offersColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaximizeTheProfit(int n, IList> offers) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} offers\n * @return {number}\n */\nvar maximizeTheProfit = function(n, offers) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} offers\n# @return {Integer}\ndef maximize_the_profit(n, offers)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximizeTheProfit(_ n: Int, _ offers: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximizeTheProfit(n int, offers [][]int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximizeTheProfit(n: Int, offers: List[List[Int]]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximizeTheProfit(n: Int, offers: List>): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximize_the_profit(n: i32, offers: Vec>) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $offers\n * @return Integer\n */\n function maximizeTheProfit($n, $offers) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximizeTheProfit(n: number, offers: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximize-the-profit n offers)\n (-> exact-integer? (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximize_the_profit(N :: integer(), Offers :: [[integer()]]) -> integer().\nmaximize_the_profit(N, Offers) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximize_the_profit(n :: integer, offers :: [[integer]]) :: integer\n def maximize_the_profit(n, offers) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maximizeTheProfit(int n, List> offers) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"7.8K\", \"totalAcceptedRaw\": 2501, \"totalSubmissionRaw\": 7754, \"acRate\": \"32.3%\"}", + "hints": [ + "
The intended solution uses a dynamic programming approach to solve the problem.
", + "
Sort the array offers by starti.
", + "
Let dp[i] = { the maximum amount of gold if the sold houses are in the range [0 … i] }.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "5\n[[0,0,1],[0,2,2],[1,3,2]]", + "metaData": "{\n \"name\": \"maximizeTheProfit\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"list>\",\n \"name\": \"offers\"\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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": "5\n[[0,0,1],[0,2,2],[1,3,2]]\n5\n[[0,0,1],[0,2,10],[1,3,2]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-absolute-difference-between-elements-with-constraint.json b/leetcode-cn/originData/minimum-absolute-difference-between-elements-with-constraint.json new file mode 100644 index 00000000..a23c3bcb --- /dev/null +++ b/leetcode-cn/originData/minimum-absolute-difference-between-elements-with-constraint.json @@ -0,0 +1,186 @@ +{ + "data": { + "question": { + "questionId": "3000", + "questionFrontendId": "2817", + "categoryTitle": "Algorithms", + "boundTopicId": 2382948, + "title": "Minimum Absolute Difference Between Elements With Constraint", + "titleSlug": "minimum-absolute-difference-between-elements-with-constraint", + "content": "

You are given a 0-indexed integer array nums and an integer x.

\n\n

Find the minimum absolute difference between two elements in the array that are at least x indices apart.

\n\n

In other words, find two indices i and j such that abs(i - j) >= x and abs(nums[i] - nums[j]) is minimized.

\n\n

Return an integer denoting the minimum absolute difference between two elements that are at least x indices apart.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [4,3,2,4], x = 2\nOutput: 0\nExplanation: We can select nums[0] = 4 and nums[3] = 4. \nThey are at least 2 indices apart, and their absolute difference is the minimum, 0. \nIt can be shown that 0 is the optimal answer.\n
\n\n

Example 2:

\n\n
\nInput: nums = [5,3,2,10,15], x = 1\nOutput: 1\nExplanation: We can select nums[1] = 3 and nums[2] = 2.\nThey are at least 1 index apart, and their absolute difference is the minimum, 1.\nIt can be shown that 1 is the optimal answer.\n
\n\n

Example 3:

\n\n
\nInput: nums = [1,2,3,4], x = 3\nOutput: 3\nExplanation: We can select nums[0] = 1 and nums[3] = 4.\nThey are at least 3 indices apart, and their absolute difference is the minimum, 3.\nIt can be shown that 3 is the optimal answer.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n\t
  • 0 <= x < nums.length
  • \n
\n", + "translatedTitle": "限制条件下元素之间的最小绝对差", + "translatedContent": "

给你一个下标从 0 开始的整数数组 nums 和一个整数 x 。

\n\n

请你找到数组中下标距离至少为 x 的两个元素的 差值绝对值 的 最小值 。

\n\n

换言之,请你找到两个下标 i 和 j ,满足 abs(i - j) >= x 且 abs(nums[i] - nums[j]) 的值最小。

\n\n

请你返回一个整数,表示下标距离至少为 x 的两个元素之间的差值绝对值的 最小值 。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [4,3,2,4], x = 2\n输出:0\n解释:我们选择 nums[0] = 4 和 nums[3] = 4 。\n它们下标距离满足至少为 2 ,差值绝对值为最小值 0 。\n0 是最优解。\n
\n\n

示例 2:

\n\n
\n输入:nums = [5,3,2,10,15], x = 1\n输出:1\n解释:我们选择 nums[1] = 3 和 nums[2] = 2 。\n它们下标距离满足至少为 1 ,差值绝对值为最小值 1 。\n1 是最优解。\n
\n\n

示例 3:

\n\n
\n输入:nums = [1,2,3,4], x = 3\n输出:3\n解释:我们选择 nums[0] = 1 和 nums[3] = 4 。\n它们下标距离满足至少为 3 ,差值绝对值为最小值 3 。\n3 是最优解。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n\t
  • 0 <= x < nums.length
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 18, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"dart\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Binary Search", + "slug": "binary-search", + "translatedName": "二分查找", + "__typename": "TopicTagNode" + }, + { + "name": "Ordered Set", + "slug": "ordered-set", + "translatedName": "有序集合", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minAbsoluteDifference(vector& nums, int x) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minAbsoluteDifference(List nums, int x) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minAbsoluteDifference(self, nums, x):\n \"\"\"\n :type nums: List[int]\n :type x: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minAbsoluteDifference(int* nums, int numsSize, int x){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinAbsoluteDifference(IList nums, int x) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} x\n * @return {number}\n */\nvar minAbsoluteDifference = function(nums, x) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} x\n# @return {Integer}\ndef min_absolute_difference(nums, x)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minAbsoluteDifference(_ nums: [Int], _ x: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minAbsoluteDifference(nums []int, x int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minAbsoluteDifference(nums: List[Int], x: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minAbsoluteDifference(nums: List, x: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_absolute_difference(nums: Vec, x: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $x\n * @return Integer\n */\n function minAbsoluteDifference($nums, $x) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minAbsoluteDifference(nums: number[], x: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-absolute-difference nums x)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_absolute_difference(Nums :: [integer()], X :: integer()) -> integer().\nmin_absolute_difference(Nums, X) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_absolute_difference(nums :: [integer], x :: integer) :: integer\n def min_absolute_difference(nums, x) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minAbsoluteDifference(List nums, int x) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"13.9K\", \"totalAcceptedRaw\": 4174, \"totalSubmissionRaw\": 13857, \"acRate\": \"30.1%\"}", + "hints": [ + "
Let's only consider the cases where i < j, as the problem is symmetric.
", + "
For an index j, we are interested in an index i in the range [0, j - x] that minimizes abs(nums[i] - nums[j]).
", + "
For every index j, while going from left to right, add nums[j - x] to a set (C++ set, Java TreeSet, and Python sorted set).
", + "
After inserting nums[j - x], we can calculate the closest value to nums[j] in the set using binary search and store the absolute difference. In C++, we can achieve this by using lower_bound and/or upper_bound.
", + "
Calculate the minimum absolute difference among all indices.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[4,3,2,4]\n2", + "metaData": "{\n \"name\": \"minAbsoluteDifference\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"x\"\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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,2,4]\n2\n[5,3,2,10,15]\n1\n[1,2,3,4]\n3", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/number-of-beautiful-integers-in-the-range.json b/leetcode-cn/originData/number-of-beautiful-integers-in-the-range.json new file mode 100644 index 00000000..965e144d --- /dev/null +++ b/leetcode-cn/originData/number-of-beautiful-integers-in-the-range.json @@ -0,0 +1,164 @@ +{ + "data": { + "question": { + "questionId": "3017", + "questionFrontendId": "8013", + "categoryTitle": "Algorithms", + "boundTopicId": 2393696, + "title": "Number of Beautiful Integers in the Range", + "titleSlug": "number-of-beautiful-integers-in-the-range", + "content": "

You are given positive integers low, high, and k.

\n\n

A number is beautiful if it meets both of the following conditions:

\n\n
    \n\t
  • The count of even digits in the number is equal to the count of odd digits.
  • \n\t
  • The number is divisible by k.
  • \n
\n\n

Return the number of beautiful integers in the range [low, high].

\n\n

 

\n

Example 1:

\n\n
\nInput: low = 10, high = 20, k = 3\nOutput: 2\nExplanation: There are 2 beautiful integers in the given range: [12,18]. \n- 12 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 3.\n- 18 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 3.\nAdditionally we can see that:\n- 16 is not beautiful because it is not divisible by k = 3.\n- 15 is not beautiful because it does not contain equal counts even and odd digits.\nIt can be shown that there are only 2 beautiful integers in the given range.\n
\n\n

Example 2:

\n\n
\nInput: low = 1, high = 10, k = 1\nOutput: 1\nExplanation: There is 1 beautiful integer in the given range: [10].\n- 10 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 1.\nIt can be shown that there is only 1 beautiful integer in the given range.\n
\n\n

Example 3:

\n\n
\nInput: low = 5, high = 5, k = 2\nOutput: 0\nExplanation: There are 0 beautiful integers in the given range.\n- 5 is not beautiful because it is not divisible by k = 2 and it does not contain equal even and odd digits.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 0 < low <= high <= 109
  • \n\t
  • 0 < k <= 20
  • \n
\n", + "translatedTitle": "范围中美丽整数的数目", + "translatedContent": "

给你正整数 low ,high 和 k 。

\n\n

如果一个数满足以下两个条件,那么它是 美丽的 :

\n\n
    \n\t
  • 偶数数位的数目与奇数数位的数目相同。
  • \n\t
  • 这个整数可以被 k 整除。
  • \n
\n\n

请你返回范围 [low, high] 中美丽整数的数目。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:low = 10, high = 20, k = 3\n输出:2\n解释:给定范围中有 2 个美丽数字:[12,18]\n- 12 是美丽整数,因为它有 1 个奇数数位和 1 个偶数数位,而且可以被 k = 3 整除。\n- 18 是美丽整数,因为它有 1 个奇数数位和 1 个偶数数位,而且可以被 k = 3 整除。\n以下是一些不是美丽整数的例子:\n- 16 不是美丽整数,因为它不能被 k = 3 整除。\n- 15 不是美丽整数,因为它的奇数数位和偶数数位的数目不相等。\n给定范围内总共有 2 个美丽整数。\n
\n\n

示例 2:

\n\n
\n输入:low = 1, high = 10, k = 1\n输出:1\n解释:给定范围中有 1 个美丽数字:[10]\n- 10 是美丽整数,因为它有 1 个奇数数位和 1 个偶数数位,而且可以被 k = 1 整除。\n给定范围内总共有 1 个美丽整数。\n
\n\n

示例 3:

\n\n
\n输入:low = 5, high = 5, k = 2\n输出:0\n解释:给定范围中有 0 个美丽数字。\n- 5 不是美丽整数,因为它的奇数数位和偶数数位的数目不相等。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 0 < low <= high <= 109
  • \n\t
  • 0 < k <= 20
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 6, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int numberOfBeautifulIntegers(int low, int high, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int numberOfBeautifulIntegers(int low, int high, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def numberOfBeautifulIntegers(self, low, high, k):\n \"\"\"\n :type low: int\n :type high: int\n :type k: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int numberOfBeautifulIntegers(int low, int high, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int NumberOfBeautifulIntegers(int low, int high, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} low\n * @param {number} high\n * @param {number} k\n * @return {number}\n */\nvar numberOfBeautifulIntegers = function(low, high, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} low\n# @param {Integer} high\n# @param {Integer} k\n# @return {Integer}\ndef number_of_beautiful_integers(low, high, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func numberOfBeautifulIntegers(_ low: Int, _ high: Int, _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func numberOfBeautifulIntegers(low int, high int, k int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def numberOfBeautifulIntegers(low: Int, high: Int, k: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun numberOfBeautifulIntegers(low: Int, high: Int, k: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn number_of_beautiful_integers(low: i32, high: i32, k: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $low\n * @param Integer $high\n * @param Integer $k\n * @return Integer\n */\n function numberOfBeautifulIntegers($low, $high, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function numberOfBeautifulIntegers(low: number, high: number, k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (number-of-beautiful-integers low high k)\n (-> exact-integer? exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec number_of_beautiful_integers(Low :: integer(), High :: integer(), K :: integer()) -> integer().\nnumber_of_beautiful_integers(Low, High, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec number_of_beautiful_integers(low :: integer, high :: integer, k :: integer) :: integer\n def number_of_beautiful_integers(low, high, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int numberOfBeautifulIntegers(int low, int high, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1K\", \"totalSubmission\": \"4.3K\", \"totalAcceptedRaw\": 1036, \"totalSubmissionRaw\": 4343, \"acRate\": \"23.9%\"}", + "hints": [ + "
The intended solution uses Dynamic Programming.
", + "
Let f(n) denote number of beautiful integers in the range [1…n] , then the answer is f(r) - f(l-1) .
" + ], + "solution": null, + "status": null, + "sampleTestCase": "10\n20\n3", + "metaData": "{\n \"name\": \"numberOfBeautifulIntegers\",\n \"params\": [\n {\n \"name\": \"low\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"high\"\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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\n20\n3\n1\n10\n1\n5\n5\n2", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/sorting-three-groups.json b/leetcode-cn/originData/sorting-three-groups.json new file mode 100644 index 00000000..67318bf2 --- /dev/null +++ b/leetcode-cn/originData/sorting-three-groups.json @@ -0,0 +1,165 @@ +{ + "data": { + "question": { + "questionId": "2904", + "questionFrontendId": "6941", + "categoryTitle": "Algorithms", + "boundTopicId": 2393664, + "title": "Sorting Three Groups", + "titleSlug": "sorting-three-groups", + "content": "

You are given a 0-indexed integer array nums of length n.
\n
\nThe numbers from 0 to n - 1 are divided into three groups numbered from 1 to 3, where number i belongs to group nums[i]. Notice that some groups may be empty.
\n
\nYou are allowed to perform this operation any number of times:

\n\n
    \n\t
  • Pick number x and change its group. More formally, change nums[x] to any number from 1 to 3.
  • \n
\n\n

A new array res is constructed using the following procedure:

\n\n
    \n\t
  1. Sort the numbers in each group independently.
  2. \n\t
  3. Append the elements of groups 1, 2, and 3 to res in this order.
  4. \n
\n\n

Array nums is called a beautiful array if the constructed array res is sorted in non-decreasing order.

\n\n

Return the minimum number of operations to make nums a beautiful array.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [2,1,3,2,1]\nOutput: 3\nExplanation: It's optimal to perform three operations:\n1. change nums[0] to 1.\n2. change nums[2] to 1.\n3. change nums[3] to 1.\nAfter performing the operations and sorting the numbers in each group, group 1 becomes equal to [0,1,2,3,4] and group 2 and group 3 become empty. Hence, res is equal to [0,1,2,3,4] which is sorted in non-decreasing order.\nIt can be proven that there is no valid sequence of less than three operations.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,3,2,1,3,3]\nOutput: 2\nExplanation: It's optimal to perform two operations:\n1. change nums[1] to 1.\n2. change nums[2] to 1.\nAfter performing the operations and sorting the numbers in each group, group 1 becomes equal to [0,1,2,3], group 2 becomes empty, and group 3 becomes equal to [4,5]. Hence, res is equal to [0,1,2,3,4,5] which is sorted in non-decreasing order.\nIt can be proven that there is no valid sequence of less than two operations.\n
\n\n

Example 3:

\n\n
\nInput: nums = [2,2,2,2,3,3]\nOutput: 0\nExplanation: It's optimal to not perform operations.\nAfter sorting the numbers in each group, group 1 becomes empty, group 2 becomes equal to [0,1,2,3] and group 3 becomes equal to [4,5]. Hence, res is equal to [0,1,2,3,4,5] which is sorted in non-decreasing order.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 100
  • \n\t
  • 1 <= nums[i] <= 3
  • \n
\n", + "translatedTitle": "将三个组排序", + "translatedContent": "

给你一个下标从 0 开始长度为 n 的整数数组 nums 。
\n
\n从 0 到 n - 1 的数字被分为编号从 1 到 3 的三个组,数字 i 属于组 nums[i] 。注意,有的组可能是 空的 。
\n
\n你可以执行以下操作任意次:

\n\n
    \n\t
  • 选择数字 x 并改变它的组。更正式的,你可以将 nums[x] 改为数字 1 到 3 中的任意一个。
  • \n
\n\n

你将按照以下过程构建一个新的数组 res :

\n\n
    \n\t
  1. 将每个组中的数字分别排序。
  2. \n\t
  3. 将组 1 ,2 和 3 中的元素 依次 连接以得到 res 。
  4. \n
\n\n

如果得到的 res 是 非递减顺序的,那么我们称数组 nums 是 美丽数组 。

\n\n

请你返回将 nums 变为 美丽数组 需要的最少步数。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums = [2,1,3,2,1]\n输出:3\n解释:以下三步操作是最优方案:\n1. 将 nums[0] 变为 1 。\n2. 将 nums[2] 变为 1 。\n3. 将 nums[3] 变为 1 。\n执行以上操作后,将每组中的数字排序,组 1 为 [0,1,2,3,4] ,组 2 和组 3 都为空。所以 res 等于 [0,1,2,3,4] ,它是非递减顺序的。\n三步操作是最少需要的步数。\n
\n\n

示例 2:

\n\n
\n输入:nums = [1,3,2,1,3,3]\n输出:2\n解释:以下两步操作是最优方案:\n1. 将 nums[1] 变为 1 。\n2. 将 nums[2] 变为 1 。\n执行以上操作后,将每组中的数字排序,组 1 为 [0,1,2,3] ,组 2 为空,组 3 为 [4,5] 。所以 res 等于 [0,1,2,3,4,5] ,它是非递减顺序的。\n两步操作是最少需要的步数。\n
\n\n

示例 3:

\n\n
\n输入:nums = [2,2,2,2,3,3]\n输出:0\n解释:不需要执行任何操作。\n组 1 为空,组 2 为 [0,1,2,3] ,组 3 为 [4,5] 。所以 res 等于 [0,1,2,3,4,5] ,它是非递减顺序的。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 100
  • \n\t
  • 1 <= nums[i] <= 3
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 3, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"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, \"pythondata\": false, \"react\": false, \"vanillajs\": false}", + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minimumOperations(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumOperations(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumOperations(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumOperations(self, nums: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minimumOperations(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumOperations(IList nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar minimumOperations = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef minimum_operations(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumOperations(_ nums: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumOperations(nums []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumOperations(nums: List[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumOperations(nums: List): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_operations(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 minimumOperations($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumOperations(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-operations nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_operations(Nums :: [integer()]) -> integer().\nminimum_operations(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_operations(nums :: [integer]) :: integer\n def minimum_operations(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minimumOperations(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"4.2K\", \"totalAcceptedRaw\": 1867, \"totalSubmissionRaw\": 4186, \"acRate\": \"44.6%\"}", + "hints": [ + "The problem asks to change the array nums to make it sorted (i.e., all the 1s are on the left of 2s, and all the 2s are on the left of 3s.).", + "We can try all the possibilities to make nums indices range in [0, i) to 0 and [i, j) to 1 and [j, n) to 2. Note the ranges are left-close and right-open; each might be empty. Namely, 0 <= i <= j <= n.", + "Count the changes we need for each possibility by comparing the expected and original values at each index position." + ], + "solution": null, + "status": null, + "sampleTestCase": "[2,1,3,2,1]", + "metaData": "{\n \"name\": \"minimumOperations\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\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++ 20\\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.18<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/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 5.1.6<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n

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

\\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 datastructures-js\\/priority-queue@5.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": "[2,1,3,2,1]\n[1,3,2,1,3,3]\n[2,2,2,2,3,3]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/k-avoiding 数组的最小总和 [determine-the-minimum-sum-of-a-k-avoiding-array].html b/leetcode-cn/problem (Chinese)/k-avoiding 数组的最小总和 [determine-the-minimum-sum-of-a-k-avoiding-array].html new file mode 100644 index 00000000..330f4b15 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/k-avoiding 数组的最小总和 [determine-the-minimum-sum-of-a-k-avoiding-array].html @@ -0,0 +1,33 @@ +

给你两个整数 nk

+ +

对于一个由 不同 正整数组成的数组,如果其中不存在任何求和等于 k 的不同元素对,则称其为 k-avoiding 数组。

+ +

返回长度为 nk-avoiding 数组的可能的最小总和。

+ +

 

+ +

示例 1:

+ +
+输入:n = 5, k = 4
+输出:18
+解释:设若 k-avoiding 数组为 [1,2,4,5,6] ,其元素总和为 18 。
+可以证明不存在总和小于 18 的 k-avoiding 数组。
+
+ +

示例 2:

+ +
+输入:n = 2, k = 6
+输出:3
+解释:可以构造数组 [1,2] ,其元素总和为 3 。
+可以证明不存在总和小于 3 的 k-avoiding 数组。 
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n, k <= 50
  • +
diff --git a/leetcode-cn/problem (Chinese)/判别首字母缩略词 [check-if-a-string-is-an-acronym-of-words].html b/leetcode-cn/problem (Chinese)/判别首字母缩略词 [check-if-a-string-is-an-acronym-of-words].html new file mode 100644 index 00000000..a3e4c60e --- /dev/null +++ b/leetcode-cn/problem (Chinese)/判别首字母缩略词 [check-if-a-string-is-an-acronym-of-words].html @@ -0,0 +1,45 @@ +

给你一个字符串数组 words 和一个字符串 s ,请你判断 s 是不是 words首字母缩略词

+ +

如果可以按顺序串联 words 中每个字符串的第一个字符形成字符串 s ,则认为 swords 的首字母缩略词。例如,"ab" 可以由 ["apple", "banana"] 形成,但是无法从 ["bear", "aardvark"] 形成。

+ +

如果 swords 的首字母缩略词,返回 true ;否则,返回 false

+ +

 

+ +

示例 1:

+ +
+输入:words = ["alice","bob","charlie"], s = "abc"
+输出:true
+解释:words 中 "alice"、"bob" 和 "charlie" 的第一个字符分别是 'a'、'b' 和 'c'。因此,s = "abc" 是首字母缩略词。 
+
+ +

示例 2:

+ +
+输入:words = ["an","apple"], s = "a"
+输出:false
+解释:words 中 "an" 和 "apple" 的第一个字符分别是 'a' 和 'a'。
+串联这些字符形成的首字母缩略词是 "aa" 。
+因此,s = "a" 不是首字母缩略词。
+
+ +

示例 3:

+ +
+输入:words = ["never","gonna","give","up","on","you"], s = "ngguoy"
+输出:true
+解释:串联数组 words 中每个字符串的第一个字符,得到字符串 "ngguoy" 。
+因此,s = "ngguoy" 是首字母缩略词。 
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= words.length <= 100
  • +
  • 1 <= words[i].length <= 10
  • +
  • 1 <= s.length <= 100
  • +
  • words[i]s 由小写英文字母组成
  • +
diff --git a/leetcode-cn/problem (Chinese)/将三个组排序 [sorting-three-groups].html b/leetcode-cn/problem (Chinese)/将三个组排序 [sorting-three-groups].html new file mode 100644 index 00000000..d215c1a9 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/将三个组排序 [sorting-three-groups].html @@ -0,0 +1,65 @@ +

给你一个下标从 0 开始长度为 n 的整数数组 nums 。
+
+从 0 到 n - 1 的数字被分为编号从 1 到 3 的三个组,数字 i 属于组 nums[i] 。注意,有的组可能是 空的 。
+
+你可以执行以下操作任意次:

+ +
    +
  • 选择数字 x 并改变它的组。更正式的,你可以将 nums[x] 改为数字 1 到 3 中的任意一个。
  • +
+ +

你将按照以下过程构建一个新的数组 res :

+ +
    +
  1. 将每个组中的数字分别排序。
  2. +
  3. 将组 1 ,2 和 3 中的元素 依次 连接以得到 res 。
  4. +
+ +

如果得到的 res 是 非递减顺序的,那么我们称数组 nums 是 美丽数组 。

+ +

请你返回将 nums 变为 美丽数组 需要的最少步数。

+ +

 

+ +

示例 1:

+ +
+输入:nums = [2,1,3,2,1]
+输出:3
+解释:以下三步操作是最优方案:
+1. 将 nums[0] 变为 1 。
+2. 将 nums[2] 变为 1 。
+3. 将 nums[3] 变为 1 。
+执行以上操作后,将每组中的数字排序,组 1 为 [0,1,2,3,4] ,组 2 和组 3 都为空。所以 res 等于 [0,1,2,3,4] ,它是非递减顺序的。
+三步操作是最少需要的步数。
+
+ +

示例 2:

+ +
+输入:nums = [1,3,2,1,3,3]
+输出:2
+解释:以下两步操作是最优方案:
+1. 将 nums[1] 变为 1 。
+2. 将 nums[2] 变为 1 。
+执行以上操作后,将每组中的数字排序,组 1 为 [0,1,2,3] ,组 2 为空,组 3 为 [4,5] 。所以 res 等于 [0,1,2,3,4,5] ,它是非递减顺序的。
+两步操作是最少需要的步数。
+
+ +

示例 3:

+ +
+输入:nums = [2,2,2,2,3,3]
+输出:0
+解释:不需要执行任何操作。
+组 1 为空,组 2 为 [0,1,2,3] ,组 3 为 [4,5] 。所以 res 等于 [0,1,2,3,4,5] ,它是非递减顺序的。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 100
  • +
  • 1 <= nums[i] <= 3
  • +
diff --git a/leetcode-cn/problem (Chinese)/循环增长使字符串子序列等于另一个字符串 [make-string-a-subsequence-using-cyclic-increments].html b/leetcode-cn/problem (Chinese)/循环增长使字符串子序列等于另一个字符串 [make-string-a-subsequence-using-cyclic-increments].html new file mode 100644 index 00000000..7b83b8cd --- /dev/null +++ b/leetcode-cn/problem (Chinese)/循环增长使字符串子序列等于另一个字符串 [make-string-a-subsequence-using-cyclic-increments].html @@ -0,0 +1,46 @@ +

给你一个下标从 0 开始的字符串 str1 和 str2 。

+ +

一次操作中,你选择 str1 中的若干下标。对于选中的每一个下标 i ,你将 str1[i] 循环 递增,变成下一个字符。也就是说 'a' 变成 'b' ,'b' 变成 'c' ,以此类推,'z' 变成 'a' 。

+ +

如果执行以上操作 至多一次 ,可以让 str2 成为 str1 的子序列,请你返回 true ,否则返回 false 。

+ +

注意:一个字符串的子序列指的是从原字符串中删除一些(可以一个字符也不删)字符后,剩下字符按照原本先后顺序组成的新字符串。

+ +

 

+ +

示例 1:

+ +
+输入:str1 = "abc", str2 = "ad"
+输出:true
+解释:选择 str1 中的下标 2 。
+将 str1[2] 循环递增,得到 'd' 。
+因此,str1 变成 "abd" 且 str2 现在是一个子序列。所以返回 true 。
+ +

示例 2:

+ +
+输入:str1 = "zc", str2 = "ad"
+输出:true
+解释:选择 str1 中的下标 0 和 1 。
+将 str1[0] 循环递增得到 'a' 。
+将 str1[1] 循环递增得到 'd' 。
+因此,str1 变成 "ad" 且 str2 现在是一个子序列。所以返回 true 。
+ +

示例 3:

+ +
+输入:str1 = "ab", str2 = "d"
+输出:false
+解释:这个例子中,没法在执行一次操作的前提下,将 str2 变为 str1 的子序列。
+所以返回 false 。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= str1.length <= 105
  • +
  • 1 <= str2.length <= 105
  • +
  • str1 和 str2 只包含小写英文字母。
  • +
diff --git a/leetcode-cn/problem (Chinese)/找出最长等值子数组 [find-the-longest-equal-subarray].html b/leetcode-cn/problem (Chinese)/找出最长等值子数组 [find-the-longest-equal-subarray].html new file mode 100644 index 00000000..4de7a713 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/找出最长等值子数组 [find-the-longest-equal-subarray].html @@ -0,0 +1,41 @@ +

给你一个下标从 0 开始的整数数组 nums 和一个整数 k

+ +

如果子数组中所有元素都相等,则认为子数组是一个 等值子数组 。注意,空数组是 等值子数组

+ +

nums 中删除最多 k 个元素后,返回可能的最长等值子数组的长度。

+ +

子数组 是数组中一个连续且可能为空的元素序列。

+ +

 

+ +

示例 1:

+ +
+输入:nums = [1,3,2,3,1,3], k = 3
+输出:3
+解释:最优的方案是删除下标 2 和下标 4 的元素。
+删除后,nums 等于 [1, 3, 3, 3] 。
+最长等值子数组从 i = 1 开始到 j = 3 结束,长度等于 3 。
+可以证明无法创建更长的等值子数组。
+
+ +

示例 2:

+ +
+输入:nums = [1,1,2,2,1,1], k = 2
+输出:4
+解释:最优的方案是删除下标 2 和下标 3 的元素。 
+删除后,nums 等于 [1, 1, 1, 1] 。 
+数组自身就是等值子数组,长度等于 4 。 
+可以证明无法创建更长的等值子数组。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= nums.length
  • +
  • 0 <= k <= nums.length
  • +
diff --git a/leetcode-cn/problem (Chinese)/操作使得分最大 [apply-operations-to-maximize-score].html b/leetcode-cn/problem (Chinese)/操作使得分最大 [apply-operations-to-maximize-score].html new file mode 100644 index 00000000..c3957a09 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/操作使得分最大 [apply-operations-to-maximize-score].html @@ -0,0 +1,51 @@ +

给你一个长度为 n 的正整数数组 nums 和一个整数 k 。

+ +

一开始,你的分数为 1 。你可以进行以下操作至多 k 次,目标是使你的分数最大:

+ +
    +
  • 选择一个之前没有选过的 非空 子数组 nums[l, ..., r] 。
  • +
  • 从 nums[l, ..., r] 里面选择一个 质数分数 最高的元素 x 。如果多个元素质数分数相同且最高,选择下标最小的一个。
  • +
  • 将你的分数乘以 x 。
  • +
+ +

nums[l, ..., r] 表示 nums 中起始下标为 l ,结束下标为 r 的子数组,两个端点都包含。

+ +

一个整数的 质数分数 等于 x 不同质因子的数目。比方说, 300 的质数分数为 3 ,因为 300 = 2 * 2 * 3 * 5 * 5 。

+ +

请你返回进行至多 k 次操作后,可以得到的 最大分数 。

+ +

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

+ +

 

+ +

示例 1:

+ +
+输入:nums = [8,3,9,3,8], k = 2
+输出:81
+解释:进行以下操作可以得到分数 81 :
+- 选择子数组 nums[2, ..., 2] 。nums[2] 是子数组中唯一的元素。所以我们将分数乘以 nums[2] ,分数变为 1 * 9 = 9 。
+- 选择子数组 nums[2, ..., 3] 。nums[2] 和 nums[3] 质数分数都为 1 ,但是 nums[2] 下标更小。所以我们将分数乘以 nums[2] ,分数变为 9 * 9 = 81 。
+81 是可以得到的最高得分。
+ +

示例 2:

+ +
+输入:nums = [19,12,14,6,10,18], k = 3
+输出:4788
+解释:进行以下操作可以得到分数 4788 :
+- 选择子数组 nums[0, ..., 0] 。nums[0] 是子数组中唯一的元素。所以我们将分数乘以 nums[0] ,分数变为 1 * 19 = 19 。
+- 选择子数组 nums[5, ..., 5] 。nums[5] 是子数组中唯一的元素。所以我们将分数乘以 nums[5] ,分数变为 19 * 18 = 342 。
+- 选择子数组 nums[2, ..., 3] 。nums[2] 和 nums[3] 质数分数都为 2,但是 nums[2] 下标更小。所以我们将分数乘以 nums[2] ,分数变为  342 * 14 = 4788 。
+4788 是可以得到的最高的分。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length == n <= 105
  • +
  • 1 <= nums[i] <= 105
  • +
  • 1 <= k <= min(n * (n + 1) / 2, 109)
  • +
diff --git a/leetcode-cn/problem (Chinese)/数组中的最大数对和 [max-pair-sum-in-an-array].html b/leetcode-cn/problem (Chinese)/数组中的最大数对和 [max-pair-sum-in-an-array].html new file mode 100644 index 00000000..7e833734 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/数组中的最大数对和 [max-pair-sum-in-an-array].html @@ -0,0 +1,30 @@ +

给你一个下标从 0 开始的整数数组 nums 。请你从 nums 中找出和 最大 的一对数,且这两个数数位上最大的数字相等。

+ +

返回最大和,如果不存在满足题意的数字对,返回 -1

+ +

 

+ +

示例 1:

+ +
输入:nums = [51,71,17,24,42]
+输出:88
+解释:
+i = 1 和 j = 2 ,nums[i] 和 nums[j] 数位上最大的数字相等,且这一对的总和 71 + 17 = 88 。 
+i = 3 和 j = 4 ,nums[i] 和 nums[j] 数位上最大的数字相等,且这一对的总和 24 + 42 = 66 。
+可以证明不存在其他数对满足数位上最大的数字相等,所以答案是 88 。
+ +

示例 2:

+ +
输入:nums = [1,2,3,4]
+输出:-1
+解释:不存在数对满足数位上最大的数字相等。
+
+ +

 

+ +

提示:

+ +
    +
  • 2 <= nums.length <= 100
  • +
  • 1 <= nums[i] <= 104
  • +
diff --git a/leetcode-cn/problem (Chinese)/统计和小于目标的下标对数目 [count-pairs-whose-sum-is-less-than-target].html b/leetcode-cn/problem (Chinese)/统计和小于目标的下标对数目 [count-pairs-whose-sum-is-less-than-target].html new file mode 100644 index 00000000..96344814 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/统计和小于目标的下标对数目 [count-pairs-whose-sum-is-less-than-target].html @@ -0,0 +1,41 @@ +给你一个下标从 0 开始长度为 n 的整数数组 nums 和一个整数 target ,请你返回满足 0 <= i < j < nnums[i] + nums[j] < target 的下标对 (i, j) 的数目。 +

 

+ +

示例 1:

+ +
+输入:nums = [-1,1,2,3,1], target = 2
+输出:3
+解释:总共有 3 个下标对满足题目描述:
+- (0, 1) ,0 < 1 且 nums[0] + nums[1] = 0 < target
+- (0, 2) ,0 < 2 且 nums[0] + nums[2] = 1 < target 
+- (0, 4) ,0 < 4 且 nums[0] + nums[4] = 0 < target
+注意 (0, 3) 不计入答案因为 nums[0] + nums[3] 不是严格小于 target 。
+
+ +

示例 2:

+ +
+输入:nums = [-6,2,5,-2,-7,-1,3], target = -2
+输出:10
+解释:总共有 10 个下标对满足题目描述:
+- (0, 1) ,0 < 1 且 nums[0] + nums[1] = -4 < target
+- (0, 3) ,0 < 3 且 nums[0] + nums[3] = -8 < target
+- (0, 4) ,0 < 4 且 nums[0] + nums[4] = -13 < target
+- (0, 5) ,0 < 5 且 nums[0] + nums[5] = -7 < target
+- (0, 6) ,0 < 6 且 nums[0] + nums[6] = -3 < target
+- (1, 4) ,1 < 4 且 nums[1] + nums[4] = -5 < target
+- (3, 4) ,3 < 4 且 nums[3] + nums[4] = -9 < target
+- (3, 5) ,3 < 5 且 nums[3] + nums[5] = -3 < target
+- (4, 5) ,4 < 5 且 nums[4] + nums[5] = -8 < target
+- (4, 6) ,4 < 6 且 nums[4] + nums[6] = -4 < target
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length == n <= 50
  • +
  • -50 <= nums[i], target <= 50
  • +
diff --git a/leetcode-cn/problem (Chinese)/翻倍以链表形式表示的数字 [double-a-number-represented-as-a-linked-list].html b/leetcode-cn/problem (Chinese)/翻倍以链表形式表示的数字 [double-a-number-represented-as-a-linked-list].html new file mode 100644 index 00000000..914d80da --- /dev/null +++ b/leetcode-cn/problem (Chinese)/翻倍以链表形式表示的数字 [double-a-number-represented-as-a-linked-list].html @@ -0,0 +1,30 @@ +

给你一个 非空 链表的头节点 head ,表示一个不含前导零的非负数整数。

+ +

将链表 翻倍 后,返回头节点 head

+ +

 

+ +

示例 1:

+ +
+输入:head = [1,8,9]
+输出:[3,7,8]
+解释:上图中给出的链表,表示数字 189 。返回的链表表示数字 189 * 2 = 378 。
+ +

示例 2:

+ +
+输入:head = [9,9,9]
+输出:[1,9,9,8]
+解释:上图中给出的链表,表示数字 999 。返回的链表表示数字 999 * 2 = 1998 。
+
+ +

 

+ +

提示:

+ +
    +
  • 链表中节点的数目在范围 [1, 104]
  • +
  • 0 <= Node.val <= 9
  • +
  • 生成的输入满足:链表表示一个不含前导零的数字,除了数字 0 本身。
  • +
diff --git a/leetcode-cn/problem (Chinese)/范围中美丽整数的数目 [number-of-beautiful-integers-in-the-range].html b/leetcode-cn/problem (Chinese)/范围中美丽整数的数目 [number-of-beautiful-integers-in-the-range].html new file mode 100644 index 00000000..7245490d --- /dev/null +++ b/leetcode-cn/problem (Chinese)/范围中美丽整数的数目 [number-of-beautiful-integers-in-the-range].html @@ -0,0 +1,54 @@ +

给你正整数 low ,high 和 k 。

+ +

如果一个数满足以下两个条件,那么它是 美丽的 :

+ +
    +
  • 偶数数位的数目与奇数数位的数目相同。
  • +
  • 这个整数可以被 k 整除。
  • +
+ +

请你返回范围 [low, high] 中美丽整数的数目。

+ +

 

+ +

示例 1:

+ +
+输入:low = 10, high = 20, k = 3
+输出:2
+解释:给定范围中有 2 个美丽数字:[12,18]
+- 12 是美丽整数,因为它有 1 个奇数数位和 1 个偶数数位,而且可以被 k = 3 整除。
+- 18 是美丽整数,因为它有 1 个奇数数位和 1 个偶数数位,而且可以被 k = 3 整除。
+以下是一些不是美丽整数的例子:
+- 16 不是美丽整数,因为它不能被 k = 3 整除。
+- 15 不是美丽整数,因为它的奇数数位和偶数数位的数目不相等。
+给定范围内总共有 2 个美丽整数。
+
+ +

示例 2:

+ +
+输入:low = 1, high = 10, k = 1
+输出:1
+解释:给定范围中有 1 个美丽数字:[10]
+- 10 是美丽整数,因为它有 1 个奇数数位和 1 个偶数数位,而且可以被 k = 1 整除。
+给定范围内总共有 1 个美丽整数。
+
+ +

示例 3:

+ +
+输入:low = 5, high = 5, k = 2
+输出:0
+解释:给定范围中有 0 个美丽数字。
+- 5 不是美丽整数,因为它的奇数数位和偶数数位的数目不相等。
+
+ +

 

+ +

提示:

+ +
    +
  • 0 < low <= high <= 109
  • +
  • 0 < k <= 20
  • +
diff --git a/leetcode-cn/problem (Chinese)/销售利润最大化 [maximize-the-profit-as-the-salesman].html b/leetcode-cn/problem (Chinese)/销售利润最大化 [maximize-the-profit-as-the-salesman].html new file mode 100644 index 00000000..2d5f4537 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/销售利润最大化 [maximize-the-profit-as-the-salesman].html @@ -0,0 +1,42 @@ +

给你一个整数 n 表示数轴上的房屋数量,编号从 0n - 1

+ +

另给你一个二维整数数组 offers ,其中 offers[i] = [starti, endi, goldi] 表示第 i 个买家想要以 goldi 枚金币的价格购买从 startiendi 的所有房屋。

+ +

作为一名销售,你需要有策略地选择并销售房屋使自己的收入最大化。

+ +

返回你可以赚取的金币的最大数目。

+ +

注意 同一所房屋不能卖给不同的买家,并且允许保留一些房屋不进行出售。

+ +

 

+ +

示例 1:

+ +
+输入:n = 5, offers = [[0,0,1],[0,2,2],[1,3,2]]
+输出:3
+解释:
+有 5 所房屋,编号从 0 到 4 ,共有 3 个购买要约。
+将位于 [0,0] 范围内的房屋以 1 金币的价格出售给第 1 位买家,并将位于 [1,3] 范围内的房屋以 2 金币的价格出售给第 3 位买家。
+可以证明我们最多只能获得 3 枚金币。
+ +

示例 2:

+ +
+输入:n = 5, offers = [[0,0,1],[0,2,10],[1,3,2]]
+输出:10
+解释:有 5 所房屋,编号从 0 到 4 ,共有 3 个购买要约。
+将位于 [0,2] 范围内的房屋以 10 金币的价格出售给第 2 位买家。
+可以证明我们最多只能获得 10 枚金币。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 105
  • +
  • 1 <= offers.length <= 105
  • +
  • offers[i].length == 3
  • +
  • 0 <= starti <= endi <= n - 1
  • +
  • 1 <= goldi <= 103
  • +
diff --git a/leetcode-cn/problem (Chinese)/限制条件下元素之间的最小绝对差 [minimum-absolute-difference-between-elements-with-constraint].html b/leetcode-cn/problem (Chinese)/限制条件下元素之间的最小绝对差 [minimum-absolute-difference-between-elements-with-constraint].html new file mode 100644 index 00000000..132162d8 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/限制条件下元素之间的最小绝对差 [minimum-absolute-difference-between-elements-with-constraint].html @@ -0,0 +1,49 @@ +

给你一个下标从 0 开始的整数数组 nums 和一个整数 x 。

+ +

请你找到数组中下标距离至少为 x 的两个元素的 差值绝对值 的 最小值 。

+ +

换言之,请你找到两个下标 i 和 j ,满足 abs(i - j) >= x 且 abs(nums[i] - nums[j]) 的值最小。

+ +

请你返回一个整数,表示下标距离至少为 x 的两个元素之间的差值绝对值的 最小值 。

+ +

 

+ +

示例 1:

+ +
+输入:nums = [4,3,2,4], x = 2
+输出:0
+解释:我们选择 nums[0] = 4 和 nums[3] = 4 。
+它们下标距离满足至少为 2 ,差值绝对值为最小值 0 。
+0 是最优解。
+
+ +

示例 2:

+ +
+输入:nums = [5,3,2,10,15], x = 1
+输出:1
+解释:我们选择 nums[1] = 3 和 nums[2] = 2 。
+它们下标距离满足至少为 1 ,差值绝对值为最小值 1 。
+1 是最优解。
+
+ +

示例 3:

+ +
+输入:nums = [1,2,3,4], x = 3
+输出:3
+解释:我们选择 nums[0] = 1 和 nums[3] = 4 。
+它们下标距离满足至少为 3 ,差值绝对值为最小值 3 。
+3 是最优解。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
  • 0 <= x < nums.length
  • +
diff --git a/leetcode-cn/problem (English)/k-avoiding 数组的最小总和(English) [determine-the-minimum-sum-of-a-k-avoiding-array].html b/leetcode-cn/problem (English)/k-avoiding 数组的最小总和(English) [determine-the-minimum-sum-of-a-k-avoiding-array].html new file mode 100644 index 00000000..a31d8716 --- /dev/null +++ b/leetcode-cn/problem (English)/k-avoiding 数组的最小总和(English) [determine-the-minimum-sum-of-a-k-avoiding-array].html @@ -0,0 +1,31 @@ +

You are given two integers, n and k.

+ +

An array of distinct positive integers is called a k-avoiding array if there does not exist any pair of distinct elements that sum to k.

+ +

Return the minimum possible sum of a k-avoiding array of length n.

+ +

 

+

Example 1:

+ +
+Input: n = 5, k = 4
+Output: 18
+Explanation: Consider the k-avoiding array [1,2,4,5,6], which has a sum of 18.
+It can be proven that there is no k-avoiding array with a sum less than 18.
+
+ +

Example 2:

+ +
+Input: n = 2, k = 6
+Output: 3
+Explanation: We can construct the array [1,2], which has a sum of 3.
+It can be proven that there is no k-avoiding array with a sum less than 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n, k <= 50
  • +
diff --git a/leetcode-cn/problem (English)/判别首字母缩略词(English) [check-if-a-string-is-an-acronym-of-words].html b/leetcode-cn/problem (English)/判别首字母缩略词(English) [check-if-a-string-is-an-acronym-of-words].html new file mode 100644 index 00000000..f6745f58 --- /dev/null +++ b/leetcode-cn/problem (English)/判别首字母缩略词(English) [check-if-a-string-is-an-acronym-of-words].html @@ -0,0 +1,43 @@ +

Given an array of strings words and a string s, determine if s is an acronym of words.

+ +

The string s is considered an acronym of words if it can be formed by concatenating the first character of each string in words in order. For example, "ab" can be formed from ["apple", "banana"], but it can't be formed from ["bear", "aardvark"].

+ +

Return true if s is an acronym of words, and false otherwise.

+ +

 

+

Example 1:

+ +
+Input: words = ["alice","bob","charlie"], s = "abc"
+Output: true
+Explanation: The first character in the words "alice", "bob", and "charlie" are 'a', 'b', and 'c', respectively. Hence, s = "abc" is the acronym. 
+
+ +

Example 2:

+ +
+Input: words = ["an","apple"], s = "a"
+Output: false
+Explanation: The first character in the words "an" and "apple" are 'a' and 'a', respectively. 
+The acronym formed by concatenating these characters is "aa". 
+Hence, s = "a" is not the acronym.
+
+ +

Example 3:

+ +
+Input: words = ["never","gonna","give","up","on","you"], s = "ngguoy"
+Output: true
+Explanation: By concatenating the first character of the words in the array, we get the string "ngguoy". 
+Hence, s = "ngguoy" is the acronym.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 100
  • +
  • 1 <= words[i].length <= 10
  • +
  • 1 <= s.length <= 100
  • +
  • words[i] and s consist of lowercase English letters.
  • +
diff --git a/leetcode-cn/problem (English)/将三个组排序(English) [sorting-three-groups].html b/leetcode-cn/problem (English)/将三个组排序(English) [sorting-three-groups].html new file mode 100644 index 00000000..e8f55487 --- /dev/null +++ b/leetcode-cn/problem (English)/将三个组排序(English) [sorting-three-groups].html @@ -0,0 +1,63 @@ +

You are given a 0-indexed integer array nums of length n.
+
+The numbers from 0 to n - 1 are divided into three groups numbered from 1 to 3, where number i belongs to group nums[i]. Notice that some groups may be empty.
+
+You are allowed to perform this operation any number of times:

+ +
    +
  • Pick number x and change its group. More formally, change nums[x] to any number from 1 to 3.
  • +
+ +

A new array res is constructed using the following procedure:

+ +
    +
  1. Sort the numbers in each group independently.
  2. +
  3. Append the elements of groups 1, 2, and 3 to res in this order.
  4. +
+ +

Array nums is called a beautiful array if the constructed array res is sorted in non-decreasing order.

+ +

Return the minimum number of operations to make nums a beautiful array.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,1,3,2,1]
+Output: 3
+Explanation: It's optimal to perform three operations:
+1. change nums[0] to 1.
+2. change nums[2] to 1.
+3. change nums[3] to 1.
+After performing the operations and sorting the numbers in each group, group 1 becomes equal to [0,1,2,3,4] and group 2 and group 3 become empty. Hence, res is equal to [0,1,2,3,4] which is sorted in non-decreasing order.
+It can be proven that there is no valid sequence of less than three operations.
+
+ +

Example 2:

+ +
+Input: nums = [1,3,2,1,3,3]
+Output: 2
+Explanation: It's optimal to perform two operations:
+1. change nums[1] to 1.
+2. change nums[2] to 1.
+After performing the operations and sorting the numbers in each group, group 1 becomes equal to [0,1,2,3], group 2 becomes empty, and group 3 becomes equal to [4,5]. Hence, res is equal to [0,1,2,3,4,5] which is sorted in non-decreasing order.
+It can be proven that there is no valid sequence of less than two operations.
+
+ +

Example 3:

+ +
+Input: nums = [2,2,2,2,3,3]
+Output: 0
+Explanation: It's optimal to not perform operations.
+After sorting the numbers in each group, group 1 becomes empty, group 2 becomes equal to [0,1,2,3] and group 3 becomes equal to [4,5]. Hence, res is equal to [0,1,2,3,4,5] which is sorted in non-decreasing order.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
  • +
  • 1 <= nums[i] <= 3
  • +
diff --git a/leetcode-cn/problem (English)/循环增长使字符串子序列等于另一个字符串(English) [make-string-a-subsequence-using-cyclic-increments].html b/leetcode-cn/problem (English)/循环增长使字符串子序列等于另一个字符串(English) [make-string-a-subsequence-using-cyclic-increments].html new file mode 100644 index 00000000..1a37c123 --- /dev/null +++ b/leetcode-cn/problem (English)/循环增长使字符串子序列等于另一个字符串(English) [make-string-a-subsequence-using-cyclic-increments].html @@ -0,0 +1,44 @@ +

You are given two 0-indexed strings str1 and str2.

+ +

In an operation, you select a set of indices in str1, and for each index i in the set, increment str1[i] to the next character cyclically. That is 'a' becomes 'b', 'b' becomes 'c', and so on, and 'z' becomes 'a'.

+ +

Return true if it is possible to make str2 a subsequence of str1 by performing the operation at most once, and false otherwise.

+ +

Note: A subsequence of a string is a new string that is formed from the original string by deleting some (possibly none) of the characters without disturbing the relative positions of the remaining characters.

+ +

 

+

Example 1:

+ +
+Input: str1 = "abc", str2 = "ad"
+Output: true
+Explanation: Select index 2 in str1.
+Increment str1[2] to become 'd'. 
+Hence, str1 becomes "abd" and str2 is now a subsequence. Therefore, true is returned.
+ +

Example 2:

+ +
+Input: str1 = "zc", str2 = "ad"
+Output: true
+Explanation: Select indices 0 and 1 in str1. 
+Increment str1[0] to become 'a'. 
+Increment str1[1] to become 'd'. 
+Hence, str1 becomes "ad" and str2 is now a subsequence. Therefore, true is returned.
+ +

Example 3:

+ +
+Input: str1 = "ab", str2 = "d"
+Output: false
+Explanation: In this example, it can be shown that it is impossible to make str2 a subsequence of str1 using the operation at most once. 
+Therefore, false is returned.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= str1.length <= 105
  • +
  • 1 <= str2.length <= 105
  • +
  • str1 and str2 consist of only lowercase English letters.
  • +
diff --git a/leetcode-cn/problem (English)/找出最长等值子数组(English) [find-the-longest-equal-subarray].html b/leetcode-cn/problem (English)/找出最长等值子数组(English) [find-the-longest-equal-subarray].html new file mode 100644 index 00000000..670ff7f5 --- /dev/null +++ b/leetcode-cn/problem (English)/找出最长等值子数组(English) [find-the-longest-equal-subarray].html @@ -0,0 +1,39 @@ +

You are given a 0-indexed integer array nums and an integer k.

+ +

A subarray is called equal if all of its elements are equal. Note that the empty subarray is an equal subarray.

+ +

Return the length of the longest possible equal subarray after deleting at most k elements from nums.

+ +

A subarray is a contiguous, possibly empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,2,3,1,3], k = 3
+Output: 3
+Explanation: It's optimal to delete the elements at index 2 and index 4.
+After deleting them, nums becomes equal to [1, 3, 3, 3].
+The longest equal subarray starts at i = 1 and ends at j = 3 with length equal to 3.
+It can be proven that no longer equal subarrays can be created.
+
+ +

Example 2:

+ +
+Input: nums = [1,1,2,2,1,1], k = 2
+Output: 4
+Explanation: It's optimal to delete the elements at index 2 and index 3.
+After deleting them, nums becomes equal to [1, 1, 1, 1].
+The array itself is an equal subarray, so the answer is 4.
+It can be proven that no longer equal subarrays can be created.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= nums.length
  • +
  • 0 <= k <= nums.length
  • +
diff --git a/leetcode-cn/problem (English)/操作使得分最大(English) [apply-operations-to-maximize-score].html b/leetcode-cn/problem (English)/操作使得分最大(English) [apply-operations-to-maximize-score].html new file mode 100644 index 00000000..1797c2d1 --- /dev/null +++ b/leetcode-cn/problem (English)/操作使得分最大(English) [apply-operations-to-maximize-score].html @@ -0,0 +1,49 @@ +

You are given an array nums of n positive integers and an integer k.

+ +

Initially, you start with a score of 1. You have to maximize your score by applying the following operation at most k times:

+ +
    +
  • Choose any non-empty subarray nums[l, ..., r] that you haven't chosen previously.
  • +
  • Choose an element x of nums[l, ..., r] with the highest prime score. If multiple such elements exist, choose the one with the smallest index.
  • +
  • Multiply your score by x.
  • +
+ +

Here, nums[l, ..., r] denotes the subarray of nums starting at index l and ending at the index r, both ends being inclusive.

+ +

The prime score of an integer x is equal to the number of distinct prime factors of x. For example, the prime score of 300 is 3 since 300 = 2 * 2 * 3 * 5 * 5.

+ +

Return the maximum possible score after applying at most k operations.

+ +

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

+ +

 

+

Example 1:

+ +
+Input: nums = [8,3,9,3,8], k = 2
+Output: 81
+Explanation: To get a score of 81, we can apply the following operations:
+- Choose subarray nums[2, ..., 2]. nums[2] is the only element in this subarray. Hence, we multiply the score by nums[2]. The score becomes 1 * 9 = 9.
+- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 1, but nums[2] has the smaller index. Hence, we multiply the score by nums[2]. The score becomes 9 * 9 = 81.
+It can be proven that 81 is the highest score one can obtain.
+ +

Example 2:

+ +
+Input: nums = [19,12,14,6,10,18], k = 3
+Output: 4788
+Explanation: To get a score of 4788, we can apply the following operations: 
+- Choose subarray nums[0, ..., 0]. nums[0] is the only element in this subarray. Hence, we multiply the score by nums[0]. The score becomes 1 * 19 = 19.
+- Choose subarray nums[5, ..., 5]. nums[5] is the only element in this subarray. Hence, we multiply the score by nums[5]. The score becomes 19 * 18 = 342.
+- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 2, but nums[2] has the smaller index. Hence, we multipy the score by nums[2]. The score becomes 342 * 14 = 4788.
+It can be proven that 4788 is the highest score one can obtain.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length == n <= 105
  • +
  • 1 <= nums[i] <= 105
  • +
  • 1 <= k <= min(n * (n + 1) / 2, 109)
  • +
diff --git a/leetcode-cn/problem (English)/数组中的最大数对和(English) [max-pair-sum-in-an-array].html b/leetcode-cn/problem (English)/数组中的最大数对和(English) [max-pair-sum-in-an-array].html new file mode 100644 index 00000000..eff2c316 --- /dev/null +++ b/leetcode-cn/problem (English)/数组中的最大数对和(English) [max-pair-sum-in-an-array].html @@ -0,0 +1,30 @@ +

You are given a 0-indexed integer array nums. You have to find the maximum sum of a pair of numbers from nums such that the maximum digit in both numbers are equal.

+ +

Return the maximum sum or -1 if no such pair exists.

+ +

 

+

Example 1:

+ +
+Input: nums = [51,71,17,24,42]
+Output: 88
+Explanation: 
+For i = 1 and j = 2, nums[i] and nums[j] have equal maximum digits with a pair sum of 71 + 17 = 88. 
+For i = 3 and j = 4, nums[i] and nums[j] have equal maximum digits with a pair sum of 24 + 42 = 66.
+It can be shown that there are no other pairs with equal maximum digits, so the answer is 88.
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4]
+Output: -1
+Explanation: No pair exists in nums with equal maximum digits.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 100
  • +
  • 1 <= nums[i] <= 104
  • +
diff --git a/leetcode-cn/problem (English)/统计和小于目标的下标对数目(English) [count-pairs-whose-sum-is-less-than-target].html b/leetcode-cn/problem (English)/统计和小于目标的下标对数目(English) [count-pairs-whose-sum-is-less-than-target].html new file mode 100644 index 00000000..ec1fc10a --- /dev/null +++ b/leetcode-cn/problem (English)/统计和小于目标的下标对数目(English) [count-pairs-whose-sum-is-less-than-target].html @@ -0,0 +1,39 @@ +Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target. +

 

+

Example 1:

+ +
+Input: nums = [-1,1,2,3,1], target = 2
+Output: 3
+Explanation: There are 3 pairs of indices that satisfy the conditions in the statement:
+- (0, 1) since 0 < 1 and nums[0] + nums[1] = 0 < target
+- (0, 2) since 0 < 2 and nums[0] + nums[2] = 1 < target 
+- (0, 4) since 0 < 4 and nums[0] + nums[4] = 0 < target
+Note that (0, 3) is not counted since nums[0] + nums[3] is not strictly less than the target.
+
+ +

Example 2:

+ +
+Input: nums = [-6,2,5,-2,-7,-1,3], target = -2
+Output: 10
+Explanation: There are 10 pairs of indices that satisfy the conditions in the statement:
+- (0, 1) since 0 < 1 and nums[0] + nums[1] = -4 < target
+- (0, 3) since 0 < 3 and nums[0] + nums[3] = -8 < target
+- (0, 4) since 0 < 4 and nums[0] + nums[4] = -13 < target
+- (0, 5) since 0 < 5 and nums[0] + nums[5] = -7 < target
+- (0, 6) since 0 < 6 and nums[0] + nums[6] = -3 < target
+- (1, 4) since 1 < 4 and nums[1] + nums[4] = -5 < target
+- (3, 4) since 3 < 4 and nums[3] + nums[4] = -9 < target
+- (3, 5) since 3 < 5 and nums[3] + nums[5] = -3 < target
+- (4, 5) since 4 < 5 and nums[4] + nums[5] = -8 < target
+- (4, 6) since 4 < 6 and nums[4] + nums[6] = -4 < target
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length == n <= 50
  • +
  • -50 <= nums[i], target <= 50
  • +
diff --git a/leetcode-cn/problem (English)/翻倍以链表形式表示的数字(English) [double-a-number-represented-as-a-linked-list].html b/leetcode-cn/problem (English)/翻倍以链表形式表示的数字(English) [double-a-number-represented-as-a-linked-list].html new file mode 100644 index 00000000..dca28657 --- /dev/null +++ b/leetcode-cn/problem (English)/翻倍以链表形式表示的数字(English) [double-a-number-represented-as-a-linked-list].html @@ -0,0 +1,29 @@ +

You are given the head of a non-empty linked list representing a non-negative integer without leading zeroes.

+ +

Return the head of the linked list after doubling it.

+ +

 

+

Example 1:

+ +
+Input: head = [1,8,9]
+Output: [3,7,8]
+Explanation: The figure above corresponds to the given linked list which represents the number 189. Hence, the returned linked list represents the number 189 * 2 = 378.
+
+ +

Example 2:

+ +
+Input: head = [9,9,9]
+Output: [1,9,9,8]
+Explanation: The figure above corresponds to the given linked list which represents the number 999. Hence, the returned linked list reprersents the number 999 * 2 = 1998. 
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the list is in the range [1, 104]
  • +
  • 0 <= Node.val <= 9
  • +
  • The input is generated such that the list represents a number that does not have leading zeros, except the number 0 itself.
  • +
diff --git a/leetcode-cn/problem (English)/范围中美丽整数的数目(English) [number-of-beautiful-integers-in-the-range].html b/leetcode-cn/problem (English)/范围中美丽整数的数目(English) [number-of-beautiful-integers-in-the-range].html new file mode 100644 index 00000000..9f0ff0b1 --- /dev/null +++ b/leetcode-cn/problem (English)/范围中美丽整数的数目(English) [number-of-beautiful-integers-in-the-range].html @@ -0,0 +1,52 @@ +

You are given positive integers low, high, and k.

+ +

A number is beautiful if it meets both of the following conditions:

+ +
    +
  • The count of even digits in the number is equal to the count of odd digits.
  • +
  • The number is divisible by k.
  • +
+ +

Return the number of beautiful integers in the range [low, high].

+ +

 

+

Example 1:

+ +
+Input: low = 10, high = 20, k = 3
+Output: 2
+Explanation: There are 2 beautiful integers in the given range: [12,18]. 
+- 12 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 3.
+- 18 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 3.
+Additionally we can see that:
+- 16 is not beautiful because it is not divisible by k = 3.
+- 15 is not beautiful because it does not contain equal counts even and odd digits.
+It can be shown that there are only 2 beautiful integers in the given range.
+
+ +

Example 2:

+ +
+Input: low = 1, high = 10, k = 1
+Output: 1
+Explanation: There is 1 beautiful integer in the given range: [10].
+- 10 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 1.
+It can be shown that there is only 1 beautiful integer in the given range.
+
+ +

Example 3:

+ +
+Input: low = 5, high = 5, k = 2
+Output: 0
+Explanation: There are 0 beautiful integers in the given range.
+- 5 is not beautiful because it is not divisible by k = 2 and it does not contain equal even and odd digits.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 < low <= high <= 109
  • +
  • 0 < k <= 20
  • +
diff --git a/leetcode-cn/problem (English)/销售利润最大化(English) [maximize-the-profit-as-the-salesman].html b/leetcode-cn/problem (English)/销售利润最大化(English) [maximize-the-profit-as-the-salesman].html new file mode 100644 index 00000000..ba528ade --- /dev/null +++ b/leetcode-cn/problem (English)/销售利润最大化(English) [maximize-the-profit-as-the-salesman].html @@ -0,0 +1,41 @@ +

You are given an integer n representing the number of houses on a number line, numbered from 0 to n - 1.

+ +

Additionally, you are given a 2D integer array offers where offers[i] = [starti, endi, goldi], indicating that ith buyer wants to buy all the houses from starti to endi for goldi amount of gold.

+ +

As a salesman, your goal is to maximize your earnings by strategically selecting and selling houses to buyers.

+ +

Return the maximum amount of gold you can earn.

+ +

Note that different buyers can't buy the same house, and some houses may remain unsold.

+ +

 

+

Example 1:

+ +
+Input: n = 5, offers = [[0,0,1],[0,2,2],[1,3,2]]
+Output: 3
+Explanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.
+We sell houses in the range [0,0] to 1st buyer for 1 gold and houses in the range [1,3] to 3rd buyer for 2 golds.
+It can be proven that 3 is the maximum amount of gold we can achieve.
+
+ +

Example 2:

+ +
+Input: n = 5, offers = [[0,0,1],[0,2,10],[1,3,2]]
+Output: 10
+Explanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.
+We sell houses in the range [0,2] to 2nd buyer for 10 golds.
+It can be proven that 10 is the maximum amount of gold we can achieve.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
  • +
  • 1 <= offers.length <= 105
  • +
  • offers[i].length == 3
  • +
  • 0 <= starti <= endi <= n - 1
  • +
  • 1 <= goldi <= 103
  • +
diff --git a/leetcode-cn/problem (English)/限制条件下元素之间的最小绝对差(English) [minimum-absolute-difference-between-elements-with-constraint].html b/leetcode-cn/problem (English)/限制条件下元素之间的最小绝对差(English) [minimum-absolute-difference-between-elements-with-constraint].html new file mode 100644 index 00000000..54d09fc3 --- /dev/null +++ b/leetcode-cn/problem (English)/限制条件下元素之间的最小绝对差(English) [minimum-absolute-difference-between-elements-with-constraint].html @@ -0,0 +1,47 @@ +

You are given a 0-indexed integer array nums and an integer x.

+ +

Find the minimum absolute difference between two elements in the array that are at least x indices apart.

+ +

In other words, find two indices i and j such that abs(i - j) >= x and abs(nums[i] - nums[j]) is minimized.

+ +

Return an integer denoting the minimum absolute difference between two elements that are at least x indices apart.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,3,2,4], x = 2
+Output: 0
+Explanation: We can select nums[0] = 4 and nums[3] = 4. 
+They are at least 2 indices apart, and their absolute difference is the minimum, 0. 
+It can be shown that 0 is the optimal answer.
+
+ +

Example 2:

+ +
+Input: nums = [5,3,2,10,15], x = 1
+Output: 1
+Explanation: We can select nums[1] = 3 and nums[2] = 2.
+They are at least 1 index apart, and their absolute difference is the minimum, 1.
+It can be shown that 1 is the optimal answer.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3,4], x = 3
+Output: 3
+Explanation: We can select nums[0] = 1 and nums[3] = 4.
+They are at least 3 indices apart, and their absolute difference is the minimum, 3.
+It can be shown that 3 is the optimal answer.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
  • 0 <= x < nums.length
  • +
diff --git a/leetcode/origin-data.json b/leetcode/origin-data.json index 4da1480f..5a0e7edc 100644 --- a/leetcode/origin-data.json +++ b/leetcode/origin-data.json @@ -1,11 +1,57 @@ { "user_name": "", "num_solved": 0, - "num_total": 2814, + "num_total": 2831, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, "stat_status_pairs": [ + { + "stat": { + "question_id": 3078, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Election Results", + "question__title_slug": "election-results", + "question__hide": false, + "total_acs": 116, + "total_submitted": 154, + "frontend_question_id": 2820, + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3077, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Relative Loss After Buying Chocolates", + "question__title_slug": "minimum-relative-loss-after-buying-chocolates", + "question__hide": false, + "total_acs": 112, + "total_submitted": 194, + "frontend_question_id": 2819, + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3043, @@ -15,10 +61,10 @@ "question__title": "Minimum Time Takes to Reach Destination Without Drowning", "question__title_slug": "minimum-time-takes-to-reach-destination-without-drowning", "question__hide": false, - "total_acs": 226, - "total_submitted": 300, + "total_acs": 359, + "total_submitted": 540, "frontend_question_id": 2814, - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -38,8 +84,8 @@ "question__title": "Find The K-th Lucky Number", "question__title_slug": "find-the-k-th-lucky-number", "question__hide": false, - "total_acs": 322, - "total_submitted": 449, + "total_acs": 401, + "total_submitted": 562, "frontend_question_id": 2802, "is_new_question": false }, @@ -52,6 +98,52 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3018, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Make String a Subsequence Using Cyclic Increments", + "question__title_slug": "make-string-a-subsequence-using-cyclic-increments", + "question__hide": false, + "total_acs": 19469, + "total_submitted": 45358, + "frontend_question_id": 2825, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3017, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Number of Beautiful Integers in the Range", + "question__title_slug": "number-of-beautiful-integers-in-the-range", + "question__hide": false, + "total_acs": 3120, + "total_submitted": 26598, + "frontend_question_id": 2827, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3016, @@ -61,8 +153,8 @@ "question__title": "Count Nodes That Are Great Enough", "question__title_slug": "count-nodes-that-are-great-enough", "question__hide": false, - "total_acs": 335, - "total_submitted": 573, + "total_acs": 351, + "total_submitted": 604, "frontend_question_id": 2792, "is_new_question": false }, @@ -84,8 +176,8 @@ "question__title": "Status of Flight Tickets", "question__title_slug": "status-of-flight-tickets", "question__hide": false, - "total_acs": 156, - "total_submitted": 325, + "total_acs": 205, + "total_submitted": 459, "frontend_question_id": 2793, "is_new_question": false }, @@ -107,8 +199,8 @@ "question__title": "Flight Occupancy and Waitlist Analysis", "question__title_slug": "flight-occupancy-and-waitlist-analysis", "question__hide": false, - "total_acs": 355, - "total_submitted": 852, + "total_acs": 414, + "total_submitted": 1033, "frontend_question_id": 2783, "is_new_question": false }, @@ -121,6 +213,52 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3001, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Apply Operations to Maximize Score", + "question__title_slug": "apply-operations-to-maximize-score", + "question__hide": false, + "total_acs": 4830, + "total_submitted": 14848, + "frontend_question_id": 2818, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3000, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Absolute Difference Between Elements With Constraint", + "question__title_slug": "minimum-absolute-difference-between-elements-with-constraint", + "question__hide": false, + "total_acs": 15665, + "total_submitted": 52112, + "frontend_question_id": 2817, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2995, @@ -130,8 +268,8 @@ "question__title": "Number of Unique Categories", "question__title_slug": "number-of-unique-categories", "question__hide": false, - "total_acs": 557, - "total_submitted": 650, + "total_acs": 612, + "total_submitted": 715, "frontend_question_id": 2782, "is_new_question": false }, @@ -144,6 +282,52 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2979, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Maximize the Profit as the Salesman", + "question__title_slug": "maximize-the-profit-as-the-salesman", + "question__hide": false, + "total_acs": 8638, + "total_submitted": 29348, + "frontend_question_id": 2830, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2977, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Check if a String Is an Acronym of Words", + "question__title_slug": "check-if-a-string-is-an-acronym-of-words", + "question__hide": false, + "total_acs": 22713, + "total_submitted": 27453, + "frontend_question_id": 2828, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2955, @@ -153,8 +337,8 @@ "question__title": "Account Balance After Rounded Purchase", "question__title_slug": "account-balance-after-rounded-purchase", "question__hide": false, - "total_acs": 25965, - "total_submitted": 51024, + "total_acs": 28705, + "total_submitted": 55853, "frontend_question_id": 2806, "is_new_question": false }, @@ -176,8 +360,8 @@ "question__title": "Minimum Time to Make Array Sum At Most x", "question__title_slug": "minimum-time-to-make-array-sum-at-most-x", "question__hide": false, - "total_acs": 1580, - "total_submitted": 7978, + "total_acs": 2041, + "total_submitted": 9168, "frontend_question_id": 2809, "is_new_question": false }, @@ -199,8 +383,8 @@ "question__title": "Height of Special Binary Tree", "question__title_slug": "height-of-special-binary-tree", "question__hide": false, - "total_acs": 302, - "total_submitted": 402, + "total_acs": 308, + "total_submitted": 417, "frontend_question_id": 2773, "is_new_question": false }, @@ -213,6 +397,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2925, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Inversion of Object", + "question__title_slug": "inversion-of-object", + "question__hide": false, + "total_acs": 83, + "total_submitted": 104, + "frontend_question_id": 2822, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2921, @@ -222,8 +429,8 @@ "question__title": "Count Stepping Numbers in Range", "question__title_slug": "count-stepping-numbers-in-range", "question__hide": false, - "total_acs": 4653, - "total_submitted": 18870, + "total_acs": 5014, + "total_submitted": 19818, "frontend_question_id": 2801, "is_new_question": false }, @@ -245,8 +452,8 @@ "question__title": "Minimum Seconds to Equalize a Circular Array", "question__title_slug": "minimum-seconds-to-equalize-a-circular-array", "question__hide": false, - "total_acs": 10124, - "total_submitted": 44545, + "total_acs": 11167, + "total_submitted": 47031, "frontend_question_id": 2808, "is_new_question": false }, @@ -268,8 +475,8 @@ "question__title": "Maximum Number of Groups With Increasing Length", "question__title_slug": "maximum-number-of-groups-with-increasing-length", "question__hide": false, - "total_acs": 6287, - "total_submitted": 34335, + "total_acs": 6535, + "total_submitted": 35214, "frontend_question_id": 2790, "is_new_question": false }, @@ -291,8 +498,8 @@ "question__title": "is Array a Preorder of Some ‌Binary Tree", "question__title_slug": "is-array-a-preorder-of-some-binary-tree", "question__hide": false, - "total_acs": 408, - "total_submitted": 597, + "total_acs": 453, + "total_submitted": 647, "frontend_question_id": 2764, "is_new_question": false }, @@ -305,6 +512,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2917, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Count Pairs Whose Sum is Less than Target", + "question__title_slug": "count-pairs-whose-sum-is-less-than-target", + "question__hide": false, + "total_acs": 26370, + "total_submitted": 30604, + "frontend_question_id": 2824, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2916, @@ -314,8 +544,8 @@ "question__title": "Check if it is Possible to Split Array", "question__title_slug": "check-if-it-is-possible-to-split-array", "question__hide": false, - "total_acs": 20763, - "total_submitted": 64108, + "total_acs": 23250, + "total_submitted": 70601, "frontend_question_id": 2811, "is_new_question": false }, @@ -337,8 +567,8 @@ "question__title": "Find the Safest Path in a Grid", "question__title_slug": "find-the-safest-path-in-a-grid", "question__hide": false, - "total_acs": 9096, - "total_submitted": 33521, + "total_acs": 11253, + "total_submitted": 39273, "frontend_question_id": 2812, "is_new_question": false }, @@ -351,6 +581,52 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2912, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Deep Object Filter", + "question__title_slug": "deep-object-filter", + "question__hide": false, + "total_acs": 40, + "total_submitted": 67, + "frontend_question_id": 2823, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2909, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Delay the Resolution of Each Promise", + "question__title_slug": "delay-the-resolution-of-each-promise", + "question__hide": false, + "total_acs": 78, + "total_submitted": 86, + "frontend_question_id": 2821, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2908, @@ -360,8 +636,8 @@ "question__title": "Custom Interval", "question__title_slug": "custom-interval", "question__hide": false, - "total_acs": 75, - "total_submitted": 82, + "total_acs": 88, + "total_submitted": 95, "frontend_question_id": 2805, "is_new_question": false }, @@ -383,8 +659,8 @@ "question__title": "Array Prototype ForEach", "question__title_slug": "array-prototype-foreach", "question__hide": false, - "total_acs": 115, - "total_submitted": 123, + "total_acs": 183, + "total_submitted": 197, "frontend_question_id": 2804, "is_new_question": false }, @@ -406,8 +682,8 @@ "question__title": "Count Paths That Can Form a Palindrome in a Tree", "question__title_slug": "count-paths-that-can-form-a-palindrome-in-a-tree", "question__hide": false, - "total_acs": 3196, - "total_submitted": 6743, + "total_acs": 3368, + "total_submitted": 7065, "frontend_question_id": 2791, "is_new_question": false }, @@ -420,6 +696,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2904, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Sorting Three Groups", + "question__title_slug": "sorting-three-groups", + "question__hide": false, + "total_acs": 11409, + "total_submitted": 30707, + "frontend_question_id": 2826, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2903, @@ -429,8 +728,8 @@ "question__title": "Insert Greatest Common Divisors in Linked List", "question__title_slug": "insert-greatest-common-divisors-in-linked-list", "question__hide": false, - "total_acs": 23736, - "total_submitted": 25924, + "total_acs": 27756, + "total_submitted": 30388, "frontend_question_id": 2807, "is_new_question": false }, @@ -443,6 +742,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2902, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Max Pair Sum in an Array", + "question__title_slug": "max-pair-sum-in-an-array", + "question__hide": false, + "total_acs": 28278, + "total_submitted": 48778, + "frontend_question_id": 2815, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2901, @@ -452,8 +774,8 @@ "question__title": "Factorial Generator", "question__title_slug": "factorial-generator", "question__hide": false, - "total_acs": 139, - "total_submitted": 152, + "total_acs": 212, + "total_submitted": 235, "frontend_question_id": 2803, "is_new_question": false }, @@ -475,8 +797,8 @@ "question__title": "Partial Function with Placeholders", "question__title_slug": "partial-function-with-placeholders", "question__hide": false, - "total_acs": 125, - "total_submitted": 136, + "total_acs": 156, + "total_submitted": 167, "frontend_question_id": 2797, "is_new_question": false }, @@ -492,14 +814,14 @@ { "stat": { "question_id": 2899, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "repeat-string", + "question__article__has_video_solution": false, "question__title": "Repeat String", "question__title_slug": "repeat-string", "question__hide": false, - "total_acs": 286, - "total_submitted": 297, + "total_acs": 434, + "total_submitted": 454, "frontend_question_id": 2796, "is_new_question": false }, @@ -521,8 +843,8 @@ "question__title": "Parallel Execution of Promises for Individual Results Retrieval", "question__title_slug": "parallel-execution-of-promises-for-individual-results-retrieval", "question__hide": false, - "total_acs": 117, - "total_submitted": 127, + "total_acs": 147, + "total_submitted": 157, "frontend_question_id": 2795, "is_new_question": false }, @@ -544,8 +866,8 @@ "question__title": "Count Houses in a Circular Street II", "question__title_slug": "count-houses-in-a-circular-street-ii", "question__hide": false, - "total_acs": 359, - "total_submitted": 451, + "total_acs": 383, + "total_submitted": 487, "frontend_question_id": 2753, "is_new_question": false }, @@ -567,8 +889,8 @@ "question__title": "Maximum Elegance of a K-Length Subsequence", "question__title_slug": "maximum-elegance-of-a-k-length-subsequence", "question__hide": false, - "total_acs": 3235, - "total_submitted": 10285, + "total_acs": 3976, + "total_submitted": 12146, "frontend_question_id": 2813, "is_new_question": false }, @@ -590,8 +912,8 @@ "question__title": "Visit Array Positions to Maximize Score", "question__title_slug": "visit-array-positions-to-maximize-score", "question__hide": false, - "total_acs": 14791, - "total_submitted": 41960, + "total_acs": 15230, + "total_submitted": 43110, "frontend_question_id": 2786, "is_new_question": false }, @@ -613,8 +935,8 @@ "question__title": "Check if Array is Good", "question__title_slug": "check-if-array-is-good", "question__hide": false, - "total_acs": 32485, - "total_submitted": 61691, + "total_acs": 34364, + "total_submitted": 66097, "frontend_question_id": 2784, "is_new_question": false }, @@ -636,8 +958,8 @@ "question__title": "Maximum Beauty of an Array After Applying Operation", "question__title_slug": "maximum-beauty-of-an-array-after-applying-operation", "question__hide": false, - "total_acs": 19998, - "total_submitted": 55130, + "total_acs": 20463, + "total_submitted": 56068, "frontend_question_id": 2779, "is_new_question": false }, @@ -659,8 +981,8 @@ "question__title": "Count Substrings Without Repeating Character", "question__title_slug": "count-substrings-without-repeating-character", "question__hide": false, - "total_acs": 719, - "total_submitted": 946, + "total_acs": 778, + "total_submitted": 1018, "frontend_question_id": 2743, "is_new_question": false }, @@ -682,8 +1004,8 @@ "question__title": "Number of Black Blocks", "question__title_slug": "number-of-black-blocks", "question__hide": false, - "total_acs": 5262, - "total_submitted": 14865, + "total_acs": 5590, + "total_submitted": 15563, "frontend_question_id": 2768, "is_new_question": false }, @@ -705,8 +1027,8 @@ "question__title": "Minimum Index of a Valid Split", "question__title_slug": "minimum-index-of-a-valid-split", "question__hide": false, - "total_acs": 18495, - "total_submitted": 29222, + "total_acs": 18819, + "total_submitted": 29679, "frontend_question_id": 2780, "is_new_question": false }, @@ -728,8 +1050,8 @@ "question__title": "Sort Vowels in a String", "question__title_slug": "sort-vowels-in-a-string", "question__hide": false, - "total_acs": 24673, - "total_submitted": 32113, + "total_acs": 25718, + "total_submitted": 33446, "frontend_question_id": 2785, "is_new_question": false }, @@ -751,8 +1073,8 @@ "question__title": "Faulty Keyboard", "question__title_slug": "faulty-keyboard", "question__hide": false, - "total_acs": 30344, - "total_submitted": 36769, + "total_acs": 35434, + "total_submitted": 42782, "frontend_question_id": 2810, "is_new_question": false }, @@ -774,8 +1096,8 @@ "question__title": "Count Occurrences in Text", "question__title_slug": "count-occurrences-in-text", "question__hide": false, - "total_acs": 415, - "total_submitted": 848, + "total_acs": 444, + "total_submitted": 926, "frontend_question_id": 2738, "is_new_question": false }, @@ -797,8 +1119,8 @@ "question__title": "Length of the Longest Valid Substring", "question__title_slug": "length-of-the-longest-valid-substring", "question__hide": false, - "total_acs": 7981, - "total_submitted": 23957, + "total_acs": 8213, + "total_submitted": 24603, "frontend_question_id": 2781, "is_new_question": false }, @@ -820,8 +1142,8 @@ "question__title": "Partition String Into Minimum Beautiful Substrings", "question__title_slug": "partition-string-into-minimum-beautiful-substrings", "question__hide": false, - "total_acs": 10451, - "total_submitted": 19655, + "total_acs": 10820, + "total_submitted": 20389, "frontend_question_id": 2767, "is_new_question": false }, @@ -843,8 +1165,8 @@ "question__title": "Ways to Express an Integer as Sum of Powers", "question__title_slug": "ways-to-express-an-integer-as-sum-of-powers", "question__hide": false, - "total_acs": 12598, - "total_submitted": 38238, + "total_acs": 13032, + "total_submitted": 39452, "frontend_question_id": 2787, "is_new_question": false }, @@ -866,8 +1188,8 @@ "question__title": "Split Strings by Separator", "question__title_slug": "split-strings-by-separator", "question__hide": false, - "total_acs": 29761, - "total_submitted": 41626, + "total_acs": 31149, + "total_submitted": 43416, "frontend_question_id": 2788, "is_new_question": false }, @@ -889,8 +1211,8 @@ "question__title": "Find the Closest Marked Node", "question__title_slug": "find-the-closest-marked-node", "question__hide": false, - "total_acs": 565, - "total_submitted": 1016, + "total_acs": 591, + "total_submitted": 1065, "frontend_question_id": 2737, "is_new_question": false }, @@ -912,8 +1234,8 @@ "question__title": "Apply Operations to Make All Array Elements Equal to Zero", "question__title_slug": "apply-operations-to-make-all-array-elements-equal-to-zero", "question__hide": false, - "total_acs": 8459, - "total_submitted": 26154, + "total_acs": 8719, + "total_submitted": 26845, "frontend_question_id": 2772, "is_new_question": false }, @@ -935,8 +1257,8 @@ "question__title": "Shortest String That Contains Three Strings", "question__title_slug": "shortest-string-that-contains-three-strings", "question__hide": false, - "total_acs": 12088, - "total_submitted": 40903, + "total_acs": 12560, + "total_submitted": 42265, "frontend_question_id": 2800, "is_new_question": false }, @@ -958,8 +1280,8 @@ "question__title": "Number of Employees Who Met the Target", "question__title_slug": "number-of-employees-who-met-the-target", "question__hide": false, - "total_acs": 43875, - "total_submitted": 49355, + "total_acs": 51512, + "total_submitted": 58278, "frontend_question_id": 2798, "is_new_question": false }, @@ -981,8 +1303,8 @@ "question__title": "Count Houses in a Circular Street", "question__title_slug": "count-houses-in-a-circular-street", "question__hide": false, - "total_acs": 732, - "total_submitted": 921, + "total_acs": 795, + "total_submitted": 988, "frontend_question_id": 2728, "is_new_question": false }, @@ -1004,8 +1326,8 @@ "question__title": "Popularity Percentage", "question__title_slug": "popularity-percentage", "question__hide": false, - "total_acs": 342, - "total_submitted": 925, + "total_acs": 377, + "total_submitted": 971, "frontend_question_id": 2720, "is_new_question": false }, @@ -1027,8 +1349,8 @@ "question__title": "Prime Pairs With Target Sum", "question__title_slug": "prime-pairs-with-target-sum", "question__hide": false, - "total_acs": 22250, - "total_submitted": 67838, + "total_acs": 22725, + "total_submitted": 68958, "frontend_question_id": 2761, "is_new_question": false }, @@ -1050,8 +1372,8 @@ "question__title": "Largest Element in an Array after Merge Operations", "question__title_slug": "largest-element-in-an-array-after-merge-operations", "question__hide": false, - "total_acs": 23531, - "total_submitted": 50569, + "total_acs": 24273, + "total_submitted": 52010, "frontend_question_id": 2789, "is_new_question": false }, @@ -1064,6 +1386,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2871, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Double a Number Represented as a Linked List", + "question__title_slug": "double-a-number-represented-as-a-linked-list", + "question__hide": false, + "total_acs": 24630, + "total_submitted": 52622, + "frontend_question_id": 2816, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2870, @@ -1073,8 +1418,8 @@ "question__title": "Longest Alternating Subarray", "question__title_slug": "longest-alternating-subarray", "question__hide": false, - "total_acs": 17349, - "total_submitted": 52400, + "total_acs": 17793, + "total_submitted": 53717, "frontend_question_id": 2765, "is_new_question": false }, @@ -1096,8 +1441,8 @@ "question__title": "Longest Non-decreasing Subarray From Two Arrays", "question__title_slug": "longest-non-decreasing-subarray-from-two-arrays", "question__hide": false, - "total_acs": 12480, - "total_submitted": 48065, + "total_acs": 13030, + "total_submitted": 49690, "frontend_question_id": 2771, "is_new_question": false }, @@ -1119,8 +1464,8 @@ "question__title": "Continuous Subarrays", "question__title_slug": "continuous-subarrays", "question__hide": false, - "total_acs": 12784, - "total_submitted": 31614, + "total_acs": 13198, + "total_submitted": 32509, "frontend_question_id": 2762, "is_new_question": false }, @@ -1142,8 +1487,8 @@ "question__title": "Ways to Split Array Into Good Subarrays", "question__title_slug": "ways-to-split-array-into-good-subarrays", "question__hide": false, - "total_acs": 15932, - "total_submitted": 48275, + "total_acs": 16203, + "total_submitted": 48986, "frontend_question_id": 2750, "is_new_question": false }, @@ -1165,8 +1510,8 @@ "question__title": "Longest Even Odd Subarray With Threshold", "question__title_slug": "longest-even-odd-subarray-with-threshold", "question__hide": false, - "total_acs": 23879, - "total_submitted": 84167, + "total_acs": 24455, + "total_submitted": 85931, "frontend_question_id": 2760, "is_new_question": false }, @@ -1188,8 +1533,8 @@ "question__title": "Find Shortest Path with K Hops", "question__title_slug": "find-shortest-path-with-k-hops", "question__hide": false, - "total_acs": 428, - "total_submitted": 698, + "total_acs": 452, + "total_submitted": 738, "frontend_question_id": 2714, "is_new_question": false }, @@ -1211,8 +1556,8 @@ "question__title": "Is Object Empty", "question__title_slug": "is-object-empty", "question__hide": false, - "total_acs": 10565, - "total_submitted": 13620, + "total_acs": 11943, + "total_submitted": 15450, "frontend_question_id": 2727, "is_new_question": false }, @@ -1234,8 +1579,8 @@ "question__title": "Calculator with Method Chaining", "question__title_slug": "calculator-with-method-chaining", "question__hide": false, - "total_acs": 4690, - "total_submitted": 6314, + "total_acs": 5283, + "total_submitted": 7106, "frontend_question_id": 2726, "is_new_question": false }, @@ -1257,8 +1602,8 @@ "question__title": "Interval Cancellation", "question__title_slug": "interval-cancellation", "question__hide": false, - "total_acs": 6105, - "total_submitted": 7003, + "total_acs": 6863, + "total_submitted": 7941, "frontend_question_id": 2725, "is_new_question": false }, @@ -1280,8 +1625,8 @@ "question__title": "Create Object from Two Arrays", "question__title_slug": "create-object-from-two-arrays", "question__hide": false, - "total_acs": 170, - "total_submitted": 259, + "total_acs": 251, + "total_submitted": 383, "frontend_question_id": 2794, "is_new_question": false }, @@ -1303,8 +1648,8 @@ "question__title": "Sort By", "question__title_slug": "sort-by", "question__hide": false, - "total_acs": 6377, - "total_submitted": 7749, + "total_acs": 7174, + "total_submitted": 8714, "frontend_question_id": 2724, "is_new_question": false }, @@ -1326,8 +1671,8 @@ "question__title": "Add Two Promises", "question__title_slug": "add-two-promises", "question__hide": false, - "total_acs": 12967, - "total_submitted": 14390, + "total_acs": 14775, + "total_submitted": 16431, "frontend_question_id": 2723, "is_new_question": false }, @@ -1349,8 +1694,8 @@ "question__title": "Join Two Arrays by ID", "question__title_slug": "join-two-arrays-by-id", "question__hide": false, - "total_acs": 4288, - "total_submitted": 8157, + "total_acs": 4880, + "total_submitted": 9299, "frontend_question_id": 2722, "is_new_question": false }, @@ -1372,8 +1717,8 @@ "question__title": "Total Distance Traveled", "question__title_slug": "total-distance-traveled", "question__hide": false, - "total_acs": 32397, - "total_submitted": 83443, + "total_acs": 32795, + "total_submitted": 84490, "frontend_question_id": 2739, "is_new_question": false }, @@ -1395,8 +1740,8 @@ "question__title": "Count Complete Subarrays in an Array", "question__title_slug": "count-complete-subarrays-in-an-array", "question__hide": false, - "total_acs": 25808, - "total_submitted": 40432, + "total_acs": 26902, + "total_submitted": 42124, "frontend_question_id": 2799, "is_new_question": false }, @@ -1418,8 +1763,8 @@ "question__title": "Maximum Number of Jumps to Reach the Last Index", "question__title_slug": "maximum-number-of-jumps-to-reach-the-last-index", "question__hide": false, - "total_acs": 19182, - "total_submitted": 68028, + "total_acs": 19650, + "total_submitted": 69314, "frontend_question_id": 2770, "is_new_question": false }, @@ -1441,8 +1786,8 @@ "question__title": "Decremental String Concatenation", "question__title_slug": "decremental-string-concatenation", "question__hide": false, - "total_acs": 5295, - "total_submitted": 21653, + "total_acs": 5507, + "total_submitted": 22154, "frontend_question_id": 2746, "is_new_question": false }, @@ -1464,8 +1809,8 @@ "question__title": "Consecutive Transactions with Increasing Amounts", "question__title_slug": "consecutive-transactions-with-increasing-amounts", "question__hide": false, - "total_acs": 332, - "total_submitted": 1695, + "total_acs": 357, + "total_submitted": 1789, "frontend_question_id": 2701, "is_new_question": false }, @@ -1487,8 +1832,8 @@ "question__title": "Customers with Maximum Number of Transactions on Consecutive Days", "question__title_slug": "customers-with-maximum-number-of-transactions-on-consecutive-days", "question__hide": false, - "total_acs": 243, - "total_submitted": 623, + "total_acs": 278, + "total_submitted": 697, "frontend_question_id": 2752, "is_new_question": false }, @@ -1510,8 +1855,8 @@ "question__title": "Convert JSON String to Object", "question__title_slug": "convert-json-string-to-object", "question__hide": false, - "total_acs": 114, - "total_submitted": 165, + "total_acs": 143, + "total_submitted": 201, "frontend_question_id": 2759, "is_new_question": false }, @@ -1533,8 +1878,8 @@ "question__title": "Construct the Longest New String", "question__title_slug": "construct-the-longest-new-string", "question__hide": false, - "total_acs": 13574, - "total_submitted": 25897, + "total_acs": 13843, + "total_submitted": 26377, "frontend_question_id": 2745, "is_new_question": false }, @@ -1556,8 +1901,8 @@ "question__title": "Sum of Imbalance Numbers of All Subarrays", "question__title_slug": "sum-of-imbalance-numbers-of-all-subarrays", "question__hide": false, - "total_acs": 5685, - "total_submitted": 11768, + "total_acs": 5815, + "total_submitted": 11985, "frontend_question_id": 2763, "is_new_question": false }, @@ -1579,8 +1924,8 @@ "question__title": "Special Permutations", "question__title_slug": "special-permutations", "question__hide": false, - "total_acs": 10433, - "total_submitted": 40038, + "total_acs": 10595, + "total_submitted": 40444, "frontend_question_id": 2741, "is_new_question": false }, @@ -1602,8 +1947,8 @@ "question__title": "Find Maximum Number of String Pairs", "question__title_slug": "find-maximum-number-of-string-pairs", "question__hide": false, - "total_acs": 28860, - "total_submitted": 35537, + "total_acs": 30275, + "total_submitted": 37252, "frontend_question_id": 2744, "is_new_question": false }, @@ -1625,8 +1970,8 @@ "question__title": "Robot Collisions", "question__title_slug": "robot-collisions", "question__hide": false, - "total_acs": 6985, - "total_submitted": 17041, + "total_acs": 7150, + "total_submitted": 17399, "frontend_question_id": 2751, "is_new_question": false }, @@ -1648,8 +1993,8 @@ "question__title": "Find the Value of the Partition", "question__title_slug": "find-the-value-of-the-partition", "question__hide": false, - "total_acs": 26206, - "total_submitted": 39870, + "total_acs": 26469, + "total_submitted": 40243, "frontend_question_id": 2740, "is_new_question": false }, @@ -1671,8 +2016,8 @@ "question__title": "Sum of Squares of Special Elements ", "question__title_slug": "sum-of-squares-of-special-elements", "question__hide": false, - "total_acs": 34308, - "total_submitted": 43417, + "total_acs": 35848, + "total_submitted": 45281, "frontend_question_id": 2778, "is_new_question": false }, @@ -1694,8 +2039,8 @@ "question__title": "Extract Kth Character From The Rope Tree", "question__title_slug": "extract-kth-character-from-the-rope-tree", "question__hide": false, - "total_acs": 900, - "total_submitted": 1205, + "total_acs": 981, + "total_submitted": 1306, "frontend_question_id": 2689, "is_new_question": false }, @@ -1717,8 +2062,8 @@ "question__title": "Find Active Users", "question__title_slug": "find-active-users", "question__hide": false, - "total_acs": 833, - "total_submitted": 2212, + "total_acs": 878, + "total_submitted": 2343, "frontend_question_id": 2688, "is_new_question": false }, @@ -1740,8 +2085,8 @@ "question__title": "Bikes Last Time Used ", "question__title_slug": "bikes-last-time-used", "question__hide": false, - "total_acs": 927, - "total_submitted": 1292, + "total_acs": 1009, + "total_submitted": 1375, "frontend_question_id": 2687, "is_new_question": false }, @@ -1763,8 +2108,8 @@ "question__title": "Immediate Food Delivery III", "question__title_slug": "immediate-food-delivery-iii", "question__hide": false, - "total_acs": 653, - "total_submitted": 1265, + "total_acs": 704, + "total_submitted": 1338, "frontend_question_id": 2686, "is_new_question": false }, @@ -1786,8 +2131,8 @@ "question__title": "Maximum Sum Queries", "question__title_slug": "maximum-sum-queries", "question__hide": false, - "total_acs": 3333, - "total_submitted": 13055, + "total_acs": 3410, + "total_submitted": 13226, "frontend_question_id": 2736, "is_new_question": false }, @@ -1809,8 +2154,8 @@ "question__title": "Sum of Matrix After Queries", "question__title_slug": "sum-of-matrix-after-queries", "question__hide": false, - "total_acs": 17561, - "total_submitted": 58882, + "total_acs": 17736, + "total_submitted": 59273, "frontend_question_id": 2718, "is_new_question": false }, @@ -1832,8 +2177,8 @@ "question__title": "Minimum Operations to Make the Integer Zero", "question__title_slug": "minimum-operations-to-make-the-integer-zero", "question__hide": false, - "total_acs": 7300, - "total_submitted": 25190, + "total_acs": 7434, + "total_submitted": 25574, "frontend_question_id": 2749, "is_new_question": false }, @@ -1855,8 +2200,8 @@ "question__title": "Neither Minimum nor Maximum", "question__title_slug": "neither-minimum-nor-maximum", "question__hide": false, - "total_acs": 55397, - "total_submitted": 71293, + "total_acs": 56800, + "total_submitted": 73175, "frontend_question_id": 2733, "is_new_question": false }, @@ -1878,8 +2223,8 @@ "question__title": "Split a Circular Linked List", "question__title_slug": "split-a-circular-linked-list", "question__hide": false, - "total_acs": 539, - "total_submitted": 762, + "total_acs": 560, + "total_submitted": 786, "frontend_question_id": 2674, "is_new_question": false }, @@ -1901,8 +2246,8 @@ "question__title": "Relocate Marbles", "question__title_slug": "relocate-marbles", "question__hide": false, - "total_acs": 15410, - "total_submitted": 29685, + "total_acs": 15786, + "total_submitted": 30328, "frontend_question_id": 2766, "is_new_question": false }, @@ -1924,8 +2269,8 @@ "question__title": "Count Zero Request Servers", "question__title_slug": "count-zero-request-servers", "question__hide": false, - "total_acs": 3298, - "total_submitted": 9981, + "total_acs": 3436, + "total_submitted": 10422, "frontend_question_id": 2747, "is_new_question": false }, @@ -1938,6 +2283,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2832, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Find the Longest Equal Subarray", + "question__title_slug": "find-the-longest-equal-subarray", + "question__hide": false, + "total_acs": 6840, + "total_submitted": 24539, + "frontend_question_id": 2831, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2831, @@ -1947,8 +2315,8 @@ "question__title": "Number of Beautiful Pairs", "question__title_slug": "number-of-beautiful-pairs", "question__hide": false, - "total_acs": 25552, - "total_submitted": 51930, + "total_acs": 26023, + "total_submitted": 52756, "frontend_question_id": 2748, "is_new_question": false }, @@ -1970,8 +2338,8 @@ "question__title": "Count Artist Occurrences On Spotify Ranking List", "question__title_slug": "count-artist-occurrences-on-spotify-ranking-list", "question__hide": false, - "total_acs": 951, - "total_submitted": 1439, + "total_acs": 1029, + "total_submitted": 1547, "frontend_question_id": 2669, "is_new_question": false }, @@ -1987,14 +2355,14 @@ { "stat": { "question_id": 2829, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "find-latest-salaries", + "question__article__has_video_solution": false, "question__title": "Find Latest Salaries", "question__title_slug": "find-latest-salaries", "question__hide": false, - "total_acs": 991, - "total_submitted": 1654, + "total_acs": 1069, + "total_submitted": 1754, "frontend_question_id": 2668, "is_new_question": false }, @@ -2016,8 +2384,8 @@ "question__title": "Lexicographically Smallest String After Substring Operation", "question__title_slug": "lexicographically-smallest-string-after-substring-operation", "question__hide": false, - "total_acs": 22728, - "total_submitted": 76199, + "total_acs": 22888, + "total_submitted": 76601, "frontend_question_id": 2734, "is_new_question": false }, @@ -2039,8 +2407,8 @@ "question__title": "Greatest Common Divisor Traversal", "question__title_slug": "greatest-common-divisor-traversal", "question__hide": false, - "total_acs": 7028, - "total_submitted": 31264, + "total_acs": 7126, + "total_submitted": 31624, "frontend_question_id": 2709, "is_new_question": false }, @@ -2062,8 +2430,8 @@ "question__title": "Find a Good Subset of the Matrix", "question__title_slug": "find-a-good-subset-of-the-matrix", "question__hide": false, - "total_acs": 5164, - "total_submitted": 11042, + "total_acs": 5242, + "total_submitted": 11187, "frontend_question_id": 2732, "is_new_question": false }, @@ -2085,8 +2453,8 @@ "question__title": "Minimize String Length", "question__title_slug": "minimize-string-length", "question__hide": false, - "total_acs": 32486, - "total_submitted": 43337, + "total_acs": 33252, + "total_submitted": 44267, "frontend_question_id": 2716, "is_new_question": false }, @@ -2108,8 +2476,8 @@ "question__title": "Check if The Number is Fascinating", "question__title_slug": "check-if-the-number-is-fascinating", "question__hide": false, - "total_acs": 30685, - "total_submitted": 59017, + "total_acs": 31151, + "total_submitted": 59848, "frontend_question_id": 2729, "is_new_question": false }, @@ -2131,8 +2499,8 @@ "question__title": "The Knight’s Tour", "question__title_slug": "the-knights-tour", "question__hide": false, - "total_acs": 671, - "total_submitted": 953, + "total_acs": 691, + "total_submitted": 988, "frontend_question_id": 2664, "is_new_question": false }, @@ -2148,14 +2516,14 @@ { "stat": { "question_id": 2822, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "next-day", + "question__article__has_video_solution": false, "question__title": "Next Day", "question__title_slug": "next-day", "question__hide": false, - "total_acs": 292, - "total_submitted": 321, + "total_acs": 321, + "total_submitted": 353, "frontend_question_id": 2758, "is_new_question": false }, @@ -2177,8 +2545,8 @@ "question__title": "Timeout Cancellation", "question__title_slug": "timeout-cancellation", "question__hide": false, - "total_acs": 7125, - "total_submitted": 8029, + "total_acs": 8102, + "total_submitted": 9154, "frontend_question_id": 2715, "is_new_question": false }, @@ -2200,8 +2568,8 @@ "question__title": "Return Length of Arguments Passed", "question__title_slug": "return-length-of-arguments-passed", "question__hide": false, - "total_acs": 23797, - "total_submitted": 25608, + "total_acs": 26696, + "total_submitted": 28709, "frontend_question_id": 2703, "is_new_question": false }, @@ -2223,8 +2591,8 @@ "question__title": "Remove Trailing Zeros From a String", "question__title_slug": "remove-trailing-zeros-from-a-string", "question__hide": false, - "total_acs": 37773, - "total_submitted": 48108, + "total_acs": 38659, + "total_submitted": 49186, "frontend_question_id": 2710, "is_new_question": false }, @@ -2246,8 +2614,8 @@ "question__title": "Maximum Strictly Increasing Cells in a Matrix", "question__title_slug": "maximum-strictly-increasing-cells-in-a-matrix", "question__hide": false, - "total_acs": 6580, - "total_submitted": 24208, + "total_acs": 6876, + "total_submitted": 25104, "frontend_question_id": 2713, "is_new_question": false }, @@ -2269,8 +2637,8 @@ "question__title": "Minimum Cost to Make All Characters Equal", "question__title_slug": "minimum-cost-to-make-all-characters-equal", "question__hide": false, - "total_acs": 14591, - "total_submitted": 26731, + "total_acs": 14792, + "total_submitted": 27044, "frontend_question_id": 2712, "is_new_question": false }, @@ -2292,8 +2660,8 @@ "question__title": "Lexicographically Smallest Palindrome", "question__title_slug": "lexicographically-smallest-palindrome", "question__hide": false, - "total_acs": 28527, - "total_submitted": 34719, + "total_acs": 29379, + "total_submitted": 35758, "frontend_question_id": 2697, "is_new_question": false }, @@ -2315,8 +2683,8 @@ "question__title": "Find Maximal Uncovered Ranges", "question__title_slug": "find-maximal-uncovered-ranges", "question__hide": false, - "total_acs": 677, - "total_submitted": 1220, + "total_acs": 694, + "total_submitted": 1250, "frontend_question_id": 2655, "is_new_question": false }, @@ -2338,8 +2706,8 @@ "question__title": "Generate Circular Array Values", "question__title_slug": "generate-circular-array-values", "question__hide": false, - "total_acs": 122, - "total_submitted": 146, + "total_acs": 133, + "total_submitted": 166, "frontend_question_id": 2757, "is_new_question": false }, @@ -2361,8 +2729,8 @@ "question__title": "To Be Or Not To Be", "question__title_slug": "to-be-or-not-to-be", "question__hide": false, - "total_acs": 25093, - "total_submitted": 39654, + "total_acs": 28903, + "total_submitted": 45963, "frontend_question_id": 2704, "is_new_question": false }, @@ -2384,8 +2752,8 @@ "question__title": "Find the Maximum Achievable Number", "question__title_slug": "find-the-maximum-achievable-number", "question__hide": false, - "total_acs": 34691, - "total_submitted": 39078, + "total_acs": 37136, + "total_submitted": 41705, "frontend_question_id": 2769, "is_new_question": false }, @@ -2398,6 +2766,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2811, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Determine the Minimum Sum of a k-avoiding Array", + "question__title_slug": "determine-the-minimum-sum-of-a-k-avoiding-array", + "question__hide": false, + "total_acs": 19133, + "total_submitted": 33398, + "frontend_question_id": 2829, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2810, @@ -2407,8 +2798,8 @@ "question__title": "Collecting Chocolates", "question__title_slug": "collecting-chocolates", "question__hide": false, - "total_acs": 9230, - "total_submitted": 28708, + "total_acs": 9356, + "total_submitted": 29033, "frontend_question_id": 2735, "is_new_question": false }, @@ -2430,8 +2821,8 @@ "question__title": "Create Hello World Function", "question__title_slug": "create-hello-world-function", "question__hide": false, - "total_acs": 95570, - "total_submitted": 115239, + "total_acs": 104285, + "total_submitted": 126956, "frontend_question_id": 2667, "is_new_question": false }, @@ -2453,8 +2844,8 @@ "question__title": "Painting the Walls", "question__title_slug": "painting-the-walls", "question__hide": false, - "total_acs": 7892, - "total_submitted": 26839, + "total_acs": 8101, + "total_submitted": 27423, "frontend_question_id": 2742, "is_new_question": false }, @@ -2476,8 +2867,8 @@ "question__title": "Execute Asynchronous Functions in Parallel", "question__title_slug": "execute-asynchronous-functions-in-parallel", "question__hide": false, - "total_acs": 3912, - "total_submitted": 4698, + "total_acs": 4459, + "total_submitted": 5383, "frontend_question_id": 2721, "is_new_question": false }, @@ -2499,8 +2890,8 @@ "question__title": "Query Batching", "question__title_slug": "query-batching", "question__hide": false, - "total_acs": 80, - "total_submitted": 122, + "total_acs": 83, + "total_submitted": 125, "frontend_question_id": 2756, "is_new_question": false }, @@ -2522,8 +2913,8 @@ "question__title": "Array Wrapper", "question__title_slug": "array-wrapper", "question__hide": false, - "total_acs": 12186, - "total_submitted": 13721, + "total_acs": 12890, + "total_submitted": 14512, "frontend_question_id": 2695, "is_new_question": false }, @@ -2545,8 +2936,8 @@ "question__title": "Compact Object", "question__title_slug": "compact-object", "question__hide": false, - "total_acs": 3762, - "total_submitted": 5615, + "total_acs": 4253, + "total_submitted": 6401, "frontend_question_id": 2705, "is_new_question": false }, @@ -2568,8 +2959,8 @@ "question__title": "Modify Graph Edge Weights", "question__title_slug": "modify-graph-edge-weights", "question__hide": false, - "total_acs": 3199, - "total_submitted": 14458, + "total_acs": 3265, + "total_submitted": 14676, "frontend_question_id": 2699, "is_new_question": false }, @@ -2591,8 +2982,8 @@ "question__title": "Find the Punishment Number of an Integer", "question__title_slug": "find-the-punishment-number-of-an-integer", "question__hide": false, - "total_acs": 15556, - "total_submitted": 25065, + "total_acs": 15723, + "total_submitted": 25288, "frontend_question_id": 2698, "is_new_question": false }, @@ -2614,8 +3005,8 @@ "question__title": "Difference of Number of Distinct Values on Diagonals", "question__title_slug": "difference-of-number-of-distinct-values-on-diagonals", "question__hide": false, - "total_acs": 16950, - "total_submitted": 23319, + "total_acs": 17070, + "total_submitted": 23472, "frontend_question_id": 2711, "is_new_question": false }, @@ -2637,8 +3028,8 @@ "question__title": "Minimum String Length After Removing Substrings", "question__title_slug": "minimum-string-length-after-removing-substrings", "question__hide": false, - "total_acs": 30255, - "total_submitted": 43961, + "total_acs": 30921, + "total_submitted": 44897, "frontend_question_id": 2696, "is_new_question": false }, @@ -2660,8 +3051,8 @@ "question__title": "Date Range Generator", "question__title_slug": "date-range-generator", "question__hide": false, - "total_acs": 134, - "total_submitted": 141, + "total_acs": 145, + "total_submitted": 155, "frontend_question_id": 2777, "is_new_question": false }, @@ -2683,8 +3074,8 @@ "question__title": "Chunk Array", "question__title_slug": "chunk-array", "question__hide": false, - "total_acs": 17441, - "total_submitted": 20900, + "total_acs": 18543, + "total_submitted": 22257, "frontend_question_id": 2677, "is_new_question": false }, @@ -2706,8 +3097,8 @@ "question__title": "Event Emitter", "question__title_slug": "event-emitter", "question__hide": false, - "total_acs": 8058, - "total_submitted": 9732, + "total_acs": 8481, + "total_submitted": 10228, "frontend_question_id": 2694, "is_new_question": false }, @@ -2729,8 +3120,8 @@ "question__title": "Allow One Function Call", "question__title_slug": "allow-one-function-call", "question__hide": false, - "total_acs": 29524, - "total_submitted": 33511, + "total_acs": 31264, + "total_submitted": 35522, "frontend_question_id": 2666, "is_new_question": false }, @@ -2752,8 +3143,8 @@ "question__title": "Deep Merge of Two Objects", "question__title_slug": "deep-merge-of-two-objects", "question__hide": false, - "total_acs": 126, - "total_submitted": 227, + "total_acs": 132, + "total_submitted": 235, "frontend_question_id": 2755, "is_new_question": false }, @@ -2775,8 +3166,8 @@ "question__title": "Maximum Number of Moves in a Grid", "question__title_slug": "maximum-number-of-moves-in-a-grid", "question__hide": false, - "total_acs": 18256, - "total_submitted": 40445, + "total_acs": 18562, + "total_submitted": 41094, "frontend_question_id": 2684, "is_new_question": false }, @@ -2798,8 +3189,8 @@ "question__title": "Count the Number of Complete Components", "question__title_slug": "count-the-number-of-complete-components", "question__hide": false, - "total_acs": 15925, - "total_submitted": 23769, + "total_acs": 16538, + "total_submitted": 24657, "frontend_question_id": 2685, "is_new_question": false }, @@ -2821,8 +3212,8 @@ "question__title": "Neighboring Bitwise XOR", "question__title_slug": "neighboring-bitwise-xor", "question__hide": false, - "total_acs": 17713, - "total_submitted": 28426, + "total_acs": 17877, + "total_submitted": 28664, "frontend_question_id": 2683, "is_new_question": false }, @@ -2844,8 +3235,8 @@ "question__title": "Find the Losers of the Circular Game", "question__title_slug": "find-the-losers-of-the-circular-game", "question__hide": false, - "total_acs": 21915, - "total_submitted": 44956, + "total_acs": 22241, + "total_submitted": 45563, "frontend_question_id": 2682, "is_new_question": false }, @@ -2867,8 +3258,8 @@ "question__title": "Call Function with Custom Context", "question__title_slug": "call-function-with-custom-context", "question__hide": false, - "total_acs": 6816, - "total_submitted": 8147, + "total_acs": 6937, + "total_submitted": 8307, "frontend_question_id": 2693, "is_new_question": false }, @@ -2890,8 +3281,8 @@ "question__title": "Counter II", "question__title_slug": "counter-ii", "question__hide": false, - "total_acs": 49631, - "total_submitted": 60139, + "total_acs": 53303, + "total_submitted": 64892, "frontend_question_id": 2665, "is_new_question": false }, @@ -2913,8 +3304,8 @@ "question__title": "Design Cancellable Function", "question__title_slug": "design-cancellable-function", "question__hide": false, - "total_acs": 904, - "total_submitted": 1703, + "total_acs": 946, + "total_submitted": 1787, "frontend_question_id": 2650, "is_new_question": false }, @@ -2936,8 +3327,8 @@ "question__title": "Movement of Robots", "question__title_slug": "movement-of-robots", "question__hide": false, - "total_acs": 10324, - "total_submitted": 36306, + "total_acs": 10441, + "total_submitted": 36675, "frontend_question_id": 2731, "is_new_question": false }, @@ -2959,8 +3350,8 @@ "question__title": "Find the Longest Semi-Repetitive Substring", "question__title_slug": "find-the-longest-semi-repetitive-substring", "question__hide": false, - "total_acs": 18366, - "total_submitted": 52871, + "total_acs": 18568, + "total_submitted": 53258, "frontend_question_id": 2730, "is_new_question": false }, @@ -2982,8 +3373,8 @@ "question__title": "Semi-Ordered Permutation", "question__title_slug": "semi-ordered-permutation", "question__hide": false, - "total_acs": 25400, - "total_submitted": 39773, + "total_acs": 25623, + "total_submitted": 40084, "frontend_question_id": 2717, "is_new_question": false }, @@ -3005,8 +3396,8 @@ "question__title": "Power of Heroes", "question__title_slug": "power-of-heroes", "question__hide": false, - "total_acs": 6866, - "total_submitted": 22654, + "total_acs": 6960, + "total_submitted": 22926, "frontend_question_id": 2681, "is_new_question": false }, @@ -3028,8 +3419,8 @@ "question__title": "Nested Array Generator", "question__title_slug": "nested-array-generator", "question__hide": false, - "total_acs": 7877, - "total_submitted": 9565, + "total_acs": 8059, + "total_submitted": 9807, "frontend_question_id": 2649, "is_new_question": false }, @@ -3051,8 +3442,8 @@ "question__title": "Convert Callback Based Function to Promise Based Function", "question__title_slug": "convert-callback-based-function-to-promise-based-function", "question__hide": false, - "total_acs": 145, - "total_submitted": 154, + "total_acs": 162, + "total_submitted": 171, "frontend_question_id": 2776, "is_new_question": false }, @@ -3074,8 +3465,8 @@ "question__title": "Undefined to Null", "question__title_slug": "undefined-to-null", "question__hide": false, - "total_acs": 164, - "total_submitted": 220, + "total_acs": 182, + "total_submitted": 250, "frontend_question_id": 2775, "is_new_question": false }, @@ -3097,8 +3488,8 @@ "question__title": "Make Costs of Paths Equal in a Binary Tree", "question__title_slug": "make-costs-of-paths-equal-in-a-binary-tree", "question__hide": false, - "total_acs": 11147, - "total_submitted": 18718, + "total_acs": 11421, + "total_submitted": 19163, "frontend_question_id": 2673, "is_new_question": false }, @@ -3120,8 +3511,8 @@ "question__title": "Number of Adjacent Elements With the Same Color", "question__title_slug": "number-of-adjacent-elements-with-the-same-color", "question__hide": false, - "total_acs": 12760, - "total_submitted": 22889, + "total_acs": 12896, + "total_submitted": 23090, "frontend_question_id": 2672, "is_new_question": false }, @@ -3143,8 +3534,8 @@ "question__title": "Frequency Tracker", "question__title_slug": "frequency-tracker", "question__hide": false, - "total_acs": 17053, - "total_submitted": 59807, + "total_acs": 17198, + "total_submitted": 60230, "frontend_question_id": 2671, "is_new_question": false }, @@ -3166,8 +3557,8 @@ "question__title": "Find the Distinct Difference Array", "question__title_slug": "find-the-distinct-difference-array", "question__hide": false, - "total_acs": 25521, - "total_submitted": 32883, + "total_acs": 26088, + "total_submitted": 33541, "frontend_question_id": 2670, "is_new_question": false }, @@ -3189,8 +3580,8 @@ "question__title": "Make Object Immutable", "question__title_slug": "make-object-immutable", "question__hide": false, - "total_acs": 187, - "total_submitted": 309, + "total_acs": 192, + "total_submitted": 319, "frontend_question_id": 2692, "is_new_question": false }, @@ -3212,8 +3603,8 @@ "question__title": "Generate Fibonacci Sequence", "question__title_slug": "generate-fibonacci-sequence", "question__hide": false, - "total_acs": 13616, - "total_submitted": 15935, + "total_acs": 14129, + "total_submitted": 16633, "frontend_question_id": 2648, "is_new_question": false }, @@ -3235,8 +3626,8 @@ "question__title": "Differences Between Two Objects", "question__title_slug": "differences-between-two-objects", "question__hide": false, - "total_acs": 5432, - "total_submitted": 6581, + "total_acs": 5450, + "total_submitted": 6610, "frontend_question_id": 2700, "is_new_question": false }, @@ -3258,8 +3649,8 @@ "question__title": "Immutability Helper", "question__title_slug": "immutability-helper", "question__hide": false, - "total_acs": 110, - "total_submitted": 238, + "total_acs": 111, + "total_submitted": 244, "frontend_question_id": 2691, "is_new_question": false }, @@ -3281,8 +3672,8 @@ "question__title": "Infinite Method Object", "question__title_slug": "infinite-method-object", "question__hide": false, - "total_acs": 442, - "total_submitted": 468, + "total_acs": 475, + "total_submitted": 503, "frontend_question_id": 2690, "is_new_question": false }, @@ -3304,8 +3695,8 @@ "question__title": "Throttle", "question__title_slug": "throttle", "question__hide": false, - "total_acs": 7275, - "total_submitted": 8472, + "total_acs": 7321, + "total_submitted": 8526, "frontend_question_id": 2676, "is_new_question": false }, @@ -3327,8 +3718,8 @@ "question__title": "Bind Function to Context", "question__title_slug": "bind-function-to-context", "question__hide": false, - "total_acs": 164, - "total_submitted": 178, + "total_acs": 182, + "total_submitted": 197, "frontend_question_id": 2754, "is_new_question": false }, @@ -3350,8 +3741,8 @@ "question__title": "Array of Objects to Matrix", "question__title_slug": "array-of-objects-to-matrix", "question__hide": false, - "total_acs": 5679, - "total_submitted": 8142, + "total_acs": 5687, + "total_submitted": 8155, "frontend_question_id": 2675, "is_new_question": false }, @@ -3373,8 +3764,8 @@ "question__title": "Array Upper Bound", "question__title_slug": "array-upper-bound", "question__hide": false, - "total_acs": 263, - "total_submitted": 316, + "total_acs": 309, + "total_submitted": 372, "frontend_question_id": 2774, "is_new_question": false }, @@ -3396,8 +3787,8 @@ "question__title": "Maximum Sum With Exactly K Elements ", "question__title_slug": "maximum-sum-with-exactly-k-elements", "question__hide": false, - "total_acs": 38062, - "total_submitted": 46004, + "total_acs": 39315, + "total_submitted": 47571, "frontend_question_id": 2656, "is_new_question": false }, @@ -3419,8 +3810,8 @@ "question__title": "Find the Prefix Common Array of Two Arrays", "question__title_slug": "find-the-prefix-common-array-of-two-arrays", "question__hide": false, - "total_acs": 24534, - "total_submitted": 30100, + "total_acs": 25134, + "total_submitted": 30798, "frontend_question_id": 2657, "is_new_question": false }, @@ -3442,8 +3833,8 @@ "question__title": "Make Array Empty", "question__title_slug": "make-array-empty", "question__hide": false, - "total_acs": 6790, - "total_submitted": 28654, + "total_acs": 6957, + "total_submitted": 29141, "frontend_question_id": 2659, "is_new_question": false }, @@ -3465,8 +3856,8 @@ "question__title": "Maximum Number of Fish in a Grid", "question__title_slug": "maximum-number-of-fish-in-a-grid", "question__hide": false, - "total_acs": 17185, - "total_submitted": 28951, + "total_acs": 17576, + "total_submitted": 29504, "frontend_question_id": 2658, "is_new_question": false }, @@ -3488,8 +3879,8 @@ "question__title": "Cache With Time Limit", "question__title_slug": "cache-with-time-limit", "question__hide": false, - "total_acs": 16048, - "total_submitted": 20914, + "total_acs": 16866, + "total_submitted": 22011, "frontend_question_id": 2622, "is_new_question": false }, @@ -3511,8 +3902,8 @@ "question__title": "Array Reduce Transformation", "question__title_slug": "array-reduce-transformation", "question__hide": false, - "total_acs": 44962, - "total_submitted": 52944, + "total_acs": 47882, + "total_submitted": 56413, "frontend_question_id": 2626, "is_new_question": false }, @@ -3534,8 +3925,8 @@ "question__title": "Snail Traversal", "question__title_slug": "snail-traversal", "question__hide": false, - "total_acs": 4818, - "total_submitted": 7378, + "total_acs": 5062, + "total_submitted": 7761, "frontend_question_id": 2624, "is_new_question": false }, @@ -3557,8 +3948,8 @@ "question__title": "Flatten Deeply Nested Array", "question__title_slug": "flatten-deeply-nested-array", "question__hide": false, - "total_acs": 13949, - "total_submitted": 20689, + "total_acs": 14737, + "total_submitted": 21962, "frontend_question_id": 2625, "is_new_question": false }, @@ -3580,8 +3971,8 @@ "question__title": "Check if Object Instance of Class", "question__title_slug": "check-if-object-instance-of-class", "question__hide": false, - "total_acs": 13364, - "total_submitted": 44927, + "total_acs": 13790, + "total_submitted": 46773, "frontend_question_id": 2618, "is_new_question": false }, @@ -3603,8 +3994,8 @@ "question__title": "Count of Integers", "question__title_slug": "count-of-integers", "question__hide": false, - "total_acs": 7002, - "total_submitted": 20644, + "total_acs": 7277, + "total_submitted": 21370, "frontend_question_id": 2719, "is_new_question": false }, @@ -3626,8 +4017,8 @@ "question__title": "Buy Two Chocolates", "question__title_slug": "buy-two-chocolates", "question__hide": false, - "total_acs": 33497, - "total_submitted": 51691, + "total_acs": 34767, + "total_submitted": 54209, "frontend_question_id": 2706, "is_new_question": false }, @@ -3649,8 +4040,8 @@ "question__title": "Extra Characters in a String", "question__title_slug": "extra-characters-in-a-string", "question__hide": false, - "total_acs": 14954, - "total_submitted": 42964, + "total_acs": 15200, + "total_submitted": 43474, "frontend_question_id": 2707, "is_new_question": false }, @@ -3672,8 +4063,8 @@ "question__title": "Maximum Strength of a Group", "question__title_slug": "maximum-strength-of-a-group", "question__hide": false, - "total_acs": 19807, - "total_submitted": 85020, + "total_acs": 20054, + "total_submitted": 86137, "frontend_question_id": 2708, "is_new_question": false }, @@ -3695,8 +4086,8 @@ "question__title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "question__title_slug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1", "question__hide": false, - "total_acs": 10479, - "total_submitted": 29558, + "total_acs": 10568, + "total_submitted": 29796, "frontend_question_id": 2654, "is_new_question": false }, @@ -3718,8 +4109,8 @@ "question__title": "Sum Multiples", "question__title_slug": "sum-multiples", "question__hide": false, - "total_acs": 59861, - "total_submitted": 70321, + "total_acs": 62328, + "total_submitted": 73199, "frontend_question_id": 2652, "is_new_question": false }, @@ -3741,8 +4132,8 @@ "question__title": "Sliding Subarray Beauty", "question__title_slug": "sliding-subarray-beauty", "question__hide": false, - "total_acs": 15384, - "total_submitted": 48171, + "total_acs": 15572, + "total_submitted": 48606, "frontend_question_id": 2653, "is_new_question": false }, @@ -3764,8 +4155,8 @@ "question__title": "Promise Pool", "question__title_slug": "promise-pool", "question__hide": false, - "total_acs": 9950, - "total_submitted": 12286, + "total_acs": 10046, + "total_submitted": 12397, "frontend_question_id": 2636, "is_new_question": false }, @@ -3787,14 +4178,14 @@ "question__title": "Promise Time Limit", "question__title_slug": "promise-time-limit", "question__hide": false, - "total_acs": 20062, - "total_submitted": 24290, + "total_acs": 20882, + "total_submitted": 25342, "frontend_question_id": 2637, "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -3810,8 +4201,8 @@ "question__title": "Calculate Delayed Arrival Time", "question__title_slug": "calculate-delayed-arrival-time", "question__hide": false, - "total_acs": 36577, - "total_submitted": 45421, + "total_acs": 37270, + "total_submitted": 46325, "frontend_question_id": 2651, "is_new_question": false }, @@ -3833,8 +4224,8 @@ "question__title": "Apply Transform Over Each Element in Array", "question__title_slug": "apply-transform-over-each-element-in-array", "question__hide": false, - "total_acs": 50438, - "total_submitted": 57951, + "total_acs": 53745, + "total_submitted": 61894, "frontend_question_id": 2635, "is_new_question": false }, @@ -3856,8 +4247,8 @@ "question__title": "Filter Elements from Array", "question__title_slug": "filter-elements-from-array", "question__hide": false, - "total_acs": 47068, - "total_submitted": 55568, + "total_acs": 50160, + "total_submitted": 59361, "frontend_question_id": 2634, "is_new_question": false }, @@ -3879,8 +4270,8 @@ "question__title": "Convert Object to JSON String", "question__title_slug": "convert-object-to-json-string", "question__hide": false, - "total_acs": 9785, - "total_submitted": 12596, + "total_acs": 9819, + "total_submitted": 12636, "frontend_question_id": 2633, "is_new_question": false }, @@ -3902,8 +4293,8 @@ "question__title": "Memoize II", "question__title_slug": "memoize-ii", "question__hide": false, - "total_acs": 2339, - "total_submitted": 7017, + "total_acs": 2487, + "total_submitted": 7470, "frontend_question_id": 2630, "is_new_question": false }, @@ -3925,8 +4316,8 @@ "question__title": "Debounce", "question__title_slug": "debounce", "question__hide": false, - "total_acs": 16437, - "total_submitted": 17690, + "total_acs": 17218, + "total_submitted": 18533, "frontend_question_id": 2627, "is_new_question": false }, @@ -3948,8 +4339,8 @@ "question__title": "Group By", "question__title_slug": "group-by", "question__hide": false, - "total_acs": 13137, - "total_submitted": 15579, + "total_acs": 13865, + "total_submitted": 16475, "frontend_question_id": 2631, "is_new_question": false }, @@ -3971,8 +4362,8 @@ "question__title": "Function Composition", "question__title_slug": "function-composition", "question__hide": false, - "total_acs": 40255, - "total_submitted": 46366, + "total_acs": 42608, + "total_submitted": 49365, "frontend_question_id": 2629, "is_new_question": false }, @@ -3994,8 +4385,8 @@ "question__title": "Curry", "question__title_slug": "curry", "question__hide": false, - "total_acs": 14271, - "total_submitted": 15987, + "total_acs": 14358, + "total_submitted": 16090, "frontend_question_id": 2632, "is_new_question": false }, @@ -4017,8 +4408,8 @@ "question__title": "Minimize the Total Price of the Trips", "question__title_slug": "minimize-the-total-price-of-the-trips", "question__hide": false, - "total_acs": 6404, - "total_submitted": 15211, + "total_acs": 6568, + "total_submitted": 15517, "frontend_question_id": 2646, "is_new_question": false }, @@ -4040,8 +4431,8 @@ "question__title": "Count the Number of K-Free Subsets", "question__title_slug": "count-the-number-of-k-free-subsets", "question__hide": false, - "total_acs": 1058, - "total_submitted": 2079, + "total_acs": 1106, + "total_submitted": 2184, "frontend_question_id": 2638, "is_new_question": false }, @@ -4063,8 +4454,8 @@ "question__title": "Row With Maximum Ones", "question__title_slug": "row-with-maximum-ones", "question__hide": false, - "total_acs": 32277, - "total_submitted": 42398, + "total_acs": 33124, + "total_submitted": 43620, "frontend_question_id": 2643, "is_new_question": false }, @@ -4086,8 +4477,8 @@ "question__title": "Minimum Additions to Make Valid String", "question__title_slug": "minimum-additions-to-make-valid-string", "question__hide": false, - "total_acs": 21481, - "total_submitted": 42865, + "total_acs": 21734, + "total_submitted": 43320, "frontend_question_id": 2645, "is_new_question": false }, @@ -4109,8 +4500,8 @@ "question__title": "JSON Deep Equal", "question__title_slug": "json-deep-equal", "question__hide": false, - "total_acs": 10174, - "total_submitted": 26793, + "total_acs": 10251, + "total_submitted": 27003, "frontend_question_id": 2628, "is_new_question": false }, @@ -4132,8 +4523,8 @@ "question__title": "Array Prototype Last", "question__title_slug": "array-prototype-last", "question__hide": false, - "total_acs": 56517, - "total_submitted": 78229, + "total_acs": 59904, + "total_submitted": 83292, "frontend_question_id": 2619, "is_new_question": false }, @@ -4155,8 +4546,8 @@ "question__title": "Sleep", "question__title_slug": "sleep", "question__hide": false, - "total_acs": 48763, - "total_submitted": 57147, + "total_acs": 51590, + "total_submitted": 60669, "frontend_question_id": 2621, "is_new_question": false }, @@ -4178,8 +4569,8 @@ "question__title": "Counter", "question__title_slug": "counter", "question__hide": false, - "total_acs": 111004, - "total_submitted": 136159, + "total_acs": 119306, + "total_submitted": 147015, "frontend_question_id": 2620, "is_new_question": false }, @@ -4201,8 +4592,8 @@ "question__title": "Memoize", "question__title_slug": "memoize", "question__hide": false, - "total_acs": 28625, - "total_submitted": 45470, + "total_acs": 30346, + "total_submitted": 48383, "frontend_question_id": 2623, "is_new_question": false }, @@ -4224,8 +4615,8 @@ "question__title": "Maximum OR", "question__title_slug": "maximum-or", "question__hide": false, - "total_acs": 10534, - "total_submitted": 25820, + "total_acs": 10674, + "total_submitted": 26105, "frontend_question_id": 2680, "is_new_question": false }, @@ -4247,8 +4638,8 @@ "question__title": "Minimum Operations to Make Numbers Non-positive", "question__title_slug": "minimum-operations-to-make-numbers-non-positive", "question__hide": false, - "total_acs": 510, - "total_submitted": 963, + "total_acs": 530, + "total_submitted": 1017, "frontend_question_id": 2702, "is_new_question": false }, @@ -4270,8 +4661,8 @@ "question__title": "Sum in a Matrix", "question__title_slug": "sum-in-a-matrix", "question__hide": false, - "total_acs": 23352, - "total_submitted": 39014, + "total_acs": 23857, + "total_submitted": 39813, "frontend_question_id": 2679, "is_new_question": false }, @@ -4293,8 +4684,8 @@ "question__title": "Number of Senior Citizens", "question__title_slug": "number-of-senior-citizens", "question__hide": false, - "total_acs": 32730, - "total_submitted": 42520, + "total_acs": 33697, + "total_submitted": 43766, "frontend_question_id": 2678, "is_new_question": false }, @@ -4316,8 +4707,8 @@ "question__title": "Minimum Reverse Operations", "question__title_slug": "minimum-reverse-operations", "question__hide": false, - "total_acs": 3018, - "total_submitted": 20001, + "total_acs": 3083, + "total_submitted": 20464, "frontend_question_id": 2612, "is_new_question": false }, @@ -4339,8 +4730,8 @@ "question__title": "Mice and Cheese", "question__title_slug": "mice-and-cheese", "question__hide": false, - "total_acs": 17785, - "total_submitted": 40539, + "total_acs": 18130, + "total_submitted": 41196, "frontend_question_id": 2611, "is_new_question": false }, @@ -4362,8 +4753,8 @@ "question__title": "Convert an Array Into a 2D Array With Conditions", "question__title_slug": "convert-an-array-into-a-2d-array-with-conditions", "question__hide": false, - "total_acs": 29756, - "total_submitted": 34994, + "total_acs": 30307, + "total_submitted": 35697, "frontend_question_id": 2610, "is_new_question": false }, @@ -4385,8 +4776,8 @@ "question__title": "Find the Longest Balanced Substring of a Binary String", "question__title_slug": "find-the-longest-balanced-substring-of-a-binary-string", "question__hide": false, - "total_acs": 24432, - "total_submitted": 53242, + "total_acs": 24679, + "total_submitted": 53726, "frontend_question_id": 2609, "is_new_question": false }, @@ -4408,8 +4799,8 @@ "question__title": "Prime In Diagonal", "question__title_slug": "prime-in-diagonal", "question__hide": false, - "total_acs": 29088, - "total_submitted": 88855, + "total_acs": 29560, + "total_submitted": 90159, "frontend_question_id": 2614, "is_new_question": false }, @@ -4431,8 +4822,8 @@ "question__title": "Sum of Distances", "question__title_slug": "sum-of-distances", "question__hide": false, - "total_acs": 13981, - "total_submitted": 46536, + "total_acs": 14190, + "total_submitted": 47190, "frontend_question_id": 2615, "is_new_question": false }, @@ -4454,8 +4845,8 @@ "question__title": "Minimize the Maximum Difference of Pairs", "question__title_slug": "minimize-the-maximum-difference-of-pairs", "question__hide": false, - "total_acs": 57815, - "total_submitted": 128505, + "total_acs": 59764, + "total_submitted": 133143, "frontend_question_id": 2616, "is_new_question": false }, @@ -4477,8 +4868,8 @@ "question__title": "Beautiful Pairs", "question__title_slug": "beautiful-pairs", "question__hide": false, - "total_acs": 384, - "total_submitted": 813, + "total_acs": 396, + "total_submitted": 832, "frontend_question_id": 2613, "is_new_question": false }, @@ -4500,8 +4891,8 @@ "question__title": "Minimum Operations to Make All Array Elements Equal", "question__title_slug": "minimum-operations-to-make-all-array-elements-equal", "question__hide": false, - "total_acs": 13339, - "total_submitted": 37975, + "total_acs": 13502, + "total_submitted": 38412, "frontend_question_id": 2602, "is_new_question": false }, @@ -4523,8 +4914,8 @@ "question__title": "Collect Coins in a Tree", "question__title_slug": "collect-coins-in-a-tree", "question__hide": false, - "total_acs": 4009, - "total_submitted": 10728, + "total_acs": 4207, + "total_submitted": 11164, "frontend_question_id": 2603, "is_new_question": false }, @@ -4546,8 +4937,8 @@ "question__title": "Prime Subtraction Operation", "question__title_slug": "prime-subtraction-operation", "question__hide": false, - "total_acs": 13786, - "total_submitted": 36971, + "total_acs": 13911, + "total_submitted": 37287, "frontend_question_id": 2601, "is_new_question": false }, @@ -4569,8 +4960,8 @@ "question__title": "K Items With the Maximum Sum", "question__title_slug": "k-items-with-the-maximum-sum", "question__hide": false, - "total_acs": 28706, - "total_submitted": 46718, + "total_acs": 29094, + "total_submitted": 47311, "frontend_question_id": 2600, "is_new_question": false }, @@ -4592,8 +4983,8 @@ "question__title": "Left and Right Sum Differences", "question__title_slug": "left-and-right-sum-differences", "question__hide": false, - "total_acs": 75358, - "total_submitted": 87067, + "total_acs": 77476, + "total_submitted": 89588, "frontend_question_id": 2574, "is_new_question": false }, @@ -4615,8 +5006,8 @@ "question__title": "Find the Divisibility Array of a String", "question__title_slug": "find-the-divisibility-array-of-a-string", "question__hide": false, - "total_acs": 22569, - "total_submitted": 71309, + "total_acs": 22763, + "total_submitted": 71787, "frontend_question_id": 2575, "is_new_question": false }, @@ -4638,8 +5029,8 @@ "question__title": "Find the Maximum Number of Marked Indices", "question__title_slug": "find-the-maximum-number-of-marked-indices", "question__hide": false, - "total_acs": 16135, - "total_submitted": 42412, + "total_acs": 16285, + "total_submitted": 42749, "frontend_question_id": 2576, "is_new_question": false }, @@ -4661,8 +5052,8 @@ "question__title": "Minimum Time to Visit a Cell In a Grid", "question__title_slug": "minimum-time-to-visit-a-cell-in-a-grid", "question__hide": false, - "total_acs": 8085, - "total_submitted": 22695, + "total_acs": 8274, + "total_submitted": 23200, "frontend_question_id": 2577, "is_new_question": false }, @@ -4684,8 +5075,8 @@ "question__title": "Minimum Operations to Reduce an Integer to 0", "question__title_slug": "minimum-operations-to-reduce-an-integer-to-0", "question__hide": false, - "total_acs": 18053, - "total_submitted": 35345, + "total_acs": 18350, + "total_submitted": 35722, "frontend_question_id": 2571, "is_new_question": false }, @@ -4707,8 +5098,8 @@ "question__title": "Count the Number of Square-Free Subsets", "question__title_slug": "count-the-number-of-square-free-subsets", "question__hide": false, - "total_acs": 6611, - "total_submitted": 30167, + "total_acs": 6747, + "total_submitted": 30626, "frontend_question_id": 2572, "is_new_question": false }, @@ -4730,8 +5121,8 @@ "question__title": "Find the String with LCP", "question__title_slug": "find-the-string-with-lcp", "question__hide": false, - "total_acs": 3618, - "total_submitted": 10547, + "total_acs": 3676, + "total_submitted": 10753, "frontend_question_id": 2573, "is_new_question": false }, @@ -4753,8 +5144,8 @@ "question__title": "Merge Two 2D Arrays by Summing Values", "question__title_slug": "merge-two-2d-arrays-by-summing-values", "question__hide": false, - "total_acs": 28999, - "total_submitted": 39755, + "total_acs": 29465, + "total_submitted": 40339, "frontend_question_id": 2570, "is_new_question": false }, @@ -4776,8 +5167,8 @@ "question__title": "Minimum Score by Changing Two Elements", "question__title_slug": "minimum-score-by-changing-two-elements", "question__hide": false, - "total_acs": 14370, - "total_submitted": 29670, + "total_acs": 14486, + "total_submitted": 29863, "frontend_question_id": 2567, "is_new_question": false }, @@ -4799,8 +5190,8 @@ "question__title": "Minimum Impossible OR", "question__title_slug": "minimum-impossible-or", "question__hide": false, - "total_acs": 12739, - "total_submitted": 21835, + "total_acs": 12837, + "total_submitted": 21979, "frontend_question_id": 2568, "is_new_question": false }, @@ -4822,8 +5213,8 @@ "question__title": "Maximum Difference by Remapping a Digit", "question__title_slug": "maximum-difference-by-remapping-a-digit", "question__hide": false, - "total_acs": 20253, - "total_submitted": 33964, + "total_acs": 20439, + "total_submitted": 34240, "frontend_question_id": 2566, "is_new_question": false }, @@ -4845,8 +5236,8 @@ "question__title": "Handling Sum Queries After Update", "question__title_slug": "handling-sum-queries-after-update", "question__hide": false, - "total_acs": 4006, - "total_submitted": 14310, + "total_acs": 4048, + "total_submitted": 14488, "frontend_question_id": 2569, "is_new_question": false }, @@ -4868,8 +5259,8 @@ "question__title": "Maximum Number of Integers to Choose From a Range II", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-ii", "question__hide": false, - "total_acs": 1034, - "total_submitted": 2414, + "total_acs": 1045, + "total_submitted": 2471, "frontend_question_id": 2557, "is_new_question": false }, @@ -4891,8 +5282,8 @@ "question__title": "Subsequence With the Minimum Score", "question__title_slug": "subsequence-with-the-minimum-score", "question__hide": false, - "total_acs": 5247, - "total_submitted": 16216, + "total_acs": 5299, + "total_submitted": 16429, "frontend_question_id": 2565, "is_new_question": false }, @@ -4914,8 +5305,8 @@ "question__title": "Substring XOR Queries", "question__title_slug": "substring-xor-queries", "question__hide": false, - "total_acs": 10698, - "total_submitted": 31500, + "total_acs": 10774, + "total_submitted": 31749, "frontend_question_id": 2564, "is_new_question": false }, @@ -4937,8 +5328,8 @@ "question__title": "Count the Number of Fair Pairs", "question__title_slug": "count-the-number-of-fair-pairs", "question__hide": false, - "total_acs": 19581, - "total_submitted": 59266, + "total_acs": 19824, + "total_submitted": 59818, "frontend_question_id": 2563, "is_new_question": false }, @@ -4960,8 +5351,8 @@ "question__title": "Find the Array Concatenation Value", "question__title_slug": "find-the-array-concatenation-value", "question__hide": false, - "total_acs": 34866, - "total_submitted": 50255, + "total_acs": 35319, + "total_submitted": 50842, "frontend_question_id": 2562, "is_new_question": false }, @@ -4983,8 +5374,8 @@ "question__title": "Minimum Number of Visited Cells in a Grid", "question__title_slug": "minimum-number-of-visited-cells-in-a-grid", "question__hide": false, - "total_acs": 6676, - "total_submitted": 24941, + "total_acs": 6762, + "total_submitted": 25421, "frontend_question_id": 2617, "is_new_question": false }, @@ -5006,8 +5397,8 @@ "question__title": "The Number of Beautiful Subsets", "question__title_slug": "the-number-of-beautiful-subsets", "question__hide": false, - "total_acs": 14845, - "total_submitted": 49357, + "total_acs": 15023, + "total_submitted": 49798, "frontend_question_id": 2597, "is_new_question": false }, @@ -5029,8 +5420,8 @@ "question__title": "Find Score of an Array After Marking All Elements", "question__title_slug": "find-score-of-an-array-after-marking-all-elements", "question__hide": false, - "total_acs": 14203, - "total_submitted": 26385, + "total_acs": 14381, + "total_submitted": 26667, "frontend_question_id": 2593, "is_new_question": false }, @@ -5052,8 +5443,8 @@ "question__title": "Find the Maximum Divisibility Score", "question__title_slug": "find-the-maximum-divisibility-score", "question__hide": false, - "total_acs": 23972, - "total_submitted": 49230, + "total_acs": 24246, + "total_submitted": 49734, "frontend_question_id": 2644, "is_new_question": false }, @@ -5075,8 +5466,8 @@ "question__title": "Maximum Price to Fill a Bag", "question__title_slug": "maximum-price-to-fill-a-bag", "question__hide": false, - "total_acs": 922, - "total_submitted": 1390, + "total_acs": 928, + "total_submitted": 1407, "frontend_question_id": 2548, "is_new_question": false }, @@ -5098,8 +5489,8 @@ "question__title": "Take Gifts From the Richest Pile", "question__title_slug": "take-gifts-from-the-richest-pile", "question__hide": false, - "total_acs": 33789, - "total_submitted": 50873, + "total_acs": 34261, + "total_submitted": 51533, "frontend_question_id": 2558, "is_new_question": false }, @@ -5121,8 +5512,8 @@ "question__title": "Count Vowel Strings in Ranges", "question__title_slug": "count-vowel-strings-in-ranges", "question__hide": false, - "total_acs": 22530, - "total_submitted": 43413, + "total_acs": 22712, + "total_submitted": 43728, "frontend_question_id": 2559, "is_new_question": false }, @@ -5144,8 +5535,8 @@ "question__title": "House Robber IV", "question__title_slug": "house-robber-iv", "question__hide": false, - "total_acs": 12963, - "total_submitted": 30899, + "total_acs": 13247, + "total_submitted": 31505, "frontend_question_id": 2560, "is_new_question": false }, @@ -5167,8 +5558,8 @@ "question__title": "Rearranging Fruits", "question__title_slug": "rearranging-fruits", "question__hide": false, - "total_acs": 7275, - "total_submitted": 21024, + "total_acs": 7479, + "total_submitted": 21539, "frontend_question_id": 2561, "is_new_question": false }, @@ -5190,8 +5581,8 @@ "question__title": "Design a Todo List", "question__title_slug": "design-a-todo-list", "question__hide": false, - "total_acs": 811, - "total_submitted": 1343, + "total_acs": 839, + "total_submitted": 1392, "frontend_question_id": 2590, "is_new_question": false }, @@ -5213,8 +5604,8 @@ "question__title": "Lexicographically Smallest Beautiful String", "question__title_slug": "lexicographically-smallest-beautiful-string", "question__hide": false, - "total_acs": 3841, - "total_submitted": 9713, + "total_acs": 3879, + "total_submitted": 9806, "frontend_question_id": 2663, "is_new_question": false }, @@ -5236,8 +5627,8 @@ "question__title": "Minimum Cost of a Path With Special Roads", "question__title_slug": "minimum-cost-of-a-path-with-special-roads", "question__hide": false, - "total_acs": 8362, - "total_submitted": 23455, + "total_acs": 8492, + "total_submitted": 23778, "frontend_question_id": 2662, "is_new_question": false }, @@ -5259,8 +5650,8 @@ "question__title": "First Completely Painted Row or Column", "question__title_slug": "first-completely-painted-row-or-column", "question__hide": false, - "total_acs": 17769, - "total_submitted": 35307, + "total_acs": 18140, + "total_submitted": 35941, "frontend_question_id": 2661, "is_new_question": false }, @@ -5282,8 +5673,8 @@ "question__title": "Determine the Winner of a Bowling Game", "question__title_slug": "determine-the-winner-of-a-bowling-game", "question__hide": false, - "total_acs": 25416, - "total_submitted": 74580, + "total_acs": 25770, + "total_submitted": 75562, "frontend_question_id": 2660, "is_new_question": false }, @@ -5305,8 +5696,8 @@ "question__title": "Count the Number of Good Subsequences", "question__title_slug": "count-the-number-of-good-subsequences", "question__hide": false, - "total_acs": 1443, - "total_submitted": 2104, + "total_acs": 1496, + "total_submitted": 2220, "frontend_question_id": 2539, "is_new_question": false }, @@ -5328,8 +5719,8 @@ "question__title": "Count Increasing Quadruplets", "question__title_slug": "count-increasing-quadruplets", "question__hide": false, - "total_acs": 6374, - "total_submitted": 19899, + "total_acs": 6569, + "total_submitted": 20345, "frontend_question_id": 2552, "is_new_question": false }, @@ -5351,8 +5742,8 @@ "question__title": "Put Marbles in Bags", "question__title_slug": "put-marbles-in-bags", "question__hide": false, - "total_acs": 52891, - "total_submitted": 77240, + "total_acs": 53137, + "total_submitted": 77762, "frontend_question_id": 2551, "is_new_question": false }, @@ -5374,8 +5765,8 @@ "question__title": "Count Collisions of Monkeys on a Polygon", "question__title_slug": "count-collisions-of-monkeys-on-a-polygon", "question__hide": false, - "total_acs": 16393, - "total_submitted": 60876, + "total_acs": 16515, + "total_submitted": 61284, "frontend_question_id": 2550, "is_new_question": false }, @@ -5397,8 +5788,8 @@ "question__title": "Count Distinct Numbers on Board", "question__title_slug": "count-distinct-numbers-on-board", "question__hide": false, - "total_acs": 30719, - "total_submitted": 51471, + "total_acs": 31017, + "total_submitted": 51915, "frontend_question_id": 2549, "is_new_question": false }, @@ -5420,8 +5811,8 @@ "question__title": "Design Graph With Shortest Path Calculator", "question__title_slug": "design-graph-with-shortest-path-calculator", "question__hide": false, - "total_acs": 9430, - "total_submitted": 16364, + "total_acs": 9575, + "total_submitted": 16582, "frontend_question_id": 2642, "is_new_question": false }, @@ -5443,8 +5834,8 @@ "question__title": "Cousins in Binary Tree II", "question__title_slug": "cousins-in-binary-tree-ii", "question__hide": false, - "total_acs": 13800, - "total_submitted": 19863, + "total_acs": 14055, + "total_submitted": 20185, "frontend_question_id": 2641, "is_new_question": false }, @@ -5466,8 +5857,8 @@ "question__title": "Find the Score of All Prefixes of an Array", "question__title_slug": "find-the-score-of-all-prefixes-of-an-array", "question__hide": false, - "total_acs": 20741, - "total_submitted": 28897, + "total_acs": 21030, + "total_submitted": 29297, "frontend_question_id": 2640, "is_new_question": false }, @@ -5489,8 +5880,8 @@ "question__title": "Find the Width of Columns of a Grid", "question__title_slug": "find-the-width-of-columns-of-a-grid", "question__hide": false, - "total_acs": 20294, - "total_submitted": 30611, + "total_acs": 20521, + "total_submitted": 30898, "frontend_question_id": 2639, "is_new_question": false }, @@ -5512,8 +5903,8 @@ "question__title": "Make the Prefix Sum Non-negative", "question__title_slug": "make-the-prefix-sum-non-negative", "question__hide": false, - "total_acs": 887, - "total_submitted": 1707, + "total_acs": 907, + "total_submitted": 1749, "frontend_question_id": 2599, "is_new_question": false }, @@ -5535,8 +5926,8 @@ "question__title": "Maximize Win From Two Segments", "question__title_slug": "maximize-win-from-two-segments", "question__hide": false, - "total_acs": 7940, - "total_submitted": 24583, + "total_acs": 8041, + "total_submitted": 24809, "frontend_question_id": 2555, "is_new_question": false }, @@ -5558,8 +5949,8 @@ "question__title": "Number of Good Binary Strings", "question__title_slug": "number-of-good-binary-strings", "question__hide": false, - "total_acs": 1597, - "total_submitted": 2725, + "total_acs": 1911, + "total_submitted": 3359, "frontend_question_id": 2533, "is_new_question": false }, @@ -5581,8 +5972,8 @@ "question__title": "Shortest Cycle in a Graph", "question__title_slug": "shortest-cycle-in-a-graph", "question__hide": false, - "total_acs": 12059, - "total_submitted": 32032, + "total_acs": 12315, + "total_submitted": 32816, "frontend_question_id": 2608, "is_new_question": false }, @@ -5604,8 +5995,8 @@ "question__title": "Make K-Subarray Sums Equal", "question__title_slug": "make-k-subarray-sums-equal", "question__hide": false, - "total_acs": 7232, - "total_submitted": 21202, + "total_acs": 7335, + "total_submitted": 21407, "frontend_question_id": 2607, "is_new_question": false }, @@ -5627,8 +6018,8 @@ "question__title": "Find the Substring With Maximum Cost", "question__title_slug": "find-the-substring-with-maximum-cost", "question__hide": false, - "total_acs": 19178, - "total_submitted": 34153, + "total_acs": 19362, + "total_submitted": 34466, "frontend_question_id": 2606, "is_new_question": false }, @@ -5650,8 +6041,8 @@ "question__title": "Form Smallest Number From Two Digit Arrays", "question__title_slug": "form-smallest-number-from-two-digit-arrays", "question__hide": false, - "total_acs": 27143, - "total_submitted": 50719, + "total_acs": 27479, + "total_submitted": 51330, "frontend_question_id": 2605, "is_new_question": false }, @@ -5673,8 +6064,8 @@ "question__title": "Maximum Frequency Score of a Subarray", "question__title_slug": "maximum-frequency-score-of-a-subarray", "question__hide": false, - "total_acs": 666, - "total_submitted": 1651, + "total_acs": 670, + "total_submitted": 1667, "frontend_question_id": 2524, "is_new_question": false }, @@ -5696,8 +6087,8 @@ "question__title": "Minimum Time to Eat All Grains", "question__title_slug": "minimum-time-to-eat-all-grains", "question__hide": false, - "total_acs": 623, - "total_submitted": 1338, + "total_acs": 628, + "total_submitted": 1359, "frontend_question_id": 2604, "is_new_question": false }, @@ -5719,8 +6110,8 @@ "question__title": "Minimum Time to Repair Cars", "question__title_slug": "minimum-time-to-repair-cars", "question__hide": false, - "total_acs": 11222, - "total_submitted": 25655, + "total_acs": 11399, + "total_submitted": 26089, "frontend_question_id": 2594, "is_new_question": false }, @@ -5742,8 +6133,8 @@ "question__title": "Maximize Greatness of an Array", "question__title_slug": "maximize-greatness-of-an-array", "question__hide": false, - "total_acs": 17189, - "total_submitted": 29864, + "total_acs": 17405, + "total_submitted": 30214, "frontend_question_id": 2592, "is_new_question": false }, @@ -5765,8 +6156,8 @@ "question__title": "Distribute Money to Maximum Children", "question__title_slug": "distribute-money-to-maximum-children", "question__hide": false, - "total_acs": 19755, - "total_submitted": 105826, + "total_acs": 20052, + "total_submitted": 107452, "frontend_question_id": 2591, "is_new_question": false }, @@ -5788,8 +6179,8 @@ "question__title": "Check Knight Tour Configuration", "question__title_slug": "check-knight-tour-configuration", "question__hide": false, - "total_acs": 20894, - "total_submitted": 35964, + "total_acs": 21112, + "total_submitted": 36325, "frontend_question_id": 2596, "is_new_question": false }, @@ -5811,8 +6202,8 @@ "question__title": "Smallest Missing Non-negative Integer After Operations", "question__title_slug": "smallest-missing-non-negative-integer-after-operations", "question__hide": false, - "total_acs": 11587, - "total_submitted": 29521, + "total_acs": 11730, + "total_submitted": 29840, "frontend_question_id": 2598, "is_new_question": false }, @@ -5834,8 +6225,8 @@ "question__title": "Number of Even and Odd Bits", "question__title_slug": "number-of-even-and-odd-bits", "question__hide": false, - "total_acs": 31954, - "total_submitted": 44668, + "total_acs": 32336, + "total_submitted": 45111, "frontend_question_id": 2595, "is_new_question": false }, @@ -5857,8 +6248,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": 1375, - "total_submitted": 2304, + "total_acs": 1509, + "total_submitted": 2553, "frontend_question_id": 2519, "is_new_question": false }, @@ -5880,8 +6271,8 @@ "question__title": "Minimum Time to Complete All Tasks", "question__title_slug": "minimum-time-to-complete-all-tasks", "question__hide": false, - "total_acs": 6867, - "total_submitted": 18037, + "total_acs": 6926, + "total_submitted": 18206, "frontend_question_id": 2589, "is_new_question": false }, @@ -5903,8 +6294,8 @@ "question__title": "Count the Number of Beautiful Subarrays", "question__title_slug": "count-the-number-of-beautiful-subarrays", "question__hide": false, - "total_acs": 13962, - "total_submitted": 27866, + "total_acs": 14095, + "total_submitted": 28092, "frontend_question_id": 2588, "is_new_question": false }, @@ -5926,8 +6317,8 @@ "question__title": "Rearrange Array to Maximize Prefix Score", "question__title_slug": "rearrange-array-to-maximize-prefix-score", "question__hide": false, - "total_acs": 23948, - "total_submitted": 59463, + "total_acs": 24117, + "total_submitted": 59795, "frontend_question_id": 2587, "is_new_question": false }, @@ -5949,8 +6340,8 @@ "question__title": "Count the Number of Vowel Strings in Range", "question__title_slug": "count-the-number-of-vowel-strings-in-range", "question__hide": false, - "total_acs": 39661, - "total_submitted": 52871, + "total_acs": 40340, + "total_submitted": 53725, "frontend_question_id": 2586, "is_new_question": false }, @@ -5972,8 +6363,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": 2089, - "total_submitted": 4111, + "total_acs": 2183, + "total_submitted": 4277, "frontend_question_id": 2510, "is_new_question": false }, @@ -5995,8 +6386,8 @@ "question__title": "Count Number of Possible Root Nodes", "question__title_slug": "count-number-of-possible-root-nodes", "question__hide": false, - "total_acs": 4208, - "total_submitted": 8595, + "total_acs": 4271, + "total_submitted": 8769, "frontend_question_id": 2581, "is_new_question": false }, @@ -6018,8 +6409,8 @@ "question__title": "Count Ways to Group Overlapping Ranges", "question__title_slug": "count-ways-to-group-overlapping-ranges", "question__hide": false, - "total_acs": 12861, - "total_submitted": 36399, + "total_acs": 12951, + "total_submitted": 36590, "frontend_question_id": 2580, "is_new_question": false }, @@ -6041,8 +6432,8 @@ "question__title": "Split With Minimum Sum", "question__title_slug": "split-with-minimum-sum", "question__hide": false, - "total_acs": 24495, - "total_submitted": 35121, + "total_acs": 24838, + "total_submitted": 35516, "frontend_question_id": 2578, "is_new_question": false }, @@ -6064,8 +6455,8 @@ "question__title": "Count Total Number of Colored Cells", "question__title_slug": "count-total-number-of-colored-cells", "question__hide": false, - "total_acs": 21147, - "total_submitted": 36680, + "total_acs": 21326, + "total_submitted": 36949, "frontend_question_id": 2579, "is_new_question": false }, @@ -6087,8 +6478,8 @@ "question__title": "Number of Ways to Earn Points", "question__title_slug": "number-of-ways-to-earn-points", "question__hide": false, - "total_acs": 12240, - "total_submitted": 20803, + "total_acs": 12578, + "total_submitted": 21422, "frontend_question_id": 2585, "is_new_question": false }, @@ -6110,8 +6501,8 @@ "question__title": "Split the Array to Make Coprime Products", "question__title_slug": "split-the-array-to-make-coprime-products", "question__hide": false, - "total_acs": 9669, - "total_submitted": 43107, + "total_acs": 9771, + "total_submitted": 43521, "frontend_question_id": 2584, "is_new_question": false }, @@ -6133,8 +6524,8 @@ "question__title": "Kth Largest Sum in a Binary Tree", "question__title_slug": "kth-largest-sum-in-a-binary-tree", "question__hide": false, - "total_acs": 26171, - "total_submitted": 55633, + "total_acs": 26616, + "total_submitted": 56622, "frontend_question_id": 2583, "is_new_question": false }, @@ -6156,8 +6547,8 @@ "question__title": "Pass the Pillow", "question__title_slug": "pass-the-pillow", "question__hide": false, - "total_acs": 28545, - "total_submitted": 62258, + "total_acs": 28835, + "total_submitted": 62831, "frontend_question_id": 2582, "is_new_question": false }, @@ -6179,8 +6570,8 @@ "question__title": "Bitwise OR of All Subsequence Sums", "question__title_slug": "bitwise-or-of-all-subsequence-sums", "question__hide": false, - "total_acs": 708, - "total_submitted": 1197, + "total_acs": 718, + "total_submitted": 1214, "frontend_question_id": 2505, "is_new_question": false }, @@ -6202,8 +6593,8 @@ "question__title": "Concatenate the Name and the Profession", "question__title_slug": "concatenate-the-name-and-the-profession", "question__hide": false, - "total_acs": 2174, - "total_submitted": 3322, + "total_acs": 2229, + "total_submitted": 3382, "frontend_question_id": 2504, "is_new_question": false }, @@ -6225,8 +6616,8 @@ "question__title": "Time to Cross a Bridge", "question__title_slug": "time-to-cross-a-bridge", "question__hide": false, - "total_acs": 3434, - "total_submitted": 6710, + "total_acs": 3452, + "total_submitted": 6807, "frontend_question_id": 2532, "is_new_question": false }, @@ -6248,8 +6639,8 @@ "question__title": "Disconnect Path in a Binary Matrix by at Most One Flip", "question__title_slug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "question__hide": false, - "total_acs": 10238, - "total_submitted": 36459, + "total_acs": 10348, + "total_submitted": 36928, "frontend_question_id": 2556, "is_new_question": false }, @@ -6271,8 +6662,8 @@ "question__title": "Maximum Number of Integers to Choose From a Range I", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-i", "question__hide": false, - "total_acs": 24377, - "total_submitted": 46049, + "total_acs": 24586, + "total_submitted": 46377, "frontend_question_id": 2554, "is_new_question": false }, @@ -6294,8 +6685,8 @@ "question__title": "Separate the Digits in an Array", "question__title_slug": "separate-the-digits-in-an-array", "question__hide": false, - "total_acs": 45379, - "total_submitted": 57453, + "total_acs": 46226, + "total_submitted": 58547, "frontend_question_id": 2553, "is_new_question": false }, @@ -6317,8 +6708,8 @@ "question__title": "Number of Subarrays Having Even Product", "question__title_slug": "number-of-subarrays-having-even-product", "question__hide": false, - "total_acs": 1241, - "total_submitted": 1918, + "total_acs": 1252, + "total_submitted": 1935, "frontend_question_id": 2495, "is_new_question": false }, @@ -6340,8 +6731,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": 776, - "total_submitted": 3236, + "total_acs": 799, + "total_submitted": 3359, "frontend_question_id": 2494, "is_new_question": false }, @@ -6363,8 +6754,8 @@ "question__title": "Maximum Subsequence Score", "question__title_slug": "maximum-subsequence-score", "question__hide": false, - "total_acs": 57844, - "total_submitted": 103772, + "total_acs": 58828, + "total_submitted": 105702, "frontend_question_id": 2542, "is_new_question": false }, @@ -6386,8 +6777,8 @@ "question__title": "Check if Point Is Reachable", "question__title_slug": "check-if-point-is-reachable", "question__hide": false, - "total_acs": 5867, - "total_submitted": 13461, + "total_acs": 5950, + "total_submitted": 13642, "frontend_question_id": 2543, "is_new_question": false }, @@ -6409,8 +6800,8 @@ "question__title": "Minimum Common Value", "question__title_slug": "minimum-common-value", "question__hide": false, - "total_acs": 41594, - "total_submitted": 82307, + "total_acs": 42381, + "total_submitted": 83846, "frontend_question_id": 2540, "is_new_question": false }, @@ -6432,8 +6823,8 @@ "question__title": "Minimum Cost to Split an Array", "question__title_slug": "minimum-cost-to-split-an-array", "question__hide": false, - "total_acs": 9543, - "total_submitted": 24212, + "total_acs": 9648, + "total_submitted": 24477, "frontend_question_id": 2547, "is_new_question": false }, @@ -6455,8 +6846,8 @@ "question__title": "Apply Bitwise Operations to Make Strings Equal", "question__title_slug": "apply-bitwise-operations-to-make-strings-equal", "question__hide": false, - "total_acs": 16426, - "total_submitted": 40117, + "total_acs": 16531, + "total_submitted": 40331, "frontend_question_id": 2546, "is_new_question": false }, @@ -6478,8 +6869,8 @@ "question__title": "Sort the Students by Their Kth Score", "question__title_slug": "sort-the-students-by-their-kth-score", "question__hide": false, - "total_acs": 39642, - "total_submitted": 46377, + "total_acs": 40262, + "total_submitted": 47102, "frontend_question_id": 2545, "is_new_question": false }, @@ -6501,8 +6892,8 @@ "question__title": "Alternating Digit Sum", "question__title_slug": "alternating-digit-sum", "question__hide": false, - "total_acs": 41674, - "total_submitted": 60410, + "total_acs": 42197, + "total_submitted": 61200, "frontend_question_id": 2544, "is_new_question": false }, @@ -6524,8 +6915,8 @@ "question__title": "Number of Substrings With Fixed Ratio", "question__title_slug": "number-of-substrings-with-fixed-ratio", "question__hide": false, - "total_acs": 638, - "total_submitted": 1091, + "total_acs": 640, + "total_submitted": 1100, "frontend_question_id": 2489, "is_new_question": false }, @@ -6547,8 +6938,8 @@ "question__title": "Minimize the Maximum of Two Arrays", "question__title_slug": "minimize-the-maximum-of-two-arrays", "question__hide": false, - "total_acs": 5472, - "total_submitted": 19975, + "total_acs": 5531, + "total_submitted": 20184, "frontend_question_id": 2513, "is_new_question": false }, @@ -6570,8 +6961,8 @@ "question__title": "Difference Between Maximum and Minimum Price Sum", "question__title_slug": "difference-between-maximum-and-minimum-price-sum", "question__hide": false, - "total_acs": 5796, - "total_submitted": 16861, + "total_acs": 5876, + "total_submitted": 17099, "frontend_question_id": 2538, "is_new_question": false }, @@ -6593,8 +6984,8 @@ "question__title": "Count the Number of Good Subarrays", "question__title_slug": "count-the-number-of-good-subarrays", "question__hide": false, - "total_acs": 14283, - "total_submitted": 28985, + "total_acs": 14485, + "total_submitted": 29294, "frontend_question_id": 2537, "is_new_question": false }, @@ -6616,8 +7007,8 @@ "question__title": "Increment Submatrices by One", "question__title_slug": "increment-submatrices-by-one", "question__hide": false, - "total_acs": 18136, - "total_submitted": 37026, + "total_acs": 18218, + "total_submitted": 37161, "frontend_question_id": 2536, "is_new_question": false }, @@ -6639,8 +7030,8 @@ "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": 76667, - "total_submitted": 91211, + "total_acs": 78317, + "total_submitted": 93210, "frontend_question_id": 2535, "is_new_question": false }, @@ -6662,8 +7053,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": 472, - "total_submitted": 961, + "total_acs": 479, + "total_submitted": 969, "frontend_question_id": 2479, "is_new_question": false }, @@ -6685,8 +7076,8 @@ "question__title": "Form a Chemical Bond", "question__title_slug": "form-a-chemical-bond", "question__hide": false, - "total_acs": 2317, - "total_submitted": 3484, + "total_acs": 2376, + "total_submitted": 3545, "frontend_question_id": 2480, "is_new_question": false }, @@ -6708,8 +7099,8 @@ "question__title": "Find Xor-Beauty of Array", "question__title_slug": "find-xor-beauty-of-array", "question__hide": false, - "total_acs": 15702, - "total_submitted": 22449, + "total_acs": 15816, + "total_submitted": 22580, "frontend_question_id": 2527, "is_new_question": false }, @@ -6731,8 +7122,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": 18551, - "total_submitted": 39960, + "total_acs": 18740, + "total_submitted": 40279, "frontend_question_id": 2526, "is_new_question": false }, @@ -6754,8 +7145,8 @@ "question__title": "Categorize Box According to Criteria", "question__title_slug": "categorize-box-according-to-criteria", "question__hide": false, - "total_acs": 25369, - "total_submitted": 73859, + "total_acs": 25570, + "total_submitted": 74321, "frontend_question_id": 2525, "is_new_question": false }, @@ -6777,8 +7168,8 @@ "question__title": "Maximize the Minimum Powered City", "question__title_slug": "maximize-the-minimum-powered-city", "question__hide": false, - "total_acs": 5322, - "total_submitted": 16043, + "total_acs": 5410, + "total_submitted": 16317, "frontend_question_id": 2528, "is_new_question": false }, @@ -6800,8 +7191,8 @@ "question__title": "Time Taken to Cross the Door", "question__title_slug": "time-taken-to-cross-the-door", "question__hide": false, - "total_acs": 1471, - "total_submitted": 2711, + "total_acs": 1913, + "total_submitted": 3429, "frontend_question_id": 2534, "is_new_question": false }, @@ -6823,8 +7214,8 @@ "question__title": "Maximal Score After Applying K Operations", "question__title_slug": "maximal-score-after-applying-k-operations", "question__hide": false, - "total_acs": 23402, - "total_submitted": 52623, + "total_acs": 23704, + "total_submitted": 53133, "frontend_question_id": 2530, "is_new_question": false }, @@ -6846,8 +7237,8 @@ "question__title": "Make Number of Distinct Characters Equal", "question__title_slug": "make-number-of-distinct-characters-equal", "question__hide": false, - "total_acs": 15442, - "total_submitted": 59228, + "total_acs": 15568, + "total_submitted": 59673, "frontend_question_id": 2531, "is_new_question": false }, @@ -6869,8 +7260,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": 66424, - "total_submitted": 91422, + "total_acs": 67774, + "total_submitted": 93387, "frontend_question_id": 2529, "is_new_question": false }, @@ -6892,8 +7283,8 @@ "question__title": "Customers With Strictly Increasing Purchases", "question__title_slug": "customers-with-strictly-increasing-purchases", "question__hide": false, - "total_acs": 1512, - "total_submitted": 3786, + "total_acs": 1545, + "total_submitted": 3860, "frontend_question_id": 2474, "is_new_question": false }, @@ -6915,8 +7306,8 @@ "question__title": "Minimum Cost to Buy Apples", "question__title_slug": "minimum-cost-to-buy-apples", "question__hide": false, - "total_acs": 1114, - "total_submitted": 1841, + "total_acs": 1126, + "total_submitted": 1859, "frontend_question_id": 2473, "is_new_question": false }, @@ -6938,8 +7329,8 @@ "question__title": "Closest Prime Numbers in Range", "question__title_slug": "closest-prime-numbers-in-range", "question__hide": false, - "total_acs": 18096, - "total_submitted": 48793, + "total_acs": 18273, + "total_submitted": 49223, "frontend_question_id": 2523, "is_new_question": false }, @@ -6961,8 +7352,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": 23163, - "total_submitted": 45847, + "total_acs": 23444, + "total_submitted": 46378, "frontend_question_id": 2521, "is_new_question": false }, @@ -6984,8 +7375,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": 52235, - "total_submitted": 62014, + "total_acs": 53321, + "total_submitted": 63258, "frontend_question_id": 2520, "is_new_question": false }, @@ -7007,8 +7398,8 @@ "question__title": "Minimum Subarrays in a Valid Split", "question__title_slug": "minimum-subarrays-in-a-valid-split", "question__hide": false, - "total_acs": 856, - "total_submitted": 1546, + "total_acs": 865, + "total_submitted": 1557, "frontend_question_id": 2464, "is_new_question": false }, @@ -7030,8 +7421,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": 21674, - "total_submitted": 27141, + "total_acs": 22722, + "total_submitted": 28339, "frontend_question_id": 2482, "is_new_question": false }, @@ -7053,8 +7444,8 @@ "question__title": "Count Anagrams", "question__title_slug": "count-anagrams", "question__hide": false, - "total_acs": 7265, - "total_submitted": 21864, + "total_acs": 7411, + "total_submitted": 22299, "frontend_question_id": 2514, "is_new_question": false }, @@ -7076,8 +7467,8 @@ "question__title": "Minimum Operations to Make Array Equal II", "question__title_slug": "minimum-operations-to-make-array-equal-ii", "question__hide": false, - "total_acs": 18619, - "total_submitted": 59635, + "total_acs": 18759, + "total_submitted": 60020, "frontend_question_id": 2541, "is_new_question": false }, @@ -7099,8 +7490,8 @@ "question__title": "Reward Top K Students", "question__title_slug": "reward-top-k-students", "question__hide": false, - "total_acs": 14917, - "total_submitted": 32296, + "total_acs": 15097, + "total_submitted": 32656, "frontend_question_id": 2512, "is_new_question": false }, @@ -7122,8 +7513,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": 17923, - "total_submitted": 47602, + "total_acs": 18093, + "total_submitted": 47988, "frontend_question_id": 2511, "is_new_question": false }, @@ -7145,8 +7536,8 @@ "question__title": "Number of Great Partitions", "question__title_slug": "number-of-great-partitions", "question__hide": false, - "total_acs": 6247, - "total_submitted": 19460, + "total_acs": 6449, + "total_submitted": 19992, "frontend_question_id": 2518, "is_new_question": false }, @@ -7168,8 +7559,8 @@ "question__title": "Maximum Tastiness of Candy Basket", "question__title_slug": "maximum-tastiness-of-candy-basket", "question__hide": false, - "total_acs": 13683, - "total_submitted": 21079, + "total_acs": 14064, + "total_submitted": 21636, "frontend_question_id": 2517, "is_new_question": false }, @@ -7191,8 +7582,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": 12388, - "total_submitted": 35930, + "total_acs": 12532, + "total_submitted": 36281, "frontend_question_id": 2516, "is_new_question": false }, @@ -7214,8 +7605,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": 23299, - "total_submitted": 47918, + "total_acs": 23513, + "total_submitted": 48334, "frontend_question_id": 2515, "is_new_question": false }, @@ -7237,8 +7628,8 @@ "question__title": "Cycle Length Queries in a Tree", "question__title_slug": "cycle-length-queries-in-a-tree", "question__hide": false, - "total_acs": 9745, - "total_submitted": 17031, + "total_acs": 9876, + "total_submitted": 17254, "frontend_question_id": 2509, "is_new_question": false }, @@ -7260,8 +7651,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": 10034, - "total_submitted": 30984, + "total_acs": 10110, + "total_submitted": 31301, "frontend_question_id": 2508, "is_new_question": false }, @@ -7283,8 +7674,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": 17921, - "total_submitted": 36786, + "total_acs": 18077, + "total_submitted": 37089, "frontend_question_id": 2507, "is_new_question": false }, @@ -7306,8 +7697,8 @@ "question__title": "Count Pairs Of Similar Strings", "question__title_slug": "count-pairs-of-similar-strings", "question__hide": false, - "total_acs": 31315, - "total_submitted": 45031, + "total_acs": 31656, + "total_submitted": 45510, "frontend_question_id": 2506, "is_new_question": false }, @@ -7329,8 +7720,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": 684, - "total_submitted": 1047, + "total_acs": 689, + "total_submitted": 1055, "frontend_question_id": 2450, "is_new_question": false }, @@ -7352,8 +7743,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": 3101, - "total_submitted": 7246, + "total_acs": 3123, + "total_submitted": 7337, "frontend_question_id": 2499, "is_new_question": false }, @@ -7375,8 +7766,8 @@ "question__title": "Frog Jump II", "question__title_slug": "frog-jump-ii", "question__hide": false, - "total_acs": 14415, - "total_submitted": 23529, + "total_acs": 14653, + "total_submitted": 23938, "frontend_question_id": 2498, "is_new_question": false }, @@ -7398,8 +7789,8 @@ "question__title": "Maximum Star Sum of a Graph", "question__title_slug": "maximum-star-sum-of-a-graph", "question__hide": false, - "total_acs": 14061, - "total_submitted": 36851, + "total_acs": 14278, + "total_submitted": 37426, "frontend_question_id": 2497, "is_new_question": false }, @@ -7421,8 +7812,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": 30290, - "total_submitted": 42430, + "total_acs": 30672, + "total_submitted": 42955, "frontend_question_id": 2496, "is_new_question": false }, @@ -7444,8 +7835,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": 7100, - "total_submitted": 19066, + "total_acs": 7162, + "total_submitted": 19266, "frontend_question_id": 2503, "is_new_question": false }, @@ -7467,8 +7858,8 @@ "question__title": "Design Memory Allocator", "question__title_slug": "design-memory-allocator", "question__hide": false, - "total_acs": 12731, - "total_submitted": 24383, + "total_acs": 12826, + "total_submitted": 24553, "frontend_question_id": 2502, "is_new_question": false }, @@ -7490,8 +7881,8 @@ "question__title": "Longest Square Streak in an Array", "question__title_slug": "longest-square-streak-in-an-array", "question__hide": false, - "total_acs": 21505, - "total_submitted": 54315, + "total_acs": 21679, + "total_submitted": 54758, "frontend_question_id": 2501, "is_new_question": false }, @@ -7513,8 +7904,8 @@ "question__title": "Delete Greatest Value in Each Row", "question__title_slug": "delete-greatest-value-in-each-row", "question__hide": false, - "total_acs": 39393, - "total_submitted": 49781, + "total_acs": 40149, + "total_submitted": 50756, "frontend_question_id": 2500, "is_new_question": false }, @@ -7536,8 +7927,8 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 1528, - "total_submitted": 2190, + "total_acs": 1534, + "total_submitted": 2198, "frontend_question_id": 2445, "is_new_question": false }, @@ -7559,8 +7950,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": 5794, - "total_submitted": 15483, + "total_acs": 5873, + "total_submitted": 15675, "frontend_question_id": 2493, "is_new_question": false }, @@ -7582,8 +7973,8 @@ "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": 74884, - "total_submitted": 129693, + "total_acs": 75324, + "total_submitted": 130496, "frontend_question_id": 2492, "is_new_question": false }, @@ -7605,8 +7996,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": 26554, - "total_submitted": 45129, + "total_acs": 26815, + "total_submitted": 45535, "frontend_question_id": 2491, "is_new_question": false }, @@ -7628,8 +8019,8 @@ "question__title": "Circular Sentence", "question__title_slug": "circular-sentence", "question__hide": false, - "total_acs": 30928, - "total_submitted": 48884, + "total_acs": 31226, + "total_submitted": 49377, "frontend_question_id": 2490, "is_new_question": false }, @@ -7651,8 +8042,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": 1624, - "total_submitted": 2233, + "total_acs": 1645, + "total_submitted": 2264, "frontend_question_id": 2436, "is_new_question": false }, @@ -7674,8 +8065,8 @@ "question__title": "Count Palindromic Subsequences", "question__title_slug": "count-palindromic-subsequences", "question__hide": false, - "total_acs": 6182, - "total_submitted": 18006, + "total_acs": 6389, + "total_submitted": 18488, "frontend_question_id": 2484, "is_new_question": false }, @@ -7697,8 +8088,8 @@ "question__title": "Minimum Penalty for a Shop", "question__title_slug": "minimum-penalty-for-a-shop", "question__hide": false, - "total_acs": 15273, - "total_submitted": 27059, + "total_acs": 15570, + "total_submitted": 27473, "frontend_question_id": 2483, "is_new_question": false }, @@ -7720,8 +8111,8 @@ "question__title": "Minimum Cuts to Divide a Circle", "question__title_slug": "minimum-cuts-to-divide-a-circle", "question__hide": false, - "total_acs": 24165, - "total_submitted": 46380, + "total_acs": 24420, + "total_submitted": 46831, "frontend_question_id": 2481, "is_new_question": false }, @@ -7743,8 +8134,8 @@ "question__title": "Count Subarrays With Median K", "question__title_slug": "count-subarrays-with-median-k", "question__hide": false, - "total_acs": 9660, - "total_submitted": 22195, + "total_acs": 9784, + "total_submitted": 22482, "frontend_question_id": 2488, "is_new_question": false }, @@ -7766,8 +8157,8 @@ "question__title": "Remove Nodes From Linked List", "question__title_slug": "remove-nodes-from-linked-list", "question__hide": false, - "total_acs": 38370, - "total_submitted": 57709, + "total_acs": 39431, + "total_submitted": 59285, "frontend_question_id": 2487, "is_new_question": false }, @@ -7789,8 +8180,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": 25380, - "total_submitted": 39296, + "total_acs": 25717, + "total_submitted": 39771, "frontend_question_id": 2486, "is_new_question": false }, @@ -7812,8 +8203,8 @@ "question__title": "Find the Pivot Integer", "question__title_slug": "find-the-pivot-integer", "question__hide": false, - "total_acs": 44301, - "total_submitted": 55613, + "total_acs": 45020, + "total_submitted": 56479, "frontend_question_id": 2485, "is_new_question": false }, @@ -7835,8 +8226,8 @@ "question__title": "Maximize Total Tastiness of Purchased Fruits", "question__title_slug": "maximize-total-tastiness-of-purchased-fruits", "question__hide": false, - "total_acs": 1570, - "total_submitted": 2420, + "total_acs": 1595, + "total_submitted": 2458, "frontend_question_id": 2431, "is_new_question": false }, @@ -7858,8 +8249,8 @@ "question__title": "Number of Beautiful Partitions", "question__title_slug": "number-of-beautiful-partitions", "question__hide": false, - "total_acs": 8398, - "total_submitted": 27574, + "total_acs": 8482, + "total_submitted": 27884, "frontend_question_id": 2478, "is_new_question": false }, @@ -7881,8 +8272,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": 58213, - "total_submitted": 87728, + "total_acs": 58578, + "total_submitted": 88352, "frontend_question_id": 2477, "is_new_question": false }, @@ -7904,8 +8295,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": 16997, - "total_submitted": 41384, + "total_acs": 17164, + "total_submitted": 41762, "frontend_question_id": 2476, "is_new_question": false }, @@ -7927,8 +8318,8 @@ "question__title": "Number of Unequal Triplets in Array", "question__title_slug": "number-of-unequal-triplets-in-array", "question__hide": false, - "total_acs": 30843, - "total_submitted": 43798, + "total_acs": 31165, + "total_submitted": 44233, "frontend_question_id": 2475, "is_new_question": false }, @@ -7950,8 +8341,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": 2596, - "total_submitted": 3911, + "total_acs": 2726, + "total_submitted": 4101, "frontend_question_id": 2422, "is_new_question": false }, @@ -7973,8 +8364,8 @@ "question__title": "Most Profitable Path in a Tree", "question__title_slug": "most-profitable-path-in-a-tree", "question__hide": false, - "total_acs": 8553, - "total_submitted": 17746, + "total_acs": 8699, + "total_submitted": 18104, "frontend_question_id": 2467, "is_new_question": false }, @@ -7996,8 +8387,8 @@ "question__title": "Split Message Based on Limit", "question__title_slug": "split-message-based-on-limit", "question__hide": false, - "total_acs": 4408, - "total_submitted": 10042, + "total_acs": 4468, + "total_submitted": 10236, "frontend_question_id": 2468, "is_new_question": false }, @@ -8019,8 +8410,8 @@ "question__title": "Count Ways To Build Good Strings", "question__title_slug": "count-ways-to-build-good-strings", "question__hide": false, - "total_acs": 63319, - "total_submitted": 113201, + "total_acs": 63927, + "total_submitted": 114441, "frontend_question_id": 2466, "is_new_question": false }, @@ -8042,8 +8433,8 @@ "question__title": "Number of Distinct Averages", "question__title_slug": "number-of-distinct-averages", "question__hide": false, - "total_acs": 31946, - "total_submitted": 55129, + "total_acs": 32387, + "total_submitted": 55862, "frontend_question_id": 2465, "is_new_question": false }, @@ -8065,8 +8456,8 @@ "question__title": "Closest Fair Integer", "question__title_slug": "closest-fair-integer", "question__hide": false, - "total_acs": 814, - "total_submitted": 1826, + "total_acs": 821, + "total_submitted": 1856, "frontend_question_id": 2417, "is_new_question": false }, @@ -8088,8 +8479,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": 11127, - "total_submitted": 28783, + "total_acs": 11380, + "total_submitted": 29489, "frontend_question_id": 2472, "is_new_question": false }, @@ -8111,8 +8502,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": 17764, - "total_submitted": 28594, + "total_acs": 17940, + "total_submitted": 28867, "frontend_question_id": 2471, "is_new_question": false }, @@ -8134,8 +8525,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": 19908, - "total_submitted": 51786, + "total_acs": 20070, + "total_submitted": 52170, "frontend_question_id": 2470, "is_new_question": false }, @@ -8157,8 +8548,8 @@ "question__title": "Convert the Temperature", "question__title_slug": "convert-the-temperature", "question__hide": false, - "total_acs": 103533, - "total_submitted": 116524, + "total_acs": 105543, + "total_submitted": 118838, "frontend_question_id": 2469, "is_new_question": false }, @@ -8180,8 +8571,8 @@ "question__title": "Design SQL", "question__title_slug": "design-sql", "question__hide": false, - "total_acs": 2300, - "total_submitted": 2870, + "total_acs": 2378, + "total_submitted": 2963, "frontend_question_id": 2408, "is_new_question": false }, @@ -8203,8 +8594,8 @@ "question__title": "Minimum Total Distance Traveled", "question__title_slug": "minimum-total-distance-traveled", "question__hide": false, - "total_acs": 6869, - "total_submitted": 16945, + "total_acs": 6959, + "total_submitted": 17148, "frontend_question_id": 2463, "is_new_question": false }, @@ -8226,8 +8617,8 @@ "question__title": "Total Cost to Hire K Workers", "question__title_slug": "total-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 67267, - "total_submitted": 150019, + "total_acs": 68145, + "total_submitted": 152144, "frontend_question_id": 2462, "is_new_question": false }, @@ -8249,8 +8640,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": 30299, - "total_submitted": 89384, + "total_acs": 30927, + "total_submitted": 91321, "frontend_question_id": 2461, "is_new_question": false }, @@ -8272,8 +8663,8 @@ "question__title": "Apply Operations to an Array", "question__title_slug": "apply-operations-to-an-array", "question__hide": false, - "total_acs": 43096, - "total_submitted": 64294, + "total_acs": 43621, + "total_submitted": 65156, "frontend_question_id": 2460, "is_new_question": false }, @@ -8295,8 +8686,8 @@ "question__title": "Words Within Two Edits of Dictionary", "question__title_slug": "words-within-two-edits-of-dictionary", "question__hide": false, - "total_acs": 17632, - "total_submitted": 29246, + "total_acs": 17762, + "total_submitted": 29462, "frontend_question_id": 2452, "is_new_question": false }, @@ -8318,8 +8709,8 @@ "question__title": "Next Greater Element IV", "question__title_slug": "next-greater-element-iv", "question__hide": false, - "total_acs": 7467, - "total_submitted": 19318, + "total_acs": 7614, + "total_submitted": 19723, "frontend_question_id": 2454, "is_new_question": false }, @@ -8341,8 +8732,8 @@ "question__title": "Destroy Sequential Targets", "question__title_slug": "destroy-sequential-targets", "question__hide": false, - "total_acs": 14410, - "total_submitted": 37540, + "total_acs": 14507, + "total_submitted": 37758, "frontend_question_id": 2453, "is_new_question": false }, @@ -8364,8 +8755,8 @@ "question__title": "Odd String Difference", "question__title_slug": "odd-string-difference", "question__hide": false, - "total_acs": 23144, - "total_submitted": 39391, + "total_acs": 23315, + "total_submitted": 39710, "frontend_question_id": 2451, "is_new_question": false }, @@ -8387,8 +8778,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": 21409, - "total_submitted": 43705, + "total_acs": 21501, + "total_submitted": 43877, "frontend_question_id": 2447, "is_new_question": false }, @@ -8410,8 +8801,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": 12573, - "total_submitted": 33334, + "total_acs": 12988, + "total_submitted": 34417, "frontend_question_id": 2458, "is_new_question": false }, @@ -8433,8 +8824,8 @@ "question__title": "Minimum Addition to Make Integer Beautiful", "question__title_slug": "minimum-addition-to-make-integer-beautiful", "question__hide": false, - "total_acs": 16750, - "total_submitted": 45253, + "total_acs": 16879, + "total_submitted": 45560, "frontend_question_id": 2457, "is_new_question": false }, @@ -8456,8 +8847,8 @@ "question__title": "Most Popular Video Creator", "question__title_slug": "most-popular-video-creator", "question__hide": false, - "total_acs": 19060, - "total_submitted": 43817, + "total_acs": 19171, + "total_submitted": 44089, "frontend_question_id": 2456, "is_new_question": false }, @@ -8479,8 +8870,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": 41889, - "total_submitted": 70667, + "total_acs": 42320, + "total_submitted": 71284, "frontend_question_id": 2455, "is_new_question": false }, @@ -8502,8 +8893,8 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 30523, - "total_submitted": 65884, + "total_acs": 30652, + "total_submitted": 66108, "frontend_question_id": 2443, "is_new_question": false }, @@ -8525,8 +8916,8 @@ "question__title": "Color the Triangle Red", "question__title_slug": "color-the-triangle-red", "question__hide": false, - "total_acs": 247, - "total_submitted": 345, + "total_acs": 250, + "total_submitted": 351, "frontend_question_id": 2647, "is_new_question": false }, @@ -8548,8 +8939,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": 10347, - "total_submitted": 16492, + "total_acs": 10410, + "total_submitted": 16645, "frontend_question_id": 2449, "is_new_question": false }, @@ -8571,8 +8962,8 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 59422, - "total_submitted": 129351, + "total_acs": 59740, + "total_submitted": 130125, "frontend_question_id": 2448, "is_new_question": false }, @@ -8594,8 +8985,8 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 998, - "total_submitted": 1845, + "total_acs": 1011, + "total_submitted": 1859, "frontend_question_id": 2403, "is_new_question": false }, @@ -8617,8 +9008,8 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 33424, - "total_submitted": 66985, + "total_acs": 33698, + "total_submitted": 67537, "frontend_question_id": 2446, "is_new_question": false }, @@ -8640,8 +9031,8 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 2786, - "total_submitted": 3864, + "total_acs": 2821, + "total_submitted": 3915, "frontend_question_id": 2393, "is_new_question": false }, @@ -8663,8 +9054,8 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 2589, - "total_submitted": 6413, + "total_acs": 2618, + "total_submitted": 6507, "frontend_question_id": 2394, "is_new_question": false }, @@ -8686,8 +9077,8 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 16192, - "total_submitted": 27769, + "total_acs": 16305, + "total_submitted": 27979, "frontend_question_id": 2425, "is_new_question": false }, @@ -8709,8 +9100,8 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 30608, - "total_submitted": 175268, + "total_acs": 31010, + "total_submitted": 178509, "frontend_question_id": 2423, "is_new_question": false }, @@ -8732,8 +9123,8 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 4959, - "total_submitted": 9227, + "total_acs": 5135, + "total_submitted": 9510, "frontend_question_id": 2440, "is_new_question": false }, @@ -8755,8 +9146,8 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 71849, - "total_submitted": 152424, + "total_acs": 72394, + "total_submitted": 153757, "frontend_question_id": 2439, "is_new_question": false }, @@ -8778,8 +9169,8 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 14138, - "total_submitted": 36079, + "total_acs": 14200, + "total_submitted": 36210, "frontend_question_id": 2438, "is_new_question": false }, @@ -8801,8 +9192,8 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 20086, - "total_submitted": 46816, + "total_acs": 20193, + "total_submitted": 47029, "frontend_question_id": 2437, "is_new_question": false }, @@ -8824,8 +9215,8 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 58919, - "total_submitted": 95334, + "total_acs": 59271, + "total_submitted": 95958, "frontend_question_id": 2444, "is_new_question": false }, @@ -8847,8 +9238,8 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 9920, - "total_submitted": 45011, + "total_acs": 10038, + "total_submitted": 45680, "frontend_question_id": 2407, "is_new_question": false }, @@ -8870,8 +9261,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": 43427, - "total_submitted": 55308, + "total_acs": 43964, + "total_submitted": 55949, "frontend_question_id": 2442, "is_new_question": false }, @@ -8893,8 +9284,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": 45947, - "total_submitted": 68322, + "total_acs": 46464, + "total_submitted": 69009, "frontend_question_id": 2441, "is_new_question": false }, @@ -8916,8 +9307,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": 2596, - "total_submitted": 4733, + "total_acs": 2635, + "total_submitted": 4880, "frontend_question_id": 2388, "is_new_question": false }, @@ -8939,8 +9330,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": 1846, - "total_submitted": 2698, + "total_acs": 1890, + "total_submitted": 2763, "frontend_question_id": 2387, "is_new_question": false }, @@ -8962,8 +9353,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": 18267, - "total_submitted": 43344, + "total_acs": 18759, + "total_submitted": 44439, "frontend_question_id": 2435, "is_new_question": false }, @@ -8985,8 +9376,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": 15264, - "total_submitted": 39559, + "total_acs": 15339, + "total_submitted": 39759, "frontend_question_id": 2434, "is_new_question": false }, @@ -9008,8 +9399,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": 39229, - "total_submitted": 45902, + "total_acs": 39763, + "total_submitted": 46507, "frontend_question_id": 2433, "is_new_question": false }, @@ -9031,8 +9422,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": 29579, - "total_submitted": 60226, + "total_acs": 29730, + "total_submitted": 60491, "frontend_question_id": 2432, "is_new_question": false }, @@ -9054,8 +9445,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": 1062, - "total_submitted": 1797, + "total_acs": 1070, + "total_submitted": 1805, "frontend_question_id": 2378, "is_new_question": false }, @@ -9077,8 +9468,8 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 3981, - "total_submitted": 5096, + "total_acs": 4036, + "total_submitted": 5173, "frontend_question_id": 2377, "is_new_question": false }, @@ -9100,8 +9491,8 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 3422, - "total_submitted": 4133, + "total_acs": 3459, + "total_submitted": 4175, "frontend_question_id": 2372, "is_new_question": false }, @@ -9123,8 +9514,8 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 10426, - "total_submitted": 23932, + "total_acs": 10495, + "total_submitted": 24109, "frontend_question_id": 2426, "is_new_question": false }, @@ -9146,8 +9537,8 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 16791, - "total_submitted": 30860, + "total_acs": 16911, + "total_submitted": 31096, "frontend_question_id": 2424, "is_new_question": false }, @@ -9169,8 +9560,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": 17605, - "total_submitted": 37780, + "total_acs": 17748, + "total_submitted": 38085, "frontend_question_id": 2522, "is_new_question": false }, @@ -9192,8 +9583,8 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 11193, - "total_submitted": 34925, + "total_acs": 11265, + "total_submitted": 35118, "frontend_question_id": 2430, "is_new_question": false }, @@ -9215,8 +9606,8 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 19242, - "total_submitted": 44630, + "total_acs": 19329, + "total_submitted": 44802, "frontend_question_id": 2429, "is_new_question": false }, @@ -9238,8 +9629,8 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 31077, - "total_submitted": 41656, + "total_acs": 31330, + "total_submitted": 41993, "frontend_question_id": 2428, "is_new_question": false }, @@ -9261,8 +9652,8 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 58142, - "total_submitted": 73707, + "total_acs": 58945, + "total_submitted": 74729, "frontend_question_id": 2427, "is_new_question": false }, @@ -9284,8 +9675,8 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 1546, - "total_submitted": 2359, + "total_acs": 1612, + "total_submitted": 2451, "frontend_question_id": 2371, "is_new_question": false }, @@ -9307,8 +9698,8 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 50476, - "total_submitted": 88511, + "total_acs": 50635, + "total_submitted": 88829, "frontend_question_id": 2421, "is_new_question": false }, @@ -9330,8 +9721,8 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 19801, - "total_submitted": 52369, + "total_acs": 19907, + "total_submitted": 52590, "frontend_question_id": 2420, "is_new_question": false }, @@ -9353,8 +9744,8 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 23103, - "total_submitted": 47600, + "total_acs": 23215, + "total_submitted": 47812, "frontend_question_id": 2419, "is_new_question": false }, @@ -9376,8 +9767,8 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 89931, - "total_submitted": 112025, + "total_acs": 91352, + "total_submitted": 113824, "frontend_question_id": 2418, "is_new_question": false }, @@ -9399,8 +9790,8 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 2097, - "total_submitted": 2845, + "total_acs": 2118, + "total_submitted": 2872, "frontend_question_id": 2362, "is_new_question": false }, @@ -9422,8 +9813,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 7766, - "total_submitted": 9777, + "total_acs": 8093, + "total_submitted": 10207, "frontend_question_id": 2361, "is_new_question": false }, @@ -9445,8 +9836,8 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 9175, - "total_submitted": 23076, + "total_acs": 9221, + "total_submitted": 23202, "frontend_question_id": 2412, "is_new_question": false }, @@ -9468,8 +9859,8 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 10552, - "total_submitted": 24851, + "total_acs": 10593, + "total_submitted": 24946, "frontend_question_id": 2411, "is_new_question": false }, @@ -9491,8 +9882,8 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 26803, - "total_submitted": 43540, + "total_acs": 27062, + "total_submitted": 43955, "frontend_question_id": 2410, "is_new_question": false }, @@ -9514,8 +9905,8 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 18745, - "total_submitted": 42390, + "total_acs": 18847, + "total_submitted": 42598, "frontend_question_id": 2409, "is_new_question": false }, @@ -9537,8 +9928,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": 32765, - "total_submitted": 37397, + "total_acs": 37127, + "total_submitted": 42395, "frontend_question_id": 2356, "is_new_question": false }, @@ -9560,8 +9951,8 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 21579, - "total_submitted": 48746, + "total_acs": 21684, + "total_submitted": 48968, "frontend_question_id": 2416, "is_new_question": false }, @@ -9583,8 +9974,8 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 38357, - "total_submitted": 49657, + "total_acs": 38749, + "total_submitted": 50151, "frontend_question_id": 2415, "is_new_question": false }, @@ -9606,8 +9997,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": 37365, - "total_submitted": 65593, + "total_acs": 37708, + "total_submitted": 66101, "frontend_question_id": 2414, "is_new_question": false }, @@ -9629,8 +10020,8 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 104780, - "total_submitted": 119878, + "total_acs": 106397, + "total_submitted": 121721, "frontend_question_id": 2413, "is_new_question": false }, @@ -9652,8 +10043,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": 5062, - "total_submitted": 11899, + "total_acs": 5144, + "total_submitted": 12202, "frontend_question_id": 2355, "is_new_question": false }, @@ -9675,8 +10066,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": 847, - "total_submitted": 1794, + "total_acs": 905, + "total_submitted": 1910, "frontend_question_id": 2459, "is_new_question": false }, @@ -9698,8 +10089,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": 22731, - "total_submitted": 49109, + "total_acs": 22860, + "total_submitted": 49337, "frontend_question_id": 2406, "is_new_question": false }, @@ -9721,8 +10112,8 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 130852, - "total_submitted": 165206, + "total_acs": 132952, + "total_submitted": 167961, "frontend_question_id": 2405, "is_new_question": false }, @@ -9744,8 +10135,8 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 56178, - "total_submitted": 111408, + "total_acs": 56834, + "total_submitted": 112765, "frontend_question_id": 2404, "is_new_question": false }, @@ -9767,8 +10158,8 @@ "question__title": "Finding the Number of Visible Mountains", "question__title_slug": "finding-the-number-of-visible-mountains", "question__hide": false, - "total_acs": 5054, - "total_submitted": 12892, + "total_acs": 5169, + "total_submitted": 13238, "frontend_question_id": 2345, "is_new_question": false }, @@ -9790,8 +10181,8 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 2995, - "total_submitted": 9156, + "total_acs": 3016, + "total_submitted": 9228, "frontend_question_id": 2346, "is_new_question": false }, @@ -9813,8 +10204,8 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 19470, - "total_submitted": 41419, + "total_acs": 19663, + "total_submitted": 41767, "frontend_question_id": 2365, "is_new_question": false }, @@ -9836,8 +10227,8 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 12894, - "total_submitted": 23946, + "total_acs": 12949, + "total_submitted": 24050, "frontend_question_id": 2397, "is_new_question": false }, @@ -9859,8 +10250,8 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 59902, - "total_submitted": 68540, + "total_acs": 60757, + "total_submitted": 69520, "frontend_question_id": 2396, "is_new_question": false }, @@ -9882,8 +10273,8 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 39104, - "total_submitted": 60646, + "total_acs": 39517, + "total_submitted": 61219, "frontend_question_id": 2395, "is_new_question": false }, @@ -9905,8 +10296,8 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 23204, - "total_submitted": 69612, + "total_acs": 23762, + "total_submitted": 71407, "frontend_question_id": 2402, "is_new_question": false }, @@ -9928,8 +10319,8 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 23593, - "total_submitted": 47401, + "total_acs": 23832, + "total_submitted": 47854, "frontend_question_id": 2401, "is_new_question": false }, @@ -9951,8 +10342,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": 23318, - "total_submitted": 69839, + "total_acs": 23506, + "total_submitted": 70367, "frontend_question_id": 2400, "is_new_question": false }, @@ -9974,8 +10365,8 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 38846, - "total_submitted": 55438, + "total_acs": 39184, + "total_submitted": 55902, "frontend_question_id": 2399, "is_new_question": false }, @@ -9997,8 +10388,8 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 22418, - "total_submitted": 70741, + "total_acs": 22605, + "total_submitted": 71269, "frontend_question_id": 2384, "is_new_question": false }, @@ -10020,8 +10411,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": 8914, - "total_submitted": 12105, + "total_acs": 9199, + "total_submitted": 12497, "frontend_question_id": 2340, "is_new_question": false }, @@ -10043,8 +10434,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": 35635, - "total_submitted": 66691, + "total_acs": 35954, + "total_submitted": 67228, "frontend_question_id": 2342, "is_new_question": false }, @@ -10066,8 +10457,8 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 12439, - "total_submitted": 20586, + "total_acs": 12525, + "total_submitted": 20716, "frontend_question_id": 2392, "is_new_question": false }, @@ -10089,8 +10480,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": 38499, - "total_submitted": 46260, + "total_acs": 38897, + "total_submitted": 46771, "frontend_question_id": 2391, "is_new_question": false }, @@ -10112,8 +10503,8 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 158133, - "total_submitted": 216677, + "total_acs": 162488, + "total_submitted": 222504, "frontend_question_id": 2390, "is_new_question": false }, @@ -10135,8 +10526,8 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 88542, - "total_submitted": 123151, + "total_acs": 89254, + "total_submitted": 124196, "frontend_question_id": 2389, "is_new_question": false }, @@ -10158,8 +10549,8 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 4240, - "total_submitted": 5558, + "total_acs": 4383, + "total_submitted": 5738, "frontend_question_id": 2330, "is_new_question": false }, @@ -10181,8 +10572,8 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 7250, - "total_submitted": 14893, + "total_acs": 7310, + "total_submitted": 15025, "frontend_question_id": 2382, "is_new_question": false }, @@ -10204,8 +10595,8 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 16552, - "total_submitted": 46213, + "total_acs": 16714, + "total_submitted": 46632, "frontend_question_id": 2381, "is_new_question": false }, @@ -10227,8 +10618,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": 24829, - "total_submitted": 50264, + "total_acs": 25087, + "total_submitted": 50877, "frontend_question_id": 2380, "is_new_question": false }, @@ -10250,8 +10641,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": 38625, - "total_submitted": 66499, + "total_acs": 39343, + "total_submitted": 67597, "frontend_question_id": 2379, "is_new_question": false }, @@ -10273,8 +10664,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": 7573, - "total_submitted": 19806, + "total_acs": 7616, + "total_submitted": 19898, "frontend_question_id": 2386, "is_new_question": false }, @@ -10296,8 +10687,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": 30299, - "total_submitted": 52208, + "total_acs": 30972, + "total_submitted": 53200, "frontend_question_id": 2385, "is_new_question": false }, @@ -10319,8 +10710,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": 27361, - "total_submitted": 67149, + "total_acs": 27525, + "total_submitted": 67515, "frontend_question_id": 2383, "is_new_question": false }, @@ -10342,8 +10733,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": 2771, - "total_submitted": 3952, + "total_acs": 2901, + "total_submitted": 4169, "frontend_question_id": 2323, "is_new_question": false }, @@ -10365,8 +10756,8 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 9715, - "total_submitted": 26112, + "total_acs": 9857, + "total_submitted": 26367, "frontend_question_id": 2376, "is_new_question": false }, @@ -10388,8 +10779,8 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 24922, - "total_submitted": 33264, + "total_acs": 25184, + "total_submitted": 33594, "frontend_question_id": 2375, "is_new_question": false }, @@ -10411,8 +10802,8 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 28009, - "total_submitted": 60091, + "total_acs": 28271, + "total_submitted": 60628, "frontend_question_id": 2374, "is_new_question": false }, @@ -10434,8 +10825,8 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 40521, - "total_submitted": 48880, + "total_acs": 40994, + "total_submitted": 49440, "frontend_question_id": 2373, "is_new_question": false }, @@ -10457,8 +10848,8 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 5259, - "total_submitted": 6026, + "total_acs": 5366, + "total_submitted": 6142, "frontend_question_id": 2339, "is_new_question": false }, @@ -10480,8 +10871,8 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 4839, - "total_submitted": 7050, + "total_acs": 4895, + "total_submitted": 7128, "frontend_question_id": 2329, "is_new_question": false }, @@ -10503,8 +10894,8 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 4594, - "total_submitted": 6145, + "total_acs": 4653, + "total_submitted": 6271, "frontend_question_id": 2324, "is_new_question": false }, @@ -10526,8 +10917,8 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 10706, - "total_submitted": 25989, + "total_acs": 10806, + "total_submitted": 26231, "frontend_question_id": 2366, "is_new_question": false }, @@ -10549,8 +10940,8 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 16811, - "total_submitted": 50456, + "total_acs": 17083, + "total_submitted": 51179, "frontend_question_id": 2398, "is_new_question": false }, @@ -10572,8 +10963,8 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 25172, - "total_submitted": 61296, + "total_acs": 25407, + "total_submitted": 61854, "frontend_question_id": 2364, "is_new_question": false }, @@ -10595,8 +10986,8 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 41643, - "total_submitted": 55228, + "total_acs": 42124, + "total_submitted": 55841, "frontend_question_id": 2363, "is_new_question": false }, @@ -10618,8 +11009,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": 3671, - "total_submitted": 5131, + "total_acs": 3708, + "total_submitted": 5179, "frontend_question_id": 2314, "is_new_question": false }, @@ -10641,8 +11032,8 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 37495, - "total_submitted": 64410, + "total_acs": 38068, + "total_submitted": 65328, "frontend_question_id": 2368, "is_new_question": false }, @@ -10664,8 +11055,8 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 20533, - "total_submitted": 54704, + "total_acs": 20933, + "total_submitted": 55826, "frontend_question_id": 2370, "is_new_question": false }, @@ -10687,8 +11078,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": 20283, - "total_submitted": 50403, + "total_acs": 75271, + "total_submitted": 144837, "frontend_question_id": 2369, "is_new_question": false }, @@ -10710,8 +11101,8 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 84887, - "total_submitted": 101858, + "total_acs": 86415, + "total_submitted": 103695, "frontend_question_id": 2367, "is_new_question": false }, @@ -10733,8 +11124,8 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 4037, - "total_submitted": 5867, + "total_acs": 4066, + "total_submitted": 5902, "frontend_question_id": 2308, "is_new_question": false }, @@ -10756,8 +11147,8 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 4242, - "total_submitted": 5169, + "total_acs": 4271, + "total_submitted": 5206, "frontend_question_id": 2298, "is_new_question": false }, @@ -10779,8 +11170,8 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 65639, - "total_submitted": 130319, + "total_acs": 66114, + "total_submitted": 131322, "frontend_question_id": 2360, "is_new_question": false }, @@ -10802,8 +11193,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": 69950, - "total_submitted": 152653, + "total_acs": 70254, + "total_submitted": 153414, "frontend_question_id": 2359, "is_new_question": false }, @@ -10825,8 +11216,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": 31793, - "total_submitted": 47014, + "total_acs": 32024, + "total_submitted": 47326, "frontend_question_id": 2358, "is_new_question": false }, @@ -10848,8 +11239,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": 75317, - "total_submitted": 104716, + "total_acs": 76188, + "total_submitted": 105913, "frontend_question_id": 2357, "is_new_question": false }, @@ -10871,8 +11262,8 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 12736, - "total_submitted": 18715, + "total_acs": 12820, + "total_submitted": 18835, "frontend_question_id": 2350, "is_new_question": false }, @@ -10894,8 +11285,8 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 19737, - "total_submitted": 43624, + "total_acs": 19798, + "total_submitted": 43787, "frontend_question_id": 2349, "is_new_question": false }, @@ -10917,8 +11308,8 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 34536, - "total_submitted": 57234, + "total_acs": 34722, + "total_submitted": 57490, "frontend_question_id": 2347, "is_new_question": false }, @@ -10940,8 +11331,8 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 110974, - "total_submitted": 166340, + "total_acs": 111443, + "total_submitted": 167070, "frontend_question_id": 2348, "is_new_question": false }, @@ -10963,8 +11354,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": 4659, - "total_submitted": 12217, + "total_acs": 4696, + "total_submitted": 12305, "frontend_question_id": 2292, "is_new_question": false }, @@ -10986,8 +11377,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 12726, - "total_submitted": 27576, + "total_acs": 12784, + "total_submitted": 27709, "frontend_question_id": 2354, "is_new_question": false }, @@ -11009,8 +11400,8 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 17584, - "total_submitted": 51172, + "total_acs": 17687, + "total_submitted": 51397, "frontend_question_id": 2353, "is_new_question": false }, @@ -11032,8 +11423,8 @@ "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 126343, - "total_submitted": 170844, + "total_acs": 128912, + "total_submitted": 174763, "frontend_question_id": 2352, "is_new_question": false }, @@ -11055,8 +11446,8 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 81241, - "total_submitted": 109974, + "total_acs": 82195, + "total_submitted": 111220, "frontend_question_id": 2351, "is_new_question": false }, @@ -11078,8 +11469,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 4178, - "total_submitted": 9249, + "total_acs": 4213, + "total_submitted": 9322, "frontend_question_id": 2291, "is_new_question": false }, @@ -11101,8 +11492,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": 1337, - "total_submitted": 2752, + "total_acs": 1346, + "total_submitted": 2771, "frontend_question_id": 2282, "is_new_question": false }, @@ -11124,8 +11515,8 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 24703, - "total_submitted": 43906, + "total_acs": 24814, + "total_submitted": 44072, "frontend_question_id": 2344, "is_new_question": false }, @@ -11147,8 +11538,8 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 22413, - "total_submitted": 53864, + "total_acs": 22616, + "total_submitted": 54180, "frontend_question_id": 2343, "is_new_question": false }, @@ -11170,8 +11561,8 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 53435, - "total_submitted": 70800, + "total_acs": 53968, + "total_submitted": 71549, "frontend_question_id": 2341, "is_new_question": false }, @@ -11193,8 +11584,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 3177, - "total_submitted": 5047, + "total_acs": 3229, + "total_submitted": 5127, "frontend_question_id": 2277, "is_new_question": false }, @@ -11216,8 +11607,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": 6800, - "total_submitted": 16255, + "total_acs": 6849, + "total_submitted": 16348, "frontend_question_id": 2334, "is_new_question": false }, @@ -11239,8 +11630,8 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 12111, - "total_submitted": 47658, + "total_acs": 12176, + "total_submitted": 48028, "frontend_question_id": 2333, "is_new_question": false }, @@ -11262,8 +11653,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": 17854, - "total_submitted": 71155, + "total_acs": 18177, + "total_submitted": 72102, "frontend_question_id": 2332, "is_new_question": false }, @@ -11285,8 +11676,8 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 52990, - "total_submitted": 67930, + "total_acs": 53644, + "total_submitted": 68752, "frontend_question_id": 2331, "is_new_question": false }, @@ -11308,8 +11699,8 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 5268, - "total_submitted": 20014, + "total_acs": 5319, + "total_submitted": 20168, "frontend_question_id": 2338, "is_new_question": false }, @@ -11331,8 +11722,8 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 22607, - "total_submitted": 47427, + "total_acs": 22714, + "total_submitted": 47626, "frontend_question_id": 2337, "is_new_question": false }, @@ -11354,8 +11745,8 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 95129, - "total_submitted": 128333, + "total_acs": 96429, + "total_submitted": 130300, "frontend_question_id": 2336, "is_new_question": false }, @@ -11377,8 +11768,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": 38979, - "total_submitted": 68687, + "total_acs": 39278, + "total_submitted": 69112, "frontend_question_id": 2335, "is_new_question": false }, @@ -11400,8 +11791,8 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 31468, - "total_submitted": 41959, + "total_acs": 31803, + "total_submitted": 42419, "frontend_question_id": 2326, "is_new_question": false }, @@ -11423,8 +11814,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": 60439, - "total_submitted": 101442, + "total_acs": 60757, + "total_submitted": 102108, "frontend_question_id": 2328, "is_new_question": false }, @@ -11446,8 +11837,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": 18603, - "total_submitted": 41412, + "total_acs": 18679, + "total_submitted": 41608, "frontend_question_id": 2327, "is_new_question": false }, @@ -11469,8 +11860,8 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 66043, - "total_submitted": 78959, + "total_acs": 67030, + "total_submitted": 80121, "frontend_question_id": 2325, "is_new_question": false }, @@ -11492,8 +11883,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 12929, - "total_submitted": 17956, + "total_acs": 13101, + "total_submitted": 18200, "frontend_question_id": 2268, "is_new_question": false }, @@ -11515,8 +11906,8 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 9215, - "total_submitted": 16342, + "total_acs": 9264, + "total_submitted": 16429, "frontend_question_id": 2318, "is_new_question": false }, @@ -11538,8 +11929,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": 75178, - "total_submitted": 149601, + "total_acs": 75482, + "total_submitted": 150344, "frontend_question_id": 2316, "is_new_question": false }, @@ -11561,8 +11952,8 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 19602, - "total_submitted": 24690, + "total_acs": 19748, + "total_submitted": 24866, "frontend_question_id": 2317, "is_new_question": false }, @@ -11584,8 +11975,8 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 51224, - "total_submitted": 62732, + "total_acs": 51871, + "total_submitted": 63476, "frontend_question_id": 2315, "is_new_question": false }, @@ -11607,8 +11998,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": 5918, - "total_submitted": 11679, + "total_acs": 5959, + "total_submitted": 11754, "frontend_question_id": 2322, "is_new_question": false }, @@ -11630,8 +12021,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": 1662, - "total_submitted": 2768, + "total_acs": 1727, + "total_submitted": 2889, "frontend_question_id": 2313, "is_new_question": false }, @@ -11653,8 +12044,8 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 42657, - "total_submitted": 64863, + "total_acs": 42950, + "total_submitted": 65314, "frontend_question_id": 2319, "is_new_question": false }, @@ -11676,8 +12067,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": 23427, - "total_submitted": 57194, + "total_acs": 23529, + "total_submitted": 57443, "frontend_question_id": 2320, "is_new_question": false }, @@ -11699,8 +12090,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 2001, - "total_submitted": 3109, + "total_acs": 2042, + "total_submitted": 3181, "frontend_question_id": 2254, "is_new_question": false }, @@ -11722,8 +12113,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": 19614, - "total_submitted": 52661, + "total_acs": 19724, + "total_submitted": 52904, "frontend_question_id": 2311, "is_new_question": false }, @@ -11745,8 +12136,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": 18904, - "total_submitted": 35507, + "total_acs": 19123, + "total_submitted": 35875, "frontend_question_id": 2302, "is_new_question": false }, @@ -11768,8 +12159,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 12053, - "total_submitted": 30482, + "total_acs": 12105, + "total_submitted": 30616, "frontend_question_id": 2301, "is_new_question": false }, @@ -11791,8 +12182,8 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 99576, - "total_submitted": 239761, + "total_acs": 101155, + "total_submitted": 243297, "frontend_question_id": 2300, "is_new_question": false }, @@ -11814,8 +12205,8 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 33433, - "total_submitted": 60304, + "total_acs": 33806, + "total_submitted": 61018, "frontend_question_id": 2299, "is_new_question": false }, @@ -11837,8 +12228,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 56866, - "total_submitted": 121219, + "total_acs": 57023, + "total_submitted": 121599, "frontend_question_id": 2306, "is_new_question": false }, @@ -11860,8 +12251,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 17935, - "total_submitted": 42854, + "total_acs": 18141, + "total_submitted": 43184, "frontend_question_id": 2296, "is_new_question": false }, @@ -11883,8 +12274,8 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 30093, - "total_submitted": 52263, + "total_acs": 30312, + "total_submitted": 52641, "frontend_question_id": 2295, "is_new_question": false }, @@ -11906,8 +12297,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": 34134, - "total_submitted": 46845, + "total_acs": 34362, + "total_submitted": 47123, "frontend_question_id": 2294, "is_new_question": false }, @@ -11929,8 +12320,8 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 39441, - "total_submitted": 62444, + "total_acs": 39792, + "total_submitted": 62950, "frontend_question_id": 2293, "is_new_question": false }, @@ -11952,8 +12343,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": 2272, - "total_submitted": 3540, + "total_acs": 2317, + "total_submitted": 3601, "frontend_question_id": 2237, "is_new_question": false }, @@ -11975,8 +12366,8 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 151817, - "total_submitted": 181414, + "total_acs": 154287, + "total_submitted": 184433, "frontend_question_id": 2236, "is_new_question": false }, @@ -11998,8 +12389,8 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 333380, - "total_submitted": 380550, + "total_acs": 339431, + "total_submitted": 387987, "frontend_question_id": 2235, "is_new_question": false }, @@ -12021,8 +12412,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 599, - "total_submitted": 922, + "total_acs": 603, + "total_submitted": 927, "frontend_question_id": 2253, "is_new_question": false }, @@ -12044,8 +12435,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 1001, - "total_submitted": 1851, + "total_acs": 1021, + "total_submitted": 1887, "frontend_question_id": 2252, "is_new_question": false }, @@ -12067,8 +12458,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 5112, - "total_submitted": 32451, + "total_acs": 5134, + "total_submitted": 32615, "frontend_question_id": 2286, "is_new_question": false }, @@ -12090,8 +12481,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 27640, - "total_submitted": 45497, + "total_acs": 27973, + "total_submitted": 46004, "frontend_question_id": 2285, "is_new_question": false }, @@ -12113,8 +12504,8 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 28443, - "total_submitted": 50553, + "total_acs": 28634, + "total_submitted": 50835, "frontend_question_id": 2284, "is_new_question": false }, @@ -12136,8 +12527,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": 43933, - "total_submitted": 60459, + "total_acs": 44365, + "total_submitted": 61043, "frontend_question_id": 2283, "is_new_question": false }, @@ -12159,8 +12550,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": 5361, - "total_submitted": 7582, + "total_acs": 5423, + "total_submitted": 7676, "frontend_question_id": 2238, "is_new_question": false }, @@ -12182,8 +12573,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 18152, - "total_submitted": 35743, + "total_acs": 18374, + "total_submitted": 36064, "frontend_question_id": 2290, "is_new_question": false }, @@ -12205,8 +12596,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 16211, - "total_submitted": 77356, + "total_acs": 16408, + "total_submitted": 78304, "frontend_question_id": 2289, "is_new_question": false }, @@ -12228,8 +12619,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 18405, - "total_submitted": 64937, + "total_acs": 18503, + "total_submitted": 65143, "frontend_question_id": 2288, "is_new_question": false }, @@ -12251,8 +12642,8 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 33187, - "total_submitted": 57335, + "total_acs": 33463, + "total_submitted": 57761, "frontend_question_id": 2287, "is_new_question": false }, @@ -12274,8 +12665,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": 4033, - "total_submitted": 8120, + "total_acs": 4063, + "total_submitted": 8177, "frontend_question_id": 2230, "is_new_question": false }, @@ -12297,8 +12688,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": 5630, - "total_submitted": 12898, + "total_acs": 5671, + "total_submitted": 13017, "frontend_question_id": 2228, "is_new_question": false }, @@ -12320,8 +12711,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 3170, - "total_submitted": 5142, + "total_acs": 3212, + "total_submitted": 5197, "frontend_question_id": 2219, "is_new_question": false }, @@ -12343,8 +12734,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 15363, - "total_submitted": 55958, + "total_acs": 15479, + "total_submitted": 56325, "frontend_question_id": 2281, "is_new_question": false }, @@ -12366,8 +12757,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": 23515, - "total_submitted": 95037, + "total_acs": 23612, + "total_submitted": 95418, "frontend_question_id": 2280, "is_new_question": false }, @@ -12389,8 +12780,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": 87669, - "total_submitted": 129615, + "total_acs": 87860, + "total_submitted": 129899, "frontend_question_id": 2279, "is_new_question": false }, @@ -12412,8 +12803,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 54918, - "total_submitted": 74231, + "total_acs": 55432, + "total_submitted": 74906, "frontend_question_id": 2278, "is_new_question": false }, @@ -12435,8 +12826,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 67953, - "total_submitted": 122973, + "total_acs": 68113, + "total_submitted": 123327, "frontend_question_id": 2246, "is_new_question": false }, @@ -12458,8 +12849,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": 7280, - "total_submitted": 20525, + "total_acs": 7306, + "total_submitted": 20558, "frontend_question_id": 2245, "is_new_question": false }, @@ -12481,8 +12872,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 138962, - "total_submitted": 221237, + "total_acs": 139282, + "total_submitted": 221768, "frontend_question_id": 2244, "is_new_question": false }, @@ -12504,8 +12895,8 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 32104, - "total_submitted": 48902, + "total_acs": 32300, + "total_submitted": 49198, "frontend_question_id": 2243, "is_new_question": false }, @@ -12527,8 +12918,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 62656, - "total_submitted": 132938, + "total_acs": 62895, + "total_submitted": 133689, "frontend_question_id": 2272, "is_new_question": false }, @@ -12550,8 +12941,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": 14374, - "total_submitted": 43322, + "total_acs": 14430, + "total_submitted": 43479, "frontend_question_id": 2271, "is_new_question": false }, @@ -12573,8 +12964,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 29573, - "total_submitted": 64044, + "total_acs": 29891, + "total_submitted": 64676, "frontend_question_id": 2270, "is_new_question": false }, @@ -12596,8 +12987,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 14071, - "total_submitted": 40517, + "total_acs": 14149, + "total_submitted": 40739, "frontend_question_id": 2276, "is_new_question": false }, @@ -12619,8 +13010,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": 22252, - "total_submitted": 30686, + "total_acs": 22441, + "total_submitted": 30927, "frontend_question_id": 2275, "is_new_question": false }, @@ -12642,8 +13033,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 27459, - "total_submitted": 52847, + "total_acs": 27619, + "total_submitted": 53144, "frontend_question_id": 2274, "is_new_question": false }, @@ -12665,8 +13056,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 28534, - "total_submitted": 49342, + "total_acs": 28608, + "total_submitted": 49461, "frontend_question_id": 2214, "is_new_question": false }, @@ -12688,8 +13079,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 10268, - "total_submitted": 27105, + "total_acs": 10323, + "total_submitted": 27222, "frontend_question_id": 2242, "is_new_question": false }, @@ -12711,8 +13102,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 15031, - "total_submitted": 38420, + "total_acs": 15194, + "total_submitted": 38842, "frontend_question_id": 2241, "is_new_question": false }, @@ -12734,8 +13125,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": 22329, - "total_submitted": 39302, + "total_acs": 22467, + "total_submitted": 39562, "frontend_question_id": 2240, "is_new_question": false }, @@ -12757,8 +13148,8 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 43519, - "total_submitted": 97385, + "total_acs": 43892, + "total_submitted": 98318, "frontend_question_id": 2239, "is_new_question": false }, @@ -12780,8 +13171,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": 13367, - "total_submitted": 35157, + "total_acs": 13438, + "total_submitted": 35366, "frontend_question_id": 2267, "is_new_question": false }, @@ -12803,8 +13194,8 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 16717, - "total_submitted": 35447, + "total_acs": 16821, + "total_submitted": 35680, "frontend_question_id": 2266, "is_new_question": false }, @@ -12826,8 +13217,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": 43777, - "total_submitted": 51562, + "total_acs": 44288, + "total_submitted": 52180, "frontend_question_id": 2265, "is_new_question": false }, @@ -12849,8 +13240,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": 34859, - "total_submitted": 58144, + "total_acs": 35139, + "total_submitted": 58579, "frontend_question_id": 2264, "is_new_question": false }, @@ -12872,8 +13263,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": 34678, - "total_submitted": 53552, + "total_acs": 34893, + "total_submitted": 53860, "frontend_question_id": 2224, "is_new_question": false }, @@ -12895,8 +13286,8 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 7956, - "total_submitted": 23047, + "total_acs": 8056, + "total_submitted": 23391, "frontend_question_id": 2258, "is_new_question": false }, @@ -12918,8 +13309,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 14151, - "total_submitted": 27262, + "total_acs": 14203, + "total_submitted": 27373, "frontend_question_id": 2257, "is_new_question": false }, @@ -12941,8 +13332,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 77685, - "total_submitted": 180554, + "total_acs": 77918, + "total_submitted": 181103, "frontend_question_id": 2256, "is_new_question": false }, @@ -12964,8 +13355,8 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 46111, - "total_submitted": 63603, + "total_acs": 46575, + "total_submitted": 64224, "frontend_question_id": 2255, "is_new_question": false }, @@ -12987,8 +13378,8 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 25129, - "total_submitted": 45133, + "total_acs": 25567, + "total_submitted": 45895, "frontend_question_id": 2262, "is_new_question": false }, @@ -13010,8 +13401,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 23536, - "total_submitted": 48234, + "total_acs": 23758, + "total_submitted": 48724, "frontend_question_id": 2261, "is_new_question": false }, @@ -13033,8 +13424,8 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 49083, - "total_submitted": 96696, + "total_acs": 49763, + "total_submitted": 98100, "frontend_question_id": 2260, "is_new_question": false }, @@ -13056,8 +13447,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": 58601, - "total_submitted": 129307, + "total_acs": 59341, + "total_submitted": 131000, "frontend_question_id": 2259, "is_new_question": false }, @@ -13079,8 +13470,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": 4730, - "total_submitted": 9381, + "total_acs": 4770, + "total_submitted": 9455, "frontend_question_id": 2205, "is_new_question": false }, @@ -13102,8 +13493,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 1977, - "total_submitted": 4045, + "total_acs": 2009, + "total_submitted": 4116, "frontend_question_id": 2199, "is_new_question": false }, @@ -13125,8 +13516,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 14273, - "total_submitted": 28010, + "total_acs": 14469, + "total_submitted": 28383, "frontend_question_id": 2251, "is_new_question": false }, @@ -13148,8 +13539,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": 13012, - "total_submitted": 38143, + "total_acs": 13107, + "total_submitted": 38396, "frontend_question_id": 2250, "is_new_question": false }, @@ -13171,8 +13562,8 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 19970, - "total_submitted": 39231, + "total_acs": 20117, + "total_submitted": 39471, "frontend_question_id": 2249, "is_new_question": false }, @@ -13194,8 +13585,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 56768, - "total_submitted": 83186, + "total_acs": 57351, + "total_submitted": 84057, "frontend_question_id": 2248, "is_new_question": false }, @@ -13217,8 +13608,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 5968, - "total_submitted": 20782, + "total_acs": 6020, + "total_submitted": 20963, "frontend_question_id": 2234, "is_new_question": false }, @@ -13240,8 +13631,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 24920, - "total_submitted": 60542, + "total_acs": 25087, + "total_submitted": 60953, "frontend_question_id": 2233, "is_new_question": false }, @@ -13263,8 +13654,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": 16289, - "total_submitted": 24696, + "total_acs": 16374, + "total_submitted": 24802, "frontend_question_id": 2232, "is_new_question": false }, @@ -13286,8 +13677,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": 34756, - "total_submitted": 57274, + "total_acs": 34980, + "total_submitted": 57578, "frontend_question_id": 2231, "is_new_question": false }, @@ -13309,8 +13700,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 6029, - "total_submitted": 16097, + "total_acs": 6155, + "total_submitted": 16435, "frontend_question_id": 2223, "is_new_question": false }, @@ -13332,8 +13723,8 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 28568, - "total_submitted": 56374, + "total_acs": 28811, + "total_submitted": 56858, "frontend_question_id": 2222, "is_new_question": false }, @@ -13355,8 +13746,8 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 59866, - "total_submitted": 76555, + "total_acs": 60390, + "total_submitted": 77218, "frontend_question_id": 2221, "is_new_question": false }, @@ -13378,8 +13769,8 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 49934, - "total_submitted": 60556, + "total_acs": 50980, + "total_submitted": 61752, "frontend_question_id": 2220, "is_new_question": false }, @@ -13401,8 +13792,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": 5635, - "total_submitted": 11204, + "total_acs": 5649, + "total_submitted": 11266, "frontend_question_id": 2184, "is_new_question": false }, @@ -13424,8 +13815,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": 9885, - "total_submitted": 27297, + "total_acs": 9979, + "total_submitted": 27575, "frontend_question_id": 2203, "is_new_question": false }, @@ -13447,8 +13838,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": 33372, - "total_submitted": 51451, + "total_acs": 33632, + "total_submitted": 51806, "frontend_question_id": 2200, "is_new_question": false }, @@ -13470,8 +13861,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 3831, - "total_submitted": 12108, + "total_acs": 3862, + "total_submitted": 12174, "frontend_question_id": 2213, "is_new_question": false }, @@ -13493,8 +13884,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 13476, - "total_submitted": 27200, + "total_acs": 13561, + "total_submitted": 27347, "frontend_question_id": 2212, "is_new_question": false }, @@ -13516,8 +13907,8 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 22296, - "total_submitted": 51926, + "total_acs": 22425, + "total_submitted": 52245, "frontend_question_id": 2211, "is_new_question": false }, @@ -13539,8 +13930,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": 34138, - "total_submitted": 58283, + "total_acs": 34377, + "total_submitted": 58694, "frontend_question_id": 2210, "is_new_question": false }, @@ -13562,8 +13953,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 4644, - "total_submitted": 7455, + "total_acs": 4678, + "total_submitted": 7506, "frontend_question_id": 2175, "is_new_question": false }, @@ -13585,8 +13976,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": 4298, - "total_submitted": 6310, + "total_acs": 4308, + "total_submitted": 6327, "frontend_question_id": 2174, "is_new_question": false }, @@ -13608,8 +13999,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 3047, - "total_submitted": 5785, + "total_acs": 3073, + "total_submitted": 5885, "frontend_question_id": 2173, "is_new_question": false }, @@ -13631,8 +14022,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": 29186, - "total_submitted": 49289, + "total_acs": 29419, + "total_submitted": 49659, "frontend_question_id": 2190, "is_new_question": false }, @@ -13654,8 +14045,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": 10400, - "total_submitted": 29900, + "total_acs": 10457, + "total_submitted": 30040, "frontend_question_id": 2209, "is_new_question": false }, @@ -13677,8 +14068,8 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 22906, - "total_submitted": 50033, + "total_acs": 23163, + "total_submitted": 50594, "frontend_question_id": 2208, "is_new_question": false }, @@ -13700,8 +14091,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": 16566, - "total_submitted": 49077, + "total_acs": 16647, + "total_submitted": 49297, "frontend_question_id": 2207, "is_new_question": false }, @@ -13723,8 +14114,8 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 60334, - "total_submitted": 82300, + "total_acs": 60901, + "total_submitted": 83038, "frontend_question_id": 2206, "is_new_question": false }, @@ -13746,8 +14137,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 12364, - "total_submitted": 32048, + "total_acs": 12489, + "total_submitted": 32345, "frontend_question_id": 2197, "is_new_question": false }, @@ -13769,8 +14160,8 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 28394, - "total_submitted": 39225, + "total_acs": 28604, + "total_submitted": 39521, "frontend_question_id": 2196, "is_new_question": false }, @@ -13792,8 +14183,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 27690, - "total_submitted": 110895, + "total_acs": 27854, + "total_submitted": 111433, "frontend_question_id": 2195, "is_new_question": false }, @@ -13815,8 +14206,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": 53561, - "total_submitted": 63747, + "total_acs": 54129, + "total_submitted": 64421, "frontend_question_id": 2194, "is_new_question": false }, @@ -13838,8 +14229,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 2030, - "total_submitted": 3377, + "total_acs": 2071, + "total_submitted": 3445, "frontend_question_id": 2168, "is_new_question": false }, @@ -13861,8 +14252,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 5466, - "total_submitted": 9193, + "total_acs": 5500, + "total_submitted": 9240, "frontend_question_id": 2159, "is_new_question": false }, @@ -13884,8 +14275,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 12798, - "total_submitted": 45083, + "total_acs": 12946, + "total_submitted": 45478, "frontend_question_id": 2183, "is_new_question": false }, @@ -13907,8 +14298,8 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 18106, - "total_submitted": 34381, + "total_acs": 18254, + "total_submitted": 34652, "frontend_question_id": 2182, "is_new_question": false }, @@ -13930,8 +14321,8 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 84713, - "total_submitted": 98518, + "total_acs": 85860, + "total_submitted": 99876, "frontend_question_id": 2181, "is_new_question": false }, @@ -13953,8 +14344,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 46927, - "total_submitted": 71180, + "total_acs": 47316, + "total_submitted": 71731, "frontend_question_id": 2180, "is_new_question": false }, @@ -13976,8 +14367,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": 24585, - "total_submitted": 45070, + "total_acs": 24660, + "total_submitted": 45202, "frontend_question_id": 2158, "is_new_question": false }, @@ -13999,8 +14390,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": 2176, - "total_submitted": 5168, + "total_acs": 2195, + "total_submitted": 5256, "frontend_question_id": 2153, "is_new_question": false }, @@ -14022,8 +14413,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 10362, - "total_submitted": 24985, + "total_acs": 10394, + "total_submitted": 25069, "frontend_question_id": 2188, "is_new_question": false }, @@ -14045,8 +14436,8 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 102206, - "total_submitted": 261744, + "total_acs": 102762, + "total_submitted": 263258, "frontend_question_id": 2187, "is_new_question": false }, @@ -14068,8 +14459,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": 34186, - "total_submitted": 47507, + "total_acs": 34378, + "total_submitted": 47799, "frontend_question_id": 2186, "is_new_question": false }, @@ -14091,8 +14482,8 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 70592, - "total_submitted": 91363, + "total_acs": 71180, + "total_submitted": 92167, "frontend_question_id": 2185, "is_new_question": false }, @@ -14114,8 +14505,8 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 11810, - "total_submitted": 24315, + "total_acs": 11888, + "total_submitted": 24472, "frontend_question_id": 2172, "is_new_question": false }, @@ -14137,8 +14528,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 22778, - "total_submitted": 54040, + "total_acs": 22913, + "total_submitted": 54363, "frontend_question_id": 2171, "is_new_question": false }, @@ -14160,8 +14551,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": 19894, - "total_submitted": 60169, + "total_acs": 19972, + "total_submitted": 60366, "frontend_question_id": 2170, "is_new_question": false }, @@ -14183,8 +14574,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 58575, - "total_submitted": 78522, + "total_acs": 59000, + "total_submitted": 79115, "frontend_question_id": 2169, "is_new_question": false }, @@ -14206,8 +14597,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": 1636, - "total_submitted": 3482, + "total_acs": 1642, + "total_submitted": 3497, "frontend_question_id": 2152, "is_new_question": false }, @@ -14229,8 +14620,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": 10989, - "total_submitted": 26818, + "total_acs": 11034, + "total_submitted": 26908, "frontend_question_id": 2167, "is_new_question": false }, @@ -14252,8 +14643,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 19942, - "total_submitted": 62551, + "total_acs": 20017, + "total_submitted": 62749, "frontend_question_id": 2166, "is_new_question": false }, @@ -14275,8 +14666,8 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 30065, - "total_submitted": 58374, + "total_acs": 30212, + "total_submitted": 58633, "frontend_question_id": 2165, "is_new_question": false }, @@ -14298,8 +14689,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 47131, - "total_submitted": 73661, + "total_acs": 47463, + "total_submitted": 74245, "frontend_question_id": 2164, "is_new_question": false }, @@ -14321,8 +14712,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": 857, - "total_submitted": 1641, + "total_acs": 859, + "total_submitted": 1646, "frontend_question_id": 2143, "is_new_question": false }, @@ -14344,8 +14735,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": 6737, - "total_submitted": 13934, + "total_acs": 6801, + "total_submitted": 14099, "frontend_question_id": 2142, "is_new_question": false }, @@ -14367,8 +14758,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 6696, - "total_submitted": 16906, + "total_acs": 6729, + "total_submitted": 16993, "frontend_question_id": 2179, "is_new_question": false }, @@ -14390,8 +14781,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 40733, - "total_submitted": 68620, + "total_acs": 40915, + "total_submitted": 68924, "frontend_question_id": 2178, "is_new_question": false }, @@ -14413,8 +14804,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": 36819, - "total_submitted": 57515, + "total_acs": 37135, + "total_submitted": 57988, "frontend_question_id": 2177, "is_new_question": false }, @@ -14436,8 +14827,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": 57042, - "total_submitted": 71865, + "total_acs": 57645, + "total_submitted": 72606, "frontend_question_id": 2176, "is_new_question": false }, @@ -14459,8 +14850,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 8224, - "total_submitted": 32204, + "total_acs": 8314, + "total_submitted": 32431, "frontend_question_id": 2157, "is_new_question": false }, @@ -14482,8 +14873,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 11687, - "total_submitted": 51990, + "total_acs": 11727, + "total_submitted": 52093, "frontend_question_id": 2156, "is_new_question": false }, @@ -14505,8 +14896,8 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 72549, - "total_submitted": 100922, + "total_acs": 73164, + "total_submitted": 101843, "frontend_question_id": 2154, "is_new_question": false }, @@ -14528,8 +14919,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": 1962, - "total_submitted": 2915, + "total_acs": 1974, + "total_submitted": 2934, "frontend_question_id": 2137, "is_new_question": false }, @@ -14551,8 +14942,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 11717, - "total_submitted": 23696, + "total_acs": 11747, + "total_submitted": 23753, "frontend_question_id": 2151, "is_new_question": false }, @@ -14574,8 +14965,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 106351, - "total_submitted": 130444, + "total_acs": 110164, + "total_submitted": 135034, "frontend_question_id": 2149, "is_new_question": false }, @@ -14597,8 +14988,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": 37974, - "total_submitted": 63062, + "total_acs": 38261, + "total_submitted": 63488, "frontend_question_id": 2150, "is_new_question": false }, @@ -14620,8 +15011,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": 47311, - "total_submitted": 79677, + "total_acs": 47575, + "total_submitted": 80121, "frontend_question_id": 2148, "is_new_question": false }, @@ -14643,8 +15034,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": 31305, - "total_submitted": 41018, + "total_acs": 31377, + "total_submitted": 41107, "frontend_question_id": 2128, "is_new_question": false }, @@ -14666,8 +15057,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": 8271, - "total_submitted": 17439, + "total_acs": 8338, + "total_submitted": 17588, "frontend_question_id": 2163, "is_new_question": false }, @@ -14689,8 +15080,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 14232, - "total_submitted": 35201, + "total_acs": 14290, + "total_submitted": 35325, "frontend_question_id": 2162, "is_new_question": false }, @@ -14712,8 +15103,8 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 54425, - "total_submitted": 64115, + "total_acs": 56249, + "total_submitted": 66217, "frontend_question_id": 2161, "is_new_question": false }, @@ -14735,8 +15126,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": 96536, - "total_submitted": 111827, + "total_acs": 97593, + "total_submitted": 113015, "frontend_question_id": 2160, "is_new_question": false }, @@ -14758,8 +15149,8 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 55249, - "total_submitted": 108638, + "total_acs": 55644, + "total_submitted": 109779, "frontend_question_id": 2141, "is_new_question": false }, @@ -14781,8 +15172,8 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 86770, - "total_submitted": 157389, + "total_acs": 87341, + "total_submitted": 158514, "frontend_question_id": 2140, "is_new_question": false }, @@ -14804,8 +15195,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": 26111, - "total_submitted": 40964, + "total_acs": 26204, + "total_submitted": 41089, "frontend_question_id": 2155, "is_new_question": false }, @@ -14827,8 +15218,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": 38399, - "total_submitted": 58592, + "total_acs": 38619, + "total_submitted": 58919, "frontend_question_id": 2138, "is_new_question": false }, @@ -14850,8 +15241,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": 783, - "total_submitted": 1867, + "total_acs": 790, + "total_submitted": 1882, "frontend_question_id": 2123, "is_new_question": false }, @@ -14873,8 +15264,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": 1631, - "total_submitted": 2222, + "total_acs": 1636, + "total_submitted": 2228, "frontend_question_id": 2113, "is_new_question": false }, @@ -14896,8 +15287,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 49299, - "total_submitted": 68040, + "total_acs": 49469, + "total_submitted": 68285, "frontend_question_id": 2136, "is_new_question": false }, @@ -14919,8 +15310,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": 30746, - "total_submitted": 72036, + "total_acs": 30847, + "total_submitted": 72261, "frontend_question_id": 2135, "is_new_question": false }, @@ -14942,8 +15333,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": 23344, - "total_submitted": 45362, + "total_acs": 23486, + "total_submitted": 45621, "frontend_question_id": 2134, "is_new_question": false }, @@ -14965,8 +15356,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": 58055, - "total_submitted": 112336, + "total_acs": 58472, + "total_submitted": 113108, "frontend_question_id": 2133, "is_new_question": false }, @@ -14988,8 +15379,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 1851, - "total_submitted": 3339, + "total_acs": 1869, + "total_submitted": 3368, "frontend_question_id": 2118, "is_new_question": false }, @@ -15011,8 +15402,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 6426, - "total_submitted": 9238, + "total_acs": 6495, + "total_submitted": 9331, "frontend_question_id": 2112, "is_new_question": false }, @@ -15034,8 +15425,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": 10927, - "total_submitted": 27612, + "total_acs": 11003, + "total_submitted": 27797, "frontend_question_id": 2147, "is_new_question": false }, @@ -15057,8 +15448,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": 13287, - "total_submitted": 31803, + "total_acs": 13416, + "total_submitted": 32046, "frontend_question_id": 2146, "is_new_question": false }, @@ -15080,8 +15471,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 15807, - "total_submitted": 42364, + "total_acs": 15861, + "total_submitted": 42477, "frontend_question_id": 2145, "is_new_question": false }, @@ -15103,8 +15494,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": 39368, - "total_submitted": 65010, + "total_acs": 39704, + "total_submitted": 65558, "frontend_question_id": 2144, "is_new_question": false }, @@ -15126,8 +15517,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": 2601, - "total_submitted": 4644, + "total_acs": 2633, + "total_submitted": 4700, "frontend_question_id": 2107, "is_new_question": false }, @@ -15149,8 +15540,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": 9544, - "total_submitted": 26943, + "total_acs": 9706, + "total_submitted": 27290, "frontend_question_id": 2127, "is_new_question": false }, @@ -15172,8 +15563,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 32857, - "total_submitted": 64947, + "total_acs": 33124, + "total_submitted": 65450, "frontend_question_id": 2126, "is_new_question": false }, @@ -15195,8 +15586,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": 50106, - "total_submitted": 61403, + "total_acs": 50499, + "total_submitted": 61960, "frontend_question_id": 2125, "is_new_question": false }, @@ -15218,8 +15609,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": 59063, - "total_submitted": 83042, + "total_acs": 59551, + "total_submitted": 83711, "frontend_question_id": 2124, "is_new_question": false }, @@ -15241,8 +15632,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": 2445, - "total_submitted": 6477, + "total_acs": 2462, + "total_submitted": 6521, "frontend_question_id": 2098, "is_new_question": false }, @@ -15264,8 +15655,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 9293, - "total_submitted": 24160, + "total_acs": 9338, + "total_submitted": 24245, "frontend_question_id": 2122, "is_new_question": false }, @@ -15287,8 +15678,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 16948, - "total_submitted": 38603, + "total_acs": 17016, + "total_submitted": 38777, "frontend_question_id": 2121, "is_new_question": false }, @@ -15310,8 +15701,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": 25727, - "total_submitted": 31182, + "total_acs": 25905, + "total_submitted": 31380, "frontend_question_id": 2120, "is_new_question": false }, @@ -15333,8 +15724,8 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 63956, - "total_submitted": 82066, + "total_acs": 64575, + "total_submitted": 82818, "frontend_question_id": 2119, "is_new_question": false }, @@ -15356,8 +15747,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": 105935, - "total_submitted": 219994, + "total_acs": 106249, + "total_submitted": 220793, "frontend_question_id": 2131, "is_new_question": false }, @@ -15379,8 +15770,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": 182733, - "total_submitted": 222587, + "total_acs": 185846, + "total_submitted": 226497, "frontend_question_id": 2130, "is_new_question": false }, @@ -15402,8 +15793,8 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 48849, - "total_submitted": 78076, + "total_acs": 49236, + "total_submitted": 78624, "frontend_question_id": 2129, "is_new_question": false }, @@ -15425,8 +15816,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": 11455, - "total_submitted": 30167, + "total_acs": 11510, + "total_submitted": 30295, "frontend_question_id": 2111, "is_new_question": false }, @@ -15448,8 +15839,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": 30862, - "total_submitted": 53002, + "total_acs": 31051, + "total_submitted": 53353, "frontend_question_id": 2110, "is_new_question": false }, @@ -15471,8 +15862,8 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 33616, - "total_submitted": 59281, + "total_acs": 33814, + "total_submitted": 59623, "frontend_question_id": 2109, "is_new_question": false }, @@ -15494,8 +15885,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": 95427, - "total_submitted": 121213, + "total_acs": 96460, + "total_submitted": 122569, "frontend_question_id": 2108, "is_new_question": false }, @@ -15517,8 +15908,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": 4296, - "total_submitted": 7778, + "total_acs": 4335, + "total_submitted": 7836, "frontend_question_id": 2093, "is_new_question": false }, @@ -15540,8 +15931,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": 9192, - "total_submitted": 26123, + "total_acs": 9268, + "total_submitted": 26286, "frontend_question_id": 2106, "is_new_question": false }, @@ -15563,8 +15954,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 16493, - "total_submitted": 33846, + "total_acs": 16592, + "total_submitted": 34060, "frontend_question_id": 2105, "is_new_question": false }, @@ -15586,8 +15977,8 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 75204, - "total_submitted": 123705, + "total_acs": 75964, + "total_submitted": 124823, "frontend_question_id": 2104, "is_new_question": false }, @@ -15609,8 +16000,8 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 58794, - "total_submitted": 72681, + "total_acs": 59286, + "total_submitted": 73282, "frontend_question_id": 2103, "is_new_question": false }, @@ -15632,8 +16023,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": 5501, - "total_submitted": 8096, + "total_acs": 5522, + "total_submitted": 8127, "frontend_question_id": 2083, "is_new_question": false }, @@ -15655,8 +16046,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": 7962, - "total_submitted": 9082, + "total_acs": 8018, + "total_submitted": 9141, "frontend_question_id": 2084, "is_new_question": false }, @@ -15678,8 +16069,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 12278, - "total_submitted": 15471, + "total_acs": 14786, + "total_submitted": 18729, "frontend_question_id": 2082, "is_new_question": false }, @@ -15701,8 +16092,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 2859, - "total_submitted": 10712, + "total_acs": 2872, + "total_submitted": 10802, "frontend_question_id": 2117, "is_new_question": false }, @@ -15724,8 +16115,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": 17108, - "total_submitted": 55370, + "total_acs": 17247, + "total_submitted": 55956, "frontend_question_id": 2116, "is_new_question": false }, @@ -15747,8 +16138,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": 71042, - "total_submitted": 145751, + "total_acs": 71604, + "total_submitted": 146784, "frontend_question_id": 2115, "is_new_question": false }, @@ -15770,8 +16161,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": 207730, - "total_submitted": 239877, + "total_acs": 210395, + "total_submitted": 242998, "frontend_question_id": 2114, "is_new_question": false }, @@ -15793,8 +16184,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": 3262, - "total_submitted": 5925, + "total_acs": 3276, + "total_submitted": 5948, "frontend_question_id": 2077, "is_new_question": false }, @@ -15816,8 +16207,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": 85977, - "total_submitted": 177059, + "total_acs": 86460, + "total_submitted": 177983, "frontend_question_id": 2096, "is_new_question": false }, @@ -15839,8 +16230,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": 229288, - "total_submitted": 389005, + "total_acs": 234242, + "total_submitted": 397616, "frontend_question_id": 2095, "is_new_question": false }, @@ -15862,8 +16253,8 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 24650, - "total_submitted": 42445, + "total_acs": 24874, + "total_submitted": 42721, "frontend_question_id": 2094, "is_new_question": false }, @@ -15885,8 +16276,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 8703, - "total_submitted": 11961, + "total_acs": 8758, + "total_submitted": 12049, "frontend_question_id": 2072, "is_new_question": false }, @@ -15908,8 +16299,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 22047, - "total_submitted": 64545, + "total_acs": 22177, + "total_submitted": 64867, "frontend_question_id": 2092, "is_new_question": false }, @@ -15931,8 +16322,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 33124, - "total_submitted": 60555, + "total_acs": 33328, + "total_submitted": 61064, "frontend_question_id": 2091, "is_new_question": false }, @@ -15954,8 +16345,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 93970, - "total_submitted": 195712, + "total_acs": 94724, + "total_submitted": 197572, "frontend_question_id": 2090, "is_new_question": false }, @@ -15977,8 +16368,8 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 130125, - "total_submitted": 171455, + "total_acs": 131509, + "total_submitted": 173254, "frontend_question_id": 2089, "is_new_question": false }, @@ -16000,8 +16391,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 2093, - "total_submitted": 4369, + "total_acs": 2110, + "total_submitted": 4399, "frontend_question_id": 2067, "is_new_question": false }, @@ -16023,8 +16414,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 7329, - "total_submitted": 8760, + "total_acs": 7382, + "total_submitted": 8820, "frontend_question_id": 2066, "is_new_question": false }, @@ -16046,8 +16437,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 13196, - "total_submitted": 20276, + "total_acs": 13269, + "total_submitted": 20390, "frontend_question_id": 2102, "is_new_question": false }, @@ -16069,8 +16460,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 89941, - "total_submitted": 182102, + "total_acs": 91184, + "total_submitted": 184879, "frontend_question_id": 2101, "is_new_question": false }, @@ -16092,8 +16483,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": 22036, - "total_submitted": 44736, + "total_acs": 22165, + "total_submitted": 44966, "frontend_question_id": 2100, "is_new_question": false }, @@ -16115,8 +16506,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": 36977, - "total_submitted": 86622, + "total_acs": 37465, + "total_submitted": 87756, "frontend_question_id": 2099, "is_new_question": false }, @@ -16138,8 +16529,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 3721, - "total_submitted": 6821, + "total_acs": 3724, + "total_submitted": 6836, "frontend_question_id": 2061, "is_new_question": false }, @@ -16161,8 +16552,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 6513, - "total_submitted": 15585, + "total_acs": 6532, + "total_submitted": 15617, "frontend_question_id": 2081, "is_new_question": false }, @@ -16184,8 +16575,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 7703, - "total_submitted": 18588, + "total_acs": 7786, + "total_submitted": 18753, "frontend_question_id": 2097, "is_new_question": false }, @@ -16207,8 +16598,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 5981, - "total_submitted": 18811, + "total_acs": 6003, + "total_submitted": 18919, "frontend_question_id": 2132, "is_new_question": false }, @@ -16230,8 +16621,8 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 44292, - "total_submitted": 66490, + "total_acs": 44598, + "total_submitted": 66957, "frontend_question_id": 2078, "is_new_question": false }, @@ -16253,8 +16644,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 14639, - "total_submitted": 27226, + "total_acs": 14768, + "total_submitted": 27430, "frontend_question_id": 2076, "is_new_question": false }, @@ -16276,8 +16667,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 11657, - "total_submitted": 23448, + "total_acs": 11713, + "total_submitted": 23578, "frontend_question_id": 2075, "is_new_question": false }, @@ -16299,8 +16690,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 18482, - "total_submitted": 33584, + "total_acs": 18692, + "total_submitted": 33873, "frontend_question_id": 2074, "is_new_question": false }, @@ -16322,8 +16713,8 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 46519, - "total_submitted": 74413, + "total_acs": 47115, + "total_submitted": 75297, "frontend_question_id": 2073, "is_new_question": false }, @@ -16345,8 +16736,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": 6160, - "total_submitted": 8803, + "total_acs": 6194, + "total_submitted": 8860, "frontend_question_id": 2051, "is_new_question": false }, @@ -16368,8 +16759,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 6332, - "total_submitted": 10007, + "total_acs": 6378, + "total_submitted": 10079, "frontend_question_id": 2088, "is_new_question": false }, @@ -16391,8 +16782,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": 14741, - "total_submitted": 28909, + "total_acs": 14894, + "total_submitted": 29168, "frontend_question_id": 2087, "is_new_question": false }, @@ -16414,8 +16805,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": 15501, - "total_submitted": 34342, + "total_acs": 15607, + "total_submitted": 34534, "frontend_question_id": 2086, "is_new_question": false }, @@ -16437,8 +16828,8 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 49909, - "total_submitted": 71619, + "total_acs": 50357, + "total_submitted": 72247, "frontend_question_id": 2085, "is_new_question": false }, @@ -16460,8 +16851,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 16410, - "total_submitted": 28644, + "total_acs": 16584, + "total_submitted": 28948, "frontend_question_id": 2065, "is_new_question": false }, @@ -16483,8 +16874,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": 22392, - "total_submitted": 43792, + "total_acs": 22674, + "total_submitted": 44304, "frontend_question_id": 2064, "is_new_question": false }, @@ -16506,8 +16897,8 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 23535, - "total_submitted": 43108, + "total_acs": 23692, + "total_submitted": 43419, "frontend_question_id": 2063, "is_new_question": false }, @@ -16529,8 +16920,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 30546, - "total_submitted": 45938, + "total_acs": 30809, + "total_submitted": 46321, "frontend_question_id": 2062, "is_new_question": false }, @@ -16552,8 +16943,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 6924, - "total_submitted": 8788, + "total_acs": 6959, + "total_submitted": 8831, "frontend_question_id": 2041, "is_new_question": false }, @@ -16575,8 +16966,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": 9658, - "total_submitted": 23835, + "total_acs": 9723, + "total_submitted": 23998, "frontend_question_id": 2060, "is_new_question": false }, @@ -16598,8 +16989,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 14009, - "total_submitted": 29209, + "total_acs": 14078, + "total_submitted": 29357, "frontend_question_id": 2059, "is_new_question": false }, @@ -16621,8 +17012,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": 25935, - "total_submitted": 45256, + "total_acs": 26316, + "total_submitted": 45883, "frontend_question_id": 2058, "is_new_question": false }, @@ -16644,8 +17035,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 46612, - "total_submitted": 64791, + "total_acs": 47092, + "total_submitted": 65430, "frontend_question_id": 2057, "is_new_question": false }, @@ -16667,8 +17058,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": 7313, - "total_submitted": 21697, + "total_acs": 7376, + "total_submitted": 21863, "frontend_question_id": 2071, "is_new_question": false }, @@ -16690,8 +17081,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 13706, - "total_submitted": 27558, + "total_acs": 13804, + "total_submitted": 27734, "frontend_question_id": 2070, "is_new_question": false }, @@ -16713,8 +17104,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 8997, - "total_submitted": 37261, + "total_acs": 9030, + "total_submitted": 37406, "frontend_question_id": 2069, "is_new_question": false }, @@ -16736,8 +17127,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": 39697, - "total_submitted": 62504, + "total_acs": 40275, + "total_submitted": 63399, "frontend_question_id": 2068, "is_new_question": false }, @@ -16759,8 +17150,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 19941, - "total_submitted": 33644, + "total_acs": 20163, + "total_submitted": 34017, "frontend_question_id": 2050, "is_new_question": false }, @@ -16782,8 +17173,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 18011, - "total_submitted": 37850, + "total_acs": 18129, + "total_submitted": 38104, "frontend_question_id": 2049, "is_new_question": false }, @@ -16805,8 +17196,8 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 11570, - "total_submitted": 24571, + "total_acs": 11615, + "total_submitted": 24638, "frontend_question_id": 2048, "is_new_question": false }, @@ -16828,8 +17219,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": 23447, - "total_submitted": 81223, + "total_acs": 23739, + "total_submitted": 82028, "frontend_question_id": 2047, "is_new_question": false }, @@ -16851,8 +17242,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 9715, - "total_submitted": 11525, + "total_acs": 9761, + "total_submitted": 11582, "frontend_question_id": 2026, "is_new_question": false }, @@ -16874,8 +17265,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 9468, - "total_submitted": 23839, + "total_acs": 9518, + "total_submitted": 23940, "frontend_question_id": 2045, "is_new_question": false }, @@ -16897,8 +17288,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": 22771, - "total_submitted": 29932, + "total_acs": 22940, + "total_submitted": 30145, "frontend_question_id": 2044, "is_new_question": false }, @@ -16920,8 +17311,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 20096, - "total_submitted": 30896, + "total_acs": 20268, + "total_submitted": 31173, "frontend_question_id": 2043, "is_new_question": false }, @@ -16943,8 +17334,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": 45451, - "total_submitted": 66969, + "total_acs": 45816, + "total_submitted": 67460, "frontend_question_id": 2042, "is_new_question": false }, @@ -16966,8 +17357,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": 8389, - "total_submitted": 11629, + "total_acs": 8419, + "total_submitted": 11667, "frontend_question_id": 2020, "is_new_question": false }, @@ -16989,8 +17380,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": 3579, - "total_submitted": 6626, + "total_acs": 3599, + "total_submitted": 6666, "frontend_question_id": 2056, "is_new_question": false }, @@ -17012,8 +17403,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 32010, - "total_submitted": 71832, + "total_acs": 32335, + "total_submitted": 72654, "frontend_question_id": 2055, "is_new_question": false }, @@ -17035,8 +17426,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 15170, - "total_submitted": 33122, + "total_acs": 15287, + "total_submitted": 33356, "frontend_question_id": 2054, "is_new_question": false }, @@ -17058,8 +17449,8 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 48922, - "total_submitted": 67888, + "total_acs": 49433, + "total_submitted": 68625, "frontend_question_id": 2053, "is_new_question": false }, @@ -17081,8 +17472,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": 16719, - "total_submitted": 87935, + "total_acs": 17080, + "total_submitted": 89503, "frontend_question_id": 2035, "is_new_question": false }, @@ -17104,8 +17495,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 59175, - "total_submitted": 121419, + "total_acs": 59420, + "total_submitted": 121935, "frontend_question_id": 2034, "is_new_question": false }, @@ -17127,8 +17518,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": 19963, - "total_submitted": 38004, + "total_acs": 20051, + "total_submitted": 38146, "frontend_question_id": 2033, "is_new_question": false }, @@ -17150,8 +17541,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 52351, - "total_submitted": 70872, + "total_acs": 52790, + "total_submitted": 71414, "frontend_question_id": 2032, "is_new_question": false }, @@ -17173,8 +17564,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": 4491, - "total_submitted": 7473, + "total_acs": 4525, + "total_submitted": 7514, "frontend_question_id": 2010, "is_new_question": false }, @@ -17196,8 +17587,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": 6747, - "total_submitted": 17432, + "total_acs": 6836, + "total_submitted": 17648, "frontend_question_id": 2030, "is_new_question": false }, @@ -17219,8 +17610,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 6931, - "total_submitted": 25500, + "total_acs": 6972, + "total_submitted": 25589, "frontend_question_id": 2029, "is_new_question": false }, @@ -17242,8 +17633,8 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 23126, - "total_submitted": 51217, + "total_acs": 23315, + "total_submitted": 51540, "frontend_question_id": 2028, "is_new_question": false }, @@ -17265,8 +17656,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 29517, - "total_submitted": 54569, + "total_acs": 29720, + "total_submitted": 54950, "frontend_question_id": 2027, "is_new_question": false }, @@ -17288,8 +17679,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 527, - "total_submitted": 854, + "total_acs": 533, + "total_submitted": 862, "frontend_question_id": 2005, "is_new_question": false }, @@ -17311,8 +17702,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": 6600, - "total_submitted": 16356, + "total_acs": 6646, + "total_submitted": 16425, "frontend_question_id": 2004, "is_new_question": false }, @@ -17334,8 +17725,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": 11792, - "total_submitted": 23038, + "total_acs": 11874, + "total_submitted": 23216, "frontend_question_id": 2039, "is_new_question": false }, @@ -17357,8 +17748,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": 9743, - "total_submitted": 34031, + "total_acs": 9818, + "total_submitted": 34290, "frontend_question_id": 2040, "is_new_question": false }, @@ -17380,8 +17771,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": 27676, - "total_submitted": 48028, + "total_acs": 28302, + "total_submitted": 49093, "frontend_question_id": 2038, "is_new_question": false }, @@ -17403,8 +17794,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": 53606, - "total_submitted": 65715, + "total_acs": 54162, + "total_submitted": 66421, "frontend_question_id": 2037, "is_new_question": false }, @@ -17426,8 +17817,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": 6096, - "total_submitted": 18388, + "total_acs": 6148, + "total_submitted": 18535, "frontend_question_id": 2019, "is_new_question": false }, @@ -17449,8 +17840,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": 17935, - "total_submitted": 36488, + "total_acs": 17996, + "total_submitted": 36631, "frontend_question_id": 2018, "is_new_question": false }, @@ -17472,8 +17863,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 17887, - "total_submitted": 40396, + "total_acs": 18072, + "total_submitted": 40805, "frontend_question_id": 2017, "is_new_question": false }, @@ -17495,8 +17886,8 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 64666, - "total_submitted": 118388, + "total_acs": 65288, + "total_submitted": 119452, "frontend_question_id": 2016, "is_new_question": false }, @@ -17518,8 +17909,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 5585, - "total_submitted": 11209, + "total_acs": 5610, + "total_submitted": 11276, "frontend_question_id": 1990, "is_new_question": false }, @@ -17541,8 +17932,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": 1717, - "total_submitted": 2923, + "total_acs": 1725, + "total_submitted": 2936, "frontend_question_id": 2015, "is_new_question": false }, @@ -17564,8 +17955,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": 1423, - "total_submitted": 2841, + "total_acs": 1430, + "total_submitted": 2849, "frontend_question_id": 1999, "is_new_question": false }, @@ -17587,8 +17978,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 6255, - "total_submitted": 11344, + "total_acs": 6300, + "total_submitted": 11429, "frontend_question_id": 2014, "is_new_question": false }, @@ -17610,8 +18001,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 49450, - "total_submitted": 98134, + "total_acs": 49969, + "total_submitted": 99185, "frontend_question_id": 2013, "is_new_question": false }, @@ -17633,8 +18024,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 20012, - "total_submitted": 42282, + "total_acs": 20125, + "total_submitted": 42490, "frontend_question_id": 2012, "is_new_question": false }, @@ -17656,8 +18047,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": 260413, - "total_submitted": 294016, + "total_acs": 263582, + "total_submitted": 297633, "frontend_question_id": 2011, "is_new_question": false }, @@ -17679,8 +18070,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 9472, - "total_submitted": 14017, + "total_acs": 9507, + "total_submitted": 14070, "frontend_question_id": 1988, "is_new_question": false }, @@ -17702,8 +18093,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": 7542, - "total_submitted": 22828, + "total_acs": 7579, + "total_submitted": 22944, "frontend_question_id": 2025, "is_new_question": false }, @@ -17725,8 +18116,8 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 88911, - "total_submitted": 132241, + "total_acs": 89560, + "total_submitted": 133176, "frontend_question_id": 2024, "is_new_question": false }, @@ -17748,8 +18139,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": 34905, - "total_submitted": 47340, + "total_acs": 35218, + "total_submitted": 47726, "frontend_question_id": 2023, "is_new_question": false }, @@ -17771,8 +18162,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 64325, - "total_submitted": 107761, + "total_acs": 64889, + "total_submitted": 108524, "frontend_question_id": 2022, "is_new_question": false }, @@ -17794,8 +18185,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": 6932, - "total_submitted": 15335, + "total_acs": 7019, + "total_submitted": 15448, "frontend_question_id": 2003, "is_new_question": false }, @@ -17817,8 +18208,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": 20602, - "total_submitted": 36915, + "total_acs": 20791, + "total_submitted": 37205, "frontend_question_id": 2002, "is_new_question": false }, @@ -17840,8 +18231,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 27942, - "total_submitted": 59269, + "total_acs": 28230, + "total_submitted": 59796, "frontend_question_id": 2001, "is_new_question": false }, @@ -17863,8 +18254,8 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 74182, - "total_submitted": 93392, + "total_acs": 75180, + "total_submitted": 94514, "frontend_question_id": 2000, "is_new_question": false }, @@ -17886,8 +18277,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 25049, - "total_submitted": 52708, + "total_acs": 27009, + "total_submitted": 56727, "frontend_question_id": 1978, "is_new_question": false }, @@ -17909,8 +18300,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": 8235, - "total_submitted": 10961, + "total_acs": 8278, + "total_submitted": 11022, "frontend_question_id": 1973, "is_new_question": false }, @@ -17932,8 +18323,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 7505, - "total_submitted": 16403, + "total_acs": 7567, + "total_submitted": 16538, "frontend_question_id": 1998, "is_new_question": false }, @@ -17955,8 +18346,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": 8096, - "total_submitted": 22082, + "total_acs": 8163, + "total_submitted": 22248, "frontend_question_id": 1997, "is_new_question": false }, @@ -17978,8 +18369,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": 96977, - "total_submitted": 220618, + "total_acs": 97269, + "total_submitted": 221304, "frontend_question_id": 1996, "is_new_question": false }, @@ -18001,8 +18392,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 33394, - "total_submitted": 55637, + "total_acs": 33625, + "total_submitted": 55983, "frontend_question_id": 1995, "is_new_question": false }, @@ -18024,8 +18415,8 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 255427, - "total_submitted": 494778, + "total_acs": 257887, + "total_submitted": 499683, "frontend_question_id": 1971, "is_new_question": false }, @@ -18047,8 +18438,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": 8026, - "total_submitted": 15922, + "total_acs": 8046, + "total_submitted": 15972, "frontend_question_id": 1972, "is_new_question": false }, @@ -18070,8 +18461,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": 12089, - "total_submitted": 26577, + "total_acs": 12193, + "total_submitted": 26815, "frontend_question_id": 2009, "is_new_question": false }, @@ -18093,8 +18484,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 23882, - "total_submitted": 55369, + "total_acs": 24096, + "total_submitted": 55853, "frontend_question_id": 2008, "is_new_question": false }, @@ -18116,8 +18507,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 121422, - "total_submitted": 299639, + "total_acs": 121904, + "total_submitted": 300950, "frontend_question_id": 2007, "is_new_question": false }, @@ -18139,8 +18530,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": 107949, - "total_submitted": 130309, + "total_acs": 109261, + "total_submitted": 131828, "frontend_question_id": 2006, "is_new_question": false }, @@ -18162,8 +18553,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 10140, - "total_submitted": 19484, + "total_acs": 10218, + "total_submitted": 19638, "frontend_question_id": 1987, "is_new_question": false }, @@ -18185,8 +18576,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": 21914, - "total_submitted": 66446, + "total_acs": 22032, + "total_submitted": 66926, "frontend_question_id": 1986, "is_new_question": false }, @@ -18208,8 +18599,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": 51131, - "total_submitted": 114848, + "total_acs": 51964, + "total_submitted": 116616, "frontend_question_id": 1985, "is_new_question": false }, @@ -18231,8 +18622,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": 52594, - "total_submitted": 95291, + "total_acs": 53343, + "total_submitted": 96591, "frontend_question_id": 1984, "is_new_question": false }, @@ -18254,8 +18645,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": 2423, - "total_submitted": 3715, + "total_acs": 2437, + "total_submitted": 3732, "frontend_question_id": 1966, "is_new_question": false }, @@ -18277,8 +18668,8 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 101534, - "total_submitted": 139516, + "total_acs": 102083, + "total_submitted": 140311, "frontend_question_id": 1965, "is_new_question": false }, @@ -18300,8 +18691,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 4571, - "total_submitted": 9439, + "total_acs": 4604, + "total_submitted": 9499, "frontend_question_id": 1982, "is_new_question": false }, @@ -18323,8 +18714,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": 22274, - "total_submitted": 68180, + "total_acs": 22537, + "total_submitted": 68763, "frontend_question_id": 1981, "is_new_question": false }, @@ -18346,8 +18737,8 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 40549, - "total_submitted": 61521, + "total_acs": 40942, + "total_submitted": 62046, "frontend_question_id": 1980, "is_new_question": false }, @@ -18369,8 +18760,8 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 94420, - "total_submitted": 122305, + "total_acs": 95553, + "total_submitted": 123742, "frontend_question_id": 1979, "is_new_question": false }, @@ -18392,8 +18783,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 6181, - "total_submitted": 17922, + "total_acs": 6219, + "total_submitted": 18072, "frontend_question_id": 1994, "is_new_question": false }, @@ -18415,8 +18806,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 12138, - "total_submitted": 27222, + "total_acs": 12292, + "total_submitted": 27554, "frontend_question_id": 1993, "is_new_question": false }, @@ -18438,8 +18829,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 23506, - "total_submitted": 34396, + "total_acs": 23672, + "total_submitted": 34651, "frontend_question_id": 1992, "is_new_question": false }, @@ -18461,8 +18852,8 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 70719, - "total_submitted": 105093, + "total_acs": 71431, + "total_submitted": 106108, "frontend_question_id": 1991, "is_new_question": false }, @@ -18484,8 +18875,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": 50747, - "total_submitted": 80857, + "total_acs": 50983, + "total_submitted": 81305, "frontend_question_id": 1970, "is_new_question": false }, @@ -18507,8 +18898,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": 9589, - "total_submitted": 27705, + "total_acs": 9628, + "total_submitted": 27841, "frontend_question_id": 1969, "is_new_question": false }, @@ -18530,8 +18921,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": 54006, - "total_submitted": 67554, + "total_acs": 54497, + "total_submitted": 68108, "frontend_question_id": 1967, "is_new_question": false }, @@ -18553,8 +18944,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": 9817, - "total_submitted": 14113, + "total_acs": 9849, + "total_submitted": 14168, "frontend_question_id": 1951, "is_new_question": false }, @@ -18576,8 +18967,8 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 9892, - "total_submitted": 17924, + "total_acs": 9932, + "total_submitted": 17992, "frontend_question_id": 1949, "is_new_question": false }, @@ -18599,8 +18990,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": 51823, - "total_submitted": 81377, + "total_acs": 52067, + "total_submitted": 81776, "frontend_question_id": 1964, "is_new_question": false }, @@ -18622,8 +19013,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": 52076, - "total_submitted": 74518, + "total_acs": 52707, + "total_submitted": 75376, "frontend_question_id": 1963, "is_new_question": false }, @@ -18645,8 +19036,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 83849, - "total_submitted": 137946, + "total_acs": 84319, + "total_submitted": 138586, "frontend_question_id": 1962, "is_new_question": false }, @@ -18668,8 +19059,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": 41193, - "total_submitted": 77816, + "total_acs": 41490, + "total_submitted": 78402, "frontend_question_id": 1961, "is_new_question": false }, @@ -18691,8 +19082,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 9272, - "total_submitted": 16126, + "total_acs": 9324, + "total_submitted": 16215, "frontend_question_id": 1939, "is_new_question": false }, @@ -18714,8 +19105,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 5025, - "total_submitted": 24828, + "total_acs": 5076, + "total_submitted": 25111, "frontend_question_id": 1977, "is_new_question": false }, @@ -18737,8 +19128,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": 39723, - "total_submitted": 136341, + "total_acs": 40602, + "total_submitted": 140367, "frontend_question_id": 1976, "is_new_question": false }, @@ -18760,8 +19151,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 15787, - "total_submitted": 32423, + "total_acs": 15858, + "total_submitted": 32542, "frontend_question_id": 1975, "is_new_question": false }, @@ -18783,8 +19174,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": 33314, - "total_submitted": 45636, + "total_acs": 33541, + "total_submitted": 45892, "frontend_question_id": 1974, "is_new_question": false }, @@ -18806,8 +19197,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 36773, - "total_submitted": 61957, + "total_acs": 40274, + "total_submitted": 67895, "frontend_question_id": 1934, "is_new_question": false }, @@ -18829,8 +19220,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 10040, - "total_submitted": 19642, + "total_acs": 10079, + "total_submitted": 19702, "frontend_question_id": 1955, "is_new_question": false }, @@ -18852,8 +19243,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": 27798, - "total_submitted": 56275, + "total_acs": 28164, + "total_submitted": 56988, "frontend_question_id": 1968, "is_new_question": false }, @@ -18875,8 +19266,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": 20107, - "total_submitted": 50756, + "total_acs": 20195, + "total_submitted": 50934, "frontend_question_id": 1953, "is_new_question": false }, @@ -18898,8 +19289,8 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 49845, - "total_submitted": 84798, + "total_acs": 50410, + "total_submitted": 85641, "frontend_question_id": 1952, "is_new_question": false }, @@ -18921,8 +19312,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": 1513, - "total_submitted": 3015, + "total_acs": 1521, + "total_submitted": 3036, "frontend_question_id": 2052, "is_new_question": false }, @@ -18944,8 +19335,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": 7291, - "total_submitted": 17206, + "total_acs": 7324, + "total_submitted": 17274, "frontend_question_id": 1959, "is_new_question": false }, @@ -18967,8 +19358,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 10079, - "total_submitted": 21847, + "total_acs": 10180, + "total_submitted": 22036, "frontend_question_id": 1958, "is_new_question": false }, @@ -18990,8 +19381,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 7717, - "total_submitted": 13600, + "total_acs": 7766, + "total_submitted": 13711, "frontend_question_id": 1948, "is_new_question": false }, @@ -19013,8 +19404,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 20943, - "total_submitted": 33983, + "total_acs": 21076, + "total_submitted": 34257, "frontend_question_id": 1947, "is_new_question": false }, @@ -19036,8 +19427,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 18111, - "total_submitted": 51659, + "total_acs": 18166, + "total_submitted": 51812, "frontend_question_id": 1946, "is_new_question": false }, @@ -19059,8 +19450,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": 43605, - "total_submitted": 70647, + "total_acs": 43905, + "total_submitted": 71065, "frontend_question_id": 1945, "is_new_question": false }, @@ -19082,8 +19473,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 4726, - "total_submitted": 7578, + "total_acs": 4768, + "total_submitted": 7641, "frontend_question_id": 2021, "is_new_question": false }, @@ -19105,8 +19496,8 @@ "question__title": "Erect the Fence II", "question__title_slug": "erect-the-fence-ii", "question__hide": false, - "total_acs": 623, - "total_submitted": 1179, + "total_acs": 630, + "total_submitted": 1201, "frontend_question_id": 1924, "is_new_question": false }, @@ -19128,8 +19519,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": 798, - "total_submitted": 1612, + "total_acs": 801, + "total_submitted": 1618, "frontend_question_id": 1956, "is_new_question": false }, @@ -19151,8 +19542,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": 2614, - "total_submitted": 5256, + "total_acs": 2621, + "total_submitted": 5270, "frontend_question_id": 1950, "is_new_question": false }, @@ -19174,8 +19565,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 5453, - "total_submitted": 6916, + "total_acs": 5475, + "total_submitted": 6941, "frontend_question_id": 1940, "is_new_question": false }, @@ -19197,8 +19588,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": 3174, - "total_submitted": 6299, + "total_acs": 3194, + "total_submitted": 6322, "frontend_question_id": 1933, "is_new_question": false }, @@ -19220,8 +19611,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 3577, - "total_submitted": 6783, + "total_acs": 3598, + "total_submitted": 6832, "frontend_question_id": 1918, "is_new_question": false }, @@ -19243,8 +19634,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 4544, - "total_submitted": 11237, + "total_acs": 4566, + "total_submitted": 11288, "frontend_question_id": 1938, "is_new_question": false }, @@ -19266,8 +19657,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 55872, - "total_submitted": 155719, + "total_acs": 56048, + "total_submitted": 156268, "frontend_question_id": 1937, "is_new_question": false }, @@ -19289,8 +19680,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 24157, - "total_submitted": 56080, + "total_acs": 24249, + "total_submitted": 56311, "frontend_question_id": 1936, "is_new_question": false }, @@ -19312,8 +19703,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 1352, - "total_submitted": 3146, + "total_acs": 1418, + "total_submitted": 3283, "frontend_question_id": 2307, "is_new_question": false }, @@ -19335,8 +19726,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 4424, - "total_submitted": 10600, + "total_acs": 4441, + "total_submitted": 10663, "frontend_question_id": 1919, "is_new_question": false }, @@ -19358,8 +19749,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 5154, - "total_submitted": 18875, + "total_acs": 5189, + "total_submitted": 19060, "frontend_question_id": 1917, "is_new_question": false }, @@ -19381,8 +19772,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 4158, - "total_submitted": 6517, + "total_acs": 4170, + "total_submitted": 6540, "frontend_question_id": 1908, "is_new_question": false }, @@ -19404,8 +19795,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": 8251, - "total_submitted": 14329, + "total_acs": 8296, + "total_submitted": 14413, "frontend_question_id": 1931, "is_new_question": false }, @@ -19427,8 +19818,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 6976, - "total_submitted": 19672, + "total_acs": 7010, + "total_submitted": 19785, "frontend_question_id": 1932, "is_new_question": false }, @@ -19450,8 +19841,8 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 27097, - "total_submitted": 50998, + "total_acs": 27511, + "total_submitted": 51691, "frontend_question_id": 1930, "is_new_question": false }, @@ -19473,8 +19864,8 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 490230, - "total_submitted": 546343, + "total_acs": 497898, + "total_submitted": 555218, "frontend_question_id": 1929, "is_new_question": false }, @@ -19496,8 +19887,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 20788, - "total_submitted": 37221, + "total_acs": 23553, + "total_submitted": 41875, "frontend_question_id": 1907, "is_new_question": false }, @@ -19519,8 +19910,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 2213, - "total_submitted": 4244, + "total_acs": 2277, + "total_submitted": 4375, "frontend_question_id": 2297, "is_new_question": false }, @@ -19542,8 +19933,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 10698, - "total_submitted": 22034, + "total_acs": 10766, + "total_submitted": 22143, "frontend_question_id": 1943, "is_new_question": false }, @@ -19565,8 +19956,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": 14866, - "total_submitted": 36180, + "total_acs": 14937, + "total_submitted": 36333, "frontend_question_id": 1942, "is_new_question": false }, @@ -19588,8 +19979,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": 70201, - "total_submitted": 91339, + "total_acs": 70930, + "total_submitted": 92252, "frontend_question_id": 1941, "is_new_question": false }, @@ -19611,8 +20002,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 1970, - "total_submitted": 4452, + "total_acs": 2015, + "total_submitted": 4506, "frontend_question_id": 1902, "is_new_question": false }, @@ -19634,8 +20025,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 6406, - "total_submitted": 23170, + "total_acs": 6418, + "total_submitted": 23201, "frontend_question_id": 1923, "is_new_question": false }, @@ -19657,8 +20048,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 33579, - "total_submitted": 80321, + "total_acs": 34317, + "total_submitted": 81863, "frontend_question_id": 1922, "is_new_question": false }, @@ -19680,8 +20071,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 23781, - "total_submitted": 62705, + "total_acs": 23945, + "total_submitted": 63034, "frontend_question_id": 1921, "is_new_question": false }, @@ -19703,8 +20094,8 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 375902, - "total_submitted": 418995, + "total_acs": 380274, + "total_submitted": 424077, "frontend_question_id": 1920, "is_new_question": false }, @@ -19726,8 +20117,8 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 43259, - "total_submitted": 84654, + "total_acs": 43852, + "total_submitted": 86148, "frontend_question_id": 1901, "is_new_question": false }, @@ -19749,8 +20140,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 5558, - "total_submitted": 12847, + "total_acs": 5578, + "total_submitted": 12883, "frontend_question_id": 1892, "is_new_question": false }, @@ -19772,8 +20163,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 52613, - "total_submitted": 108375, + "total_acs": 52764, + "total_submitted": 108652, "frontend_question_id": 1891, "is_new_question": false }, @@ -19795,8 +20186,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 12052, - "total_submitted": 26324, + "total_acs": 12192, + "total_submitted": 26611, "frontend_question_id": 1915, "is_new_question": false }, @@ -19818,8 +20209,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 11301, - "total_submitted": 23242, + "total_acs": 11331, + "total_submitted": 23296, "frontend_question_id": 1914, "is_new_question": false }, @@ -19841,8 +20232,8 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 93661, - "total_submitted": 115527, + "total_acs": 94451, + "total_submitted": 116493, "frontend_question_id": 1913, "is_new_question": false }, @@ -19864,8 +20255,8 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 65863, - "total_submitted": 84692, + "total_acs": 66490, + "total_submitted": 85517, "frontend_question_id": 1890, "is_new_question": false }, @@ -19887,8 +20278,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": 15800, - "total_submitted": 41741, + "total_acs": 15939, + "total_submitted": 42080, "frontend_question_id": 1928, "is_new_question": false }, @@ -19910,8 +20301,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 9126, - "total_submitted": 19543, + "total_acs": 9187, + "total_submitted": 19675, "frontend_question_id": 1927, "is_new_question": false }, @@ -19933,8 +20324,8 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 91764, - "total_submitted": 190840, + "total_acs": 93481, + "total_submitted": 194660, "frontend_question_id": 1926, "is_new_question": false }, @@ -19956,8 +20347,8 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 35618, - "total_submitted": 52838, + "total_acs": 35879, + "total_submitted": 53234, "frontend_question_id": 1925, "is_new_question": false }, @@ -19979,8 +20370,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 5007, - "total_submitted": 8440, + "total_acs": 5022, + "total_submitted": 8463, "frontend_question_id": 1885, "is_new_question": false }, @@ -20002,8 +20393,8 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 72859, - "total_submitted": 107802, + "total_acs": 73439, + "total_submitted": 108719, "frontend_question_id": 1905, "is_new_question": false }, @@ -20025,8 +20416,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 9875, - "total_submitted": 22456, + "total_acs": 9931, + "total_submitted": 22566, "frontend_question_id": 1906, "is_new_question": false }, @@ -20048,8 +20439,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": 19652, - "total_submitted": 44176, + "total_acs": 19706, + "total_submitted": 44333, "frontend_question_id": 1904, "is_new_question": false }, @@ -20071,8 +20462,8 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 74660, - "total_submitted": 130319, + "total_acs": 77037, + "total_submitted": 134150, "frontend_question_id": 1903, "is_new_question": false }, @@ -20094,8 +20485,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": 38194, - "total_submitted": 53300, + "total_acs": 38669, + "total_submitted": 53874, "frontend_question_id": 1884, "is_new_question": false }, @@ -20117,8 +20508,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 9748, - "total_submitted": 13832, + "total_acs": 9785, + "total_submitted": 13901, "frontend_question_id": 1875, "is_new_question": false }, @@ -20140,8 +20531,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 17111, - "total_submitted": 19095, + "total_acs": 17189, + "total_submitted": 19180, "frontend_question_id": 1874, "is_new_question": false }, @@ -20163,8 +20554,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": 4877, - "total_submitted": 9630, + "total_acs": 4896, + "total_submitted": 9679, "frontend_question_id": 1900, "is_new_question": false }, @@ -20186,8 +20577,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 24340, - "total_submitted": 58274, + "total_acs": 24532, + "total_submitted": 58616, "frontend_question_id": 1898, "is_new_question": false }, @@ -20209,8 +20600,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 36770, - "total_submitted": 56575, + "total_acs": 37598, + "total_submitted": 57832, "frontend_question_id": 1899, "is_new_question": false }, @@ -20232,8 +20623,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": 30978, - "total_submitted": 52419, + "total_acs": 31159, + "total_submitted": 52731, "frontend_question_id": 1897, "is_new_question": false }, @@ -20255,8 +20646,8 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 191380, - "total_submitted": 326928, + "total_acs": 195162, + "total_submitted": 333981, "frontend_question_id": 1873, "is_new_question": false }, @@ -20278,8 +20669,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 5345, - "total_submitted": 14867, + "total_acs": 5379, + "total_submitted": 14953, "frontend_question_id": 1912, "is_new_question": false }, @@ -20301,8 +20692,8 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 27645, - "total_submitted": 46670, + "total_acs": 27964, + "total_submitted": 47224, "frontend_question_id": 1911, "is_new_question": false }, @@ -20324,8 +20715,8 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 75283, - "total_submitted": 99612, + "total_acs": 77063, + "total_submitted": 101893, "frontend_question_id": 1910, "is_new_question": false }, @@ -20347,8 +20738,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": 50653, - "total_submitted": 192213, + "total_acs": 51215, + "total_submitted": 193957, "frontend_question_id": 1909, "is_new_question": false }, @@ -20370,8 +20761,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": 26413, - "total_submitted": 45811, + "total_acs": 26462, + "total_submitted": 45909, "frontend_question_id": 1868, "is_new_question": false }, @@ -20393,8 +20784,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 11385, - "total_submitted": 36251, + "total_acs": 11430, + "total_submitted": 36357, "frontend_question_id": 1889, "is_new_question": false }, @@ -20416,8 +20807,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": 20721, - "total_submitted": 52714, + "total_acs": 20953, + "total_submitted": 53293, "frontend_question_id": 1888, "is_new_question": false }, @@ -20439,8 +20830,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": 22328, - "total_submitted": 35673, + "total_acs": 22406, + "total_submitted": 35790, "frontend_question_id": 1887, "is_new_question": false }, @@ -20462,8 +20853,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": 57287, - "total_submitted": 101970, + "total_acs": 57659, + "total_submitted": 102590, "frontend_question_id": 1886, "is_new_question": false }, @@ -20485,8 +20876,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 14185, - "total_submitted": 19720, + "total_acs": 14246, + "total_submitted": 19850, "frontend_question_id": 1867, "is_new_question": false }, @@ -20508,8 +20899,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": 5966, - "total_submitted": 15880, + "total_acs": 6016, + "total_submitted": 16022, "frontend_question_id": 1883, "is_new_question": false }, @@ -20531,8 +20922,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 27041, - "total_submitted": 68247, + "total_acs": 27242, + "total_submitted": 68753, "frontend_question_id": 1882, "is_new_question": false }, @@ -20554,8 +20945,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 24646, - "total_submitted": 66023, + "total_acs": 24754, + "total_submitted": 66230, "frontend_question_id": 1881, "is_new_question": false }, @@ -20577,8 +20968,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": 55379, - "total_submitted": 75081, + "total_acs": 55710, + "total_submitted": 75494, "frontend_question_id": 1880, "is_new_question": false }, @@ -20600,8 +20991,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 6432, - "total_submitted": 9522, + "total_acs": 6458, + "total_submitted": 9556, "frontend_question_id": 1858, "is_new_question": false }, @@ -20623,8 +21014,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": 3518, - "total_submitted": 6519, + "total_acs": 3530, + "total_submitted": 6539, "frontend_question_id": 1896, "is_new_question": false }, @@ -20646,8 +21037,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": 1292, - "total_submitted": 2543, + "total_acs": 1299, + "total_submitted": 2577, "frontend_question_id": 2247, "is_new_question": false }, @@ -20669,8 +21060,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": 31180, - "total_submitted": 69686, + "total_acs": 31303, + "total_submitted": 69914, "frontend_question_id": 1894, "is_new_question": false }, @@ -20692,8 +21083,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": 34139, - "total_submitted": 68308, + "total_acs": 34374, + "total_submitted": 68845, "frontend_question_id": 1893, "is_new_question": false }, @@ -20715,8 +21106,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 11056, - "total_submitted": 12821, + "total_acs": 11105, + "total_submitted": 12883, "frontend_question_id": 1853, "is_new_question": false }, @@ -20738,8 +21129,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 6155, - "total_submitted": 8672, + "total_acs": 6179, + "total_submitted": 8706, "frontend_question_id": 1852, "is_new_question": false }, @@ -20761,8 +21152,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 8072, - "total_submitted": 15395, + "total_acs": 8138, + "total_submitted": 15512, "frontend_question_id": 1872, "is_new_question": false }, @@ -20784,8 +21175,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 37275, - "total_submitted": 149923, + "total_acs": 37671, + "total_submitted": 151539, "frontend_question_id": 1871, "is_new_question": false }, @@ -20807,8 +21198,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 90567, - "total_submitted": 192122, + "total_acs": 91352, + "total_submitted": 194010, "frontend_question_id": 1870, "is_new_question": false }, @@ -20830,8 +21221,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": 40716, - "total_submitted": 67498, + "total_acs": 40892, + "total_submitted": 67768, "frontend_question_id": 1869, "is_new_question": false }, @@ -20853,8 +21244,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 9098, - "total_submitted": 19778, + "total_acs": 9198, + "total_submitted": 19953, "frontend_question_id": 1843, "is_new_question": false }, @@ -20876,8 +21267,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 5060, - "total_submitted": 9547, + "total_acs": 5076, + "total_submitted": 9580, "frontend_question_id": 1842, "is_new_question": false }, @@ -20899,8 +21290,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": 11866, - "total_submitted": 21148, + "total_acs": 11966, + "total_submitted": 21312, "frontend_question_id": 1866, "is_new_question": false }, @@ -20922,8 +21313,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 21658, - "total_submitted": 43023, + "total_acs": 21759, + "total_submitted": 43195, "frontend_question_id": 1865, "is_new_question": false }, @@ -20945,8 +21336,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": 23574, - "total_submitted": 55060, + "total_acs": 23712, + "total_submitted": 55363, "frontend_question_id": 1864, "is_new_question": false }, @@ -20968,8 +21359,8 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 60137, - "total_submitted": 74803, + "total_acs": 60616, + "total_submitted": 75374, "frontend_question_id": 1863, "is_new_question": false }, @@ -20991,8 +21382,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": 5696, - "total_submitted": 8339, + "total_acs": 5768, + "total_submitted": 8454, "frontend_question_id": 2046, "is_new_question": false }, @@ -21014,8 +21405,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 11666, - "total_submitted": 21574, + "total_acs": 11721, + "total_submitted": 21693, "frontend_question_id": 1841, "is_new_question": false }, @@ -21037,8 +21428,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": 13124, - "total_submitted": 27813, + "total_acs": 13177, + "total_submitted": 27909, "frontend_question_id": 1878, "is_new_question": false }, @@ -21060,8 +21451,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 11802, - "total_submitted": 25673, + "total_acs": 11890, + "total_submitted": 25829, "frontend_question_id": 1879, "is_new_question": false }, @@ -21083,8 +21474,8 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 78233, - "total_submitted": 98126, + "total_acs": 78756, + "total_submitted": 98784, "frontend_question_id": 1877, "is_new_question": false }, @@ -21106,8 +21497,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": 87957, - "total_submitted": 122341, + "total_acs": 89182, + "total_submitted": 123953, "frontend_question_id": 1876, "is_new_question": false }, @@ -21129,8 +21520,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": 57831, - "total_submitted": 112558, + "total_acs": 58218, + "total_submitted": 113434, "frontend_question_id": 1857, "is_new_question": false }, @@ -21152,8 +21543,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 22846, - "total_submitted": 60230, + "total_acs": 23027, + "total_submitted": 60721, "frontend_question_id": 1856, "is_new_question": false }, @@ -21175,8 +21566,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": 44112, - "total_submitted": 82666, + "total_acs": 44300, + "total_submitted": 82995, "frontend_question_id": 1855, "is_new_question": false }, @@ -21198,8 +21589,8 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 52487, - "total_submitted": 87319, + "total_acs": 53077, + "total_submitted": 88246, "frontend_question_id": 1854, "is_new_question": false }, @@ -21221,8 +21612,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": 24662, - "total_submitted": 34792, + "total_acs": 24790, + "total_submitted": 34960, "frontend_question_id": 1836, "is_new_question": false }, @@ -21244,8 +21635,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 14279, - "total_submitted": 17418, + "total_acs": 14371, + "total_submitted": 17550, "frontend_question_id": 1831, "is_new_question": false }, @@ -21267,8 +21658,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 3735, - "total_submitted": 7530, + "total_acs": 3751, + "total_submitted": 7565, "frontend_question_id": 1826, "is_new_question": false }, @@ -21290,8 +21681,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": 1788, - "total_submitted": 3474, + "total_acs": 1809, + "total_submitted": 3532, "frontend_question_id": 1989, "is_new_question": false }, @@ -21313,8 +21704,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": 18671, - "total_submitted": 26217, + "total_acs": 18747, + "total_submitted": 26330, "frontend_question_id": 1850, "is_new_question": false }, @@ -21336,8 +21727,8 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 20494, - "total_submitted": 42164, + "total_acs": 20918, + "total_submitted": 43027, "frontend_question_id": 1851, "is_new_question": false }, @@ -21359,8 +21750,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": 21036, - "total_submitted": 62243, + "total_acs": 21214, + "total_submitted": 62598, "frontend_question_id": 1849, "is_new_question": false }, @@ -21382,8 +21773,8 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 36244, - "total_submitted": 63992, + "total_acs": 36497, + "total_submitted": 64509, "frontend_question_id": 1848, "is_new_question": false }, @@ -21405,8 +21796,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": 16932, - "total_submitted": 19086, + "total_acs": 17108, + "total_submitted": 19295, "frontend_question_id": 1821, "is_new_question": false }, @@ -21428,8 +21819,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 43637, - "total_submitted": 66356, + "total_acs": 43944, + "total_submitted": 66758, "frontend_question_id": 1861, "is_new_question": false }, @@ -21451,8 +21842,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 16529, - "total_submitted": 22991, + "total_acs": 16623, + "total_submitted": 23124, "frontend_question_id": 1860, "is_new_question": false }, @@ -21474,8 +21865,8 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 126068, - "total_submitted": 151277, + "total_acs": 127248, + "total_submitted": 152682, "frontend_question_id": 1859, "is_new_question": false }, @@ -21497,8 +21888,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 5545, - "total_submitted": 11246, + "total_acs": 5561, + "total_submitted": 11285, "frontend_question_id": 1820, "is_new_question": false }, @@ -21520,8 +21911,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 6392, - "total_submitted": 17808, + "total_acs": 6423, + "total_submitted": 17894, "frontend_question_id": 1840, "is_new_question": false }, @@ -21543,8 +21934,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": 26343, - "total_submitted": 53924, + "total_acs": 26488, + "total_submitted": 54167, "frontend_question_id": 1839, "is_new_question": false }, @@ -21566,8 +21957,8 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 50269, - "total_submitted": 126409, + "total_acs": 51364, + "total_submitted": 129120, "frontend_question_id": 1838, "is_new_question": false }, @@ -21589,8 +21980,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 43331, - "total_submitted": 56268, + "total_acs": 43654, + "total_submitted": 56691, "frontend_question_id": 1837, "is_new_question": false }, @@ -21612,8 +22003,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 13093, - "total_submitted": 20992, + "total_acs": 13145, + "total_submitted": 21076, "frontend_question_id": 1811, "is_new_question": false }, @@ -21635,8 +22026,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": 16124, - "total_submitted": 26510, + "total_acs": 16246, + "total_submitted": 26699, "frontend_question_id": 1835, "is_new_question": false }, @@ -21658,8 +22049,8 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 91450, - "total_submitted": 200594, + "total_acs": 91858, + "total_submitted": 201676, "frontend_question_id": 1834, "is_new_question": false }, @@ -21681,8 +22072,8 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 144805, - "total_submitted": 196155, + "total_acs": 145130, + "total_submitted": 196598, "frontend_question_id": 1833, "is_new_question": false }, @@ -21704,8 +22095,8 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 252749, - "total_submitted": 303833, + "total_acs": 255342, + "total_submitted": 307076, "frontend_question_id": 1832, "is_new_question": false }, @@ -21727,8 +22118,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": 2494, - "total_submitted": 4566, + "total_acs": 2498, + "total_submitted": 4577, "frontend_question_id": 1810, "is_new_question": false }, @@ -21750,8 +22141,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 13604, - "total_submitted": 23244, + "total_acs": 13651, + "total_submitted": 23339, "frontend_question_id": 1809, "is_new_question": false }, @@ -21773,8 +22164,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 7622, - "total_submitted": 21024, + "total_acs": 7666, + "total_submitted": 21100, "frontend_question_id": 1847, "is_new_question": false }, @@ -21796,8 +22187,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 20714, - "total_submitted": 35016, + "total_acs": 20822, + "total_submitted": 35186, "frontend_question_id": 1846, "is_new_question": false }, @@ -21819,8 +22210,8 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 35398, - "total_submitted": 53168, + "total_acs": 35754, + "total_submitted": 53605, "frontend_question_id": 1845, "is_new_question": false }, @@ -21842,8 +22233,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 67653, - "total_submitted": 84257, + "total_acs": 68179, + "total_submitted": 84905, "frontend_question_id": 1844, "is_new_question": false }, @@ -21865,8 +22256,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 10964, - "total_submitted": 30787, + "total_acs": 11091, + "total_submitted": 31044, "frontend_question_id": 1825, "is_new_question": false }, @@ -21888,8 +22279,8 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 32249, - "total_submitted": 65011, + "total_acs": 32687, + "total_submitted": 65874, "frontend_question_id": 1824, "is_new_question": false }, @@ -21911,8 +22302,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": 102249, - "total_submitted": 131004, + "total_acs": 103188, + "total_submitted": 132188, "frontend_question_id": 1823, "is_new_question": false }, @@ -21934,8 +22325,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": 286198, - "total_submitted": 436786, + "total_acs": 287754, + "total_submitted": 439302, "frontend_question_id": 1822, "is_new_question": false }, @@ -21957,8 +22348,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 12741, - "total_submitted": 21363, + "total_acs": 12845, + "total_submitted": 21532, "frontend_question_id": 1804, "is_new_question": false }, @@ -21980,8 +22371,8 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 97945, - "total_submitted": 113913, + "total_acs": 100318, + "total_submitted": 116698, "frontend_question_id": 1795, "is_new_question": false }, @@ -22003,8 +22394,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 7832, - "total_submitted": 19788, + "total_acs": 7882, + "total_submitted": 19909, "frontend_question_id": 1819, "is_new_question": false }, @@ -22026,8 +22417,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 22233, - "total_submitted": 72657, + "total_acs": 22355, + "total_submitted": 73090, "frontend_question_id": 1818, "is_new_question": false }, @@ -22049,8 +22440,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 49840, - "total_submitted": 62043, + "total_acs": 50103, + "total_submitted": 62364, "frontend_question_id": 1817, "is_new_question": false }, @@ -22072,8 +22463,8 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 117215, - "total_submitted": 140338, + "total_acs": 118784, + "total_submitted": 142121, "frontend_question_id": 1816, "is_new_question": false }, @@ -22095,8 +22486,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": 1678, - "total_submitted": 2572, + "total_acs": 1683, + "total_submitted": 2584, "frontend_question_id": 1794, "is_new_question": false }, @@ -22118,8 +22509,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 31554, - "total_submitted": 44141, + "total_acs": 33369, + "total_submitted": 47559, "frontend_question_id": 1789, "is_new_question": false }, @@ -22141,8 +22532,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": 3382, - "total_submitted": 6812, + "total_acs": 3397, + "total_submitted": 6848, "frontend_question_id": 1830, "is_new_question": false }, @@ -22164,8 +22555,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 24293, - "total_submitted": 31585, + "total_acs": 24441, + "total_submitted": 31775, "frontend_question_id": 1829, "is_new_question": false }, @@ -22187,8 +22578,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": 65039, - "total_submitted": 75527, + "total_acs": 65474, + "total_submitted": 76026, "frontend_question_id": 1828, "is_new_question": false }, @@ -22210,8 +22601,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": 72971, - "total_submitted": 93223, + "total_acs": 73642, + "total_submitted": 93994, "frontend_question_id": 1827, "is_new_question": false }, @@ -22233,8 +22624,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 1906, - "total_submitted": 2842, + "total_acs": 1919, + "total_submitted": 2857, "frontend_question_id": 1788, "is_new_question": false }, @@ -22256,8 +22647,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 5807, - "total_submitted": 18072, + "total_acs": 5823, + "total_submitted": 18101, "frontend_question_id": 1808, "is_new_question": false }, @@ -22279,8 +22670,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": 16727, - "total_submitted": 23125, + "total_acs": 16837, + "total_submitted": 23255, "frontend_question_id": 1806, "is_new_question": false }, @@ -22302,8 +22693,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": 26188, - "total_submitted": 39350, + "total_acs": 26296, + "total_submitted": 39497, "frontend_question_id": 1807, "is_new_question": false }, @@ -22325,8 +22716,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": 39404, - "total_submitted": 106861, + "total_acs": 39599, + "total_submitted": 107332, "frontend_question_id": 1805, "is_new_question": false }, @@ -22348,8 +22739,8 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 20220, - "total_submitted": 23604, + "total_acs": 20317, + "total_submitted": 23781, "frontend_question_id": 1783, "is_new_question": false }, @@ -22371,8 +22762,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 4786, - "total_submitted": 12243, + "total_acs": 4797, + "total_submitted": 12261, "frontend_question_id": 1778, "is_new_question": false }, @@ -22394,8 +22785,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": 14411, - "total_submitted": 25470, + "total_acs": 14468, + "total_submitted": 25546, "frontend_question_id": 1798, "is_new_question": false }, @@ -22417,8 +22808,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": 63664, - "total_submitted": 158385, + "total_acs": 64022, + "total_submitted": 159525, "frontend_question_id": 1802, "is_new_question": false }, @@ -22440,8 +22831,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 17296, - "total_submitted": 35387, + "total_acs": 17383, + "total_submitted": 35554, "frontend_question_id": 1801, "is_new_question": false }, @@ -22463,8 +22854,8 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 45800, - "total_submitted": 73220, + "total_acs": 46069, + "total_submitted": 73623, "frontend_question_id": 1800, "is_new_question": false }, @@ -22486,8 +22877,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 17577, - "total_submitted": 21215, + "total_acs": 17661, + "total_submitted": 21319, "frontend_question_id": 1777, "is_new_question": false }, @@ -22509,8 +22900,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 26391, - "total_submitted": 62940, + "total_acs": 26593, + "total_submitted": 63425, "frontend_question_id": 1814, "is_new_question": false }, @@ -22532,8 +22923,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": 5772, - "total_submitted": 14407, + "total_acs": 5802, + "total_submitted": 14473, "frontend_question_id": 1815, "is_new_question": false }, @@ -22555,8 +22946,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 14110, - "total_submitted": 42494, + "total_acs": 14210, + "total_submitted": 42798, "frontend_question_id": 1813, "is_new_question": false }, @@ -22578,8 +22969,8 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 63746, - "total_submitted": 81890, + "total_acs": 64314, + "total_submitted": 82572, "frontend_question_id": 1812, "is_new_question": false }, @@ -22601,8 +22992,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 5299, - "total_submitted": 8118, + "total_acs": 5320, + "total_submitted": 8168, "frontend_question_id": 1772, "is_new_question": false }, @@ -22624,8 +23015,8 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 21517, - "total_submitted": 40077, + "total_acs": 21652, + "total_submitted": 40284, "frontend_question_id": 1793, "is_new_question": false }, @@ -22647,8 +23038,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 19643, - "total_submitted": 37247, + "total_acs": 19709, + "total_submitted": 37368, "frontend_question_id": 1792, "is_new_question": false }, @@ -22670,8 +23061,8 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 149038, - "total_submitted": 178618, + "total_acs": 150583, + "total_submitted": 180470, "frontend_question_id": 1791, "is_new_question": false }, @@ -22693,8 +23084,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": 90889, - "total_submitted": 200642, + "total_acs": 91235, + "total_submitted": 201406, "frontend_question_id": 1790, "is_new_question": false }, @@ -22716,8 +23107,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": 9185, - "total_submitted": 11616, + "total_acs": 9274, + "total_submitted": 11739, "frontend_question_id": 1767, "is_new_question": false }, @@ -22739,8 +23130,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": 4645, - "total_submitted": 11743, + "total_acs": 4663, + "total_submitted": 11794, "frontend_question_id": 1787, "is_new_question": false }, @@ -22762,8 +23153,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": 19916, - "total_submitted": 51010, + "total_acs": 20097, + "total_submitted": 51461, "frontend_question_id": 1786, "is_new_question": false }, @@ -22785,8 +23176,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": 18679, - "total_submitted": 43600, + "total_acs": 18778, + "total_submitted": 43807, "frontend_question_id": 1785, "is_new_question": false }, @@ -22808,8 +23199,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": 35390, - "total_submitted": 89245, + "total_acs": 35633, + "total_submitted": 89898, "frontend_question_id": 1784, "is_new_question": false }, @@ -22831,8 +23222,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 146496, - "total_submitted": 185417, + "total_acs": 147531, + "total_submitted": 186697, "frontend_question_id": 1762, "is_new_question": false }, @@ -22854,8 +23245,8 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 449151, - "total_submitted": 493199, + "total_acs": 467790, + "total_submitted": 515211, "frontend_question_id": 1757, "is_new_question": false }, @@ -22877,8 +23268,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": 7041, - "total_submitted": 14890, + "total_acs": 7158, + "total_submitted": 15099, "frontend_question_id": 1803, "is_new_question": false }, @@ -22900,8 +23291,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 54963, - "total_submitted": 94052, + "total_acs": 55132, + "total_submitted": 94391, "frontend_question_id": 1799, "is_new_question": false }, @@ -22923,8 +23314,8 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 17881, - "total_submitted": 31432, + "total_acs": 17923, + "total_submitted": 31516, "frontend_question_id": 1797, "is_new_question": false }, @@ -22946,8 +23337,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 43610, - "total_submitted": 88192, + "total_acs": 44016, + "total_submitted": 88951, "frontend_question_id": 1796, "is_new_question": false }, @@ -22969,8 +23360,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 10761, - "total_submitted": 13787, + "total_acs": 10823, + "total_submitted": 13862, "frontend_question_id": 1756, "is_new_question": false }, @@ -22992,8 +23383,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 22806, - "total_submitted": 42308, + "total_acs": 22909, + "total_submitted": 42458, "frontend_question_id": 1776, "is_new_question": false }, @@ -23015,8 +23406,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": 25797, - "total_submitted": 48410, + "total_acs": 25895, + "total_submitted": 48600, "frontend_question_id": 1775, "is_new_question": false }, @@ -23038,8 +23429,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 26481, - "total_submitted": 55945, + "total_acs": 26632, + "total_submitted": 56225, "frontend_question_id": 1774, "is_new_question": false }, @@ -23061,8 +23452,8 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 172125, - "total_submitted": 203856, + "total_acs": 173657, + "total_submitted": 205649, "frontend_question_id": 1773, "is_new_question": false }, @@ -23084,8 +23475,8 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 16815, - "total_submitted": 25379, + "total_acs": 16922, + "total_submitted": 25595, "frontend_question_id": 1747, "is_new_question": false }, @@ -23107,8 +23498,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 9691, - "total_submitted": 27449, + "total_acs": 9743, + "total_submitted": 27586, "frontend_question_id": 1771, "is_new_question": false }, @@ -23130,8 +23521,8 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 98002, - "total_submitted": 255854, + "total_acs": 98446, + "total_submitted": 256511, "frontend_question_id": 1770, "is_new_question": false }, @@ -23153,8 +23544,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": 107573, - "total_submitted": 125996, + "total_acs": 108176, + "total_submitted": 126696, "frontend_question_id": 1769, "is_new_question": false }, @@ -23176,8 +23567,8 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 327616, - "total_submitted": 408132, + "total_acs": 344922, + "total_submitted": 431009, "frontend_question_id": 1768, "is_new_question": false }, @@ -23199,8 +23590,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 8501, - "total_submitted": 13670, + "total_acs": 8517, + "total_submitted": 13691, "frontend_question_id": 1746, "is_new_question": false }, @@ -23222,8 +23613,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": 96674, - "total_submitted": 109091, + "total_acs": 99173, + "total_submitted": 112139, "frontend_question_id": 1741, "is_new_question": false }, @@ -23245,8 +23636,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 5744, - "total_submitted": 14753, + "total_acs": 5850, + "total_submitted": 14918, "frontend_question_id": 1782, "is_new_question": false }, @@ -23268,8 +23659,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 27185, - "total_submitted": 43454, + "total_acs": 28122, + "total_submitted": 44766, "frontend_question_id": 1781, "is_new_question": false }, @@ -23291,8 +23682,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": 34843, - "total_submitted": 52454, + "total_acs": 35091, + "total_submitted": 52775, "frontend_question_id": 1780, "is_new_question": false }, @@ -23314,8 +23705,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": 102019, - "total_submitted": 151184, + "total_acs": 102307, + "total_submitted": 151557, "frontend_question_id": 1779, "is_new_question": false }, @@ -23337,8 +23728,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": 20283, - "total_submitted": 48586, + "total_acs": 20441, + "total_submitted": 48875, "frontend_question_id": 1761, "is_new_question": false }, @@ -23360,8 +23751,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": 33686, - "total_submitted": 55777, + "total_acs": 33972, + "total_submitted": 56264, "frontend_question_id": 1760, "is_new_question": false }, @@ -23383,8 +23774,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 26509, - "total_submitted": 54321, + "total_acs": 26633, + "total_submitted": 54519, "frontend_question_id": 1759, "is_new_question": false }, @@ -23406,8 +23797,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": 36709, - "total_submitted": 63211, + "total_acs": 36902, + "total_submitted": 63563, "frontend_question_id": 1758, "is_new_question": false }, @@ -23429,8 +23820,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 19282, - "total_submitted": 27722, + "total_acs": 19362, + "total_submitted": 27823, "frontend_question_id": 1740, "is_new_question": false }, @@ -23452,8 +23843,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": 35498, - "total_submitted": 76975, + "total_acs": 37501, + "total_submitted": 81474, "frontend_question_id": 1731, "is_new_question": false }, @@ -23475,8 +23866,8 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 13482, - "total_submitted": 36072, + "total_acs": 13634, + "total_submitted": 36408, "frontend_question_id": 1755, "is_new_question": false }, @@ -23498,8 +23889,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 19339, - "total_submitted": 41564, + "total_acs": 19438, + "total_submitted": 41769, "frontend_question_id": 1754, "is_new_question": false }, @@ -23521,8 +23912,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 34037, - "total_submitted": 50637, + "total_acs": 34318, + "total_submitted": 51008, "frontend_question_id": 1753, "is_new_question": false }, @@ -23544,8 +23935,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": 117815, - "total_submitted": 233534, + "total_acs": 121622, + "total_submitted": 240622, "frontend_question_id": 1752, "is_new_question": false }, @@ -23567,8 +23958,8 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 86359, - "total_submitted": 123393, + "total_acs": 88873, + "total_submitted": 127198, "frontend_question_id": 1729, "is_new_question": false }, @@ -23590,8 +23981,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 22269, - "total_submitted": 36632, + "total_acs": 22426, + "total_submitted": 36872, "frontend_question_id": 1765, "is_new_question": false }, @@ -23613,8 +24004,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 7977, - "total_submitted": 20092, + "total_acs": 8015, + "total_submitted": 20187, "frontend_question_id": 1766, "is_new_question": false }, @@ -23636,8 +24027,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": 13403, - "total_submitted": 25206, + "total_acs": 13452, + "total_submitted": 25305, "frontend_question_id": 1764, "is_new_question": false }, @@ -23659,8 +24050,8 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 41647, - "total_submitted": 68397, + "total_acs": 42055, + "total_submitted": 69160, "frontend_question_id": 1763, "is_new_question": false }, @@ -23682,8 +24073,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": 9485, - "total_submitted": 28403, + "total_acs": 9540, + "total_submitted": 28528, "frontend_question_id": 1744, "is_new_question": false }, @@ -23705,8 +24096,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 21269, - "total_submitted": 47660, + "total_acs": 21407, + "total_submitted": 48024, "frontend_question_id": 1745, "is_new_question": false }, @@ -23728,8 +24119,8 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 37041, - "total_submitted": 53755, + "total_acs": 37310, + "total_submitted": 54107, "frontend_question_id": 1743, "is_new_question": false }, @@ -23751,8 +24142,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": 2516, - "total_submitted": 4801, + "total_acs": 2534, + "total_submitted": 4833, "frontend_question_id": 1724, "is_new_question": false }, @@ -23774,8 +24165,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 13011, - "total_submitted": 17191, + "total_acs": 13054, + "total_submitted": 17257, "frontend_question_id": 1715, "is_new_question": false }, @@ -23797,8 +24188,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 6278, - "total_submitted": 12070, + "total_acs": 6299, + "total_submitted": 12106, "frontend_question_id": 1739, "is_new_question": false }, @@ -23820,8 +24211,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 19513, - "total_submitted": 31882, + "total_acs": 19635, + "total_submitted": 32057, "frontend_question_id": 1738, "is_new_question": false }, @@ -23843,8 +24234,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": 11944, - "total_submitted": 33629, + "total_acs": 12013, + "total_submitted": 33761, "frontend_question_id": 1737, "is_new_question": false }, @@ -23866,8 +24257,8 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 30753, - "total_submitted": 72770, + "total_acs": 30917, + "total_submitted": 73139, "frontend_question_id": 1736, "is_new_question": false }, @@ -23889,8 +24280,8 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 18371, - "total_submitted": 24998, + "total_acs": 18465, + "total_submitted": 25188, "frontend_question_id": 1709, "is_new_question": false }, @@ -23912,8 +24303,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": 66924, - "total_submitted": 105371, + "total_acs": 67399, + "total_submitted": 106359, "frontend_question_id": 1751, "is_new_question": false }, @@ -23935,8 +24326,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": 20327, - "total_submitted": 45843, + "total_acs": 20464, + "total_submitted": 46135, "frontend_question_id": 1750, "is_new_question": false }, @@ -23958,8 +24349,8 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 33056, - "total_submitted": 56145, + "total_acs": 33259, + "total_submitted": 56485, "frontend_question_id": 1749, "is_new_question": false }, @@ -23981,8 +24372,8 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 127886, - "total_submitted": 167103, + "total_acs": 128995, + "total_submitted": 168514, "frontend_question_id": 1748, "is_new_question": false }, @@ -24004,8 +24395,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 7483, - "total_submitted": 11700, + "total_acs": 7518, + "total_submitted": 11746, "frontend_question_id": 1708, "is_new_question": false }, @@ -24027,8 +24418,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 15731, - "total_submitted": 25491, + "total_acs": 15774, + "total_submitted": 25553, "frontend_question_id": 1727, "is_new_question": false }, @@ -24050,8 +24441,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": 54873, - "total_submitted": 74665, + "total_acs": 55206, + "total_submitted": 75120, "frontend_question_id": 1742, "is_new_question": false }, @@ -24073,8 +24464,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": 60131, - "total_submitted": 76543, + "total_acs": 60424, + "total_submitted": 76921, "frontend_question_id": 1725, "is_new_question": false }, @@ -24096,8 +24487,8 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 35837, - "total_submitted": 43848, + "total_acs": 35973, + "total_submitted": 44030, "frontend_question_id": 1699, "is_new_question": false }, @@ -24119,8 +24510,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 16139, - "total_submitted": 33163, + "total_acs": 16221, + "total_submitted": 33356, "frontend_question_id": 1722, "is_new_question": false }, @@ -24142,8 +24533,8 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 122744, - "total_submitted": 143079, + "total_acs": 123797, + "total_submitted": 144277, "frontend_question_id": 1720, "is_new_question": false }, @@ -24165,8 +24556,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": 8343, - "total_submitted": 13231, + "total_acs": 8368, + "total_submitted": 13276, "frontend_question_id": 1698, "is_new_question": false }, @@ -24188,8 +24579,8 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 88924, - "total_submitted": 101713, + "total_acs": 90888, + "total_submitted": 104039, "frontend_question_id": 1693, "is_new_question": false }, @@ -24211,8 +24602,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": 4883, - "total_submitted": 9692, + "total_acs": 4906, + "total_submitted": 9757, "frontend_question_id": 1735, "is_new_question": false }, @@ -24234,8 +24625,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 13049, - "total_submitted": 20545, + "total_acs": 13126, + "total_submitted": 20658, "frontend_question_id": 1734, "is_new_question": false }, @@ -24257,8 +24648,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 8078, - "total_submitted": 19412, + "total_acs": 8116, + "total_submitted": 19484, "frontend_question_id": 1733, "is_new_question": false }, @@ -24280,8 +24671,8 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 228313, - "total_submitted": 277314, + "total_acs": 232974, + "total_submitted": 282882, "frontend_question_id": 1732, "is_new_question": false }, @@ -24303,8 +24694,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 9868, - "total_submitted": 20385, + "total_acs": 9913, + "total_submitted": 20480, "frontend_question_id": 1713, "is_new_question": false }, @@ -24326,8 +24717,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": 29431, - "total_submitted": 89986, + "total_acs": 29560, + "total_submitted": 90335, "frontend_question_id": 1712, "is_new_question": false }, @@ -24349,8 +24740,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 33829, - "total_submitted": 114611, + "total_acs": 33999, + "total_submitted": 115050, "frontend_question_id": 1711, "is_new_question": false }, @@ -24372,8 +24763,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 274379, - "total_submitted": 372406, + "total_acs": 275376, + "total_submitted": 373736, "frontend_question_id": 1710, "is_new_question": false }, @@ -24395,8 +24786,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 2253, - "total_submitted": 3615, + "total_acs": 2263, + "total_submitted": 3628, "frontend_question_id": 1692, "is_new_question": false }, @@ -24418,8 +24809,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 103390, - "total_submitted": 120013, + "total_acs": 115510, + "total_submitted": 134326, "frontend_question_id": 1683, "is_new_question": false }, @@ -24441,8 +24832,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": 16930, - "total_submitted": 35754, + "total_acs": 17132, + "total_submitted": 36063, "frontend_question_id": 1707, "is_new_question": false }, @@ -24464,8 +24855,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": 23005, - "total_submitted": 54715, + "total_acs": 23205, + "total_submitted": 55153, "frontend_question_id": 1723, "is_new_question": false }, @@ -24487,8 +24878,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 19817, - "total_submitted": 51901, + "total_acs": 19887, + "total_submitted": 52053, "frontend_question_id": 1705, "is_new_question": false }, @@ -24510,8 +24901,8 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 195565, - "total_submitted": 252320, + "total_acs": 196123, + "total_submitted": 253058, "frontend_question_id": 1704, "is_new_question": false }, @@ -24533,8 +24924,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 4894, - "total_submitted": 9778, + "total_acs": 4913, + "total_submitted": 9817, "frontend_question_id": 1682, "is_new_question": false }, @@ -24556,8 +24947,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 15009, - "total_submitted": 39393, + "total_acs": 15057, + "total_submitted": 39546, "frontend_question_id": 1677, "is_new_question": false }, @@ -24579,8 +24970,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": 3750, - "total_submitted": 8572, + "total_acs": 3766, + "total_submitted": 8597, "frontend_question_id": 1719, "is_new_question": false }, @@ -24602,8 +24993,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 11716, - "total_submitted": 22254, + "total_acs": 11787, + "total_submitted": 22378, "frontend_question_id": 1718, "is_new_question": false }, @@ -24625,8 +25016,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 12998, - "total_submitted": 28040, + "total_acs": 13053, + "total_submitted": 28122, "frontend_question_id": 1717, "is_new_question": false }, @@ -24648,8 +25039,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 42683, - "total_submitted": 64177, + "total_acs": 43024, + "total_submitted": 64572, "frontend_question_id": 1716, "is_new_question": false }, @@ -24671,8 +25062,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": 31163, - "total_submitted": 39476, + "total_acs": 31460, + "total_submitted": 39875, "frontend_question_id": 1676, "is_new_question": false }, @@ -24694,8 +25085,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": 46745, - "total_submitted": 74400, + "total_acs": 46894, + "total_submitted": 74680, "frontend_question_id": 1697, "is_new_question": false }, @@ -24717,8 +25108,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 100678, - "total_submitted": 219545, + "total_acs": 100999, + "total_submitted": 220460, "frontend_question_id": 1696, "is_new_question": false }, @@ -24740,8 +25131,8 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 113617, - "total_submitted": 197196, + "total_acs": 114026, + "total_submitted": 197890, "frontend_question_id": 1695, "is_new_question": false }, @@ -24763,8 +25154,8 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 32653, - "total_submitted": 50137, + "total_acs": 32793, + "total_submitted": 50349, "frontend_question_id": 1694, "is_new_question": false }, @@ -24786,8 +25177,8 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 133017, - "total_submitted": 206390, + "total_acs": 137493, + "total_submitted": 214031, "frontend_question_id": 1667, "is_new_question": false }, @@ -24809,8 +25200,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": 3520, - "total_submitted": 4834, + "total_acs": 3550, + "total_submitted": 4871, "frontend_question_id": 1666, "is_new_question": false }, @@ -24832,8 +25223,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": 1190, - "total_submitted": 2421, + "total_acs": 1204, + "total_submitted": 2451, "frontend_question_id": 1714, "is_new_question": false }, @@ -24855,8 +25246,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 32077, - "total_submitted": 55302, + "total_acs": 32224, + "total_submitted": 55531, "frontend_question_id": 1690, "is_new_question": false }, @@ -24878,8 +25269,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": 184107, - "total_submitted": 206976, + "total_acs": 184975, + "total_submitted": 207938, "frontend_question_id": 1689, "is_new_question": false }, @@ -24901,8 +25292,8 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 105881, - "total_submitted": 127490, + "total_acs": 106551, + "total_submitted": 128290, "frontend_question_id": 1688, "is_new_question": false }, @@ -24924,8 +25315,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": 8943, - "total_submitted": 20976, + "total_acs": 9194, + "total_submitted": 21608, "frontend_question_id": 1703, "is_new_question": false }, @@ -24947,8 +25338,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 11356, - "total_submitted": 24525, + "total_acs": 11434, + "total_submitted": 24664, "frontend_question_id": 1702, "is_new_question": false }, @@ -24970,8 +25361,8 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 25740, - "total_submitted": 40899, + "total_acs": 25891, + "total_submitted": 41123, "frontend_question_id": 1701, "is_new_question": false }, @@ -24993,8 +25384,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": 74115, - "total_submitted": 106273, + "total_acs": 75267, + "total_submitted": 107839, "frontend_question_id": 1700, "is_new_question": false }, @@ -25016,8 +25407,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 56786, - "total_submitted": 81039, + "total_acs": 61393, + "total_submitted": 87906, "frontend_question_id": 1661, "is_new_question": false }, @@ -25039,8 +25430,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 88069, - "total_submitted": 154445, + "total_acs": 88138, + "total_submitted": 154540, "frontend_question_id": 1680, "is_new_question": false }, @@ -25062,8 +25453,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 7539, - "total_submitted": 19518, + "total_acs": 7552, + "total_submitted": 19551, "frontend_question_id": 1681, "is_new_question": false }, @@ -25085,8 +25476,8 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 157083, - "total_submitted": 279124, + "total_acs": 161090, + "total_submitted": 286758, "frontend_question_id": 1679, "is_new_question": false }, @@ -25108,8 +25499,8 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 198519, - "total_submitted": 228859, + "total_acs": 200237, + "total_submitted": 230854, "frontend_question_id": 1678, "is_new_question": false }, @@ -25131,8 +25522,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 14623, - "total_submitted": 20199, + "total_acs": 14705, + "total_submitted": 20313, "frontend_question_id": 1660, "is_new_question": false }, @@ -25154,8 +25545,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 5684, - "total_submitted": 8489, + "total_acs": 5715, + "total_submitted": 8548, "frontend_question_id": 1651, "is_new_question": false }, @@ -25177,8 +25568,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 89687, - "total_submitted": 165024, + "total_acs": 89885, + "total_submitted": 165431, "frontend_question_id": 1675, "is_new_question": false }, @@ -25200,8 +25591,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 7769, - "total_submitted": 20057, + "total_acs": 7812, + "total_submitted": 20148, "frontend_question_id": 1674, "is_new_question": false }, @@ -25223,8 +25614,8 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 54768, - "total_submitted": 110798, + "total_acs": 55068, + "total_submitted": 111359, "frontend_question_id": 1673, "is_new_question": false }, @@ -25246,8 +25637,8 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 669594, - "total_submitted": 764858, + "total_acs": 676413, + "total_submitted": 772567, "frontend_question_id": 1672, "is_new_question": false }, @@ -25269,8 +25660,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": 162979, - "total_submitted": 210130, + "total_acs": 163823, + "total_submitted": 211145, "frontend_question_id": 1650, "is_new_question": false }, @@ -25292,8 +25683,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 5489, - "total_submitted": 14099, + "total_acs": 5512, + "total_submitted": 14184, "frontend_question_id": 1687, "is_new_question": false }, @@ -25315,8 +25706,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 15982, - "total_submitted": 28735, + "total_acs": 16131, + "total_submitted": 28954, "frontend_question_id": 1686, "is_new_question": false }, @@ -25338,8 +25729,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": 29149, - "total_submitted": 46457, + "total_acs": 29354, + "total_submitted": 46786, "frontend_question_id": 1685, "is_new_question": false }, @@ -25361,8 +25752,8 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 140345, - "total_submitted": 170185, + "total_acs": 141443, + "total_submitted": 171447, "frontend_question_id": 1684, "is_new_question": false }, @@ -25384,8 +25775,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 5495, - "total_submitted": 14229, + "total_acs": 5524, + "total_submitted": 14318, "frontend_question_id": 1645, "is_new_question": false }, @@ -25407,8 +25798,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 15044, - "total_submitted": 26452, + "total_acs": 15154, + "total_submitted": 26624, "frontend_question_id": 1665, "is_new_question": false }, @@ -25430,8 +25821,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 32317, - "total_submitted": 51093, + "total_acs": 32494, + "total_submitted": 51368, "frontend_question_id": 1664, "is_new_question": false }, @@ -25453,8 +25844,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": 89248, - "total_submitted": 133826, + "total_acs": 89406, + "total_submitted": 134060, "frontend_question_id": 1663, "is_new_question": false }, @@ -25476,8 +25867,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": 292206, - "total_submitted": 349460, + "total_acs": 294244, + "total_submitted": 351742, "frontend_question_id": 1662, "is_new_question": false }, @@ -25499,8 +25890,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": 62155, - "total_submitted": 101351, + "total_acs": 62429, + "total_submitted": 101688, "frontend_question_id": 1644, "is_new_question": false }, @@ -25522,8 +25913,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 7161, - "total_submitted": 14723, + "total_acs": 7194, + "total_submitted": 14796, "frontend_question_id": 1635, "is_new_question": false }, @@ -25545,8 +25936,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 4786, - "total_submitted": 12186, + "total_acs": 4811, + "total_submitted": 12263, "frontend_question_id": 1659, "is_new_question": false }, @@ -25568,8 +25959,8 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 130215, - "total_submitted": 237427, + "total_acs": 133234, + "total_submitted": 243640, "frontend_question_id": 1657, "is_new_question": false }, @@ -25591,8 +25982,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": 113178, - "total_submitted": 300880, + "total_acs": 113449, + "total_submitted": 301595, "frontend_question_id": 1658, "is_new_question": false }, @@ -25614,8 +26005,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 71842, - "total_submitted": 84677, + "total_acs": 72273, + "total_submitted": 85201, "frontend_question_id": 1656, "is_new_question": false }, @@ -25637,8 +26028,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": 9337, - "total_submitted": 17036, + "total_acs": 9350, + "total_submitted": 17059, "frontend_question_id": 1634, "is_new_question": false }, @@ -25660,8 +26051,8 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 48229, - "total_submitted": 80364, + "total_acs": 51224, + "total_submitted": 85956, "frontend_question_id": 1633, "is_new_question": false }, @@ -25683,8 +26074,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 23454, - "total_submitted": 61944, + "total_acs": 23512, + "total_submitted": 62061, "frontend_question_id": 1649, "is_new_question": false }, @@ -25706,8 +26097,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 35784, - "total_submitted": 118282, + "total_acs": 35842, + "total_submitted": 118556, "frontend_question_id": 1648, "is_new_question": false }, @@ -25729,8 +26120,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": 176982, - "total_submitted": 300404, + "total_acs": 177558, + "total_submitted": 301417, "frontend_question_id": 1647, "is_new_question": false }, @@ -25752,8 +26143,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 94487, - "total_submitted": 188521, + "total_acs": 95276, + "total_submitted": 190062, "frontend_question_id": 1646, "is_new_question": false }, @@ -25775,8 +26166,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": 24804, - "total_submitted": 29938, + "total_acs": 24865, + "total_submitted": 30013, "frontend_question_id": 1628, "is_new_question": false }, @@ -25798,8 +26189,8 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 22657, - "total_submitted": 40019, + "total_acs": 22831, + "total_submitted": 40316, "frontend_question_id": 1670, "is_new_question": false }, @@ -25821,8 +26212,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": 24333, - "total_submitted": 57961, + "total_acs": 24605, + "total_submitted": 58691, "frontend_question_id": 1671, "is_new_question": false }, @@ -25844,8 +26235,8 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 76436, - "total_submitted": 104335, + "total_acs": 77105, + "total_submitted": 105308, "frontend_question_id": 1669, "is_new_question": false }, @@ -25867,8 +26258,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 37627, - "total_submitted": 96523, + "total_acs": 37892, + "total_submitted": 97226, "frontend_question_id": 1668, "is_new_question": false }, @@ -25890,8 +26281,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": 17708, - "total_submitted": 20728, + "total_acs": 17761, + "total_submitted": 20840, "frontend_question_id": 1623, "is_new_question": false }, @@ -25913,8 +26304,8 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 117805, - "total_submitted": 243306, + "total_acs": 118195, + "total_submitted": 244045, "frontend_question_id": 1642, "is_new_question": false }, @@ -25936,8 +26327,8 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 164332, - "total_submitted": 211479, + "total_acs": 165209, + "total_submitted": 212500, "frontend_question_id": 1641, "is_new_question": false }, @@ -25959,8 +26350,8 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 76599, - "total_submitted": 136103, + "total_acs": 76802, + "total_submitted": 136406, "frontend_question_id": 1640, "is_new_question": false }, @@ -25982,8 +26373,8 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 16380, - "total_submitted": 22104, + "total_acs": 16446, + "total_submitted": 22208, "frontend_question_id": 1613, "is_new_question": false }, @@ -26005,8 +26396,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 11770, - "total_submitted": 29852, + "total_acs": 11865, + "total_submitted": 30111, "frontend_question_id": 1655, "is_new_question": false }, @@ -26028,8 +26419,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 37951, - "total_submitted": 129793, + "total_acs": 38176, + "total_submitted": 130463, "frontend_question_id": 1654, "is_new_question": false }, @@ -26051,8 +26442,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 36616, - "total_submitted": 62116, + "total_acs": 36804, + "total_submitted": 62460, "frontend_question_id": 1653, "is_new_question": false }, @@ -26074,8 +26465,8 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 33238, - "total_submitted": 52961, + "total_acs": 33415, + "total_submitted": 53180, "frontend_question_id": 1652, "is_new_question": false }, @@ -26097,8 +26488,8 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 159794, - "total_submitted": 283314, + "total_acs": 161550, + "total_submitted": 285991, "frontend_question_id": 1631, "is_new_question": false }, @@ -26120,8 +26511,8 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 55902, - "total_submitted": 69222, + "total_acs": 56191, + "total_submitted": 69574, "frontend_question_id": 1630, "is_new_question": false }, @@ -26143,8 +26534,8 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 91523, - "total_submitted": 154886, + "total_acs": 91797, + "total_submitted": 155372, "frontend_question_id": 1629, "is_new_question": false }, @@ -26166,8 +26557,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": 6541, - "total_submitted": 9304, + "total_acs": 6557, + "total_submitted": 9326, "frontend_question_id": 1612, "is_new_question": false }, @@ -26189,8 +26580,8 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 27549, - "total_submitted": 50748, + "total_acs": 27706, + "total_submitted": 51054, "frontend_question_id": 1607, "is_new_question": false }, @@ -26212,8 +26603,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 75380, - "total_submitted": 148615, + "total_acs": 75627, + "total_submitted": 149161, "frontend_question_id": 1626, "is_new_question": false }, @@ -26235,8 +26626,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 13096, - "total_submitted": 19897, + "total_acs": 13130, + "total_submitted": 19937, "frontend_question_id": 1625, "is_new_question": false }, @@ -26258,8 +26649,8 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 44402, - "total_submitted": 75155, + "total_acs": 44698, + "total_submitted": 75592, "frontend_question_id": 1624, "is_new_question": false }, @@ -26281,8 +26672,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": 21834, - "total_submitted": 28899, + "total_acs": 21861, + "total_submitted": 28939, "frontend_question_id": 1602, "is_new_question": false }, @@ -26304,8 +26695,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": 50812, - "total_submitted": 95725, + "total_acs": 51069, + "total_submitted": 96329, "frontend_question_id": 1639, "is_new_question": false }, @@ -26327,8 +26718,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": 25965, - "total_submitted": 36507, + "total_acs": 26103, + "total_submitted": 36689, "frontend_question_id": 1638, "is_new_question": false }, @@ -26350,8 +26741,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": 41993, - "total_submitted": 49738, + "total_acs": 42265, + "total_submitted": 50047, "frontend_question_id": 1637, "is_new_question": false }, @@ -26373,8 +26764,8 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 102635, - "total_submitted": 146424, + "total_acs": 103451, + "total_submitted": 147443, "frontend_question_id": 1636, "is_new_question": false }, @@ -26396,8 +26787,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": 8667, - "total_submitted": 13131, + "total_acs": 8737, + "total_submitted": 13240, "frontend_question_id": 1617, "is_new_question": false }, @@ -26419,8 +26810,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 21161, - "total_submitted": 68221, + "total_acs": 21522, + "total_submitted": 69406, "frontend_question_id": 1616, "is_new_question": false }, @@ -26442,8 +26833,8 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 66897, - "total_submitted": 113201, + "total_acs": 125164, + "total_submitted": 191637, "frontend_question_id": 1615, "is_new_question": false }, @@ -26465,8 +26856,8 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 143804, - "total_submitted": 176007, + "total_acs": 146038, + "total_submitted": 178759, "frontend_question_id": 1614, "is_new_question": false }, @@ -26488,8 +26879,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": 12250, - "total_submitted": 19580, + "total_acs": 12279, + "total_submitted": 19632, "frontend_question_id": 1597, "is_new_question": false }, @@ -26511,8 +26902,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": 28125, - "total_submitted": 34643, + "total_acs": 28209, + "total_submitted": 34833, "frontend_question_id": 1596, "is_new_question": false }, @@ -26534,8 +26925,8 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 79900, - "total_submitted": 94506, + "total_acs": 80595, + "total_submitted": 95365, "frontend_question_id": 1587, "is_new_question": false }, @@ -26557,8 +26948,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 37688, - "total_submitted": 100909, + "total_acs": 37796, + "total_submitted": 101182, "frontend_question_id": 1610, "is_new_question": false }, @@ -26580,8 +26971,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": 13415, - "total_submitted": 21188, + "total_acs": 13537, + "total_submitted": 21361, "frontend_question_id": 1611, "is_new_question": false }, @@ -26603,8 +26994,8 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 47248, - "total_submitted": 85829, + "total_acs": 47542, + "total_submitted": 86313, "frontend_question_id": 1609, "is_new_question": false }, @@ -26626,8 +27017,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": 70699, - "total_submitted": 117397, + "total_acs": 71071, + "total_submitted": 118040, "frontend_question_id": 1608, "is_new_question": false }, @@ -26649,8 +27040,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 13007, - "total_submitted": 18427, + "total_acs": 13029, + "total_submitted": 18454, "frontend_question_id": 1586, "is_new_question": false }, @@ -26672,8 +27063,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 10367, - "total_submitted": 63177, + "total_acs": 10411, + "total_submitted": 63331, "frontend_question_id": 1622, "is_new_question": false }, @@ -26695,8 +27086,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 6131, - "total_submitted": 15584, + "total_acs": 6147, + "total_submitted": 15617, "frontend_question_id": 1728, "is_new_question": false }, @@ -26718,8 +27109,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 7832, - "total_submitted": 20888, + "total_acs": 7858, + "total_submitted": 20966, "frontend_question_id": 1620, "is_new_question": false }, @@ -26741,8 +27132,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": 8740, - "total_submitted": 20516, + "total_acs": 8779, + "total_submitted": 20578, "frontend_question_id": 1621, "is_new_question": false }, @@ -26764,8 +27155,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": 146687, - "total_submitted": 187002, + "total_acs": 153075, + "total_submitted": 196166, "frontend_question_id": 1581, "is_new_question": false }, @@ -26787,8 +27178,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 51451, - "total_submitted": 79122, + "total_acs": 51602, + "total_submitted": 79356, "frontend_question_id": 1601, "is_new_question": false }, @@ -26810,8 +27201,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 14688, - "total_submitted": 22972, + "total_acs": 14735, + "total_submitted": 23046, "frontend_question_id": 1600, "is_new_question": false }, @@ -26833,8 +27224,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": 11265, - "total_submitted": 25825, + "total_acs": 11276, + "total_submitted": 25847, "frontend_question_id": 1599, "is_new_question": false }, @@ -26856,8 +27247,8 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 63769, - "total_submitted": 98634, + "total_acs": 64176, + "total_submitted": 99309, "frontend_question_id": 1598, "is_new_question": false }, @@ -26879,8 +27270,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 4142, - "total_submitted": 6491, + "total_acs": 4151, + "total_submitted": 6504, "frontend_question_id": 1580, "is_new_question": false }, @@ -26902,8 +27293,8 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 36621, - "total_submitted": 41526, + "total_acs": 36773, + "total_submitted": 41710, "frontend_question_id": 1571, "is_new_question": false }, @@ -26925,8 +27316,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": 7900, - "total_submitted": 16669, + "total_acs": 7938, + "total_submitted": 16768, "frontend_question_id": 1595, "is_new_question": false }, @@ -26948,8 +27339,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": 21525, - "total_submitted": 64891, + "total_acs": 21629, + "total_submitted": 65156, "frontend_question_id": 1594, "is_new_question": false }, @@ -26971,8 +27362,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": 27139, - "total_submitted": 48750, + "total_acs": 27279, + "total_submitted": 48972, "frontend_question_id": 1593, "is_new_question": false }, @@ -26994,8 +27385,8 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 49732, - "total_submitted": 114799, + "total_acs": 49925, + "total_submitted": 115235, "frontend_question_id": 1592, "is_new_question": false }, @@ -27017,8 +27408,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 190192, - "total_submitted": 210711, + "total_acs": 191005, + "total_submitted": 211619, "frontend_question_id": 1570, "is_new_question": false }, @@ -27040,8 +27431,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 19514, - "total_submitted": 23632, + "total_acs": 19572, + "total_submitted": 23714, "frontend_question_id": 1565, "is_new_question": false }, @@ -27063,8 +27454,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": 35784, - "total_submitted": 46078, + "total_acs": 35947, + "total_submitted": 46299, "frontend_question_id": 1605, "is_new_question": false }, @@ -27086,8 +27477,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": 14154, - "total_submitted": 32739, + "total_acs": 14237, + "total_submitted": 32907, "frontend_question_id": 1606, "is_new_question": false }, @@ -27109,8 +27500,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": 31220, - "total_submitted": 67780, + "total_acs": 31317, + "total_submitted": 68092, "frontend_question_id": 1604, "is_new_question": false }, @@ -27132,8 +27523,8 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 246447, - "total_submitted": 279025, + "total_acs": 247341, + "total_submitted": 280062, "frontend_question_id": 1603, "is_new_question": false }, @@ -27155,8 +27546,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": 7316, - "total_submitted": 15242, + "total_acs": 7346, + "total_submitted": 15337, "frontend_question_id": 1585, "is_new_question": false }, @@ -27178,8 +27569,8 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 174777, - "total_submitted": 272264, + "total_acs": 177626, + "total_submitted": 276329, "frontend_question_id": 1584, "is_new_question": false }, @@ -27201,8 +27592,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 25064, - "total_submitted": 40953, + "total_acs": 25121, + "total_submitted": 41052, "frontend_question_id": 1583, "is_new_question": false }, @@ -27224,8 +27615,8 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 43265, - "total_submitted": 66441, + "total_acs": 43559, + "total_submitted": 66900, "frontend_question_id": 1582, "is_new_question": false }, @@ -27247,8 +27638,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 14614, - "total_submitted": 21807, + "total_acs": 14640, + "total_submitted": 21847, "frontend_question_id": 1564, "is_new_question": false }, @@ -27270,8 +27661,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 14777, - "total_submitted": 28594, + "total_acs": 14813, + "total_submitted": 28664, "frontend_question_id": 1555, "is_new_question": false }, @@ -27293,8 +27684,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": 53746, - "total_submitted": 82877, + "total_acs": 53973, + "total_submitted": 83325, "frontend_question_id": 1579, "is_new_question": false }, @@ -27316,8 +27707,8 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 151302, - "total_submitted": 239573, + "total_acs": 151685, + "total_submitted": 240238, "frontend_question_id": 1578, "is_new_question": false }, @@ -27339,8 +27730,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": 18899, - "total_submitted": 46785, + "total_acs": 18965, + "total_submitted": 46927, "frontend_question_id": 1577, "is_new_question": false }, @@ -27362,8 +27753,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": 54667, - "total_submitted": 115105, + "total_acs": 54874, + "total_submitted": 115622, "frontend_question_id": 1576, "is_new_question": false }, @@ -27385,8 +27776,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 22671, - "total_submitted": 53810, + "total_acs": 22729, + "total_submitted": 53968, "frontend_question_id": 1554, "is_new_question": false }, @@ -27408,8 +27799,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 9434, - "total_submitted": 16004, + "total_acs": 9501, + "total_submitted": 16142, "frontend_question_id": 1591, "is_new_question": false }, @@ -27431,8 +27822,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 16963, - "total_submitted": 45393, + "total_acs": 17057, + "total_submitted": 45619, "frontend_question_id": 1589, "is_new_question": false }, @@ -27454,8 +27845,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 23020, - "total_submitted": 82190, + "total_acs": 23134, + "total_submitted": 82652, "frontend_question_id": 1590, "is_new_question": false }, @@ -27477,8 +27868,8 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 168562, - "total_submitted": 202604, + "total_acs": 169617, + "total_submitted": 203860, "frontend_question_id": 1588, "is_new_question": false }, @@ -27500,8 +27891,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": 51267, - "total_submitted": 95295, + "total_acs": 51469, + "total_submitted": 95769, "frontend_question_id": 1569, "is_new_question": false }, @@ -27523,8 +27914,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": 11676, - "total_submitted": 25400, + "total_acs": 11741, + "total_submitted": 25572, "frontend_question_id": 1568, "is_new_question": false }, @@ -27546,8 +27937,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": 85844, - "total_submitted": 194612, + "total_acs": 86139, + "total_submitted": 195252, "frontend_question_id": 1567, "is_new_question": false }, @@ -27569,8 +27960,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": 30843, - "total_submitted": 71424, + "total_acs": 30973, + "total_submitted": 71728, "frontend_question_id": 1566, "is_new_question": false }, @@ -27592,8 +27983,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": 24296, - "total_submitted": 36731, + "total_acs": 24389, + "total_submitted": 36939, "frontend_question_id": 1549, "is_new_question": false }, @@ -27615,8 +28006,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": 16772, - "total_submitted": 28454, + "total_acs": 16776, + "total_submitted": 28458, "frontend_question_id": 1548, "is_new_question": false }, @@ -27638,8 +28029,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 18240, - "total_submitted": 30332, + "total_acs": 18296, + "total_submitted": 30434, "frontend_question_id": 1543, "is_new_question": false }, @@ -27661,8 +28052,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 17218, - "total_submitted": 42536, + "total_acs": 17342, + "total_submitted": 42812, "frontend_question_id": 1563, "is_new_question": false }, @@ -27684,8 +28075,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 16897, - "total_submitted": 39376, + "total_acs": 16941, + "total_submitted": 39484, "frontend_question_id": 1562, "is_new_question": false }, @@ -27707,8 +28098,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": 70563, - "total_submitted": 88799, + "total_acs": 71065, + "total_submitted": 89370, "frontend_question_id": 1561, "is_new_question": false }, @@ -27730,8 +28121,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": 27709, - "total_submitted": 47445, + "total_acs": 27924, + "total_submitted": 47809, "frontend_question_id": 1560, "is_new_question": false }, @@ -27753,8 +28144,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": 3483, - "total_submitted": 4906, + "total_acs": 3499, + "total_submitted": 4930, "frontend_question_id": 1538, "is_new_question": false }, @@ -27776,8 +28167,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 53904, - "total_submitted": 81381, + "total_acs": 54113, + "total_submitted": 81767, "frontend_question_id": 1575, "is_new_question": false }, @@ -27799,8 +28190,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": 26961, - "total_submitted": 71906, + "total_acs": 27081, + "total_submitted": 72177, "frontend_question_id": 1574, "is_new_question": false }, @@ -27822,8 +28213,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": 25541, - "total_submitted": 78883, + "total_acs": 25610, + "total_submitted": 79098, "frontend_question_id": 1573, "is_new_question": false }, @@ -27845,8 +28236,8 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 283910, - "total_submitted": 343115, + "total_acs": 286121, + "total_submitted": 345753, "frontend_question_id": 1572, "is_new_question": false }, @@ -27868,8 +28259,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": 31249, - "total_submitted": 89757, + "total_acs": 31446, + "total_submitted": 90266, "frontend_question_id": 1553, "is_new_question": false }, @@ -27891,8 +28282,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 45061, - "total_submitted": 76207, + "total_acs": 45532, + "total_submitted": 76830, "frontend_question_id": 1552, "is_new_question": false }, @@ -27914,8 +28305,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 86653, - "total_submitted": 105886, + "total_acs": 87033, + "total_submitted": 106311, "frontend_question_id": 1551, "is_new_question": false }, @@ -27937,8 +28328,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": 11097, - "total_submitted": 19832, + "total_acs": 11172, + "total_submitted": 19967, "frontend_question_id": 1533, "is_new_question": false }, @@ -27960,8 +28351,8 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 23896, - "total_submitted": 34624, + "total_acs": 23992, + "total_submitted": 34782, "frontend_question_id": 1532, "is_new_question": false }, @@ -27983,8 +28374,8 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 129012, - "total_submitted": 320800, + "total_acs": 133020, + "total_submitted": 329689, "frontend_question_id": 1527, "is_new_question": false }, @@ -28006,8 +28397,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 95119, - "total_submitted": 152429, + "total_acs": 96553, + "total_submitted": 154827, "frontend_question_id": 1547, "is_new_question": false }, @@ -28029,8 +28420,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 12075, - "total_submitted": 28659, + "total_acs": 12178, + "total_submitted": 28864, "frontend_question_id": 1542, "is_new_question": false }, @@ -28052,8 +28443,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": 35511, - "total_submitted": 60474, + "total_acs": 35712, + "total_submitted": 60843, "frontend_question_id": 1545, "is_new_question": false }, @@ -28075,8 +28466,8 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 146174, - "total_submitted": 231486, + "total_acs": 147104, + "total_submitted": 232980, "frontend_question_id": 1544, "is_new_question": false }, @@ -28098,8 +28489,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 39434, - "total_submitted": 53510, + "total_acs": 39571, + "total_submitted": 53690, "frontend_question_id": 1522, "is_new_question": false }, @@ -28121,8 +28512,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 38122, - "total_submitted": 79178, + "total_acs": 41941, + "total_submitted": 86881, "frontend_question_id": 1517, "is_new_question": false }, @@ -28144,8 +28535,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 35338, - "total_submitted": 73156, + "total_acs": 35631, + "total_submitted": 73797, "frontend_question_id": 1559, "is_new_question": false }, @@ -28167,8 +28558,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": 19571, - "total_submitted": 30638, + "total_acs": 19635, + "total_submitted": 30748, "frontend_question_id": 1558, "is_new_question": false }, @@ -28190,8 +28581,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": 157922, - "total_submitted": 194172, + "total_acs": 158751, + "total_submitted": 195194, "frontend_question_id": 1557, "is_new_question": false }, @@ -28213,8 +28604,8 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 44316, - "total_submitted": 81810, + "total_acs": 44564, + "total_submitted": 82214, "frontend_question_id": 1556, "is_new_question": false }, @@ -28236,8 +28627,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 22878, - "total_submitted": 58351, + "total_acs": 23047, + "total_submitted": 58760, "frontend_question_id": 1537, "is_new_question": false }, @@ -28259,8 +28650,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": 13483, - "total_submitted": 28893, + "total_acs": 13535, + "total_submitted": 29099, "frontend_question_id": 1536, "is_new_question": false }, @@ -28282,8 +28673,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": 29774, - "total_submitted": 61396, + "total_acs": 29898, + "total_submitted": 61656, "frontend_question_id": 1535, "is_new_question": false }, @@ -28305,8 +28696,8 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 102473, - "total_submitted": 126671, + "total_acs": 102990, + "total_submitted": 127293, "frontend_question_id": 1534, "is_new_question": false }, @@ -28328,8 +28719,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": 2070, - "total_submitted": 3281, + "total_acs": 2081, + "total_submitted": 3302, "frontend_question_id": 1516, "is_new_question": false }, @@ -28351,8 +28742,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 36907, - "total_submitted": 52513, + "total_acs": 37039, + "total_submitted": 52751, "frontend_question_id": 1511, "is_new_question": false }, @@ -28374,8 +28765,8 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 36285, - "total_submitted": 59121, + "total_acs": 36553, + "total_submitted": 59515, "frontend_question_id": 1530, "is_new_question": false }, @@ -28397,8 +28788,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 42263, - "total_submitted": 58272, + "total_acs": 42634, + "total_submitted": 58751, "frontend_question_id": 1529, "is_new_question": false }, @@ -28420,8 +28811,8 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 316465, - "total_submitted": 373417, + "total_acs": 318946, + "total_submitted": 376394, "frontend_question_id": 1528, "is_new_question": false }, @@ -28443,8 +28834,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 30944, - "total_submitted": 39423, + "total_acs": 31102, + "total_submitted": 39610, "frontend_question_id": 1506, "is_new_question": false }, @@ -28466,8 +28857,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": 25547, - "total_submitted": 53899, + "total_acs": 25649, + "total_submitted": 54075, "frontend_question_id": 1546, "is_new_question": false }, @@ -28489,8 +28880,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": 40408, - "total_submitted": 81164, + "total_acs": 40635, + "total_submitted": 81652, "frontend_question_id": 1541, "is_new_question": false }, @@ -28512,8 +28903,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 16761, - "total_submitted": 49826, + "total_acs": 16836, + "total_submitted": 50003, "frontend_question_id": 1540, "is_new_question": false }, @@ -28535,8 +28926,8 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 325892, - "total_submitted": 554572, + "total_acs": 329001, + "total_submitted": 559377, "frontend_question_id": 1539, "is_new_question": false }, @@ -28558,8 +28949,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": 9096, - "total_submitted": 20796, + "total_acs": 9124, + "total_submitted": 20861, "frontend_question_id": 1521, "is_new_question": false }, @@ -28581,8 +28972,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 14051, - "total_submitted": 36683, + "total_acs": 14175, + "total_submitted": 36946, "frontend_question_id": 1520, "is_new_question": false }, @@ -28604,8 +28995,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": 80690, - "total_submitted": 146272, + "total_acs": 80825, + "total_submitted": 146546, "frontend_question_id": 1519, "is_new_question": false }, @@ -28627,8 +29018,8 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 65782, - "total_submitted": 108871, + "total_acs": 66130, + "total_submitted": 109453, "frontend_question_id": 1518, "is_new_question": false }, @@ -28650,8 +29041,8 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 33376, - "total_submitted": 67267, + "total_acs": 33513, + "total_submitted": 67562, "frontend_question_id": 1501, "is_new_question": false }, @@ -28673,8 +29064,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 3699, - "total_submitted": 8351, + "total_acs": 3705, + "total_submitted": 8365, "frontend_question_id": 1500, "is_new_question": false }, @@ -28696,8 +29087,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 26460, - "total_submitted": 53858, + "total_acs": 26542, + "total_submitted": 54047, "frontend_question_id": 1495, "is_new_question": false }, @@ -28719,8 +29110,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 12637, - "total_submitted": 34101, + "total_acs": 12699, + "total_submitted": 34332, "frontend_question_id": 1515, "is_new_question": false }, @@ -28742,8 +29133,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 44003, - "total_submitted": 89334, + "total_acs": 44047, + "total_submitted": 89465, "frontend_question_id": 1531, "is_new_question": false }, @@ -28765,8 +29156,8 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 38773, - "total_submitted": 85047, + "total_acs": 38952, + "total_submitted": 85343, "frontend_question_id": 1513, "is_new_question": false }, @@ -28788,8 +29179,8 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 478110, - "total_submitted": 541939, + "total_acs": 482032, + "total_submitted": 546333, "frontend_question_id": 1512, "is_new_question": false }, @@ -28811,8 +29202,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 26117, - "total_submitted": 31336, + "total_acs": 26201, + "total_submitted": 31447, "frontend_question_id": 1490, "is_new_question": false }, @@ -28834,8 +29225,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": 33677, - "total_submitted": 48604, + "total_acs": 33904, + "total_submitted": 48897, "frontend_question_id": 1526, "is_new_question": false }, @@ -28857,8 +29248,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": 92549, - "total_submitted": 134681, + "total_acs": 92890, + "total_submitted": 135201, "frontend_question_id": 1525, "is_new_question": false }, @@ -28880,8 +29271,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": 34045, - "total_submitted": 78637, + "total_acs": 34211, + "total_submitted": 79018, "frontend_question_id": 1524, "is_new_question": false }, @@ -28903,8 +29294,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": 310595, - "total_submitted": 626988, + "total_acs": 311708, + "total_submitted": 629034, "frontend_question_id": 1523, "is_new_question": false }, @@ -28926,8 +29317,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": 9044, - "total_submitted": 23506, + "total_acs": 9111, + "total_submitted": 23634, "frontend_question_id": 1505, "is_new_question": false }, @@ -28949,8 +29340,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 46130, - "total_submitted": 80566, + "total_acs": 46352, + "total_submitted": 80968, "frontend_question_id": 1504, "is_new_question": false }, @@ -28972,8 +29363,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": 20579, - "total_submitted": 36021, + "total_acs": 20669, + "total_submitted": 36153, "frontend_question_id": 1503, "is_new_question": false }, @@ -28995,8 +29386,8 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 218552, - "total_submitted": 311802, + "total_acs": 219362, + "total_submitted": 313081, "frontend_question_id": 1502, "is_new_question": false }, @@ -29018,8 +29409,8 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 138506, - "total_submitted": 177902, + "total_acs": 141228, + "total_submitted": 181712, "frontend_question_id": 1484, "is_new_question": false }, @@ -29041,8 +29432,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 24335, - "total_submitted": 30189, + "total_acs": 24416, + "total_submitted": 30298, "frontend_question_id": 1485, "is_new_question": false }, @@ -29064,8 +29455,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 15862, - "total_submitted": 19945, + "total_acs": 15922, + "total_submitted": 20034, "frontend_question_id": 1479, "is_new_question": false }, @@ -29087,8 +29478,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 39124, - "total_submitted": 86876, + "total_acs": 39290, + "total_submitted": 87357, "frontend_question_id": 1499, "is_new_question": false }, @@ -29110,8 +29501,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": 101699, - "total_submitted": 229493, + "total_acs": 102431, + "total_submitted": 231366, "frontend_question_id": 1498, "is_new_question": false }, @@ -29133,8 +29524,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": 43006, - "total_submitted": 111302, + "total_acs": 43302, + "total_submitted": 112124, "frontend_question_id": 1497, "is_new_question": false }, @@ -29156,8 +29547,8 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 49314, - "total_submitted": 87969, + "total_acs": 49706, + "total_submitted": 88554, "frontend_question_id": 1496, "is_new_question": false }, @@ -29179,8 +29570,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": 27071, - "total_submitted": 36944, + "total_acs": 27170, + "total_submitted": 37070, "frontend_question_id": 1474, "is_new_question": false }, @@ -29202,8 +29593,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 67526, - "total_submitted": 112643, + "total_acs": 67762, + "total_submitted": 113131, "frontend_question_id": 1510, "is_new_question": false }, @@ -29225,8 +29616,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": 78603, - "total_submitted": 143776, + "total_acs": 78941, + "total_submitted": 144375, "frontend_question_id": 1509, "is_new_question": false }, @@ -29248,8 +29639,8 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 34427, - "total_submitted": 58514, + "total_acs": 34569, + "total_submitted": 58762, "frontend_question_id": 1508, "is_new_question": false }, @@ -29271,8 +29662,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": 12172, - "total_submitted": 23079, + "total_acs": 46526, + "total_submitted": 66463, "frontend_question_id": 1489, "is_new_question": false }, @@ -29294,8 +29685,8 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 32418, - "total_submitted": 121445, + "total_acs": 32560, + "total_submitted": 122009, "frontend_question_id": 1488, "is_new_question": false }, @@ -29317,8 +29708,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 30977, - "total_submitted": 84950, + "total_acs": 31073, + "total_submitted": 85148, "frontend_question_id": 1487, "is_new_question": false }, @@ -29340,8 +29731,8 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 164554, - "total_submitted": 193581, + "total_acs": 165557, + "total_submitted": 194678, "frontend_question_id": 1486, "is_new_question": false }, @@ -29363,8 +29754,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 45279, - "total_submitted": 54912, + "total_acs": 45397, + "total_submitted": 55041, "frontend_question_id": 1469, "is_new_question": false }, @@ -29386,8 +29777,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 21611, - "total_submitted": 27048, + "total_acs": 21698, + "total_submitted": 27153, "frontend_question_id": 1468, "is_new_question": false }, @@ -29409,8 +29800,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 15582, - "total_submitted": 22641, + "total_acs": 15605, + "total_submitted": 22676, "frontend_question_id": 1459, "is_new_question": false }, @@ -29432,8 +29823,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": 75254, - "total_submitted": 142554, + "total_acs": 77132, + "total_submitted": 146440, "frontend_question_id": 1482, "is_new_question": false }, @@ -29455,8 +29846,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": 101226, - "total_submitted": 181519, + "total_acs": 101893, + "total_submitted": 182561, "frontend_question_id": 1481, "is_new_question": false }, @@ -29478,8 +29869,8 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 1568089, - "total_submitted": 1805433, + "total_acs": 1577316, + "total_submitted": 1816805, "frontend_question_id": 1480, "is_new_question": false }, @@ -29501,8 +29892,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 15168, - "total_submitted": 50224, + "total_acs": 15250, + "total_submitted": 50591, "frontend_question_id": 1494, "is_new_question": false }, @@ -29524,8 +29915,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": 162336, - "total_submitted": 244891, + "total_acs": 166082, + "total_submitted": 250286, "frontend_question_id": 1493, "is_new_question": false }, @@ -29547,8 +29938,8 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 145720, - "total_submitted": 224387, + "total_acs": 148509, + "total_submitted": 228178, "frontend_question_id": 1492, "is_new_question": false }, @@ -29570,8 +29961,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": 311862, - "total_submitted": 490792, + "total_acs": 312796, + "total_submitted": 492246, "frontend_question_id": 1491, "is_new_question": false }, @@ -29593,8 +29984,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 57661, - "total_submitted": 93904, + "total_acs": 57858, + "total_submitted": 94255, "frontend_question_id": 1473, "is_new_question": false }, @@ -29616,8 +30007,8 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 188791, - "total_submitted": 242500, + "total_acs": 190296, + "total_submitted": 244534, "frontend_question_id": 1472, "is_new_question": false }, @@ -29639,8 +30030,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": 34883, - "total_submitted": 57464, + "total_acs": 35008, + "total_submitted": 57670, "frontend_question_id": 1471, "is_new_question": false }, @@ -29662,8 +30053,8 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 565545, - "total_submitted": 638193, + "total_acs": 569567, + "total_submitted": 642963, "frontend_question_id": 1470, "is_new_question": false }, @@ -29685,8 +30076,8 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 33126, - "total_submitted": 88685, + "total_acs": 33192, + "total_submitted": 88865, "frontend_question_id": 1454, "is_new_question": false }, @@ -29708,8 +30099,8 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 45504, - "total_submitted": 51231, + "total_acs": 45663, + "total_submitted": 51428, "frontend_question_id": 1445, "is_new_question": false }, @@ -29731,8 +30122,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": 7459, - "total_submitted": 12302, + "total_acs": 7485, + "total_submitted": 12343, "frontend_question_id": 1467, "is_new_question": false }, @@ -29754,8 +30145,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": 137617, - "total_submitted": 208718, + "total_acs": 139453, + "total_submitted": 211732, "frontend_question_id": 1466, "is_new_question": false }, @@ -29777,8 +30168,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": 162006, - "total_submitted": 396137, + "total_acs": 162185, + "total_submitted": 396549, "frontend_question_id": 1465, "is_new_question": false }, @@ -29800,8 +30191,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": 205239, - "total_submitted": 255492, + "total_acs": 206984, + "total_submitted": 257511, "frontend_question_id": 1464, "is_new_question": false }, @@ -29823,8 +30214,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": 44588, - "total_submitted": 121696, + "total_acs": 44693, + "total_submitted": 122057, "frontend_question_id": 1477, "is_new_question": false }, @@ -29846,8 +30237,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 94139, - "total_submitted": 106766, + "total_acs": 94514, + "total_submitted": 107178, "frontend_question_id": 1476, "is_new_question": false }, @@ -29869,8 +30260,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 21262, - "total_submitted": 38397, + "total_acs": 21375, + "total_submitted": 38636, "frontend_question_id": 1478, "is_new_question": false }, @@ -29892,8 +30283,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": 117179, - "total_submitted": 153162, + "total_acs": 118125, + "total_submitted": 154272, "frontend_question_id": 1475, "is_new_question": false }, @@ -29915,8 +30306,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 20847, - "total_submitted": 44144, + "total_acs": 20950, + "total_submitted": 44349, "frontend_question_id": 1458, "is_new_question": false }, @@ -29938,8 +30329,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": 116245, - "total_submitted": 172126, + "total_acs": 116399, + "total_submitted": 172382, "frontend_question_id": 1457, "is_new_question": false }, @@ -29961,8 +30352,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": 171722, - "total_submitted": 294762, + "total_acs": 176134, + "total_submitted": 302274, "frontend_question_id": 1456, "is_new_question": false }, @@ -29984,8 +30375,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": 67771, - "total_submitted": 105614, + "total_acs": 68096, + "total_submitted": 106134, "frontend_question_id": 1455, "is_new_question": false }, @@ -30007,8 +30398,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 23650, - "total_submitted": 32034, + "total_acs": 23771, + "total_submitted": 32218, "frontend_question_id": 1440, "is_new_question": false }, @@ -30030,8 +30421,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 20865, - "total_submitted": 27361, + "total_acs": 20924, + "total_submitted": 27453, "frontend_question_id": 1435, "is_new_question": false }, @@ -30053,8 +30444,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": 5431, - "total_submitted": 14661, + "total_acs": 5446, + "total_submitted": 14694, "frontend_question_id": 1453, "is_new_question": false }, @@ -30076,8 +30467,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": 21865, - "total_submitted": 38381, + "total_acs": 21928, + "total_submitted": 38468, "frontend_question_id": 1452, "is_new_question": false }, @@ -30099,8 +30490,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 46301, - "total_submitted": 72799, + "total_acs": 46475, + "total_submitted": 73049, "frontend_question_id": 1451, "is_new_question": false }, @@ -30122,8 +30513,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": 107590, - "total_submitted": 142055, + "total_acs": 108005, + "total_submitted": 142624, "frontend_question_id": 1450, "is_new_question": false }, @@ -30145,8 +30536,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 87684, - "total_submitted": 126013, + "total_acs": 88342, + "total_submitted": 126975, "frontend_question_id": 1463, "is_new_question": false }, @@ -30168,8 +30559,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 47200, - "total_submitted": 95824, + "total_acs": 47666, + "total_submitted": 96677, "frontend_question_id": 1462, "is_new_question": false }, @@ -30191,8 +30582,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": 112219, - "total_submitted": 198698, + "total_acs": 112526, + "total_submitted": 199232, "frontend_question_id": 1461, "is_new_question": false }, @@ -30214,8 +30605,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": 111036, - "total_submitted": 154374, + "total_acs": 111537, + "total_submitted": 155046, "frontend_question_id": 1460, "is_new_question": false }, @@ -30237,8 +30628,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": 63186, - "total_submitted": 99902, + "total_acs": 63415, + "total_submitted": 100321, "frontend_question_id": 1444, "is_new_question": false }, @@ -30260,8 +30651,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": 103717, - "total_submitted": 166163, + "total_acs": 104051, + "total_submitted": 166733, "frontend_question_id": 1443, "is_new_question": false }, @@ -30283,8 +30674,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": 33732, - "total_submitted": 44121, + "total_acs": 33906, + "total_submitted": 44332, "frontend_question_id": 1442, "is_new_question": false }, @@ -30306,8 +30697,8 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 76630, - "total_submitted": 106003, + "total_acs": 77024, + "total_submitted": 106487, "frontend_question_id": 1441, "is_new_question": false }, @@ -30329,8 +30720,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 23943, - "total_submitted": 28894, + "total_acs": 24018, + "total_submitted": 28994, "frontend_question_id": 1421, "is_new_question": false }, @@ -30352,8 +30743,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": 29929, - "total_submitted": 48749, + "total_acs": 30060, + "total_submitted": 48953, "frontend_question_id": 1439, "is_new_question": false }, @@ -30375,8 +30766,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": 114406, - "total_submitted": 234963, + "total_acs": 114843, + "total_submitted": 235755, "frontend_question_id": 1438, "is_new_question": false }, @@ -30398,8 +30789,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": 69394, - "total_submitted": 118903, + "total_acs": 69598, + "total_submitted": 119264, "frontend_question_id": 1437, "is_new_question": false }, @@ -30421,8 +30812,8 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 131749, - "total_submitted": 170785, + "total_acs": 132372, + "total_submitted": 171611, "frontend_question_id": 1436, "is_new_question": false }, @@ -30444,8 +30835,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": 22156, - "total_submitted": 36610, + "total_acs": 22235, + "total_submitted": 36754, "frontend_question_id": 1412, "is_new_question": false }, @@ -30467,8 +30858,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": 15562, - "total_submitted": 32596, + "total_acs": 15654, + "total_submitted": 32782, "frontend_question_id": 1449, "is_new_question": false }, @@ -30490,8 +30881,8 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 355076, - "total_submitted": 481369, + "total_acs": 359777, + "total_submitted": 488116, "frontend_question_id": 1448, "is_new_question": false }, @@ -30513,8 +30904,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 28204, - "total_submitted": 43036, + "total_acs": 28371, + "total_submitted": 43250, "frontend_question_id": 1447, "is_new_question": false }, @@ -30536,8 +30927,8 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 145339, - "total_submitted": 239293, + "total_acs": 145905, + "total_submitted": 240317, "frontend_question_id": 1446, "is_new_question": false }, @@ -30559,8 +30950,8 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 93559, - "total_submitted": 157604, + "total_acs": 94372, + "total_submitted": 159197, "frontend_question_id": 1407, "is_new_question": false }, @@ -30582,8 +30973,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 49113, - "total_submitted": 97347, + "total_acs": 49255, + "total_submitted": 97647, "frontend_question_id": 1424, "is_new_question": false }, @@ -30605,8 +30996,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": 231137, - "total_submitted": 442144, + "total_acs": 232267, + "total_submitted": 444300, "frontend_question_id": 1423, "is_new_question": false }, @@ -30628,8 +31019,8 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 48262, - "total_submitted": 83373, + "total_acs": 48461, + "total_submitted": 83716, "frontend_question_id": 1422, "is_new_question": false }, @@ -30651,8 +31042,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": 43416, - "total_submitted": 58284, + "total_acs": 43601, + "total_submitted": 58562, "frontend_question_id": 1398, "is_new_question": false }, @@ -30674,8 +31065,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": 11879, - "total_submitted": 19001, + "total_acs": 11938, + "total_submitted": 19160, "frontend_question_id": 1420, "is_new_question": false }, @@ -30697,8 +31088,8 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 40042, - "total_submitted": 79781, + "total_acs": 40465, + "total_submitted": 80619, "frontend_question_id": 1419, "is_new_question": false }, @@ -30720,8 +31111,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": 24617, - "total_submitted": 33168, + "total_acs": 24713, + "total_submitted": 33334, "frontend_question_id": 1418, "is_new_question": false }, @@ -30743,8 +31134,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 52101, - "total_submitted": 96941, + "total_acs": 52342, + "total_submitted": 97429, "frontend_question_id": 1417, "is_new_question": false }, @@ -30766,8 +31157,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": 12835, - "total_submitted": 29367, + "total_acs": 12931, + "total_submitted": 29549, "frontend_question_id": 1434, "is_new_question": false }, @@ -30789,8 +31180,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": 37836, - "total_submitted": 54703, + "total_acs": 38009, + "total_submitted": 54942, "frontend_question_id": 1433, "is_new_question": false }, @@ -30812,8 +31203,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": 15817, - "total_submitted": 38377, + "total_acs": 15889, + "total_submitted": 38553, "frontend_question_id": 1432, "is_new_question": false }, @@ -30835,8 +31226,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": 564788, - "total_submitted": 644281, + "total_acs": 575483, + "total_submitted": 656879, "frontend_question_id": 1431, "is_new_question": false }, @@ -30858,8 +31249,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": 30350, - "total_submitted": 48133, + "total_acs": 30503, + "total_submitted": 48342, "frontend_question_id": 1411, "is_new_question": false }, @@ -30881,8 +31272,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 22100, - "total_submitted": 43079, + "total_acs": 22160, + "total_submitted": 43202, "frontend_question_id": 1410, "is_new_question": false }, @@ -30904,8 +31295,8 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 45079, - "total_submitted": 53894, + "total_acs": 45222, + "total_submitted": 54051, "frontend_question_id": 1409, "is_new_question": false }, @@ -30927,8 +31318,8 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 74434, - "total_submitted": 116952, + "total_acs": 74884, + "total_submitted": 117642, "frontend_question_id": 1408, "is_new_question": false }, @@ -30950,8 +31341,8 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 90061, - "total_submitted": 104664, + "total_acs": 90680, + "total_submitted": 105441, "frontend_question_id": 1393, "is_new_question": false }, @@ -30973,8 +31364,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 81135, - "total_submitted": 125263, + "total_acs": 81486, + "total_submitted": 125858, "frontend_question_id": 1406, "is_new_question": false }, @@ -30996,8 +31387,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": 35832, - "total_submitted": 67951, + "total_acs": 35968, + "total_submitted": 68216, "frontend_question_id": 1404, "is_new_question": false }, @@ -31019,8 +31410,8 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 64366, - "total_submitted": 89011, + "total_acs": 64633, + "total_submitted": 89362, "frontend_question_id": 1403, "is_new_question": false }, @@ -31042,8 +31433,8 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 14829, - "total_submitted": 23603, + "total_acs": 14860, + "total_submitted": 23661, "frontend_question_id": 1384, "is_new_question": false }, @@ -31065,8 +31456,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 54695, - "total_submitted": 112566, + "total_acs": 54847, + "total_submitted": 112958, "frontend_question_id": 1416, "is_new_question": false }, @@ -31088,8 +31479,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": 33507, - "total_submitted": 45797, + "total_acs": 33720, + "total_submitted": 46049, "frontend_question_id": 1415, "is_new_question": false }, @@ -31111,8 +31502,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": 38520, - "total_submitted": 58959, + "total_acs": 38671, + "total_submitted": 59192, "frontend_question_id": 1414, "is_new_question": false }, @@ -31134,8 +31525,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": 109485, - "total_submitted": 164143, + "total_acs": 110639, + "total_submitted": 165897, "frontend_question_id": 1413, "is_new_question": false }, @@ -31157,8 +31548,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 5624, - "total_submitted": 13338, + "total_acs": 5679, + "total_submitted": 13428, "frontend_question_id": 1397, "is_new_question": false }, @@ -31180,8 +31571,8 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 215430, - "total_submitted": 287921, + "total_acs": 215949, + "total_submitted": 288598, "frontend_question_id": 1396, "is_new_question": false }, @@ -31203,8 +31594,8 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 103334, - "total_submitted": 155308, + "total_acs": 103675, + "total_submitted": 155998, "frontend_question_id": 1395, "is_new_question": false }, @@ -31226,8 +31617,8 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 100582, - "total_submitted": 154278, + "total_acs": 101221, + "total_submitted": 155152, "frontend_question_id": 1394, "is_new_question": false }, @@ -31249,8 +31640,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": 107038, - "total_submitted": 125015, + "total_acs": 116098, + "total_submitted": 136033, "frontend_question_id": 1378, "is_new_question": false }, @@ -31272,8 +31663,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 32642, - "total_submitted": 72833, + "total_acs": 32995, + "total_submitted": 73619, "frontend_question_id": 1392, "is_new_question": false }, @@ -31295,8 +31686,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": 25703, - "total_submitted": 54062, + "total_acs": 25798, + "total_submitted": 54244, "frontend_question_id": 1391, "is_new_question": false }, @@ -31318,8 +31709,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": 207416, - "total_submitted": 241833, + "total_acs": 208958, + "total_submitted": 243628, "frontend_question_id": 1389, "is_new_question": false }, @@ -31341,8 +31732,8 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 19321, - "total_submitted": 28262, + "total_acs": 19375, + "total_submitted": 28353, "frontend_question_id": 1369, "is_new_question": false }, @@ -31364,8 +31755,8 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 120181, - "total_submitted": 157090, + "total_acs": 121142, + "total_submitted": 158383, "frontend_question_id": 1402, "is_new_question": false }, @@ -31387,8 +31778,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 47017, - "total_submitted": 75237, + "total_acs": 47247, + "total_submitted": 75635, "frontend_question_id": 1400, "is_new_question": false }, @@ -31410,8 +31801,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 12296, - "total_submitted": 27876, + "total_acs": 12348, + "total_submitted": 27975, "frontend_question_id": 1401, "is_new_question": false }, @@ -31433,8 +31824,8 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 39923, - "total_submitted": 59807, + "total_acs": 40104, + "total_submitted": 60084, "frontend_question_id": 1399, "is_new_question": false }, @@ -31456,8 +31847,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 88631, - "total_submitted": 183921, + "total_acs": 88874, + "total_submitted": 184502, "frontend_question_id": 1383, "is_new_question": false }, @@ -31479,8 +31870,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": 201108, - "total_submitted": 233132, + "total_acs": 202061, + "total_submitted": 234362, "frontend_question_id": 1379, "is_new_question": false }, @@ -31502,8 +31893,8 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 97081, - "total_submitted": 125821, + "total_acs": 97591, + "total_submitted": 126443, "frontend_question_id": 1381, "is_new_question": false }, @@ -31525,8 +31916,8 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 89243, - "total_submitted": 126150, + "total_acs": 89885, + "total_submitted": 127004, "frontend_question_id": 1380, "is_new_question": false }, @@ -31548,8 +31939,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": 17759, - "total_submitted": 23161, + "total_acs": 17802, + "total_submitted": 23213, "frontend_question_id": 1364, "is_new_question": false }, @@ -31571,8 +31962,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 26273, - "total_submitted": 35875, + "total_acs": 26330, + "total_submitted": 35954, "frontend_question_id": 1355, "is_new_question": false }, @@ -31594,8 +31985,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 26326, - "total_submitted": 74041, + "total_acs": 26504, + "total_submitted": 74511, "frontend_question_id": 1377, "is_new_question": false }, @@ -31617,8 +32008,8 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 190775, - "total_submitted": 316646, + "total_acs": 191594, + "total_submitted": 318082, "frontend_question_id": 1376, "is_new_question": false }, @@ -31640,8 +32031,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": 48199, - "total_submitted": 73230, + "total_acs": 48375, + "total_submitted": 73482, "frontend_question_id": 1375, "is_new_question": false }, @@ -31663,8 +32054,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": 82740, - "total_submitted": 106690, + "total_acs": 83043, + "total_submitted": 107117, "frontend_question_id": 1374, "is_new_question": false }, @@ -31686,8 +32077,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 18166, - "total_submitted": 35753, + "total_acs": 18530, + "total_submitted": 36404, "frontend_question_id": 1388, "is_new_question": false }, @@ -31709,8 +32100,8 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 81190, - "total_submitted": 115974, + "total_acs": 81562, + "total_submitted": 116560, "frontend_question_id": 1387, "is_new_question": false }, @@ -31732,8 +32123,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 40303, - "total_submitted": 98028, + "total_acs": 40470, + "total_submitted": 98390, "frontend_question_id": 1386, "is_new_question": false }, @@ -31755,8 +32146,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": 87248, - "total_submitted": 130061, + "total_acs": 87692, + "total_submitted": 130626, "frontend_question_id": 1385, "is_new_question": false }, @@ -31778,8 +32169,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": 42093, - "total_submitted": 68225, + "total_acs": 42327, + "total_submitted": 68579, "frontend_question_id": 1368, "is_new_question": false }, @@ -31801,8 +32192,8 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 68154, - "total_submitted": 155821, + "total_acs": 68433, + "total_submitted": 156404, "frontend_question_id": 1367, "is_new_question": false }, @@ -31824,8 +32215,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 58097, - "total_submitted": 100656, + "total_acs": 58593, + "total_submitted": 101451, "frontend_question_id": 1366, "is_new_question": false }, @@ -31847,8 +32238,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": 460584, - "total_submitted": 532183, + "total_acs": 464032, + "total_submitted": 536157, "frontend_question_id": 1365, "is_new_question": false }, @@ -31870,8 +32261,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 49752, - "total_submitted": 55343, + "total_acs": 49910, + "total_submitted": 55531, "frontend_question_id": 1350, "is_new_question": false }, @@ -31893,8 +32284,8 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 37683, - "total_submitted": 82059, + "total_acs": 38879, + "total_submitted": 85505, "frontend_question_id": 1341, "is_new_question": false }, @@ -31916,8 +32307,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 64592, - "total_submitted": 178152, + "total_acs": 64640, + "total_submitted": 178330, "frontend_question_id": 1354, "is_new_question": false }, @@ -31939,8 +32330,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": 75004, - "total_submitted": 232651, + "total_acs": 75487, + "total_submitted": 234188, "frontend_question_id": 1353, "is_new_question": false }, @@ -31962,8 +32353,8 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 72918, - "total_submitted": 145659, + "total_acs": 73239, + "total_submitted": 146248, "frontend_question_id": 1352, "is_new_question": false }, @@ -31985,8 +32376,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": 351540, - "total_submitted": 454550, + "total_acs": 353729, + "total_submitted": 457473, "frontend_question_id": 1351, "is_new_question": false }, @@ -32008,8 +32399,8 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 57179, - "total_submitted": 142318, + "total_acs": 57810, + "total_submitted": 143743, "frontend_question_id": 1373, "is_new_question": false }, @@ -32031,8 +32422,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": 112964, - "total_submitted": 168852, + "total_acs": 114617, + "total_submitted": 171533, "frontend_question_id": 1372, "is_new_question": false }, @@ -32054,8 +32445,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": 23685, - "total_submitted": 37362, + "total_acs": 23790, + "total_submitted": 37508, "frontend_question_id": 1371, "is_new_question": false }, @@ -32077,8 +32468,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 67983, - "total_submitted": 88836, + "total_acs": 68273, + "total_submitted": 89236, "frontend_question_id": 1370, "is_new_question": false }, @@ -32100,8 +32491,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 14059, - "total_submitted": 28286, + "total_acs": 14157, + "total_submitted": 28443, "frontend_question_id": 1349, "is_new_question": false }, @@ -32123,8 +32514,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 30673, - "total_submitted": 69751, + "total_acs": 30729, + "total_submitted": 69878, "frontend_question_id": 1348, "is_new_question": false }, @@ -32146,8 +32537,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": 134121, - "total_submitted": 172093, + "total_acs": 134774, + "total_submitted": 172925, "frontend_question_id": 1347, "is_new_question": false }, @@ -32169,8 +32560,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": 299602, - "total_submitted": 816769, + "total_acs": 301437, + "total_submitted": 821338, "frontend_question_id": 1346, "is_new_question": false }, @@ -32192,8 +32583,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 11208, - "total_submitted": 23211, + "total_acs": 11243, + "total_submitted": 23277, "frontend_question_id": 1336, "is_new_question": false }, @@ -32215,8 +32606,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 27181, - "total_submitted": 43422, + "total_acs": 27480, + "total_submitted": 43911, "frontend_question_id": 1340, "is_new_question": false }, @@ -32238,8 +32629,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 117362, - "total_submitted": 245827, + "total_acs": 117620, + "total_submitted": 246446, "frontend_question_id": 1339, "is_new_question": false }, @@ -32261,8 +32652,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 176386, - "total_submitted": 254841, + "total_acs": 176934, + "total_submitted": 255728, "frontend_question_id": 1338, "is_new_question": false }, @@ -32284,8 +32675,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": 257758, - "total_submitted": 361090, + "total_acs": 258707, + "total_submitted": 362371, "frontend_question_id": 1337, "is_new_question": false }, @@ -32307,8 +32698,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": 50952, - "total_submitted": 69982, + "total_acs": 52509, + "total_submitted": 72341, "frontend_question_id": 1327, "is_new_question": false }, @@ -32330,8 +32721,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": 59805, - "total_submitted": 95934, + "total_acs": 59984, + "total_submitted": 96214, "frontend_question_id": 1359, "is_new_question": false }, @@ -32353,8 +32744,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": 65343, - "total_submitted": 101764, + "total_acs": 66306, + "total_submitted": 103079, "frontend_question_id": 1358, "is_new_question": false }, @@ -32376,8 +32767,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 18787, - "total_submitted": 26821, + "total_acs": 18841, + "total_submitted": 26892, "frontend_question_id": 1357, "is_new_question": false }, @@ -32399,8 +32790,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": 120908, - "total_submitted": 164399, + "total_acs": 122137, + "total_submitted": 165980, "frontend_question_id": 1356, "is_new_question": false }, @@ -32422,8 +32813,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 124430, - "total_submitted": 213186, + "total_acs": 124962, + "total_submitted": 214128, "frontend_question_id": 1335, "is_new_question": false }, @@ -32445,8 +32836,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": 73282, - "total_submitted": 128376, + "total_acs": 74386, + "total_submitted": 129836, "frontend_question_id": 1334, "is_new_question": false }, @@ -32468,8 +32859,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": 27209, - "total_submitted": 45050, + "total_acs": 27267, + "total_submitted": 45129, "frontend_question_id": 1333, "is_new_question": false }, @@ -32491,8 +32882,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 123400, - "total_submitted": 161954, + "total_acs": 123706, + "total_submitted": 162350, "frontend_question_id": 1332, "is_new_question": false }, @@ -32514,8 +32905,8 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 37563, - "total_submitted": 62469, + "total_acs": 37651, + "total_submitted": 62618, "frontend_question_id": 1322, "is_new_question": false }, @@ -32537,8 +32928,8 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 39914, - "total_submitted": 66136, + "total_acs": 40766, + "total_submitted": 69713, "frontend_question_id": 1321, "is_new_question": false }, @@ -32560,8 +32951,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": 71343, - "total_submitted": 150731, + "total_acs": 71766, + "total_submitted": 151607, "frontend_question_id": 1326, "is_new_question": false }, @@ -32583,8 +32974,8 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 91621, - "total_submitted": 123089, + "total_acs": 92070, + "total_submitted": 123697, "frontend_question_id": 1325, "is_new_question": false }, @@ -32606,8 +32997,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 35119, - "total_submitted": 56465, + "total_acs": 35290, + "total_submitted": 56712, "frontend_question_id": 1324, "is_new_question": false }, @@ -32629,8 +33020,8 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 227013, - "total_submitted": 276636, + "total_acs": 228157, + "total_submitted": 278054, "frontend_question_id": 1323, "is_new_question": false }, @@ -32652,8 +33043,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 132556, - "total_submitted": 283694, + "total_acs": 132945, + "total_submitted": 284730, "frontend_question_id": 1345, "is_new_question": false }, @@ -32675,8 +33066,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 109021, - "total_submitted": 172125, + "total_acs": 109415, + "total_submitted": 172689, "frontend_question_id": 1344, "is_new_question": false }, @@ -32698,8 +33089,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": 66800, - "total_submitted": 98293, + "total_acs": 67819, + "total_submitted": 99719, "frontend_question_id": 1343, "is_new_question": false }, @@ -32721,8 +33112,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": 554390, - "total_submitted": 653400, + "total_acs": 558789, + "total_submitted": 658622, "frontend_question_id": 1342, "is_new_question": false }, @@ -32744,8 +33135,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": 28848, - "total_submitted": 48668, + "total_acs": 28943, + "total_submitted": 48852, "frontend_question_id": 1320, "is_new_question": false }, @@ -32767,8 +33158,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": 185094, - "total_submitted": 296827, + "total_acs": 186563, + "total_submitted": 299145, "frontend_question_id": 1319, "is_new_question": false }, @@ -32790,8 +33181,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": 95653, - "total_submitted": 134068, + "total_acs": 96493, + "total_submitted": 135253, "frontend_question_id": 1318, "is_new_question": false }, @@ -32813,8 +33204,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": 40314, - "total_submitted": 73554, + "total_acs": 40527, + "total_submitted": 73978, "frontend_question_id": 1317, "is_new_question": false }, @@ -32836,8 +33227,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 37115, - "total_submitted": 42826, + "total_acs": 37170, + "total_submitted": 42887, "frontend_question_id": 1308, "is_new_question": false }, @@ -32859,8 +33250,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 63426, - "total_submitted": 70652, + "total_acs": 63605, + "total_submitted": 70870, "frontend_question_id": 1303, "is_new_question": false }, @@ -32882,8 +33273,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": 134736, - "total_submitted": 193396, + "total_acs": 136444, + "total_submitted": 195701, "frontend_question_id": 1312, "is_new_question": false }, @@ -32905,8 +33296,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 19714, - "total_submitted": 42474, + "total_acs": 19855, + "total_submitted": 42760, "frontend_question_id": 1311, "is_new_question": false }, @@ -32928,8 +33319,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 50118, - "total_submitted": 69344, + "total_acs": 50370, + "total_submitted": 69719, "frontend_question_id": 1310, "is_new_question": false }, @@ -32951,8 +33342,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": 112242, - "total_submitted": 140897, + "total_acs": 112604, + "total_submitted": 141411, "frontend_question_id": 1309, "is_new_question": false }, @@ -32974,8 +33365,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 10598, - "total_submitted": 26871, + "total_acs": 10660, + "total_submitted": 27005, "frontend_question_id": 2227, "is_new_question": false }, @@ -32997,8 +33388,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": 43084, - "total_submitted": 92572, + "total_acs": 43109, + "total_submitted": 92635, "frontend_question_id": 1430, "is_new_question": false }, @@ -33020,8 +33411,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": 27569, - "total_submitted": 53804, + "total_acs": 27998, + "total_submitted": 54572, "frontend_question_id": 2192, "is_new_question": false }, @@ -33043,8 +33434,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": 41835, - "total_submitted": 72020, + "total_acs": 42439, + "total_submitted": 72978, "frontend_question_id": 2269, "is_new_question": false }, @@ -33066,8 +33457,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 11402, - "total_submitted": 33355, + "total_acs": 11444, + "total_submitted": 33488, "frontend_question_id": 1307, "is_new_question": false }, @@ -33089,8 +33480,8 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 198961, - "total_submitted": 310758, + "total_acs": 200184, + "total_submitted": 312558, "frontend_question_id": 1306, "is_new_question": false }, @@ -33112,8 +33503,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": 195842, - "total_submitted": 245215, + "total_acs": 196448, + "total_submitted": 246029, "frontend_question_id": 1305, "is_new_question": false }, @@ -33135,8 +33526,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": 192852, - "total_submitted": 251440, + "total_acs": 193793, + "total_submitted": 252717, "frontend_question_id": 1304, "is_new_question": false }, @@ -33158,8 +33549,8 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 36486, - "total_submitted": 54549, + "total_acs": 36564, + "total_submitted": 54666, "frontend_question_id": 1294, "is_new_question": false }, @@ -33181,8 +33572,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": 13911, - "total_submitted": 23422, + "total_acs": 14038, + "total_submitted": 23706, "frontend_question_id": 1298, "is_new_question": false }, @@ -33204,8 +33595,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": 43500, - "total_submitted": 83902, + "total_acs": 43819, + "total_submitted": 84576, "frontend_question_id": 1297, "is_new_question": false }, @@ -33227,8 +33618,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": 75141, - "total_submitted": 132986, + "total_acs": 75472, + "total_submitted": 133474, "frontend_question_id": 1296, "is_new_question": false }, @@ -33250,8 +33641,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": 582371, - "total_submitted": 756337, + "total_acs": 585631, + "total_submitted": 760554, "frontend_question_id": 1295, "is_new_question": false }, @@ -33273,8 +33664,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": 33235, - "total_submitted": 39424, + "total_acs": 33341, + "total_submitted": 39541, "frontend_question_id": 1285, "is_new_question": false }, @@ -33296,8 +33687,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": 1076, - "total_submitted": 1643, + "total_acs": 1084, + "total_submitted": 1656, "frontend_question_id": 2263, "is_new_question": false }, @@ -33319,8 +33710,8 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 79180, - "total_submitted": 113160, + "total_acs": 79818, + "total_submitted": 114125, "frontend_question_id": 2305, "is_new_question": false }, @@ -33342,8 +33733,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 4471, - "total_submitted": 7293, + "total_acs": 4513, + "total_submitted": 7351, "frontend_question_id": 2229, "is_new_question": false }, @@ -33365,8 +33756,8 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 69683, - "total_submitted": 114696, + "total_acs": 74594, + "total_submitted": 123492, "frontend_question_id": 1280, "is_new_question": false }, @@ -33388,8 +33779,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": 184077, - "total_submitted": 407310, + "total_acs": 185040, + "total_submitted": 409366, "frontend_question_id": 1293, "is_new_question": false }, @@ -33411,8 +33802,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": 31036, - "total_submitted": 58120, + "total_acs": 31112, + "total_submitted": 58281, "frontend_question_id": 1292, "is_new_question": false }, @@ -33434,8 +33825,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": 403864, - "total_submitted": 494441, + "total_acs": 406496, + "total_submitted": 497936, "frontend_question_id": 1290, "is_new_question": false }, @@ -33457,8 +33848,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 11559, - "total_submitted": 15742, + "total_acs": 11617, + "total_submitted": 15819, "frontend_question_id": 1279, "is_new_question": false }, @@ -33480,8 +33871,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": 30174, - "total_submitted": 41964, + "total_acs": 30297, + "total_submitted": 42124, "frontend_question_id": 1284, "is_new_question": false }, @@ -33503,8 +33894,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": 124984, - "total_submitted": 217276, + "total_acs": 126980, + "total_submitted": 220349, "frontend_question_id": 1283, "is_new_question": false }, @@ -33520,14 +33911,14 @@ { "stat": { "question_id": 1407, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "group-the-people-given-the-group-size-they-belong-to", + "question__article__has_video_solution": false, "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": 106911, - "total_submitted": 125014, + "total_acs": 107481, + "total_submitted": 125672, "frontend_question_id": 1282, "is_new_question": false }, @@ -33549,8 +33940,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": 412983, - "total_submitted": 477771, + "total_acs": 416020, + "total_submitted": 481379, "frontend_question_id": 1281, "is_new_question": false }, @@ -33572,8 +33963,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": 48924, - "total_submitted": 56834, + "total_acs": 49062, + "total_submitted": 57003, "frontend_question_id": 1270, "is_new_question": false }, @@ -33595,8 +33986,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 51400, - "total_submitted": 54565, + "total_acs": 51592, + "total_submitted": 54764, "frontend_question_id": 1265, "is_new_question": false }, @@ -33618,8 +34009,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 24778, - "total_submitted": 40794, + "total_acs": 24941, + "total_submitted": 41089, "frontend_question_id": 1278, "is_new_question": false }, @@ -33641,8 +34032,8 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 202398, - "total_submitted": 270833, + "total_acs": 203391, + "total_submitted": 272071, "frontend_question_id": 1277, "is_new_question": false }, @@ -33664,8 +34055,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": 22665, - "total_submitted": 44551, + "total_acs": 22784, + "total_submitted": 44760, "frontend_question_id": 1276, "is_new_question": false }, @@ -33687,8 +34078,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": 107708, - "total_submitted": 198874, + "total_acs": 108409, + "total_submitted": 200152, "frontend_question_id": 1275, "is_new_question": false }, @@ -33710,8 +34101,8 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 35924, - "total_submitted": 54412, + "total_acs": 36055, + "total_submitted": 54657, "frontend_question_id": 1264, "is_new_question": false }, @@ -33733,8 +34124,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": 33346, - "total_submitted": 76676, + "total_acs": 33479, + "total_submitted": 76969, "frontend_question_id": 1269, "is_new_question": false }, @@ -33756,8 +34147,8 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 255069, - "total_submitted": 386651, + "total_acs": 256344, + "total_submitted": 388690, "frontend_question_id": 1268, "is_new_question": false }, @@ -33779,8 +34170,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 53772, - "total_submitted": 89843, + "total_acs": 53941, + "total_submitted": 90110, "frontend_question_id": 1267, "is_new_question": false }, @@ -33802,8 +34193,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 139455, - "total_submitted": 176493, + "total_acs": 139927, + "total_submitted": 177105, "frontend_question_id": 1266, "is_new_question": false }, @@ -33825,8 +34216,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 23935, - "total_submitted": 36363, + "total_acs": 24525, + "total_submitted": 37232, "frontend_question_id": 2304, "is_new_question": false }, @@ -33848,8 +34239,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": 58930, - "total_submitted": 96411, + "total_acs": 59319, + "total_submitted": 97165, "frontend_question_id": 2218, "is_new_question": false }, @@ -33871,8 +34262,8 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 173605, - "total_submitted": 221608, + "total_acs": 178342, + "total_submitted": 227610, "frontend_question_id": 2215, "is_new_question": false }, @@ -33894,8 +34285,8 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 106459, - "total_submitted": 178249, + "total_acs": 106933, + "total_submitted": 179005, "frontend_question_id": 1426, "is_new_question": false }, @@ -33917,8 +34308,8 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 84506, - "total_submitted": 110677, + "total_acs": 88194, + "total_submitted": 115765, "frontend_question_id": 1251, "is_new_question": false }, @@ -33940,8 +34331,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": 26333, - "total_submitted": 53635, + "total_acs": 26393, + "total_submitted": 53738, "frontend_question_id": 1263, "is_new_question": false }, @@ -33963,8 +34354,8 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 48366, - "total_submitted": 95443, + "total_acs": 48662, + "total_submitted": 96001, "frontend_question_id": 1262, "is_new_question": false }, @@ -33986,8 +34377,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": 57548, - "total_submitted": 75123, + "total_acs": 57750, + "total_submitted": 75355, "frontend_question_id": 1261, "is_new_question": false }, @@ -34009,8 +34400,8 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 98128, - "total_submitted": 145205, + "total_acs": 98414, + "total_submitted": 145667, "frontend_question_id": 1260, "is_new_question": false }, @@ -34032,8 +34423,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": 1649, - "total_submitted": 2606, + "total_acs": 1655, + "total_submitted": 2614, "frontend_question_id": 2189, "is_new_question": false }, @@ -34055,8 +34446,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": 6457, - "total_submitted": 10703, + "total_acs": 6460, + "total_submitted": 10707, "frontend_question_id": 1618, "is_new_question": false }, @@ -34078,8 +34469,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 931, - "total_submitted": 1654, + "total_acs": 935, + "total_submitted": 1660, "frontend_question_id": 2198, "is_new_question": false }, @@ -34101,8 +34492,8 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 31280, - "total_submitted": 48679, + "total_acs": 31462, + "total_submitted": 48961, "frontend_question_id": 2303, "is_new_question": false }, @@ -34124,8 +34515,8 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 32367, - "total_submitted": 44683, + "total_acs": 32667, + "total_submitted": 45081, "frontend_question_id": 1255, "is_new_question": false }, @@ -34147,8 +34538,8 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 199449, - "total_submitted": 298732, + "total_acs": 200639, + "total_submitted": 300645, "frontend_question_id": 1254, "is_new_question": false }, @@ -34170,8 +34561,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 23639, - "total_submitted": 52683, + "total_acs": 23714, + "total_submitted": 52800, "frontend_question_id": 1253, "is_new_question": false }, @@ -34193,8 +34584,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": 99378, - "total_submitted": 126727, + "total_acs": 99853, + "total_submitted": 127313, "frontend_question_id": 1252, "is_new_question": false }, @@ -34216,8 +34607,8 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 31684, - "total_submitted": 48174, + "total_acs": 31782, + "total_submitted": 48328, "frontend_question_id": 1241, "is_new_question": false }, @@ -34239,8 +34630,8 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 8740, - "total_submitted": 17886, + "total_acs": 8817, + "total_submitted": 18025, "frontend_question_id": 2312, "is_new_question": false }, @@ -34262,8 +34653,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 15411, - "total_submitted": 45606, + "total_acs": 15493, + "total_submitted": 45840, "frontend_question_id": 2217, "is_new_question": false }, @@ -34285,8 +34676,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": 167001, - "total_submitted": 311890, + "total_acs": 167207, + "total_submitted": 312223, "frontend_question_id": 1428, "is_new_question": false }, @@ -34308,8 +34699,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": 19233, - "total_submitted": 32675, + "total_acs": 19371, + "total_submitted": 32877, "frontend_question_id": 1250, "is_new_question": false }, @@ -34331,8 +34722,8 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 507976, - "total_submitted": 769412, + "total_acs": 509601, + "total_submitted": 771584, "frontend_question_id": 1249, "is_new_question": false }, @@ -34354,8 +34745,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 93093, - "total_submitted": 148699, + "total_acs": 94393, + "total_submitted": 150417, "frontend_question_id": 1248, "is_new_question": false }, @@ -34377,8 +34768,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 35076, - "total_submitted": 54578, + "total_acs": 35198, + "total_submitted": 54765, "frontend_question_id": 1247, "is_new_question": false }, @@ -34400,8 +34791,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 44485, - "total_submitted": 91327, + "total_acs": 44692, + "total_submitted": 91782, "frontend_question_id": 1242, "is_new_question": false }, @@ -34423,8 +34814,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 20866, - "total_submitted": 37571, + "total_acs": 21180, + "total_submitted": 38091, "frontend_question_id": 1691, "is_new_question": false }, @@ -34446,8 +34837,8 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 80062, - "total_submitted": 150602, + "total_acs": 80187, + "total_submitted": 150807, "frontend_question_id": 1429, "is_new_question": false }, @@ -34469,8 +34860,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 24621, - "total_submitted": 40526, + "total_acs": 24731, + "total_submitted": 40667, "frontend_question_id": 1726, "is_new_question": false }, @@ -34492,8 +34883,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": 43140, - "total_submitted": 62583, + "total_acs": 43502, + "total_submitted": 63105, "frontend_question_id": 2309, "is_new_question": false }, @@ -34515,8 +34906,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 35187, - "total_submitted": 53436, + "total_acs": 35363, + "total_submitted": 53737, "frontend_question_id": 1227, "is_new_question": false }, @@ -34538,8 +34929,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": 22054, - "total_submitted": 40769, + "total_acs": 22117, + "total_submitted": 40881, "frontend_question_id": 1240, "is_new_question": false }, @@ -34561,8 +34952,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": 177450, - "total_submitted": 340122, + "total_acs": 178056, + "total_submitted": 341255, "frontend_question_id": 1239, "is_new_question": false }, @@ -34584,8 +34975,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 15598, - "total_submitted": 22560, + "total_acs": 15671, + "total_submitted": 22658, "frontend_question_id": 1238, "is_new_question": false }, @@ -34607,8 +34998,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": 60480, - "total_submitted": 87307, + "total_acs": 60719, + "total_submitted": 87616, "frontend_question_id": 1237, "is_new_question": false }, @@ -34630,8 +35021,8 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 18888, - "total_submitted": 31388, + "total_acs": 18989, + "total_submitted": 31552, "frontend_question_id": 1225, "is_new_question": false }, @@ -34653,8 +35044,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": 19487, - "total_submitted": 38216, + "total_acs": 19653, + "total_submitted": 38570, "frontend_question_id": 2193, "is_new_question": false }, @@ -34676,8 +35067,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 27369, - "total_submitted": 58082, + "total_acs": 27505, + "total_submitted": 58310, "frontend_question_id": 2216, "is_new_question": false }, @@ -34699,8 +35090,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": 99398, - "total_submitted": 138597, + "total_acs": 100083, + "total_submitted": 139678, "frontend_question_id": 2225, "is_new_question": false }, @@ -34722,8 +35113,8 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 44787, - "total_submitted": 77453, + "total_acs": 45360, + "total_submitted": 78409, "frontend_question_id": 2273, "is_new_question": false }, @@ -34745,8 +35136,8 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 191585, - "total_submitted": 359142, + "total_acs": 192841, + "total_submitted": 361534, "frontend_question_id": 1235, "is_new_question": false }, @@ -34768,8 +35159,8 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 29643, - "total_submitted": 79036, + "total_acs": 29762, + "total_submitted": 79303, "frontend_question_id": 1234, "is_new_question": false }, @@ -34791,8 +35182,8 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 49251, - "total_submitted": 75006, + "total_acs": 49345, + "total_submitted": 75151, "frontend_question_id": 1233, "is_new_question": false }, @@ -34814,8 +35205,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": 234944, - "total_submitted": 587157, + "total_acs": 235722, + "total_submitted": 589489, "frontend_question_id": 1232, "is_new_question": false }, @@ -34837,8 +35228,8 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 16615, - "total_submitted": 29647, + "total_acs": 16685, + "total_submitted": 29745, "frontend_question_id": 2321, "is_new_question": false }, @@ -34860,8 +35251,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": 2227, - "total_submitted": 3176, + "total_acs": 2253, + "total_submitted": 3203, "frontend_question_id": 2204, "is_new_question": false }, @@ -34883,8 +35274,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": 24404, - "total_submitted": 107085, + "total_acs": 24543, + "total_submitted": 107777, "frontend_question_id": 2202, "is_new_question": false }, @@ -34906,8 +35297,8 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 76272, - "total_submitted": 140141, + "total_acs": 76385, + "total_submitted": 140316, "frontend_question_id": 1427, "is_new_question": false }, @@ -34929,8 +35320,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 13595, - "total_submitted": 36651, + "total_acs": 13662, + "total_submitted": 36881, "frontend_question_id": 1224, "is_new_question": false }, @@ -34952,8 +35343,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 26456, - "total_submitted": 54319, + "total_acs": 26584, + "total_submitted": 54586, "frontend_question_id": 1223, "is_new_question": false }, @@ -34975,8 +35366,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 38891, - "total_submitted": 54165, + "total_acs": 39029, + "total_submitted": 54398, "frontend_question_id": 1222, "is_new_question": false }, @@ -34998,8 +35389,8 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 260564, - "total_submitted": 304881, + "total_acs": 262158, + "total_submitted": 306650, "frontend_question_id": 1221, "is_new_question": false }, @@ -35021,8 +35412,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 26975, - "total_submitted": 49193, + "total_acs": 27135, + "total_submitted": 49492, "frontend_question_id": 1226, "is_new_question": false }, @@ -35044,8 +35435,8 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 32571, - "total_submitted": 57752, + "total_acs": 32715, + "total_submitted": 58016, "frontend_question_id": 1212, "is_new_question": false }, @@ -35067,8 +35458,8 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 61313, - "total_submitted": 92262, + "total_acs": 64204, + "total_submitted": 96646, "frontend_question_id": 1211, "is_new_question": false }, @@ -35090,8 +35481,8 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 18025, - "total_submitted": 29917, + "total_acs": 18363, + "total_submitted": 30355, "frontend_question_id": 1206, "is_new_question": false }, @@ -35113,8 +35504,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": 2914, - "total_submitted": 9762, + "total_acs": 2926, + "total_submitted": 9796, "frontend_question_id": 1960, "is_new_question": false }, @@ -35136,8 +35527,8 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 31513, - "total_submitted": 84628, + "total_acs": 31837, + "total_submitted": 85435, "frontend_question_id": 2226, "is_new_question": false }, @@ -35159,8 +35550,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": 23012, - "total_submitted": 88137, + "total_acs": 23146, + "total_submitted": 88532, "frontend_question_id": 2310, "is_new_question": false }, @@ -35182,8 +35573,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 17343, - "total_submitted": 37825, + "total_acs": 17436, + "total_submitted": 37986, "frontend_question_id": 2191, "is_new_question": false }, @@ -35205,8 +35596,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 106816, - "total_submitted": 178505, + "total_acs": 107117, + "total_submitted": 179050, "frontend_question_id": 1220, "is_new_question": false }, @@ -35228,8 +35619,8 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 104557, - "total_submitted": 164238, + "total_acs": 104944, + "total_submitted": 164890, "frontend_question_id": 1219, "is_new_question": false }, @@ -35251,8 +35642,8 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 126500, - "total_submitted": 229413, + "total_acs": 127296, + "total_submitted": 231040, "frontend_question_id": 1218, "is_new_question": false }, @@ -35274,8 +35665,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": 116801, - "total_submitted": 162671, + "total_acs": 117293, + "total_submitted": 163322, "frontend_question_id": 1217, "is_new_question": false }, @@ -35297,8 +35688,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 20591, - "total_submitted": 48614, + "total_acs": 20642, + "total_submitted": 48815, "frontend_question_id": 1205, "is_new_question": false }, @@ -35320,8 +35711,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": 49496, - "total_submitted": 71384, + "total_acs": 50884, + "total_submitted": 73665, "frontend_question_id": 1204, "is_new_question": false }, @@ -35343,8 +35734,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 8032, - "total_submitted": 28251, + "total_acs": 8060, + "total_submitted": 28407, "frontend_question_id": 1862, "is_new_question": false }, @@ -35366,8 +35757,8 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 116402, - "total_submitted": 213415, + "total_acs": 117257, + "total_submitted": 214966, "frontend_question_id": 1514, "is_new_question": false }, @@ -35389,8 +35780,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 134354, - "total_submitted": 187630, + "total_acs": 134579, + "total_submitted": 187946, "frontend_question_id": 1706, "is_new_question": false }, @@ -35412,8 +35803,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": 8646, - "total_submitted": 17527, + "total_acs": 8676, + "total_submitted": 17601, "frontend_question_id": 1210, "is_new_question": false }, @@ -35435,8 +35826,8 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 41947, - "total_submitted": 84793, + "total_acs": 42344, + "total_submitted": 85541, "frontend_question_id": 1208, "is_new_question": false }, @@ -35458,8 +35849,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": 273752, - "total_submitted": 484673, + "total_acs": 274916, + "total_submitted": 486467, "frontend_question_id": 1209, "is_new_question": false }, @@ -35481,8 +35872,8 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 318303, - "total_submitted": 430542, + "total_acs": 324240, + "total_submitted": 438238, "frontend_question_id": 1207, "is_new_question": false }, @@ -35504,8 +35895,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 18051, - "total_submitted": 36353, + "total_acs": 18132, + "total_submitted": 36548, "frontend_question_id": 1194, "is_new_question": false }, @@ -35527,8 +35918,8 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 58182, - "total_submitted": 94144, + "total_acs": 60643, + "total_submitted": 98464, "frontend_question_id": 1193, "is_new_question": false }, @@ -35550,8 +35941,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 40172, - "total_submitted": 55237, + "total_acs": 40511, + "total_submitted": 55689, "frontend_question_id": 1195, "is_new_question": false }, @@ -35573,8 +35964,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": 5921, - "total_submitted": 11955, + "total_acs": 5971, + "total_submitted": 12060, "frontend_question_id": 1916, "is_new_question": false }, @@ -35596,8 +35987,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 17701, - "total_submitted": 31789, + "total_acs": 17773, + "total_submitted": 31894, "frontend_question_id": 2201, "is_new_question": false }, @@ -35619,8 +36010,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 9643, - "total_submitted": 18564, + "total_acs": 9675, + "total_submitted": 18642, "frontend_question_id": 1895, "is_new_question": false }, @@ -35642,8 +36033,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 38356, - "total_submitted": 48229, + "total_acs": 38729, + "total_submitted": 48681, "frontend_question_id": 2079, "is_new_question": false }, @@ -35665,8 +36056,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 16383, - "total_submitted": 31788, + "total_acs": 30337, + "total_submitted": 49002, "frontend_question_id": 1203, "is_new_question": false }, @@ -35688,8 +36079,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 103692, - "total_submitted": 179134, + "total_acs": 104061, + "total_submitted": 179774, "frontend_question_id": 1202, "is_new_question": false }, @@ -35711,8 +36102,8 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 28187, - "total_submitted": 96573, + "total_acs": 28321, + "total_submitted": 96999, "frontend_question_id": 1201, "is_new_question": false }, @@ -35734,8 +36125,8 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 165220, - "total_submitted": 237607, + "total_acs": 166161, + "total_submitted": 238971, "frontend_question_id": 1200, "is_new_question": false }, @@ -35757,8 +36148,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": 36472, - "total_submitted": 53337, + "total_acs": 36840, + "total_submitted": 53903, "frontend_question_id": 1944, "is_new_question": false }, @@ -35780,8 +36171,8 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 68824, - "total_submitted": 120034, + "total_acs": 69331, + "total_submitted": 120942, "frontend_question_id": 1405, "is_new_question": false }, @@ -35803,8 +36194,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 34954, - "total_submitted": 71036, + "total_acs": 35196, + "total_submitted": 71435, "frontend_question_id": 2139, "is_new_question": false }, @@ -35826,8 +36217,8 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 29593, - "total_submitted": 52082, + "total_acs": 29841, + "total_submitted": 52509, "frontend_question_id": 1957, "is_new_question": false }, @@ -35849,8 +36240,8 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 98718, - "total_submitted": 124411, + "total_acs": 99277, + "total_submitted": 125245, "frontend_question_id": 1179, "is_new_question": false }, @@ -35872,8 +36263,8 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 206854, - "total_submitted": 375431, + "total_acs": 207920, + "total_submitted": 377093, "frontend_question_id": 1192, "is_new_question": false }, @@ -35895,8 +36286,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 31367, - "total_submitted": 132667, + "total_acs": 31524, + "total_submitted": 133525, "frontend_question_id": 1191, "is_new_question": false }, @@ -35918,8 +36309,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": 63846, - "total_submitted": 96782, + "total_acs": 64122, + "total_submitted": 97200, "frontend_question_id": 1190, "is_new_question": false }, @@ -35941,8 +36332,8 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 160634, - "total_submitted": 265642, + "total_acs": 161977, + "total_submitted": 267996, "frontend_question_id": 1189, "is_new_question": false }, @@ -35964,8 +36355,8 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 29090, - "total_submitted": 86092, + "total_acs": 29296, + "total_submitted": 86709, "frontend_question_id": 1483, "is_new_question": false }, @@ -35987,8 +36378,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": 14607, - "total_submitted": 27245, + "total_acs": 14676, + "total_submitted": 27384, "frontend_question_id": 1954, "is_new_question": false }, @@ -36010,8 +36401,8 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 17462, - "total_submitted": 44683, + "total_acs": 17563, + "total_submitted": 44911, "frontend_question_id": 2080, "is_new_question": false }, @@ -36033,8 +36424,8 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 71178, - "total_submitted": 112800, + "total_acs": 71627, + "total_submitted": 113486, "frontend_question_id": 1550, "is_new_question": false }, @@ -36056,8 +36447,8 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 47519, - "total_submitted": 86669, + "total_acs": 49705, + "total_submitted": 91149, "frontend_question_id": 1174, "is_new_question": false }, @@ -36079,8 +36470,8 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 59944, - "total_submitted": 73319, + "total_acs": 62642, + "total_submitted": 76832, "frontend_question_id": 1173, "is_new_question": false }, @@ -36102,8 +36493,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 53424, - "total_submitted": 90318, + "total_acs": 53593, + "total_submitted": 90680, "frontend_question_id": 1187, "is_new_question": false }, @@ -36125,8 +36516,8 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 56510, - "total_submitted": 98686, + "total_acs": 56827, + "total_submitted": 99232, "frontend_question_id": 1185, "is_new_question": false }, @@ -36148,8 +36539,8 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 40668, - "total_submitted": 97727, + "total_acs": 40898, + "total_submitted": 98241, "frontend_question_id": 1186, "is_new_question": false }, @@ -36171,8 +36562,8 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 52960, - "total_submitted": 98401, + "total_acs": 53138, + "total_submitted": 98750, "frontend_question_id": 1184, "is_new_question": false }, @@ -36194,8 +36585,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 25384, - "total_submitted": 53239, + "total_acs": 25564, + "total_submitted": 53620, "frontend_question_id": 1425, "is_new_question": false }, @@ -36217,8 +36608,8 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 124878, - "total_submitted": 154451, + "total_acs": 125616, + "total_submitted": 155317, "frontend_question_id": 1382, "is_new_question": false }, @@ -36240,8 +36631,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 27456, - "total_submitted": 66513, + "total_acs": 27654, + "total_submitted": 66886, "frontend_question_id": 1390, "is_new_question": false }, @@ -36263,8 +36654,8 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 56993, - "total_submitted": 89694, + "total_acs": 57372, + "total_submitted": 90246, "frontend_question_id": 1507, "is_new_question": false }, @@ -36286,8 +36677,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": 29155, - "total_submitted": 62940, + "total_acs": 29228, + "total_submitted": 63081, "frontend_question_id": 1178, "is_new_question": false }, @@ -36309,8 +36700,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 24675, - "total_submitted": 64306, + "total_acs": 24753, + "total_submitted": 64523, "frontend_question_id": 1177, "is_new_question": false }, @@ -36332,8 +36723,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 29865, - "total_submitted": 56445, + "total_acs": 29935, + "total_submitted": 56562, "frontend_question_id": 1176, "is_new_question": false }, @@ -36355,8 +36746,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 26744, - "total_submitted": 48427, + "total_acs": 26877, + "total_submitted": 48629, "frontend_question_id": 1175, "is_new_question": false }, @@ -36378,8 +36769,8 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 54780, - "total_submitted": 90836, + "total_acs": 56174, + "total_submitted": 93657, "frontend_question_id": 1164, "is_new_question": false }, @@ -36401,8 +36792,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 18131, - "total_submitted": 54900, + "total_acs": 18206, + "total_submitted": 55173, "frontend_question_id": 1363, "is_new_question": false }, @@ -36424,8 +36815,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 19754, - "total_submitted": 32819, + "total_acs": 19818, + "total_submitted": 32896, "frontend_question_id": 1362, "is_new_question": false }, @@ -36447,8 +36838,8 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 45038, - "total_submitted": 114323, + "total_acs": 45335, + "total_submitted": 115214, "frontend_question_id": 1361, "is_new_question": false }, @@ -36470,8 +36861,8 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 42902, - "total_submitted": 88256, + "total_acs": 43135, + "total_submitted": 88712, "frontend_question_id": 1360, "is_new_question": false }, @@ -36493,8 +36884,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": 74763, - "total_submitted": 121203, + "total_acs": 74893, + "total_submitted": 121412, "frontend_question_id": 1170, "is_new_question": false }, @@ -36516,8 +36907,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 63967, - "total_submitted": 205933, + "total_acs": 64150, + "total_submitted": 206580, "frontend_question_id": 1169, "is_new_question": false }, @@ -36539,8 +36930,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 34408, - "total_submitted": 50980, + "total_acs": 34502, + "total_submitted": 51101, "frontend_question_id": 1236, "is_new_question": false }, @@ -36562,8 +36953,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 16394, - "total_submitted": 49872, + "total_acs": 16444, + "total_submitted": 50097, "frontend_question_id": 1172, "is_new_question": false }, @@ -36585,8 +36976,8 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 16772, - "total_submitted": 29273, + "total_acs": 16838, + "total_submitted": 29390, "frontend_question_id": 1159, "is_new_question": false }, @@ -36608,8 +36999,8 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 82325, - "total_submitted": 141686, + "total_acs": 82877, + "total_submitted": 142814, "frontend_question_id": 1158, "is_new_question": false }, @@ -36631,8 +37022,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": 48065, - "total_submitted": 111120, + "total_acs": 48376, + "total_submitted": 111798, "frontend_question_id": 1171, "is_new_question": false }, @@ -36654,8 +37045,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": 47158, - "total_submitted": 65479, + "total_acs": 47606, + "total_submitted": 66045, "frontend_question_id": 1935, "is_new_question": false }, @@ -36677,8 +37068,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": 188256, - "total_submitted": 346249, + "total_acs": 189148, + "total_submitted": 347645, "frontend_question_id": 1155, "is_new_question": false }, @@ -36700,8 +37091,8 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 15295, - "total_submitted": 36712, + "total_acs": 15328, + "total_submitted": 36807, "frontend_question_id": 1157, "is_new_question": false }, @@ -36723,8 +37114,8 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 28015, - "total_submitted": 62851, + "total_acs": 28135, + "total_submitted": 63200, "frontend_question_id": 1156, "is_new_question": false }, @@ -36746,8 +37137,8 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 47404, - "total_submitted": 96642, + "total_acs": 47700, + "total_submitted": 97334, "frontend_question_id": 1154, "is_new_question": false }, @@ -36769,8 +37160,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 33313, - "total_submitted": 70902, + "total_acs": 33405, + "total_submitted": 71078, "frontend_question_id": 1149, "is_new_question": false }, @@ -36792,8 +37183,8 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 196401, - "total_submitted": 261071, + "total_acs": 209629, + "total_submitted": 279134, "frontend_question_id": 1148, "is_new_question": false }, @@ -36815,8 +37206,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 20630, - "total_submitted": 50391, + "total_acs": 20705, + "total_submitted": 50593, "frontend_question_id": 1632, "is_new_question": false }, @@ -36838,8 +37229,8 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 88240, - "total_submitted": 147870, + "total_acs": 88751, + "total_submitted": 148692, "frontend_question_id": 1331, "is_new_question": false }, @@ -36861,8 +37252,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 5084, - "total_submitted": 12335, + "total_acs": 5108, + "total_submitted": 12384, "frontend_question_id": 1330, "is_new_question": false }, @@ -36884,8 +37275,8 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 288034, - "total_submitted": 333352, + "total_acs": 289513, + "total_submitted": 335102, "frontend_question_id": 1302, "is_new_question": false }, @@ -36907,8 +37298,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 149977, - "total_submitted": 180511, + "total_acs": 150425, + "total_submitted": 181067, "frontend_question_id": 1329, "is_new_question": false }, @@ -36930,8 +37321,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 151883, - "total_submitted": 290516, + "total_acs": 152475, + "total_submitted": 291838, "frontend_question_id": 1328, "is_new_question": false }, @@ -36953,8 +37344,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 21239, - "total_submitted": 36046, + "total_acs": 21335, + "total_submitted": 36203, "frontend_question_id": 1147, "is_new_question": false }, @@ -36976,8 +37367,8 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 768194, - "total_submitted": 1327058, + "total_acs": 776991, + "total_submitted": 1343285, "frontend_question_id": 1143, "is_new_question": false }, @@ -36999,8 +37390,8 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 197514, - "total_submitted": 527269, + "total_acs": 197954, + "total_submitted": 528825, "frontend_question_id": 1146, "is_new_question": false }, @@ -37022,8 +37413,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 42368, - "total_submitted": 81847, + "total_acs": 42498, + "total_submitted": 82083, "frontend_question_id": 1145, "is_new_question": false }, @@ -37045,8 +37436,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 18018, - "total_submitted": 38003, + "total_acs": 18084, + "total_submitted": 38140, "frontend_question_id": 1144, "is_new_question": false }, @@ -37068,8 +37459,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": 38672, - "total_submitted": 108617, + "total_acs": 38755, + "total_submitted": 108821, "frontend_question_id": 1142, "is_new_question": false }, @@ -37091,8 +37482,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": 117474, - "total_submitted": 244137, + "total_acs": 119961, + "total_submitted": 249145, "frontend_question_id": 1141, "is_new_question": false }, @@ -37114,8 +37505,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 14621, - "total_submitted": 29413, + "total_acs": 14708, + "total_submitted": 29563, "frontend_question_id": 1316, "is_new_question": false }, @@ -37137,8 +37528,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": 135074, - "total_submitted": 158015, + "total_acs": 135693, + "total_submitted": 158712, "frontend_question_id": 1315, "is_new_question": false }, @@ -37160,8 +37551,8 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 80134, - "total_submitted": 106114, + "total_acs": 80347, + "total_submitted": 106391, "frontend_question_id": 1314, "is_new_question": false }, @@ -37183,8 +37574,8 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 236369, - "total_submitted": 276169, + "total_acs": 237479, + "total_submitted": 277453, "frontend_question_id": 1313, "is_new_question": false }, @@ -37206,8 +37597,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 85814, - "total_submitted": 125185, + "total_acs": 86226, + "total_submitted": 125843, "frontend_question_id": 1140, "is_new_question": false }, @@ -37229,8 +37620,8 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 22903, - "total_submitted": 45637, + "total_acs": 22946, + "total_submitted": 45723, "frontend_question_id": 1139, "is_new_question": false }, @@ -37252,8 +37643,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 48024, - "total_submitted": 92506, + "total_acs": 48186, + "total_submitted": 92818, "frontend_question_id": 1138, "is_new_question": false }, @@ -37275,8 +37666,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 34053, - "total_submitted": 103912, + "total_acs": 34138, + "total_submitted": 104217, "frontend_question_id": 1132, "is_new_question": false }, @@ -37298,8 +37689,8 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 526565, - "total_submitted": 828078, + "total_acs": 530646, + "total_submitted": 834656, "frontend_question_id": 1137, "is_new_question": false }, @@ -37321,8 +37712,8 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 11757, - "total_submitted": 30250, + "total_acs": 11817, + "total_submitted": 30404, "frontend_question_id": 1301, "is_new_question": false }, @@ -37344,8 +37735,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 25740, - "total_submitted": 37280, + "total_acs": 25822, + "total_submitted": 37415, "frontend_question_id": 1274, "is_new_question": false }, @@ -37367,8 +37758,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": 34483, - "total_submitted": 78600, + "total_acs": 34610, + "total_submitted": 78886, "frontend_question_id": 1300, "is_new_question": false }, @@ -37390,8 +37781,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": 314757, - "total_submitted": 436396, + "total_acs": 317399, + "total_submitted": 440508, "frontend_question_id": 1299, "is_new_question": false }, @@ -37413,8 +37804,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 20593, - "total_submitted": 42237, + "total_acs": 20650, + "total_submitted": 42396, "frontend_question_id": 1131, "is_new_question": false }, @@ -37436,8 +37827,8 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 102051, - "total_submitted": 213244, + "total_acs": 102626, + "total_submitted": 214777, "frontend_question_id": 1129, "is_new_question": false }, @@ -37459,8 +37850,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 89157, - "total_submitted": 131000, + "total_acs": 89566, + "total_submitted": 131645, "frontend_question_id": 1130, "is_new_question": false }, @@ -37482,8 +37873,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 60206, - "total_submitted": 126899, + "total_acs": 60422, + "total_submitted": 127378, "frontend_question_id": 1128, "is_new_question": false }, @@ -37505,8 +37896,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 13807, - "total_submitted": 28381, + "total_acs": 13847, + "total_submitted": 28473, "frontend_question_id": 1127, "is_new_question": false }, @@ -37528,8 +37919,8 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 40998, - "total_submitted": 61899, + "total_acs": 41078, + "total_submitted": 62009, "frontend_question_id": 1126, "is_new_question": false }, @@ -37551,8 +37942,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 44029, - "total_submitted": 75716, + "total_acs": 44354, + "total_submitted": 76313, "frontend_question_id": 1289, "is_new_question": false }, @@ -37574,8 +37965,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 15064, - "total_submitted": 32264, + "total_acs": 15155, + "total_submitted": 32438, "frontend_question_id": 1627, "is_new_question": false }, @@ -37597,8 +37988,8 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 110437, - "total_submitted": 194463, + "total_acs": 110794, + "total_submitted": 195192, "frontend_question_id": 1288, "is_new_question": false }, @@ -37620,8 +38011,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": 81792, - "total_submitted": 138211, + "total_acs": 82243, + "total_submitted": 139014, "frontend_question_id": 1287, "is_new_question": false }, @@ -37643,8 +38034,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 57235, - "total_submitted": 100885, + "total_acs": 57484, + "total_submitted": 101514, "frontend_question_id": 1125, "is_new_question": false }, @@ -37666,8 +38057,8 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 27989, - "total_submitted": 80977, + "total_acs": 28125, + "total_submitted": 81339, "frontend_question_id": 1124, "is_new_question": false }, @@ -37689,8 +38080,8 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 94380, - "total_submitted": 132774, + "total_acs": 94793, + "total_submitted": 133300, "frontend_question_id": 1123, "is_new_question": false }, @@ -37712,8 +38103,8 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 163835, - "total_submitted": 238531, + "total_acs": 164639, + "total_submitted": 239769, "frontend_question_id": 1122, "is_new_question": false }, @@ -37735,8 +38126,8 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 42062, - "total_submitted": 69619, + "total_acs": 42279, + "total_submitted": 69975, "frontend_question_id": 1116, "is_new_question": false }, @@ -37758,8 +38149,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 42665, - "total_submitted": 65593, + "total_acs": 42769, + "total_submitted": 65750, "frontend_question_id": 1113, "is_new_question": false }, @@ -37781,8 +38172,8 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 52284, - "total_submitted": 73250, + "total_acs": 52456, + "total_submitted": 73503, "frontend_question_id": 1112, "is_new_question": false }, @@ -37804,8 +38195,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 9981, - "total_submitted": 16438, + "total_acs": 10047, + "total_submitted": 16541, "frontend_question_id": 1259, "is_new_question": false }, @@ -37827,8 +38218,8 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 90830, - "total_submitted": 148212, + "total_acs": 90972, + "total_submitted": 148446, "frontend_question_id": 1291, "is_new_question": false }, @@ -37850,8 +38241,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 69015, - "total_submitted": 94166, + "total_acs": 69112, + "total_submitted": 94295, "frontend_question_id": 1286, "is_new_question": false }, @@ -37873,8 +38264,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": 48866, - "total_submitted": 73424, + "total_acs": 49281, + "total_submitted": 73951, "frontend_question_id": 1619, "is_new_question": false }, @@ -37896,8 +38287,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 44668, - "total_submitted": 61446, + "total_acs": 44791, + "total_submitted": 61637, "frontend_question_id": 1188, "is_new_question": false }, @@ -37919,8 +38310,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": 23740, - "total_submitted": 32646, + "total_acs": 23814, + "total_submitted": 32764, "frontend_question_id": 1111, "is_new_question": false }, @@ -37942,8 +38333,8 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 189905, - "total_submitted": 274479, + "total_acs": 190865, + "total_submitted": 275857, "frontend_question_id": 1110, "is_new_question": false }, @@ -37965,8 +38356,8 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 54600, - "total_submitted": 89656, + "total_acs": 54817, + "total_submitted": 90047, "frontend_question_id": 1109, "is_new_question": false }, @@ -37988,8 +38379,8 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 546924, - "total_submitted": 615040, + "total_acs": 550032, + "total_submitted": 618626, "frontend_question_id": 1108, "is_new_question": false }, @@ -38011,8 +38402,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 32011, - "total_submitted": 71244, + "total_acs": 32109, + "total_submitted": 71437, "frontend_question_id": 1107, "is_new_question": false }, @@ -38034,8 +38425,8 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 136359, - "total_submitted": 198262, + "total_acs": 137177, + "total_submitted": 199335, "frontend_question_id": 1114, "is_new_question": false }, @@ -38057,8 +38448,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 10241, - "total_submitted": 21987, + "total_acs": 10258, + "total_submitted": 22026, "frontend_question_id": 1246, "is_new_question": false }, @@ -38080,8 +38471,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 9666, - "total_submitted": 15803, + "total_acs": 9673, + "total_submitted": 15813, "frontend_question_id": 1273, "is_new_question": false }, @@ -38103,8 +38494,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 28430, - "total_submitted": 44430, + "total_acs": 28531, + "total_submitted": 44567, "frontend_question_id": 1272, "is_new_question": false }, @@ -38126,8 +38517,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 9702, - "total_submitted": 16953, + "total_acs": 9763, + "total_submitted": 17049, "frontend_question_id": 1271, "is_new_question": false }, @@ -38149,8 +38540,8 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 36109, - "total_submitted": 82712, + "total_acs": 36206, + "total_submitted": 82955, "frontend_question_id": 1098, "is_new_question": false }, @@ -38172,8 +38563,8 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 24525, - "total_submitted": 41839, + "total_acs": 24723, + "total_submitted": 42152, "frontend_question_id": 1106, "is_new_question": false }, @@ -38195,8 +38586,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 48274, - "total_submitted": 81038, + "total_acs": 48478, + "total_submitted": 81362, "frontend_question_id": 1105, "is_new_question": false }, @@ -38218,8 +38609,8 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 78944, - "total_submitted": 122364, + "total_acs": 79259, + "total_submitted": 122774, "frontend_question_id": 1103, "is_new_question": false }, @@ -38241,8 +38632,8 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 40980, - "total_submitted": 54625, + "total_acs": 41143, + "total_submitted": 54830, "frontend_question_id": 1104, "is_new_question": false }, @@ -38264,8 +38655,8 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 20620, - "total_submitted": 39501, + "total_acs": 20686, + "total_submitted": 39650, "frontend_question_id": 1097, "is_new_question": false }, @@ -38287,8 +38678,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 47380, - "total_submitted": 81775, + "total_acs": 47561, + "total_submitted": 82039, "frontend_question_id": 1231, "is_new_question": false }, @@ -38310,8 +38701,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 20072, - "total_submitted": 35449, + "total_acs": 20163, + "total_submitted": 35656, "frontend_question_id": 1258, "is_new_question": false }, @@ -38333,8 +38724,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 20398, - "total_submitted": 31609, + "total_acs": 20443, + "total_submitted": 31667, "frontend_question_id": 1257, "is_new_question": false }, @@ -38356,8 +38747,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 7243, - "total_submitted": 10412, + "total_acs": 7253, + "total_submitted": 10422, "frontend_question_id": 1256, "is_new_question": false }, @@ -38379,8 +38770,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 23054, - "total_submitted": 36184, + "total_acs": 23105, + "total_submitted": 36269, "frontend_question_id": 1096, "is_new_question": false }, @@ -38402,8 +38793,8 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 69930, - "total_submitted": 110038, + "total_acs": 70327, + "total_submitted": 110523, "frontend_question_id": 1115, "is_new_question": false }, @@ -38425,8 +38816,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 41875, - "total_submitted": 75097, + "total_acs": 42084, + "total_submitted": 75443, "frontend_question_id": 1117, "is_new_question": false }, @@ -38448,8 +38839,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 66060, - "total_submitted": 187505, + "total_acs": 66632, + "total_submitted": 189224, "frontend_question_id": 1095, "is_new_question": false }, @@ -38471,8 +38862,8 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 197904, - "total_submitted": 350075, + "total_acs": 198737, + "total_submitted": 351698, "frontend_question_id": 1094, "is_new_question": false }, @@ -38494,8 +38885,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 16952, - "total_submitted": 39491, + "total_acs": 17018, + "total_submitted": 39684, "frontend_question_id": 1093, "is_new_question": false }, @@ -38517,8 +38908,8 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 74345, - "total_submitted": 195652, + "total_acs": 76462, + "total_submitted": 202548, "frontend_question_id": 550, "is_new_question": false }, @@ -38540,8 +38931,8 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 67072, - "total_submitted": 82507, + "total_acs": 67288, + "total_submitted": 82820, "frontend_question_id": 534, "is_new_question": false }, @@ -38563,8 +38954,8 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 76813, - "total_submitted": 146480, + "total_acs": 77074, + "total_submitted": 146962, "frontend_question_id": 512, "is_new_question": false }, @@ -38586,8 +38977,8 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 200344, - "total_submitted": 267908, + "total_acs": 203670, + "total_submitted": 272318, "frontend_question_id": 511, "is_new_question": false }, @@ -38609,8 +39000,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 44719, - "total_submitted": 88863, + "total_acs": 44805, + "total_submitted": 89040, "frontend_question_id": 1216, "is_new_question": false }, @@ -38632,8 +39023,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 31199, - "total_submitted": 50922, + "total_acs": 31262, + "total_submitted": 51055, "frontend_question_id": 1245, "is_new_question": false }, @@ -38655,8 +39046,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 63544, - "total_submitted": 92960, + "total_acs": 63777, + "total_submitted": 93339, "frontend_question_id": 1244, "is_new_question": false }, @@ -38678,8 +39069,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 12157, - "total_submitted": 23650, + "total_acs": 12186, + "total_submitted": 23693, "frontend_question_id": 1243, "is_new_question": false }, @@ -38701,8 +39092,8 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 108739, - "total_submitted": 227755, + "total_acs": 109523, + "total_submitted": 229543, "frontend_question_id": 1084, "is_new_question": false }, @@ -38724,8 +39115,8 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 53394, - "total_submitted": 107258, + "total_acs": 53509, + "total_submitted": 107508, "frontend_question_id": 1083, "is_new_question": false }, @@ -38747,8 +39138,8 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 53566, - "total_submitted": 71866, + "total_acs": 53690, + "total_submitted": 72038, "frontend_question_id": 1082, "is_new_question": false }, @@ -38770,8 +39161,8 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 378084, - "total_submitted": 813048, + "total_acs": 380364, + "total_submitted": 817468, "frontend_question_id": 1091, "is_new_question": false }, @@ -38793,8 +39184,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 87590, - "total_submitted": 149198, + "total_acs": 88930, + "total_submitted": 151358, "frontend_question_id": 1092, "is_new_question": false }, @@ -38816,8 +39207,8 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 34409, - "total_submitted": 56028, + "total_acs": 34514, + "total_submitted": 56183, "frontend_question_id": 1090, "is_new_question": false }, @@ -38839,8 +39230,8 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 366968, - "total_submitted": 711830, + "total_acs": 368919, + "total_submitted": 715462, "frontend_question_id": 1089, "is_new_question": false }, @@ -38862,8 +39253,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 3902, - "total_submitted": 9432, + "total_acs": 3928, + "total_submitted": 9468, "frontend_question_id": 1199, "is_new_question": false }, @@ -38885,8 +39276,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 16761, - "total_submitted": 29905, + "total_acs": 16813, + "total_submitted": 29971, "frontend_question_id": 1230, "is_new_question": false }, @@ -38908,8 +39299,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 73717, - "total_submitted": 133522, + "total_acs": 73877, + "total_submitted": 133803, "frontend_question_id": 1229, "is_new_question": false }, @@ -38931,8 +39322,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 24677, - "total_submitted": 47764, + "total_acs": 24784, + "total_submitted": 47951, "frontend_question_id": 1228, "is_new_question": false }, @@ -38948,14 +39339,14 @@ { "stat": { "question_id": 1163, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "project-employees-iii", + "question__article__has_video_solution": false, "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 49763, - "total_submitted": 64782, + "total_acs": 49929, + "total_submitted": 64979, "frontend_question_id": 1077, "is_new_question": false }, @@ -38977,8 +39368,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 52271, - "total_submitted": 104596, + "total_acs": 52420, + "total_submitted": 104874, "frontend_question_id": 1076, "is_new_question": false }, @@ -39000,8 +39391,8 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 80832, - "total_submitted": 124379, + "total_acs": 84599, + "total_submitted": 130081, "frontend_question_id": 1075, "is_new_question": false }, @@ -39023,8 +39414,8 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 89019, - "total_submitted": 117035, + "total_acs": 89439, + "total_submitted": 117553, "frontend_question_id": 1079, "is_new_question": false }, @@ -39046,8 +39437,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 52978, - "total_submitted": 90817, + "total_acs": 53446, + "total_submitted": 91505, "frontend_question_id": 1081, "is_new_question": false }, @@ -39069,8 +39460,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": 32807, - "total_submitted": 60701, + "total_acs": 32943, + "total_submitted": 60905, "frontend_question_id": 1080, "is_new_question": false }, @@ -39092,8 +39483,8 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 64528, - "total_submitted": 101745, + "total_acs": 64763, + "total_submitted": 102166, "frontend_question_id": 1078, "is_new_question": false }, @@ -39115,8 +39506,8 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 56061, - "total_submitted": 123997, + "total_acs": 58173, + "total_submitted": 129099, "frontend_question_id": 1070, "is_new_question": false }, @@ -39138,8 +39529,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 49205, - "total_submitted": 60095, + "total_acs": 49325, + "total_submitted": 60261, "frontend_question_id": 1069, "is_new_question": false }, @@ -39161,8 +39552,8 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 129425, - "total_submitted": 158190, + "total_acs": 137275, + "total_submitted": 168062, "frontend_question_id": 1068, "is_new_question": false }, @@ -39184,8 +39575,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 2709, - "total_submitted": 4374, + "total_acs": 2734, + "total_submitted": 4408, "frontend_question_id": 1183, "is_new_question": false }, @@ -39207,8 +39598,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 8679, - "total_submitted": 18699, + "total_acs": 8700, + "total_submitted": 18737, "frontend_question_id": 1215, "is_new_question": false }, @@ -39230,8 +39621,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 44096, - "total_submitted": 65781, + "total_acs": 44244, + "total_submitted": 65991, "frontend_question_id": 1214, "is_new_question": false }, @@ -39253,8 +39644,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 79299, - "total_submitted": 99278, + "total_acs": 79510, + "total_submitted": 99545, "frontend_question_id": 1213, "is_new_question": false }, @@ -39276,8 +39667,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 16032, - "total_submitted": 43984, + "total_acs": 16066, + "total_submitted": 44100, "frontend_question_id": 1073, "is_new_question": false }, @@ -39299,8 +39690,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": 20808, - "total_submitted": 32678, + "total_acs": 20873, + "total_submitted": 32757, "frontend_question_id": 1072, "is_new_question": false }, @@ -39322,8 +39713,8 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 227187, - "total_submitted": 426489, + "total_acs": 235006, + "total_submitted": 442918, "frontend_question_id": 1071, "is_new_question": false }, @@ -39345,8 +39736,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": 88337, - "total_submitted": 127084, + "total_acs": 88511, + "total_submitted": 127303, "frontend_question_id": 1074, "is_new_question": false }, @@ -39368,8 +39759,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 41317, - "total_submitted": 63931, + "total_acs": 41519, + "total_submitted": 64248, "frontend_question_id": 1168, "is_new_question": false }, @@ -39391,8 +39782,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": 40513, - "total_submitted": 52971, + "total_acs": 40632, + "total_submitted": 53132, "frontend_question_id": 1198, "is_new_question": false }, @@ -39414,8 +39805,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 138196, - "total_submitted": 347382, + "total_acs": 138714, + "total_submitted": 348546, "frontend_question_id": 1197, "is_new_question": false }, @@ -39437,8 +39828,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": 27648, - "total_submitted": 41401, + "total_acs": 27848, + "total_submitted": 41728, "frontend_question_id": 1196, "is_new_question": false }, @@ -39460,8 +39851,8 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 38485, - "total_submitted": 83570, + "total_acs": 38626, + "total_submitted": 83828, "frontend_question_id": 1054, "is_new_question": false }, @@ -39483,8 +39874,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 37022, - "total_submitted": 73784, + "total_acs": 37146, + "total_submitted": 74040, "frontend_question_id": 1053, "is_new_question": false }, @@ -39506,8 +39897,8 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 65855, - "total_submitted": 115219, + "total_acs": 66144, + "total_submitted": 115734, "frontend_question_id": 1052, "is_new_question": false }, @@ -39529,8 +39920,8 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 288497, - "total_submitted": 380326, + "total_acs": 290546, + "total_submitted": 382871, "frontend_question_id": 1051, "is_new_question": false }, @@ -39552,8 +39943,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": 130055, - "total_submitted": 186756, + "total_acs": 132512, + "total_submitted": 189978, "frontend_question_id": 1050, "is_new_question": false }, @@ -39575,8 +39966,8 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 71206, - "total_submitted": 112361, + "total_acs": 73605, + "total_submitted": 116261, "frontend_question_id": 1045, "is_new_question": false }, @@ -39598,8 +39989,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 34486, - "total_submitted": 62181, + "total_acs": 34524, + "total_submitted": 62258, "frontend_question_id": 1182, "is_new_question": false }, @@ -39621,8 +40012,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 32384, - "total_submitted": 93355, + "total_acs": 32453, + "total_submitted": 93631, "frontend_question_id": 1163, "is_new_question": false }, @@ -39644,8 +40035,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 9357, - "total_submitted": 20630, + "total_acs": 9361, + "total_submitted": 20637, "frontend_question_id": 1181, "is_new_question": false }, @@ -39667,8 +40058,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": 24689, - "total_submitted": 31187, + "total_acs": 24776, + "total_submitted": 31280, "frontend_question_id": 1180, "is_new_question": false }, @@ -39690,8 +40081,8 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 74070, - "total_submitted": 137192, + "total_acs": 74534, + "total_submitted": 137862, "frontend_question_id": 1049, "is_new_question": false }, @@ -39713,8 +40104,8 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 317431, - "total_submitted": 534123, + "total_acs": 318594, + "total_submitted": 535930, "frontend_question_id": 1048, "is_new_question": false }, @@ -39736,8 +40127,8 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 470977, - "total_submitted": 681963, + "total_acs": 474237, + "total_submitted": 686724, "frontend_question_id": 1047, "is_new_question": false }, @@ -39759,8 +40150,8 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 506360, - "total_submitted": 775596, + "total_acs": 509686, + "total_submitted": 780891, "frontend_question_id": 1046, "is_new_question": false }, @@ -39782,8 +40173,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 107123, - "total_submitted": 155733, + "total_acs": 107431, + "total_submitted": 156108, "frontend_question_id": 1167, "is_new_question": false }, @@ -39805,8 +40196,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 45136, - "total_submitted": 72635, + "total_acs": 45454, + "total_submitted": 73222, "frontend_question_id": 1166, "is_new_question": false }, @@ -39828,8 +40219,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 50956, - "total_submitted": 144865, + "total_acs": 50999, + "total_submitted": 145033, "frontend_question_id": 1153, "is_new_question": false }, @@ -39851,8 +40242,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 74200, - "total_submitted": 85606, + "total_acs": 74386, + "total_submitted": 85809, "frontend_question_id": 1165, "is_new_question": false }, @@ -39874,8 +40265,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 63283, - "total_submitted": 207480, + "total_acs": 63389, + "total_submitted": 207807, "frontend_question_id": 1044, "is_new_question": false }, @@ -39897,8 +40288,8 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 80367, - "total_submitted": 111561, + "total_acs": 81421, + "total_submitted": 113029, "frontend_question_id": 1043, "is_new_question": false }, @@ -39920,8 +40311,8 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 70186, - "total_submitted": 138175, + "total_acs": 70589, + "total_submitted": 138935, "frontend_question_id": 1042, "is_new_question": false }, @@ -39943,8 +40334,8 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 213540, - "total_submitted": 385696, + "total_acs": 214260, + "total_submitted": 386901, "frontend_question_id": 1041, "is_new_question": false }, @@ -39966,8 +40357,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 4531, - "total_submitted": 7430, + "total_acs": 4546, + "total_submitted": 7451, "frontend_question_id": 1121, "is_new_question": false }, @@ -39989,8 +40380,8 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 143570, - "total_submitted": 277411, + "total_acs": 144102, + "total_submitted": 278591, "frontend_question_id": 1162, "is_new_question": false }, @@ -40012,8 +40403,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": 208287, - "total_submitted": 308159, + "total_acs": 210020, + "total_submitted": 310989, "frontend_question_id": 1161, "is_new_question": false }, @@ -40035,8 +40426,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 44312, - "total_submitted": 120158, + "total_acs": 44559, + "total_submitted": 120844, "frontend_question_id": 1037, "is_new_question": false }, @@ -40058,8 +40449,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": 157820, - "total_submitted": 184426, + "total_acs": 158646, + "total_submitted": 185358, "frontend_question_id": 1038, "is_new_question": false }, @@ -40081,8 +40472,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 9139, - "total_submitted": 16219, + "total_acs": 9169, + "total_submitted": 16260, "frontend_question_id": 1040, "is_new_question": false }, @@ -40104,8 +40495,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": 150432, - "total_submitted": 223819, + "total_acs": 151040, + "total_submitted": 224749, "frontend_question_id": 1160, "is_new_question": false }, @@ -40127,8 +40518,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 39392, - "total_submitted": 68941, + "total_acs": 39933, + "total_submitted": 69736, "frontend_question_id": 1039, "is_new_question": false }, @@ -40150,8 +40541,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 88291, - "total_submitted": 205207, + "total_acs": 88432, + "total_submitted": 205539, "frontend_question_id": 1152, "is_new_question": false }, @@ -40173,8 +40564,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": 57597, - "total_submitted": 94731, + "total_acs": 57825, + "total_submitted": 95128, "frontend_question_id": 1151, "is_new_question": false }, @@ -40196,8 +40587,8 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 18853, - "total_submitted": 54965, + "total_acs": 18919, + "total_submitted": 55136, "frontend_question_id": 1036, "is_new_question": false }, @@ -40219,8 +40610,8 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 140315, - "total_submitted": 225483, + "total_acs": 141093, + "total_submitted": 226602, "frontend_question_id": 1035, "is_new_question": false }, @@ -40242,8 +40633,8 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 30889, - "total_submitted": 62842, + "total_acs": 31003, + "total_submitted": 63113, "frontend_question_id": 1034, "is_new_question": false }, @@ -40265,8 +40656,8 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 22866, - "total_submitted": 48888, + "total_acs": 22944, + "total_submitted": 48986, "frontend_question_id": 1033, "is_new_question": false }, @@ -40288,8 +40679,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": 44325, - "total_submitted": 75737, + "total_acs": 44454, + "total_submitted": 75953, "frontend_question_id": 1150, "is_new_question": false }, @@ -40311,8 +40702,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 63414, - "total_submitted": 103708, + "total_acs": 63905, + "total_submitted": 104611, "frontend_question_id": 1136, "is_new_question": false }, @@ -40334,8 +40725,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 67862, - "total_submitted": 110287, + "total_acs": 68289, + "total_submitted": 110917, "frontend_question_id": 1135, "is_new_question": false }, @@ -40357,8 +40748,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 58394, - "total_submitted": 109378, + "total_acs": 58633, + "total_submitted": 109742, "frontend_question_id": 1102, "is_new_question": false }, @@ -40380,8 +40771,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 44904, - "total_submitted": 66018, + "total_acs": 45367, + "total_submitted": 66621, "frontend_question_id": 1133, "is_new_question": false }, @@ -40403,8 +40794,8 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 83507, - "total_submitted": 161605, + "total_acs": 83627, + "total_submitted": 161829, "frontend_question_id": 1032, "is_new_question": false }, @@ -40426,8 +40817,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": 64761, - "total_submitted": 108627, + "total_acs": 65004, + "total_submitted": 109027, "frontend_question_id": 1031, "is_new_question": false }, @@ -40449,8 +40840,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 220551, - "total_submitted": 335322, + "total_acs": 221399, + "total_submitted": 336404, "frontend_question_id": 1029, "is_new_question": false }, @@ -40472,8 +40863,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 52166, - "total_submitted": 74568, + "total_acs": 52332, + "total_submitted": 74776, "frontend_question_id": 1030, "is_new_question": false }, @@ -40495,8 +40886,8 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 44315, - "total_submitted": 60324, + "total_acs": 44499, + "total_submitted": 60576, "frontend_question_id": 1028, "is_new_question": false }, @@ -40518,8 +40909,8 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 210792, - "total_submitted": 278740, + "total_acs": 211567, + "total_submitted": 279795, "frontend_question_id": 1026, "is_new_question": false }, @@ -40541,8 +40932,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 60318, - "total_submitted": 91915, + "total_acs": 60407, + "total_submitted": 92032, "frontend_question_id": 1120, "is_new_question": false }, @@ -40564,8 +40955,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 33336, - "total_submitted": 42819, + "total_acs": 33447, + "total_submitted": 42957, "frontend_question_id": 1134, "is_new_question": false }, @@ -40587,8 +40978,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 96900, - "total_submitted": 106718, + "total_acs": 97102, + "total_submitted": 106943, "frontend_question_id": 1119, "is_new_question": false }, @@ -40610,8 +41001,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 7791, - "total_submitted": 13522, + "total_acs": 7813, + "total_submitted": 13559, "frontend_question_id": 1118, "is_new_question": false }, @@ -40633,8 +41024,8 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 155308, - "total_submitted": 317010, + "total_acs": 156148, + "total_submitted": 318779, "frontend_question_id": 1027, "is_new_question": false }, @@ -40656,8 +41047,8 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 215115, - "total_submitted": 316972, + "total_acs": 216527, + "total_submitted": 318925, "frontend_question_id": 1025, "is_new_question": false }, @@ -40679,8 +41070,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": 70747, - "total_submitted": 109849, + "total_acs": 71151, + "total_submitted": 110503, "frontend_question_id": 1101, "is_new_question": false }, @@ -40702,8 +41093,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": 36911, - "total_submitted": 49447, + "total_acs": 37090, + "total_submitted": 49687, "frontend_question_id": 1100, "is_new_question": false }, @@ -40725,8 +41116,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 118681, - "total_submitted": 194192, + "total_acs": 119055, + "total_submitted": 194761, "frontend_question_id": 1099, "is_new_question": false }, @@ -40748,8 +41139,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": 22906, - "total_submitted": 29973, + "total_acs": 22942, + "total_submitted": 30020, "frontend_question_id": 1085, "is_new_question": false }, @@ -40771,8 +41162,8 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 59138, - "total_submitted": 117099, + "total_acs": 59409, + "total_submitted": 117576, "frontend_question_id": 1024, "is_new_question": false }, @@ -40794,8 +41185,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 41524, - "total_submitted": 67889, + "total_acs": 41745, + "total_submitted": 68206, "frontend_question_id": 1023, "is_new_question": false }, @@ -40817,8 +41208,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": 194578, - "total_submitted": 265237, + "total_acs": 195262, + "total_submitted": 266189, "frontend_question_id": 1022, "is_new_question": false }, @@ -40840,8 +41231,8 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 238391, - "total_submitted": 293416, + "total_acs": 241028, + "total_submitted": 296364, "frontend_question_id": 1021, "is_new_question": false }, @@ -40863,8 +41254,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 36061, - "total_submitted": 76469, + "total_acs": 36084, + "total_submitted": 76513, "frontend_question_id": 1088, "is_new_question": false }, @@ -40886,8 +41277,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 48952, - "total_submitted": 73910, + "total_acs": 49040, + "total_submitted": 74048, "frontend_question_id": 1087, "is_new_question": false }, @@ -40909,8 +41300,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 25778, - "total_submitted": 38646, + "total_acs": 25833, + "total_submitted": 38713, "frontend_question_id": 1065, "is_new_question": false }, @@ -40932,8 +41323,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 95286, - "total_submitted": 127181, + "total_acs": 95457, + "total_submitted": 127409, "frontend_question_id": 1086, "is_new_question": false }, @@ -40955,8 +41346,8 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 175900, - "total_submitted": 255711, + "total_acs": 177740, + "total_submitted": 258426, "frontend_question_id": 1020, "is_new_question": false }, @@ -40978,8 +41369,8 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 134376, - "total_submitted": 223913, + "total_acs": 135196, + "total_submitted": 225254, "frontend_question_id": 1019, "is_new_question": false }, @@ -41001,8 +41392,8 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 48812, - "total_submitted": 104556, + "total_acs": 48981, + "total_submitted": 104857, "frontend_question_id": 1018, "is_new_question": false }, @@ -41024,8 +41415,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 23791, - "total_submitted": 39310, + "total_acs": 23895, + "total_submitted": 39486, "frontend_question_id": 1017, "is_new_question": false }, @@ -41047,8 +41438,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 39572, - "total_submitted": 81729, + "total_acs": 39814, + "total_submitted": 82188, "frontend_question_id": 1056, "is_new_question": false }, @@ -41070,8 +41461,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 3693, - "total_submitted": 8058, + "total_acs": 3704, + "total_submitted": 8088, "frontend_question_id": 1067, "is_new_question": false }, @@ -41093,8 +41484,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 45321, - "total_submitted": 82567, + "total_acs": 45359, + "total_submitted": 82640, "frontend_question_id": 1066, "is_new_question": false }, @@ -41116,8 +41507,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 41691, - "total_submitted": 65008, + "total_acs": 41763, + "total_submitted": 65133, "frontend_question_id": 1064, "is_new_question": false }, @@ -41139,8 +41530,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": 34391, - "total_submitted": 60063, + "total_acs": 34526, + "total_submitted": 60253, "frontend_question_id": 1016, "is_new_question": false }, @@ -41162,8 +41553,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 60034, - "total_submitted": 128299, + "total_acs": 60099, + "total_submitted": 128435, "frontend_question_id": 1015, "is_new_question": false }, @@ -41185,8 +41576,8 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 86979, - "total_submitted": 146539, + "total_acs": 87209, + "total_submitted": 146900, "frontend_question_id": 1014, "is_new_question": false }, @@ -41208,8 +41599,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": 82910, - "total_submitted": 195980, + "total_acs": 83213, + "total_submitted": 196847, "frontend_question_id": 1013, "is_new_question": false }, @@ -41231,8 +41622,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 7827, - "total_submitted": 10459, + "total_acs": 7915, + "total_submitted": 10574, "frontend_question_id": 1063, "is_new_question": false }, @@ -41254,8 +41645,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 34000, - "total_submitted": 57260, + "total_acs": 34119, + "total_submitted": 57456, "frontend_question_id": 1062, "is_new_question": false }, @@ -41277,8 +41668,8 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 117896, - "total_submitted": 212999, + "total_acs": 118148, + "total_submitted": 213365, "frontend_question_id": 1060, "is_new_question": false }, @@ -41300,8 +41691,8 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 72502, - "total_submitted": 94692, + "total_acs": 72760, + "total_submitted": 95030, "frontend_question_id": 1061, "is_new_question": false }, @@ -41323,8 +41714,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 13485, - "total_submitted": 33164, + "total_acs": 13668, + "total_submitted": 33509, "frontend_question_id": 1012, "is_new_question": false }, @@ -41346,8 +41737,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": 291583, - "total_submitted": 427809, + "total_acs": 294745, + "total_submitted": 431985, "frontend_question_id": 1011, "is_new_question": false }, @@ -41369,8 +41760,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": 248400, - "total_submitted": 471547, + "total_acs": 249332, + "total_submitted": 473461, "frontend_question_id": 1010, "is_new_question": false }, @@ -41392,8 +41783,8 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 195710, - "total_submitted": 320587, + "total_acs": 197739, + "total_submitted": 324091, "frontend_question_id": 1009, "is_new_question": false }, @@ -41415,8 +41806,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 8589, - "total_submitted": 19083, + "total_acs": 8610, + "total_submitted": 19118, "frontend_question_id": 1058, "is_new_question": false }, @@ -41438,8 +41829,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 65176, - "total_submitted": 113155, + "total_acs": 65262, + "total_submitted": 113287, "frontend_question_id": 1057, "is_new_question": false }, @@ -41461,8 +41852,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 81915, - "total_submitted": 136908, + "total_acs": 82112, + "total_submitted": 137275, "frontend_question_id": 1055, "is_new_question": false }, @@ -41484,8 +41875,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": 313815, - "total_submitted": 384960, + "total_acs": 315951, + "total_submitted": 387410, "frontend_question_id": 1008, "is_new_question": false }, @@ -41507,8 +41898,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 194197, - "total_submitted": 371738, + "total_acs": 194572, + "total_submitted": 372468, "frontend_question_id": 1007, "is_new_question": false }, @@ -41530,8 +41921,8 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 26342, - "total_submitted": 46924, + "total_acs": 26456, + "total_submitted": 47092, "frontend_question_id": 1006, "is_new_question": false }, @@ -41553,8 +41944,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": 75846, - "total_submitted": 149331, + "total_acs": 76361, + "total_submitted": 150226, "frontend_question_id": 1005, "is_new_question": false }, @@ -41576,8 +41967,8 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 343002, - "total_submitted": 544605, + "total_acs": 348540, + "total_submitted": 553714, "frontend_question_id": 1004, "is_new_question": false }, @@ -41599,8 +41990,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": 52929, - "total_submitted": 90283, + "total_acs": 53187, + "total_submitted": 90657, "frontend_question_id": 1003, "is_new_question": false }, @@ -41622,8 +42013,8 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 187408, - "total_submitted": 273512, + "total_acs": 188220, + "total_submitted": 274685, "frontend_question_id": 1002, "is_new_question": false }, @@ -41645,8 +42036,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 18506, - "total_submitted": 50915, + "total_acs": 18558, + "total_submitted": 51049, "frontend_question_id": 1001, "is_new_question": false }, @@ -41668,8 +42059,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 35577, - "total_submitted": 83416, + "total_acs": 35791, + "total_submitted": 83811, "frontend_question_id": 1000, "is_new_question": false }, @@ -41691,8 +42082,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 60156, - "total_submitted": 88005, + "total_acs": 60349, + "total_submitted": 88254, "frontend_question_id": 999, "is_new_question": false }, @@ -41714,8 +42105,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 32608, - "total_submitted": 48096, + "total_acs": 32700, + "total_submitted": 48195, "frontend_question_id": 998, "is_new_question": false }, @@ -41737,8 +42128,8 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 423285, - "total_submitted": 857946, + "total_acs": 424849, + "total_submitted": 861336, "frontend_question_id": 997, "is_new_question": false }, @@ -41760,8 +42151,8 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 32457, - "total_submitted": 66060, + "total_acs": 32595, + "total_submitted": 66371, "frontend_question_id": 996, "is_new_question": false }, @@ -41783,8 +42174,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": 31737, - "total_submitted": 61840, + "total_acs": 31840, + "total_submitted": 62032, "frontend_question_id": 995, "is_new_question": false }, @@ -41806,8 +42197,8 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 656094, - "total_submitted": 1229297, + "total_acs": 663334, + "total_submitted": 1242126, "frontend_question_id": 994, "is_new_question": false }, @@ -41829,8 +42220,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 249996, - "total_submitted": 454186, + "total_acs": 250690, + "total_submitted": 455218, "frontend_question_id": 993, "is_new_question": false }, @@ -41852,8 +42243,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 101067, - "total_submitted": 182249, + "total_acs": 101950, + "total_submitted": 183560, "frontend_question_id": 992, "is_new_question": false }, @@ -41875,8 +42266,8 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 95219, - "total_submitted": 175599, + "total_acs": 95416, + "total_submitted": 175913, "frontend_question_id": 991, "is_new_question": false }, @@ -41898,8 +42289,8 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 115093, - "total_submitted": 227970, + "total_acs": 115568, + "total_submitted": 228982, "frontend_question_id": 990, "is_new_question": false }, @@ -41921,8 +42312,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 233816, - "total_submitted": 503803, + "total_acs": 234671, + "total_submitted": 506125, "frontend_question_id": 989, "is_new_question": false }, @@ -41944,8 +42335,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 69415, - "total_submitted": 137193, + "total_acs": 69674, + "total_submitted": 137691, "frontend_question_id": 988, "is_new_question": false }, @@ -41967,8 +42358,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": 354164, - "total_submitted": 771896, + "total_acs": 356855, + "total_submitted": 776564, "frontend_question_id": 987, "is_new_question": false }, @@ -41990,8 +42381,8 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 361785, - "total_submitted": 507544, + "total_acs": 362597, + "total_submitted": 508642, "frontend_question_id": 986, "is_new_question": false }, @@ -42013,8 +42404,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 133434, - "total_submitted": 196151, + "total_acs": 133623, + "total_submitted": 196421, "frontend_question_id": 985, "is_new_question": false }, @@ -42036,8 +42427,8 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 42870, - "total_submitted": 98776, + "total_acs": 43016, + "total_submitted": 99069, "frontend_question_id": 984, "is_new_question": false }, @@ -42059,8 +42450,8 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 256475, - "total_submitted": 390726, + "total_acs": 257850, + "total_submitted": 392919, "frontend_question_id": 983, "is_new_question": false }, @@ -42082,8 +42473,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": 15654, - "total_submitted": 27081, + "total_acs": 15772, + "total_submitted": 27270, "frontend_question_id": 982, "is_new_question": false }, @@ -42105,8 +42496,8 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 343276, - "total_submitted": 673590, + "total_acs": 346404, + "total_submitted": 680915, "frontend_question_id": 981, "is_new_question": false }, @@ -42128,8 +42519,8 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 180633, - "total_submitted": 221238, + "total_acs": 182424, + "total_submitted": 223297, "frontend_question_id": 980, "is_new_question": false }, @@ -42151,8 +42542,8 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 104823, - "total_submitted": 144891, + "total_acs": 105117, + "total_submitted": 145308, "frontend_question_id": 979, "is_new_question": false }, @@ -42174,8 +42565,8 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 87836, - "total_submitted": 185980, + "total_acs": 88285, + "total_submitted": 186964, "frontend_question_id": 978, "is_new_question": false }, @@ -42197,8 +42588,8 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 1474365, - "total_submitted": 2053382, + "total_acs": 1480984, + "total_submitted": 2062702, "frontend_question_id": 977, "is_new_question": false }, @@ -42220,8 +42611,8 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 213465, - "total_submitted": 388848, + "total_acs": 214120, + "total_submitted": 389898, "frontend_question_id": 976, "is_new_question": false }, @@ -42243,8 +42634,8 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 75443, - "total_submitted": 192612, + "total_acs": 75736, + "total_submitted": 193339, "frontend_question_id": 975, "is_new_question": false }, @@ -42266,8 +42657,8 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 209079, - "total_submitted": 387245, + "total_acs": 210208, + "total_submitted": 389500, "frontend_question_id": 974, "is_new_question": false }, @@ -42289,8 +42680,8 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 1017872, - "total_submitted": 1547105, + "total_acs": 1023494, + "total_submitted": 1555480, "frontend_question_id": 973, "is_new_question": false }, @@ -42312,8 +42703,8 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 1445647, - "total_submitted": 2060126, + "total_acs": 1458334, + "total_submitted": 2077336, "frontend_question_id": 509, "is_new_question": false }, @@ -42335,8 +42726,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 6481, - "total_submitted": 14967, + "total_acs": 6502, + "total_submitted": 15034, "frontend_question_id": 972, "is_new_question": false }, @@ -42358,8 +42749,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": 39541, - "total_submitted": 78833, + "total_acs": 39627, + "total_submitted": 78976, "frontend_question_id": 971, "is_new_question": false }, @@ -42381,8 +42772,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 51657, - "total_submitted": 118277, + "total_acs": 51768, + "total_submitted": 118544, "frontend_question_id": 970, "is_new_question": false }, @@ -42404,8 +42795,8 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 86293, - "total_submitted": 122726, + "total_acs": 86567, + "total_submitted": 123159, "frontend_question_id": 969, "is_new_question": false }, @@ -42427,8 +42818,8 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 124922, - "total_submitted": 268514, + "total_acs": 125388, + "total_submitted": 269554, "frontend_question_id": 968, "is_new_question": false }, @@ -42450,8 +42841,8 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 123333, - "total_submitted": 214273, + "total_acs": 123640, + "total_submitted": 214731, "frontend_question_id": 967, "is_new_question": false }, @@ -42473,8 +42864,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 39005, - "total_submitted": 76022, + "total_acs": 39060, + "total_submitted": 76132, "frontend_question_id": 966, "is_new_question": false }, @@ -42496,8 +42887,8 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 198589, - "total_submitted": 283510, + "total_acs": 199419, + "total_submitted": 284518, "frontend_question_id": 965, "is_new_question": false }, @@ -42519,8 +42910,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 9143, - "total_submitted": 19030, + "total_acs": 9178, + "total_submitted": 19098, "frontend_question_id": 964, "is_new_question": false }, @@ -42542,8 +42933,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 25627, - "total_submitted": 46888, + "total_acs": 25656, + "total_submitted": 46957, "frontend_question_id": 963, "is_new_question": false }, @@ -42565,8 +42956,8 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 41553, - "total_submitted": 84785, + "total_acs": 41704, + "total_submitted": 85062, "frontend_question_id": 962, "is_new_question": false }, @@ -42588,8 +42979,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": 212930, - "total_submitted": 279432, + "total_acs": 213653, + "total_submitted": 280301, "frontend_question_id": 961, "is_new_question": false }, @@ -42611,8 +43002,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 12843, - "total_submitted": 22472, + "total_acs": 12978, + "total_submitted": 22659, "frontend_question_id": 960, "is_new_question": false }, @@ -42634,8 +43025,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 47697, - "total_submitted": 68886, + "total_acs": 47912, + "total_submitted": 69166, "frontend_question_id": 959, "is_new_question": false }, @@ -42657,8 +43048,8 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 204286, - "total_submitted": 363128, + "total_acs": 205202, + "total_submitted": 364623, "frontend_question_id": 958, "is_new_question": false }, @@ -42680,8 +43071,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 154100, - "total_submitted": 394947, + "total_acs": 154334, + "total_submitted": 395677, "frontend_question_id": 957, "is_new_question": false }, @@ -42703,8 +43094,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 54382, - "total_submitted": 103207, + "total_acs": 54576, + "total_submitted": 103599, "frontend_question_id": 956, "is_new_question": false }, @@ -42726,8 +43117,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 18509, - "total_submitted": 53149, + "total_acs": 18585, + "total_submitted": 53358, "frontend_question_id": 955, "is_new_question": false }, @@ -42749,8 +43140,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 82696, - "total_submitted": 211588, + "total_acs": 82939, + "total_submitted": 212337, "frontend_question_id": 954, "is_new_question": false }, @@ -42772,8 +43163,8 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 468380, - "total_submitted": 858234, + "total_acs": 469312, + "total_submitted": 859795, "frontend_question_id": 953, "is_new_question": false }, @@ -42795,8 +43186,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 50230, - "total_submitted": 124842, + "total_acs": 50390, + "total_submitted": 125129, "frontend_question_id": 952, "is_new_question": false }, @@ -42818,8 +43209,8 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 133460, - "total_submitted": 199738, + "total_acs": 134290, + "total_submitted": 200890, "frontend_question_id": 951, "is_new_question": false }, @@ -42841,8 +43232,8 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 69610, - "total_submitted": 89417, + "total_acs": 69901, + "total_submitted": 89746, "frontend_question_id": 950, "is_new_question": false }, @@ -42864,8 +43255,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 80643, - "total_submitted": 229729, + "total_acs": 80852, + "total_submitted": 230317, "frontend_question_id": 949, "is_new_question": false }, @@ -42887,8 +43278,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 102892, - "total_submitted": 197322, + "total_acs": 103118, + "total_submitted": 197746, "frontend_question_id": 948, "is_new_question": false }, @@ -42910,8 +43301,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": 185859, - "total_submitted": 315772, + "total_acs": 186833, + "total_submitted": 317443, "frontend_question_id": 947, "is_new_question": false }, @@ -42933,8 +43324,8 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 278582, - "total_submitted": 401484, + "total_acs": 279662, + "total_submitted": 403043, "frontend_question_id": 946, "is_new_question": false }, @@ -42956,8 +43347,8 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 79409, - "total_submitted": 153697, + "total_acs": 79781, + "total_submitted": 154292, "frontend_question_id": 945, "is_new_question": false }, @@ -42979,8 +43370,8 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 176043, - "total_submitted": 235780, + "total_acs": 176445, + "total_submitted": 236366, "frontend_question_id": 944, "is_new_question": false }, @@ -43002,8 +43393,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 26735, - "total_submitted": 60707, + "total_acs": 26802, + "total_submitted": 60985, "frontend_question_id": 943, "is_new_question": false }, @@ -43025,8 +43416,8 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 137966, - "total_submitted": 177572, + "total_acs": 138615, + "total_submitted": 178302, "frontend_question_id": 942, "is_new_question": false }, @@ -43048,8 +43439,8 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 377006, - "total_submitted": 1130713, + "total_acs": 378524, + "total_submitted": 1135536, "frontend_question_id": 941, "is_new_question": false }, @@ -43071,8 +43462,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 34865, - "total_submitted": 80430, + "total_acs": 35053, + "total_submitted": 80949, "frontend_question_id": 940, "is_new_question": false }, @@ -43094,8 +43485,8 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 124348, - "total_submitted": 234502, + "total_acs": 124574, + "total_submitted": 234918, "frontend_question_id": 939, "is_new_question": false }, @@ -43117,8 +43508,8 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 806960, - "total_submitted": 939663, + "total_acs": 809356, + "total_submitted": 942454, "frontend_question_id": 938, "is_new_question": false }, @@ -43140,8 +43531,8 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 346283, - "total_submitted": 614577, + "total_acs": 346743, + "total_submitted": 615361, "frontend_question_id": 937, "is_new_question": false }, @@ -43163,8 +43554,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 56978, - "total_submitted": 90924, + "total_acs": 57024, + "total_submitted": 91006, "frontend_question_id": 936, "is_new_question": false }, @@ -43186,8 +43577,8 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 103391, - "total_submitted": 202630, + "total_acs": 103745, + "total_submitted": 203121, "frontend_question_id": 935, "is_new_question": false }, @@ -43209,8 +43600,8 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 177811, - "total_submitted": 308017, + "total_acs": 179196, + "total_submitted": 310296, "frontend_question_id": 934, "is_new_question": false }, @@ -43232,8 +43623,8 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 165711, - "total_submitted": 225891, + "total_acs": 168505, + "total_submitted": 229457, "frontend_question_id": 933, "is_new_question": false }, @@ -43255,8 +43646,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 41003, - "total_submitted": 62763, + "total_acs": 41137, + "total_submitted": 62962, "frontend_question_id": 932, "is_new_question": false }, @@ -43278,8 +43669,8 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 270842, - "total_submitted": 405754, + "total_acs": 273458, + "total_submitted": 411483, "frontend_question_id": 931, "is_new_question": false }, @@ -43301,8 +43692,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 78186, - "total_submitted": 144743, + "total_acs": 79359, + "total_submitted": 146592, "frontend_question_id": 930, "is_new_question": false }, @@ -43324,8 +43715,8 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 437688, - "total_submitted": 652988, + "total_acs": 439331, + "total_submitted": 655479, "frontend_question_id": 929, "is_new_question": false }, @@ -43347,8 +43738,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 19203, - "total_submitted": 44827, + "total_acs": 19268, + "total_submitted": 44965, "frontend_question_id": 928, "is_new_question": false }, @@ -43370,8 +43761,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 28400, - "total_submitted": 71749, + "total_acs": 28443, + "total_submitted": 71854, "frontend_question_id": 927, "is_new_question": false }, @@ -43393,8 +43784,8 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 180962, - "total_submitted": 294569, + "total_acs": 181294, + "total_submitted": 295107, "frontend_question_id": 926, "is_new_question": false }, @@ -43416,8 +43807,8 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 123477, - "total_submitted": 376643, + "total_acs": 124037, + "total_submitted": 378654, "frontend_question_id": 925, "is_new_question": false }, @@ -43439,8 +43830,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 44776, - "total_submitted": 106428, + "total_acs": 44907, + "total_submitted": 106749, "frontend_question_id": 924, "is_new_question": false }, @@ -43462,8 +43853,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 97490, - "total_submitted": 215360, + "total_acs": 97691, + "total_submitted": 215826, "frontend_question_id": 923, "is_new_question": false }, @@ -43485,8 +43876,8 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 225966, - "total_submitted": 320244, + "total_acs": 226903, + "total_submitted": 321500, "frontend_question_id": 922, "is_new_question": false }, @@ -43508,8 +43899,8 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 267453, - "total_submitted": 355141, + "total_acs": 268851, + "total_submitted": 357150, "frontend_question_id": 921, "is_new_question": false }, @@ -43531,8 +43922,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 63028, - "total_submitted": 102833, + "total_acs": 63826, + "total_submitted": 104411, "frontend_question_id": 920, "is_new_question": false }, @@ -43554,8 +43945,8 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 46846, - "total_submitted": 72549, + "total_acs": 47014, + "total_submitted": 72781, "frontend_question_id": 919, "is_new_question": false }, @@ -43577,8 +43968,8 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 219707, - "total_submitted": 505010, + "total_acs": 221179, + "total_submitted": 507646, "frontend_question_id": 918, "is_new_question": false }, @@ -43600,8 +43991,8 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 175050, - "total_submitted": 279240, + "total_acs": 176458, + "total_submitted": 281205, "frontend_question_id": 917, "is_new_question": false }, @@ -43623,8 +44014,8 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 109800, - "total_submitted": 206601, + "total_acs": 109959, + "total_submitted": 207058, "frontend_question_id": 916, "is_new_question": false }, @@ -43646,8 +44037,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 76466, - "total_submitted": 157720, + "total_acs": 76681, + "total_submitted": 158070, "frontend_question_id": 915, "is_new_question": false }, @@ -43669,8 +44060,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": 108974, - "total_submitted": 356050, + "total_acs": 109404, + "total_submitted": 358108, "frontend_question_id": 914, "is_new_question": false }, @@ -43692,8 +44083,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 17759, - "total_submitted": 51510, + "total_acs": 17807, + "total_submitted": 51687, "frontend_question_id": 913, "is_new_question": false }, @@ -43715,8 +44106,8 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 490524, - "total_submitted": 840207, + "total_acs": 494555, + "total_submitted": 848458, "frontend_question_id": 912, "is_new_question": false }, @@ -43738,8 +44129,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 51376, - "total_submitted": 98861, + "total_acs": 51565, + "total_submitted": 99203, "frontend_question_id": 911, "is_new_question": false }, @@ -43761,8 +44152,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 48886, - "total_submitted": 137518, + "total_acs": 49182, + "total_submitted": 138155, "frontend_question_id": 910, "is_new_question": false }, @@ -43784,8 +44175,8 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 146727, - "total_submitted": 329022, + "total_acs": 148171, + "total_submitted": 332570, "frontend_question_id": 909, "is_new_question": false }, @@ -43807,8 +44198,8 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 76684, - "total_submitted": 111638, + "total_acs": 77095, + "total_submitted": 112132, "frontend_question_id": 908, "is_new_question": false }, @@ -43830,8 +44221,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 153522, - "total_submitted": 433916, + "total_acs": 154558, + "total_submitted": 437292, "frontend_question_id": 907, "is_new_question": false }, @@ -43853,8 +44244,8 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 22937, - "total_submitted": 58965, + "total_acs": 23003, + "total_submitted": 59134, "frontend_question_id": 906, "is_new_question": false }, @@ -43876,8 +44267,8 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 620467, - "total_submitted": 821850, + "total_acs": 622878, + "total_submitted": 825120, "frontend_question_id": 905, "is_new_question": false }, @@ -43899,8 +44290,8 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 349471, - "total_submitted": 798971, + "total_acs": 351275, + "total_submitted": 802938, "frontend_question_id": 904, "is_new_question": false }, @@ -43922,8 +44313,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 14218, - "total_submitted": 24707, + "total_acs": 14272, + "total_submitted": 24787, "frontend_question_id": 903, "is_new_question": false }, @@ -43945,8 +44336,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": 41485, - "total_submitted": 99144, + "total_acs": 41627, + "total_submitted": 99409, "frontend_question_id": 902, "is_new_question": false }, @@ -43968,8 +44359,8 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 244636, - "total_submitted": 373927, + "total_acs": 247151, + "total_submitted": 377688, "frontend_question_id": 901, "is_new_question": false }, @@ -43991,8 +44382,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 65029, - "total_submitted": 109523, + "total_acs": 65128, + "total_submitted": 109684, "frontend_question_id": 900, "is_new_question": false }, @@ -44014,8 +44405,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 66101, - "total_submitted": 100104, + "total_acs": 66223, + "total_submitted": 100326, "frontend_question_id": 899, "is_new_question": false }, @@ -44037,8 +44428,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 32157, - "total_submitted": 85231, + "total_acs": 32359, + "total_submitted": 85572, "frontend_question_id": 898, "is_new_question": false }, @@ -44060,8 +44451,8 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 257288, - "total_submitted": 328667, + "total_acs": 258136, + "total_submitted": 329784, "frontend_question_id": 897, "is_new_question": false }, @@ -44083,8 +44474,8 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 274056, - "total_submitted": 468280, + "total_acs": 275984, + "total_submitted": 471502, "frontend_question_id": 896, "is_new_question": false }, @@ -44106,8 +44497,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 157110, - "total_submitted": 236102, + "total_acs": 157674, + "total_submitted": 236900, "frontend_question_id": 895, "is_new_question": false }, @@ -44129,8 +44520,8 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 157452, - "total_submitted": 190202, + "total_acs": 158235, + "total_submitted": 191156, "frontend_question_id": 894, "is_new_question": false }, @@ -44152,8 +44543,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 45803, - "total_submitted": 64327, + "total_acs": 45895, + "total_submitted": 64435, "frontend_question_id": 893, "is_new_question": false }, @@ -44175,8 +44566,8 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 35659, - "total_submitted": 55352, + "total_acs": 35811, + "total_submitted": 55524, "frontend_question_id": 892, "is_new_question": false }, @@ -44198,8 +44589,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 19209, - "total_submitted": 51981, + "total_acs": 19265, + "total_submitted": 52116, "frontend_question_id": 891, "is_new_question": false }, @@ -44221,8 +44612,8 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 172880, - "total_submitted": 223740, + "total_acs": 173229, + "total_submitted": 224253, "frontend_question_id": 890, "is_new_question": false }, @@ -44244,8 +44635,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": 92512, - "total_submitted": 129915, + "total_acs": 92884, + "total_submitted": 130414, "frontend_question_id": 889, "is_new_question": false }, @@ -44267,8 +44658,8 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 106270, - "total_submitted": 174435, + "total_acs": 106724, + "total_submitted": 175098, "frontend_question_id": 888, "is_new_question": false }, @@ -44290,8 +44681,8 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 63474, - "total_submitted": 232709, + "total_acs": 63923, + "total_submitted": 234261, "frontend_question_id": 887, "is_new_question": false }, @@ -44313,8 +44704,8 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 189717, - "total_submitted": 377723, + "total_acs": 190332, + "total_submitted": 378809, "frontend_question_id": 886, "is_new_question": false }, @@ -44336,8 +44727,8 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 44156, - "total_submitted": 59699, + "total_acs": 44334, + "total_submitted": 59930, "frontend_question_id": 885, "is_new_question": false }, @@ -44359,8 +44750,8 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 123147, - "total_submitted": 185195, + "total_acs": 123782, + "total_submitted": 186112, "frontend_question_id": 884, "is_new_question": false }, @@ -44382,8 +44773,8 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 49776, - "total_submitted": 69595, + "total_acs": 49987, + "total_submitted": 69852, "frontend_question_id": 883, "is_new_question": false }, @@ -44405,8 +44796,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 24707, - "total_submitted": 49338, + "total_acs": 24829, + "total_submitted": 49599, "frontend_question_id": 882, "is_new_question": false }, @@ -44428,8 +44819,8 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 260025, - "total_submitted": 464252, + "total_acs": 261203, + "total_submitted": 466103, "frontend_question_id": 881, "is_new_question": false }, @@ -44451,8 +44842,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 37753, - "total_submitted": 132459, + "total_acs": 37913, + "total_submitted": 132903, "frontend_question_id": 880, "is_new_question": false }, @@ -44474,8 +44865,8 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 37956, - "total_submitted": 95966, + "total_acs": 38023, + "total_submitted": 96157, "frontend_question_id": 478, "is_new_question": false }, @@ -44497,8 +44888,8 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 37724, - "total_submitted": 95561, + "total_acs": 37776, + "total_submitted": 95677, "frontend_question_id": 497, "is_new_question": false }, @@ -44520,8 +44911,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 17192, - "total_submitted": 42600, + "total_acs": 17320, + "total_submitted": 42867, "frontend_question_id": 519, "is_new_question": false }, @@ -44543,8 +44934,8 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 371536, - "total_submitted": 805250, + "total_acs": 372817, + "total_submitted": 807839, "frontend_question_id": 528, "is_new_question": false }, @@ -44566,8 +44957,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 58304, - "total_submitted": 118873, + "total_acs": 58519, + "total_submitted": 119428, "frontend_question_id": 879, "is_new_question": false }, @@ -44589,8 +44980,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 34283, - "total_submitted": 97161, + "total_acs": 34393, + "total_submitted": 97498, "frontend_question_id": 878, "is_new_question": false }, @@ -44612,8 +45003,8 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 203094, - "total_submitted": 289717, + "total_acs": 204486, + "total_submitted": 291589, "frontend_question_id": 877, "is_new_question": false }, @@ -44635,8 +45026,8 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 1448430, - "total_submitted": 1897184, + "total_acs": 1461340, + "total_submitted": 1912406, "frontend_question_id": 876, "is_new_question": false }, @@ -44658,8 +45049,8 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 419215, - "total_submitted": 829497, + "total_acs": 426925, + "total_submitted": 848189, "frontend_question_id": 875, "is_new_question": false }, @@ -44681,8 +45072,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 37600, - "total_submitted": 95756, + "total_acs": 37688, + "total_submitted": 95934, "frontend_question_id": 874, "is_new_question": false }, @@ -44704,8 +45095,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 57991, - "total_submitted": 120301, + "total_acs": 58167, + "total_submitted": 120679, "frontend_question_id": 873, "is_new_question": false }, @@ -44727,8 +45118,8 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 277140, - "total_submitted": 408925, + "total_acs": 280024, + "total_submitted": 413111, "frontend_question_id": 872, "is_new_question": false }, @@ -44750,8 +45141,8 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 73796, - "total_submitted": 160021, + "total_acs": 74037, + "total_submitted": 160663, "frontend_question_id": 470, "is_new_question": false }, @@ -44773,8 +45164,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 125518, - "total_submitted": 315700, + "total_acs": 125928, + "total_submitted": 316665, "frontend_question_id": 871, "is_new_question": false }, @@ -44796,8 +45187,8 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 62298, - "total_submitted": 119792, + "total_acs": 62458, + "total_submitted": 120050, "frontend_question_id": 870, "is_new_question": false }, @@ -44819,8 +45210,8 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 108677, - "total_submitted": 171978, + "total_acs": 108839, + "total_submitted": 172271, "frontend_question_id": 869, "is_new_question": false }, @@ -44842,8 +45233,8 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 72373, - "total_submitted": 115884, + "total_acs": 72632, + "total_submitted": 116254, "frontend_question_id": 868, "is_new_question": false }, @@ -44865,8 +45256,8 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 258369, - "total_submitted": 395889, + "total_acs": 260029, + "total_submitted": 397856, "frontend_question_id": 867, "is_new_question": false }, @@ -44888,8 +45279,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 29441, - "total_submitted": 114263, + "total_acs": 29536, + "total_submitted": 114604, "frontend_question_id": 866, "is_new_question": false }, @@ -44911,8 +45302,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": 119752, - "total_submitted": 172998, + "total_acs": 120071, + "total_submitted": 173402, "frontend_question_id": 865, "is_new_question": false }, @@ -44934,8 +45325,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 68216, - "total_submitted": 125688, + "total_acs": 68468, + "total_submitted": 126295, "frontend_question_id": 864, "is_new_question": false }, @@ -44957,8 +45348,8 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 37673, - "total_submitted": 112357, + "total_acs": 37796, + "total_submitted": 112715, "frontend_question_id": 710, "is_new_question": false }, @@ -44980,8 +45371,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": 373223, - "total_submitted": 583540, + "total_acs": 375205, + "total_submitted": 586608, "frontend_question_id": 863, "is_new_question": false }, @@ -45003,8 +45394,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": 89223, - "total_submitted": 344079, + "total_acs": 89660, + "total_submitted": 345713, "frontend_question_id": 862, "is_new_question": false }, @@ -45026,8 +45417,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 43505, - "total_submitted": 58130, + "total_acs": 43720, + "total_submitted": 58409, "frontend_question_id": 861, "is_new_question": false }, @@ -45049,8 +45440,8 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 143724, - "total_submitted": 271190, + "total_acs": 145010, + "total_submitted": 273670, "frontend_question_id": 860, "is_new_question": false }, @@ -45072,8 +45463,8 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 218736, - "total_submitted": 665453, + "total_acs": 219466, + "total_submitted": 667618, "frontend_question_id": 859, "is_new_question": false }, @@ -45095,8 +45486,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 76619, - "total_submitted": 121897, + "total_acs": 76677, + "total_submitted": 122030, "frontend_question_id": 858, "is_new_question": false }, @@ -45118,8 +45509,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 61060, - "total_submitted": 116007, + "total_acs": 61294, + "total_submitted": 116409, "frontend_question_id": 857, "is_new_question": false }, @@ -45141,8 +45532,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 162436, - "total_submitted": 252032, + "total_acs": 163123, + "total_submitted": 253227, "frontend_question_id": 856, "is_new_question": false }, @@ -45164,8 +45555,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 56186, - "total_submitted": 129598, + "total_acs": 56322, + "total_submitted": 129951, "frontend_question_id": 855, "is_new_question": false }, @@ -45187,8 +45578,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 42223, - "total_submitted": 105855, + "total_acs": 42348, + "total_submitted": 106151, "frontend_question_id": 854, "is_new_question": false }, @@ -45210,8 +45601,8 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 163634, - "total_submitted": 325823, + "total_acs": 166902, + "total_submitted": 332203, "frontend_question_id": 853, "is_new_question": false }, @@ -45233,8 +45624,8 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 675668, - "total_submitted": 978855, + "total_acs": 681791, + "total_submitted": 988342, "frontend_question_id": 852, "is_new_question": false }, @@ -45256,8 +45647,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 36547, - "total_submitted": 62276, + "total_acs": 37067, + "total_submitted": 63116, "frontend_question_id": 851, "is_new_question": false }, @@ -45279,8 +45670,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 33159, - "total_submitted": 61355, + "total_acs": 33232, + "total_submitted": 61524, "frontend_question_id": 850, "is_new_question": false }, @@ -45302,8 +45693,8 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 206130, - "total_submitted": 431919, + "total_acs": 206759, + "total_submitted": 433231, "frontend_question_id": 849, "is_new_question": false }, @@ -45325,8 +45716,8 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 88731, - "total_submitted": 197418, + "total_acs": 89115, + "total_submitted": 198259, "frontend_question_id": 848, "is_new_question": false }, @@ -45348,8 +45739,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 72558, - "total_submitted": 119547, + "total_acs": 72859, + "total_submitted": 120080, "frontend_question_id": 847, "is_new_question": false }, @@ -45371,8 +45762,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 129765, - "total_submitted": 231715, + "total_acs": 131330, + "total_submitted": 234556, "frontend_question_id": 846, "is_new_question": false }, @@ -45394,8 +45785,8 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 115050, - "total_submitted": 286372, + "total_acs": 115523, + "total_submitted": 287489, "frontend_question_id": 845, "is_new_question": false }, @@ -45417,8 +45808,8 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 657971, - "total_submitted": 1369000, + "total_acs": 661028, + "total_submitted": 1375157, "frontend_question_id": 844, "is_new_question": false }, @@ -45440,8 +45831,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 134426, - "total_submitted": 331105, + "total_acs": 134899, + "total_submitted": 332897, "frontend_question_id": 843, "is_new_question": false }, @@ -45463,8 +45854,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 36279, - "total_submitted": 93973, + "total_acs": 36382, + "total_submitted": 94197, "frontend_question_id": 842, "is_new_question": false }, @@ -45486,8 +45877,8 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 344339, - "total_submitted": 478634, + "total_acs": 347654, + "total_submitted": 482896, "frontend_question_id": 841, "is_new_question": false }, @@ -45509,8 +45900,8 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 36289, - "total_submitted": 93740, + "total_acs": 36371, + "total_submitted": 93919, "frontend_question_id": 840, "is_new_question": false }, @@ -45532,8 +45923,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 110687, - "total_submitted": 203177, + "total_acs": 111005, + "total_submitted": 203696, "frontend_question_id": 839, "is_new_question": false }, @@ -45555,8 +45946,8 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 115993, - "total_submitted": 203347, + "total_acs": 116293, + "total_submitted": 203924, "frontend_question_id": 838, "is_new_question": false }, @@ -45578,8 +45969,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 71483, - "total_submitted": 157708, + "total_acs": 71677, + "total_submitted": 158231, "frontend_question_id": 837, "is_new_question": false }, @@ -45601,8 +45992,8 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 128719, - "total_submitted": 291921, + "total_acs": 129153, + "total_submitted": 292906, "frontend_question_id": 836, "is_new_question": false }, @@ -45624,8 +46015,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 146505, - "total_submitted": 191366, + "total_acs": 146853, + "total_submitted": 191814, "frontend_question_id": 489, "is_new_question": false }, @@ -45647,8 +46038,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 90019, - "total_submitted": 141205, + "total_acs": 90178, + "total_submitted": 141449, "frontend_question_id": 835, "is_new_question": false }, @@ -45670,8 +46061,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 84606, - "total_submitted": 143094, + "total_acs": 84866, + "total_submitted": 143520, "frontend_question_id": 834, "is_new_question": false }, @@ -45693,8 +46084,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 137340, - "total_submitted": 254947, + "total_acs": 137818, + "total_submitted": 255841, "frontend_question_id": 833, "is_new_question": false }, @@ -45716,8 +46107,8 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 376386, - "total_submitted": 464246, + "total_acs": 378215, + "total_submitted": 466305, "frontend_question_id": 832, "is_new_question": false }, @@ -45739,8 +46130,8 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 275921, - "total_submitted": 537306, + "total_acs": 277017, + "total_submitted": 539566, "frontend_question_id": 622, "is_new_question": false }, @@ -45762,8 +46153,8 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 58949, - "total_submitted": 103464, + "total_acs": 59324, + "total_submitted": 104155, "frontend_question_id": 641, "is_new_question": false }, @@ -45785,8 +46176,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 17319, - "total_submitted": 36263, + "total_acs": 17445, + "total_submitted": 36422, "frontend_question_id": 831, "is_new_question": false }, @@ -45808,8 +46199,8 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 86037, - "total_submitted": 165776, + "total_acs": 86344, + "total_submitted": 166342, "frontend_question_id": 830, "is_new_question": false }, @@ -45831,8 +46222,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 80404, - "total_submitted": 193126, + "total_acs": 80627, + "total_submitted": 193704, "frontend_question_id": 829, "is_new_question": false }, @@ -45854,8 +46245,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": 65527, - "total_submitted": 126529, + "total_acs": 65854, + "total_submitted": 127077, "frontend_question_id": 828, "is_new_question": false }, @@ -45877,8 +46268,8 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 136264, - "total_submitted": 300192, + "total_acs": 137065, + "total_submitted": 301613, "frontend_question_id": 827, "is_new_question": false }, @@ -45900,8 +46291,8 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 57647, - "total_submitted": 127691, + "total_acs": 58028, + "total_submitted": 128485, "frontend_question_id": 826, "is_new_question": false }, @@ -45923,8 +46314,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 72655, - "total_submitted": 156727, + "total_acs": 72798, + "total_submitted": 157027, "frontend_question_id": 825, "is_new_question": false }, @@ -45946,8 +46337,8 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 161057, - "total_submitted": 237325, + "total_acs": 161445, + "total_submitted": 237892, "frontend_question_id": 824, "is_new_question": false }, @@ -45969,8 +46360,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": 133354, - "total_submitted": 384798, + "total_acs": 133724, + "total_submitted": 385664, "frontend_question_id": 708, "is_new_question": false }, @@ -45992,8 +46383,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 90945, - "total_submitted": 183267, + "total_acs": 91066, + "total_submitted": 183521, "frontend_question_id": 823, "is_new_question": false }, @@ -46015,8 +46406,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 16115, - "total_submitted": 34756, + "total_acs": 16202, + "total_submitted": 34909, "frontend_question_id": 822, "is_new_question": false }, @@ -46038,8 +46429,8 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 164212, - "total_submitted": 230295, + "total_acs": 164865, + "total_submitted": 231225, "frontend_question_id": 821, "is_new_question": false }, @@ -46061,8 +46452,8 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 92766, - "total_submitted": 153244, + "total_acs": 92923, + "total_submitted": 153479, "frontend_question_id": 820, "is_new_question": false }, @@ -46084,8 +46475,8 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 272849, - "total_submitted": 985744, + "total_acs": 274538, + "total_submitted": 991479, "frontend_question_id": 707, "is_new_question": false }, @@ -46107,8 +46498,8 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 330697, - "total_submitted": 742375, + "total_acs": 331392, + "total_submitted": 744172, "frontend_question_id": 819, "is_new_question": false }, @@ -46130,8 +46521,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 79242, - "total_submitted": 182197, + "total_acs": 79545, + "total_submitted": 182901, "frontend_question_id": 818, "is_new_question": false }, @@ -46153,8 +46544,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 83286, - "total_submitted": 145322, + "total_acs": 83651, + "total_submitted": 145999, "frontend_question_id": 817, "is_new_question": false }, @@ -46176,8 +46567,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 28123, - "total_submitted": 49861, + "total_acs": 28162, + "total_submitted": 49933, "frontend_question_id": 816, "is_new_question": false }, @@ -46199,8 +46590,8 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 131374, - "total_submitted": 288582, + "total_acs": 132152, + "total_submitted": 290250, "frontend_question_id": 815, "is_new_question": false }, @@ -46222,8 +46613,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 229796, - "total_submitted": 317592, + "total_acs": 230324, + "total_submitted": 318368, "frontend_question_id": 814, "is_new_question": false }, @@ -46245,8 +46636,8 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 48277, - "total_submitted": 91031, + "total_acs": 48479, + "total_submitted": 91360, "frontend_question_id": 813, "is_new_question": false }, @@ -46268,8 +46659,8 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 43647, - "total_submitted": 72707, + "total_acs": 43853, + "total_submitted": 73009, "frontend_question_id": 812, "is_new_question": false }, @@ -46291,8 +46682,8 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 212900, - "total_submitted": 281439, + "total_acs": 213457, + "total_submitted": 282116, "frontend_question_id": 811, "is_new_question": false }, @@ -46314,8 +46705,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 8853, - "total_submitted": 15570, + "total_acs": 8920, + "total_submitted": 15656, "frontend_question_id": 810, "is_new_question": false }, @@ -46337,8 +46728,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 109833, - "total_submitted": 238091, + "total_acs": 110181, + "total_submitted": 238752, "frontend_question_id": 809, "is_new_question": false }, @@ -46360,8 +46751,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 58585, - "total_submitted": 105585, + "total_acs": 59122, + "total_submitted": 106745, "frontend_question_id": 808, "is_new_question": false }, @@ -46383,8 +46774,8 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 150602, - "total_submitted": 175193, + "total_acs": 151129, + "total_submitted": 175788, "frontend_question_id": 807, "is_new_question": false }, @@ -46406,8 +46797,8 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 68215, - "total_submitted": 101869, + "total_acs": 68507, + "total_submitted": 102255, "frontend_question_id": 806, "is_new_question": false }, @@ -46429,8 +46820,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 31918, - "total_submitted": 125126, + "total_acs": 32042, + "total_submitted": 125739, "frontend_question_id": 805, "is_new_question": false }, @@ -46452,8 +46843,8 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 324044, - "total_submitted": 392056, + "total_acs": 325040, + "total_submitted": 393264, "frontend_question_id": 804, "is_new_question": false }, @@ -46475,8 +46866,8 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 28577, - "total_submitted": 82872, + "total_acs": 28625, + "total_submitted": 83002, "frontend_question_id": 803, "is_new_question": false }, @@ -46498,8 +46889,8 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 197139, - "total_submitted": 321572, + "total_acs": 199224, + "total_submitted": 324578, "frontend_question_id": 802, "is_new_question": false }, @@ -46521,8 +46912,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 67449, - "total_submitted": 170767, + "total_acs": 67879, + "total_submitted": 171783, "frontend_question_id": 801, "is_new_question": false }, @@ -46544,8 +46935,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 16595, - "total_submitted": 24746, + "total_acs": 16603, + "total_submitted": 24758, "frontend_question_id": 800, "is_new_question": false }, @@ -46567,8 +46958,8 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 429790, - "total_submitted": 666421, + "total_acs": 431734, + "total_submitted": 669469, "frontend_question_id": 706, "is_new_question": false }, @@ -46590,8 +46981,8 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 358015, - "total_submitted": 532682, + "total_acs": 359714, + "total_submitted": 535238, "frontend_question_id": 705, "is_new_question": false }, @@ -46613,8 +47004,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 87073, - "total_submitted": 168833, + "total_acs": 87645, + "total_submitted": 169729, "frontend_question_id": 799, "is_new_question": false }, @@ -46636,8 +47027,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 12371, - "total_submitted": 24509, + "total_acs": 12419, + "total_submitted": 24591, "frontend_question_id": 798, "is_new_question": false }, @@ -46659,8 +47050,8 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 456215, - "total_submitted": 553855, + "total_acs": 458277, + "total_submitted": 556238, "frontend_question_id": 797, "is_new_question": false }, @@ -46682,8 +47073,8 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 230206, - "total_submitted": 410854, + "total_acs": 233086, + "total_submitted": 415600, "frontend_question_id": 796, "is_new_question": false }, @@ -46705,8 +47096,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 62818, - "total_submitted": 118911, + "total_acs": 63037, + "total_submitted": 119344, "frontend_question_id": 795, "is_new_question": false }, @@ -46728,8 +47119,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 55102, - "total_submitted": 157561, + "total_acs": 55195, + "total_submitted": 157819, "frontend_question_id": 794, "is_new_question": false }, @@ -46751,8 +47142,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 16257, - "total_submitted": 37360, + "total_acs": 16327, + "total_submitted": 37504, "frontend_question_id": 793, "is_new_question": false }, @@ -46774,8 +47165,8 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 213588, - "total_submitted": 415225, + "total_acs": 214103, + "total_submitted": 416349, "frontend_question_id": 792, "is_new_question": false }, @@ -46797,8 +47188,8 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 220729, - "total_submitted": 320252, + "total_acs": 221796, + "total_submitted": 321834, "frontend_question_id": 791, "is_new_question": false }, @@ -46820,8 +47211,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 103519, - "total_submitted": 198980, + "total_acs": 104576, + "total_submitted": 201306, "frontend_question_id": 790, "is_new_question": false }, @@ -46843,8 +47234,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 26122, - "total_submitted": 42709, + "total_acs": 26198, + "total_submitted": 42820, "frontend_question_id": 789, "is_new_question": false }, @@ -46866,8 +47257,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 98841, - "total_submitted": 174825, + "total_acs": 99132, + "total_submitted": 175362, "frontend_question_id": 788, "is_new_question": false }, @@ -46889,8 +47280,8 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 395594, - "total_submitted": 1062904, + "total_acs": 398880, + "total_submitted": 1071077, "frontend_question_id": 787, "is_new_question": false }, @@ -46912,8 +47303,8 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 37352, - "total_submitted": 71128, + "total_acs": 37591, + "total_submitted": 71529, "frontend_question_id": 786, "is_new_question": false }, @@ -46935,8 +47326,8 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 477817, - "total_submitted": 871126, + "total_acs": 480968, + "total_submitted": 876446, "frontend_question_id": 785, "is_new_question": false }, @@ -46958,8 +47349,8 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 280071, - "total_submitted": 378876, + "total_acs": 280748, + "total_submitted": 379749, "frontend_question_id": 784, "is_new_question": false }, @@ -46981,8 +47372,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 225094, - "total_submitted": 378504, + "total_acs": 226052, + "total_submitted": 380117, "frontend_question_id": 783, "is_new_question": false }, @@ -47004,8 +47395,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 16244, - "total_submitted": 31596, + "total_acs": 16266, + "total_submitted": 31645, "frontend_question_id": 782, "is_new_question": false }, @@ -47027,8 +47418,8 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 49283, - "total_submitted": 90884, + "total_acs": 49529, + "total_submitted": 91366, "frontend_question_id": 781, "is_new_question": false }, @@ -47050,8 +47441,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 56110, - "total_submitted": 171531, + "total_acs": 56622, + "total_submitted": 172932, "frontend_question_id": 780, "is_new_question": false }, @@ -47073,8 +47464,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 119989, - "total_submitted": 287534, + "total_acs": 120667, + "total_submitted": 288797, "frontend_question_id": 779, "is_new_question": false }, @@ -47096,8 +47487,8 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 127191, - "total_submitted": 211658, + "total_acs": 128610, + "total_submitted": 213893, "frontend_question_id": 778, "is_new_question": false }, @@ -47119,8 +47510,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 71568, - "total_submitted": 194621, + "total_acs": 71747, + "total_submitted": 195153, "frontend_question_id": 777, "is_new_question": false }, @@ -47142,8 +47533,8 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 1928880, - "total_submitted": 3413763, + "total_acs": 1944559, + "total_submitted": 3439625, "frontend_question_id": 704, "is_new_question": false }, @@ -47165,8 +47556,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 103359, - "total_submitted": 124228, + "total_acs": 103445, + "total_submitted": 124350, "frontend_question_id": 776, "is_new_question": false }, @@ -47188,8 +47579,8 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 67797, - "total_submitted": 158363, + "total_acs": 68076, + "total_submitted": 159142, "frontend_question_id": 775, "is_new_question": false }, @@ -47211,8 +47602,8 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 438797, - "total_submitted": 774491, + "total_acs": 442406, + "total_submitted": 780847, "frontend_question_id": 703, "is_new_question": false }, @@ -47234,8 +47625,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 28721, - "total_submitted": 55354, + "total_acs": 28770, + "total_submitted": 55451, "frontend_question_id": 774, "is_new_question": false }, @@ -47257,8 +47648,8 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 87219, - "total_submitted": 135694, + "total_acs": 87474, + "total_submitted": 136078, "frontend_question_id": 773, "is_new_question": false }, @@ -47280,8 +47671,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": 89535, - "total_submitted": 125101, + "total_acs": 89738, + "total_submitted": 125361, "frontend_question_id": 702, "is_new_question": false }, @@ -47303,8 +47694,8 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 107268, - "total_submitted": 218177, + "total_acs": 107671, + "total_submitted": 218814, "frontend_question_id": 772, "is_new_question": false }, @@ -47326,8 +47717,8 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 439412, - "total_submitted": 593831, + "total_acs": 442465, + "total_submitted": 598148, "frontend_question_id": 701, "is_new_question": false }, @@ -47349,8 +47740,8 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 693549, - "total_submitted": 884529, + "total_acs": 699581, + "total_submitted": 891558, "frontend_question_id": 700, "is_new_question": false }, @@ -47372,8 +47763,8 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 910335, - "total_submitted": 1031196, + "total_acs": 914034, + "total_submitted": 1035375, "frontend_question_id": 771, "is_new_question": false }, @@ -47395,8 +47786,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 9563, - "total_submitted": 17429, + "total_acs": 9578, + "total_submitted": 17454, "frontend_question_id": 770, "is_new_question": false }, @@ -47418,8 +47809,8 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 93616, - "total_submitted": 160769, + "total_acs": 93933, + "total_submitted": 161287, "frontend_question_id": 769, "is_new_question": false }, @@ -47441,8 +47832,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 55674, - "total_submitted": 105500, + "total_acs": 55874, + "total_submitted": 105865, "frontend_question_id": 768, "is_new_question": false }, @@ -47464,8 +47855,8 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 273308, - "total_submitted": 515392, + "total_acs": 274488, + "total_submitted": 517523, "frontend_question_id": 767, "is_new_question": false }, @@ -47487,8 +47878,8 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 283328, - "total_submitted": 414045, + "total_acs": 284342, + "total_submitted": 415556, "frontend_question_id": 766, "is_new_question": false }, @@ -47510,8 +47901,8 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 232752, - "total_submitted": 300201, + "total_acs": 233557, + "total_submitted": 301277, "frontend_question_id": 590, "is_new_question": false }, @@ -47533,8 +47924,8 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 403395, - "total_submitted": 531481, + "total_acs": 404165, + "total_submitted": 532431, "frontend_question_id": 589, "is_new_question": false }, @@ -47556,8 +47947,8 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 257235, - "total_submitted": 358423, + "total_acs": 258011, + "total_submitted": 359460, "frontend_question_id": 559, "is_new_question": false }, @@ -47579,8 +47970,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": 13378, - "total_submitted": 27359, + "total_acs": 13406, + "total_submitted": 27433, "frontend_question_id": 558, "is_new_question": false }, @@ -47602,8 +47993,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 98728, - "total_submitted": 132021, + "total_acs": 99438, + "total_submitted": 132920, "frontend_question_id": 427, "is_new_question": false }, @@ -47625,8 +48016,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": 20094, - "total_submitted": 25432, + "total_acs": 20138, + "total_submitted": 25483, "frontend_question_id": 431, "is_new_question": false }, @@ -47648,8 +48039,8 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 54577, - "total_submitted": 96283, + "total_acs": 54842, + "total_submitted": 96774, "frontend_question_id": 765, "is_new_question": false }, @@ -47671,8 +48062,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 54383, - "total_submitted": 112814, + "total_acs": 54527, + "total_submitted": 113140, "frontend_question_id": 764, "is_new_question": false }, @@ -47694,8 +48085,8 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 481040, - "total_submitted": 603240, + "total_acs": 482991, + "total_submitted": 605715, "frontend_question_id": 763, "is_new_question": false }, @@ -47717,8 +48108,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": 86017, - "total_submitted": 125744, + "total_acs": 86342, + "total_submitted": 126162, "frontend_question_id": 762, "is_new_question": false }, @@ -47740,8 +48131,8 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 295660, - "total_submitted": 495282, + "total_acs": 296671, + "total_submitted": 496920, "frontend_question_id": 430, "is_new_question": false }, @@ -47763,8 +48154,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 80143, - "total_submitted": 121084, + "total_acs": 80246, + "total_submitted": 121207, "frontend_question_id": 428, "is_new_question": false }, @@ -47786,8 +48177,8 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 284682, - "total_submitted": 402606, + "total_acs": 285328, + "total_submitted": 403495, "frontend_question_id": 429, "is_new_question": false }, @@ -47809,8 +48200,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 15556, - "total_submitted": 25668, + "total_acs": 15592, + "total_submitted": 25731, "frontend_question_id": 761, "is_new_question": false }, @@ -47832,8 +48223,8 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 95542, - "total_submitted": 114550, + "total_acs": 95743, + "total_submitted": 114784, "frontend_question_id": 760, "is_new_question": false }, @@ -47855,8 +48246,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 135670, - "total_submitted": 188671, + "total_acs": 136080, + "total_submitted": 189195, "frontend_question_id": 759, "is_new_question": false }, @@ -47878,8 +48269,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 18055, - "total_submitted": 35406, + "total_acs": 18077, + "total_submitted": 35455, "frontend_question_id": 758, "is_new_question": false }, @@ -47901,8 +48292,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 20516, - "total_submitted": 46734, + "total_acs": 20614, + "total_submitted": 46974, "frontend_question_id": 757, "is_new_question": false }, @@ -47924,8 +48315,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": 237795, - "total_submitted": 367731, + "total_acs": 238605, + "total_submitted": 368966, "frontend_question_id": 426, "is_new_question": false }, @@ -47947,8 +48338,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 30909, - "total_submitted": 58894, + "total_acs": 30958, + "total_submitted": 58985, "frontend_question_id": 756, "is_new_question": false }, @@ -47970,8 +48361,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 35634, - "total_submitted": 76572, + "total_acs": 35678, + "total_submitted": 76654, "frontend_question_id": 755, "is_new_question": false }, @@ -47993,8 +48384,8 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 47813, - "total_submitted": 111869, + "total_acs": 48095, + "total_submitted": 112429, "frontend_question_id": 754, "is_new_question": false }, @@ -48016,8 +48407,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 54165, - "total_submitted": 96583, + "total_acs": 54378, + "total_submitted": 96901, "frontend_question_id": 753, "is_new_question": false }, @@ -48039,8 +48430,8 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 208770, - "total_submitted": 374307, + "total_acs": 209519, + "total_submitted": 375516, "frontend_question_id": 752, "is_new_question": false }, @@ -48062,8 +48453,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 19127, - "total_submitted": 35249, + "total_acs": 19261, + "total_submitted": 35568, "frontend_question_id": 751, "is_new_question": false }, @@ -48085,8 +48476,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 37600, - "total_submitted": 55602, + "total_acs": 37624, + "total_submitted": 55637, "frontend_question_id": 750, "is_new_question": false }, @@ -48108,8 +48499,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 10789, - "total_submitted": 21135, + "total_acs": 10853, + "total_submitted": 21229, "frontend_question_id": 749, "is_new_question": false }, @@ -48131,8 +48522,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 64438, - "total_submitted": 108858, + "total_acs": 64729, + "total_submitted": 109309, "frontend_question_id": 748, "is_new_question": false }, @@ -48154,8 +48545,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": 213350, - "total_submitted": 447709, + "total_acs": 214374, + "total_submitted": 449485, "frontend_question_id": 747, "is_new_question": false }, @@ -48177,8 +48568,8 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 883209, - "total_submitted": 1382324, + "total_acs": 891322, + "total_submitted": 1393933, "frontend_question_id": 746, "is_new_question": false }, @@ -48200,8 +48591,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 91230, - "total_submitted": 222141, + "total_acs": 91383, + "total_submitted": 222460, "frontend_question_id": 745, "is_new_question": false }, @@ -48223,8 +48614,8 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 405037, - "total_submitted": 795346, + "total_acs": 407717, + "total_submitted": 800219, "frontend_question_id": 744, "is_new_question": false }, @@ -48246,8 +48637,8 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 402884, - "total_submitted": 767621, + "total_acs": 406204, + "total_submitted": 773074, "frontend_question_id": 743, "is_new_question": false }, @@ -48269,8 +48660,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 43214, - "total_submitted": 93964, + "total_acs": 43312, + "total_submitted": 94168, "frontend_question_id": 742, "is_new_question": false }, @@ -48292,8 +48683,8 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 443150, - "total_submitted": 536257, + "total_acs": 445499, + "total_submitted": 538969, "frontend_question_id": 709, "is_new_question": false }, @@ -48315,8 +48706,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 68524, - "total_submitted": 188628, + "total_acs": 68900, + "total_submitted": 189693, "frontend_question_id": 741, "is_new_question": false }, @@ -48338,8 +48729,8 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 291254, - "total_submitted": 513751, + "total_acs": 293472, + "total_submitted": 517778, "frontend_question_id": 740, "is_new_question": false }, @@ -48361,8 +48752,8 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 665389, - "total_submitted": 1007514, + "total_acs": 672769, + "total_submitted": 1019512, "frontend_question_id": 739, "is_new_question": false }, @@ -48384,8 +48775,8 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 47107, - "total_submitted": 99307, + "total_acs": 47306, + "total_submitted": 99689, "frontend_question_id": 738, "is_new_question": false }, @@ -48407,8 +48798,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 66544, - "total_submitted": 135095, + "total_acs": 66637, + "total_submitted": 135233, "frontend_question_id": 737, "is_new_question": false }, @@ -48430,8 +48821,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 20715, - "total_submitted": 40264, + "total_acs": 20739, + "total_submitted": 40311, "frontend_question_id": 736, "is_new_question": false }, @@ -48453,8 +48844,8 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 370408, - "total_submitted": 811902, + "total_acs": 375472, + "total_submitted": 824709, "frontend_question_id": 735, "is_new_question": false }, @@ -48476,8 +48867,8 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 62336, - "total_submitted": 141557, + "total_acs": 62450, + "total_submitted": 141808, "frontend_question_id": 734, "is_new_question": false }, @@ -48499,8 +48890,8 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 767130, - "total_submitted": 1221395, + "total_acs": 772246, + "total_submitted": 1228359, "frontend_question_id": 733, "is_new_question": false }, @@ -48522,8 +48913,8 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 85177, - "total_submitted": 119066, + "total_acs": 85401, + "total_submitted": 119391, "frontend_question_id": 732, "is_new_question": false }, @@ -48545,8 +48936,8 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 92387, - "total_submitted": 167697, + "total_acs": 92687, + "total_submitted": 168183, "frontend_question_id": 731, "is_new_question": false }, @@ -48568,8 +48959,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 33836, - "total_submitted": 75868, + "total_acs": 34000, + "total_submitted": 76144, "frontend_question_id": 730, "is_new_question": false }, @@ -48591,8 +48982,8 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 262636, - "total_submitted": 463273, + "total_acs": 263250, + "total_submitted": 464369, "frontend_question_id": 729, "is_new_question": false }, @@ -48614,8 +49005,8 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 213947, - "total_submitted": 274133, + "total_acs": 214753, + "total_submitted": 275142, "frontend_question_id": 728, "is_new_question": false }, @@ -48637,8 +49028,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 86504, - "total_submitted": 200474, + "total_acs": 86585, + "total_submitted": 200662, "frontend_question_id": 727, "is_new_question": false }, @@ -48660,8 +49051,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 54893, - "total_submitted": 104785, + "total_acs": 55040, + "total_submitted": 105005, "frontend_question_id": 726, "is_new_question": false }, @@ -48683,8 +49074,8 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 117287, - "total_submitted": 203960, + "total_acs": 117779, + "total_submitted": 204671, "frontend_question_id": 725, "is_new_question": false }, @@ -48706,8 +49097,8 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 892916, - "total_submitted": 1605593, + "total_acs": 899231, + "total_submitted": 1614722, "frontend_question_id": 724, "is_new_question": false }, @@ -48729,8 +49120,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 65133, - "total_submitted": 84970, + "total_acs": 65297, + "total_submitted": 85184, "frontend_question_id": 723, "is_new_question": false }, @@ -48752,8 +49143,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 66234, - "total_submitted": 172509, + "total_acs": 66413, + "total_submitted": 173001, "frontend_question_id": 722, "is_new_question": false }, @@ -48775,8 +49166,8 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 324950, - "total_submitted": 575116, + "total_acs": 326872, + "total_submitted": 578362, "frontend_question_id": 721, "is_new_question": false }, @@ -48798,8 +49189,8 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 139406, - "total_submitted": 267706, + "total_acs": 139785, + "total_submitted": 268381, "frontend_question_id": 720, "is_new_question": false }, @@ -48821,8 +49212,8 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 78776, - "total_submitted": 212878, + "total_acs": 79144, + "total_submitted": 213655, "frontend_question_id": 719, "is_new_question": false }, @@ -48844,8 +49235,8 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 272216, - "total_submitted": 532342, + "total_acs": 273418, + "total_submitted": 534925, "frontend_question_id": 718, "is_new_question": false }, @@ -48867,8 +49258,8 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 121594, - "total_submitted": 267911, + "total_acs": 121945, + "total_submitted": 268893, "frontend_question_id": 717, "is_new_question": false }, @@ -48890,8 +49281,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 142748, - "total_submitted": 316336, + "total_acs": 142876, + "total_submitted": 316621, "frontend_question_id": 716, "is_new_question": false }, @@ -48913,8 +49304,8 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 61159, - "total_submitted": 137396, + "total_acs": 61374, + "total_submitted": 137957, "frontend_question_id": 715, "is_new_question": false }, @@ -48936,8 +49327,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": 299925, - "total_submitted": 442643, + "total_acs": 302622, + "total_submitted": 446242, "frontend_question_id": 714, "is_new_question": false }, @@ -48959,8 +49350,8 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 239278, - "total_submitted": 517327, + "total_acs": 240636, + "total_submitted": 519887, "frontend_question_id": 713, "is_new_question": false }, @@ -48982,8 +49373,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": 129712, - "total_submitted": 199875, + "total_acs": 130572, + "total_submitted": 201260, "frontend_question_id": 712, "is_new_question": false }, @@ -49005,8 +49396,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 9544, - "total_submitted": 18280, + "total_acs": 9631, + "total_submitted": 18429, "frontend_question_id": 711, "is_new_question": false }, @@ -49028,8 +49419,8 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 23959, - "total_submitted": 53523, + "total_acs": 24028, + "total_submitted": 53667, "frontend_question_id": 699, "is_new_question": false }, @@ -49051,8 +49442,8 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 243918, - "total_submitted": 623363, + "total_acs": 244935, + "total_submitted": 626731, "frontend_question_id": 698, "is_new_question": false }, @@ -49074,8 +49465,8 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 187887, - "total_submitted": 335611, + "total_acs": 188764, + "total_submitted": 337093, "frontend_question_id": 697, "is_new_question": false }, @@ -49097,8 +49488,8 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 190347, - "total_submitted": 291049, + "total_acs": 191222, + "total_submitted": 292337, "frontend_question_id": 696, "is_new_question": false }, @@ -49120,8 +49511,8 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 741193, - "total_submitted": 1031353, + "total_acs": 744895, + "total_submitted": 1036549, "frontend_question_id": 695, "is_new_question": false }, @@ -49143,8 +49534,8 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 151438, - "total_submitted": 248826, + "total_acs": 151789, + "total_submitted": 249322, "frontend_question_id": 694, "is_new_question": false }, @@ -49166,8 +49557,8 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 118928, - "total_submitted": 192560, + "total_acs": 119450, + "total_submitted": 193358, "frontend_question_id": 693, "is_new_question": false }, @@ -49189,8 +49580,8 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 561177, - "total_submitted": 977792, + "total_acs": 563083, + "total_submitted": 980766, "frontend_question_id": 692, "is_new_question": false }, @@ -49212,8 +49603,8 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 39601, - "total_submitted": 85629, + "total_acs": 39737, + "total_submitted": 85913, "frontend_question_id": 691, "is_new_question": false }, @@ -49235,8 +49626,8 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 197344, - "total_submitted": 299298, + "total_acs": 197702, + "total_submitted": 299719, "frontend_question_id": 690, "is_new_question": false }, @@ -49258,8 +49649,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": 68361, - "total_submitted": 139426, + "total_acs": 68511, + "total_submitted": 139677, "frontend_question_id": 689, "is_new_question": false }, @@ -49281,8 +49672,8 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 142546, - "total_submitted": 253386, + "total_acs": 143085, + "total_submitted": 254445, "frontend_question_id": 688, "is_new_question": false }, @@ -49304,8 +49695,8 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 166802, - "total_submitted": 410327, + "total_acs": 167307, + "total_submitted": 411229, "frontend_question_id": 687, "is_new_question": false }, @@ -49327,8 +49718,8 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 146037, - "total_submitted": 424844, + "total_acs": 146821, + "total_submitted": 426884, "frontend_question_id": 686, "is_new_question": false }, @@ -49350,8 +49741,8 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 63274, - "total_submitted": 185498, + "total_acs": 63623, + "total_submitted": 186476, "frontend_question_id": 685, "is_new_question": false }, @@ -49373,8 +49764,8 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 293136, - "total_submitted": 469458, + "total_acs": 295823, + "total_submitted": 473628, "frontend_question_id": 684, "is_new_question": false }, @@ -49396,8 +49787,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 59605, - "total_submitted": 161083, + "total_acs": 59643, + "total_submitted": 161171, "frontend_question_id": 683, "is_new_question": false }, @@ -49419,8 +49810,8 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 272059, - "total_submitted": 363277, + "total_acs": 274648, + "total_submitted": 366516, "frontend_question_id": 682, "is_new_question": false }, @@ -49442,8 +49833,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 103054, - "total_submitted": 222079, + "total_acs": 103207, + "total_submitted": 222399, "frontend_question_id": 681, "is_new_question": false }, @@ -49465,8 +49856,8 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 616795, - "total_submitted": 1563933, + "total_acs": 619907, + "total_submitted": 1571000, "frontend_question_id": 680, "is_new_question": false }, @@ -49488,8 +49879,8 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 72525, - "total_submitted": 147324, + "total_acs": 72633, + "total_submitted": 147555, "frontend_question_id": 679, "is_new_question": false }, @@ -49511,8 +49902,8 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 219495, - "total_submitted": 639386, + "total_acs": 221043, + "total_submitted": 643441, "frontend_question_id": 678, "is_new_question": false }, @@ -49534,8 +49925,8 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 106078, - "total_submitted": 187010, + "total_acs": 106410, + "total_submitted": 187628, "frontend_question_id": 677, "is_new_question": false }, @@ -49557,8 +49948,8 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 73548, - "total_submitted": 129078, + "total_acs": 73716, + "total_submitted": 129353, "frontend_question_id": 676, "is_new_question": false }, @@ -49580,8 +49971,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 63541, - "total_submitted": 186344, + "total_acs": 63736, + "total_submitted": 186880, "frontend_question_id": 675, "is_new_question": false }, @@ -49603,8 +49994,8 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 234988, - "total_submitted": 475079, + "total_acs": 235838, + "total_submitted": 476554, "frontend_question_id": 674, "is_new_question": false }, @@ -49626,8 +50017,8 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 201621, - "total_submitted": 425579, + "total_acs": 203075, + "total_submitted": 428400, "frontend_question_id": 673, "is_new_question": false }, @@ -49649,8 +50040,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 20531, - "total_submitted": 40731, + "total_acs": 20628, + "total_submitted": 40907, "frontend_question_id": 672, "is_new_question": false }, @@ -49672,8 +50063,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": 174262, - "total_submitted": 394263, + "total_acs": 174823, + "total_submitted": 395566, "frontend_question_id": 671, "is_new_question": false }, @@ -49695,8 +50086,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 198894, - "total_submitted": 415793, + "total_acs": 199861, + "total_submitted": 417666, "frontend_question_id": 670, "is_new_question": false }, @@ -49718,8 +50109,8 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 272089, - "total_submitted": 410184, + "total_acs": 272920, + "total_submitted": 411503, "frontend_question_id": 669, "is_new_question": false }, @@ -49741,8 +50132,8 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 58046, - "total_submitted": 112865, + "total_acs": 58275, + "total_submitted": 113303, "frontend_question_id": 668, "is_new_question": false }, @@ -49764,8 +50155,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 51364, - "total_submitted": 85719, + "total_acs": 51459, + "total_submitted": 85856, "frontend_question_id": 667, "is_new_question": false }, @@ -49787,8 +50178,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 22091, - "total_submitted": 37044, + "total_acs": 22344, + "total_submitted": 37411, "frontend_question_id": 666, "is_new_question": false }, @@ -49810,8 +50201,8 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 246389, - "total_submitted": 1010337, + "total_acs": 246932, + "total_submitted": 1012310, "frontend_question_id": 665, "is_new_question": false }, @@ -49833,8 +50224,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 68569, - "total_submitted": 123993, + "total_acs": 68962, + "total_submitted": 124889, "frontend_question_id": 664, "is_new_question": false }, @@ -49856,8 +50247,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 29848, - "total_submitted": 72044, + "total_acs": 29880, + "total_submitted": 72113, "frontend_question_id": 663, "is_new_question": false }, @@ -49879,8 +50270,8 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 320525, - "total_submitted": 752140, + "total_acs": 323061, + "total_submitted": 758316, "frontend_question_id": 662, "is_new_question": false }, @@ -49902,8 +50293,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 74395, - "total_submitted": 133773, + "total_acs": 74621, + "total_submitted": 134067, "frontend_question_id": 661, "is_new_question": false }, @@ -49925,8 +50316,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 10402, - "total_submitted": 18152, + "total_acs": 10407, + "total_submitted": 18158, "frontend_question_id": 660, "is_new_question": false }, @@ -49948,8 +50339,8 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 124996, - "total_submitted": 245712, + "total_acs": 125235, + "total_submitted": 246184, "frontend_question_id": 659, "is_new_question": false }, @@ -49971,8 +50362,8 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 453856, - "total_submitted": 967841, + "total_acs": 456411, + "total_submitted": 973293, "frontend_question_id": 658, "is_new_question": false }, @@ -49994,8 +50385,8 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 382540, - "total_submitted": 507423, + "total_acs": 383976, + "total_submitted": 509255, "frontend_question_id": 657, "is_new_question": false }, @@ -50017,8 +50408,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 13635, - "total_submitted": 42687, + "total_acs": 13651, + "total_submitted": 42722, "frontend_question_id": 656, "is_new_question": false }, @@ -50040,8 +50431,8 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 61407, - "total_submitted": 98353, + "total_acs": 61594, + "total_submitted": 98592, "frontend_question_id": 655, "is_new_question": false }, @@ -50063,8 +50454,8 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 263924, - "total_submitted": 310590, + "total_acs": 264933, + "total_submitted": 311740, "frontend_question_id": 654, "is_new_question": false }, @@ -50086,8 +50477,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": 478890, - "total_submitted": 783846, + "total_acs": 481323, + "total_submitted": 787854, "frontend_question_id": 653, "is_new_question": false }, @@ -50109,8 +50500,8 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 237948, - "total_submitted": 402708, + "total_acs": 238816, + "total_submitted": 404029, "frontend_question_id": 652, "is_new_question": false }, @@ -50132,8 +50523,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 27293, - "total_submitted": 48708, + "total_acs": 27398, + "total_submitted": 48897, "frontend_question_id": 651, "is_new_question": false }, @@ -50155,8 +50546,8 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 121560, - "total_submitted": 226421, + "total_acs": 122050, + "total_submitted": 227228, "frontend_question_id": 650, "is_new_question": false }, @@ -50178,8 +50569,8 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 90350, - "total_submitted": 188772, + "total_acs": 92007, + "total_submitted": 192276, "frontend_question_id": 649, "is_new_question": false }, @@ -50201,8 +50592,8 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 123366, - "total_submitted": 196780, + "total_acs": 123876, + "total_submitted": 197533, "frontend_question_id": 648, "is_new_question": false }, @@ -50224,8 +50615,8 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 599558, - "total_submitted": 889053, + "total_acs": 603766, + "total_submitted": 894549, "frontend_question_id": 647, "is_new_question": false }, @@ -50247,8 +50638,8 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 145030, - "total_submitted": 255105, + "total_acs": 146009, + "total_submitted": 256638, "frontend_question_id": 646, "is_new_question": false }, @@ -50270,8 +50661,8 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 279257, - "total_submitted": 656952, + "total_acs": 280555, + "total_submitted": 659870, "frontend_question_id": 645, "is_new_question": false }, @@ -50293,8 +50684,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 19238, - "total_submitted": 53058, + "total_acs": 19279, + "total_submitted": 53131, "frontend_question_id": 644, "is_new_question": false }, @@ -50316,8 +50707,8 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 259479, - "total_submitted": 598631, + "total_acs": 265706, + "total_submitted": 613769, "frontend_question_id": 643, "is_new_question": false }, @@ -50339,8 +50730,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 131530, - "total_submitted": 270354, + "total_acs": 131770, + "total_submitted": 270829, "frontend_question_id": 642, "is_new_question": false }, @@ -50362,8 +50753,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 36818, - "total_submitted": 84498, + "total_acs": 36898, + "total_submitted": 84650, "frontend_question_id": 640, "is_new_question": false }, @@ -50385,8 +50776,8 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 68919, - "total_submitted": 226564, + "total_acs": 69152, + "total_submitted": 227203, "frontend_question_id": 639, "is_new_question": false }, @@ -50408,8 +50799,8 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 54839, - "total_submitted": 104001, + "total_acs": 55008, + "total_submitted": 104436, "frontend_question_id": 638, "is_new_question": false }, @@ -50431,8 +50822,8 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 413162, - "total_submitted": 575032, + "total_acs": 415931, + "total_submitted": 578740, "frontend_question_id": 637, "is_new_question": false }, @@ -50454,8 +50845,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 191587, - "total_submitted": 312462, + "total_acs": 191824, + "total_submitted": 312820, "frontend_question_id": 636, "is_new_question": false }, @@ -50477,8 +50868,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 33733, - "total_submitted": 54235, + "total_acs": 33772, + "total_submitted": 54343, "frontend_question_id": 635, "is_new_question": false }, @@ -50500,8 +50891,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 10632, - "total_submitted": 25306, + "total_acs": 10653, + "total_submitted": 25351, "frontend_question_id": 634, "is_new_question": false }, @@ -50523,8 +50914,8 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 178182, - "total_submitted": 521103, + "total_acs": 179014, + "total_submitted": 523798, "frontend_question_id": 633, "is_new_question": false }, @@ -50546,8 +50937,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": 89683, - "total_submitted": 145527, + "total_acs": 90609, + "total_submitted": 146774, "frontend_question_id": 632, "is_new_question": false }, @@ -50569,8 +50960,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 14303, - "total_submitted": 32909, + "total_acs": 14360, + "total_submitted": 33015, "frontend_question_id": 631, "is_new_question": false }, @@ -50592,8 +50983,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 104330, - "total_submitted": 260083, + "total_acs": 104618, + "total_submitted": 260752, "frontend_question_id": 630, "is_new_question": false }, @@ -50615,8 +51006,8 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 59123, - "total_submitted": 138894, + "total_acs": 59199, + "total_submitted": 139072, "frontend_question_id": 629, "is_new_question": false }, @@ -50638,8 +51029,8 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 276934, - "total_submitted": 609035, + "total_acs": 278346, + "total_submitted": 612485, "frontend_question_id": 628, "is_new_question": false }, @@ -50661,8 +51052,8 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 367330, - "total_submitted": 442855, + "total_acs": 368851, + "total_submitted": 444648, "frontend_question_id": 627, "is_new_question": false }, @@ -50684,8 +51075,8 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 146634, - "total_submitted": 213994, + "total_acs": 148267, + "total_submitted": 216465, "frontend_question_id": 626, "is_new_question": false }, @@ -50707,8 +51098,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 10870, - "total_submitted": 32433, + "total_acs": 10874, + "total_submitted": 32446, "frontend_question_id": 625, "is_new_question": false }, @@ -50730,8 +51121,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 40633, - "total_submitted": 97792, + "total_acs": 40828, + "total_submitted": 98244, "frontend_question_id": 624, "is_new_question": false }, @@ -50753,8 +51144,8 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 153726, - "total_submitted": 258470, + "total_acs": 154134, + "total_submitted": 259169, "frontend_question_id": 623, "is_new_question": false }, @@ -50776,8 +51167,8 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 451397, - "total_submitted": 791958, + "total_acs": 454132, + "total_submitted": 795896, "frontend_question_id": 621, "is_new_question": false }, @@ -50799,8 +51190,8 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 272262, - "total_submitted": 375566, + "total_acs": 277627, + "total_submitted": 382743, "frontend_question_id": 620, "is_new_question": false }, @@ -50822,8 +51213,8 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 89613, - "total_submitted": 164695, + "total_acs": 92453, + "total_submitted": 168640, "frontend_question_id": 619, "is_new_question": false }, @@ -50845,8 +51236,8 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 21519, - "total_submitted": 33773, + "total_acs": 21595, + "total_submitted": 33881, "frontend_question_id": 618, "is_new_question": false }, @@ -50868,8 +51259,8 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 704467, - "total_submitted": 894861, + "total_acs": 706536, + "total_submitted": 897422, "frontend_question_id": 617, "is_new_question": false }, @@ -50891,8 +51282,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 84285, - "total_submitted": 171811, + "total_acs": 84468, + "total_submitted": 172104, "frontend_question_id": 616, "is_new_question": false }, @@ -50914,8 +51305,8 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 32902, - "total_submitted": 58662, + "total_acs": 32980, + "total_submitted": 58805, "frontend_question_id": 615, "is_new_question": false }, @@ -50937,8 +51328,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 48766, - "total_submitted": 129253, + "total_acs": 48868, + "total_submitted": 129437, "frontend_question_id": 614, "is_new_question": false }, @@ -50960,8 +51351,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 64883, - "total_submitted": 80450, + "total_acs": 65071, + "total_submitted": 80677, "frontend_question_id": 613, "is_new_question": false }, @@ -50983,8 +51374,8 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 37472, - "total_submitted": 60128, + "total_acs": 37578, + "total_submitted": 60340, "frontend_question_id": 612, "is_new_question": false }, @@ -51006,8 +51397,8 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 174534, - "total_submitted": 344354, + "total_acs": 175131, + "total_submitted": 345407, "frontend_question_id": 611, "is_new_question": false }, @@ -51029,8 +51420,8 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 85791, - "total_submitted": 121398, + "total_acs": 88190, + "total_submitted": 124749, "frontend_question_id": 610, "is_new_question": false }, @@ -51052,8 +51443,8 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 145926, - "total_submitted": 215691, + "total_acs": 146096, + "total_submitted": 215931, "frontend_question_id": 609, "is_new_question": false }, @@ -51075,8 +51466,8 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 133478, - "total_submitted": 186753, + "total_acs": 134251, + "total_submitted": 187770, "frontend_question_id": 608, "is_new_question": false }, @@ -51098,8 +51489,8 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 161499, - "total_submitted": 239370, + "total_acs": 164003, + "total_submitted": 243317, "frontend_question_id": 607, "is_new_question": false }, @@ -51121,8 +51512,8 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 224096, - "total_submitted": 347686, + "total_acs": 224916, + "total_submitted": 348669, "frontend_question_id": 606, "is_new_question": false }, @@ -51144,8 +51535,8 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 506822, - "total_submitted": 1635047, + "total_acs": 516858, + "total_submitted": 1676986, "frontend_question_id": 605, "is_new_question": false }, @@ -51167,8 +51558,8 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 30531, - "total_submitted": 77094, + "total_acs": 30631, + "total_submitted": 77269, "frontend_question_id": 604, "is_new_question": false }, @@ -51190,8 +51581,8 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 77237, - "total_submitted": 115513, + "total_acs": 77483, + "total_submitted": 115949, "frontend_question_id": 603, "is_new_question": false }, @@ -51213,8 +51604,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": 70999, - "total_submitted": 121917, + "total_acs": 72422, + "total_submitted": 124549, "frontend_question_id": 602, "is_new_question": false }, @@ -51236,8 +51627,8 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 84367, - "total_submitted": 172690, + "total_acs": 84829, + "total_submitted": 173670, "frontend_question_id": 601, "is_new_question": false }, @@ -51259,8 +51650,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 35798, - "total_submitted": 90735, + "total_acs": 35977, + "total_submitted": 91143, "frontend_question_id": 600, "is_new_question": false }, @@ -51282,8 +51673,8 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 198312, - "total_submitted": 367643, + "total_acs": 199293, + "total_submitted": 369096, "frontend_question_id": 599, "is_new_question": false }, @@ -51305,8 +51696,8 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 92467, - "total_submitted": 166425, + "total_acs": 92763, + "total_submitted": 166917, "frontend_question_id": 598, "is_new_question": false }, @@ -51328,8 +51719,8 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 69602, - "total_submitted": 164896, + "total_acs": 69748, + "total_submitted": 165171, "frontend_question_id": 597, "is_new_question": false }, @@ -51351,8 +51742,8 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 274069, - "total_submitted": 550549, + "total_acs": 279106, + "total_submitted": 557591, "frontend_question_id": 596, "is_new_question": false }, @@ -51374,8 +51765,8 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 730008, - "total_submitted": 1057525, + "total_acs": 747921, + "total_submitted": 1083925, "frontend_question_id": 595, "is_new_question": false }, @@ -51397,8 +51788,8 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 139537, - "total_submitted": 259251, + "total_acs": 139972, + "total_submitted": 259942, "frontend_question_id": 594, "is_new_question": false }, @@ -51420,8 +51811,8 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 99857, - "total_submitted": 227398, + "total_acs": 100104, + "total_submitted": 227970, "frontend_question_id": 593, "is_new_question": false }, @@ -51443,8 +51834,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 33272, - "total_submitted": 63164, + "total_acs": 33348, + "total_submitted": 63313, "frontend_question_id": 592, "is_new_question": false }, @@ -51466,8 +51857,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 13417, - "total_submitted": 35851, + "total_acs": 13477, + "total_submitted": 35972, "frontend_question_id": 591, "is_new_question": false }, @@ -51489,8 +51880,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 87145, - "total_submitted": 179593, + "total_acs": 87467, + "total_submitted": 180267, "frontend_question_id": 588, "is_new_question": false }, @@ -51512,8 +51903,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 54766, - "total_submitted": 105474, + "total_acs": 54837, + "total_submitted": 105592, "frontend_question_id": 587, "is_new_question": false }, @@ -51535,8 +51926,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": 192092, - "total_submitted": 288360, + "total_acs": 195314, + "total_submitted": 293471, "frontend_question_id": 586, "is_new_question": false }, @@ -51558,8 +51949,8 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 52895, - "total_submitted": 108391, + "total_acs": 54165, + "total_submitted": 111092, "frontend_question_id": 585, "is_new_question": false }, @@ -51581,8 +51972,8 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 416685, - "total_submitted": 603053, + "total_acs": 428234, + "total_submitted": 619268, "frontend_question_id": 584, "is_new_question": false }, @@ -51604,8 +51995,8 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 218162, - "total_submitted": 359915, + "total_acs": 219636, + "total_submitted": 361960, "frontend_question_id": 583, "is_new_question": false }, @@ -51627,8 +52018,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 80349, - "total_submitted": 116625, + "total_acs": 80452, + "total_submitted": 116751, "frontend_question_id": 582, "is_new_question": false }, @@ -51650,8 +52041,8 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 308330, - "total_submitted": 843898, + "total_acs": 308985, + "total_submitted": 845409, "frontend_question_id": 581, "is_new_question": false }, @@ -51673,8 +52064,8 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 61877, - "total_submitted": 105531, + "total_acs": 62006, + "total_submitted": 105708, "frontend_question_id": 580, "is_new_question": false }, @@ -51696,8 +52087,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 31548, - "total_submitted": 68965, + "total_acs": 31604, + "total_submitted": 69040, "frontend_question_id": 579, "is_new_question": false }, @@ -51719,8 +52110,8 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 50241, - "total_submitted": 123492, + "total_acs": 50360, + "total_submitted": 123827, "frontend_question_id": 578, "is_new_question": false }, @@ -51742,8 +52133,8 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 131047, - "total_submitted": 176837, + "total_acs": 137083, + "total_submitted": 184955, "frontend_question_id": 577, "is_new_question": false }, @@ -51765,8 +52156,8 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 119422, - "total_submitted": 269895, + "total_acs": 119696, + "total_submitted": 270557, "frontend_question_id": 576, "is_new_question": false }, @@ -51788,8 +52179,8 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 251247, - "total_submitted": 376236, + "total_acs": 252196, + "total_submitted": 377543, "frontend_question_id": 575, "is_new_question": false }, @@ -51811,8 +52202,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 58293, - "total_submitted": 97158, + "total_acs": 58414, + "total_submitted": 97346, "frontend_question_id": 574, "is_new_question": false }, @@ -51834,8 +52225,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 18297, - "total_submitted": 33097, + "total_acs": 18314, + "total_submitted": 33122, "frontend_question_id": 573, "is_new_question": false }, @@ -51857,8 +52248,8 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 697713, - "total_submitted": 1490974, + "total_acs": 702995, + "total_submitted": 1501148, "frontend_question_id": 572, "is_new_question": false }, @@ -51880,8 +52271,8 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 25608, - "total_submitted": 59602, + "total_acs": 25670, + "total_submitted": 59775, "frontend_question_id": 571, "is_new_question": false }, @@ -51903,8 +52294,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": 123372, - "total_submitted": 206466, + "total_acs": 129545, + "total_submitted": 218879, "frontend_question_id": 570, "is_new_question": false }, @@ -51926,8 +52317,8 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 35857, - "total_submitted": 53758, + "total_acs": 35948, + "total_submitted": 53882, "frontend_question_id": 569, "is_new_question": false }, @@ -51949,8 +52340,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 36346, - "total_submitted": 80326, + "total_acs": 36387, + "total_submitted": 80389, "frontend_question_id": 568, "is_new_question": false }, @@ -51972,8 +52363,8 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 697952, - "total_submitted": 1579577, + "total_acs": 703844, + "total_submitted": 1593085, "frontend_question_id": 567, "is_new_question": false }, @@ -51995,8 +52386,8 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 354804, - "total_submitted": 563420, + "total_acs": 355587, + "total_submitted": 564678, "frontend_question_id": 566, "is_new_question": false }, @@ -52018,8 +52409,8 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 124162, - "total_submitted": 220416, + "total_acs": 124319, + "total_submitted": 220725, "frontend_question_id": 565, "is_new_question": false }, @@ -52041,8 +52432,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 39228, - "total_submitted": 179850, + "total_acs": 39398, + "total_submitted": 180794, "frontend_question_id": 564, "is_new_question": false }, @@ -52064,8 +52455,8 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 195032, - "total_submitted": 321766, + "total_acs": 195550, + "total_submitted": 322402, "frontend_question_id": 563, "is_new_question": false }, @@ -52087,8 +52478,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": 73449, - "total_submitted": 146020, + "total_acs": 73546, + "total_submitted": 146209, "frontend_question_id": 562, "is_new_question": false }, @@ -52110,8 +52501,8 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 416548, - "total_submitted": 536297, + "total_acs": 418431, + "total_submitted": 538437, "frontend_question_id": 561, "is_new_question": false }, @@ -52133,8 +52524,8 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 1019561, - "total_submitted": 2352226, + "total_acs": 1026246, + "total_submitted": 2369221, "frontend_question_id": 560, "is_new_question": false }, @@ -52156,8 +52547,8 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 712929, - "total_submitted": 869943, + "total_acs": 715492, + "total_submitted": 872916, "frontend_question_id": 557, "is_new_question": false }, @@ -52179,8 +52570,8 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 132058, - "total_submitted": 388988, + "total_acs": 132750, + "total_submitted": 391073, "frontend_question_id": 556, "is_new_question": false }, @@ -52202,8 +52593,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 6488, - "total_submitted": 14891, + "total_acs": 6496, + "total_submitted": 14911, "frontend_question_id": 555, "is_new_question": false }, @@ -52225,8 +52616,8 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 122285, - "total_submitted": 226519, + "total_acs": 122917, + "total_submitted": 227641, "frontend_question_id": 554, "is_new_question": false }, @@ -52248,8 +52639,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 36565, - "total_submitted": 60786, + "total_acs": 36663, + "total_submitted": 60943, "frontend_question_id": 553, "is_new_question": false }, @@ -52271,8 +52662,8 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 61361, - "total_submitted": 146684, + "total_acs": 61561, + "total_submitted": 147021, "frontend_question_id": 552, "is_new_question": false }, @@ -52294,8 +52685,8 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 186043, - "total_submitted": 384862, + "total_acs": 187025, + "total_submitted": 386650, "frontend_question_id": 551, "is_new_question": false }, @@ -52317,8 +52708,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 55421, - "total_submitted": 102050, + "total_acs": 55704, + "total_submitted": 102573, "frontend_question_id": 1730, "is_new_question": false }, @@ -52340,8 +52731,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 51191, - "total_submitted": 103491, + "total_acs": 51285, + "total_submitted": 103663, "frontend_question_id": 549, "is_new_question": false }, @@ -52363,8 +52754,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 23464, - "total_submitted": 46842, + "total_acs": 23479, + "total_submitted": 46865, "frontend_question_id": 548, "is_new_question": false }, @@ -52386,8 +52777,8 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 724105, - "total_submitted": 1108008, + "total_acs": 729842, + "total_submitted": 1116086, "frontend_question_id": 547, "is_new_question": false }, @@ -52409,8 +52800,8 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 41379, - "total_submitted": 86804, + "total_acs": 41561, + "total_submitted": 87174, "frontend_question_id": 546, "is_new_question": false }, @@ -52432,8 +52823,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 121048, - "total_submitted": 270991, + "total_acs": 121225, + "total_submitted": 271320, "frontend_question_id": 545, "is_new_question": false }, @@ -52455,8 +52846,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 26297, - "total_submitted": 34147, + "total_acs": 26326, + "total_submitted": 34176, "frontend_question_id": 544, "is_new_question": false }, @@ -52478,8 +52869,8 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 1121495, - "total_submitted": 1944453, + "total_acs": 1131944, + "total_submitted": 1960136, "frontend_question_id": 543, "is_new_question": false }, @@ -52501,8 +52892,8 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 412134, - "total_submitted": 905892, + "total_acs": 472960, + "total_submitted": 996486, "frontend_question_id": 542, "is_new_question": false }, @@ -52524,8 +52915,8 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 207149, - "total_submitted": 411042, + "total_acs": 208459, + "total_submitted": 413662, "frontend_question_id": 541, "is_new_question": false }, @@ -52547,8 +52938,8 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 512591, - "total_submitted": 868175, + "total_acs": 517753, + "total_submitted": 877030, "frontend_question_id": 540, "is_new_question": false }, @@ -52570,8 +52961,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 129543, - "total_submitted": 229143, + "total_acs": 130144, + "total_submitted": 230139, "frontend_question_id": 539, "is_new_question": false }, @@ -52593,8 +52984,8 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 274963, - "total_submitted": 402808, + "total_acs": 275728, + "total_submitted": 403765, "frontend_question_id": 538, "is_new_question": false }, @@ -52616,8 +53007,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 89850, - "total_submitted": 125651, + "total_acs": 90020, + "total_submitted": 125880, "frontend_question_id": 537, "is_new_question": false }, @@ -52639,8 +53030,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 84063, - "total_submitted": 149289, + "total_acs": 84163, + "total_submitted": 149465, "frontend_question_id": 536, "is_new_question": false }, @@ -52662,8 +53053,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 236150, - "total_submitted": 274348, + "total_acs": 236851, + "total_submitted": 275145, "frontend_question_id": 535, "is_new_question": false }, @@ -52685,8 +53076,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 12874, - "total_submitted": 26559, + "total_acs": 12887, + "total_submitted": 26578, "frontend_question_id": 533, "is_new_question": false }, @@ -52708,8 +53099,8 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 302916, - "total_submitted": 727848, + "total_acs": 304465, + "total_submitted": 730831, "frontend_question_id": 532, "is_new_question": false }, @@ -52731,8 +53122,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 40372, - "total_submitted": 64971, + "total_acs": 40465, + "total_submitted": 65110, "frontend_question_id": 531, "is_new_question": false }, @@ -52754,8 +53145,8 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 293384, - "total_submitted": 498748, + "total_acs": 295834, + "total_submitted": 503079, "frontend_question_id": 530, "is_new_question": false }, @@ -52777,8 +53168,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 140410, - "total_submitted": 213048, + "total_acs": 140745, + "total_submitted": 213506, "frontend_question_id": 529, "is_new_question": false }, @@ -52800,8 +53191,8 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 287100, - "total_submitted": 418725, + "total_acs": 288777, + "total_submitted": 421340, "frontend_question_id": 1721, "is_new_question": false }, @@ -52823,8 +53214,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 26307, - "total_submitted": 43321, + "total_acs": 26345, + "total_submitted": 43373, "frontend_question_id": 527, "is_new_question": false }, @@ -52846,8 +53237,8 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 157295, - "total_submitted": 244563, + "total_acs": 157950, + "total_submitted": 245658, "frontend_question_id": 526, "is_new_question": false }, @@ -52869,8 +53260,8 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 303409, - "total_submitted": 647764, + "total_acs": 304384, + "total_submitted": 649722, "frontend_question_id": 525, "is_new_question": false }, @@ -52892,8 +53283,8 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 144468, - "total_submitted": 283018, + "total_acs": 144820, + "total_submitted": 283688, "frontend_question_id": 524, "is_new_question": false }, @@ -52915,8 +53306,8 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 403064, - "total_submitted": 1414404, + "total_acs": 404417, + "total_submitted": 1418979, "frontend_question_id": 523, "is_new_question": false }, @@ -52938,8 +53329,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 48268, - "total_submitted": 118483, + "total_acs": 48381, + "total_submitted": 118675, "frontend_question_id": 522, "is_new_question": false }, @@ -52961,8 +53352,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 99883, - "total_submitted": 165410, + "total_acs": 100214, + "total_submitted": 165985, "frontend_question_id": 521, "is_new_question": false }, @@ -52984,8 +53375,8 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 398799, - "total_submitted": 701844, + "total_acs": 399881, + "total_submitted": 704072, "frontend_question_id": 520, "is_new_question": false }, @@ -53007,8 +53398,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": 2089, - "total_submitted": 3865, + "total_acs": 2113, + "total_submitted": 3908, "frontend_question_id": 1983, "is_new_question": false }, @@ -53030,8 +53421,8 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 488575, - "total_submitted": 782641, + "total_acs": 514197, + "total_submitted": 817638, "frontend_question_id": 518, "is_new_question": false }, @@ -53053,8 +53444,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 26676, - "total_submitted": 65658, + "total_acs": 26803, + "total_submitted": 65896, "frontend_question_id": 517, "is_new_question": false }, @@ -53076,8 +53467,8 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 414480, - "total_submitted": 667745, + "total_acs": 417571, + "total_submitted": 672506, "frontend_question_id": 516, "is_new_question": false }, @@ -53099,8 +53490,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": 235894, - "total_submitted": 365831, + "total_acs": 236818, + "total_submitted": 367319, "frontend_question_id": 515, "is_new_question": false }, @@ -53122,8 +53513,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 33338, - "total_submitted": 70734, + "total_acs": 33473, + "total_submitted": 71005, "frontend_question_id": 514, "is_new_question": false }, @@ -53145,8 +53536,8 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 222079, - "total_submitted": 330088, + "total_acs": 223136, + "total_submitted": 331497, "frontend_question_id": 513, "is_new_question": false }, @@ -53168,8 +53559,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 2403, - "total_submitted": 5871, + "total_acs": 2419, + "total_submitted": 5908, "frontend_question_id": 2036, "is_new_question": false }, @@ -53191,8 +53582,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": 53481, - "total_submitted": 138410, + "total_acs": 53663, + "total_submitted": 139042, "frontend_question_id": 1059, "is_new_question": false }, @@ -53214,8 +53605,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": 3236, - "total_submitted": 6208, + "total_acs": 3252, + "total_submitted": 6237, "frontend_question_id": 2031, "is_new_question": false }, @@ -53237,8 +53628,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 61846, - "total_submitted": 101394, + "total_acs": 61933, + "total_submitted": 101514, "frontend_question_id": 510, "is_new_question": false }, @@ -53260,8 +53651,8 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 130236, - "total_submitted": 199175, + "total_acs": 130619, + "total_submitted": 199665, "frontend_question_id": 508, "is_new_question": false }, @@ -53283,8 +53674,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 145546, - "total_submitted": 386256, + "total_acs": 146960, + "total_submitted": 388640, "frontend_question_id": 507, "is_new_question": false }, @@ -53306,8 +53697,8 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 133737, - "total_submitted": 216852, + "total_acs": 134735, + "total_submitted": 218144, "frontend_question_id": 506, "is_new_question": false }, @@ -53329,8 +53720,8 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 97463, - "total_submitted": 185051, + "total_acs": 97798, + "total_submitted": 185571, "frontend_question_id": 505, "is_new_question": false }, @@ -53352,8 +53743,8 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 112952, - "total_submitted": 230667, + "total_acs": 113621, + "total_submitted": 231816, "frontend_question_id": 504, "is_new_question": false }, @@ -53375,8 +53766,8 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 326293, - "total_submitted": 515162, + "total_acs": 328800, + "total_submitted": 518951, "frontend_question_id": 503, "is_new_question": false }, @@ -53398,8 +53789,8 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 98898, - "total_submitted": 198968, + "total_acs": 99792, + "total_submitted": 200792, "frontend_question_id": 502, "is_new_question": false }, @@ -53421,8 +53812,8 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 198777, - "total_submitted": 398556, + "total_acs": 199639, + "total_submitted": 399977, "frontend_question_id": 501, "is_new_question": false }, @@ -53444,8 +53835,8 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 194414, - "total_submitted": 278557, + "total_acs": 195417, + "total_submitted": 279877, "frontend_question_id": 500, "is_new_question": false }, @@ -53467,8 +53858,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 28366, - "total_submitted": 59318, + "total_acs": 28498, + "total_submitted": 59509, "frontend_question_id": 499, "is_new_question": false }, @@ -53490,8 +53881,8 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 251280, - "total_submitted": 429468, + "total_acs": 252313, + "total_submitted": 431062, "frontend_question_id": 498, "is_new_question": false }, @@ -53513,8 +53904,8 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 569083, - "total_submitted": 795234, + "total_acs": 574697, + "total_submitted": 802701, "frontend_question_id": 496, "is_new_question": false }, @@ -53536,8 +53927,8 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 131076, - "total_submitted": 231424, + "total_acs": 131638, + "total_submitted": 232561, "frontend_question_id": 495, "is_new_question": false }, @@ -53559,8 +53950,8 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 490902, - "total_submitted": 1070817, + "total_acs": 495172, + "total_submitted": 1079188, "frontend_question_id": 494, "is_new_question": false }, @@ -53582,8 +53973,8 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 138326, - "total_submitted": 452500, + "total_acs": 140084, + "total_submitted": 458555, "frontend_question_id": 493, "is_new_question": false }, @@ -53605,8 +53996,8 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 101204, - "total_submitted": 181923, + "total_acs": 101689, + "total_submitted": 182609, "frontend_question_id": 492, "is_new_question": false }, @@ -53628,8 +54019,8 @@ "question__title": "Non-decreasing Subsequences", "question__title_slug": "non-decreasing-subsequences", "question__hide": false, - "total_acs": 154470, - "total_submitted": 256188, + "total_acs": 154881, + "total_submitted": 256862, "frontend_question_id": 491, "is_new_question": false }, @@ -53651,8 +54042,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 148162, - "total_submitted": 263526, + "total_acs": 151419, + "total_submitted": 267716, "frontend_question_id": 490, "is_new_question": false }, @@ -53674,8 +54065,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 10805, - "total_submitted": 22866, + "total_acs": 10860, + "total_submitted": 22963, "frontend_question_id": 1643, "is_new_question": false }, @@ -53697,8 +54088,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 21960, - "total_submitted": 65544, + "total_acs": 21993, + "total_submitted": 65706, "frontend_question_id": 488, "is_new_question": false }, @@ -53720,8 +54111,8 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 126957, - "total_submitted": 255019, + "total_acs": 127482, + "total_submitted": 256007, "frontend_question_id": 487, "is_new_question": false }, @@ -53743,8 +54134,8 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 202039, - "total_submitted": 364763, + "total_acs": 203749, + "total_submitted": 367886, "frontend_question_id": 486, "is_new_question": false }, @@ -53766,8 +54157,8 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 931987, - "total_submitted": 1625529, + "total_acs": 939830, + "total_submitted": 1637106, "frontend_question_id": 485, "is_new_question": false }, @@ -53789,8 +54180,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 36913, - "total_submitted": 55205, + "total_acs": 36982, + "total_submitted": 55307, "frontend_question_id": 484, "is_new_question": false }, @@ -53812,8 +54203,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 19663, - "total_submitted": 50200, + "total_acs": 19734, + "total_submitted": 50328, "frontend_question_id": 483, "is_new_question": false }, @@ -53835,8 +54226,8 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 256649, - "total_submitted": 592160, + "total_acs": 257443, + "total_submitted": 593870, "frontend_question_id": 482, "is_new_question": false }, @@ -53858,8 +54249,8 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 32904, - "total_submitted": 64690, + "total_acs": 33010, + "total_submitted": 64865, "frontend_question_id": 481, "is_new_question": false }, @@ -53881,8 +54272,8 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 130213, - "total_submitted": 323396, + "total_acs": 130634, + "total_submitted": 325053, "frontend_question_id": 480, "is_new_question": false }, @@ -53904,8 +54295,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 22576, - "total_submitted": 69923, + "total_acs": 22631, + "total_submitted": 70029, "frontend_question_id": 479, "is_new_question": false }, @@ -53927,8 +54318,8 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 100417, - "total_submitted": 192348, + "total_acs": 100685, + "total_submitted": 192840, "frontend_question_id": 477, "is_new_question": false }, @@ -53950,8 +54341,8 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 305659, - "total_submitted": 453008, + "total_acs": 306668, + "total_submitted": 454445, "frontend_question_id": 476, "is_new_question": false }, @@ -53973,8 +54364,8 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 104745, - "total_submitted": 284551, + "total_acs": 105120, + "total_submitted": 285372, "frontend_question_id": 475, "is_new_question": false }, @@ -53996,8 +54387,8 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 179787, - "total_submitted": 382502, + "total_acs": 180826, + "total_submitted": 384609, "frontend_question_id": 474, "is_new_question": false }, @@ -54019,8 +54410,8 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 146401, - "total_submitted": 364691, + "total_acs": 147375, + "total_submitted": 366955, "frontend_question_id": 473, "is_new_question": false }, @@ -54042,8 +54433,8 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 211396, - "total_submitted": 424485, + "total_acs": 211844, + "total_submitted": 425465, "frontend_question_id": 472, "is_new_question": false }, @@ -54065,8 +54456,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 30116, - "total_submitted": 59603, + "total_acs": 30128, + "total_submitted": 59643, "frontend_question_id": 471, "is_new_question": false }, @@ -54088,8 +54479,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 10410, - "total_submitted": 26527, + "total_acs": 10427, + "total_submitted": 26568, "frontend_question_id": 469, "is_new_question": false }, @@ -54111,8 +54502,8 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 145541, - "total_submitted": 545931, + "total_acs": 146080, + "total_submitted": 547590, "frontend_question_id": 468, "is_new_question": false }, @@ -54134,8 +54525,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 41004, - "total_submitted": 105409, + "total_acs": 41164, + "total_submitted": 105690, "frontend_question_id": 467, "is_new_question": false }, @@ -54157,8 +54548,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 16511, - "total_submitted": 55857, + "total_acs": 16563, + "total_submitted": 56020, "frontend_question_id": 466, "is_new_question": false }, @@ -54180,8 +54571,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 81931, - "total_submitted": 165871, + "total_acs": 82037, + "total_submitted": 166060, "frontend_question_id": 465, "is_new_question": false }, @@ -54203,8 +54594,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 87629, - "total_submitted": 296033, + "total_acs": 87889, + "total_submitted": 297026, "frontend_question_id": 464, "is_new_question": false }, @@ -54226,8 +54617,8 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 450901, - "total_submitted": 645632, + "total_acs": 452676, + "total_submitted": 648120, "frontend_question_id": 463, "is_new_question": false }, @@ -54249,8 +54640,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": 166842, - "total_submitted": 278235, + "total_acs": 167265, + "total_submitted": 278868, "frontend_question_id": 462, "is_new_question": false }, @@ -54272,8 +54663,8 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 536080, - "total_submitted": 713665, + "total_acs": 537303, + "total_submitted": 715236, "frontend_question_id": 461, "is_new_question": false }, @@ -54295,8 +54686,8 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 224089, - "total_submitted": 516181, + "total_acs": 225006, + "total_submitted": 517800, "frontend_question_id": 460, "is_new_question": false }, @@ -54318,8 +54709,8 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 310588, - "total_submitted": 710498, + "total_acs": 312101, + "total_submitted": 714016, "frontend_question_id": 459, "is_new_question": false }, @@ -54341,8 +54732,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 74941, - "total_submitted": 120985, + "total_acs": 75051, + "total_submitted": 121334, "frontend_question_id": 458, "is_new_question": false }, @@ -54364,8 +54755,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 71920, - "total_submitted": 218182, + "total_acs": 72128, + "total_submitted": 218705, "frontend_question_id": 457, "is_new_question": false }, @@ -54387,8 +54778,8 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 174901, - "total_submitted": 540576, + "total_acs": 175585, + "total_submitted": 542813, "frontend_question_id": 456, "is_new_question": false }, @@ -54410,8 +54801,8 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 241371, - "total_submitted": 484719, + "total_acs": 243344, + "total_submitted": 488822, "frontend_question_id": 455, "is_new_question": false }, @@ -54433,8 +54824,8 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 301408, - "total_submitted": 527412, + "total_acs": 302261, + "total_submitted": 528930, "frontend_question_id": 454, "is_new_question": false }, @@ -54456,8 +54847,8 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 158140, - "total_submitted": 281012, + "total_acs": 158701, + "total_submitted": 281903, "frontend_question_id": 453, "is_new_question": false }, @@ -54479,8 +54870,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": 321831, - "total_submitted": 580619, + "total_acs": 324365, + "total_submitted": 584834, "frontend_question_id": 452, "is_new_question": false }, @@ -54502,8 +54893,8 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 528242, - "total_submitted": 751921, + "total_acs": 531196, + "total_submitted": 755847, "frontend_question_id": 451, "is_new_question": false }, @@ -54525,8 +54916,8 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 390103, - "total_submitted": 770383, + "total_acs": 393911, + "total_submitted": 777828, "frontend_question_id": 450, "is_new_question": false }, @@ -54548,8 +54939,8 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 222155, - "total_submitted": 388316, + "total_acs": 222600, + "total_submitted": 389032, "frontend_question_id": 449, "is_new_question": false }, @@ -54571,8 +54962,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": 763233, - "total_submitted": 1267920, + "total_acs": 767346, + "total_submitted": 1274285, "frontend_question_id": 448, "is_new_question": false }, @@ -54594,8 +54985,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 94842, - "total_submitted": 172237, + "total_acs": 94960, + "total_submitted": 172473, "frontend_question_id": 447, "is_new_question": false }, @@ -54617,8 +55008,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 75738, - "total_submitted": 162704, + "total_acs": 75885, + "total_submitted": 163046, "frontend_question_id": 446, "is_new_question": false }, @@ -54640,8 +55031,8 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 436691, - "total_submitted": 715940, + "total_acs": 438316, + "total_submitted": 718657, "frontend_question_id": 445, "is_new_question": false }, @@ -54663,8 +55054,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 50729, - "total_submitted": 188247, + "total_acs": 51010, + "total_submitted": 188737, "frontend_question_id": 444, "is_new_question": false }, @@ -54686,8 +55077,8 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 416928, - "total_submitted": 789248, + "total_acs": 421841, + "total_submitted": 797915, "frontend_question_id": 443, "is_new_question": false }, @@ -54709,8 +55100,8 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 545069, - "total_submitted": 740900, + "total_acs": 548365, + "total_submitted": 745297, "frontend_question_id": 442, "is_new_question": false }, @@ -54732,8 +55123,8 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 376908, - "total_submitted": 814170, + "total_acs": 379187, + "total_submitted": 818841, "frontend_question_id": 441, "is_new_question": false }, @@ -54755,8 +55146,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 20786, - "total_submitted": 66091, + "total_acs": 20840, + "total_submitted": 66257, "frontend_question_id": 440, "is_new_question": false }, @@ -54778,8 +55169,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 30295, - "total_submitted": 50347, + "total_acs": 30382, + "total_submitted": 50483, "frontend_question_id": 439, "is_new_question": false }, @@ -54801,8 +55192,8 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 786920, - "total_submitted": 1563358, + "total_acs": 789761, + "total_submitted": 1568417, "frontend_question_id": 438, "is_new_question": false }, @@ -54824,8 +55215,8 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 476253, - "total_submitted": 1005571, + "total_acs": 479356, + "total_submitted": 1013104, "frontend_question_id": 437, "is_new_question": false }, @@ -54847,8 +55238,8 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 99025, - "total_submitted": 193202, + "total_acs": 99569, + "total_submitted": 194137, "frontend_question_id": 436, "is_new_question": false }, @@ -54870,8 +55261,8 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 447718, - "total_submitted": 860979, + "total_acs": 451745, + "total_submitted": 868153, "frontend_question_id": 435, "is_new_question": false }, @@ -54893,8 +55284,8 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 153032, - "total_submitted": 416461, + "total_acs": 153839, + "total_submitted": 418868, "frontend_question_id": 434, "is_new_question": false }, @@ -54916,8 +55307,8 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 126383, - "total_submitted": 239676, + "total_acs": 127655, + "total_submitted": 241777, "frontend_question_id": 433, "is_new_question": false }, @@ -54939,8 +55330,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 70717, - "total_submitted": 193489, + "total_acs": 70969, + "total_submitted": 194141, "frontend_question_id": 432, "is_new_question": false }, @@ -54962,8 +55353,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 70888, - "total_submitted": 133809, + "total_acs": 71035, + "total_submitted": 133994, "frontend_question_id": 425, "is_new_question": false }, @@ -54985,8 +55376,8 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 512542, - "total_submitted": 978762, + "total_acs": 520103, + "total_submitted": 992329, "frontend_question_id": 424, "is_new_question": false }, @@ -55008,8 +55399,8 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 74227, - "total_submitted": 145104, + "total_acs": 74418, + "total_submitted": 145489, "frontend_question_id": 423, "is_new_question": false }, @@ -55031,8 +55422,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 51751, - "total_submitted": 128329, + "total_acs": 51912, + "total_submitted": 128662, "frontend_question_id": 422, "is_new_question": false }, @@ -55054,8 +55445,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": 145824, - "total_submitted": 271223, + "total_acs": 146354, + "total_submitted": 272249, "frontend_question_id": 421, "is_new_question": false }, @@ -55077,8 +55468,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 34548, - "total_submitted": 253750, + "total_acs": 34724, + "total_submitted": 255314, "frontend_question_id": 420, "is_new_question": false }, @@ -55100,8 +55491,8 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 187317, - "total_submitted": 249900, + "total_acs": 188111, + "total_submitted": 250943, "frontend_question_id": 419, "is_new_question": false }, @@ -55123,8 +55514,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 94091, - "total_submitted": 264103, + "total_acs": 94180, + "total_submitted": 264317, "frontend_question_id": 418, "is_new_question": false }, @@ -55146,8 +55537,8 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 382834, - "total_submitted": 700265, + "total_acs": 385821, + "total_submitted": 705498, "frontend_question_id": 417, "is_new_question": false }, @@ -55169,8 +55560,8 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 675362, - "total_submitted": 1462172, + "total_acs": 681893, + "total_submitted": 1476262, "frontend_question_id": 416, "is_new_question": false }, @@ -55192,8 +55583,8 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 586945, - "total_submitted": 1127357, + "total_acs": 589215, + "total_submitted": 1132227, "frontend_question_id": 415, "is_new_question": false }, @@ -55215,8 +55606,8 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 453500, - "total_submitted": 1347659, + "total_acs": 456834, + "total_submitted": 1355220, "frontend_question_id": 414, "is_new_question": false }, @@ -55238,8 +55629,8 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 281259, - "total_submitted": 432477, + "total_acs": 281885, + "total_submitted": 433498, "frontend_question_id": 413, "is_new_question": false }, @@ -55261,8 +55652,8 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 1038310, - "total_submitted": 1470014, + "total_acs": 1044842, + "total_submitted": 1478311, "frontend_question_id": 412, "is_new_question": false }, @@ -55284,8 +55675,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 14373, - "total_submitted": 36374, + "total_acs": 14379, + "total_submitted": 36383, "frontend_question_id": 411, "is_new_question": false }, @@ -55307,8 +55698,8 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 281527, - "total_submitted": 521018, + "total_acs": 284067, + "total_submitted": 525027, "frontend_question_id": 410, "is_new_question": false }, @@ -55330,8 +55721,8 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 544942, - "total_submitted": 1009567, + "total_acs": 547886, + "total_submitted": 1015127, "frontend_question_id": 409, "is_new_question": false }, @@ -55353,8 +55744,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 121261, - "total_submitted": 347900, + "total_acs": 121899, + "total_submitted": 349707, "frontend_question_id": 408, "is_new_question": false }, @@ -55376,8 +55767,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 81014, - "total_submitted": 170157, + "total_acs": 81271, + "total_submitted": 170664, "frontend_question_id": 407, "is_new_question": false }, @@ -55399,8 +55790,8 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 286702, - "total_submitted": 392232, + "total_acs": 287174, + "total_submitted": 392835, "frontend_question_id": 406, "is_new_question": false }, @@ -55422,8 +55813,8 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 126411, - "total_submitted": 267753, + "total_acs": 127048, + "total_submitted": 268803, "frontend_question_id": 405, "is_new_question": false }, @@ -55445,8 +55836,8 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 454633, - "total_submitted": 796636, + "total_acs": 456610, + "total_submitted": 799601, "frontend_question_id": 404, "is_new_question": false }, @@ -55468,8 +55859,8 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 187161, - "total_submitted": 434471, + "total_acs": 188189, + "total_submitted": 436907, "frontend_question_id": 403, "is_new_question": false }, @@ -55491,8 +55882,8 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 324866, - "total_submitted": 1058570, + "total_acs": 326813, + "total_submitted": 1064403, "frontend_question_id": 402, "is_new_question": false }, @@ -55514,8 +55905,8 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 129445, - "total_submitted": 244786, + "total_acs": 129785, + "total_submitted": 245243, "frontend_question_id": 401, "is_new_question": false }, @@ -55537,8 +55928,8 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 87374, - "total_submitted": 255210, + "total_acs": 87567, + "total_submitted": 255770, "frontend_question_id": 400, "is_new_question": false }, @@ -55560,8 +55951,8 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 392375, - "total_submitted": 639372, + "total_acs": 394962, + "total_submitted": 643597, "frontend_question_id": 399, "is_new_question": false }, @@ -55583,8 +55974,8 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 192458, - "total_submitted": 308076, + "total_acs": 192823, + "total_submitted": 308637, "frontend_question_id": 398, "is_new_question": false }, @@ -55606,8 +55997,8 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 103712, - "total_submitted": 293834, + "total_acs": 104271, + "total_submitted": 295260, "frontend_question_id": 397, "is_new_question": false }, @@ -55629,8 +56020,8 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 76861, - "total_submitted": 184923, + "total_acs": 77136, + "total_submitted": 185477, "frontend_question_id": 396, "is_new_question": false }, @@ -55652,8 +56043,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": 198028, - "total_submitted": 441964, + "total_acs": 199011, + "total_submitted": 444020, "frontend_question_id": 395, "is_new_question": false }, @@ -55675,8 +56066,8 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 674945, - "total_submitted": 1158408, + "total_acs": 679413, + "total_submitted": 1165379, "frontend_question_id": 394, "is_new_question": false }, @@ -55698,8 +56089,8 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 118063, - "total_submitted": 262104, + "total_acs": 118178, + "total_submitted": 262358, "frontend_question_id": 393, "is_new_question": false }, @@ -55721,8 +56112,8 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 950980, - "total_submitted": 2012061, + "total_acs": 963991, + "total_submitted": 2040000, "frontend_question_id": 392, "is_new_question": false }, @@ -55744,8 +56135,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 40408, - "total_submitted": 122166, + "total_acs": 40556, + "total_submitted": 122497, "frontend_question_id": 391, "is_new_question": false }, @@ -55767,8 +56158,8 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 61185, - "total_submitted": 133228, + "total_acs": 61493, + "total_submitted": 133928, "frontend_question_id": 390, "is_new_question": false }, @@ -55790,8 +56181,8 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 528639, - "total_submitted": 891797, + "total_acs": 532082, + "total_submitted": 898285, "frontend_question_id": 389, "is_new_question": false }, @@ -55813,8 +56204,8 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 144481, - "total_submitted": 308839, + "total_acs": 144723, + "total_submitted": 309243, "frontend_question_id": 388, "is_new_question": false }, @@ -55836,8 +56227,8 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 1437856, - "total_submitted": 2397017, + "total_acs": 1442574, + "total_submitted": 2403679, "frontend_question_id": 387, "is_new_question": false }, @@ -55859,8 +56250,8 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 105894, - "total_submitted": 170132, + "total_acs": 106383, + "total_submitted": 170766, "frontend_question_id": 386, "is_new_question": false }, @@ -55882,8 +56273,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 53210, - "total_submitted": 143048, + "total_acs": 53282, + "total_submitted": 143203, "frontend_question_id": 385, "is_new_question": false }, @@ -55905,8 +56296,8 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 312835, - "total_submitted": 539919, + "total_acs": 313500, + "total_submitted": 541030, "frontend_question_id": 384, "is_new_question": false }, @@ -55928,8 +56319,8 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 847062, - "total_submitted": 1435062, + "total_acs": 856939, + "total_submitted": 1449497, "frontend_question_id": 383, "is_new_question": false }, @@ -55951,8 +56342,8 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 228628, - "total_submitted": 363804, + "total_acs": 229142, + "total_submitted": 364600, "frontend_question_id": 382, "is_new_question": false }, @@ -55974,8 +56365,8 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 128986, - "total_submitted": 363727, + "total_acs": 129257, + "total_submitted": 364504, "frontend_question_id": 381, "is_new_question": false }, @@ -55997,8 +56388,8 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 656825, - "total_submitted": 1244166, + "total_acs": 661143, + "total_submitted": 1252401, "frontend_question_id": 380, "is_new_question": false }, @@ -56014,14 +56405,14 @@ { "stat": { "question_id": 379, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "design-phone-directory", + "question__article__has_video_solution": false, "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 62678, - "total_submitted": 122125, + "total_acs": 62794, + "total_submitted": 122319, "frontend_question_id": 379, "is_new_question": false }, @@ -56043,8 +56434,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": 553301, - "total_submitted": 893310, + "total_acs": 555591, + "total_submitted": 896796, "frontend_question_id": 378, "is_new_question": false }, @@ -56066,8 +56457,8 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 374862, - "total_submitted": 717673, + "total_acs": 376762, + "total_submitted": 721134, "frontend_question_id": 377, "is_new_question": false }, @@ -56089,8 +56480,8 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 226881, - "total_submitted": 469085, + "total_acs": 227731, + "total_submitted": 470832, "frontend_question_id": 376, "is_new_question": false }, @@ -56112,8 +56503,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 110688, - "total_submitted": 232387, + "total_acs": 111189, + "total_submitted": 233178, "frontend_question_id": 375, "is_new_question": false }, @@ -56135,8 +56526,8 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 526616, - "total_submitted": 1006486, + "total_acs": 530517, + "total_submitted": 1013050, "frontend_question_id": 374, "is_new_question": false }, @@ -56158,8 +56549,8 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 254899, - "total_submitted": 636401, + "total_acs": 256255, + "total_submitted": 639703, "frontend_question_id": 373, "is_new_question": false }, @@ -56181,8 +56572,8 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 62429, - "total_submitted": 173827, + "total_acs": 62691, + "total_submitted": 174645, "frontend_question_id": 372, "is_new_question": false }, @@ -56204,8 +56595,8 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 405278, - "total_submitted": 798075, + "total_acs": 407931, + "total_submitted": 802714, "frontend_question_id": 371, "is_new_question": false }, @@ -56227,8 +56618,8 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 88841, - "total_submitted": 124645, + "total_acs": 89079, + "total_submitted": 124969, "frontend_question_id": 370, "is_new_question": false }, @@ -56250,8 +56641,8 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 76058, - "total_submitted": 124751, + "total_acs": 76206, + "total_submitted": 125025, "frontend_question_id": 369, "is_new_question": false }, @@ -56273,8 +56664,8 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 189575, - "total_submitted": 451236, + "total_acs": 190681, + "total_submitted": 453529, "frontend_question_id": 368, "is_new_question": false }, @@ -56296,8 +56687,8 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 512049, - "total_submitted": 1180759, + "total_acs": 515152, + "total_submitted": 1187721, "frontend_question_id": 367, "is_new_question": false }, @@ -56319,8 +56710,8 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 241030, - "total_submitted": 299897, + "total_acs": 241537, + "total_submitted": 300474, "frontend_question_id": 366, "is_new_question": false }, @@ -56342,8 +56733,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 85240, - "total_submitted": 221371, + "total_acs": 85732, + "total_submitted": 222276, "frontend_question_id": 365, "is_new_question": false }, @@ -56365,8 +56756,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 130161, - "total_submitted": 196282, + "total_acs": 130247, + "total_submitted": 196454, "frontend_question_id": 364, "is_new_question": false }, @@ -56388,8 +56779,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": 120311, - "total_submitted": 273578, + "total_acs": 120506, + "total_submitted": 274008, "frontend_question_id": 363, "is_new_question": false }, @@ -56411,8 +56802,8 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 212917, - "total_submitted": 311246, + "total_acs": 213633, + "total_submitted": 312285, "frontend_question_id": 362, "is_new_question": false }, @@ -56434,8 +56825,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 75432, - "total_submitted": 146513, + "total_acs": 75515, + "total_submitted": 146666, "frontend_question_id": 361, "is_new_question": false }, @@ -56457,8 +56848,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 62698, - "total_submitted": 113555, + "total_acs": 62763, + "total_submitted": 113650, "frontend_question_id": 360, "is_new_question": false }, @@ -56480,8 +56871,8 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 284797, - "total_submitted": 376609, + "total_acs": 285604, + "total_submitted": 377674, "frontend_question_id": 359, "is_new_question": false }, @@ -56503,8 +56894,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 58645, - "total_submitted": 154568, + "total_acs": 58715, + "total_submitted": 154724, "frontend_question_id": 358, "is_new_question": false }, @@ -56526,8 +56917,8 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 122621, - "total_submitted": 235096, + "total_acs": 123203, + "total_submitted": 236043, "frontend_question_id": 357, "is_new_question": false }, @@ -56549,8 +56940,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 36623, - "total_submitted": 104770, + "total_acs": 36791, + "total_submitted": 105158, "frontend_question_id": 356, "is_new_question": false }, @@ -56572,8 +56963,8 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 135131, - "total_submitted": 355181, + "total_acs": 136776, + "total_submitted": 358805, "frontend_question_id": 355, "is_new_question": false }, @@ -56595,8 +56986,8 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 196479, - "total_submitted": 524140, + "total_acs": 197458, + "total_submitted": 527271, "frontend_question_id": 354, "is_new_question": false }, @@ -56618,8 +57009,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 76389, - "total_submitted": 195304, + "total_acs": 76667, + "total_submitted": 196083, "frontend_question_id": 353, "is_new_question": false }, @@ -56641,8 +57032,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 100737, - "total_submitted": 168423, + "total_acs": 100959, + "total_submitted": 168750, "frontend_question_id": 352, "is_new_question": false }, @@ -56664,8 +57055,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 70113, - "total_submitted": 135726, + "total_acs": 70170, + "total_submitted": 135811, "frontend_question_id": 351, "is_new_question": false }, @@ -56687,8 +57078,8 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 1095281, - "total_submitted": 1951092, + "total_acs": 1099016, + "total_submitted": 1957717, "frontend_question_id": 350, "is_new_question": false }, @@ -56710,8 +57101,8 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 896568, - "total_submitted": 1255296, + "total_acs": 901749, + "total_submitted": 1261760, "frontend_question_id": 349, "is_new_question": false }, @@ -56733,8 +57124,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 215590, - "total_submitted": 373575, + "total_acs": 216161, + "total_submitted": 374663, "frontend_question_id": 348, "is_new_question": false }, @@ -56756,8 +57147,8 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 1615013, - "total_submitted": 2546232, + "total_acs": 1632315, + "total_submitted": 2576306, "frontend_question_id": 347, "is_new_question": false }, @@ -56779,8 +57170,8 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 317374, - "total_submitted": 411068, + "total_acs": 318359, + "total_submitted": 412293, "frontend_question_id": 346, "is_new_question": false }, @@ -56802,8 +57193,8 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 574578, - "total_submitted": 1129476, + "total_acs": 584255, + "total_submitted": 1146603, "frontend_question_id": 345, "is_new_question": false }, @@ -56825,8 +57216,8 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 2191573, - "total_submitted": 2842513, + "total_acs": 2203369, + "total_submitted": 2856801, "frontend_question_id": 344, "is_new_question": false }, @@ -56848,8 +57239,8 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 240104, - "total_submitted": 424816, + "total_acs": 241130, + "total_submitted": 426311, "frontend_question_id": 343, "is_new_question": false }, @@ -56871,8 +57262,8 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 484008, - "total_submitted": 1039101, + "total_acs": 486666, + "total_submitted": 1043937, "frontend_question_id": 342, "is_new_question": false }, @@ -56894,8 +57285,8 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 369591, - "total_submitted": 596020, + "total_acs": 370230, + "total_submitted": 596944, "frontend_question_id": 341, "is_new_question": false }, @@ -56917,8 +57308,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": 320373, - "total_submitted": 663498, + "total_acs": 320993, + "total_submitted": 664632, "frontend_question_id": 340, "is_new_question": false }, @@ -56940,8 +57331,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 226484, - "total_submitted": 274977, + "total_acs": 226886, + "total_submitted": 275437, "frontend_question_id": 339, "is_new_question": false }, @@ -56963,8 +57354,8 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 822639, - "total_submitted": 1079464, + "total_acs": 829283, + "total_submitted": 1087613, "frontend_question_id": 338, "is_new_question": false }, @@ -56986,8 +57377,8 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 347079, - "total_submitted": 642719, + "total_acs": 348362, + "total_submitted": 645052, "frontend_question_id": 337, "is_new_question": false }, @@ -57009,8 +57400,8 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 195282, - "total_submitted": 558533, + "total_acs": 195622, + "total_submitted": 559465, "frontend_question_id": 336, "is_new_question": false }, @@ -57032,8 +57423,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 31116, - "total_submitted": 105070, + "total_acs": 31213, + "total_submitted": 105340, "frontend_question_id": 335, "is_new_question": false }, @@ -57055,8 +57446,8 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 424064, - "total_submitted": 1017717, + "total_acs": 429076, + "total_submitted": 1032994, "frontend_question_id": 334, "is_new_question": false }, @@ -57078,8 +57469,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 98262, - "total_submitted": 228468, + "total_acs": 98475, + "total_submitted": 228899, "frontend_question_id": 333, "is_new_question": false }, @@ -57101,8 +57492,8 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 340181, - "total_submitted": 819046, + "total_acs": 341594, + "total_submitted": 821830, "frontend_question_id": 332, "is_new_question": false }, @@ -57124,8 +57515,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": 131732, - "total_submitted": 294361, + "total_acs": 132038, + "total_submitted": 295002, "frontend_question_id": 331, "is_new_question": false }, @@ -57147,8 +57538,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 63225, - "total_submitted": 155624, + "total_acs": 63369, + "total_submitted": 155878, "frontend_question_id": 330, "is_new_question": false }, @@ -57170,8 +57561,8 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 461541, - "total_submitted": 874808, + "total_acs": 463779, + "total_submitted": 878659, "frontend_question_id": 329, "is_new_question": false }, @@ -57193,8 +57584,8 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 763752, - "total_submitted": 1245403, + "total_acs": 769004, + "total_submitted": 1253810, "frontend_question_id": 328, "is_new_question": false }, @@ -57216,8 +57607,8 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 70374, - "total_submitted": 196861, + "total_acs": 70584, + "total_submitted": 197432, "frontend_question_id": 327, "is_new_question": false }, @@ -57239,8 +57630,8 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 716658, - "total_submitted": 1565756, + "total_acs": 720065, + "total_submitted": 1572504, "frontend_question_id": 326, "is_new_question": false }, @@ -57262,8 +57653,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 174405, - "total_submitted": 353971, + "total_acs": 174679, + "total_submitted": 354453, "frontend_question_id": 325, "is_new_question": false }, @@ -57285,8 +57676,8 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 146594, - "total_submitted": 435449, + "total_acs": 147302, + "total_submitted": 437017, "frontend_question_id": 324, "is_new_question": false }, @@ -57308,8 +57699,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": 347853, - "total_submitted": 557560, + "total_acs": 349419, + "total_submitted": 560084, "frontend_question_id": 323, "is_new_question": false }, @@ -57331,8 +57722,8 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 1478493, - "total_submitted": 3467293, + "total_acs": 1490958, + "total_submitted": 3491644, "frontend_question_id": 322, "is_new_question": false }, @@ -57354,8 +57745,8 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 56078, - "total_submitted": 191090, + "total_acs": 56225, + "total_submitted": 191447, "frontend_question_id": 321, "is_new_question": false }, @@ -57377,8 +57768,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 66107, - "total_submitted": 114162, + "total_acs": 66171, + "total_submitted": 114237, "frontend_question_id": 320, "is_new_question": false }, @@ -57400,8 +57791,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 196754, - "total_submitted": 374544, + "total_acs": 197785, + "total_submitted": 376396, "frontend_question_id": 319, "is_new_question": false }, @@ -57423,8 +57814,8 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 205307, - "total_submitted": 343274, + "total_acs": 205695, + "total_submitted": 343939, "frontend_question_id": 318, "is_new_question": false }, @@ -57446,8 +57837,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 156499, - "total_submitted": 367330, + "total_acs": 156750, + "total_submitted": 367908, "frontend_question_id": 317, "is_new_question": false }, @@ -57469,8 +57860,8 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 238519, - "total_submitted": 523356, + "total_acs": 240009, + "total_submitted": 525928, "frontend_question_id": 316, "is_new_question": false }, @@ -57492,8 +57883,8 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 297916, - "total_submitted": 702025, + "total_acs": 298654, + "total_submitted": 703839, "frontend_question_id": 315, "is_new_question": false }, @@ -57515,8 +57906,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 325575, - "total_submitted": 620506, + "total_acs": 326627, + "total_submitted": 622252, "frontend_question_id": 314, "is_new_question": false }, @@ -57538,8 +57929,8 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 120057, - "total_submitted": 264720, + "total_acs": 120328, + "total_submitted": 265409, "frontend_question_id": 313, "is_new_question": false }, @@ -57561,8 +57952,8 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 243443, - "total_submitted": 421678, + "total_acs": 245402, + "total_submitted": 424649, "frontend_question_id": 312, "is_new_question": false }, @@ -57584,8 +57975,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 177886, - "total_submitted": 262855, + "total_acs": 178221, + "total_submitted": 263271, "frontend_question_id": 311, "is_new_question": false }, @@ -57607,8 +57998,8 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 258371, - "total_submitted": 668981, + "total_acs": 259669, + "total_submitted": 672349, "frontend_question_id": 310, "is_new_question": false }, @@ -57630,8 +58021,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": 434105, - "total_submitted": 761092, + "total_acs": 437312, + "total_submitted": 766021, "frontend_question_id": 309, "is_new_question": false }, @@ -57653,8 +58044,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 73475, - "total_submitted": 170152, + "total_acs": 73616, + "total_submitted": 170330, "frontend_question_id": 308, "is_new_question": false }, @@ -57676,8 +58067,8 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 251855, - "total_submitted": 618368, + "total_acs": 252465, + "total_submitted": 619859, "frontend_question_id": 307, "is_new_question": false }, @@ -57699,8 +58090,8 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 81622, - "total_submitted": 261755, + "total_acs": 81871, + "total_submitted": 262454, "frontend_question_id": 306, "is_new_question": false }, @@ -57722,8 +58113,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 133061, - "total_submitted": 336023, + "total_acs": 133249, + "total_submitted": 336575, "frontend_question_id": 305, "is_new_question": false }, @@ -57745,8 +58136,8 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 330352, - "total_submitted": 620213, + "total_acs": 331253, + "total_submitted": 621496, "frontend_question_id": 304, "is_new_question": false }, @@ -57768,8 +58159,8 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 457391, - "total_submitted": 753329, + "total_acs": 459578, + "total_submitted": 755887, "frontend_question_id": 303, "is_new_question": false }, @@ -57791,8 +58182,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 48207, - "total_submitted": 82214, + "total_acs": 48263, + "total_submitted": 82302, "frontend_question_id": 302, "is_new_question": false }, @@ -57814,8 +58205,8 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 387969, - "total_submitted": 821226, + "total_acs": 388961, + "total_submitted": 823157, "frontend_question_id": 301, "is_new_question": false }, @@ -57837,8 +58228,8 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 1302688, - "total_submitted": 2457171, + "total_acs": 1314835, + "total_submitted": 2476047, "frontend_question_id": 300, "is_new_question": false }, @@ -57860,8 +58251,8 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 351850, - "total_submitted": 707770, + "total_acs": 352560, + "total_submitted": 708898, "frontend_question_id": 299, "is_new_question": false }, @@ -57883,8 +58274,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 140638, - "total_submitted": 265177, + "total_acs": 140853, + "total_submitted": 265541, "frontend_question_id": 298, "is_new_question": false }, @@ -57906,8 +58297,8 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 769676, - "total_submitted": 1380032, + "total_acs": 773252, + "total_submitted": 1385718, "frontend_question_id": 297, "is_new_question": false }, @@ -57929,8 +58320,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 68557, - "total_submitted": 114153, + "total_acs": 68650, + "total_submitted": 114300, "frontend_question_id": 296, "is_new_question": false }, @@ -57952,8 +58343,8 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 662748, - "total_submitted": 1287822, + "total_acs": 666695, + "total_submitted": 1295207, "frontend_question_id": 295, "is_new_question": false }, @@ -57975,8 +58366,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 68404, - "total_submitted": 131646, + "total_acs": 68461, + "total_submitted": 131743, "frontend_question_id": 294, "is_new_question": false }, @@ -57998,8 +58389,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 64670, - "total_submitted": 102051, + "total_acs": 64757, + "total_submitted": 102171, "frontend_question_id": 293, "is_new_question": false }, @@ -58021,8 +58412,8 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 334566, - "total_submitted": 594888, + "total_acs": 335883, + "total_submitted": 597091, "frontend_question_id": 292, "is_new_question": false }, @@ -58044,8 +58435,8 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 68552, - "total_submitted": 145168, + "total_acs": 68665, + "total_submitted": 145360, "frontend_question_id": 291, "is_new_question": false }, @@ -58067,8 +58458,8 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 560801, - "total_submitted": 1345310, + "total_acs": 565230, + "total_submitted": 1355758, "frontend_question_id": 290, "is_new_question": false }, @@ -58090,8 +58481,8 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 407840, - "total_submitted": 601938, + "total_acs": 409827, + "total_submitted": 604383, "frontend_question_id": 289, "is_new_question": false }, @@ -58113,8 +58504,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 70269, - "total_submitted": 272762, + "total_acs": 70329, + "total_submitted": 272887, "frontend_question_id": 288, "is_new_question": false }, @@ -58136,8 +58527,8 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 1263386, - "total_submitted": 2140500, + "total_acs": 1273804, + "total_submitted": 2158208, "frontend_question_id": 287, "is_new_question": false }, @@ -58159,8 +58550,8 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 277750, - "total_submitted": 457989, + "total_acs": 278810, + "total_submitted": 459581, "frontend_question_id": 286, "is_new_question": false }, @@ -58182,8 +58573,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 307840, - "total_submitted": 628390, + "total_acs": 308323, + "total_submitted": 629151, "frontend_question_id": 285, "is_new_question": false }, @@ -58205,8 +58596,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 209456, - "total_submitted": 355926, + "total_acs": 209775, + "total_submitted": 356336, "frontend_question_id": 284, "is_new_question": false }, @@ -58228,8 +58619,8 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 2384753, - "total_submitted": 3884664, + "total_acs": 2405190, + "total_submitted": 3917659, "frontend_question_id": 283, "is_new_question": false }, @@ -58251,8 +58642,8 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 202966, - "total_submitted": 516919, + "total_acs": 203499, + "total_submitted": 518139, "frontend_question_id": 282, "is_new_question": false }, @@ -58274,8 +58665,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 88515, - "total_submitted": 140304, + "total_acs": 88617, + "total_submitted": 140423, "frontend_question_id": 281, "is_new_question": false }, @@ -58297,8 +58688,8 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 133559, - "total_submitted": 198496, + "total_acs": 133923, + "total_submitted": 198989, "frontend_question_id": 280, "is_new_question": false }, @@ -58320,8 +58711,8 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 686233, - "total_submitted": 1297537, + "total_acs": 689006, + "total_submitted": 1302220, "frontend_question_id": 279, "is_new_question": false }, @@ -58343,8 +58734,8 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 1528340, - "total_submitted": 3503092, + "total_acs": 1533257, + "total_submitted": 3512500, "frontend_question_id": 278, "is_new_question": false }, @@ -58366,8 +58757,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 251433, - "total_submitted": 537544, + "total_acs": 251813, + "total_submitted": 538219, "frontend_question_id": 277, "is_new_question": false }, @@ -58389,8 +58780,8 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 100662, - "total_submitted": 223824, + "total_acs": 100970, + "total_submitted": 224271, "frontend_question_id": 276, "is_new_question": false }, @@ -58412,8 +58803,8 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 183512, - "total_submitted": 486403, + "total_acs": 184273, + "total_submitted": 488340, "frontend_question_id": 275, "is_new_question": false }, @@ -58435,8 +58826,8 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 301789, - "total_submitted": 784717, + "total_acs": 306977, + "total_submitted": 797842, "frontend_question_id": 274, "is_new_question": false }, @@ -58458,8 +58849,8 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 349521, - "total_submitted": 1159839, + "total_acs": 350369, + "total_submitted": 1162344, "frontend_question_id": 273, "is_new_question": false }, @@ -58481,8 +58872,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 111967, - "total_submitted": 191154, + "total_acs": 112098, + "total_submitted": 191329, "frontend_question_id": 272, "is_new_question": false }, @@ -58504,8 +58895,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 156874, - "total_submitted": 355242, + "total_acs": 159149, + "total_submitted": 358888, "frontend_question_id": 271, "is_new_question": false }, @@ -58527,8 +58918,8 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 291524, - "total_submitted": 542005, + "total_acs": 292250, + "total_submitted": 543979, "frontend_question_id": 270, "is_new_question": false }, @@ -58550,8 +58941,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 344406, - "total_submitted": 973880, + "total_acs": 345477, + "total_submitted": 976675, "frontend_question_id": 269, "is_new_question": false }, @@ -58573,8 +58964,8 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 1615855, - "total_submitted": 2545213, + "total_acs": 1631120, + "total_submitted": 2565599, "frontend_question_id": 268, "is_new_question": false }, @@ -58596,8 +58987,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 62619, - "total_submitted": 153469, + "total_acs": 62770, + "total_submitted": 153770, "frontend_question_id": 267, "is_new_question": false }, @@ -58619,8 +59010,8 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 185022, - "total_submitted": 279194, + "total_acs": 185416, + "total_submitted": 279720, "frontend_question_id": 266, "is_new_question": false }, @@ -58642,8 +59033,8 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 115095, - "total_submitted": 213946, + "total_acs": 115389, + "total_submitted": 214340, "frontend_question_id": 265, "is_new_question": false }, @@ -58665,8 +59056,8 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 314840, - "total_submitted": 681746, + "total_acs": 315980, + "total_submitted": 684135, "frontend_question_id": 264, "is_new_question": false }, @@ -58688,8 +59079,8 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 445104, - "total_submitted": 1057670, + "total_acs": 447408, + "total_submitted": 1063248, "frontend_question_id": 263, "is_new_question": false }, @@ -58711,8 +59102,8 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 154172, - "total_submitted": 419618, + "total_acs": 154979, + "total_submitted": 422110, "frontend_question_id": 262, "is_new_question": false }, @@ -58734,8 +59125,8 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 351084, - "total_submitted": 741525, + "total_acs": 352475, + "total_submitted": 744082, "frontend_question_id": 261, "is_new_question": false }, @@ -58757,8 +59148,8 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 312066, - "total_submitted": 459893, + "total_acs": 313586, + "total_submitted": 462162, "frontend_question_id": 260, "is_new_question": false }, @@ -58780,8 +59171,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 137304, - "total_submitted": 271412, + "total_acs": 137639, + "total_submitted": 272061, "frontend_question_id": 259, "is_new_question": false }, @@ -58803,8 +59194,8 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 674525, - "total_submitted": 1024306, + "total_acs": 677906, + "total_submitted": 1029187, "frontend_question_id": 258, "is_new_question": false }, @@ -58826,8 +59217,8 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 642458, - "total_submitted": 1033769, + "total_acs": 645614, + "total_submitted": 1037712, "frontend_question_id": 257, "is_new_question": false }, @@ -58849,8 +59240,8 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 190514, - "total_submitted": 310017, + "total_acs": 190928, + "total_submitted": 310555, "frontend_question_id": 256, "is_new_question": false }, @@ -58872,8 +59263,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": 71938, - "total_submitted": 148460, + "total_acs": 72071, + "total_submitted": 148692, "frontend_question_id": 255, "is_new_question": false }, @@ -58895,8 +59286,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 122112, - "total_submitted": 248119, + "total_acs": 122255, + "total_submitted": 248377, "frontend_question_id": 254, "is_new_question": false }, @@ -58918,8 +59309,8 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 798714, - "total_submitted": 1575274, + "total_acs": 800982, + "total_submitted": 1579474, "frontend_question_id": 253, "is_new_question": false }, @@ -58941,8 +59332,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 352484, - "total_submitted": 613331, + "total_acs": 353925, + "total_submitted": 615589, "frontend_question_id": 252, "is_new_question": false }, @@ -58964,8 +59355,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 121055, - "total_submitted": 245891, + "total_acs": 121186, + "total_submitted": 246109, "frontend_question_id": 251, "is_new_question": false }, @@ -58987,8 +59378,8 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 143449, - "total_submitted": 256343, + "total_acs": 143767, + "total_submitted": 256798, "frontend_question_id": 250, "is_new_question": false }, @@ -59010,8 +59401,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 195503, - "total_submitted": 303410, + "total_acs": 196455, + "total_submitted": 304785, "frontend_question_id": 249, "is_new_question": false }, @@ -59033,8 +59424,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 35694, - "total_submitted": 84977, + "total_acs": 35724, + "total_submitted": 85026, "frontend_question_id": 248, "is_new_question": false }, @@ -59056,8 +59447,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 130463, - "total_submitted": 252531, + "total_acs": 130716, + "total_submitted": 252928, "frontend_question_id": 247, "is_new_question": false }, @@ -59079,8 +59470,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 161676, - "total_submitted": 339038, + "total_acs": 161925, + "total_submitted": 339572, "frontend_question_id": 246, "is_new_question": false }, @@ -59102,8 +59493,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 79472, - "total_submitted": 136580, + "total_acs": 79544, + "total_submitted": 136687, "frontend_question_id": 245, "is_new_question": false }, @@ -59125,8 +59516,8 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 148216, - "total_submitted": 243243, + "total_acs": 148333, + "total_submitted": 243419, "frontend_question_id": 244, "is_new_question": false }, @@ -59148,8 +59539,8 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 203741, - "total_submitted": 313118, + "total_acs": 204027, + "total_submitted": 313532, "frontend_question_id": 243, "is_new_question": false }, @@ -59171,8 +59562,8 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 2454257, - "total_submitted": 3885132, + "total_acs": 2489648, + "total_submitted": 3939692, "frontend_question_id": 242, "is_new_question": false }, @@ -59194,8 +59585,8 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 200373, - "total_submitted": 310977, + "total_acs": 201181, + "total_submitted": 312012, "frontend_question_id": 241, "is_new_question": false }, @@ -59217,8 +59608,8 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 820903, - "total_submitted": 1595510, + "total_acs": 825514, + "total_submitted": 1602874, "frontend_question_id": 240, "is_new_question": false }, @@ -59240,8 +59631,8 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 804820, - "total_submitted": 1745528, + "total_acs": 871444, + "total_submitted": 1868305, "frontend_question_id": 239, "is_new_question": false }, @@ -59263,8 +59654,8 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 1807534, - "total_submitted": 2778310, + "total_acs": 1830245, + "total_submitted": 2813580, "frontend_question_id": 238, "is_new_question": false }, @@ -59286,8 +59677,8 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 1119087, - "total_submitted": 1455172, + "total_acs": 1125258, + "total_submitted": 1461764, "frontend_question_id": 237, "is_new_question": false }, @@ -59309,8 +59700,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": 1359476, - "total_submitted": 2272774, + "total_acs": 1367998, + "total_submitted": 2283328, "frontend_question_id": 236, "is_new_question": false }, @@ -59332,8 +59723,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": 1250292, - "total_submitted": 1996004, + "total_acs": 1258829, + "total_submitted": 2007092, "frontend_question_id": 235, "is_new_question": false }, @@ -59355,8 +59746,8 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 1542225, - "total_submitted": 3039541, + "total_acs": 1552333, + "total_submitted": 3056121, "frontend_question_id": 234, "is_new_question": false }, @@ -59378,8 +59769,8 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 80611, - "total_submitted": 236499, + "total_acs": 81029, + "total_submitted": 237720, "frontend_question_id": 233, "is_new_question": false }, @@ -59401,8 +59792,8 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 704777, - "total_submitted": 1104951, + "total_acs": 709737, + "total_submitted": 1112112, "frontend_question_id": 232, "is_new_question": false }, @@ -59424,8 +59815,8 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 957282, - "total_submitted": 2072081, + "total_acs": 965207, + "total_submitted": 2087963, "frontend_question_id": 231, "is_new_question": false }, @@ -59447,8 +59838,8 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 1161199, - "total_submitted": 1636337, + "total_acs": 1170895, + "total_submitted": 1648413, "frontend_question_id": 230, "is_new_question": false }, @@ -59470,8 +59861,8 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 446633, - "total_submitted": 961260, + "total_acs": 451609, + "total_submitted": 969543, "frontend_question_id": 229, "is_new_question": false }, @@ -59493,8 +59884,8 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 439129, - "total_submitted": 889825, + "total_acs": 442743, + "total_submitted": 895931, "frontend_question_id": 228, "is_new_question": false }, @@ -59516,8 +59907,8 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 530622, - "total_submitted": 1245625, + "total_acs": 532655, + "total_submitted": 1249833, "frontend_question_id": 227, "is_new_question": false }, @@ -59539,8 +59930,8 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 1665256, - "total_submitted": 2207281, + "total_acs": 1678829, + "total_submitted": 2223308, "frontend_question_id": 226, "is_new_question": false }, @@ -59562,8 +59953,8 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 489211, - "total_submitted": 816816, + "total_acs": 493430, + "total_submitted": 822597, "frontend_question_id": 225, "is_new_question": false }, @@ -59585,8 +59976,8 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 393928, - "total_submitted": 925399, + "total_acs": 395975, + "total_submitted": 929606, "frontend_question_id": 224, "is_new_question": false }, @@ -59608,8 +59999,8 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 204426, - "total_submitted": 450995, + "total_acs": 204839, + "total_submitted": 451703, "frontend_question_id": 223, "is_new_question": false }, @@ -59631,8 +60022,8 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 578587, - "total_submitted": 936246, + "total_acs": 584220, + "total_submitted": 942745, "frontend_question_id": 222, "is_new_question": false }, @@ -59654,8 +60045,8 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 605638, - "total_submitted": 1331737, + "total_acs": 608751, + "total_submitted": 1336979, "frontend_question_id": 221, "is_new_question": false }, @@ -59677,8 +60068,8 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 234433, - "total_submitted": 1050212, + "total_acs": 235048, + "total_submitted": 1052215, "frontend_question_id": 220, "is_new_question": false }, @@ -59700,8 +60091,8 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 723126, - "total_submitted": 1676902, + "total_acs": 729665, + "total_submitted": 1689762, "frontend_question_id": 219, "is_new_question": false }, @@ -59723,8 +60114,8 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 270314, - "total_submitted": 641822, + "total_acs": 270952, + "total_submitted": 643015, "frontend_question_id": 218, "is_new_question": false }, @@ -59746,8 +60137,8 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 3048372, - "total_submitted": 4987073, + "total_acs": 3082614, + "total_submitted": 5045930, "frontend_question_id": 217, "is_new_question": false }, @@ -59769,8 +60160,8 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 424929, - "total_submitted": 622420, + "total_acs": 428186, + "total_submitted": 626649, "frontend_question_id": 216, "is_new_question": false }, @@ -59792,8 +60183,8 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 1837559, - "total_submitted": 2752182, + "total_acs": 1926662, + "total_submitted": 2864968, "frontend_question_id": 215, "is_new_question": false }, @@ -59815,8 +60206,8 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 161216, - "total_submitted": 495343, + "total_acs": 161821, + "total_submitted": 496848, "frontend_question_id": 214, "is_new_question": false }, @@ -59838,8 +60229,8 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 617834, - "total_submitted": 1493994, + "total_acs": 622632, + "total_submitted": 1504570, "frontend_question_id": 213, "is_new_question": false }, @@ -59861,8 +60252,8 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 574311, - "total_submitted": 1589915, + "total_acs": 577075, + "total_submitted": 1597505, "frontend_question_id": 212, "is_new_question": false }, @@ -59884,8 +60275,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": 546747, - "total_submitted": 1235822, + "total_acs": 549607, + "total_submitted": 1241587, "frontend_question_id": 211, "is_new_question": false }, @@ -59907,8 +60298,8 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 862121, - "total_submitted": 1756996, + "total_acs": 868077, + "total_submitted": 1767287, "frontend_question_id": 210, "is_new_question": false }, @@ -59930,8 +60321,8 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 819289, - "total_submitted": 1767284, + "total_acs": 825807, + "total_submitted": 1780858, "frontend_question_id": 209, "is_new_question": false }, @@ -59953,8 +60344,8 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 862247, - "total_submitted": 1358175, + "total_acs": 868026, + "total_submitted": 1366070, "frontend_question_id": 208, "is_new_question": false }, @@ -59976,8 +60367,8 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 1291401, - "total_submitted": 2799064, + "total_acs": 1300808, + "total_submitted": 2818805, "frontend_question_id": 207, "is_new_question": false }, @@ -59999,8 +60390,8 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 3292559, - "total_submitted": 4423836, + "total_acs": 3318401, + "total_submitted": 4454189, "frontend_question_id": 206, "is_new_question": false }, @@ -60022,8 +60413,8 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 956748, - "total_submitted": 2210179, + "total_acs": 964897, + "total_submitted": 2227210, "frontend_question_id": 205, "is_new_question": false }, @@ -60045,8 +60436,8 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 761510, - "total_submitted": 2290749, + "total_acs": 765152, + "total_submitted": 2300482, "frontend_question_id": 204, "is_new_question": false }, @@ -60068,8 +60459,8 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 974985, - "total_submitted": 2079988, + "total_acs": 980323, + "total_submitted": 2088196, "frontend_question_id": 203, "is_new_question": false }, @@ -60091,8 +60482,8 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 1212456, - "total_submitted": 2198007, + "total_acs": 1220263, + "total_submitted": 2210729, "frontend_question_id": 202, "is_new_question": false }, @@ -60114,8 +60505,8 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 250029, - "total_submitted": 587120, + "total_acs": 251110, + "total_submitted": 589477, "frontend_question_id": 201, "is_new_question": false }, @@ -60137,8 +60528,8 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 2248154, - "total_submitted": 3904524, + "total_acs": 2260564, + "total_submitted": 3922893, "frontend_question_id": 200, "is_new_question": false }, @@ -60160,8 +60551,8 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 1019036, - "total_submitted": 1641153, + "total_acs": 1028615, + "total_submitted": 1655692, "frontend_question_id": 199, "is_new_question": false }, @@ -60183,8 +60574,8 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 1721170, - "total_submitted": 3460195, + "total_acs": 1734687, + "total_submitted": 3485264, "frontend_question_id": 198, "is_new_question": false }, @@ -60206,8 +60597,8 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 386260, - "total_submitted": 853019, + "total_acs": 393632, + "total_submitted": 867240, "frontend_question_id": 197, "is_new_question": false }, @@ -60229,8 +60620,8 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 414723, - "total_submitted": 680283, + "total_acs": 419618, + "total_submitted": 687886, "frontend_question_id": 196, "is_new_question": false }, @@ -60252,8 +60643,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 91696, - "total_submitted": 278871, + "total_acs": 92128, + "total_submitted": 280189, "frontend_question_id": 195, "is_new_question": false }, @@ -60275,8 +60666,8 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 22352, - "total_submitted": 87980, + "total_acs": 22446, + "total_submitted": 88297, "frontend_question_id": 194, "is_new_question": false }, @@ -60298,8 +60689,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 71170, - "total_submitted": 275569, + "total_acs": 71580, + "total_submitted": 277197, "frontend_question_id": 193, "is_new_question": false }, @@ -60321,8 +60712,8 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 44777, - "total_submitted": 175876, + "total_acs": 44956, + "total_submitted": 176627, "frontend_question_id": 192, "is_new_question": false }, @@ -60344,8 +60735,8 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 1171018, - "total_submitted": 1728168, + "total_acs": 1179061, + "total_submitted": 1737493, "frontend_question_id": 191, "is_new_question": false }, @@ -60367,8 +60758,8 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 664367, - "total_submitted": 1199067, + "total_acs": 668583, + "total_submitted": 1204063, "frontend_question_id": 190, "is_new_question": false }, @@ -60390,8 +60781,8 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 1629029, - "total_submitted": 4105202, + "total_acs": 1646453, + "total_submitted": 4145956, "frontend_question_id": 189, "is_new_question": false }, @@ -60413,8 +60804,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": 384533, - "total_submitted": 952417, + "total_acs": 387683, + "total_submitted": 957072, "frontend_question_id": 188, "is_new_question": false }, @@ -60436,8 +60827,8 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 336084, - "total_submitted": 707348, + "total_acs": 337406, + "total_submitted": 709368, "frontend_question_id": 187, "is_new_question": false }, @@ -60459,8 +60850,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 150735, - "total_submitted": 282480, + "total_acs": 150986, + "total_submitted": 282796, "frontend_question_id": 186, "is_new_question": false }, @@ -60482,8 +60873,8 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 237341, - "total_submitted": 466854, + "total_acs": 239525, + "total_submitted": 470386, "frontend_question_id": 185, "is_new_question": false }, @@ -60505,8 +60896,8 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 318475, - "total_submitted": 632751, + "total_acs": 322011, + "total_submitted": 638619, "frontend_question_id": 184, "is_new_question": false }, @@ -60528,8 +60919,8 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 678680, - "total_submitted": 988008, + "total_acs": 686566, + "total_submitted": 999439, "frontend_question_id": 183, "is_new_question": false }, @@ -60551,8 +60942,8 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 543990, - "total_submitted": 767213, + "total_acs": 548051, + "total_submitted": 772696, "frontend_question_id": 182, "is_new_question": false }, @@ -60574,8 +60965,8 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 526127, - "total_submitted": 761389, + "total_acs": 530078, + "total_submitted": 766807, "frontend_question_id": 181, "is_new_question": false }, @@ -60597,8 +60988,8 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 273678, - "total_submitted": 587936, + "total_acs": 276477, + "total_submitted": 593391, "frontend_question_id": 180, "is_new_question": false }, @@ -60620,8 +61011,8 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 411530, - "total_submitted": 1175544, + "total_acs": 413720, + "total_submitted": 1180230, "frontend_question_id": 179, "is_new_question": false }, @@ -60643,8 +61034,8 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 319246, - "total_submitted": 524737, + "total_acs": 322893, + "total_submitted": 529691, "frontend_question_id": 178, "is_new_question": false }, @@ -60666,8 +61057,8 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 326897, - "total_submitted": 860589, + "total_acs": 331176, + "total_submitted": 870938, "frontend_question_id": 177, "is_new_question": false }, @@ -60689,8 +61080,8 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 695041, - "total_submitted": 1805683, + "total_acs": 701923, + "total_submitted": 1818699, "frontend_question_id": 176, "is_new_question": false }, @@ -60712,8 +61103,8 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 830512, - "total_submitted": 1111766, + "total_acs": 836952, + "total_submitted": 1119747, "frontend_question_id": 175, "is_new_question": false }, @@ -60735,8 +61126,8 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 204909, - "total_submitted": 544229, + "total_acs": 205888, + "total_submitted": 546539, "frontend_question_id": 174, "is_new_question": false }, @@ -60758,8 +61149,8 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 695181, - "total_submitted": 986932, + "total_acs": 698021, + "total_submitted": 990156, "frontend_question_id": 173, "is_new_question": false }, @@ -60781,8 +61172,8 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 385738, - "total_submitted": 906265, + "total_acs": 387937, + "total_submitted": 910770, "frontend_question_id": 172, "is_new_question": false }, @@ -60804,8 +61195,8 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 618200, - "total_submitted": 987923, + "total_acs": 620462, + "total_submitted": 990816, "frontend_question_id": 171, "is_new_question": false }, @@ -60827,8 +61218,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 144960, - "total_submitted": 384809, + "total_acs": 145219, + "total_submitted": 385405, "frontend_question_id": 170, "is_new_question": false }, @@ -60850,8 +61241,8 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 1933736, - "total_submitted": 3028008, + "total_acs": 1959139, + "total_submitted": 3068266, "frontend_question_id": 169, "is_new_question": false }, @@ -60873,8 +61264,8 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 392900, - "total_submitted": 1084048, + "total_acs": 394838, + "total_submitted": 1087542, "frontend_question_id": 168, "is_new_question": false }, @@ -60896,8 +61287,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": 1572440, - "total_submitted": 2612498, + "total_acs": 1587082, + "total_submitted": 2635838, "frontend_question_id": 167, "is_new_question": false }, @@ -60919,8 +61310,8 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 210836, - "total_submitted": 861499, + "total_acs": 211297, + "total_submitted": 862798, "frontend_question_id": 166, "is_new_question": false }, @@ -60942,8 +61333,8 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 357652, - "total_submitted": 991249, + "total_acs": 358603, + "total_submitted": 992922, "frontend_question_id": 165, "is_new_question": false }, @@ -60965,8 +61356,8 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 175173, - "total_submitted": 398438, + "total_acs": 176074, + "total_submitted": 399973, "frontend_question_id": 164, "is_new_question": false }, @@ -60988,8 +61379,8 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 208831, - "total_submitted": 640736, + "total_acs": 209375, + "total_submitted": 642054, "frontend_question_id": 163, "is_new_question": false }, @@ -61011,8 +61402,8 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 1083382, - "total_submitted": 2364332, + "total_acs": 1092784, + "total_submitted": 2385550, "frontend_question_id": 162, "is_new_question": false }, @@ -61034,8 +61425,8 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 192580, - "total_submitted": 563601, + "total_acs": 192983, + "total_submitted": 564620, "frontend_question_id": 161, "is_new_question": false }, @@ -61057,8 +61448,8 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 1341960, - "total_submitted": 2421945, + "total_acs": 1349817, + "total_submitted": 2432505, "frontend_question_id": 160, "is_new_question": false }, @@ -61080,8 +61471,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": 231943, - "total_submitted": 428924, + "total_acs": 232459, + "total_submitted": 429791, "frontend_question_id": 159, "is_new_question": false }, @@ -61103,8 +61494,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": 177072, - "total_submitted": 423802, + "total_acs": 177230, + "total_submitted": 424034, "frontend_question_id": 158, "is_new_question": false }, @@ -61126,8 +61517,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 182363, - "total_submitted": 443834, + "total_acs": 182559, + "total_submitted": 444199, "frontend_question_id": 157, "is_new_question": false }, @@ -61149,8 +61540,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 97778, - "total_submitted": 157321, + "total_acs": 97856, + "total_submitted": 157408, "frontend_question_id": 156, "is_new_question": false }, @@ -61172,8 +61563,8 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 1351529, - "total_submitted": 2559050, + "total_acs": 1362479, + "total_submitted": 2577839, "frontend_question_id": 155, "is_new_question": false }, @@ -61195,8 +61586,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": 400328, - "total_submitted": 920386, + "total_acs": 402233, + "total_submitted": 924956, "frontend_question_id": 154, "is_new_question": false }, @@ -61218,8 +61609,8 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 1402448, - "total_submitted": 2846897, + "total_acs": 1416260, + "total_submitted": 2872170, "frontend_question_id": 153, "is_new_question": false }, @@ -61241,8 +61632,8 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 1062882, - "total_submitted": 3048169, + "total_acs": 1070667, + "total_submitted": 3070081, "frontend_question_id": 152, "is_new_question": false }, @@ -61264,8 +61655,8 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 1045044, - "total_submitted": 2944633, + "total_acs": 1061732, + "total_submitted": 2966243, "frontend_question_id": 151, "is_new_question": false }, @@ -61287,8 +61678,8 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 721071, - "total_submitted": 1532945, + "total_acs": 728808, + "total_submitted": 1546032, "frontend_question_id": 150, "is_new_question": false }, @@ -61310,8 +61701,8 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 349735, - "total_submitted": 1366529, + "total_acs": 351126, + "total_submitted": 1369897, "frontend_question_id": 149, "is_new_question": false }, @@ -61333,8 +61724,8 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 663988, - "total_submitted": 1185482, + "total_acs": 668413, + "total_submitted": 1191729, "frontend_question_id": 148, "is_new_question": false }, @@ -61356,8 +61747,8 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 332840, - "total_submitted": 643103, + "total_acs": 333928, + "total_submitted": 644522, "frontend_question_id": 147, "is_new_question": false }, @@ -61379,8 +61770,8 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 1402400, - "total_submitted": 3378224, + "total_acs": 1409419, + "total_submitted": 3392703, "frontend_question_id": 146, "is_new_question": false }, @@ -61402,8 +61793,8 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 1014374, - "total_submitted": 1469043, + "total_acs": 1020880, + "total_submitted": 1476586, "frontend_question_id": 145, "is_new_question": false }, @@ -61425,8 +61816,8 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 1389849, - "total_submitted": 2049598, + "total_acs": 1397833, + "total_submitted": 2059224, "frontend_question_id": 144, "is_new_question": false }, @@ -61448,8 +61839,8 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 716838, - "total_submitted": 1330441, + "total_acs": 722753, + "total_submitted": 1338447, "frontend_question_id": 143, "is_new_question": false }, @@ -61471,8 +61862,8 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 1119473, - "total_submitted": 2253769, + "total_acs": 1126183, + "total_submitted": 2263972, "frontend_question_id": 142, "is_new_question": false }, @@ -61494,8 +61885,8 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 2207411, - "total_submitted": 4593830, + "total_acs": 2227016, + "total_submitted": 4629255, "frontend_question_id": 141, "is_new_question": false }, @@ -61517,8 +61908,8 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 527081, - "total_submitted": 1145861, + "total_acs": 528695, + "total_submitted": 1147743, "frontend_question_id": 140, "is_new_question": false }, @@ -61540,8 +61931,8 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 1450459, - "total_submitted": 3142358, + "total_acs": 1459170, + "total_submitted": 3161154, "frontend_question_id": 139, "is_new_question": false }, @@ -61563,8 +61954,8 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 997240, - "total_submitted": 1901714, + "total_acs": 1003627, + "total_submitted": 1909957, "frontend_question_id": 138, "is_new_question": false }, @@ -61586,8 +61977,8 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 501667, - "total_submitted": 818392, + "total_acs": 504151, + "total_submitted": 821905, "frontend_question_id": 137, "is_new_question": false }, @@ -61609,8 +62000,8 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 2300420, - "total_submitted": 3226404, + "total_acs": 2316565, + "total_submitted": 3246673, "frontend_question_id": 136, "is_new_question": false }, @@ -61632,8 +62023,8 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 334811, - "total_submitted": 812707, + "total_acs": 338580, + "total_submitted": 821727, "frontend_question_id": 135, "is_new_question": false }, @@ -61655,8 +62046,8 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 631867, - "total_submitted": 1374615, + "total_acs": 637415, + "total_submitted": 1387456, "frontend_question_id": 134, "is_new_question": false }, @@ -61678,8 +62069,8 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 1032879, - "total_submitted": 1904619, + "total_acs": 1039332, + "total_submitted": 1912607, "frontend_question_id": 133, "is_new_question": false }, @@ -61701,8 +62092,8 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 252244, - "total_submitted": 750528, + "total_acs": 253394, + "total_submitted": 754416, "frontend_question_id": 132, "is_new_question": false }, @@ -61724,8 +62115,8 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 682658, - "total_submitted": 1036690, + "total_acs": 687486, + "total_submitted": 1042691, "frontend_question_id": 131, "is_new_question": false }, @@ -61747,8 +62138,8 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 571801, - "total_submitted": 1519337, + "total_acs": 576641, + "total_submitted": 1528967, "frontend_question_id": 130, "is_new_question": false }, @@ -61770,8 +62161,8 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 634510, - "total_submitted": 1029269, + "total_acs": 638309, + "total_submitted": 1034146, "frontend_question_id": 129, "is_new_question": false }, @@ -61793,8 +62184,8 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 1259800, - "total_submitted": 2641682, + "total_acs": 1278126, + "total_submitted": 2683051, "frontend_question_id": 128, "is_new_question": false }, @@ -61816,8 +62207,8 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 942479, - "total_submitted": 2498412, + "total_acs": 947285, + "total_submitted": 2506879, "frontend_question_id": 127, "is_new_question": false }, @@ -61839,8 +62230,8 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 347190, - "total_submitted": 1266823, + "total_acs": 347729, + "total_submitted": 1269609, "frontend_question_id": 126, "is_new_question": false }, @@ -61862,8 +62253,8 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 2161364, - "total_submitted": 4777594, + "total_acs": 2189965, + "total_submitted": 4831372, "frontend_question_id": 125, "is_new_question": false }, @@ -61885,8 +62276,8 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 1029309, - "total_submitted": 2611574, + "total_acs": 1036283, + "total_submitted": 2628373, "frontend_question_id": 124, "is_new_question": false }, @@ -61908,8 +62299,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": 512776, - "total_submitted": 1103377, + "total_acs": 516959, + "total_submitted": 1110148, "frontend_question_id": 123, "is_new_question": false }, @@ -61931,8 +62322,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": 1540339, - "total_submitted": 2381342, + "total_acs": 1553166, + "total_submitted": 2398385, "frontend_question_id": 122, "is_new_question": false }, @@ -61954,8 +62345,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": 3621534, - "total_submitted": 6736537, + "total_acs": 3657473, + "total_submitted": 6810973, "frontend_question_id": 121, "is_new_question": false }, @@ -61977,8 +62368,8 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 633433, - "total_submitted": 1145124, + "total_acs": 638246, + "total_submitted": 1152143, "frontend_question_id": 120, "is_new_question": false }, @@ -62000,8 +62391,8 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 708064, - "total_submitted": 1153109, + "total_acs": 711613, + "total_submitted": 1157952, "frontend_question_id": 119, "is_new_question": false }, @@ -62023,8 +62414,8 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 1315888, - "total_submitted": 1831673, + "total_acs": 1326162, + "total_submitted": 1843605, "frontend_question_id": 118, "is_new_question": false }, @@ -62046,8 +62437,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": 563084, - "total_submitted": 1107016, + "total_acs": 565253, + "total_submitted": 1109938, "frontend_question_id": 117, "is_new_question": false }, @@ -62069,8 +62460,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": 950555, - "total_submitted": 1553854, + "total_acs": 953760, + "total_submitted": 1557519, "frontend_question_id": 116, "is_new_question": false }, @@ -62092,8 +62483,8 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 324450, - "total_submitted": 713374, + "total_acs": 327863, + "total_submitted": 719300, "frontend_question_id": 115, "is_new_question": false }, @@ -62115,8 +62506,8 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 812076, - "total_submitted": 1292638, + "total_acs": 817291, + "total_submitted": 1298871, "frontend_question_id": 114, "is_new_question": false }, @@ -62138,8 +62529,8 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 767560, - "total_submitted": 1335335, + "total_acs": 770454, + "total_submitted": 1339488, "frontend_question_id": 113, "is_new_question": false }, @@ -62161,8 +62552,8 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 1228460, - "total_submitted": 2515772, + "total_acs": 1235591, + "total_submitted": 2527644, "frontend_question_id": 112, "is_new_question": false }, @@ -62184,8 +62575,8 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 1044119, - "total_submitted": 2255421, + "total_acs": 1048526, + "total_submitted": 2262645, "frontend_question_id": 111, "is_new_question": false }, @@ -62207,8 +62598,8 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 1196221, - "total_submitted": 2390503, + "total_acs": 1206505, + "total_submitted": 2407009, "frontend_question_id": 110, "is_new_question": false }, @@ -62230,8 +62621,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": 486312, - "total_submitted": 800906, + "total_acs": 487714, + "total_submitted": 802757, "frontend_question_id": 109, "is_new_question": false }, @@ -62253,8 +62644,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": 1040045, - "total_submitted": 1476121, + "total_acs": 1045622, + "total_submitted": 1482977, "frontend_question_id": 108, "is_new_question": false }, @@ -62276,8 +62667,8 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 592747, - "total_submitted": 958287, + "total_acs": 594498, + "total_submitted": 960224, "frontend_question_id": 107, "is_new_question": false }, @@ -62299,8 +62690,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": 552512, - "total_submitted": 907296, + "total_acs": 555753, + "total_submitted": 911285, "frontend_question_id": 106, "is_new_question": false }, @@ -62322,8 +62713,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": 1024100, - "total_submitted": 1645470, + "total_acs": 1031433, + "total_submitted": 1655545, "frontend_question_id": 105, "is_new_question": false }, @@ -62345,8 +62736,8 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 2495631, - "total_submitted": 3356990, + "total_acs": 2515797, + "total_submitted": 3382202, "frontend_question_id": 104, "is_new_question": false }, @@ -62368,8 +62759,8 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 1004862, - "total_submitted": 1744680, + "total_acs": 1010682, + "total_submitted": 1752758, "frontend_question_id": 103, "is_new_question": false }, @@ -62391,8 +62782,8 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 1883077, - "total_submitted": 2882736, + "total_acs": 1895259, + "total_submitted": 2897994, "frontend_question_id": 102, "is_new_question": false }, @@ -62414,8 +62805,8 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 1718751, - "total_submitted": 3125360, + "total_acs": 1728345, + "total_submitted": 3139352, "frontend_question_id": 101, "is_new_question": false }, @@ -62437,8 +62828,8 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 1643916, - "total_submitted": 2778672, + "total_acs": 1658126, + "total_submitted": 2798212, "frontend_question_id": 100, "is_new_question": false }, @@ -62460,8 +62851,8 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 408114, - "total_submitted": 788901, + "total_acs": 409772, + "total_submitted": 791172, "frontend_question_id": 99, "is_new_question": false }, @@ -62483,8 +62874,8 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 2012468, - "total_submitted": 6249482, + "total_acs": 2024136, + "total_submitted": 6282228, "frontend_question_id": 98, "is_new_question": false }, @@ -62506,8 +62897,8 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 395445, - "total_submitted": 1049468, + "total_acs": 398186, + "total_submitted": 1055430, "frontend_question_id": 97, "is_new_question": false }, @@ -62529,8 +62920,8 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 598113, - "total_submitted": 993453, + "total_acs": 600758, + "total_submitted": 997190, "frontend_question_id": 96, "is_new_question": false }, @@ -62552,8 +62943,8 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 410850, - "total_submitted": 734284, + "total_acs": 412605, + "total_submitted": 736322, "frontend_question_id": 95, "is_new_question": false }, @@ -62575,8 +62966,8 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 2109640, - "total_submitted": 2831891, + "total_acs": 2122065, + "total_submitted": 2846565, "frontend_question_id": 94, "is_new_question": false }, @@ -62598,8 +62989,8 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 413286, - "total_submitted": 858498, + "total_acs": 414637, + "total_submitted": 860252, "frontend_question_id": 93, "is_new_question": false }, @@ -62621,8 +63012,8 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 666239, - "total_submitted": 1460088, + "total_acs": 670973, + "total_submitted": 1469512, "frontend_question_id": 92, "is_new_question": false }, @@ -62644,8 +63035,8 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 1049887, - "total_submitted": 3168522, + "total_acs": 1054955, + "total_submitted": 3179902, "frontend_question_id": 91, "is_new_question": false }, @@ -62667,8 +63058,8 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 755199, - "total_submitted": 1340271, + "total_acs": 761835, + "total_submitted": 1351145, "frontend_question_id": 90, "is_new_question": false }, @@ -62690,8 +63081,8 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 269277, - "total_submitted": 466400, + "total_acs": 270005, + "total_submitted": 467357, "frontend_question_id": 89, "is_new_question": false }, @@ -62713,8 +63104,8 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 2249723, - "total_submitted": 4726120, + "total_acs": 2279786, + "total_submitted": 4780656, "frontend_question_id": 88, "is_new_question": false }, @@ -62736,8 +63127,8 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 208798, - "total_submitted": 532322, + "total_acs": 209481, + "total_submitted": 533873, "frontend_question_id": 87, "is_new_question": false }, @@ -62759,8 +63150,8 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 471285, - "total_submitted": 893951, + "total_acs": 538598, + "total_submitted": 982162, "frontend_question_id": 86, "is_new_question": false }, @@ -62782,8 +63173,8 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 359067, - "total_submitted": 788604, + "total_acs": 360841, + "total_submitted": 791278, "frontend_question_id": 85, "is_new_question": false }, @@ -62805,8 +63196,8 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 717498, - "total_submitted": 1664019, + "total_acs": 723667, + "total_submitted": 1676244, "frontend_question_id": 84, "is_new_question": false }, @@ -62828,8 +63219,8 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 1254478, - "total_submitted": 2451546, + "total_acs": 1263670, + "total_submitted": 2466992, "frontend_question_id": 83, "is_new_question": false }, @@ -62851,8 +63242,8 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 628858, - "total_submitted": 1357880, + "total_acs": 632444, + "total_submitted": 1364262, "frontend_question_id": 82, "is_new_question": false }, @@ -62874,8 +63265,8 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 604142, - "total_submitted": 1627119, + "total_acs": 611112, + "total_submitted": 1643722, "frontend_question_id": 81, "is_new_question": false }, @@ -62897,8 +63288,8 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 597325, - "total_submitted": 1101847, + "total_acs": 608546, + "total_submitted": 1119035, "frontend_question_id": 80, "is_new_question": false }, @@ -62920,8 +63311,8 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 1331725, - "total_submitted": 3287817, + "total_acs": 1339396, + "total_submitted": 3303266, "frontend_question_id": 79, "is_new_question": false }, @@ -62943,8 +63334,8 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 1533323, - "total_submitted": 2022944, + "total_acs": 1544559, + "total_submitted": 2035707, "frontend_question_id": 78, "is_new_question": false }, @@ -62966,8 +63357,8 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 766972, - "total_submitted": 1112604, + "total_acs": 773675, + "total_submitted": 1121031, "frontend_question_id": 77, "is_new_question": false }, @@ -62989,8 +63380,8 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 1060082, - "total_submitted": 2579444, + "total_acs": 1067606, + "total_submitted": 2595946, "frontend_question_id": 76, "is_new_question": false }, @@ -63012,8 +63403,8 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 1543556, - "total_submitted": 2579116, + "total_acs": 1558230, + "total_submitted": 2598433, "frontend_question_id": 75, "is_new_question": false }, @@ -63035,8 +63426,8 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 1405283, - "total_submitted": 2867125, + "total_acs": 1421556, + "total_submitted": 2897247, "frontend_question_id": 74, "is_new_question": false }, @@ -63058,8 +63449,8 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 1092211, - "total_submitted": 2067374, + "total_acs": 1104385, + "total_submitted": 2085409, "frontend_question_id": 73, "is_new_question": false }, @@ -63081,8 +63472,8 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 698514, - "total_submitted": 1266527, + "total_acs": 704892, + "total_submitted": 1276634, "frontend_question_id": 72, "is_new_question": false }, @@ -63104,8 +63495,8 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 590720, - "total_submitted": 1448312, + "total_acs": 594618, + "total_submitted": 1456735, "frontend_question_id": 71, "is_new_question": false }, @@ -63127,8 +63518,8 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 2538828, - "total_submitted": 4861056, + "total_acs": 2560682, + "total_submitted": 4902689, "frontend_question_id": 70, "is_new_question": false }, @@ -63150,8 +63541,8 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 1571277, - "total_submitted": 4161747, + "total_acs": 1584458, + "total_submitted": 4192692, "frontend_question_id": 69, "is_new_question": false }, @@ -63173,8 +63564,8 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 305150, - "total_submitted": 798071, + "total_acs": 306928, + "total_submitted": 800811, "frontend_question_id": 68, "is_new_question": false }, @@ -63196,8 +63587,8 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 1211979, - "total_submitted": 2305656, + "total_acs": 1220202, + "total_submitted": 2320214, "frontend_question_id": 67, "is_new_question": false }, @@ -63219,8 +63610,8 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 1799491, - "total_submitted": 4086724, + "total_acs": 1814584, + "total_submitted": 4117755, "frontend_question_id": 66, "is_new_question": false }, @@ -63242,8 +63633,8 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 311718, - "total_submitted": 1654863, + "total_acs": 312642, + "total_submitted": 1658710, "frontend_question_id": 65, "is_new_question": false }, @@ -63265,8 +63656,8 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 995039, - "total_submitted": 1589008, + "total_acs": 1002260, + "total_submitted": 1599005, "frontend_question_id": 64, "is_new_question": false }, @@ -63288,8 +63679,8 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 725838, - "total_submitted": 1823589, + "total_acs": 788450, + "total_submitted": 1929887, "frontend_question_id": 63, "is_new_question": false }, @@ -63311,8 +63702,8 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 1472410, - "total_submitted": 2339552, + "total_acs": 1486144, + "total_submitted": 2359517, "frontend_question_id": 62, "is_new_question": false }, @@ -63334,8 +63725,8 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 774463, - "total_submitted": 2118961, + "total_acs": 781167, + "total_submitted": 2134361, "frontend_question_id": 61, "is_new_question": false }, @@ -63357,8 +63748,8 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 345592, - "total_submitted": 763921, + "total_acs": 347586, + "total_submitted": 767108, "frontend_question_id": 60, "is_new_question": false }, @@ -63380,8 +63771,8 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 510319, - "total_submitted": 729605, + "total_acs": 512280, + "total_submitted": 732004, "frontend_question_id": 59, "is_new_question": false }, @@ -63403,8 +63794,8 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 1266936, - "total_submitted": 2806894, + "total_acs": 1284754, + "total_submitted": 2833723, "frontend_question_id": 58, "is_new_question": false }, @@ -63426,8 +63817,8 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 811901, - "total_submitted": 2068025, + "total_acs": 818076, + "total_submitted": 2082446, "frontend_question_id": 57, "is_new_question": false }, @@ -63449,8 +63840,8 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 1982114, - "total_submitted": 4272050, + "total_acs": 1995095, + "total_submitted": 4297527, "frontend_question_id": 56, "is_new_question": false }, @@ -63472,8 +63863,8 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 1485352, - "total_submitted": 3838191, + "total_acs": 1498992, + "total_submitted": 3874722, "frontend_question_id": 55, "is_new_question": false }, @@ -63495,8 +63886,8 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 1155149, - "total_submitted": 2453140, + "total_acs": 1164710, + "total_submitted": 2468059, "frontend_question_id": 54, "is_new_question": false }, @@ -63518,8 +63909,8 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 3315827, - "total_submitted": 6595780, + "total_acs": 3335267, + "total_submitted": 6633200, "frontend_question_id": 53, "is_new_question": false }, @@ -63541,8 +63932,8 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 325151, - "total_submitted": 449725, + "total_acs": 327131, + "total_submitted": 452022, "frontend_question_id": 52, "is_new_question": false }, @@ -63564,8 +63955,8 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 584642, - "total_submitted": 890879, + "total_acs": 589956, + "total_submitted": 897344, "frontend_question_id": 51, "is_new_question": false }, @@ -63587,8 +63978,8 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 1350695, - "total_submitted": 3982037, + "total_acs": 1361861, + "total_submitted": 4013850, "frontend_question_id": 50, "is_new_question": false }, @@ -63610,8 +64001,8 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 2127815, - "total_submitted": 3183820, + "total_acs": 2148084, + "total_submitted": 3212693, "frontend_question_id": 49, "is_new_question": false }, @@ -63633,8 +64024,8 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 1378682, - "total_submitted": 1911161, + "total_acs": 1390955, + "total_submitted": 1925555, "frontend_question_id": 48, "is_new_question": false }, @@ -63656,8 +64047,8 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 816476, - "total_submitted": 1411122, + "total_acs": 820262, + "total_submitted": 1416666, "frontend_question_id": 47, "is_new_question": false }, @@ -63679,8 +64070,8 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 1740532, - "total_submitted": 2261805, + "total_acs": 1753381, + "total_submitted": 2276666, "frontend_question_id": 46, "is_new_question": false }, @@ -63702,8 +64093,8 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 957602, - "total_submitted": 2391468, + "total_acs": 967011, + "total_submitted": 2413448, "frontend_question_id": 45, "is_new_question": false }, @@ -63725,8 +64116,8 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 496303, - "total_submitted": 1827164, + "total_acs": 498936, + "total_submitted": 1835477, "frontend_question_id": 44, "is_new_question": false }, @@ -63748,8 +64139,8 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 687583, - "total_submitted": 1745503, + "total_acs": 690773, + "total_submitted": 1752667, "frontend_question_id": 43, "is_new_question": false }, @@ -63771,8 +64162,8 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 1624568, - "total_submitted": 2722474, + "total_acs": 1637597, + "total_submitted": 2741484, "frontend_question_id": 42, "is_new_question": false }, @@ -63794,8 +64185,8 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 920747, - "total_submitted": 2487175, + "total_acs": 925640, + "total_submitted": 2498793, "frontend_question_id": 41, "is_new_question": false }, @@ -63817,8 +64208,8 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 796542, - "total_submitted": 1485339, + "total_acs": 803159, + "total_submitted": 1496884, "frontend_question_id": 40, "is_new_question": false }, @@ -63840,8 +64231,8 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 1568787, - "total_submitted": 2255564, + "total_acs": 1581676, + "total_submitted": 2271387, "frontend_question_id": 39, "is_new_question": false }, @@ -63863,8 +64254,8 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 812908, - "total_submitted": 1536655, + "total_acs": 816429, + "total_submitted": 1540993, "frontend_question_id": 38, "is_new_question": false }, @@ -63886,8 +64277,8 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 488796, - "total_submitted": 830314, + "total_acs": 492080, + "total_submitted": 834429, "frontend_question_id": 37, "is_new_question": false }, @@ -63909,8 +64300,8 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 1185712, - "total_submitted": 2027239, + "total_acs": 1196748, + "total_submitted": 2044573, "frontend_question_id": 36, "is_new_question": false }, @@ -63932,8 +64323,8 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 2331421, - "total_submitted": 5286466, + "total_acs": 2349009, + "total_submitted": 5318364, "frontend_question_id": 35, "is_new_question": false }, @@ -63955,8 +64346,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": 1620666, - "total_submitted": 3825942, + "total_acs": 1631763, + "total_submitted": 3847764, "frontend_question_id": 34, "is_new_question": false }, @@ -63978,8 +64369,8 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 2240624, - "total_submitted": 5629271, + "total_acs": 2260661, + "total_submitted": 5673816, "frontend_question_id": 33, "is_new_question": false }, @@ -64001,8 +64392,8 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 641861, - "total_submitted": 1938841, + "total_acs": 644973, + "total_submitted": 1946493, "frontend_question_id": 32, "is_new_question": false }, @@ -64024,8 +64415,8 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 1108585, - "total_submitted": 2895709, + "total_acs": 1117131, + "total_submitted": 2913055, "frontend_question_id": 31, "is_new_question": false }, @@ -64047,8 +64438,8 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 363920, - "total_submitted": 1157914, + "total_acs": 366252, + "total_submitted": 1164908, "frontend_question_id": 30, "is_new_question": false }, @@ -64070,8 +64461,8 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 632518, - "total_submitted": 3697675, + "total_acs": 635641, + "total_submitted": 3715508, "frontend_question_id": 29, "is_new_question": false }, @@ -64093,8 +64484,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": 1886121, - "total_submitted": 4705911, + "total_acs": 1905607, + "total_submitted": 4744144, "frontend_question_id": 28, "is_new_question": false }, @@ -64116,8 +64507,8 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 2017155, - "total_submitted": 3727368, + "total_acs": 2045101, + "total_submitted": 3771499, "frontend_question_id": 27, "is_new_question": false }, @@ -64139,8 +64530,8 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 3252141, - "total_submitted": 6176292, + "total_acs": 3287112, + "total_submitted": 6230394, "frontend_question_id": 26, "is_new_question": false }, @@ -64162,8 +64553,8 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 746645, - "total_submitted": 1332128, + "total_acs": 753246, + "total_submitted": 1341002, "frontend_question_id": 25, "is_new_question": false }, @@ -64185,8 +64576,8 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 1194351, - "total_submitted": 1899627, + "total_acs": 1200027, + "total_submitted": 1906887, "frontend_question_id": 24, "is_new_question": false }, @@ -64208,8 +64599,8 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 1701740, - "total_submitted": 3364299, + "total_acs": 1710836, + "total_submitted": 3377352, "frontend_question_id": 23, "is_new_question": false }, @@ -64227,12 +64618,12 @@ "question_id": 22, "question__article__live": true, "question__article__slug": "generate-parentheses", - "question__article__has_video_solution": false, + "question__article__has_video_solution": true, "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 1491257, - "total_submitted": 2038545, + "total_acs": 1502733, + "total_submitted": 2052514, "frontend_question_id": 22, "is_new_question": false }, @@ -64254,8 +64645,8 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 3424956, - "total_submitted": 5436156, + "total_acs": 3450065, + "total_submitted": 5472614, "frontend_question_id": 21, "is_new_question": false }, @@ -64277,8 +64668,8 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 3616816, - "total_submitted": 8993031, + "total_acs": 3652177, + "total_submitted": 9082363, "frontend_question_id": 20, "is_new_question": false }, @@ -64300,8 +64691,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": 2148536, - "total_submitted": 5100074, + "total_acs": 2164774, + "total_submitted": 5127503, "frontend_question_id": 19, "is_new_question": false }, @@ -64323,8 +64714,8 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 787775, - "total_submitted": 2202778, + "total_acs": 793776, + "total_submitted": 2219530, "frontend_question_id": 18, "is_new_question": false }, @@ -64346,8 +64737,8 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 1695490, - "total_submitted": 2912365, + "total_acs": 1706737, + "total_submitted": 2927407, "frontend_question_id": 17, "is_new_question": false }, @@ -64369,8 +64760,8 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 1066630, - "total_submitted": 2342373, + "total_acs": 1071246, + "total_submitted": 2352968, "frontend_question_id": 16, "is_new_question": false }, @@ -64392,8 +64783,8 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 2835543, - "total_submitted": 8586575, + "total_acs": 2859233, + "total_submitted": 8644186, "frontend_question_id": 15, "is_new_question": false }, @@ -64415,8 +64806,8 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 2584980, - "total_submitted": 6260458, + "total_acs": 2610876, + "total_submitted": 6314373, "frontend_question_id": 14, "is_new_question": false }, @@ -64438,8 +64829,8 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 2885713, - "total_submitted": 4887949, + "total_acs": 2909945, + "total_submitted": 4922731, "frontend_question_id": 13, "is_new_question": false }, @@ -64461,8 +64852,8 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 1046308, - "total_submitted": 1668103, + "total_acs": 1054041, + "total_submitted": 1678415, "frontend_question_id": 12, "is_new_question": false }, @@ -64484,8 +64875,8 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 2268710, - "total_submitted": 4197227, + "total_acs": 2290340, + "total_submitted": 4236110, "frontend_question_id": 11, "is_new_question": false }, @@ -64507,8 +64898,8 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 840854, - "total_submitted": 3011970, + "total_acs": 844269, + "total_submitted": 3025307, "frontend_question_id": 10, "is_new_question": false }, @@ -64530,8 +64921,8 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 3474507, - "total_submitted": 6415831, + "total_acs": 3511478, + "total_submitted": 6477874, "frontend_question_id": 9, "is_new_question": false }, @@ -64553,8 +64944,8 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 1303863, - "total_submitted": 7807357, + "total_acs": 1310809, + "total_submitted": 7843006, "frontend_question_id": 8, "is_new_question": false }, @@ -64576,8 +64967,8 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 2719016, - "total_submitted": 9809123, + "total_acs": 2736275, + "total_submitted": 9861207, "frontend_question_id": 7, "is_new_question": false }, @@ -64599,8 +64990,8 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 1078558, - "total_submitted": 2367416, + "total_acs": 1085900, + "total_submitted": 2379524, "frontend_question_id": 6, "is_new_question": false }, @@ -64622,8 +65013,8 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 2528192, - "total_submitted": 7755807, + "total_acs": 2544861, + "total_submitted": 7798213, "frontend_question_id": 5, "is_new_question": false }, @@ -64645,8 +65036,8 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 2025135, - "total_submitted": 5463299, + "total_acs": 2040737, + "total_submitted": 5493318, "frontend_question_id": 4, "is_new_question": false }, @@ -64668,8 +65059,8 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 4764278, - "total_submitted": 14050205, + "total_acs": 4800424, + "total_submitted": 14146410, "frontend_question_id": 3, "is_new_question": false }, @@ -64691,8 +65082,8 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 3806528, - "total_submitted": 9294645, + "total_acs": 3830577, + "total_submitted": 9339568, "frontend_question_id": 2, "is_new_question": false }, @@ -64714,8 +65105,8 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 10415518, - "total_submitted": 20668472, + "total_acs": 10510924, + "total_submitted": 20830712, "frontend_question_id": 1, "is_new_question": false }, diff --git a/leetcode/originData/[no content]deep-object-filter.json b/leetcode/originData/[no content]deep-object-filter.json new file mode 100644 index 00000000..d232cc59 --- /dev/null +++ b/leetcode/originData/[no content]deep-object-filter.json @@ -0,0 +1,43 @@ +{ + "data": { + "question": { + "questionId": "2912", + "questionFrontendId": "2823", + "boundTopicId": null, + "title": "Deep Object Filter", + "titleSlug": "deep-object-filter", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 5, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[-5,-4,-3,-2,-1,0,1]\n(x) => x > 0\n{\"a\":1,\"b\":\"2\",\"c\":3,\"d\":\"4\",\"e\":5,\"f\":6,\"g\":{\"a\":1}}\n(x) => typeof x === \"string\"\n[-1,[-1,-1,5,-1,10],-1,[-1],[-5]]\n(x) => x > 0\n[[[[5]]]]\n(x) => Array.isArray(x)", + "categoryTitle": "JavaScript", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"40\", \"totalSubmission\": \"67\", \"totalAcceptedRaw\": 40, \"totalSubmissionRaw\": 67, \"acRate\": \"59.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[-5,-4,-3,-2,-1,0,1]\n(x) => x > 0", + "metaData": "{\n \"name\": \"deepFilter\",\n \"params\": [\n {\n \"name\": \"obj\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"fn\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"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.

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

TypeScript 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]delay-the-resolution-of-each-promise.json b/leetcode/originData/[no content]delay-the-resolution-of-each-promise.json new file mode 100644 index 00000000..5cd24561 --- /dev/null +++ b/leetcode/originData/[no content]delay-the-resolution-of-each-promise.json @@ -0,0 +1,43 @@ +{ + "data": { + "question": { + "questionId": "2909", + "questionFrontendId": "2821", + "boundTopicId": null, + "title": "Delay the Resolution of Each Promise", + "titleSlug": "delay-the-resolution-of-each-promise", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 8, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[() => new Promise((resolve) => setTimeout(resolve, 30))]\n50\n[() => new Promise((resolve) => setTimeout(resolve, 50)),() => new Promise((resolve) => setTimeout(resolve, 80))]\n70", + "categoryTitle": "JavaScript", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"78\", \"totalSubmission\": \"86\", \"totalAcceptedRaw\": 78, \"totalSubmissionRaw\": 86, \"acRate\": \"90.7%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "[() => new Promise((resolve) => setTimeout(resolve, 30))]\n50", + "metaData": "{\n \"name\": \"delayAll\",\n \"params\": [\n {\n \"name\": \"functions\",\n \"type\": \"string\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"ms\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"javascript\",\n \"typescript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"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.

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

TypeScript 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]election-results.json b/leetcode/originData/[no content]election-results.json new file mode 100644 index 00000000..652e5e50 --- /dev/null +++ b/leetcode/originData/[no content]election-results.json @@ -0,0 +1,56 @@ +{ + "data": { + "question": { + "questionId": "3078", + "questionFrontendId": "2820", + "boundTopicId": null, + "title": "Election Results", + "titleSlug": "election-results", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 9, + "dislikes": 3, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\":{\"Votes\":[\"voter\",\"candidate\"]},\"rows\":{\"Votes\":[[\"Kathy\",null],[\"Charles\",\"Ryan\"],[\"Charles\",\"Christine\"],[\"Charles\",\"Kathy\"],[\"Benjamin\",\"Christine\"],[\"Anthony\",\"Ryan\"],[\"Edward\",\"Ryan\"],[\"Terry\",null],[\"Evelyn\",\"Kathy\"],[\"Arthur\",\"Christine\"]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"116\", \"totalSubmission\": \"154\", \"totalAcceptedRaw\": 116, \"totalSubmissionRaw\": 154, \"acRate\": \"75.3%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Votes\":[\"voter\",\"candidate\"]},\"rows\":{\"Votes\":[[\"Kathy\",null],[\"Charles\",\"Ryan\"],[\"Charles\",\"Christine\"],[\"Charles\",\"Kathy\"],[\"Benjamin\",\"Christine\"],[\"Anthony\",\"Ryan\"],[\"Edward\",\"Ryan\"],[\"Terry\",null],[\"Evelyn\",\"Kathy\"],[\"Arthur\",\"Christine\"]]}}", + "metaData": "{\"mysql\": [\"Create table if not exists Votes(voter varchar(30), candidate varchar(30))\"], \"mssql\": [\"Create table Votes(voter varchar(30),candidate varchar(30))\"], \"oraclesql\": [\"Create table Votes(voter varchar(30),candidate varchar(30))\"], \"database\": true, \"languages\": [\"mysql\", \"mssql\", \"oraclesql\"], \"database_schema\": {\"Votes\": {\"voter\": \"VARCHAR(30)\", \"candidate\": \"VARCHAR(30)\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table if not exists Votes(voter varchar(30), candidate varchar(30))", + "Truncate table Votes", + "insert into Votes (voter, candidate) values ('Kathy', 'None')", + "insert into Votes (voter, candidate) values ('Charles', 'Ryan')", + "insert into Votes (voter, candidate) values ('Charles', 'Christine')", + "insert into Votes (voter, candidate) values ('Charles', 'Kathy')", + "insert into Votes (voter, candidate) values ('Benjamin', 'Christine')", + "insert into Votes (voter, candidate) values ('Anthony', 'Ryan')", + "insert into Votes (voter, candidate) values ('Edward', 'Ryan')", + "insert into Votes (voter, candidate) values ('Terry', 'None')", + "insert into Votes (voter, candidate) values ('Evelyn', 'Kathy')", + "insert into Votes (voter, candidate) values ('Arthur', 'Christine')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"

MySQL 8.0.

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

mssql server 2019.

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

Oracle Sql 11.2.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]inversion-of-object.json b/leetcode/originData/[no content]inversion-of-object.json new file mode 100644 index 00000000..6444722f --- /dev/null +++ b/leetcode/originData/[no content]inversion-of-object.json @@ -0,0 +1,43 @@ +{ + "data": { + "question": { + "questionId": "2925", + "questionFrontendId": "2822", + "boundTopicId": null, + "title": "Inversion of Object", + "titleSlug": "inversion-of-object", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Easy", + "likes": 7, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"a\": \"1\",\"b\": \"2\",\"c\": \"3\",\"d\": \"4\" }\n{\"a\": \"1\",\"b\": \"2\",\"c\": \"2\",\"d\": \"4\" }\n[\"1\",\"2\",\"3\",\"4\"]", + "categoryTitle": "JavaScript", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"82\", \"totalSubmission\": \"103\", \"totalAcceptedRaw\": 82, \"totalSubmissionRaw\": 103, \"acRate\": \"79.6%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"a\": \"1\",\"b\": \"2\",\"c\": \"3\",\"d\": \"4\" }", + "metaData": "{\n \"name\": \"invertObject\",\n \"params\": [\n {\n \"name\": \"obj\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n },\n \"languages\": [\n \"typescript\",\n \"javascript\"\n ],\n \"manual\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"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.

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

TypeScript 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]minimum-relative-loss-after-buying-chocolates.json b/leetcode/originData/[no content]minimum-relative-loss-after-buying-chocolates.json new file mode 100644 index 00000000..55080050 --- /dev/null +++ b/leetcode/originData/[no content]minimum-relative-loss-after-buying-chocolates.json @@ -0,0 +1,49 @@ +{ + "data": { + "question": { + "questionId": "3077", + "questionFrontendId": "2819", + "boundTopicId": null, + "title": "Minimum Relative Loss After Buying Chocolates", + "titleSlug": "minimum-relative-loss-after-buying-chocolates", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 6, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[1,9,22,10,19]\n[[18,4],[5,2]]\n[1,5,4,3,7,11,9]\n[[5,4],[5,7],[7,3],[4,5]]\n[5,6,7]\n[[10,1],[5,3],[3,3]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"112\", \"totalSubmission\": \"194\", \"totalAcceptedRaw\": 112, \"totalSubmissionRaw\": 194, \"acRate\": \"57.7%\"}", + "hints": [ + "
First sort prices.
", + "
For one query, imagine mi is 1. It can be shown that Bob should select either the first one (the cheapest one) or the last one (the most expensive).
", + "
Now if mi > 1, separate the chocolates into two parts. The first part is chocolates having a price less than or equal to k, the rest would be in the second part.
", + "
Knowing how many chocolates Bob should pick from the first part is sufficient. Of course, Bob should select a prefix from this part and a suffix from the second part.
", + "
To find the number of chocolates from the first part, do a binary search on the first part.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,9,22,10,19]\n[[18,4],[5,2]]", + "metaData": "{\n \"name\": \"minimumRelativeLosses\",\n \"params\": [\n {\n \"name\": \"prices\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"queries\"\n }\n ],\n \"return\": {\n \"type\": \"long[]\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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-operations-to-maximize-score.json b/leetcode/originData/apply-operations-to-maximize-score.json new file mode 100644 index 00000000..763446bb --- /dev/null +++ b/leetcode/originData/apply-operations-to-maximize-score.json @@ -0,0 +1,202 @@ +{ + "data": { + "question": { + "questionId": "3001", + "questionFrontendId": "2818", + "boundTopicId": null, + "title": "Apply Operations to Maximize Score", + "titleSlug": "apply-operations-to-maximize-score", + "content": "

You are given an array nums of n positive integers and an integer k.

\n\n

Initially, you start with a score of 1. You have to maximize your score by applying the following operation at most k times:

\n\n
    \n\t
  • Choose any non-empty subarray nums[l, ..., r] that you haven't chosen previously.
  • \n\t
  • Choose an element x of nums[l, ..., r] with the highest prime score. If multiple such elements exist, choose the one with the smallest index.
  • \n\t
  • Multiply your score by x.
  • \n
\n\n

Here, nums[l, ..., r] denotes the subarray of nums starting at index l and ending at the index r, both ends being inclusive.

\n\n

The prime score of an integer x is equal to the number of distinct prime factors of x. For example, the prime score of 300 is 3 since 300 = 2 * 2 * 3 * 5 * 5.

\n\n

Return the maximum possible score after applying at most k operations.

\n\n

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

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [8,3,9,3,8], k = 2\nOutput: 81\nExplanation: To get a score of 81, we can apply the following operations:\n- Choose subarray nums[2, ..., 2]. nums[2] is the only element in this subarray. Hence, we multiply the score by nums[2]. The score becomes 1 * 9 = 9.\n- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 1, but nums[2] has the smaller index. Hence, we multiply the score by nums[2]. The score becomes 9 * 9 = 81.\nIt can be proven that 81 is the highest score one can obtain.
\n\n

Example 2:

\n\n
\nInput: nums = [19,12,14,6,10,18], k = 3\nOutput: 4788\nExplanation: To get a score of 4788, we can apply the following operations: \n- Choose subarray nums[0, ..., 0]. nums[0] is the only element in this subarray. Hence, we multiply the score by nums[0]. The score becomes 1 * 19 = 19.\n- Choose subarray nums[5, ..., 5]. nums[5] is the only element in this subarray. Hence, we multiply the score by nums[5]. The score becomes 19 * 18 = 342.\n- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 2, but nums[2] has the smaller index. Hence, we multipy the score by nums[2]. The score becomes 342 * 14 = 4788.\nIt can be proven that 4788 is the highest score one can obtain.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length == n <= 105
  • \n\t
  • 1 <= nums[i] <= 105
  • \n\t
  • 1 <= k <= min(n * (n + 1) / 2, 109)
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 249, + "dislikes": 8, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Next Greater Element IV\", \"titleSlug\": \"next-greater-element-iv\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[8,3,9,3,8]\n2\n[19,12,14,6,10,18]\n3", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Stack", + "slug": "stack", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Monotonic Stack", + "slug": "monotonic-stack", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Number Theory", + "slug": "number-theory", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maximumScore(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maximumScore(List nums, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumScore(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 maximumScore(self, nums: List[int], k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int maximumScore(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaximumScore(IList 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 maximumScore = function(nums, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef maximum_score(nums, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumScore(_ nums: [Int], _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumScore(nums []int, k int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumScore(nums: List[Int], k: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumScore(nums: List, k: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximum_score(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 maximumScore($nums, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumScore(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximum-score nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximum_score(Nums :: [integer()], K :: integer()) -> integer().\nmaximum_score(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximum_score(nums :: [integer], k :: integer) :: integer\n def maximum_score(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maximumScore(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.8K\", \"totalSubmission\": \"14.8K\", \"totalAcceptedRaw\": 4829, \"totalSubmissionRaw\": 14847, \"acRate\": \"32.5%\"}", + "hints": [ + "
Calculate nums[i]'s prime score s[i] by factoring in O(sqrt(nums[i])) time.
", + "
For each nums[i], find the nearest index left[i] on the left (if any) such that s[left[i]] >= s[i]. if none is found, set left[i] to -1. Similarly, find the nearest index right[i] on the right (if any) such that s[right[i]] > s[i]. If none is found, set right[i] to n.
", + "
Use a monotonic stack to compute right[i] and left[i].
", + "
For each index i, if left[i] + 1 <= l <= i <= r <= right[i] - 1, then s[i] is the maximum value in the range [l, r]. For this particular i, there are ranges[i] = (i - left[i]) * (right[i] - i) ranges where index i will be chosen.
", + "
Loop over all elements of nums by non-increasing prime score, each element will be chosen min(ranges[i], remainingK) times, where reaminingK denotes the number of remaining operations. Therefore, the score will be multiplied by s[i]^min(ranges[i],remainingK).
", + "
Use fast exponentiation to quickly calculate A^B mod C.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[8,3,9,3,8]\n2", + "metaData": "{\n \"name\": \"maximumScore\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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-a-string-is-an-acronym-of-words.json b/leetcode/originData/check-if-a-string-is-an-acronym-of-words.json new file mode 100644 index 00000000..c6ca1692 --- /dev/null +++ b/leetcode/originData/check-if-a-string-is-an-acronym-of-words.json @@ -0,0 +1,160 @@ +{ + "data": { + "question": { + "questionId": "2977", + "questionFrontendId": "2828", + "boundTopicId": null, + "title": "Check if a String Is an Acronym of Words", + "titleSlug": "check-if-a-string-is-an-acronym-of-words", + "content": "

Given an array of strings words and a string s, determine if s is an acronym of words.

\n\n

The string s is considered an acronym of words if it can be formed by concatenating the first character of each string in words in order. For example, "ab" can be formed from ["apple", "banana"], but it can't be formed from ["bear", "aardvark"].

\n\n

Return true if s is an acronym of words, and false otherwise.

\n\n

 

\n

Example 1:

\n\n
\nInput: words = ["alice","bob","charlie"], s = "abc"\nOutput: true\nExplanation: The first character in the words "alice", "bob", and "charlie" are 'a', 'b', and 'c', respectively. Hence, s = "abc" is the acronym. \n
\n\n

Example 2:

\n\n
\nInput: words = ["an","apple"], s = "a"\nOutput: false\nExplanation: The first character in the words "an" and "apple" are 'a' and 'a', respectively. \nThe acronym formed by concatenating these characters is "aa". \nHence, s = "a" is not the acronym.\n
\n\n

Example 3:

\n\n
\nInput: words = ["never","gonna","give","up","on","you"], s = "ngguoy"\nOutput: true\nExplanation: By concatenating the first character of the words in the array, we get the string "ngguoy". \nHence, s = "ngguoy" is the acronym.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= words.length <= 100
  • \n\t
  • 1 <= words[i].length <= 10
  • \n\t
  • 1 <= s.length <= 100
  • \n\t
  • words[i] and s consist of lowercase English letters.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 42, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Word Abbreviation\", \"titleSlug\": \"word-abbreviation\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "[\"alice\",\"bob\",\"charlie\"]\n\"abc\"\n[\"an\",\"apple\"]\n\"a\"\n[\"never\",\"gonna\",\"give\",\"up\",\"on\",\"you\"]\n\"ngguoy\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool isAcronym(vector& words, string s) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean isAcronym(List words, String s) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def isAcronym(self, words, s):\n \"\"\"\n :type words: List[str]\n :type s: str\n :rtype: bool\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def isAcronym(self, words: List[str], s: str) -> bool:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool isAcronym(char ** words, int wordsSize, char * s){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool IsAcronym(IList words, string s) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string[]} words\n * @param {string} s\n * @return {boolean}\n */\nvar isAcronym = function(words, s) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String[]} words\n# @param {String} s\n# @return {Boolean}\ndef is_acronym(words, s)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func isAcronym(_ words: [String], _ s: String) -> Bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func isAcronym(words []string, s string) bool {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def isAcronym(words: List[String], s: String): Boolean = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun isAcronym(words: List, s: String): Boolean {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn is_acronym(words: Vec, s: String) -> bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String[] $words\n * @param String $s\n * @return Boolean\n */\n function isAcronym($words, $s) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function isAcronym(words: string[], s: string): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (is-acronym words s)\n (-> (listof string?) string? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec is_acronym(Words :: [unicode:unicode_binary()], S :: unicode:unicode_binary()) -> boolean().\nis_acronym(Words, S) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec is_acronym(words :: [String.t], s :: String.t) :: boolean\n def is_acronym(words, s) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool isAcronym(List words, String s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"22.6K\", \"totalSubmission\": \"27.4K\", \"totalAcceptedRaw\": 22648, \"totalSubmissionRaw\": 27375, \"acRate\": \"82.7%\"}", + "hints": [ + "
Concatenate the first characters of the strings in words, and compare the resulting concatenation to s.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[\"alice\",\"bob\",\"charlie\"]\n\"abc\"", + "metaData": "{\n \"name\": \"isAcronym\",\n \"params\": [\n {\n \"name\": \"words\",\n \"type\": \"list\"\n },\n {\n \"type\": \"string\",\n \"name\": \"s\"\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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-pairs-whose-sum-is-less-than-target.json b/leetcode/originData/count-pairs-whose-sum-is-less-than-target.json new file mode 100644 index 00000000..e69cf1ae --- /dev/null +++ b/leetcode/originData/count-pairs-whose-sum-is-less-than-target.json @@ -0,0 +1,160 @@ +{ + "data": { + "question": { + "questionId": "2917", + "questionFrontendId": "2824", + "boundTopicId": null, + "title": "Count Pairs Whose Sum is Less than Target", + "titleSlug": "count-pairs-whose-sum-is-less-than-target", + "content": "Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target.\n

 

\n

Example 1:

\n\n
\nInput: nums = [-1,1,2,3,1], target = 2\nOutput: 3\nExplanation: There are 3 pairs of indices that satisfy the conditions in the statement:\n- (0, 1) since 0 < 1 and nums[0] + nums[1] = 0 < target\n- (0, 2) since 0 < 2 and nums[0] + nums[2] = 1 < target \n- (0, 4) since 0 < 4 and nums[0] + nums[4] = 0 < target\nNote that (0, 3) is not counted since nums[0] + nums[3] is not strictly less than the target.\n
\n\n

Example 2:

\n\n
\nInput: nums = [-6,2,5,-2,-7,-1,3], target = -2\nOutput: 10\nExplanation: There are 10 pairs of indices that satisfy the conditions in the statement:\n- (0, 1) since 0 < 1 and nums[0] + nums[1] = -4 < target\n- (0, 3) since 0 < 3 and nums[0] + nums[3] = -8 < target\n- (0, 4) since 0 < 4 and nums[0] + nums[4] = -13 < target\n- (0, 5) since 0 < 5 and nums[0] + nums[5] = -7 < target\n- (0, 6) since 0 < 6 and nums[0] + nums[6] = -3 < target\n- (1, 4) since 1 < 4 and nums[1] + nums[4] = -5 < target\n- (3, 4) since 3 < 4 and nums[3] + nums[4] = -9 < target\n- (3, 5) since 3 < 5 and nums[3] + nums[5] = -3 < target\n- (4, 5) since 4 < 5 and nums[4] + nums[5] = -8 < target\n- (4, 6) since 4 < 6 and nums[4] + nums[6] = -4 < target\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length == n <= 50
  • \n\t
  • -50 <= nums[i], target <= 50
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 57, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Two Sum\", \"titleSlug\": \"two-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Count the Number of Fair Pairs\", \"titleSlug\": \"count-the-number-of-fair-pairs\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[-1,1,2,3,1]\n2\n[-6,2,5,-2,-7,-1,3]\n-2", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countPairs(vector& nums, int target) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countPairs(List nums, int target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countPairs(self, nums, target):\n \"\"\"\n :type nums: List[int]\n :type target: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countPairs(self, nums: List[int], target: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int countPairs(int* nums, int numsSize, int target){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountPairs(IList nums, int target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} target\n * @return {number}\n */\nvar countPairs = function(nums, target) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} target\n# @return {Integer}\ndef count_pairs(nums, target)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countPairs(_ nums: [Int], _ target: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countPairs(nums []int, target int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countPairs(nums: List[Int], target: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countPairs(nums: List, target: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_pairs(nums: Vec, target: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $target\n * @return Integer\n */\n function countPairs($nums, $target) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countPairs(nums: number[], target: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-pairs nums target)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_pairs(Nums :: [integer()], Target :: integer()) -> integer().\ncount_pairs(Nums, Target) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_pairs(nums :: [integer], target :: integer) :: integer\n def count_pairs(nums, target) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int countPairs(List nums, int target) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"26.3K\", \"totalSubmission\": \"30.5K\", \"totalAcceptedRaw\": 26309, \"totalSubmissionRaw\": 30534, \"acRate\": \"86.2%\"}", + "hints": [ + "The constraints are small enough for a brute-force solution to pass" + ], + "solution": null, + "status": null, + "sampleTestCase": "[-1,1,2,3,1]\n2", + "metaData": "{\n \"name\": \"countPairs\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"target\"\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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/determine-the-minimum-sum-of-a-k-avoiding-array.json b/leetcode/originData/determine-the-minimum-sum-of-a-k-avoiding-array.json new file mode 100644 index 00000000..6c9141d4 --- /dev/null +++ b/leetcode/originData/determine-the-minimum-sum-of-a-k-avoiding-array.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "2811", + "questionFrontendId": "2829", + "boundTopicId": null, + "title": "Determine the Minimum Sum of a k-avoiding Array", + "titleSlug": "determine-the-minimum-sum-of-a-k-avoiding-array", + "content": "

You are given two integers, n and k.

\n\n

An array of distinct positive integers is called a k-avoiding array if there does not exist any pair of distinct elements that sum to k.

\n\n

Return the minimum possible sum of a k-avoiding array of length n.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 5, k = 4\nOutput: 18\nExplanation: Consider the k-avoiding array [1,2,4,5,6], which has a sum of 18.\nIt can be proven that there is no k-avoiding array with a sum less than 18.\n
\n\n

Example 2:

\n\n
\nInput: n = 2, k = 6\nOutput: 3\nExplanation: We can construct the array [1,2], which has a sum of 3.\nIt can be proven that there is no k-avoiding array with a sum less than 3.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n, k <= 50
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 121, + "dislikes": 3, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "5\n4\n2\n6", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minimumSum(int n, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumSum(int n, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumSum(self, n, k):\n \"\"\"\n :type n: int\n :type k: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumSum(self, n: int, k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minimumSum(int n, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumSum(int n, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number} k\n * @return {number}\n */\nvar minimumSum = function(n, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer} k\n# @return {Integer}\ndef minimum_sum(n, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumSum(_ n: Int, _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumSum(n int, k int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumSum(n: Int, k: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumSum(n: Int, k: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_sum(n: i32, k: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer $k\n * @return Integer\n */\n function minimumSum($n, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumSum(n: number, k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-sum n k)\n (-> exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_sum(N :: integer(), K :: integer()) -> integer().\nminimum_sum(N, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_sum(n :: integer, k :: integer) :: integer\n def minimum_sum(n, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minimumSum(int n, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"19.1K\", \"totalSubmission\": \"33.3K\", \"totalAcceptedRaw\": 19055, \"totalSubmissionRaw\": 33300, \"acRate\": \"57.2%\"}", + "hints": [ + "
Try to start with the smallest possible integers.
", + "
Check if the current number can be added to the array.
", + "
To check if the current number can be added, keep track of already added numbers in a set.
", + "
If the number i is added to the array, then i + k can not be added.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "5\n4", + "metaData": "{\n \"name\": \"minimumSum\",\n \"params\": [\n {\n \"name\": \"n\",\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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/double-a-number-represented-as-a-linked-list.json b/leetcode/originData/double-a-number-represented-as-a-linked-list.json new file mode 100644 index 00000000..1fdfcdac --- /dev/null +++ b/leetcode/originData/double-a-number-represented-as-a-linked-list.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "2871", + "questionFrontendId": "2816", + "boundTopicId": null, + "title": "Double a Number Represented as a Linked List", + "titleSlug": "double-a-number-represented-as-a-linked-list", + "content": "

You are given the head of a non-empty linked list representing a non-negative integer without leading zeroes.

\n\n

Return the head of the linked list after doubling it.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: head = [1,8,9]\nOutput: [3,7,8]\nExplanation: The figure above corresponds to the given linked list which represents the number 189. Hence, the returned linked list represents the number 189 * 2 = 378.\n
\n\n

Example 2:

\n\"\"\n
\nInput: head = [9,9,9]\nOutput: [1,9,9,8]\nExplanation: The figure above corresponds to the given linked list which represents the number 999. Hence, the returned linked list reprersents the number 999 * 2 = 1998. \n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • The number of nodes in the list is in the range [1, 104]
  • \n\t
  • 0 <= Node.val <= 9
  • \n\t
  • The input is generated such that the list represents a number that does not have leading zeros, except the number 0 itself.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 278, + "dislikes": 4, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Add Two Numbers\", \"titleSlug\": \"add-two-numbers\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Plus One Linked List\", \"titleSlug\": \"plus-one-linked-list\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[1,8,9]\n[9,9,9]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Linked List", + "slug": "linked-list", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Stack", + "slug": "stack", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "/**\n * Definition for singly-linked list.\n * struct ListNode {\n * int val;\n * ListNode *next;\n * ListNode() : val(0), next(nullptr) {}\n * ListNode(int x) : val(x), next(nullptr) {}\n * ListNode(int x, ListNode *next) : val(x), next(next) {}\n * };\n */\nclass Solution {\npublic:\n ListNode* doubleIt(ListNode* head) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * int val;\n * ListNode next;\n * ListNode() {}\n * ListNode(int val) { this.val = val; }\n * ListNode(int val, ListNode next) { this.val = val; this.next = next; }\n * }\n */\nclass Solution {\n public ListNode doubleIt(ListNode head) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "# Definition for singly-linked list.\n# class ListNode(object):\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution(object):\n def doubleIt(self, head):\n \"\"\"\n :type head: Optional[ListNode]\n :rtype: Optional[ListNode]\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "# Definition for singly-linked list.\n# class ListNode:\n# def __init__(self, val=0, next=None):\n# self.val = val\n# self.next = next\nclass Solution:\n def doubleIt(self, head: Optional[ListNode]) -> Optional[ListNode]:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "/**\n * Definition for singly-linked list.\n * struct ListNode {\n * int val;\n * struct ListNode *next;\n * };\n */\nstruct ListNode* doubleIt(struct ListNode* head){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * public int val;\n * public ListNode next;\n * public ListNode(int val=0, ListNode next=null) {\n * this.val = val;\n * this.next = next;\n * }\n * }\n */\npublic class Solution {\n public ListNode DoubleIt(ListNode head) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * Definition for singly-linked list.\n * function ListNode(val, next) {\n * this.val = (val===undefined ? 0 : val)\n * this.next = (next===undefined ? null : next)\n * }\n */\n/**\n * @param {ListNode} head\n * @return {ListNode}\n */\nvar doubleIt = function(head) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# Definition for singly-linked list.\n# class ListNode\n# attr_accessor :val, :next\n# def initialize(val = 0, _next = nil)\n# @val = val\n# @next = _next\n# end\n# end\n# @param {ListNode} head\n# @return {ListNode}\ndef double_it(head)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "/**\n * Definition for singly-linked list.\n * public class ListNode {\n * public var val: Int\n * public var next: ListNode?\n * public init() { self.val = 0; self.next = nil; }\n * public init(_ val: Int) { self.val = val; self.next = nil; }\n * public init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }\n * }\n */\nclass Solution {\n func doubleIt(_ head: ListNode?) -> ListNode? {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "/**\n * Definition for singly-linked list.\n * type ListNode struct {\n * Val int\n * Next *ListNode\n * }\n */\nfunc doubleIt(head *ListNode) *ListNode {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode(_x: Int = 0, _next: ListNode = null) {\n * var next: ListNode = _next\n * var x: Int = _x\n * }\n */\nobject Solution {\n def doubleIt(head: ListNode): ListNode = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "/**\n * Example:\n * var li = ListNode(5)\n * var v = li.`val`\n * Definition for singly-linked list.\n * class ListNode(var `val`: Int) {\n * var next: ListNode? = null\n * }\n */\nclass Solution {\n fun doubleIt(head: ListNode?): ListNode? {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "// Definition for singly-linked list.\n// #[derive(PartialEq, Eq, Clone, Debug)]\n// pub struct ListNode {\n// pub val: i32,\n// pub next: Option>\n// }\n// \n// impl ListNode {\n// #[inline]\n// fn new(val: i32) -> Self {\n// ListNode {\n// next: None,\n// val\n// }\n// }\n// }\nimpl Solution {\n pub fn double_it(head: Option>) -> Option> {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "/**\n * Definition for a singly-linked list.\n * class ListNode {\n * public $val = 0;\n * public $next = null;\n * function __construct($val = 0, $next = null) {\n * $this->val = $val;\n * $this->next = $next;\n * }\n * }\n */\nclass Solution {\n\n /**\n * @param ListNode $head\n * @return ListNode\n */\n function doubleIt($head) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode {\n * val: number\n * next: ListNode | null\n * constructor(val?: number, next?: ListNode | null) {\n * this.val = (val===undefined ? 0 : val)\n * this.next = (next===undefined ? null : next)\n * }\n * }\n */\n\nfunction doubleIt(head: ListNode | null): ListNode | null {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "; Definition for singly-linked list:\n#|\n\n; val : integer?\n; next : (or/c list-node? #f)\n(struct list-node\n (val next) #:mutable #:transparent)\n\n; constructor\n(define (make-list-node [val 0])\n (list-node val #f))\n\n|#\n\n(define/contract (double-it head)\n (-> (or/c list-node? #f) (or/c list-node? #f))\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "%% Definition for singly-linked list.\n%%\n%% -record(list_node, {val = 0 :: integer(),\n%% next = null :: 'null' | #list_node{}}).\n\n-spec double_it(Head :: #list_node{} | null) -> #list_node{} | null.\ndouble_it(Head) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "# Definition for singly-linked list.\n#\n# defmodule ListNode do\n# @type t :: %__MODULE__{\n# val: integer,\n# next: ListNode.t() | nil\n# }\n# defstruct val: 0, next: nil\n# end\n\ndefmodule Solution do\n @spec double_it(head :: ListNode.t | nil) :: ListNode.t | nil\n def double_it(head) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "/**\n * Definition for singly-linked list.\n * class ListNode {\n * int val;\n * ListNode? next;\n * ListNode([this.val = 0, this.next]);\n * }\n */\nclass Solution {\n ListNode? doubleIt(ListNode? head) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"24.6K\", \"totalSubmission\": \"52.6K\", \"totalAcceptedRaw\": 24629, \"totalSubmissionRaw\": 52613, \"acRate\": \"46.8%\"}", + "hints": [ + "Traverse the linked list from the least significant digit to the most significant digit and multiply each node's value by 2", + "Handle any carry-over digits that may arise during the doubling process.", + "If there is a carry-over digit on the most significant digit, create a new node with that value and point it to the start of the given linked list and return it." + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,8,9]", + "metaData": "{\n \"name\": \"doubleIt\",\n \"params\": [\n {\n \"name\": \"head\",\n \"type\": \"ListNode\"\n }\n ],\n \"return\": {\n \"type\": \"ListNode\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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/find-the-longest-equal-subarray.json b/leetcode/originData/find-the-longest-equal-subarray.json new file mode 100644 index 00000000..9a13a2c5 --- /dev/null +++ b/leetcode/originData/find-the-longest-equal-subarray.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "2832", + "questionFrontendId": "2831", + "boundTopicId": null, + "title": "Find the Longest Equal Subarray", + "titleSlug": "find-the-longest-equal-subarray", + "content": "

You are given a 0-indexed integer array nums and an integer k.

\n\n

A subarray is called equal if all of its elements are equal. Note that the empty subarray is an equal subarray.

\n\n

Return the length of the longest possible equal subarray after deleting at most k elements from nums.

\n\n

A subarray is a contiguous, possibly empty sequence of elements within an array.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [1,3,2,3,1,3], k = 3\nOutput: 3\nExplanation: It's optimal to delete the elements at index 2 and index 4.\nAfter deleting them, nums becomes equal to [1, 3, 3, 3].\nThe longest equal subarray starts at i = 1 and ends at j = 3 with length equal to 3.\nIt can be proven that no longer equal subarrays can be created.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,1,2,2,1,1], k = 2\nOutput: 4\nExplanation: It's optimal to delete the elements at index 2 and index 3.\nAfter deleting them, nums becomes equal to [1, 1, 1, 1].\nThe array itself is an equal subarray, so the answer is 4.\nIt can be proven that no longer equal subarrays can be created.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= nums.length
  • \n\t
  • 0 <= k <= nums.length
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 186, + "dislikes": 2, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[1,3,2,3,1,3]\n3\n[1,1,2,2,1,1]\n2", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int longestEqualSubarray(vector& nums, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int longestEqualSubarray(List nums, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def longestEqualSubarray(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 longestEqualSubarray(self, nums: List[int], k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int longestEqualSubarray(int* nums, int numsSize, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int LongestEqualSubarray(IList 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 longestEqualSubarray = function(nums, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef longest_equal_subarray(nums, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func longestEqualSubarray(_ nums: [Int], _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func longestEqualSubarray(nums []int, k int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def longestEqualSubarray(nums: List[Int], k: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun longestEqualSubarray(nums: List, k: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn longest_equal_subarray(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 longestEqualSubarray($nums, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function longestEqualSubarray(nums: number[], k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (longest-equal-subarray nums k)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec longest_equal_subarray(Nums :: [integer()], K :: integer()) -> integer().\nlongest_equal_subarray(Nums, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec longest_equal_subarray(nums :: [integer], k :: integer) :: integer\n def longest_equal_subarray(nums, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int longestEqualSubarray(List nums, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"6.8K\", \"totalSubmission\": \"24.4K\", \"totalAcceptedRaw\": 6793, \"totalSubmissionRaw\": 24424, \"acRate\": \"27.8%\"}", + "hints": [ + "
For each number x in nums, create a sorted list indicesx of all indices i such that nums[i] == x.
", + "
On every indicesx, execute a sliding window technique.
", + "
For each indicesx, find i, j such that (indicesx[j] - indicesx[i]) - (j - i) <= k and j - i + 1 is maximized.
", + "
The answer would be the maximum of j - i + 1 for all indicesx.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,3,2,3,1,3]\n3", + "metaData": "{\n \"name\": \"longestEqualSubarray\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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/make-string-a-subsequence-using-cyclic-increments.json b/leetcode/originData/make-string-a-subsequence-using-cyclic-increments.json new file mode 100644 index 00000000..71172225 --- /dev/null +++ b/leetcode/originData/make-string-a-subsequence-using-cyclic-increments.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "3018", + "questionFrontendId": "2825", + "boundTopicId": null, + "title": "Make String a Subsequence Using Cyclic Increments", + "titleSlug": "make-string-a-subsequence-using-cyclic-increments", + "content": "

You are given two 0-indexed strings str1 and str2.

\n\n

In an operation, you select a set of indices in str1, and for each index i in the set, increment str1[i] to the next character cyclically. That is 'a' becomes 'b', 'b' becomes 'c', and so on, and 'z' becomes 'a'.

\n\n

Return true if it is possible to make str2 a subsequence of str1 by performing the operation at most once, and false otherwise.

\n\n

Note: A subsequence of a string is a new string that is formed from the original string by deleting some (possibly none) of the characters without disturbing the relative positions of the remaining characters.

\n\n

 

\n

Example 1:

\n\n
\nInput: str1 = "abc", str2 = "ad"\nOutput: true\nExplanation: Select index 2 in str1.\nIncrement str1[2] to become 'd'. \nHence, str1 becomes "abd" and str2 is now a subsequence. Therefore, true is returned.
\n\n

Example 2:

\n\n
\nInput: str1 = "zc", str2 = "ad"\nOutput: true\nExplanation: Select indices 0 and 1 in str1. \nIncrement str1[0] to become 'a'. \nIncrement str1[1] to become 'd'. \nHence, str1 becomes "ad" and str2 is now a subsequence. Therefore, true is returned.
\n\n

Example 3:

\n\n
\nInput: str1 = "ab", str2 = "d"\nOutput: false\nExplanation: In this example, it can be shown that it is impossible to make str2 a subsequence of str1 using the operation at most once. \nTherefore, false is returned.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= str1.length <= 105
  • \n\t
  • 1 <= str2.length <= 105
  • \n\t
  • str1 and str2 consist of only lowercase English letters.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 131, + "dislikes": 3, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Is Subsequence\", \"titleSlug\": \"is-subsequence\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "\"abc\"\n\"ad\"\n\"zc\"\n\"ad\"\n\"ab\"\n\"d\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool canMakeSubsequence(string str1, string str2) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean canMakeSubsequence(String str1, String str2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def canMakeSubsequence(self, str1, str2):\n \"\"\"\n :type str1: str\n :type str2: str\n :rtype: bool\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def canMakeSubsequence(self, str1: str, str2: str) -> bool:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "bool canMakeSubsequence(char * str1, char * str2){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool CanMakeSubsequence(string str1, string str2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} str1\n * @param {string} str2\n * @return {boolean}\n */\nvar canMakeSubsequence = function(str1, str2) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} str1\n# @param {String} str2\n# @return {Boolean}\ndef can_make_subsequence(str1, str2)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func canMakeSubsequence(_ str1: String, _ str2: String) -> Bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func canMakeSubsequence(str1 string, str2 string) bool {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def canMakeSubsequence(str1: String, str2: String): Boolean = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun canMakeSubsequence(str1: String, str2: String): Boolean {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn can_make_subsequence(str1: String, str2: String) -> bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $str1\n * @param String $str2\n * @return Boolean\n */\n function canMakeSubsequence($str1, $str2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function canMakeSubsequence(str1: string, str2: string): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (can-make-subsequence str1 str2)\n (-> string? string? boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec can_make_subsequence(Str1 :: unicode:unicode_binary(), Str2 :: unicode:unicode_binary()) -> boolean().\ncan_make_subsequence(Str1, Str2) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec can_make_subsequence(str1 :: String.t, str2 :: String.t) :: boolean\n def can_make_subsequence(str1, str2) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n bool canMakeSubsequence(String str1, String str2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"45.3K\", \"totalAcceptedRaw\": 19433, \"totalSubmissionRaw\": 45295, \"acRate\": \"42.9%\"}", + "hints": [ + "
Consider the indices we will increment separately.
", + "
We can maintain two pointers: pointer i for str1 and pointer j for str2, while ensuring they remain within the bounds of the strings.
", + "
If both str1[i] and str2[j] match, or if incrementing str1[i] matches str2[j], we increase both pointers; otherwise, we increment only pointer i.
", + "
It is possible to make str2 a subsequence of str1 if j is at the end of str2, after we can no longer find a match.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "\"abc\"\n\"ad\"", + "metaData": "{\n \"name\": \"canMakeSubsequence\",\n \"params\": [\n {\n \"name\": \"str1\",\n \"type\": \"string\"\n },\n {\n \"type\": \"string\",\n \"name\": \"str2\"\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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/max-pair-sum-in-an-array.json b/leetcode/originData/max-pair-sum-in-an-array.json new file mode 100644 index 00000000..54f8e772 --- /dev/null +++ b/leetcode/originData/max-pair-sum-in-an-array.json @@ -0,0 +1,173 @@ +{ + "data": { + "question": { + "questionId": "2902", + "questionFrontendId": "2815", + "boundTopicId": null, + "title": "Max Pair Sum in an Array", + "titleSlug": "max-pair-sum-in-an-array", + "content": "

You are given a 0-indexed integer array nums. You have to find the maximum sum of a pair of numbers from nums such that the maximum digit in both numbers are equal.

\n\n

Return the maximum sum or -1 if no such pair exists.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [51,71,17,24,42]\nOutput: 88\nExplanation: \nFor i = 1 and j = 2, nums[i] and nums[j] have equal maximum digits with a pair sum of 71 + 17 = 88. \nFor i = 3 and j = 4, nums[i] and nums[j] have equal maximum digits with a pair sum of 24 + 42 = 66.\nIt can be shown that there are no other pairs with equal maximum digits, so the answer is 88.
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,3,4]\nOutput: -1\nExplanation: No pair exists in nums with equal maximum digits.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 2 <= nums.length <= 100
  • \n\t
  • 1 <= nums[i] <= 104
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 169, + "dislikes": 64, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[51,71,17,24,42]\n[1,2,3,4]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maxSum(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maxSum(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maxSum(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maxSum(self, nums: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int maxSum(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaxSum(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maxSum = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef max_sum(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maxSum(_ nums: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maxSum(nums []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maxSum(nums: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maxSum(nums: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn max_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 maxSum($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maxSum(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (max-sum nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec max_sum(Nums :: [integer()]) -> integer().\nmax_sum(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec max_sum(nums :: [integer]) :: integer\n def max_sum(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maxSum(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"28.3K\", \"totalSubmission\": \"48.8K\", \"totalAcceptedRaw\": 28274, \"totalSubmissionRaw\": 48772, \"acRate\": \"58.0%\"}", + "hints": [ + "Find the largest and second largest element with maximum digits equal to x where 1<=x<=9." + ], + "solution": null, + "status": null, + "sampleTestCase": "[51,71,17,24,42]", + "metaData": "{\n \"name\": \"maxSum\",\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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/maximize-the-profit-as-the-salesman.json b/leetcode/originData/maximize-the-profit-as-the-salesman.json new file mode 100644 index 00000000..207017cd --- /dev/null +++ b/leetcode/originData/maximize-the-profit-as-the-salesman.json @@ -0,0 +1,162 @@ +{ + "data": { + "question": { + "questionId": "2979", + "questionFrontendId": "2830", + "boundTopicId": null, + "title": "Maximize the Profit as the Salesman", + "titleSlug": "maximize-the-profit-as-the-salesman", + "content": "

You are given an integer n representing the number of houses on a number line, numbered from 0 to n - 1.

\n\n

Additionally, you are given a 2D integer array offers where offers[i] = [starti, endi, goldi], indicating that ith buyer wants to buy all the houses from starti to endi for goldi amount of gold.

\n\n

As a salesman, your goal is to maximize your earnings by strategically selecting and selling houses to buyers.

\n\n

Return the maximum amount of gold you can earn.

\n\n

Note that different buyers can't buy the same house, and some houses may remain unsold.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 5, offers = [[0,0,1],[0,2,2],[1,3,2]]\nOutput: 3\nExplanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.\nWe sell houses in the range [0,0] to 1st buyer for 1 gold and houses in the range [1,3] to 3rd buyer for 2 golds.\nIt can be proven that 3 is the maximum amount of gold we can achieve.\n
\n\n

Example 2:

\n\n
\nInput: n = 5, offers = [[0,0,1],[0,2,10],[1,3,2]]\nOutput: 10\nExplanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.\nWe sell houses in the range [0,2] to 2nd buyer for 10 golds.\nIt can be proven that 10 is the maximum amount of gold we can achieve.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= offers.length <= 105
  • \n\t
  • offers[i].length == 3
  • \n\t
  • 0 <= starti <= endi <= n - 1
  • \n\t
  • 1 <= goldi <= 103
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 228, + "dislikes": 9, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "5\n[[0,0,1],[0,2,2],[1,3,2]]\n5\n[[0,0,1],[0,2,10],[1,3,2]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maximizeTheProfit(int n, vector>& offers) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maximizeTheProfit(int n, List> offers) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximizeTheProfit(self, n, offers):\n \"\"\"\n :type n: int\n :type offers: List[List[int]]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maximizeTheProfit(self, n: int, offers: List[List[int]]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int maximizeTheProfit(int n, int** offers, int offersSize, int* offersColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaximizeTheProfit(int n, IList> offers) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} offers\n * @return {number}\n */\nvar maximizeTheProfit = function(n, offers) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} offers\n# @return {Integer}\ndef maximize_the_profit(n, offers)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximizeTheProfit(_ n: Int, _ offers: [[Int]]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximizeTheProfit(n int, offers [][]int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximizeTheProfit(n: Int, offers: List[List[Int]]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximizeTheProfit(n: Int, offers: List>): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximize_the_profit(n: i32, offers: Vec>) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $offers\n * @return Integer\n */\n function maximizeTheProfit($n, $offers) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximizeTheProfit(n: number, offers: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximize-the-profit n offers)\n (-> exact-integer? (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximize_the_profit(N :: integer(), Offers :: [[integer()]]) -> integer().\nmaximize_the_profit(N, Offers) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximize_the_profit(n :: integer, offers :: [[integer]]) :: integer\n def maximize_the_profit(n, offers) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int maximizeTheProfit(int n, List> offers) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"8.6K\", \"totalSubmission\": \"29.2K\", \"totalAcceptedRaw\": 8566, \"totalSubmissionRaw\": 29197, \"acRate\": \"29.3%\"}", + "hints": [ + "
The intended solution uses a dynamic programming approach to solve the problem.
", + "
Sort the array offers by starti.
", + "
Let dp[i] = { the maximum amount of gold if the sold houses are in the range [0 … i] }.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "5\n[[0,0,1],[0,2,2],[1,3,2]]", + "metaData": "{\n \"name\": \"maximizeTheProfit\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"list>\",\n \"name\": \"offers\"\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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-absolute-difference-between-elements-with-constraint.json b/leetcode/originData/minimum-absolute-difference-between-elements-with-constraint.json new file mode 100644 index 00000000..c3bc8311 --- /dev/null +++ b/leetcode/originData/minimum-absolute-difference-between-elements-with-constraint.json @@ -0,0 +1,183 @@ +{ + "data": { + "question": { + "questionId": "3000", + "questionFrontendId": "2817", + "boundTopicId": null, + "title": "Minimum Absolute Difference Between Elements With Constraint", + "titleSlug": "minimum-absolute-difference-between-elements-with-constraint", + "content": "

You are given a 0-indexed integer array nums and an integer x.

\n\n

Find the minimum absolute difference between two elements in the array that are at least x indices apart.

\n\n

In other words, find two indices i and j such that abs(i - j) >= x and abs(nums[i] - nums[j]) is minimized.

\n\n

Return an integer denoting the minimum absolute difference between two elements that are at least x indices apart.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [4,3,2,4], x = 2\nOutput: 0\nExplanation: We can select nums[0] = 4 and nums[3] = 4. \nThey are at least 2 indices apart, and their absolute difference is the minimum, 0. \nIt can be shown that 0 is the optimal answer.\n
\n\n

Example 2:

\n\n
\nInput: nums = [5,3,2,10,15], x = 1\nOutput: 1\nExplanation: We can select nums[1] = 3 and nums[2] = 2.\nThey are at least 1 index apart, and their absolute difference is the minimum, 1.\nIt can be shown that 1 is the optimal answer.\n
\n\n

Example 3:

\n\n
\nInput: nums = [1,2,3,4], x = 3\nOutput: 3\nExplanation: We can select nums[0] = 1 and nums[3] = 4.\nThey are at least 3 indices apart, and their absolute difference is the minimum, 3.\nIt can be shown that 3 is the optimal answer.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 1 <= nums[i] <= 109
  • \n\t
  • 0 <= x < nums.length
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 496, + "dislikes": 64, + "isLiked": null, + "similarQuestions": "[{\"title\": \"K-diff Pairs in an Array\", \"titleSlug\": \"k-diff-pairs-in-an-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find All K-Distant Indices in an Array\", \"titleSlug\": \"find-all-k-distant-indices-in-an-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[4,3,2,4]\n2\n[5,3,2,10,15]\n1\n[1,2,3,4]\n3", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Binary Search", + "slug": "binary-search", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Ordered Set", + "slug": "ordered-set", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minAbsoluteDifference(vector& nums, int x) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minAbsoluteDifference(List nums, int x) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minAbsoluteDifference(self, nums, x):\n \"\"\"\n :type nums: List[int]\n :type x: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minAbsoluteDifference(self, nums: List[int], x: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minAbsoluteDifference(int* nums, int numsSize, int x){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinAbsoluteDifference(IList nums, int x) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number} x\n * @return {number}\n */\nvar minAbsoluteDifference = function(nums, x) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer} x\n# @return {Integer}\ndef min_absolute_difference(nums, x)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minAbsoluteDifference(_ nums: [Int], _ x: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minAbsoluteDifference(nums []int, x int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minAbsoluteDifference(nums: List[Int], x: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minAbsoluteDifference(nums: List, x: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn min_absolute_difference(nums: Vec, x: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer $x\n * @return Integer\n */\n function minAbsoluteDifference($nums, $x) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minAbsoluteDifference(nums: number[], x: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (min-absolute-difference nums x)\n (-> (listof exact-integer?) exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec min_absolute_difference(Nums :: [integer()], X :: integer()) -> integer().\nmin_absolute_difference(Nums, X) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec min_absolute_difference(nums :: [integer], x :: integer) :: integer\n def min_absolute_difference(nums, x) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minAbsoluteDifference(List nums, int x) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"15.7K\", \"totalSubmission\": \"52.1K\", \"totalAcceptedRaw\": 15663, \"totalSubmissionRaw\": 52109, \"acRate\": \"30.1%\"}", + "hints": [ + "
Let's only consider the cases where i < j, as the problem is symmetric.
", + "
For an index j, we are interested in an index i in the range [0, j - x] that minimizes abs(nums[i] - nums[j]).
", + "
For every index j, while going from left to right, add nums[j - x] to a set (C++ set, Java TreeSet, and Python sorted set).
", + "
After inserting nums[j - x], we can calculate the closest value to nums[j] in the set using binary search and store the absolute difference. In C++, we can achieve this by using lower_bound and/or upper_bound.
", + "
Calculate the minimum absolute difference among all indices.
" + ], + "solution": null, + "status": null, + "sampleTestCase": "[4,3,2,4]\n2", + "metaData": "{\n \"name\": \"minAbsoluteDifference\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"x\"\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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/number-of-beautiful-integers-in-the-range.json b/leetcode/originData/number-of-beautiful-integers-in-the-range.json new file mode 100644 index 00000000..8cb0d475 --- /dev/null +++ b/leetcode/originData/number-of-beautiful-integers-in-the-range.json @@ -0,0 +1,161 @@ +{ + "data": { + "question": { + "questionId": "3017", + "questionFrontendId": "2827", + "boundTopicId": null, + "title": "Number of Beautiful Integers in the Range", + "titleSlug": "number-of-beautiful-integers-in-the-range", + "content": "

You are given positive integers low, high, and k.

\n\n

A number is beautiful if it meets both of the following conditions:

\n\n
    \n\t
  • The count of even digits in the number is equal to the count of odd digits.
  • \n\t
  • The number is divisible by k.
  • \n
\n\n

Return the number of beautiful integers in the range [low, high].

\n\n

 

\n

Example 1:

\n\n
\nInput: low = 10, high = 20, k = 3\nOutput: 2\nExplanation: There are 2 beautiful integers in the given range: [12,18]. \n- 12 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 3.\n- 18 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 3.\nAdditionally we can see that:\n- 16 is not beautiful because it is not divisible by k = 3.\n- 15 is not beautiful because it does not contain equal counts even and odd digits.\nIt can be shown that there are only 2 beautiful integers in the given range.\n
\n\n

Example 2:

\n\n
\nInput: low = 1, high = 10, k = 1\nOutput: 1\nExplanation: There is 1 beautiful integer in the given range: [10].\n- 10 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 1.\nIt can be shown that there is only 1 beautiful integer in the given range.\n
\n\n

Example 3:

\n\n
\nInput: low = 5, high = 5, k = 2\nOutput: 0\nExplanation: There are 0 beautiful integers in the given range.\n- 5 is not beautiful because it is not divisible by k = 2 and it does not contain equal even and odd digits.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 0 < low <= high <= 109
  • \n\t
  • 0 < k <= 20
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 139, + "dislikes": 14, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "10\n20\n3\n1\n10\n1\n5\n5\n2", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int numberOfBeautifulIntegers(int low, int high, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int numberOfBeautifulIntegers(int low, int high, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def numberOfBeautifulIntegers(self, low, high, k):\n \"\"\"\n :type low: int\n :type high: int\n :type k: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def numberOfBeautifulIntegers(self, low: int, high: int, k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int numberOfBeautifulIntegers(int low, int high, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int NumberOfBeautifulIntegers(int low, int high, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} low\n * @param {number} high\n * @param {number} k\n * @return {number}\n */\nvar numberOfBeautifulIntegers = function(low, high, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} low\n# @param {Integer} high\n# @param {Integer} k\n# @return {Integer}\ndef number_of_beautiful_integers(low, high, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func numberOfBeautifulIntegers(_ low: Int, _ high: Int, _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func numberOfBeautifulIntegers(low int, high int, k int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def numberOfBeautifulIntegers(low: Int, high: Int, k: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun numberOfBeautifulIntegers(low: Int, high: Int, k: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn number_of_beautiful_integers(low: i32, high: i32, k: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $low\n * @param Integer $high\n * @param Integer $k\n * @return Integer\n */\n function numberOfBeautifulIntegers($low, $high, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function numberOfBeautifulIntegers(low: number, high: number, k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (number-of-beautiful-integers low high k)\n (-> exact-integer? exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec number_of_beautiful_integers(Low :: integer(), High :: integer(), K :: integer()) -> integer().\nnumber_of_beautiful_integers(Low, High, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec number_of_beautiful_integers(low :: integer, high :: integer, k :: integer) :: integer\n def number_of_beautiful_integers(low, high, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int numberOfBeautifulIntegers(int low, int high, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"26.6K\", \"totalAcceptedRaw\": 3117, \"totalSubmissionRaw\": 26586, \"acRate\": \"11.7%\"}", + "hints": [ + "
The intended solution uses Dynamic Programming.
", + "
Let f(n) denote number of beautiful integers in the range [1…n] , then the answer is f(r) - f(l-1) .
" + ], + "solution": null, + "status": null, + "sampleTestCase": "10\n20\n3", + "metaData": "{\n \"name\": \"numberOfBeautifulIntegers\",\n \"params\": [\n {\n \"name\": \"low\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"high\"\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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/sorting-three-groups.json b/leetcode/originData/sorting-three-groups.json new file mode 100644 index 00000000..31a8bc95 --- /dev/null +++ b/leetcode/originData/sorting-three-groups.json @@ -0,0 +1,162 @@ +{ + "data": { + "question": { + "questionId": "2904", + "questionFrontendId": "2826", + "boundTopicId": null, + "title": "Sorting Three Groups", + "titleSlug": "sorting-three-groups", + "content": "

You are given a 0-indexed integer array nums of length n.
\n
\nThe numbers from 0 to n - 1 are divided into three groups numbered from 1 to 3, where number i belongs to group nums[i]. Notice that some groups may be empty.
\n
\nYou are allowed to perform this operation any number of times:

\n\n
    \n\t
  • Pick number x and change its group. More formally, change nums[x] to any number from 1 to 3.
  • \n
\n\n

A new array res is constructed using the following procedure:

\n\n
    \n\t
  1. Sort the numbers in each group independently.
  2. \n\t
  3. Append the elements of groups 1, 2, and 3 to res in this order.
  4. \n
\n\n

Array nums is called a beautiful array if the constructed array res is sorted in non-decreasing order.

\n\n

Return the minimum number of operations to make nums a beautiful array.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [2,1,3,2,1]\nOutput: 3\nExplanation: It's optimal to perform three operations:\n1. change nums[0] to 1.\n2. change nums[2] to 1.\n3. change nums[3] to 1.\nAfter performing the operations and sorting the numbers in each group, group 1 becomes equal to [0,1,2,3,4] and group 2 and group 3 become empty. Hence, res is equal to [0,1,2,3,4] which is sorted in non-decreasing order.\nIt can be proven that there is no valid sequence of less than three operations.\n
\n\n

Example 2:

\n\n
\nInput: nums = [1,3,2,1,3,3]\nOutput: 2\nExplanation: It's optimal to perform two operations:\n1. change nums[1] to 1.\n2. change nums[2] to 1.\nAfter performing the operations and sorting the numbers in each group, group 1 becomes equal to [0,1,2,3], group 2 becomes empty, and group 3 becomes equal to [4,5]. Hence, res is equal to [0,1,2,3,4,5] which is sorted in non-decreasing order.\nIt can be proven that there is no valid sequence of less than two operations.\n
\n\n

Example 3:

\n\n
\nInput: nums = [2,2,2,2,3,3]\nOutput: 0\nExplanation: It's optimal to not perform operations.\nAfter sorting the numbers in each group, group 1 becomes empty, group 2 becomes equal to [0,1,2,3] and group 3 becomes equal to [4,5]. Hence, res is equal to [0,1,2,3,4,5] which is sorted in non-decreasing order.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 100
  • \n\t
  • 1 <= nums[i] <= 3
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 178, + "dislikes": 55, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[2,1,3,2,1]\n[1,3,2,1,3,3]\n[2,2,2,2,3,3]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minimumOperations(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumOperations(List nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumOperations(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumOperations(self, nums: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "int minimumOperations(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumOperations(IList nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar minimumOperations = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef minimum_operations(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumOperations(_ nums: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumOperations(nums []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumOperations(nums: List[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumOperations(nums: List): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_operations(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 minimumOperations($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumOperations(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-operations nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_operations(Nums :: [integer()]) -> integer().\nminimum_operations(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_operations(nums :: [integer]) :: integer\n def minimum_operations(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Dart", + "langSlug": "dart", + "code": "class Solution {\n int minimumOperations(List nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"30.7K\", \"totalAcceptedRaw\": 11393, \"totalSubmissionRaw\": 30683, \"acRate\": \"37.1%\"}", + "hints": [ + "The problem asks to change the array nums to make it sorted (i.e., all the 1s are on the left of 2s, and all the 2s are on the left of 3s.).", + "We can try all the possibilities to make nums indices range in [0, i) to 0 and [i, j) to 1 and [j, n) to 2. Note the ranges are left-close and right-open; each might be empty. Namely, 0 <= i <= j <= n.", + "Count the changes we need for each possibility by comparing the expected and original values at each index position." + ], + "solution": null, + "status": null, + "sampleTestCase": "[2,1,3,2,1]", + "metaData": "{\n \"name\": \"minimumOperations\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"list\"\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++ 20 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.18

\\r\\n

Support https://godoc.org/github.com/emirpasic/gods@v1.18.1 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 5.1.6, Node.js 16.13.2.

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

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

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

lodash.js library is included by default.

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

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 25.0\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.4 with Erlang/OTP 25.0\"], \"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/apply-operations-to-maximize-score.html b/leetcode/problem/apply-operations-to-maximize-score.html new file mode 100644 index 00000000..1797c2d1 --- /dev/null +++ b/leetcode/problem/apply-operations-to-maximize-score.html @@ -0,0 +1,49 @@ +

You are given an array nums of n positive integers and an integer k.

+ +

Initially, you start with a score of 1. You have to maximize your score by applying the following operation at most k times:

+ +
    +
  • Choose any non-empty subarray nums[l, ..., r] that you haven't chosen previously.
  • +
  • Choose an element x of nums[l, ..., r] with the highest prime score. If multiple such elements exist, choose the one with the smallest index.
  • +
  • Multiply your score by x.
  • +
+ +

Here, nums[l, ..., r] denotes the subarray of nums starting at index l and ending at the index r, both ends being inclusive.

+ +

The prime score of an integer x is equal to the number of distinct prime factors of x. For example, the prime score of 300 is 3 since 300 = 2 * 2 * 3 * 5 * 5.

+ +

Return the maximum possible score after applying at most k operations.

+ +

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

+ +

 

+

Example 1:

+ +
+Input: nums = [8,3,9,3,8], k = 2
+Output: 81
+Explanation: To get a score of 81, we can apply the following operations:
+- Choose subarray nums[2, ..., 2]. nums[2] is the only element in this subarray. Hence, we multiply the score by nums[2]. The score becomes 1 * 9 = 9.
+- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 1, but nums[2] has the smaller index. Hence, we multiply the score by nums[2]. The score becomes 9 * 9 = 81.
+It can be proven that 81 is the highest score one can obtain.
+ +

Example 2:

+ +
+Input: nums = [19,12,14,6,10,18], k = 3
+Output: 4788
+Explanation: To get a score of 4788, we can apply the following operations: 
+- Choose subarray nums[0, ..., 0]. nums[0] is the only element in this subarray. Hence, we multiply the score by nums[0]. The score becomes 1 * 19 = 19.
+- Choose subarray nums[5, ..., 5]. nums[5] is the only element in this subarray. Hence, we multiply the score by nums[5]. The score becomes 19 * 18 = 342.
+- Choose subarray nums[2, ..., 3]. Both nums[2] and nums[3] have a prime score of 2, but nums[2] has the smaller index. Hence, we multipy the score by nums[2]. The score becomes 342 * 14 = 4788.
+It can be proven that 4788 is the highest score one can obtain.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length == n <= 105
  • +
  • 1 <= nums[i] <= 105
  • +
  • 1 <= k <= min(n * (n + 1) / 2, 109)
  • +
diff --git a/leetcode/problem/check-if-a-string-is-an-acronym-of-words.html b/leetcode/problem/check-if-a-string-is-an-acronym-of-words.html new file mode 100644 index 00000000..f6745f58 --- /dev/null +++ b/leetcode/problem/check-if-a-string-is-an-acronym-of-words.html @@ -0,0 +1,43 @@ +

Given an array of strings words and a string s, determine if s is an acronym of words.

+ +

The string s is considered an acronym of words if it can be formed by concatenating the first character of each string in words in order. For example, "ab" can be formed from ["apple", "banana"], but it can't be formed from ["bear", "aardvark"].

+ +

Return true if s is an acronym of words, and false otherwise.

+ +

 

+

Example 1:

+ +
+Input: words = ["alice","bob","charlie"], s = "abc"
+Output: true
+Explanation: The first character in the words "alice", "bob", and "charlie" are 'a', 'b', and 'c', respectively. Hence, s = "abc" is the acronym. 
+
+ +

Example 2:

+ +
+Input: words = ["an","apple"], s = "a"
+Output: false
+Explanation: The first character in the words "an" and "apple" are 'a' and 'a', respectively. 
+The acronym formed by concatenating these characters is "aa". 
+Hence, s = "a" is not the acronym.
+
+ +

Example 3:

+ +
+Input: words = ["never","gonna","give","up","on","you"], s = "ngguoy"
+Output: true
+Explanation: By concatenating the first character of the words in the array, we get the string "ngguoy". 
+Hence, s = "ngguoy" is the acronym.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= words.length <= 100
  • +
  • 1 <= words[i].length <= 10
  • +
  • 1 <= s.length <= 100
  • +
  • words[i] and s consist of lowercase English letters.
  • +
diff --git a/leetcode/problem/count-pairs-whose-sum-is-less-than-target.html b/leetcode/problem/count-pairs-whose-sum-is-less-than-target.html new file mode 100644 index 00000000..ec1fc10a --- /dev/null +++ b/leetcode/problem/count-pairs-whose-sum-is-less-than-target.html @@ -0,0 +1,39 @@ +Given a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] < target. +

 

+

Example 1:

+ +
+Input: nums = [-1,1,2,3,1], target = 2
+Output: 3
+Explanation: There are 3 pairs of indices that satisfy the conditions in the statement:
+- (0, 1) since 0 < 1 and nums[0] + nums[1] = 0 < target
+- (0, 2) since 0 < 2 and nums[0] + nums[2] = 1 < target 
+- (0, 4) since 0 < 4 and nums[0] + nums[4] = 0 < target
+Note that (0, 3) is not counted since nums[0] + nums[3] is not strictly less than the target.
+
+ +

Example 2:

+ +
+Input: nums = [-6,2,5,-2,-7,-1,3], target = -2
+Output: 10
+Explanation: There are 10 pairs of indices that satisfy the conditions in the statement:
+- (0, 1) since 0 < 1 and nums[0] + nums[1] = -4 < target
+- (0, 3) since 0 < 3 and nums[0] + nums[3] = -8 < target
+- (0, 4) since 0 < 4 and nums[0] + nums[4] = -13 < target
+- (0, 5) since 0 < 5 and nums[0] + nums[5] = -7 < target
+- (0, 6) since 0 < 6 and nums[0] + nums[6] = -3 < target
+- (1, 4) since 1 < 4 and nums[1] + nums[4] = -5 < target
+- (3, 4) since 3 < 4 and nums[3] + nums[4] = -9 < target
+- (3, 5) since 3 < 5 and nums[3] + nums[5] = -3 < target
+- (4, 5) since 4 < 5 and nums[4] + nums[5] = -8 < target
+- (4, 6) since 4 < 6 and nums[4] + nums[6] = -4 < target
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length == n <= 50
  • +
  • -50 <= nums[i], target <= 50
  • +
diff --git a/leetcode/problem/determine-the-minimum-sum-of-a-k-avoiding-array.html b/leetcode/problem/determine-the-minimum-sum-of-a-k-avoiding-array.html new file mode 100644 index 00000000..a31d8716 --- /dev/null +++ b/leetcode/problem/determine-the-minimum-sum-of-a-k-avoiding-array.html @@ -0,0 +1,31 @@ +

You are given two integers, n and k.

+ +

An array of distinct positive integers is called a k-avoiding array if there does not exist any pair of distinct elements that sum to k.

+ +

Return the minimum possible sum of a k-avoiding array of length n.

+ +

 

+

Example 1:

+ +
+Input: n = 5, k = 4
+Output: 18
+Explanation: Consider the k-avoiding array [1,2,4,5,6], which has a sum of 18.
+It can be proven that there is no k-avoiding array with a sum less than 18.
+
+ +

Example 2:

+ +
+Input: n = 2, k = 6
+Output: 3
+Explanation: We can construct the array [1,2], which has a sum of 3.
+It can be proven that there is no k-avoiding array with a sum less than 3.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n, k <= 50
  • +
diff --git a/leetcode/problem/double-a-number-represented-as-a-linked-list.html b/leetcode/problem/double-a-number-represented-as-a-linked-list.html new file mode 100644 index 00000000..dca28657 --- /dev/null +++ b/leetcode/problem/double-a-number-represented-as-a-linked-list.html @@ -0,0 +1,29 @@ +

You are given the head of a non-empty linked list representing a non-negative integer without leading zeroes.

+ +

Return the head of the linked list after doubling it.

+ +

 

+

Example 1:

+ +
+Input: head = [1,8,9]
+Output: [3,7,8]
+Explanation: The figure above corresponds to the given linked list which represents the number 189. Hence, the returned linked list represents the number 189 * 2 = 378.
+
+ +

Example 2:

+ +
+Input: head = [9,9,9]
+Output: [1,9,9,8]
+Explanation: The figure above corresponds to the given linked list which represents the number 999. Hence, the returned linked list reprersents the number 999 * 2 = 1998. 
+
+ +

 

+

Constraints:

+ +
    +
  • The number of nodes in the list is in the range [1, 104]
  • +
  • 0 <= Node.val <= 9
  • +
  • The input is generated such that the list represents a number that does not have leading zeros, except the number 0 itself.
  • +
diff --git a/leetcode/problem/find-the-longest-equal-subarray.html b/leetcode/problem/find-the-longest-equal-subarray.html new file mode 100644 index 00000000..670ff7f5 --- /dev/null +++ b/leetcode/problem/find-the-longest-equal-subarray.html @@ -0,0 +1,39 @@ +

You are given a 0-indexed integer array nums and an integer k.

+ +

A subarray is called equal if all of its elements are equal. Note that the empty subarray is an equal subarray.

+ +

Return the length of the longest possible equal subarray after deleting at most k elements from nums.

+ +

A subarray is a contiguous, possibly empty sequence of elements within an array.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,3,2,3,1,3], k = 3
+Output: 3
+Explanation: It's optimal to delete the elements at index 2 and index 4.
+After deleting them, nums becomes equal to [1, 3, 3, 3].
+The longest equal subarray starts at i = 1 and ends at j = 3 with length equal to 3.
+It can be proven that no longer equal subarrays can be created.
+
+ +

Example 2:

+ +
+Input: nums = [1,1,2,2,1,1], k = 2
+Output: 4
+Explanation: It's optimal to delete the elements at index 2 and index 3.
+After deleting them, nums becomes equal to [1, 1, 1, 1].
+The array itself is an equal subarray, so the answer is 4.
+It can be proven that no longer equal subarrays can be created.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= nums.length
  • +
  • 0 <= k <= nums.length
  • +
diff --git a/leetcode/problem/make-string-a-subsequence-using-cyclic-increments.html b/leetcode/problem/make-string-a-subsequence-using-cyclic-increments.html new file mode 100644 index 00000000..1a37c123 --- /dev/null +++ b/leetcode/problem/make-string-a-subsequence-using-cyclic-increments.html @@ -0,0 +1,44 @@ +

You are given two 0-indexed strings str1 and str2.

+ +

In an operation, you select a set of indices in str1, and for each index i in the set, increment str1[i] to the next character cyclically. That is 'a' becomes 'b', 'b' becomes 'c', and so on, and 'z' becomes 'a'.

+ +

Return true if it is possible to make str2 a subsequence of str1 by performing the operation at most once, and false otherwise.

+ +

Note: A subsequence of a string is a new string that is formed from the original string by deleting some (possibly none) of the characters without disturbing the relative positions of the remaining characters.

+ +

 

+

Example 1:

+ +
+Input: str1 = "abc", str2 = "ad"
+Output: true
+Explanation: Select index 2 in str1.
+Increment str1[2] to become 'd'. 
+Hence, str1 becomes "abd" and str2 is now a subsequence. Therefore, true is returned.
+ +

Example 2:

+ +
+Input: str1 = "zc", str2 = "ad"
+Output: true
+Explanation: Select indices 0 and 1 in str1. 
+Increment str1[0] to become 'a'. 
+Increment str1[1] to become 'd'. 
+Hence, str1 becomes "ad" and str2 is now a subsequence. Therefore, true is returned.
+ +

Example 3:

+ +
+Input: str1 = "ab", str2 = "d"
+Output: false
+Explanation: In this example, it can be shown that it is impossible to make str2 a subsequence of str1 using the operation at most once. 
+Therefore, false is returned.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= str1.length <= 105
  • +
  • 1 <= str2.length <= 105
  • +
  • str1 and str2 consist of only lowercase English letters.
  • +
diff --git a/leetcode/problem/max-pair-sum-in-an-array.html b/leetcode/problem/max-pair-sum-in-an-array.html new file mode 100644 index 00000000..eff2c316 --- /dev/null +++ b/leetcode/problem/max-pair-sum-in-an-array.html @@ -0,0 +1,30 @@ +

You are given a 0-indexed integer array nums. You have to find the maximum sum of a pair of numbers from nums such that the maximum digit in both numbers are equal.

+ +

Return the maximum sum or -1 if no such pair exists.

+ +

 

+

Example 1:

+ +
+Input: nums = [51,71,17,24,42]
+Output: 88
+Explanation: 
+For i = 1 and j = 2, nums[i] and nums[j] have equal maximum digits with a pair sum of 71 + 17 = 88. 
+For i = 3 and j = 4, nums[i] and nums[j] have equal maximum digits with a pair sum of 24 + 42 = 66.
+It can be shown that there are no other pairs with equal maximum digits, so the answer is 88.
+ +

Example 2:

+ +
+Input: nums = [1,2,3,4]
+Output: -1
+Explanation: No pair exists in nums with equal maximum digits.
+
+ +

 

+

Constraints:

+ +
    +
  • 2 <= nums.length <= 100
  • +
  • 1 <= nums[i] <= 104
  • +
diff --git a/leetcode/problem/maximize-the-profit-as-the-salesman.html b/leetcode/problem/maximize-the-profit-as-the-salesman.html new file mode 100644 index 00000000..ba528ade --- /dev/null +++ b/leetcode/problem/maximize-the-profit-as-the-salesman.html @@ -0,0 +1,41 @@ +

You are given an integer n representing the number of houses on a number line, numbered from 0 to n - 1.

+ +

Additionally, you are given a 2D integer array offers where offers[i] = [starti, endi, goldi], indicating that ith buyer wants to buy all the houses from starti to endi for goldi amount of gold.

+ +

As a salesman, your goal is to maximize your earnings by strategically selecting and selling houses to buyers.

+ +

Return the maximum amount of gold you can earn.

+ +

Note that different buyers can't buy the same house, and some houses may remain unsold.

+ +

 

+

Example 1:

+ +
+Input: n = 5, offers = [[0,0,1],[0,2,2],[1,3,2]]
+Output: 3
+Explanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.
+We sell houses in the range [0,0] to 1st buyer for 1 gold and houses in the range [1,3] to 3rd buyer for 2 golds.
+It can be proven that 3 is the maximum amount of gold we can achieve.
+
+ +

Example 2:

+ +
+Input: n = 5, offers = [[0,0,1],[0,2,10],[1,3,2]]
+Output: 10
+Explanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.
+We sell houses in the range [0,2] to 2nd buyer for 10 golds.
+It can be proven that 10 is the maximum amount of gold we can achieve.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
  • +
  • 1 <= offers.length <= 105
  • +
  • offers[i].length == 3
  • +
  • 0 <= starti <= endi <= n - 1
  • +
  • 1 <= goldi <= 103
  • +
diff --git a/leetcode/problem/minimum-absolute-difference-between-elements-with-constraint.html b/leetcode/problem/minimum-absolute-difference-between-elements-with-constraint.html new file mode 100644 index 00000000..54d09fc3 --- /dev/null +++ b/leetcode/problem/minimum-absolute-difference-between-elements-with-constraint.html @@ -0,0 +1,47 @@ +

You are given a 0-indexed integer array nums and an integer x.

+ +

Find the minimum absolute difference between two elements in the array that are at least x indices apart.

+ +

In other words, find two indices i and j such that abs(i - j) >= x and abs(nums[i] - nums[j]) is minimized.

+ +

Return an integer denoting the minimum absolute difference between two elements that are at least x indices apart.

+ +

 

+

Example 1:

+ +
+Input: nums = [4,3,2,4], x = 2
+Output: 0
+Explanation: We can select nums[0] = 4 and nums[3] = 4. 
+They are at least 2 indices apart, and their absolute difference is the minimum, 0. 
+It can be shown that 0 is the optimal answer.
+
+ +

Example 2:

+ +
+Input: nums = [5,3,2,10,15], x = 1
+Output: 1
+Explanation: We can select nums[1] = 3 and nums[2] = 2.
+They are at least 1 index apart, and their absolute difference is the minimum, 1.
+It can be shown that 1 is the optimal answer.
+
+ +

Example 3:

+ +
+Input: nums = [1,2,3,4], x = 3
+Output: 3
+Explanation: We can select nums[0] = 1 and nums[3] = 4.
+They are at least 3 indices apart, and their absolute difference is the minimum, 3.
+It can be shown that 3 is the optimal answer.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 1 <= nums[i] <= 109
  • +
  • 0 <= x < nums.length
  • +
diff --git a/leetcode/problem/number-of-beautiful-integers-in-the-range.html b/leetcode/problem/number-of-beautiful-integers-in-the-range.html new file mode 100644 index 00000000..9f0ff0b1 --- /dev/null +++ b/leetcode/problem/number-of-beautiful-integers-in-the-range.html @@ -0,0 +1,52 @@ +

You are given positive integers low, high, and k.

+ +

A number is beautiful if it meets both of the following conditions:

+ +
    +
  • The count of even digits in the number is equal to the count of odd digits.
  • +
  • The number is divisible by k.
  • +
+ +

Return the number of beautiful integers in the range [low, high].

+ +

 

+

Example 1:

+ +
+Input: low = 10, high = 20, k = 3
+Output: 2
+Explanation: There are 2 beautiful integers in the given range: [12,18]. 
+- 12 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 3.
+- 18 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 3.
+Additionally we can see that:
+- 16 is not beautiful because it is not divisible by k = 3.
+- 15 is not beautiful because it does not contain equal counts even and odd digits.
+It can be shown that there are only 2 beautiful integers in the given range.
+
+ +

Example 2:

+ +
+Input: low = 1, high = 10, k = 1
+Output: 1
+Explanation: There is 1 beautiful integer in the given range: [10].
+- 10 is beautiful because it contains 1 odd digit and 1 even digit, and is divisible by k = 1.
+It can be shown that there is only 1 beautiful integer in the given range.
+
+ +

Example 3:

+ +
+Input: low = 5, high = 5, k = 2
+Output: 0
+Explanation: There are 0 beautiful integers in the given range.
+- 5 is not beautiful because it is not divisible by k = 2 and it does not contain equal even and odd digits.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 < low <= high <= 109
  • +
  • 0 < k <= 20
  • +
diff --git a/leetcode/problem/sorting-three-groups.html b/leetcode/problem/sorting-three-groups.html new file mode 100644 index 00000000..e8f55487 --- /dev/null +++ b/leetcode/problem/sorting-three-groups.html @@ -0,0 +1,63 @@ +

You are given a 0-indexed integer array nums of length n.
+
+The numbers from 0 to n - 1 are divided into three groups numbered from 1 to 3, where number i belongs to group nums[i]. Notice that some groups may be empty.
+
+You are allowed to perform this operation any number of times:

+ +
    +
  • Pick number x and change its group. More formally, change nums[x] to any number from 1 to 3.
  • +
+ +

A new array res is constructed using the following procedure:

+ +
    +
  1. Sort the numbers in each group independently.
  2. +
  3. Append the elements of groups 1, 2, and 3 to res in this order.
  4. +
+ +

Array nums is called a beautiful array if the constructed array res is sorted in non-decreasing order.

+ +

Return the minimum number of operations to make nums a beautiful array.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,1,3,2,1]
+Output: 3
+Explanation: It's optimal to perform three operations:
+1. change nums[0] to 1.
+2. change nums[2] to 1.
+3. change nums[3] to 1.
+After performing the operations and sorting the numbers in each group, group 1 becomes equal to [0,1,2,3,4] and group 2 and group 3 become empty. Hence, res is equal to [0,1,2,3,4] which is sorted in non-decreasing order.
+It can be proven that there is no valid sequence of less than three operations.
+
+ +

Example 2:

+ +
+Input: nums = [1,3,2,1,3,3]
+Output: 2
+Explanation: It's optimal to perform two operations:
+1. change nums[1] to 1.
+2. change nums[2] to 1.
+After performing the operations and sorting the numbers in each group, group 1 becomes equal to [0,1,2,3], group 2 becomes empty, and group 3 becomes equal to [4,5]. Hence, res is equal to [0,1,2,3,4,5] which is sorted in non-decreasing order.
+It can be proven that there is no valid sequence of less than two operations.
+
+ +

Example 3:

+ +
+Input: nums = [2,2,2,2,3,3]
+Output: 0
+Explanation: It's optimal to not perform operations.
+After sorting the numbers in each group, group 1 becomes empty, group 2 becomes equal to [0,1,2,3] and group 3 becomes equal to [4,5]. Hence, res is equal to [0,1,2,3,4,5] which is sorted in non-decreasing order.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 100
  • +
  • 1 <= nums[i] <= 3
  • +